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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,668 篇 会议
4,280 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

17,615 篇 工学
- 6,923 篇 计算机科学与技术...
- 6,750 篇 电气工程
- 2,979 篇 信息与通信工程
- 2,680 篇 控制科学与工程
- 2,473 篇 软件工程
- 1,636 篇 电子科学与技术（可...
- 1,501 篇 仪器科学与技术
- 1,415 篇 机械工程
- 247 篇 航空宇航科学与技...
- 235 篇 生物医学工程（可授...
- 202 篇 网络空间安全
- 196 篇 交通运输工程
- 140 篇 测绘科学与技术
- 131 篇 生物工程
- 94 篇 材料科学与工程（可...
- 91 篇 动力工程及工程热...
- 83 篇 核科学与技术
- 69 篇 光学工程
1,906 篇 理学
- 955 篇 系统科学
- 515 篇 物理学
- 199 篇 数学
- 153 篇 生物学
- 79 篇 地球物理学
1,750 篇 管理学
- 1,686 篇 管理科学与工程(可...
505 篇 文学
- 505 篇 新闻传播学
247 篇 医学
- 180 篇 临床医学
140 篇 农学
- 100 篇 作物学
71 篇 艺术学
- 71 篇 设计学（可授艺术学...
55 篇 教育学
- 54 篇 教育学
51 篇 军事学
- 51 篇 军队指挥学
36 篇 经济学
7 篇 法学

主题

82,948 篇 algorithm design...
5,905 篇 clustering algor...
5,302 篇 heuristic algori...
5,277 篇 computer science
5,158 篇 optimization
4,677 篇 signal processin...
4,547 篇 hardware
4,068 篇 genetic algorith...
3,996 篇 computational mo...
3,979 篇 convergence
3,963 篇 performance anal...
3,642 篇 data mining
3,579 篇 mathematical mod...
3,392 篇 testing
3,250 篇 routing
2,986 篇 educational inst...
2,977 篇 robustness
2,964 篇 equations
2,956 篇 partitioning alg...
2,871 篇 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,750 篇 英文
854 篇 其他
337 篇 中文
5 篇 俄文
1 篇 西班牙文
1 篇 斯洛伐克文

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

共 82948 条记录，以下是481-490 订阅

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

详细简洁

排序：

Behaviour-Data Relations Modelling Language For Multi-Robot Control algorithms

Behaviour-Data Relations Modelling Language For Multi-Robot ...

引用

IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)

作者： Pitonakova, Lenka Crowder, Richard Bullock, Seth Univ Southampton Dept Elect & Comp Sci Southampton Hants England Univ Bristol Dept Comp Sci Bristol Avon England

ISBN: (纸本)9781538626825

designing and representing control algorithms is challenging in swarm robotics, where the collective swarm performance depends on interactions between robots and with their environment. The currently available modeling languages, such as UML, cannot fully express these interactions. We therefore propose a new, Behaviour-Data Relations Modeling Language (BDRML), where robot behaviours and data that robots utilise, as well as relationships between them, are explicitly represented. This allows BDRML to express control algorithms where robots cooperate and share information with each other while interacting with the environment.

关键词： Robots Data structures Unified modeling language Visualization algorithm design and analysis Recruitment Data visualization

来源：评论

学校读者我要写书评

暂无评论

Unified Image Retrieval and Keypoint Matching by Local Geometric Consistency and Non-linear Diffusion

Unified Image Retrieval and Keypoint Matching by Local Geome...

引用

IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) / Workshop on Machine Learning Methods for High-Level Cognitive Capabilities in Robotics

作者： Lee, Sehyung Lim, Jongwoo Suh, Il Hong Kyoto Univ Dept Syst Sci Kyoto Japan Hanyang Univ Div Comp Sci & Engn Seoul South Korea Hanyang Univ Dept Elect & Comp Engn Seoul South Korea

ISBN: (纸本)9781538626825

Feature-based image retrieval and feature matching have been used together in many applications, but they have been treated as two separate problems. We propose an unified approach which, for a query image,finds a set of candidate images together with feature matching results. By considering the local geometric consistency of neighboring features, we can find more and better feature matches even in challenging situations. Since the proposed forward/backward matching and non-linear diffusion run very efficiently, they can be used in the candidate image selection and improve the image retrieval performance significantly. Through quantitative comparisons we show that the proposed approach performs better than the recent state-of-the-art feature matching algorithms and image retrieval algorithms.

