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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,291 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

17,627 篇 工学
- 6,927 篇 计算机科学与技术...
- 6,762 篇 电气工程
- 2,981 篇 信息与通信工程
- 2,680 篇 控制科学与工程
- 2,477 篇 软件工程
- 1,636 篇 电子科学与技术（可...
- 1,501 篇 仪器科学与技术
- 1,416 篇 机械工程
- 247 篇 航空宇航科学与技...
- 235 篇 生物医学工程（可授...
- 202 篇 网络空间安全
- 196 篇 交通运输工程
- 140 篇 测绘科学与技术
- 131 篇 生物工程
- 95 篇 材料科学与工程（可...
- 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,959 篇 algorithm design...
5,906 篇 clustering algor...
5,302 篇 heuristic algori...
5,277 篇 computer science
5,158 篇 optimization
4,677 篇 signal processin...
4,549 篇 hardware
4,068 篇 genetic algorith...
3,996 篇 computational mo...
3,980 篇 convergence
3,964 篇 performance anal...
3,643 篇 data mining
3,580 篇 mathematical mod...
3,392 篇 testing
3,250 篇 routing
2,987 篇 educational inst...
2,977 篇 robustness
2,964 篇 equations
2,956 篇 partitioning alg...
2,871 篇 delay

机构

90 篇 ibm thomas j. wa...
76 篇 department of el...
71 篇 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,761 篇 英文
854 篇 其他
337 篇 中文
5 篇 俄文
1 篇 西班牙文
1 篇 斯洛伐克文

检索条件"主题词=Algorithm Design And Analysis"

共 82959 条记录，以下是631-640 订阅

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

详细简洁

排序：

Group Marching Tree: Sampling-Based Approximately Optimal Motion Planning on GPUs 1

Group Marching Tree: Sampling-Based Approximately Optimal Mo...

引用

1st IEEE International Conference on Robotic Computing (IRC)

作者： Ichter, Brian Schmerling, Edward Pavone, Marco Stanford Univ Aeronaut & Astronaut Stanford CA 94305 USA Stanford Univ Inst Computat & Math Engn Stanford CA 94305 USA

ISBN: (纸本)9781509067244

This paper presents a novel approach, named the Group Marching Tree (GMT*) algorithm, to planning on GPUs at rates amenable to application within control loops, allowing planning in real-world settings via repeated computation of near-optimal plans. GMT*, like the Fast Marching Tree (FMT*) algorithm, explores the state space with a "lazy" dynamic programming recursion on a set of samples to grow a tree of near-optimal paths. GMT*, however, alters the approach of FMT* with approximate dynamic programming by expanding, in parallel, the group of all active samples with cost below an increasing threshold, rather than only the minimum cost sample. This group approximation enables low-level parallelism over the sample set and removes the need for sequential data structures, while the "lazy" collision checking limits thread divergence-all contributing to a very efficient GPU implementation. While this approach incurs some suboptimality, we prove that GMT* remains asymptotically optimal up to a constant multiplicative factor. We show solutions for complex planning problems under differential constraints can be found in similar to 10 ms on a desktop GPU and similar to 30 ms on an embedded GPU, representing a significant speed up over the state of the art, with only small losses in performance. Finally, we present a scenario demonstrating the efficacy of planning within the control loop (similar to 100 Hz) towards operating in dynamic, uncertain settings.

关键词： Planning Dynamic programming Graphics processing units Heuristic algorithms Parallel processing algorithm design and analysis Trajectory

来源：评论

学校读者我要写书评

暂无评论

Improvement and Implementation of Quine-McCluskey algorithm for Synthesis of Reversible Logic Circuits 2

Improvement and Implementation of Quine-McCluskey Algorithm ...

引用

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

作者： Shuguang Zhao Chaozheng Wang Junling Sun College of Information Science and Technology Donghua University

In order to meet the requirements of the reversible logic synthesis, the Quine-McCluskey algorithm is improved and Implemented in this paper. By analyzing the difference and relation between the "SOP"

ISBN: (纸本)9781467389808

关键词： algorithm design and analysis Logic circuits Logic gates Logic functions Quantum computing Sun Information science

来源：评论

学校读者我要写书评

暂无评论

Guiding Text Image Keypoints Extraction Through Layout analysis 7

Guiding Text Image Keypoints Extraction Through Layout Analy...

引用

14th IAPR International Conference on Document analysis and Recognition (ICDAR)

作者： Royer, E. Bouchara, F. Univ Toulon & Var Aix Marseille Univ CNRS ENSAMLSIS Marseille France

ISBN: (纸本)9781538635865

The rise of the smartphone industry has increased the need for mobile capture of document images and with embedded applications. In the field of image processing, detecting keypoints and computing their associated features is the first step of numerous algorithms. However, keypoints detectors are mostly designed for real world images and usually don't behave well with document images. In this paper, we propose an idea which consists in guiding keypoints extraction by using the document layout information. We compare this approach with the CORE algorithm for confusion reduction, on three classical descriptors. Results show improvements in both matching quality and processing times.

