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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

313 篇 期刊文献
238 篇 会议
13 篇 学位论文
1 篇 资讯

馆藏范围

565 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

489 篇 工学
- 323 篇 计算机科学与技术...
- 163 篇 电气工程
- 86 篇 信息与通信工程
- 60 篇 控制科学与工程
- 58 篇 软件工程
- 24 篇 机械工程
- 24 篇 仪器科学与技术
- 15 篇 电子科学与技术（可...
- 14 篇 航空宇航科学与技...
- 13 篇 石油与天然气工程
- 11 篇 材料科学与工程（可...
- 8 篇 动力工程及工程热...
- 7 篇 网络空间安全
- 6 篇 力学（可授工学、理...
- 5 篇 土木工程
- 5 篇 测绘科学与技术
107 篇 理学
- 59 篇 数学
- 17 篇 系统科学
- 14 篇 物理学
- 12 篇 化学
- 9 篇 生物学
- 9 篇 统计学（可授理学、...
- 5 篇 地球物理学
64 篇 管理学
- 55 篇 管理科学与工程(可...
- 9 篇 图书情报与档案管...
14 篇 医学
- 9 篇 临床医学
13 篇 教育学
- 9 篇 教育学
- 6 篇 心理学(可授教育学...
9 篇 经济学
- 7 篇 应用经济学
7 篇 法学
- 6 篇 法学
3 篇 农学
2 篇 军事学
2 篇 艺术学
1 篇 哲学
1 篇 文学

主题

565 篇 algorithm design
24 篇 optimization
23 篇 algorithms
15 篇 machine learning
10 篇 algorithm design...
9 篇 simulation
9 篇 artificial intel...
8 篇 approximation al...
8 篇 data mining
8 篇 cloud computing
7 篇 metaheuristics
7 篇 computational ge...
7 篇 mobile edge comp...
7 篇 evolutionary alg...
7 篇 particle swarm o...
7 篇 resource allocat...
6 篇 genetic algorith...
6 篇 algorithm comple...
6 篇 social networks
6 篇 energy consumpti...

机构

7 篇 southeast univ s...
4 篇 boston univ bost...
3 篇 ohio state univ ...
3 篇 univ chinese aca...
3 篇 nanjing univ sta...
3 篇 northeast petr u...
3 篇 ben gurion univ ...
3 篇 univ maryland de...
3 篇 queen mary univ ...
3 篇 city univ hong k...
3 篇 univ calif santa...
3 篇 hainan normal un...
3 篇 isi fdn turin
2 篇 univ houston dep...
2 篇 univ arizona dep...
2 篇 computer science...
2 篇 yunnan coll busi...
2 篇 inra ur math & i...
2 篇 chongqing univ c...
2 篇 univ alicante de...

作者

5 篇 wu weiwei
5 篇 liu xi
4 篇 prieto javier
4 篇 shan feng
4 篇 casado-vara robe...
4 篇 liu jun
4 篇 shen chih-ya
4 篇 nong ge
4 篇 xie lei
4 篇 day whe
4 篇 tian wenda
3 篇 corchado juan m.
3 篇 chen jingsen
3 篇 bein wolfgang
3 篇 xue jinyun
3 篇 fournier herve
3 篇 yu chang wu
3 篇 liang weifa
3 篇 lu sanglu
3 篇 arasli batuhan

语言

532 篇 英文
27 篇 其他
5 篇 中文
2 篇 德文
1 篇 法文
1 篇 意大利文

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

共 565 条记录，以下是381-390 订阅

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

详细简洁

排序：

design and implementation of shortest travel path searching based on improved Dijkstra algorithm

Design and implementation of shortest travel path searching ...

引用

International Conference on Mechatronics and Applied Mechanics (ICMAM 2011)

作者： Mo, Taiping Zhao, Huihuang Mo, Wei Xidian Univ Dept Mech & Elect Engn Xidian 710126 Shanxi Peoples R China Hengyang Normal Univ Dept Comp Sci Hunan 421008 Peoples R China Guilin Univ Elect Technol Dept Elect Engn & Automat Guangxi 541004 Peoples R China

ISBN: (纸本)9783037853801

The existing transportation service system in public travel route can not satisfy the people's actual travel need because of various technologies reasons. In our study, we set the tourist attractions as a vertex, and simplified the traditional algorithm for complex network computing. Aim to improve the disadvantage of tradition Dijkstra algorithm, an improve algorithm was proposed to improve the path search efficiency. Then the improved Dijkstra algorithm was applied to tourism path search. The experimental results have illustrated that the improved Dijkstra algorithm can accomplish a better result and improve path search efficiency.

关键词： Shortest path Dijkstra algorithm Tourism path search algorithm design

来源：评论

学校读者我要写书评

暂无评论

Customer Satisfaction-aware Scheduling for Utility Maximization on Geo-distributed Cloud Data Centers

Customer Satisfaction-aware Scheduling for Utility Maximizat...

引用

15th IEEE International Conference on High Performance Computing and Communications (HPCC) /11th IEEE/IFIP International Conference on Embedded and Ubiquitous Computing (EUC)

作者： Jing, Chao Zhu, Yanmin Li, Minglu Shanghai Jiao Tong Univ Dept Comp Sci & Engn Shanghai 200240 Peoples R China Shanghai Jiao Tong Univ Shanghai Key Lab Scalable Comp & Syst Shanghai 200240 Peoples R China

ISBN: (纸本)9780769550886

With the increasingly growing amount of service requests from the world-wide customers, the cloud systems is capable of providing services while meeting the customers' satisfaction. Recently, to achieve the better reliability and performance, the cloud systems has been largely depending on the geographically distributed data centers. Nevertheless, the dollar cost of service placement by service providers (SP) differ from the multiple regions. Accordingly, it is crucial to design a request dispatching and resource allocation algorithm to maximize net profit. The existing algorithms are either built upon energy-efficient schemes alone, or multi-type requests and customer satisfaction oblivious. They cannot be applied to multi-type requests and customer satisfaction-aware algorithm design with the objective of maximizing net profit. This paper proposes a customer satisfaction-aware algorithm based on the Ant-Colony Optimization (AMP) for geo-distributed data centers. By introducing the model of customer satisfaction, we formulate the utility (or net profit) maximization issue as an optimization problem under the constraints of customer satisfaction and data centers. AMP maximizes SP net profit by dispatching service requests to the proper data centers and generating the appropriate amount of Virtual Machines (VMs) to meet customer satisfaction. To evaluate the proposed algorithm, we have conducted the comprehensive simulation and compared with the other state-of-the-art algorithms. Conclusive results have demonstrated the effectiveness of AMP both in small and large scale problem.

关键词： Consumer Satisfaction data center 5'-Adenylic Acid amount of service CLOUDS Clouds algorithm design

来源：评论

学校读者我要写书评

暂无评论

design and analysis of teaching case about fast Malab algorithms

Design and analysis of teaching case about fast Malab algori...

引用

2013 International Conference on Information and Communication Technology for Education (ICTE 2013)

作者： Zhenfeng Zhu Yangdong Ye School of Information Engineering Zhengzhou University

Matlab is one of the popular softwares for designing algorithms in scientific researches. Based on the case about calculating similarity matrix, which often occurs in our researches, this paper discusses fast methods for dealing with large scale data(matrix) from theoretical analysis and algorithm design, and obtains efficient algorithms. By analyzing the case described above, we can develop various abilities of graduate students: mathematical thinking and use, algorithm design. This teaching case can also improve their study and work efficiency.

关键词： Matlab algorithm design large-scale data mathematics quality

来源：评论

学校读者我要写书评

暂无评论

A design procedure for a single time-varying functional observer

A design procedure for a single time-varying functional obse...

引用

IEEE Annual Conference on Decision and Control

作者： Frederic Rotella Irene Zambettakis Laboratoire de Genie de Production Ecole Nationale d'Ingenieurs de Tarbes 47 Avenue d'Azereix 65016 Tarbes CEDEX France

ISBN: (纸本)9781467357159

The paper presents an algorithm for the design of a single functional observer for a linear time-varying system. The proposed constructive procedure can be iterated to obtain a minimal order for the observer where the existence conditions are fufilled. As a specific feature, this procedure does not require the solution of any differential Sylvester equation.

关键词： Linear time-varying system single functional observer Luenberger observer design algorithm Linear time-varying system design algorithm Observers design process algorithm design

来源：评论

学校读者我要写书评

暂无评论

Convex Relaxations of a Probabilistically Robust Control design Problem

Convex Relaxations of a Probabilistically Robust Control Des...

引用

IEEE Annual Conference on Decision and Control

作者： A. M. Jasour C. Lagoa Department of Electrical Engineering The Pennsylvania State University UP PA 16802 Faculty of Electrical Engineering The Pennsylvania State University UP PA 16802

ISBN: (纸本)9781467357159

In this paper, we address the problem of designing probabilistic robust controllers for discrete-time systems whose objective is to reach and remain in a given target set with high probability. More precisely, given probability distributions for the initial state, uncertain parameters and disturbances, we develop algorithms for designing a control law that i) maximizes the probability of reaching the target set in N steps and ii) makes the target set robustly positively invariant. As defined the problem is nonconvex. To solve this problem, a sequence of convex relaxations is provided, whose optimal value is shown to converge to solution of the original problem. In other words, we provide a sequence of semidefinite programs of increasing dimension and complexity which can arbitrarily approximate the solution of the probabilistic robust control design problem addressed in this paper. Two numerical examples are presented to illustrate preliminary results on the numerical performance of the proposed approach.