关键词： Vocabulary Image retrieval Vegetation Feature extraction algorithm design and analysis Visualization

来源：评论

学校读者我要写书评

暂无评论

On Localizing Urban Events with Instagram

On Localizing Urban Events with Instagram

引用

IEEE Conference on Computer Communications (INFOCOM)

作者： Giridhar, Prasanna Wang, Shiguang Abdelzaher, Tarek Ganti, Raghu Kaplan, Lance George, Jemin Univ Illinois Dept Comp Sci Urbana IL 61801 USA IBM Res Yorktown Hts NY USA US Army Res Lab 2800 Powder Mill Rd Adelphi MD 20783 USA

ISBN: (纸本)9781509053360

This paper develops an algorithm that exploits picture-oriented social networks to localize urban events. We choose picture-oriented networks because taking a picture requires physical proximity, thereby revealing the location of the photographed event. Furthermore, most modern cell phones are equipped with GPS, making picture location, and time metadata commonly available. We consider Instagram as the social network of choice and limit ourselves to urban events (noting that the majority of the world population lives in cities). The paper introduces a new adaptive localization algorithm that does not require the user to specify manually tunable parameters. We evaluate the performance of our algorithm for various real-world datasets, comparing it against a few baseline methods. The results show that our method achieves the best recall, the fewest false positives, and the lowest average error in localizing urban events.

关键词： algorithm design and analysis Flickr Twitter Urban areas Event detection Metadata

来源：评论

学校读者我要写书评

暂无评论

A Memetic algorithm for Optimization of Combination Chemotherapy with Dose Adjustment 13

A Memetic Algorithm for Optimization of Combination Chemothe...

引用

13th IEEE International Conference on Automation Science and Engineering (IEEE CASE)

作者： Wang, Peilian Liu, Ran Jiang, Zhibin Shanghai Jiao Tong Univ Dept Ind Engn & Management Shanghai 200240 Peoples R China

ISBN: (纸本)9781509067817

Chemotherapy is recognized as one of the most prominent systemic modalities for cancer treatment. The oncologists combine different chemotherapeutic drugs for patient treatment according to clinical practice guidelines, and adjust the drug dose to reduce its toxicity or to improve its efficasy according to the patient's response. This paper introduces a two-drug cancer chemotherapy model to describe the response of the tumor cells and host cells under drug administration. The objective is to cure the patient as soon as possible while the toxicity is maintained below an allowable limit throughout the entire treatment period. A problem-specific memetic algorithm (MA) is designed in this paper to optimize the combination chemotherapy problem with dose adjustment. The proposed algorithm combines the exploration breadth of evolutionary algorithms and the exploitation depth of local search methods. Computational experiments show that the proposed MA outperforms the existing algorithm in terms of solution quality. The results demonstrate the efficacy of treatment with dose adjustment.

关键词： Drugs Chemotherapy Cancer Tumors algorithm design and analysis Sociology Statistics

来源：评论

学校读者我要写书评

暂无评论

PLUME DETECTION WITH EMPHASIS ON PHENOMENOLOGY, SIGNAL MODELS, AND EXPLOITATION algorithmS 37

PLUME DETECTION WITH EMPHASIS ON PHENOMENOLOGY, SIGNAL MODEL...

引用

IEEE International Geoscience & Remote Sensing Symposium

作者： Truslow, Eric Manolakis, Dimitris MIT Lincoln Lab 244 Wood St Lexington MA 02421 USA

ISBN: (纸本)9781509049516

The remote detection, identification and quantification of chemical vapor plumes in the atmosphere are difficult problems that have been addressed using longwave hyperspectral sensors. Chemical detection algorithms compare the sensor's spectral measurements to a library of known chemical signatures to decide whether or not a plume is present. Detection of the chemical plume is an important step in the processing pipeline, but the main goal of the system is to accurately identify which single chemical or mixture of chemicals is present in the plume. In this paper, we provide the key equations and methods used for chemical detection and identification, system performance evaluation, as well as a comparison of state-of-the-art processing algorithms. We show that a good practical approach is a two-step algorithm design that uses a bank of single-chemical detectors, followed by an identification algorithm that makes a final decision about the chemicals in the plume.