关键词： Feature extraction Layout algorithm design and analysis Detectors Text analysis Mobile communication

来源：评论

学校读者我要写书评

暂无评论

Towards Load-Balanced VNF Assignment in Geo-distributed NFV Infrastructure 25

Towards Load-Balanced VNF Assignment in Geo-distributed NFV ...

引用

25th IEEE/ACM International Symposium on Quality of Service (IWQoS)

作者： Fei, Xincai Liu, Fangming Xu, Hong Jin, Hai Huazhong Univ Sci & Technol Minist Educ Sch Comp Sci & Technol Key Lab Serv Comp Technol & Syst Wuhan Hubei Peoples R China City Univ Hong Kong NetX Lab Hong Kong Hong Kong Peoples R China

ISBN: (纸本)9781538627044

Network functions virtualization (NFV) is increasingly adopted by telecommunications (telecos) service providers for cost savings and flexible management. However, deploying virtual network functions (VNFs) in geo-distributed central offices (COs) is not straightforward. Unlike most existing centralized schemes in clouds, VNFs of a service chain usually need to be deployed in multiple COs due to limited resource capacity and uneven setup cost at various locations. To ensure the Quality of Service of service chains, a key problem for service providers is to determine where a VNF should go, in order to achieve cost-efficiency and load balancing of both computing and bandwidth resources, across all selected COs. To this end, we present a framework of CO Selection (CS) and VNF Assignment (VA) for distributed deployment of NFV. Specifically, we first select a set of COs that minimizes the communication cost among the selected COs. Then, we employ a shadow-routing based approach, which minimizes the maximum of appropriately defined CO utilizations, to jointly solve the VNF-CO and VNF-server assignment problem. Simulations demonstrate the effectiveness of CS algorithm, and asymptotic optimality, scalability and high adaptivity of the VNF assignment approach.

关键词： Bandwidth Servers Load management Quality of service Load modeling algorithm design and analysis Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Boosting Performance of Map Matching algorithms by Parallelization on Graphics Processors 28

Boosting Performance of Map Matching Algorithms by Paralleli...

引用

28th IEEE Intelligent Vehicles Symposium (IV)

作者： Auer, Markus Rehborn, Hubert Molzahn, Sven-Eric Bogenberger, Klaus Daimler AG Res & Dev Bela Barenyi Str D-71059 Sindelfingen Germany Munich Univ Fed Armed Forces Dept Traff Engn Werner Heisenberg Weg 39 D-85577 Neubiberg Germany

ISBN: (纸本)9781509048045

In this paper existing map matching algorithms are combined and modified such, that the resulting algorithm is suitable for the implementation on the graphics processing unit (GPU). The map matching algorithm implemented on GPU consists of a geometrical and topological processing step, which provides high accuracy with high efficiency at the same time. An important building block of the implementation is the parallelization of the R*-tree search. An efficient implementation is achieved by high data parallelism and minimal divergence between execution blocks. The presented map matching algorithm performs better than available open source implementations.

关键词： Roads Global Positioning System Graphics processing units algorithm design and analysis Indexes Kernel Arrays

来源：评论

学校读者我要写书评

暂无评论

A Fully Automated Method for Segmentation and Classification of Local Field Potential Recordings. Preliminary Results 39

A Fully Automated Method for Segmentation and Classification...

引用

39th Annual International Conference of the IEEE-Engineering-in-Medicine-and-Biology-Society (EMBC)

作者： Diaz-Parra, Antonio Canals, Santiago Moratal, David Univ Politecn Valencia Ctr Biomat & Tissue Engn Cami Vera S-N E-46022 Valencia Spain CSIC Inst Neurociencias Sant Joan dAlacant Spain Univ Miguel Hernandez Sant Joan dAlacant Spain

ISBN: (纸本)9781509028092

Identification of brain states measured with electrophysiological methods such as electroencephalography and local field potential (LFP) recordings is of great importance in numerous neuroscientific applications. For instance, in Brain Computer Interface, in the diagnosis of neurological disorders as well as to investigate how brain rhythms stem from synchronized physiological mechanisms (e.g., memory and learning). In this work, we propose a fully automated method with the aim of partitioning LFP signals into stationary segments as well as classifying each detected segment into three different classes (delta, regular theta or irregular theta rhythms). Our approach is computationally efficient since the process of detection and partition of signals into stationary segments is only based on two features (the variance and the so-called spectral error measure) and allow the classification at the same time. We developed the algorithm upon analyzing six anesthetized rats, resulting in a true positive rate of 97.5%, 91.8% and 79.1% in detecting delta, irregular theta and regular theta rhythms, respectively. This preliminary quantitative evaluation offers encouraging results for further research.

关键词： Classification algorithms Oscillators Feature extraction Measurement uncertainty Electric potential Electroencephalography algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

Deep Learning-Bat High-Dimensional Missing Data Estimator

Deep Learning-Bat High-Dimensional Missing Data Estimator

引用

