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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

454 篇 会议
34 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

101 篇 工学
- 35 篇 电气工程
- 30 篇 计算机科学与技术...
- 28 篇 信息与通信工程
- 16 篇 机械工程
- 15 篇 控制科学与工程
- 14 篇 电子科学与技术（可...
- 14 篇 软件工程
- 13 篇 仪器科学与技术
- 3 篇 船舶与海洋工程
- 3 篇 航空宇航科学与技...
- 3 篇 生物医学工程（可授...
- 2 篇 土木工程
- 2 篇 水利工程
- 1 篇 力学（可授工学、理...
- 1 篇 交通运输工程
14 篇 理学
- 7 篇 系统科学
- 3 篇 数学
- 3 篇 物理学
- 1 篇 地球物理学
- 1 篇 生物学
7 篇 医学
- 3 篇 基础医学(可授医学...
- 2 篇 临床医学
5 篇 管理学
- 5 篇 管理科学与工程(可...
4 篇 文学
- 4 篇 新闻传播学
1 篇 军事学
- 1 篇 军队指挥学
1 篇 艺术学
- 1 篇 设计学（可授艺术学...

主题

488 篇 pursuit algorith...
263 篇 matching pursuit...
147 篇 dictionaries
64 篇 signal processin...
52 篇 time frequency a...
48 篇 algorithm design...
46 篇 vectors
46 篇 iterative algori...
43 篇 signal processin...
40 篇 compressed sensi...
39 篇 signal analysis
39 篇 image coding
32 篇 convergence
30 篇 signal resolutio...
30 篇 channel estimati...
29 篇 video coding
27 篇 approximation al...
26 篇 computer science
26 篇 bit rate
26 篇 testing

机构

6 篇 carleton univ sc...
6 篇 school of inform...
5 篇 department of el...
5 篇 klipsch school o...
4 篇 department of el...
4 篇 department of ma...
3 篇 institute of inf...
3 篇 department of el...
3 篇 signal processin...
3 篇 univ agder dept ...
3 篇 department of el...
3 篇 school of comput...
3 篇 pee/coppe/del/ee...
3 篇 department of el...
3 篇 department of el...
3 篇 electrical and c...
3 篇 media & intercon...
3 篇 signal processin...
2 篇 department of el...
2 篇 lcc cellular ins...

作者

10 篇 p. vandergheynst
8 篇 j.h. husoy
7 篇 b.d. rao
6 篇 s. mallat
6 篇 d.m. monro
5 篇 k. engan
5 篇 e.a.b. da silva
5 篇 zhang xuan
5 篇 d.k. borah
5 篇 oommen b. john
5 篇 jiao lei
5 篇 s.o. aase
4 篇 m. vetterli
4 篇 a. yongacoglu
4 篇 g.z. karabulut
4 篇 b.j. oommen
4 篇 wen-liang hwang
4 篇 y.c. pati
4 篇 christian r. ber...
4 篇 h.r. rabiee

语言

476 篇 英文
7 篇 其他
5 篇 中文

检索条件"主题词=Pursuit algorithms"

共 488 条记录，以下是101-110 订阅

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

详细简洁

排序：

Sparse approximation using fast matching pursuit

Sparse approximation using fast matching pursuit

引用

IEEE International Symposium on Intelligent Signal Processing and Communication Systems (ISPACS)

作者： Tao Gan Yanmin He Weile Zhu School of Electronic Engineering University of Electronic Science and Technology Cheng China

Matching pursuit based on geometric dictionary has shown to be a powerful tool for sparse image representation. The main obstacle to its application in real world is the computational complexity. In this paper, a modified algorithm is presented to address this issue. The dictionary with anisotropic refinement atoms is used to provide the approximation ability. Meanwhile the pursuit implementation is significantly speeded up by employing both sequential and parallel techniques. Experimental results show that compared to the latest matching pursuit approach, the proposed algorithm offers a speedup of 27.7-36.7 while maintaining the approximation quality. It is very promising for flexible image coding at low bit rate.

关键词： Matching pursuit algorithms Dictionaries Signal processing algorithms Image coding Greedy algorithms Computational complexity Anisotropic magnetoresistance Approximation algorithms pursuit algorithms Image decomposition

来源：评论

学校读者我要写书评

暂无评论

Estimation of the blood Doppler frequency shift by a matching pursuit algorithm

Estimation of the blood Doppler frequency shift by a matchin...

引用

International Conference on Information and Automation (ICIA)

作者： Yufeng Zhang Huahong Ma Jianhua Chen Xinlin Shi Department Electronic Engineering Information School Yunnan University Kunming Yunnan China

The diagnosis of arterial occlusive disease often depends on the Doppler spectrum analysis. We can normally use the short-time Fourier transform (STFT) to compute the time-frequency representation (TFR) of the Doppler blood flow signal. This method uses a fixed time-frequency window, making it inaccurate to analyze signals with relatively wide bandwidths that change rapidly with time. In order to estimate the Doppler frequency shift more accurately, even when the temporal flow velocity is rapid (high non-stationarity), we propose to use a modified version matching pursuit (MP) with stochastic dictionaries to estimate the time frequency representation of Doppler blood flow signals for extracting the mean frequency shift. Results show that the modified MP method can provide more accurate mean frequency waveforms than the STFT does.

关键词： Frequency estimation Matching pursuit algorithms pursuit algorithms Time frequency analysis Blood flow Diseases Fourier transforms Signal analysis Bandwidth Stochastic processes

来源：评论

学校读者我要写书评

暂无评论

Estimation of fading channels with a parallel matching pursuit structure

Estimation of fading channels with a parallel matching pursu...

引用

IEEE Conference on Vehicular Technology (VTC)

作者： D.K. Borah Klipsch School of Electrical and Computer Engineering New Mexico State University Las Cruces NM USA

A parallel matching pursuit followed by cancellation (PMPC) algorithm is presented for estimation of multipath channels with large possible delay spreads. In the transient phase of the parallel MP, an increasing number of channel coefficients is chosen in each iteration. The selected coefficients are next accurately estimated using a cancellation step in the algorithm. Unlike a serial MPC (SMPC) approach, the PMPC algorithm enables faster convergence in the transient phase, and allows readjustment of the selected channel coefficients. The performance of PMPC, however, depends on a set of weighting coefficients. Our study shows that PMPC can perform significantly better than conventional least squares under sparse channel conditions.

关键词： Fading Matching pursuit algorithms Delay estimation Channel estimation Multiaccess communication Maximum likelihood detection Silicon carbide pursuit algorithms Least squares methods Maximum likelihood estimation

来源：评论

学校读者我要写书评

暂无评论

Signal classification by mutual information based discriminating pursuit

Signal classification by mutual information based discrimina...

引用

IEEE Region 10 International Conference TENCON

作者： Bao Liu Shih-Fu Ling School of Mechanical & Production Engineering Nanyang Technological University Singapore Singapore

ISBN: (纸本)0780336798

An algorithm called mutual information based discriminating pursuit is suggested for signal classification. With this algorithm a series of wavelets that carry meaningful information about class differences are chosen from wavelet packets. The coefficients obtained by decomposing signals onto these wavelets are exploited as pattern features for classification. The algorithm is tested with the classification of simulation signals. The results show that both the sensitivity and reliability of the proposed algorithm are good. This algorithm can be used to deal with 1-D signal classification, such as speech analysis, machinery diagnosis, etc.

关键词： Pattern classification Mutual information Wavelet packets Libraries Wavelet analysis Probability Classification algorithms Signal representations Matching pursuit algorithms pursuit algorithms

来源：评论

学校读者我要写书评

暂无评论

Comparison of pursuit and ε-Greedy algorithm for load scheduling under real time pricing

Comparison of pursuit and ε-Greedy algorithm for load sched...

引用

National Proceedings Power and Energy Conference (PECon)

作者： S. D. Maqbool T. P. Imthias Ahamed S.Q. Ali F.R. Pazheri N.H. Malik Saudi Aramco Chair in Electrical Power EE Department College of Engineering King Saud University Riyadh Saudi Arabia

Demand Response (DR) is a useful tool to develop a balance between the available generation and loads under smart grid environment. There are various price based schemes to implement DR and flatten the load profile. Hence, for the benefit of customers, proper load scheduling is required to lower the usage of electricity during peak load periods in order to decrease the electricity cost. This work formulates load scheduling as multi stage decision making problem or Markov Decision Problem (MDP). Reinforcement learning (RL) has been used to solve many decision making problems under stochastic environment. ε-Greedy algorithm is the most popular exploration method used in RL. In this paper, pursuit algorithm is developed to achieve a balance between exploration and exploitation process of the RL. The performance of both the algorithms is compared which shows the supremacy of pursuit Algorithm over ε-greedy algorithm.

关键词： pursuit algorithms Electricity Switches Conferences Greedy algorithms Pricing Schedules

来源：评论

学校读者我要写书评

暂无评论

Cooperative pursuit with sensing limitations

Cooperative pursuit with sensing limitations

引用

American Control Conference (ACC)

作者： Shaunak D. Bopardikar Francesco Bullo Joao P. Hespanha Department of Mechanical Engineering University of California슠Santa Barbara Santa Barbara CA USA Department of Electrical and Computer Engineering University of California슠Santa Barbara Santa Barbara CA USA

We address a discrete-time pursuit-evasion problem involving multiple pursuers and a single evader in an unbounded, planar environment in which each player has limited-range sensing. The evader appears at a random location in a bounded region and moves only when sensed. We propose a sweep-pursuit-capture strategy for a group of at least three pursuers and determine a lower bound on the probability of capture for the evader. This bound is a function of the pursuer formation and independent of the initial evader location and the evader strategy. We then propose a novel cooperative pursuit algorithm and show that the problem is reduced to one with unlimited sensing. We provide an upper bound on the time for our pursuit strategy to succeed. The final capture is achieved by using the established algorithm spheres. Our results show that on the basis of maximizing the probability of evader capture per pursuer, the pursuers should search the bounded region as a single group (conjoin) rather than to divide the region into smaller parts and search simultaneously in smaller groups (allocate).

关键词： Upper bound Cities and towns pursuit algorithms Rabbits Animal behavior Sufficient conditions

来源：评论

学校读者我要写书评

暂无评论

On a pursuit-evasion problem related to motion coordination of mobile robots

On a pursuit-evasion problem related to motion coordination ...

引用

Annual Hawaii International Conference on System Sciences (HICSS)

作者： K. Sugihara I. Suzuki Department of Information and Computer Sciences University of Hawaii Manoa Honolulu HI USA Department of Eletrical Engineering and Computer Science University of Wisconsin Milwaukee Milwaukee WI USA

A pursuit-evasion problem is discussed in which a team of mobile robots (called searchers) is required to capture a mobile robot (called a fugitive) in an N*N grid graph G/sub N/ under various conditions. An algorithm for the problem is presented under the condition that the fugitive is not allowed to stop anywhere or change direction while on an edge. This algorithm is shown to be optimal with respect to both the number of searchers and the time required to capture the fugitive. A second algorithm is presented under the condition that the fugitive can stop on a vertex but cannot change direction while on the edge. A third algorithm, with no restrictions, is presented and shown to be optimal with respect to the number of searchers required and to be optimal within a constant factor with respect to the time required in the worst case.< >

关键词： Mobile robots Robot kinematics pursuit algorithms Motion planning Grid computing Computer science Manipulators Polynomials

来源：评论

学校读者我要写书评

暂无评论

Discrimination and identification of time-delay repeater jamming and target echo by basis pursuit

Discrimination and identification of time-delay repeater jam...

引用

IET International Radar Conference 2015

作者： Liming Ding Lingyan Dai Rongfeng Li Fengbo Chen Yongliang Wang College of Electronic Science and Engineering National University of Defense Technology Changsha China Air Force Early Warning Academy Wuhan China

ISBN: (纸本)9781510822023

The basis pursuit algorithm of sparse decomposition is used to recover and discriminate the target echo and the jamming signal which have different time-delay and pulse width. The key is to construct an atomic dictionary. The recoveries in both the noiseless case and in the noisy case are considered. The noiseless case adopts linear programming. The noisy case adopts quadratic programming. Since the recovery is sensitive to the noise, the solution to the noisy case is unstable. More importantly, densely false targets, including the case that two signals are overlapped in the temporal domain, can also be recovered. Finally, simulations verifies the results.

关键词： Atomic Dictionary Basis pursuit Convex Relaxation Mainlobe Jamming Time-delay Repeater Jamming TARGET ECHOES Noise interfering signal pursuit algorithms quadratic programming PULSE WIDTH

来源：评论

学校读者我要写书评

暂无评论

Pure pursuit Revisited: Field Testing of Autonomous Vehicles in Urban Areas

Pure Pursuit Revisited: Field Testing of Autonomous Vehicles...

引用

IEEE International Conference on Cyber-Physical Systems, Networks, and Applications (CPSNA)

作者： Hiroki Ohta Naoki Akai Eijiro Takeuchi Shinpei Kato Masato Edahiro Graduate School of Information Science Nagoya University Institutes of Innovation for Future Society Naaova Universitv Graduate School of Information Science and Technology University of Tokyo

ISBN: (纸本)9781509044047

In this paper, we aim to explore path following. We implement a path following component by referring to the existing Pure pursuit algorithm. Using the simulation and field operational test, we identified the problem in the path following component. The main problems identified were with respect to vehicles meandering off the path, turning a corner, and the instability of steering control. Therefore, we apply some modifications to the Pure pursuit algorithm. We have also conducted the simulation and field operational tests again to evaluate these modifications.

关键词： Vehicles Planning Urban areas pursuit algorithms Sensors Angular velocity Roads

来源：评论

学校读者我要写书评

暂无评论

A fast orthogonal matching pursuit algorithm

A fast orthogonal matching pursuit algorithm

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： M. Gharavi-Alkhansari T.S. Huang Beckman Institute for Advanced Science and Technology University of Illinois Urbana-Champaign Urbana-Champaign IL USA

The problem of optimal approximation of members of a vector space by a linear combination of members of a large overcomplete library of vectors is of importance in many areas including image and video coding, image analysis, control theory, and statistics. Finding the optimal solution in the general case is mathematically intractable. Matching pursuit, and its orthogonal version, provide greedy solutions to this problem. Orthogonal matching pursuit typically provides significantly better solution compared to the nonorthogonal version, but requires much more computation. This paper presents a fast algorithm for implementation of orthogonal matching pursuit which for many coding applications has a computational complexity very close to that of the nonorthogonal version.

关键词： Matching pursuit algorithms pursuit algorithms Dictionaries Vectors Image coding Space technology Video coding Fractals Rate-distortion Libraries

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共49页 << < 7 8 9 10 11 12 13 14 15 16 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：