关键词： design problems control law Robust control original problem Best value Convexity Probability distribution algorithm design

来源：评论

学校读者我要写书评

暂无评论

Optimal input design for non-linear dynamic systems: a graph theory approach

Optimal input design for non-linear dynamic systems: a graph...

引用

IEEE Annual Conference on Decision and Control

作者： Patricio E. Valenzuela Cristian R. Rojas Hakan Hjalmarsson Automatic Control Lab and ACCESS Linnaeus Center School of Electrical Engineering KTH-Royal Institute of Technology SE-100 44 Stockholm Sweden

ISBN: (纸本)9781467357159

In this article a new algorithm for the design of stationary input sequences for system identification is presented. The stationary input signal is generated by optimizing an approximation of a scalar function of the information matrix, based on stationary input sequences generated from prime cycles, which describe the set of finite Markov chains of a given order. This method can be used for solving input design problems for nonlinear systems. In particular it can handle amplitude constraints on the input. Numerical examples show that the new algorithm is computationally attractive and that is consistent with previously reported results.

关键词： Input design Input sequence information matrix Nonlinear dynamical systems SCALAR FUNCTIONS algorithm design input signal Graph theory System identification amplitude constraint

来源：评论

学校读者我要写书评

暂无评论

Distorted Sparse Signal Estimation from Distributed Sign Measurements

