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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是351-360 订阅

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

详细简洁

排序：

Steering a Ferromagnetic Particle by Magnetic Feedback Control: algorithm design and Validation

Steering a Ferromagnetic Particle by Magnetic Feedback Contr...

引用

American Control Conference

作者： Arash Komaee Benjamin Shapiro Department of Aerospace Engineering University of Maryland College Park MD 20742 USA Fischell Department of Bio-Engineering and the Institute for Systems Research University of Maryland College Park MD 20742 USA

ISBN: (纸本)9781424474264

We present results for planar manipulation of a single drop of magnetic nano-particles (a ferrofluid) in a liquid by feedback control of an array of electromagnets. Control design is based on a first-principles physical model of the magnetic fields, the resulting magnetic forces, and opposing viscous drag on the ferrofluidic drop, and it exploits the nonlinear (quadratic) nature of the dependence of the magnetic force on the electromagnet actuations. An ability to control the droplet along arbitrary trajectories is verified both in simulations and in an experiment.

关键词： Electromagnets Magnetic force feedback control algorithm design Steering viscous drag liquids

来源：评论

学校读者我要写书评

暂无评论

A Study on algorithm design of Network Controller Based on Iterative Learning Control

A Study on Algorithm Design of Network Controller Based on I...

引用

2010 Second Asia-Pacific Conference on Information Processing (APCIP 2010)

作者： Jieying Zhu College of Information Yunnan Normal University Kunming,Yunnan Province,China Lijun Yun**,Zhixia Ye College of Information Yunnan Normal University Kunming,Yunnan Province,China

Iterative learning control algorithm is introduced in this paper to deal with delay in the networked control *** is applied to the networked control system for its simple structure and independence on the accurate *** delay and interference,the system model and detailed algorithm design process is *** by the Matlab demonstrate the effectiveness of the algorithm.

关键词： networked control system iterative learning control time delay algorithm design

来源：评论

学校读者我要写书评

暂无评论

Parallel Markov chain Monte Carlo methods for large scale statistical inverse problems

Parallel Markov chain Monte Carlo methods for large scale st...

引用

作者： Wang, Kainan Texas A&M University

学位级别：Ph.D.

The Bayesian method has proven to be a powerful way of modeling inverse problems. The solution to Bayesian inverse problems is the posterior distribution of estimated parameters which can provide not only estimates for the inferred parameters but also the uncertainty of these estimations. Markov chain Monte Carlo (MCMC) is a useful technique to sample the posterior distribution and information can be extracted from the sampled ensemble. However, MCMC is very expensive to compute, especially in inverse problems where the underlying forward problems involve solving differential equations. Even worse, MCMC is difficult to parallelize due to its sequential nature—that is, under the current framework, we can barely accelerate MCMC with parallel computing. We develop a new framework of parallel MCMC algorithms-the Markov chain preconditioned Monte Carlo (MCPMC) method-for sampling Bayesian inverse problems. With the help of a fast auxiliary MCMC chain running on computationally cheaper approximate models, which serves as a stochastic preconditioner to the target distribution, the sampler randomly selects candidates from the preconditioning chain for further processing on the accurate model. As this accurate model processing can be executed in parallel, the algorithm is suitable for parallel systems. We implement it using a modified master-slave architecture, analyze its potential to accelerate sampling and apply it to three examples. A two dimensional Gaussian mixture example shows that the new sampler can bring statistical efficiency in addition to increasing sampling speed. Through a 2D inverse problem with an elliptic equation as the forward model, we demonstrate the use of an enhanced error model to build the preconditioner. With a 3D optical tomography problem we use adaptive finite element methods to build the approximate model. In both examples, the MCPMC successfully samples the posterior distributions with multiple processors, demonstrating efficient speedups com

关键词： MCMC Statistical inverse problems Parallel computing algorithm design Thesis

来源：评论

学校读者我要写书评

暂无评论

RESEARCH ON LOSSLESS COMPRESSION CODING OF ULTRASONIC LOG DATA

RESEARCH ON LOSSLESS COMPRESSION CODING OF ULTRASONIC LOG DA...

引用

Symposium on Piezoelectricity, Acoustic Waves, and Device Applications (SPAWDA)

作者： Yao, Jun-Jun Xin, Peng-Lai Yu, Qi-Jiao He, Hong-Bin Chinese Acad Sci Inst Acoust Beijing 100190 Peoples R China ShengLi Well Logging Co Dongying 257096 Shandong Peoples R China

ISBN: (纸本)9781479964253