关键词： Chemicals Detectors Libraries Signal processing algorithms algorithm design and analysis Measurement System performance

来源：评论

学校读者我要写书评

暂无评论

Specified-time Consensus for Multi-agent Systems

Specified-time Consensus for Multi-agent Systems

引用

Chinese Automation Congress (CAC)

作者： Zhao, Yu Liu, Yongfang Northwestern Polytech Univ Shenzhen Inst Res & Dev Shenzhen Peoples R China Northwestern Polytech Univ Sch Automat Xian 710072 Shaanxi Peoples R China

ISBN: (纸本)9781538635247

This paper constructs a novel consensus framework for continuous-tune multi-agent systems by using motion planning approaches. In this framework, a novel notion, specified time consensus, is raised. Specified-time consensus means that the consensus of multi-agent systems is achieving with a finite settling time, which can be accurately and arbitrarily pre-specified according to task requirements. In order to achieve specified-time consensus, we firstly focus on asymptotic consensus problems. By using finite-time optimal control approaches, a class of sampled data based consensus algorithms are developed. The sampling periods can he arbitrarily designed according to the requirements of consensus convergence rate, which means that the sampling period of the consensus algorithms is decoupled and independent. Thus, one can design a time-varying sampling sequence that is convergent to a specified settling time. Then, specified-time consensus can he solved under the sampled-data based consensus algorithms with the designed time-varying sampling sequence. Besides, since the sampling periods, communication topologies and control gains are decoupling and can be separately designed in this framework, the specified-time consensus can he solved under directed switching topologies that have a joint spanning tree.

关键词： Multi-agent systems Topology Protocols Network topology Eigenvalues and eigenfunctions algorithm design and analysis Optimal control

来源：评论

学校读者我要写书评

暂无评论

Enhancing the Effectiveness of Traffic Engineering in Hybrid SDN

Enhancing the Effectiveness of Traffic Engineering in Hybrid...

引用

IEEE International Conference on Communications (ICC) / Wireless Communications Symposium / 3rd Workshop on Optical Wireless Communications (OWC)

作者： Wang, Wen He, Wenbo Su, Jinshu McGill Univ Montreal PQ Canada McMaster Univ Hamilton ON Canada Natl Univ Def Technol Changsha Hunan Peoples R China

ISBN: (纸本)9781467389990

A lot of researches exploit the flexibility of Software-Defined Networking (SDN) to conduct traffic engineering in order to improve network performance and enhance robustness to failures. As the upgrade of a traditional network to a full SDN deployment is an incremental process, the coexistence of SDN switches and legacy switches forms a hybrid SDN. Due to the different forwarding characteristics of these switches, it is essential to coordinate the forwarding of SDN control and distributed routing to avoid inconsistency and achieve high network utilization. In this paper, we note that the effectiveness of traffic engineering in hybrid SDN strongly depends on both the structures of forwarding graphs and traffic distribution, while existing approaches mainly focus on the latter. We first define the consistent forwarding graph, and then construct forwarding graphs with potential high throughput for effective traffic engineering, while maintaining forwarding consistency. The evaluation results show that the proposed forwarding graph construction approach improves network throughput and achieves better load balancing compared with existing simple forwarding path constructing approaches, especially with more fraction of SDN deployment.

关键词： Routing Routing protocols Throughput Bandwidth Control systems Linear programming algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

3D MoSURF Hierarchical Learning for Hand Fine-Motion Recognition 10

3D MoSURF Hierarchical Learning for Hand Fine-Motion Recogni...

引用

EEE International Conference on Internet of Things (iThings) and IEEE Green Computing and Communications (GreenCom) and IEEE Cyber, Physical and Social Computing (CPSCom) and IEEE Smart Data (SmartData)

作者： Ming, Yue Beijing Univ Posts & Telecommun Sch Elect Engn Beijing 100876 Peoples R China

ISBN: (纸本)9781538630662

