检索结果-内蒙古大学图书馆

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

78,666 篇 会议
4,246 篇 期刊文献

馆藏范围

82,912 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

17,584 篇 工学
- 6,921 篇 计算机科学与技术...
- 6,726 篇 电气工程
- 2,973 篇 信息与通信工程
- 2,679 篇 控制科学与工程
- 2,468 篇 软件工程
- 1,634 篇 电子科学与技术（可...
- 1,499 篇 仪器科学与技术
- 1,415 篇 机械工程
- 245 篇 航空宇航科学与技...
- 234 篇 生物医学工程（可授...
- 201 篇 网络空间安全
- 195 篇 交通运输工程
- 140 篇 测绘科学与技术
- 131 篇 生物工程
- 95 篇 材料科学与工程（可...
- 91 篇 动力工程及工程热...
- 81 篇 核科学与技术
- 69 篇 光学工程
1,902 篇 理学
- 955 篇 系统科学
- 511 篇 物理学
- 199 篇 数学
- 153 篇 生物学
- 79 篇 地球物理学
1,749 篇 管理学
- 1,685 篇 管理科学与工程(可...
505 篇 文学
- 505 篇 新闻传播学
246 篇 医学
- 180 篇 临床医学
140 篇 农学
- 100 篇 作物学
71 篇 艺术学
- 71 篇 设计学（可授艺术学...
55 篇 教育学
- 54 篇 教育学
51 篇 军事学
- 51 篇 军队指挥学
36 篇 经济学
7 篇 法学

主题

82,912 篇 algorithm design...
5,904 篇 clustering algor...
5,302 篇 heuristic algori...
5,275 篇 computer science
5,158 篇 optimization
4,673 篇 signal processin...
4,542 篇 hardware
4,068 篇 genetic algorith...
3,995 篇 computational mo...
3,979 篇 convergence
3,961 篇 performance anal...
3,639 篇 data mining
3,580 篇 mathematical mod...
3,389 篇 testing
3,249 篇 routing
2,985 篇 educational inst...
2,977 篇 robustness
2,967 篇 equations
2,957 篇 partitioning alg...
2,870 篇 delay

机构

90 篇 ibm thomas j. wa...
76 篇 department of el...
72 篇 school of comput...
51 篇 department of el...
49 篇 state key labora...
49 篇 school of electr...
46 篇 tsinghua univers...
45 篇 institute for in...
45 篇 school of electr...
44 篇 school of comput...
42 篇 school of comput...
40 篇 school of inform...
38 篇 department of el...
38 篇 department of co...
36 篇 institute of inf...
35 篇 department of co...
35 篇 department of co...
33 篇 department of el...
33 篇 department of el...
32 篇 department of co...

作者

88 篇 lei wang
62 篇 yu wang
57 篇 jun zhang
51 篇 jun wang
43 篇 jian wang
40 篇 bin wang
39 篇 hui wang
37 篇 jing zhang
37 篇 li li
33 篇 wei wang
28 篇 qiang zhou
28 篇 slawomir koziel
27 篇 rui wang
26 篇 xi chen
25 篇 min huang
25 篇 wayne luk
23 篇 jie yang
22 篇 hisao ishibuchi
21 篇 feng liu
21 篇 ming chen

语言

81,713 篇 英文
855 篇 其他
337 篇 中文
5 篇 俄文
1 篇 西班牙文
1 篇 斯洛伐克文

检索条件"主题词=algorithm design and analysis"

共 82912 条记录，以下是4991-5000 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

Automatic Detection of Laser-Induced Structures in Live Cell Fluorescent Microscopy Images Using Snakes with Geometric Constraints 23

Automatic Detection of Laser-Induced Structures in Live Cell...

引用

23rd International Conference on Pattern Recognition (ICPR)

作者： Kondrat'ev, Alexandr Yu. Sorokin, Dmitry V. Lomonosov Moscow State Univ Fac Computat Math & Cybernet Lab Math Methods Image Proc Moscow Russia Masaryk Univ Fac Informat Ctr Biomed Image Anal Brno Czech Republic

ISBN: (纸本)9781509048472

The existence of reliable evaluation datasets for cell image registration algorithms is crucial for quantitative comparison of registration approaches. A new technique for creating real live cell image sequences for this purpose was introduced recently. These datasets contain stable structures bleached by argon laser in the cell nucleus. In this work, we propose an approach for automatic detection of laser-induced linear structures in live cell fluorescent microscopy images. Compared to a previous linear laser-induced structure detection approach, our method employs an active contours model with a Hessian-based image energy term for linear structures enhancement and geometric energy term controlling the geometric relations between the structures. It uses position adaptive tension parameter values to adjust the snakes behavior in problematic regions (end points and intersection points) and a temporal consistent scheme where the results from the previous frame are used as an initial approximation for the current frame. Our approach was successfully applied to real live cell microscopy image sequences and an experimental comparison with an existing laser-induced structures detection method based on minimal paths has been performed.

关键词： Microscopy algorithm design and analysis Image sequences Active contours Image registration Bleaching Feature extraction

来源：评论

学校读者我要写书评

暂无评论

Improving Valiant Routing for Slim Fly Networks 46

Improving Valiant Routing for Slim Fly Networks

引用

46th International Conference on Parallel Processing Workshops (ICPPW)

作者： Han, Deyu Wang, Zhaofeng Bunde, David P. Carnegie Mellon Univ Pittsburgh PA 15213 USA Knox Coll Galesburg IL 61401 USA

ISBN: (纸本)9781538610442

Valiant routing, the use of a random intermediate node to distribute network traffic, has been proposed for a number of recent HPC network topologies. It is also commonly used as a bulding block for adaptive routing algorithms, which use shortest path routes when possible, but revert to Valiant routing when necessary to avoid hot spots. We show that the version of Valiant routing proposed for the Slim fly topology can cause messages to follow loops, using an edge in both directions before returning to edges of the original shortest path. Removing these loops in the UGAL-L adaptive routing algorithm is shown to provide slight improvements in average latency and also allow the network to carry up to 12% more traffic before saturation.

关键词： Routing Optical switches Topology Network topology Parallel processing algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

Performance analysis of Packet Scheduling algorithm for Video Service in Downlink LTE

Performance Analysis of Packet Scheduling Algorithm for Vide...

引用

International Conference on Smart Green Technology in Electrical and Information Systems (ICSGTEIS)

作者： Nurcahyani, Ida Mustika, I. Wayan Selo Univ Gadjah Mada Dept Elect Engn & Informat Technol Jalan Grafika 2 Yogyakarta 55281 Indonesia

ISBN: (纸本)9781479961276

Network capacity and congestion in wireless communication cannot be eluded with the development of technology, users, and services;especially with the increasing of real time data services such as video that needs larger capacity and higher Quality of Service (QoS) requisitions. Meanwhile, network resource (bandwidth) available in a communication network as one of the essential components is very limited. The bandwidth usage rule is necessary so that the efficiency of the network while serving active users can be maximized. A scheduling algorithm has an important role in regulating bandwidth allocation in a wireless communication. It is used to distribute the network resource for all active users effectively. This paper provides a study of a wide variety of scheduling techniques used in Long Term Evolution (LTE) downlink data packets to see their performance specially in handling video real time service. Research on various scheduling algorithms used in LTE network is necessary to discover the characteristics of each algorithm. Simulation results show that Frame Level Scheduling (FLS) algorithm performance is better than other PS algorithms simulated in terms of bandwidth, delay, and fairness when serving video packet data service in LTE network.

关键词： Long Term Evolution delays packet radio networks quality of service real-time systems telecommunication scheduling video communication FLS algorithm QoS bandwidth allocation downlink LTE network frame level scheduling algorithm long term evolution network capacity network resource performance analysis real time data services video packet data service wireless communication algorithm design and analysis Delays Scheduling Scheduling algorithms Streaming media Throughput Long Term Evolution Quality of service Scheduling algorithms Web resources CARRIER SYSTEM network capacity algorithm design and analysis bandwidth allocation Streaming Video video communications Packet radio networks real-time systems delay Throughput Local thermodynamic equilibrium

来源：评论

学校读者我要写书评

暂无评论

A Novel Scheme for Adaptive Post Detection Integration with an Improved Azimuth Resolution Performance

A Novel Scheme for Adaptive Post Detection Integration with ...

引用

IEEE Radar Conference (RADAR)

作者： Ahmed, Fathy M. Mil Tech Coll Radar Dept Cairo Egypt

ISBN: (纸本)9781424489022

A new Adaptive Post detection Integration (API) algorithm, designated as Conditioned Adaptive Post detection Integration (C-API), is proposed and analyzed. The proposed C-API algorithm overcomes the problem of azimuth resolution degradation in the traditional API, especially for high signal to noise ratios (SNRs), which has not been exploited in any other literature before. Also it gives a robust performance against asynchronous pulse interference. The proposed C-API calculates an estimate for the SNR at the autocorrelation edges at the output of the integration stage of the API. This estimate is then used as a condition strategy to verify the result of the traditional API output. By doing so, a trimming for the autocorrelation edges at the final output is achieved, especially at high SNRs, leading to a remarkable improvement in azimuth resolution without affecting the detection capability. Computer simulation is provided to validate the superiority of the proposed C-API algorithm against the traditional API and the Adaptive Binary Integrator (ABI).

关键词： algorithm design and analysis Azimuth C-API algorithm Correlation Detectors Interference Radar Signal to noise ratio adaptive binary integrator adaptive post detection integration algorithm adaptive radar asynchronous pulse interference azimuth resolution

来源：评论

学校读者我要写书评

暂无评论

Streaming Bayesian inference: theoretical limits and mini-batch approximate message-passing 55

Streaming Bayesian inference: theoretical limits and mini-ba...

引用

55th Annual Allerton Conference on Communication, Control, and Computing (Allerton)

作者： Manoel, Andre Krzakala, Florent Tramel, Eric W. Zdeborova, Lenka Univ Paris Saclay CEA Neurospin Paris France UPMC PSL CNRS LPS ENS Paris France Sorbonne Univ Paris France OWKIN France Paris France Univ Paris Saclay CEA CNRS IPhT Paris France

ISBN: (纸本)9781538632666

In statistical learning for real-world large-scale data problems, one must often resort to "streaming" algorithms which operate sequentially on small batches of data. In this work, we present an analysis of the information-theoretic limits of mini-batch inference in the context of generalized linear models and low-rank matrix factorization. In a controlled Bayes-optimal setting, we characterize the optimal performance and phase transitions as a function of mini-batch size. We base part of our results on a detailed analysis of a mini-batch version of the approximate message-passing algorithm (Mini-AMP), which we introduce. Additionally, we show that this theoretical optimality carries over into real-data problems by illustrating that Mini-AMP is competitive with standard streaming algorithms for clustering.

关键词： Computational modeling Inference algorithms algorithm design and analysis Analytical models Approximation algorithms Sparse matrices Mutual information

来源：评论

学校读者我要写书评

暂无评论

TOWARDS SOLVING MASSIVE REGRESSION PROBLEMS: LEAST SQUARES MULTISPLITTING

TOWARDS SOLVING MASSIVE REGRESSION PROBLEMS: LEAST SQUARES M...

引用

IEEE International Instrumentation and Measurement Technology Conference (I2MTC)

作者： Inghelbrecht, Gilles Barbe, Kurt Vrije Univ Brussel Dept Math DWIS Res Grp Digital Math DIMA Pl Laan 2 B-1050 Brussels Belgium

ISBN: (纸本)9781509035960

Indirect measurements of physical parameters of interest often require a mathematical model in which these parameters are estimated accordingly to the gathered measurements. Within the Least Squares estimation, the parameters are estimated through a regression problem. The presence of dynamics, multiple sensors and high sampling rates lead to high dimensional regression matrices. This paper deals with solving such massive regression problems efficiently. We revisit Renaut's Least Squares Multisplitting (LSMS) technique aimed at solving the ordinary least squares problem in parallel. The LSMS decomposes the design matrix column-wise into several (possibly overlapping) blocks. The global least squares solution is subsequently replaced by an equivalent set of local least squares problems which are to be solved in parallel. At every iteration step the local solutions are recombined using an appropriate weighting scheme. This allows for a scalable and highly parallel implementation aimed at distributed systems. We study how to decompose the global estimation problem in smaller subproblems and quantify the effects of various possible partitions. The method is illustrated with dedicated numerical simulations and a toy application in the area of sensor fusion.

关键词： Convergence Estimation Mathematical model algorithm design and analysis Matrix decomposition Complexity theory Real-time systems

来源：评论

学校读者我要写书评

暂无评论

A novel Information Entropy Shift based image retrieval algorithm

A novel Information Entropy Shift based image retrieval algo...

引用

4th International Conference on Intelligent Information Hiding and Multimedia Signal Processing

作者： Yan, Wang Jia Kebin Beijing Univ Technol Coll Elect Informat & Control Engn Beijing 100022 Peoples R China

ISBN: (纸本)9780769532783

In order to solve the problem of content-based image retrieval, this paper defines a new concept of Information Entropy Shift, and proposes a novel image retrieval algorithm based on it. The Information Entropy Shift is defined as the changes of Information Entropy in one direction;it not only describes the statistical feature of an image, but also reflects the spatial Information distribution. On the basis of this concept, this paper presents a new dynamic margin matching algorithm. In this algorithm, the matching problem of information entropy shift sequence is transformed to the matching of the characteristic curve of a binary function;the trend of curve changes is used as the feature to match. Besides, the template matching algorithm in audio processing is referred to deal with the problem too. Experimental results show that the new algorithm has the advantage of high efficiency and is robust to image resizing and translation.

关键词： Information entropy Heuristic algorithms Image color analysis Image retrieval Histograms algorithm design and analysis Signal processing algorithms

来源：评论

学校读者我要写书评

暂无评论

An algorithm for Enduing and Identifying the Information of Topological Entities in 3D Graphics 2

An Algorithm for Enduing and Identifying the Information of ...

引用

2017 IEEE 第2届先进信息技术,电子与自动化控制国际会议(IAEAC 2017)

作者： Qiujiao Wang School of Mathematics Southwest Jiaotong University

Feature-based modeling is very popular in generating the shape and history of a product in a three-dimensional(3 D) CAD system. In the previous studies, features are the basic unit of the models. It o

ISBN: (纸本)9781467389808

关键词： Solid modeling Feature extraction Manifolds Three-dimensional displays Flanges algorithm design and analysis Databases

来源：评论

学校读者我要写书评

暂无评论

Density based Clustering over Location Based Services 33

Density based Clustering over Location Based Services

引用

IEEE 33rd International Conference on Data Engineering (ICDE)

作者： Rahman, Md Farhadur Liu, Weimo Bin Suhaim, Saad Thirumuruganathan, Saravanan Zhang, Nan Das, Gautam Univ Texas Arlington Arlington TX 76019 USA HBKU QCRI Doha Qatar George Washington Univ Washington DC 20052 USA

ISBN: (纸本)9781509065431

Location Based Services (LBS) have become extremely popular over the past decade, being used on a daily basis by millions of users. Instances of real-world LBS range from mapping services (e.g., Google Maps) to lifestyle recommendations (e.g., Yelp) to real-estate search (e.g., Redfin). In general, an LBS provides a public (often web-based) search interface over its backend database (of tuples with 2D geolocations), taking as input a 2D query point and returning k tuples in the database that are closest to the query point, where k is usually a small constant such as 20 or 50. Such a public interface is often called a k-Nearest-Neighbor, i.e., kNN, interface. In this paper, we consider a novel problem of enabling density based clustering over the backend database of an LBS using nothing but limited access to the kNN interface provided by the LBS. Specifically, a key limit enforced by most real-world LBS is a maximum number of kNN queries allowed from a user over a given time period. Since such a limit is often orders of magnitude smaller than the number of tuples in the LBS database, our goal here is to mine from the LBS a cluster assignment function f(center dot), such that for any tuple t in the database (which may or may not have been accessed), f(center dot) can produce the cluster assignment of t with high accuracy. We conduct a comprehensive set of experiments over benchmark datasets and popular real-world LBS such as Yahoo! Flickr, Zillow, Redfin and Google Maps and demonstrate the effectiveness of our proposed techniques.

关键词： Clustering algorithms Two dimensional displays Google algorithm design and analysis Spatial databases Data mining

来源：评论

学校读者我要写书评

暂无评论

Force-directed scheduling for dynamic power optimization

Force-directed scheduling for dynamic power optimization

引用

IEEE Computer-Society Annual Symposium on VLSI

作者： Gupta, S Katkoori, S Univ S Florida Dept Comp Sci & Engn Tampa FL 33620 USA

ISBN: (纸本)0769514863

We present a latency-constrained scheduling algorithm to optimize a design for dynamic power. Usage of forces to model power is motivated by the force-directed scheduling (FDS) heuristic proposed by Paulin and Knight [1]. Given a data flow graph (DFG) and an input data environment, we profile the DFG with representative data streams. Our algorithm reduces dynamic power by reducing switched capacitance inside resources. The switched capacitance of combinations among DFG operations, which could share a resource, and the probability of selecting such a combination, are evaluated. Switched capacitance inside a module is modeled as the spring constant k and probability of selecting the corresponding combination is modeled as the displacement x, in the force equation F = kx. Thus, a force is associated with each feasible combination corresponding to its power cost. Due to numerous possibilities, we obtain a distribution of forces whose mean, standard deviation, and skew are used to make a power-optimal scheduling decision. Compared to original FDS, our algorithm shows average power savings of 16.4% for the same throughput at the cost of a nominal area overhead.

关键词： algorithm design and analysis Capacitance Costs design optimization Dynamic scheduling Equations Heuristic algorithms Scheduling algorithm Springs Throughput

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共500页 << < 491 492 493 494 495 496 497 498 499 500 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：