Distorted Sparse Signal Estimation from Distributed Sign Mea...

引用

International Conference on Wireless Communications and Signal Processing (WCSP)

作者： Cai, Xiao Zhang, Zhaoyang Zhong, Caijun Zhejiang Univ Inst Informat & Commun Engn Hangzhou 310027 Zhejiang Peoples R China

ISBN: (纸本)9781479903085

A novel algorithm called Cooperative Binary Iterative Hard Thresholding (CB-IHT) based on distributed 1-bit compressive sensing is proposed in this paper. Taking advantage of the correlated nature of distributed signal processing, the proposed algorithm is aimed to fight against the error floor in the estimation of distorted sparse signal, with an array of agents recovering the target signal cooperatively. The principles of convex optimization, consistent reconstruction and greedy pursuit algorithm are combined in the algorithm design. With two joint sparsity models representing distortion of equivalent parallel AWGN channels and parallel fading channels separately, the algorithm is performed through extensive simulations, which show that with severe distortion and large bit-budget, estimation accuracy can be improved by simply increasing the array scale.

关键词： Signal estimation error floor algorithm design AWGN channels Distribute distortion Pursuit algorithms fight abnormal shapes Bigeminy

来源：评论

学校读者我要写书评

暂无评论

designing Interference Alignment algorithms by Algebraic Geometry Analysis

Designing Interference Alignment Algorithms by Algebraic Geo...

引用

IEEE Global Communications Conference

作者： Liangzhong Ruan Moe Z. Win Vincent K. N. Lau Laboratory for Information and Decision Systems (LIDS) Massachusetts Institute of Technology Dept. of Electronic and Computer Engineering Hong Kong University of Science and Technology