Large amounts of data are transported to the ground in the process of logging and limitations of cable bandwidth, so ultrasonic log data need to be compressed in the downhole when logging. In this case, this paper put forward a new lossless coding structure UWLC to compress the ultrasonic logging data. This structure of UWLC is designed to encode the data to close achieve the effect of envelope detection. The UWLC has a strong ability to track data amplitude. In ultrasonic log data compression case, comparing to traditional Golomb-rice, adaptive Golomb-rice and LZW compression algorithms, UWLC has higher compression ratio.

关键词： Ultrasonic logging data Lossless compression algorithm design Compression factor

来源：评论

学校读者我要写书评

暂无评论

Focus and Shoot: Efficient Identification Over RFID Tags in the Specified Area 10

Focus and Shoot: Efficient Identification Over RFID Tags in ...

引用

10th International Conference on Mobile and Ubiquitous Systems - Computing, Networking, and Services (MOBIQUITOUS)

作者： Yin, Yafeng Xie, Lei Wu, Jie Vasilakos, Athanasios V. Lui, Sanglu Nanjing Univ State Key Lab Novel Software Technol Nanjing 210008 Jiangsu Peoples R China Temple Univ Dept Comp & Informat Sci Philadelphia PA 19122 USA Univ Western Macedonia Kozani Greece

ISBN: (纸本)9783319115689

In RFID systems, the reader usually identifies all the RFID tags in the interrogation region with the maximum power. However, some applications may only need to identify the tags in a specified area, which is usually smaller than the reader's default interrogation region. In this paper, we respectively present two solutions to identify the tags in the specified area. The principle of the solutions can be compared to the picture-taking process of a camera. It first focuses on the specified area and then shoots the tags. The design of the two solutions is based on the extensive empirical study on RFID tags. Realistic experiment results show that our solutions can reduce the execution time by 46% compared to the baseline solution.

关键词： RFID Tag identification Experimental study algorithm design

来源：评论

学校读者我要写书评

暂无评论

On Discovering non-Obvious Recommendations: Using Unexpectedness and Neighborhood Selection Methods in Collaborative Filtering Systems 14

On Discovering non-Obvious Recommendations: Using Unexpected...

引用

7th ACM International Conference on Web Search and Data Mining (WSDM)

作者： Adamopoulos, Panagiotis NYU Leonard N Stern Sch Business Dept Informat Operat & Management Sci New York NY 10003 USA

ISBN: (纸本)9781450323512

This paper proposes a number of studies in order to move the field of recommender systems beyond the traditional paradigm and the classical perspective of rating prediction accuracy. We contribute to existing helpful but less explored recommendation strategies and propose new approaches targeting to more useful recommendations for both users and businesses. Working toward this direction, we discuss the studies we have conducted so far and present our future research plans. The overall goal of this research program is to expand our focus from even more accurate rating predictions toward a more holistic experience for the users, by providing them with non-obvious but high quality recommendations and avoiding the over-specialization and concentration bias problems. In particular, we propose a new probabilistic neighborhood-based method as an improvement of the standard k-nearest neighbors approach, alleviating some of the most common problems of collaborative filtering recommender systems, based on classical metrics of dispersion and diversity as well as some newly proposed metrics. Furthermore, we propose a concept of unexpectedness in recommender systems and operationalize it by suggesting various mechanisms for specifying the expectations of the users and proposing a recommendation method for providing the users with unexpected but high quality personalized recommendations that fairly match their interests. Besides, in order to generate utility-based recommendations for Massive Open Online Courses (MOOCs) that better serve the educational needs of students, we study the satisfaction of users with online courses vis-a-vis student retention. Finally, we summarize the conclusions of the conducted studies, discuss the limitations of our work and also outline the managerial implications of the proposed stream of research.

关键词： algorithm design Unexpectedness Recommender Systems

来源：评论

学校读者我要写书评

暂无评论

Finding All Competitive Products Using the Dominant Relationship Analysis

Finding All Competitive Products Using the Dominant Relation...

引用

International Conference on Intelligent Information Hiding and Multimedia Signal Processing

作者： Yu-Chi Chung I-Fang Su Chiang Lee Pin-Chieh Huang Computer Science and Information Engineering Chang Jung Christian University Tainan Taiwan Computer Science and Information Engineering Nation Cheng Kung University Tainan Taiwan

ISBN: (纸本)9781509001897

The importance of skyline and dominance relationship analysis has been well recognized in multicriteria decision-making applications. In this paper, we propose the problem of "Finding Skyline with Customer Preferences and Cost Constraints", which utilizes the concept of dominance for business analysis from a microeconomic perspective. Our problem aims to discover the dominance relationship between products and potential customers. Given a set of customer preferences, we want to help the company to design set of competitive products so that the products can satisfy as many customer requirements as possible and the cost of producing the products is within a specified threshold. By "competitive products" we mean that the products cannot be dominated by other products in the market. We formally define the problem and discuss the difficulty of the problem. We also present the foundation and the intuition of our pruning methods. Then we proposed three efficient algorithms that utilize our pruning methods to address the problem. In addition, we also prove the correctness of our proposed algorithms.