The times of Big Data promotes increasingly higher demands for fine-motion analysis, such as hand activity recognition. However, in real-world scenarios, hand activity recognition suffers huge challenges with variations of illumination, poses and occlusions. The depth acquisition provides an effective way to solve the above issues, and simultaneously increases the computational complexity significantly. In this paper, a novel 3D scale-and rotation-invariant descriptor, called 3D MoSURF, is presented for hand fine-motion analysis, which outperforms previously proposed schemes with respect to robustness and high efficiency for 3D data processing. Hierarchical classification based on content (HCC) is proposed for activity recognition. Experiments based on public available RGB-D datasets show a consistently better performance for real-world applications with fine-motion analysis in terms of high effectiveness and efficiency.

关键词： Three-dimensional displays Feature extraction Adaptive optics Databases Activity recognition Robustness algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

V-Tree: Efficient kNN Search on Moving Objects with Road-Network Constraints 33

V-Tree: Efficient kNN Search on Moving Objects with Road-Net...

引用

IEEE 33rd International Conference on Data Engineering (ICDE)

作者： Shen, Bilong Zhao, Ying Li, Guoliang Zheng, Weimin Qin, Yue Yuan, Bo Rao, Yongming Tsinghua Univ Dept Comp Sci & Technol Beijing Peoples R China Tsinghua Univ Dept Automat Beijing Peoples R China Tsinghua Univ Dept Elect Engn Beijing Peoples R China

ISBN: (纸本)9781509065431

Intelligent transportation systems, e.g., Uber, have become an important tool for urban transportation. An important problem is k nearest neighbor (kNN) search on moving objects with road-network constraints, which, given moving objects on the road networks and a query, finds k nearest objects to the query location. Existing studies focus on either kNN search on static objects or continuous kNN search with Euclidean-distance constraints. The former cannot support dynamic updates of moving objects while the latter cannot support road networks. Since the objects are dynamically moving on the road networks, there are two main challenges. The first is how to index the moving objects on road networks and the second is how to find the k nearest moving objects. To address these challenges, in this paper we proposes a new index, V-Tree, which has two salient features. Firstly, it is a balanced search tree and can support efficient kNN search. Secondly, it can support dynamical updates of moving objects. To build a V-Tree, we iteratively partition the road network into sub-networks and build a tree structure on top of the sub-networks. Then we associate the moving objects on their nearest vertices in the V-Tree. When the location of an object is updated, we only need to update the tree nodes on the path from the corresponding leaf node to the root. We design a novel kNN search algorithm using V-Tree by pruning large numbers of irrelevant vertices in the road network. Experimental results on real datasets show that our method significantly outperforms baseline approaches by 2-3 orders of magnitude.

关键词： Roads Search problems Indexes Tools algorithm design and analysis Complexity theory

来源：评论

学校读者我要写书评

暂无评论

Hierarchical Reversible Logic Synthesis Using LUTs 17

Hierarchical Reversible Logic Synthesis Using LUTs

引用

54th ACM/EDAC/IEEE design Automation Conference (DAC)

作者： Soeken, Mathias Roetteler, Martin Wiebe, Nathan De Micheli, Giovanni Ecole Polytech Fed Lausanne Integrated Syst Lab Lausanne Switzerland Microsoft Res Redmond WA USA

ISBN: (纸本)9781450349277

Today's rapid advances in the physical implementation of quantum computers demand for scalable synthesis methods in order to map practical logic designs to quantum architectures. We present a synthesis algorithm for quantum computing based on k-LUT networks, which can be derived from Verilog netlists using state-of-the-art and off-the-shelf mapping algorithms. We demonstrate the effectiveness of our method in automatically synthesizing several floating point networks up to double precision. As many quantum algorithms target scientific simulation applications, they can make rich use of floating point arithmetic components. But due to the lack of quantum circuit descriptions for those components, it is not possible to find a realistic cost estimation for the algorithms. Our synthesized benchmarks provide cost estimates that allow quantum algorithm designers to provide the first complete cost estimates for a host of quantum algorithms. This is an essential step towards the goal of understanding which quantum algorithms will be practical in the first generations of quantum computers.

关键词： Logic gates Table lookup Quantum computing algorithm design and analysis Computers Adders Libraries

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 45 46 47 48 49 50 51 52 53 54 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：