ISBN: (纸本)9781479913510

Recent results have shown that interference alignment (IA) achieves the optimal throughput scaling law w.r.t. SNR. However, except for a few special cases, finding transceivers to achieve IA in MIMO interference networks is still an open problem. This problem is challenging due to the non-convex nature of the interference optimization problem. Inspired by recent success in using tools from algebraic geometry to analyze the feasibility conditions of IA, in this work, we adopt algebraic geometry analysis to guide IA algorithm design. Specifically, we first explore the relation between algebraic independence and feasibility of polynomial equation sets, and transform the IA problem into an equivalent polynomial form, whose policy space is convex. Then we reformulate the transformed IA problem into an interference optimization problem. By exploiting the connection between algebraic independence and full rankness of Jacobian matrix, we prove that in the interference optimization problem, there is no performance gap between local and global optimums when IA is feasible. This property enables us to easily design IA algorithms by adopting existing local search algorithms. Combining the propositions obtained in this work and those obtained in the authors' prior work on IA feasibility, we have established a unified algebraic framework for both IA feasibility analysis and algorithm design.

关键词： INFORMATION ASSURANCE Algebraic Geometry SEARCHING algorithm algorithm design Jacobian matrix Transceivers System of equations Non-Convex interference interference

来源：评论

学校读者我要写书评

暂无评论

Robust Bounded Control for the Flexible Arm Robot

Robust Bounded Control for the Flexible Arm Robot

引用

IEEE Annual Conference on Decision and Control

作者： Hussain Alazki Patricio Ordaz Alexander Poznyak Facultad de Ingenieria Universidad Autonoma Del Carmen Mexico Mechatronics Department Polytechnic University of Pachuca Centro de Investigacion y de Estudios Avanzados del I.P.N.

ISBN: (纸本)9781467357159

This work presents an algorithm for designing the optimal robust saturated output feedback controller for the two-link planar robot with a spring between two links by the Attractive Ellipsoid Method serving for class of uncertain "quasi-Lipschitz" dynamics. The Attractive Ellipsoid Method (AEM) application permits to describe the class of nonlinear feedbacks containing a saturation operator that guarantees a boundedness of all possible trajectories around the origin. Here we consider more general types of nonlinear bounded feedbacks which can be corrected (adjusted) on-line during a control process. The optimization of feedback within this class of controllers is associated with the selection of the feedback parameters which provide the trajectory converges within an ellipsoid of a "minimal size".

关键词： Feedback bounded control Controllers Control procedures Robot algorithm design trajectory general type

来源：评论

学校读者我要写书评

暂无评论

Geospatial intelligence as a context for computing education (abstract only) 13

Geospatial intelligence as a context for computing education...

引用

Proceeding of the 44th ACM technical symposium on Computer science education

作者： Sambit Bhattacharya Bogdan Czejdo Rakesh Malhotra Fayetteville State University Fayetteville NC USA

ISBN: (纸本)9781450318686

We present Geospatial Intelligence (GEOINT) as a context for computing education. GEOINT is a rich source of ideas for programming projects, algorithm design and use of databases. Students are interested in GEOINT due to its inherently visual subject matter and its strong ties with crime, espionage and social changes and upheavals. In short we are motivating computation as a subject that can provide solutions and insights into crime mysteries and complex events that unfold over time and space. In addition to keeping Computer Science majors interested, we also seek to attract students of other disciplines into computing. GEOINT and computing knowledge can provide initial preparation for certain jobs that are in demand and also for graduate school. Our assignments and programming projects that are inspired by GEOINT can be used in an introductory programming course or a more advanced course. These materials derive from well known case studies and also fundamentals concepts in computing. Some programming projects are based on exploration of chronologies and timelines as tools that enable the geographical display of information as an order sequence of events. In general these geospatial displays can correlate information to help correct for possible gaps and inconsistencies in knowledge. These materials use multiple layered techniques of presenting information that use time, geographical location, weather conditions and static features of the earth's surface.

关键词： algorithm design programming projects databases timelines geospatial intelligence

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共57页 << < 35 36 37 38 39 40 41 42 43 44 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：