IEEE International Conference on Systems, Man, and Cybernetics (SMC)

作者： Leke, Collins Ndjiongue, A. R. Twala, Bhekisipho Marwala, Tshilidzi Univ Johannesburg Sch Elect & Elect Engn Johannesburg South Africa

ISBN: (纸本)9781538616451

In recent years, several new methods for missing data estimation have been developed. Real world datasets possess the properties of big data being volume, velocity and variety. With an increase in volume which includes sample size and dimensionality, existing imputation methods have become less effective and accurate. Much attention has been given to narrow Artificial Intelligence frameworks courtesy of their efficiency in low dimensional settings. However, with an increase in dimensionality, these methods yield unrepresentative imputations with an impact on decision making processes. Therefore in this paper, we present a new framework for missing data imputation in high dimensional datasets. A Deep Learning technique is used in conjunction with a swarm intelligence algorithm. The performance of the proposed technique was experimentally tested and compared against other existing methods on an off-line dataset. The results obtained have shown promising potential with slightly longer execution times, which are a worthy trade-off when accuracy is of importance.

关键词： Mathematical model Estimation Training Optimization algorithm design and analysis Image reconstruction

来源：评论

学校读者我要写书评

暂无评论

Performance prediction using support vector machine for the configuration of optimization algorithms 3

Performance prediction using support vector machine for the ...

引用

3rd International Conference of Cloud Computing Technologies and Applications (CloudTech)

作者： El Afia, Abdellatif Sarhani, Malek Mohammed V Univ ENSIAS Rabat Morocco

ISBN: (纸本)9781538611159

The aim of this paper is to propose a machine learning approach for predicting the performance of each configuration of optimization algorithms. Our approach consists of advocating making the decision of finding the most suitable configuration on a per-instance analysis based on a supervised machine learning model. That is, it consists of building a support vector machine (SVM) model to predict the performance of each configuration on each instance and then to select the adapted setting depending on the instance. Furthermore, feature selection has been used as a pre-processing step to select the relevant features in order to enhance the predictive capacity of SVM. The experiment consists of predicting algorithm performance metrics for two well known optimization problems using SVM in its continuous and binary form depending on the metric of each problem.

关键词： Prediction algorithms Machine learning algorithms Support vector machines Feature extraction Optimization algorithm design and analysis Predictive models

来源：评论

学校读者我要写书评

暂无评论

Data Path Optimisation and Delay Matching for Asynchronous Bundled-Data Balsa Circuits 17

Data Path Optimisation and Delay Matching for Asynchronous B...

引用

IEEE/ACM 36th International Conference on Computer-Aided design (ICCAD)

作者： Kluge, Norman Wollowski, Ralf Hasso Plattner Inst Potsdam Germany IHP Frankfurt Germany

ISBN: (纸本)9781538630938

Balsa provides an open-source design flow where asynchronous circuits are created from high-level specifications, but the syntaxdriven translation often results in performance overhead. To improve this, we exploit the fact that bundled-data circuits can be divided into data and control path. Hence, tailored optimisation techniques can be applied to both paths separately. For control path optimisation, STG-based resynthesis has been used (applying logic minimisation). To continue the investigation, we additionally apply synchronous standard tools to optimise the data path. However, this removes the matched delays needed for a properly working bundled-data circuit. Therefore, we also present two algorithms to automatically insert proper matched delays. Our experiments show a performance improvement of up to 44% and energy consumption improvement of up to 60% compared to the original Balsa implementation.

关键词： Delays Tools Optimization Silicon algorithm design and analysis Protocols Hardware design languages

来源：评论

学校读者我要写书评

暂无评论

Anchored Alignment Distance between Rooted Labeled Unordered Trees

Anchored Alignment Distance between Rooted Labeled Unordered...

引用

Federated Conference on Computer Science and Information Systems (FedCSIS)

作者： Yoshino, Takuya Ishizaka, Yuma Hirata, Kouichi Kyushu Inst Technol Grad Sch Comp Sci & Syst Engn Kawazu 680-4 Iizuka Fukuoka 8208502 Japan Kyushu Inst Technol Dept Artificial Intelligence Kawazu 680-4 Iizuka Fukuoka 8208502 Japan

ISBN: (纸本)9788394625375

In this paper, we formulate an anchored alignment distance between rooted labeled unordered trees as the minimum cost of the anchored alignment whose anchoring is constructed from the minimum cost isolated-subtree mapping by adding the pairs of non-mapped leaves, and design the algorithm to compute it. Since this algorithm runs in exponential time with respect to the number of leaves in theoretical, we give experimental results for randomly generated trees and for N-glycan data with small degree as real data to evaluate the anchored alignment distance by comparing with the isolated-subtree distance and the alignment distance.

关键词： Vegetation Cost function algorithm design and analysis Computer science Electronic mail Bioinformatics Time complexity algorithm design and analysis electronic mail complexity classes computer science Cost functions Bioinformatics vegetation Unordered Exponential time Alignment

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 60 61 62 63 64 65 66 67 68 69 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：