关键词： dominance relationship analysis query processing algorithm design

来源：评论

学校读者我要写书评

暂无评论

Supremacy of trigonometric mutation strategy for efficient design of multiplier-less low-pass FIR filter using differential evolution algorithm

Supremacy of trigonometric mutation strategy for efficient d...

引用

IET Chennai Fourth International Conference on Sustainable Energy and Intelligent Systems (SEISCON 2013)

作者： Abhijit Chandra Sudipta Chattopadhyay Indian Institute of Engineering Science and Technology Howrah West Bengal IN Jadavpur University Kolkata West Bengal IN

ISBN: (纸本)9781510804524

In this communication, we have investigated the effect of trigonometric mutation strategy of Differential Evolution (DE) algorithm for the design of hardware efficient multiplier-less Finite duration Impulse Response (FIR) filter. The resulting filter performance has been compared and properly analyzed with the one designed by rand/1 mutation technique of DE and other existing multiplier-less structures from various angles. Finally, the design efficiency of our proposed filter over the other models has been firmly established by listing a number of performance parameters.

关键词： Differential Evolution (DE) Error histogram Multiplier-less filter Sum of power of two (SPT) Trigonometric mutation algorithm design Filterability Filters algorithms FIR filters FARP2 gene PUF60 gene characteristic parameter design EFFICIENCY evolution Mutation Differential Communication Research MT

来源：评论

学校读者我要写书评

暂无评论

Hallucination Helps: Energy Efficient Virtual Circuit Routing 14

Hallucination Helps: Energy Efficient Virtual Circuit Routin...

引用

Annual ACM-Society for Industrial and Applied Mathmatics Symposium on Discrete algorithms

作者： Antonios Antoniadis Sungjin Im Ravishankar Krishnaswamy Benjamin Moseley Viswanath Nagarajan Kirk Pruhs Cliff Stein University of Pittsburgh Duke University Computer Science Princeton University Toyota Technological Institute at Chicago IBM T.J. Watson Research Center Dept. of IEOR Columbia University

ISBN: (纸本)9781611973389

We consider virtual circuit routing protocols, with an objective of minimizing energy, in a network of components that are speed scalable, and that may be shutdown when idle. We assume that the speed s of a link is proportional to its load, and assume the standard model for component power, namely that the power is some constant static power σ plus s~α, where typically α∈ [1, 1, 3]. We give a polynomial-time offline algorithm for multicommodity routing, that has approximation ratio O(logα k), where k is the number of demand pairs. This is obtained as a combination of three natural combinatorial algorithms. The key step of the algorithm design is a random sampling technique that we call hallucination, which is reminiscent of the Sample-Augment framework for solving Buy-at-Bulk type problems, and sampling in cut-sparsification algorithms. The analysis of the approximation ratio is then a direct consequence of the flow-cut gap for multicommodity flow. The algorithm extends rather naturally to an online algorithm, which we show has competitive ratio O{top}~(log~(3α+1) k). The analysis of the online algorithm introduces a natural "priority" multicommodity flow problem, and bounds the priority multicommodity flow-cut gap-this might also be of independent interest. We also explain how our hallucination technique can be used to achieve an (O(log km), O(log km)) bicriteria approximation result for the problem of buying a minimum cost collection of unit-capacitated edges to support a concurrent multi-commodity flow, where m is the number of links in the network.

关键词： Hallucinations virtual circuits algorithm design algorithms network links Network routing

来源：评论

学校读者我要写书评

暂无评论

Research on the improvement of the harmony search algorithm

Research on the improvement of the harmony search algorithm

引用

2014 International Conference on Artificial Intelligence and Industrial Application (AIIA2014)

作者： J.P.Li A.P.Lu H.C.Wang X.Li P.C.Li School of Computer and Information Technology Northeast Petroleum University

ISBN: (纸本)9781784660529

Only one harmony vector is obtained in each iteration in the classical harmony search algorithm, which affects its search ability. In view of this, we propose an improved harmony search algorithm in this paper. In our approach, an equivalent number of harmony vectors with a population size are obtained in each iteration, and the newly generated harmony vectors are put into the harmony memory array. Then, all harmony vectors are sorted according to fitness from high to low, and the first half individuals are removed into the next generation of populations. Experimental results show that the proposed approach is obviously superior to the classical one under both the same number of iterations and the same running time, which reveals our approach can effectively extract the characteristics of excellent individuals in the population and obtain satisfactory optimization results.

关键词： intelligent computation intelligent optimization harmony search algorithm design

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共57页 << < 32 33 34 35 36 37 38 39 40 41 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：