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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

21 篇 会议
17 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

34 篇 工学
- 8 篇 电子科学与技术（可...
- 7 篇 信息与通信工程
- 6 篇 控制科学与工程
- 5 篇 光学工程
- 5 篇 电气工程
- 4 篇 仪器科学与技术
- 4 篇 计算机科学与技术...
- 4 篇 软件工程
- 3 篇 机械工程
- 2 篇 航空宇航科学与技...
- 1 篇 建筑学
- 1 篇 土木工程
- 1 篇 交通运输工程
- 1 篇 船舶与海洋工程
- 1 篇 生物医学工程（可授...
- 1 篇 公安技术
15 篇 理学
- 7 篇 物理学
- 4 篇 系统科学
- 2 篇 数学
- 1 篇 化学
- 1 篇 海洋科学
2 篇 医学
- 1 篇 基础医学(可授医学...
2 篇 管理学
- 1 篇 管理科学与工程(可...
- 1 篇 工商管理
1 篇 经济学
- 1 篇 应用经济学
1 篇 文学
- 1 篇 新闻传播学

主题

38 篇 proposed algorit...
2 篇 verified
2 篇 fusion
2 篇 fusion, biologic...
2 篇 standard pso
2 篇 fusion reactions
2 篇 fusion (melting)
1 篇 qam
1 篇 multi-vehicle co...
1 篇 .topologies
1 篇 digital images
1 篇 mobile multimedi...
1 篇 NOT FOUND
1 篇 the primary
1 篇 numerical algori...
1 篇 even number
1 篇 sea states
1 篇 strength limit
1 篇 output multiuser...
1 篇 seismic loading

机构

1 篇 group research a...
1 篇 east china insti...
1 篇 indian sch mines...
1 篇 department of bi...
1 篇 chalmers univ te...
1 篇 state key lab of...
1 篇 department of me...
1 篇 zte corporation
1 篇 daejin univ dept...
1 篇 etri
1 篇 natl inst techno...
1 篇 seoul natl univ ...
1 篇 imperial college...
1 篇 chinese acad eng...
1 篇 movement disorde...
1 篇 school of comput...
1 篇 space vehicles d...
1 篇 fudan univ key l...
1 篇 mobile multimedi...
1 篇 wuhan univ sch e...

作者

1 篇 prashant g. meht...
1 篇 zhonghai wang
1 篇 chan tony f.
1 篇 rodrigo calvo
1 篇 yanqing xu
1 篇 kim s
1 篇 zheng junru
1 篇 ricardo g. sanfe...
1 篇 g. castellanos-d...
1 篇 feigin am
1 篇 kazunori murakam...
1 篇 xuchu dai
1 篇 khursheed farida
1 篇 ahmad mohassin
1 篇 xiaowu zhao
1 篇 khanh d. pham
1 篇 karimi mahmood
1 篇 tian jie
1 篇 zhengcai cao
1 篇 jinghong zheng

语言

37 篇 英文
1 篇 中文

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

共 38 条记录，以下是21-30 订阅

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

详细简洁

排序：

An Improved Cuckoo Search algorithm for Semiconductor Final Testing Scheduling

An Improved Cuckoo Search Algorithm for Semiconductor Final ...

引用

IEEE International Conference on Automation Science and Engineering

作者： ZhengCai Cao ChengRan Lin MengChu Zhou Ran Huang Beijing University of Chemical Technology Beijing Beijing CN New Jersey Institute of Technology Newark NJ US Department of Electrical and Computer Engineering New Jersey Institute of Technology Newark NJ USA

This paper presents a cuckoo search algorithm to minimize makespan for a semiconductor final testing scheduling problem. Each solution is a two-part vector consisting of a machine assignment and an operation sequence. In each iteration, a parameter feedback control scheme based on reinforcement learning is proposed to balance the diversification and intensification of population, and a surrogate model is employed to reduce computational cost. According to the Rechenberg's 1/5 Criterion, reinforcement learning uses the proportion of beneficial mutation as feedback. As a result, the surrogate modeling only needs to evaluate the relative ranking of solutions. A heuristic approach based on the smallest position value rule and a modular function is proposed to convert continuous solutions obtained from Lévy flight into discrete ones. The computational complexity analysis is presented, and various simulation experiments are performed to validate the effectiveness of the proposed algorithm.

关键词： makespan semiconductor proposed algorithm

来源：评论

学校读者我要写书评

暂无评论

Track to Track Fusion incorporating Out of Sequence Track based on Information Matrix Fusion

Track to Track Fusion incorporating Out of Sequence Track ba...

引用

International IEEE Conference on Intelligent Transportation Systems

作者： Bharanidhar Duraisamy Tilo Schwarz Group Research and Development Daimler AG Ulm Germany

ISBN: (纸本)9781467365970

This paper presents the problem of information fusion in a multi-sensor setup of asynchronous sensors with different latencies. This leads to the problem of tracks that have arbitrary arrival time at the fusion center. A solution for the integration of tracks that are temporally out of order is proposed. The proposed algorithm is quite suitable for the track-to-track fusion requirements. This solution avoids the complex calculation involved in negating the effect of process noise that influences the estimation accuracy in a track-to-track fusion and also the correlated process noise problem that arises during the integration of out of order track with the global track. Monte Carlo simulations are carried out with different sensor characteristics to study the performance of the algorithm. The result of the algorithm is compared with an optimal filtering benchmark.

关键词： proposed algorithm integration effect Track DNA Integration integration Fusion reactions FUSION fusion (melting) Fusion, biological Sensor characteristics information matrix Information fusion arrival time

来源：评论

学校读者我要写书评

暂无评论

Joint Transmit Power and Relay Two-Way Beamforming Optimization for Energy-Harvesting Full-Duplex Communications

Joint Transmit Power and Relay Two-Way Beamforming Optimizat...

引用

IEEE Globecom Workshops

作者： Alexander A. Okandeji Muhammad R. A. Khandaker Kai-Kit Wong Zhongbin Zheng Department of Electronic and Electrical Engineering University College London East China Institute of Telecommunications China Academy of Information and Communications Technology

ISBN: (纸本)9781509024834

This paper studies the joint optimization problem of two-way relay beamforming, the receiver power splitting (PS) ratio as well as the transmit power at the sources to maximize the achievable sum-rate of a simultaneous wireless information and power transfer (SWIPT) system with a full-duplex (FD) multipleinput multiple-output (MIMO) amplify and forward (AF) relay, assuming perfect channel state information (CSI). In particular, our contribution is an iterative algorithm based on the difference of convex programming (DC) and one dimensional searching to achieve the joint solution. Simulation results are provided to demonstrate the effectiveness of the proposed algorithm.

关键词： PS MIMO proposed algorithm

来源：评论

学校读者我要写书评

暂无评论

Nonlinear Filtering with Transfer Operator

Nonlinear Filtering with Transfer Operator

引用

American Control Conference

作者： Parikshit Dutta Abhishek Halder Raktim Bhattacharya INRIA Rh?ne Alpes & Laboratoire Jean Kuntzmann 655 avenue de l'Europe 38330 Montbonnot France Department of Aerospace Engineering Texas A&M University College Station TX 77843 USA

ISBN: (纸本)9781479901777

This paper presents a new nonlinear filtering algorithm that is shown to outperform state-of-the-art particle filters with resampling. Starting from the Ito stochastic differential equation, the proposed algorithm harnesses Karhunen-Loeve expansion to derive an approximate non-autonomous dynamical system, for which transfer operator based density computation can be performed in exact arithmetic. It is proved that the algorithm is asymptotically consistent in mean-square sense. Numerical results demonstrate that explicitly accounting prior dynamics entail significant performance improvement for nonlinear non-Gaussian estimation problems with infrequent measurement updates, as compared to the performance of particle filters.

关键词： Transfer Operator proposed algorithm particle filters

来源：评论

学校读者我要写书评

暂无评论

A Robot on-line Area Coverage Approach based on the Probabilistic Lloyd Method

A Robot on-line Area Coverage Approach based on the Probabil...

引用

International Joint Conference on Neural Networks

作者： Murillo Rehder Batista Rodrigo Calvo Roseli Ap. Francelin Romer Department of Computer Science Institute of Mathematics and Computer Science University of Sao Paulo Trabalhador Sao-carlense Ave. 400 13560-970 - Sao Carlos - SP - Brazil

ISBN: (纸本)9781467361279

Area Coverage is a standard problem in which Robotics techniques can be applied. An approach to solve this problem is through techniques based on Centroidal Voronoi Tesselations (CVT), considering that each robot is a generator used to build Voronoi polygons. In this work, a new approach named by Sample Lloyd Area Coverage System (SLACS), is proposed that does not need of the explicit building of the diagram based in the Probabilistic Lloyd method to estimate a Voronoi polygon's centroid. In addition, it is proposed a method to close Voronoi diagrams to apply in a classic Lloyd CVT procedure. Both approaches are compared in empty and roomlike environments done in simulated tests using both Player interface and Stage simulator. Results obtained show that the proposed approach is well suited to solve the area coverage problem via mobile sensor deployment and it is a simple and effective substitute to a Lloyd CVT method.

关键词： proposed algorithm SLACS CVT STANFORD LINEAR ACCELERATOR CENTER Coverage AREA COVERAGE Robot sensor placement polygons Polygon empty dynamos

来源：评论

学校读者我要写书评

暂无评论

A Convergent Solution to the Multi-vehicle Coverage Problem

A Convergent Solution to the Multi-vehicle Coverage Problem

引用

American Control Conference

作者： Adnan Tahirovic Alessandro Astolfi Faculty of Electrical Engineering Department for Automatic Control and Electronics University of Sarajevo 71000 Sarajevo Bosnia and Herzegovina Imperial College London London SW7 2AZ United Kingdom

ISBN: (纸本)9781479901777

The paper presents a new solution to the multivehicle coverage problem. The proposed algorithm guarantees complete coverage and provides collaborative behaviors of vehicles, despite the fact that it does not explicitly exploit any computationally intensive optimization technique. The algorithm can deal with any mission domain, including regions with irregular shapes, multi-connected and disjoint regions. It gives reasonably good solutions even for partially connected multi-vehicle systems. The coverage problem for regions the shape of which change in time regardless the vehicle movement is also solved by the proposed algorithm.

关键词： Multi-vehicle Coverage Problem multi-vehicle coverage problem proposed algorithm

来源：评论

学校读者我要写书评

暂无评论

Estimation of Relative Positions and Orientations on a Car Transportation System Grasping two Drive Wheels

Estimation of Relative Positions and Orientations on a Car T...

引用

IEEE International Conference on Robotics and Biomimetics

作者： Naoaki Yonezawa Kazuhiro Kosuge Yasuhisa Hirata Yusuke Sugahara Takashi Kanbayashi Koki Suzuki Kazunori Murakami Kenichi Nakamura Department of Bioengi-neering and Robotics Tohoku University 6-6-01 Aoba Aramaki Aoba-ku Sendai 980-8579 Japan. School of Science and engineering Kokushikan University 4-28-1 Setagaya Setagaya-ku Tokyo 154-8515 Japan. IHI Transport Machinery Co. Ltd. 8-1 Akashi Chuo Tokyo 104-0044 Japan.

ISBN: (纸本)9781467321259

This paper proposes the estimation algorithm of some positional relationships between two robots and a car for a car transportation system. The car transportation system in this paper consists of two mobile robots and they lift drive wheels of the car to move the car. The knowledge of positional relationships between two robots and the condition of nonholonomic constraints of the car are necessary to transport the car. However, it is difficult that the parameters of positional relationships are obtained by using laser range scanners, cameras and GPS in the system. In the proposed algorithm, the encoders and the force sensors on the robots are used. To estimate the positional relationships, two robots lifting a car are moved by the cooperative transportation control based on force control. And then the information of two robots' velocities which are obtained by odometry is collected. After that, the, relative position and orientation between two robots, the relative orientation between each robot and a car and the wheelbase of the car are together estimated by using the information and the extended Kalman filter. In this paper, the procedure of the estimation algorithm of some positional relationships between two robots and a car and the primary experiments confirming the estimation capability of the proposed algorithm are described.

关键词： the primary proposed algorithm the extended

来源：评论

学校读者我要写书评

暂无评论

Multiple Space Object Tracking via a Space-based Optical Sensor

Multiple Space Object Tracking via a Space-based Optical Sen...

引用

IEEE Aerospace Conference

作者： Bin Jia Erik Blasch Khanh D. Pham Genshe Chen Dan Shen Zhonghai Wang Intelligent Fusion Technology Inc. 20271 Goldenrod Lane Suite 2066 Germantown MD 20876 Information Directorate Air Force Research Lab Rome NY 13441 Space Vehicles Directorate Air Force Research Lab Kirtland AFB NM 87117

ISBN: (纸本)9781467376778

Multiple space object tracking is vital to space situational awareness. In this paper, the multiple hypothesis filter is used to track multiple space objects via a space-based optical sensor, which has many distinct advantages over ground-based sensors. Due to the limited observations obtained from the space-based sensor, the constrained admissible area is used to initialize the orbit. A semi-greedy track selection (SGTS) algorithm is used to solve the multidimensional assignment problem in the observation to track association. The Cubature Kalman filter (CKF) will be used to update the orbit for each space object. Because of the various geometric relationships between the Sun, space objects, and the Earth, many trackelets are generated by the same space object. To facilitate the space object classification, the least squares method associates tracklets to objects. A set of objects with geosynchronous equatorial orbit obtained from the space catalogue is used to test and demonstrate the effectiveness of the proposed algorithm.

关键词： demonstrate effectiveness proposed algorithm space targets Demonstrate situational awareness Eye Sockets Sensors Orbits

来源：评论

学校读者我要写书评

暂无评论

Incremental Pairwise Clustering for Large Proximity Matrices

Incremental Pairwise Clustering for Large Proximity Matrices

引用

International Joint Conference on Neural Networks

作者： Sambu Seo Johannes Mohr Ningfei Li Andreas Horn Klaus Obermayer School of Electrical Engineering and Computer Science Technische Universit?t Berlin Berlin Germany Movement Disorders Section Department for Neurology Charité - University Medicine Berlin Germany

ISBN: (纸本)9781479919611

Pairwise clustering methods are able to handle relational data, in which a set of objects is described via a matrix of pairwise (dis)similarities. Using the framework of source coding, it has been shown that pairwise clustering can be considered as entropy maximization problem under the constraint of keeping the distortion at a small value. This can be optimized via deterministic annealing. For the purpose of improving this optimization procedure, we have previously suggested two incremental pairwise clustering methods. However, they either only allow an even number of clusters, or cannot be applied to large proximity matrices. In this paper, we propose an incremental pairwise clustering method that resolves these issues. We compare the computational efficiency of the proposed algorithm to the previous incremental methods using simulations. Moreover, we apply the method to identify functionally connected brain networks by clustering a high-dimensional connectivity matrix obtained from resting state functional magnetic resonance imaging data.

关键词： Incremental Pairwise Clustering Large Proximity Matrices proposed algorithm Pairwise Incremental deterministic annealing Clustering methods matrices Even number source coding Optimization Procedure Computational efficiency

来源：评论

学校读者我要写书评

暂无评论

Improvement of ECG Signal Quality Measurement using Correlation and Diversity-based Approaches

Improvement of ECG Signal Quality Measurement using Correlat...

引用

Annual International Conference of the IEEE Engineering in Medicine and Biology Society

作者： F.J. Martínez-Tabares J. Espinosa-Oviedo G. Castellanos-Dominguez Signal Processing and Recognition Group Universidad Nacional de Colombia Km. 9 Vía al aeropuerto Campus la Nubia Manizales Colombia

ISBN: (纸本)9781424441198

A large proportion of cardiovascular diseases might be preventable, however, majority of this diseases occurs in rural areas where there is a poor presence of cardiologists. To overcome this issue, the use of wearable devices within the telemedicine framework would be of benefit. However, implementation of processing algorithms in smart-phones at mobile environments imposes restrictions ensuring high measurement quality of acquired ECG data, while maintaining low computation burden. This work presents an algorithm for scoring the quality of measured ECG recordings is developed. Particularly, a quality score is provided that takes into account the proportional correlation observed in acceptable signals based on a diversity scheme, and their inverse relation with standard deviation. Testing of proposed algorithm is carried out upon two different databases, the first one is of own production, while the second one is obtained from Physionet. As a result, high values of sensitivity and specificity are achieved.

关键词： cardiovascular diseases computation burden proposed algorithm

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共4页 << < 1 2 3 4 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：