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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

453 篇 会议
32 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

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

主题

485 篇 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...
39 篇 image coding
38 篇 compressed sensi...
38 篇 signal analysis
33 篇 convergence
30 篇 video coding
30 篇 signal resolutio...
30 篇 channel estimati...
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

语言

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

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

共 485 条记录，以下是111-120 订阅

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

详细简洁

排序：

Multiple Moving Prey pursuit Algorithm Based on the Changeable Alliance

Multiple Moving Prey Pursuit Algorithm Based on the Changeab...

引用

ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD)

作者： Yue-hai Wang Meng-meng Zhang College of Information North-China University of Technology Beijing China

Multiple moving preys cooperative pursuit (MMPCP) problem was discussed where exists multiple random moving preys, each kind of which need different number of pursuers to circle to capture. Following the idea of "ally first, capture later", the pursuer first allies itself to others with same will and then capture the selected prey cooperatively. But in the existing algorithms the alliance, which was formed using a simple algorithm that consider the prey value only, cannot be broken once it has been established no matter how difficult the capture turn out to be and how much time has been consumed. For this problem, the concepts of assistant decision matrix, alliance cohesion, and fine are introduced. Based on these concepts, a changeable alliance based cooperative capture algorithm was proposed that improved both alliance-forming procedure and capturing procedure by allowing pursuer secede from a low-reward alliance to form other possible high-reward one. Simulation results show the feasibility and validity of the given algorithm.

关键词： pursuit algorithms Software engineering Artificial intelligence Distributed computing Educational institutions Electronic mail Earth Learning

来源：评论

学校读者我要写书评

暂无评论

Consistency in quantized matching pursuit

Consistency in quantized matching pursuit

引用

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

作者： V.K. Goyal M. Vetterli Department of Electrical Engineering and Computer Science University of California Berkeley USA

This paper explores the effects of coefficient quantization in applying the matching pursuit algorithm to source coding of vectors in R/sup N/. By considering the issue of consistency, we find that even though matching pursuit is designed to produce a linear combination to estimate a given source vector, optimal reconstruction in the presence of coefficient quantization requires a nonlinear algorithm. Such an algorithm was implemented and was experimentally confirmed to have superior reconstruction properties in comparison to the standard linear reconstruction. The improvement depends on the source, dictionary and operating point; in some cases the MSE was lessened by as much as a factor of five.

关键词： Matching pursuit algorithms Quantization Signal processing algorithms pursuit algorithms Vectors Dictionaries Iterative algorithms Bit rate Source coding Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

Fuzzy projection pursuit ID3

Fuzzy projection pursuit ID3

引用

IEEE International Conference on Fuzzy Systems (FUZZ-IEEE)

作者： T. Miyoshi H. Ichihashi F. Tanaka Department of Industrial Engineering Osaka Prefecture University Sakai Osaka Japan

We propose a projection pursuit regression (PPR) algorithm based on Quilan's ID3, in which objects are tested by linear projections of attributes instead of the attribute value itself. Projection pursuit ID3 (PP-ID3) is able to generate simpler decision trees since nodes are represented by linear projections of all attribute values. The other aim of this paper is to analyse the feeling-design relations using the PP-ID3. In order to apply the PP-ID3 for the data about feeling and emotion collected by pairwise comparisons, we further improve the algorithm to deal with pairwise comparison data in the similar way to Guttman's (1946) method. The relation between design components of T-shirt and adjective words "conspicuous" or "quiet" is analysed with PP-ID3.

关键词： Decision trees Spline Testing Fuzzy sets Intrusion detection Space technology Industrial engineering pursuit algorithms Machine learning algorithms Machine learning

来源：评论

学校读者我要写书评

暂无评论

MP3D: highly scalable video coding scheme based on matching pursuit

MP3D: highly scalable video coding scheme based on matching ...

引用

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

作者： A. Rahmoune P. Vandergheynst P. Frossard Signal Processing Institute ITS Swiss Federal Institute of Technology Lausanne Switzerland

The paper describes a novel video coding scheme based on a three-dimensional matching pursuit algorithm. In addition to good compression performance at low bit rates, the proposed coder allows for flexible spatial, temporal and rate scalability thanks to its progressive coding structure. The matching pursuit algorithm generates a sparse decomposition of a video sequence in a series of spatio-temporal atoms, taken from an overcomplete dictionary of three-dimensional basis functions. The dictionary is generated by shifting, scaling and rotating two different mother atoms in order to cover the whole frequency cube. An embedded stream is then produced from the series of atoms. They are first distributed into sets through the set-partitioned position map algorithm (SPPM) to form the index-map, inspired from bit plane encoding. Scalar quantization is then applied to the coefficients which are finally arithmetic coded. A complete MP3D codec has been implemented, and performances are shown to compare favorably to other scalable coders like MPEG-4 FGS and SPIHT-3D. In addition, the MP3D streams offer an incomparable flexibility for multiresolution streaming or adaptive decoding.

关键词： Video coding Matching pursuit algorithms pursuit algorithms Dictionaries Bit rate Scalability Video sequences Frequency Streaming media Encoding

来源：评论

学校读者我要写书评

暂无评论

pursuit Controller Performance Guarantees for a Lifeline pursuit-Evasion Game over a Wireless Sensor Network

Pursuit Controller Performance Guarantees for a Lifeline Pur...

引用

IEEE Conference on Decision and Control

作者： Phoebus Chen Shankar Sastry Department of Electrical Engineering and Computer Sciences University of California Berkeley Berkeley CA USA

ISBN: (纸本)1424401704;9781424401703

pursuit-evasion games have been studied as a generalization of many control problems, and have been also used to study the viability of running control algorithms over sensor networks. We provide a method for computing performance bounds on a sample pursuit-evasion game, the classic lifeline game described by Rufus Isaacs. Given a routing topology and pairwise link probabilities, we compute an n-hop disk model abstraction of a sensor network to model delay and lost packets. Using this model, we then compute a probabilistic barrier that splits the state space of the game into an escape zone and a capture zone. This barrier and the corresponding optimal control laws are the solution to the game. The position of the barrier in the state space provides a sense of how well such a control application can perform over a sensor network

关键词： Wireless sensor networks State-space methods Optimal control Delay Control systems USA Councils pursuit algorithms Routing Network topology Computer networks

来源：评论

学校读者我要写书评

暂无评论

Sparse channel estimation using orthogonal matching pursuit algorithm

Sparse channel estimation using orthogonal matching pursuit ...

引用

IEEE Conference on Vehicular Technology (VTC)

作者： G.Z. Karabulut A. Yongacoglu School of Information Technology and Engineering University of Ottawa ONT Canada

Sparse channels are encountered in several communication applications. Exploiting the sparsity, a channel estimate can be obtained by using a matching pursuit (MP) algorithm. Previously, it was demonstrated that the MP based channel estimation outperforms the conventional least squares (LS) estimation algorithm for sparse channels. In this paper, we propose to use the orthogonal matching pursuit (OMP) algorithm for channel estimation. Using OMP, the convergence problem in MP algorithm based on re-selection of the basis vectors is eliminated. It is also verified that by avoiding the re-selection problem more accurate channel estimates can he obtained by using the OMP algorithm. The performance of decision feedback equalizers based on the channel estimates obtained by using the MP and OMP algorithms are compared, verifying that the OMP outperforms the MP, with a comparable computational complexity.

关键词： Matching pursuit algorithms Channel estimation pursuit algorithms Signal processing algorithms Decision feedback equalizers Signal resolution Fourier transforms Least squares approximation Discrete wavelet transforms Discrete cosine transforms

来源：评论

学校读者我要写书评

暂无评论

Hierarchical decomposition approach for pursuit-evasion differential game with multiple players

Hierarchical decomposition approach for pursuit-evasion diff...

引用

IEEE Conference on Aerospace

作者： Jianhua Ge Liang Tang J. Reimann G. Vachtsevanos Impact Technologies LLC Rochester NY USA Department of Electrical and Computer Engineering Georgia Institute of Technology Atlanta GA USA

pursuit-evasion games are among the most widespread, challenging, and important optimization problems. This paper presents a hierarchical decomposition algorithm for pursuit-evasion differential games with multiple pursuers and multiple evaders. The developed algorithm is not only to reduce the complexity of the problem, but also to enable the problem to be solved in a distributed fashion. Consequently, when the scheme is to be implemented, it is possible to increase the speed of the algorithm by breaking it down into multiple independent computational processes

关键词： Game theory Optimal control Paper technology Military computing Vehicle dynamics Energy capture Irrigation pursuit algorithms Biographies Constraint theory

来源：评论

学校读者我要写书评

暂无评论

GRADIENT POLYTOPE FACES pursuit FOR LARGE SCALE SPARSE RECOVERY PROBLEMS

GRADIENT POLYTOPE FACES PURSUIT FOR LARGE SCALE SPARSE RECOV...

引用

IEEE International Conference on Acoustics, Speech, and Signal Processing

作者： Aris Gretsistas Ivan Damnjanovic Mark D. Plumbley Queen Mary University of London Centre for Digital Music Mile End Road E1 4NS London UK

ISBN: (纸本)9781424442959

Polytope Faces pursuit is a greedy algorithm that performs Basis pursuit with similar order complexity to Orthogonal Matching pursuit. The algorithm adds one basis vector at a time and adopts a path-following approach based on the geometry of the polar polytope associated with the dual Linear Program. Its initial implementation uses the method of Cholesky factorization to update the solution vector at each step, which can be computationally expensive for solving large scale problems as it requires the succesive storage of large matrices. In this paper, we present a different approach using directional updates to estimate the solution vector at each time. The proposed method uses the gradient descent method, reducing the memory requirements and computational complexity. We demonstrate the application of this Gradient Polytope Faces pursuit algorithm to a source separation problem.

关键词： Sparse representation greedy algorithm Polytope Faces pursuit Gradient descent Source Separation Source separation greedy algorithm sparse representation Polytopes pursuit algorithms memory requirements Scale formation Cholesky factorisation descent method LARGE gene

来源：评论

学校读者我要写书评

暂无评论

Application of Adaptive Kernel Matching pursuit to Estimate Mixture Pixel Proportion

Application of Adaptive Kernel Matching Pursuit to Estimate ...

引用

International Conference on Image and Graphics (ICIG)

作者： Wu Bo Wang XiaoQin Huang Bo Spatial information research Center of Fujian Province Fuzhou university Fuzhou China Department of geography and resource management The Chinese University of Hong-Kong New Territories Hong Kong China

An adaptive kernel matching pursuit (AKMP) algorithm to estimate mixture pixel proportion of remotely sensed image has been proposed. The AKMP algorithm applies greedy sparse approximation algorithm to the feature space induced by a nonlinear kernel function, and can therefore be able to capture nonlinear effects of image and performed better than conventional linear approaches. Moreover, it has the capability of adaptive selection of the kernel parameter before starting the greedy approximating procedure to avoid complex procedures of kernel function parameter selection. Experiments with ETM+ associated with IKONOS image have been carried out, and the result demonstrates that the proposed method can provide accurate proportion estimation. Comparisons with support vector regression (SVR) and linear mixture model (LMM) have also been done, and the experiments show that the proposed method outperform SVR and LMM in terms of RMSE.

关键词： Kernel Matching pursuit algorithms Pixel Approximation algorithms Linear regression pursuit algorithms Vectors Graphics Geography Resource management

来源：评论

学校读者我要写书评

暂无评论

The adaptive matching pursuit algorithm for estimation and equalization of sparse time-varying channels

The adaptive matching pursuit algorithm for estimation and e...

引用

Asilomar Conference on Signals, Systems & Computers

作者： S.F. Cotter B.D. Rao Electrical and Computer Engineering Department University of California San Diego La Jolla CA USA University of California San Diego La Jolla CA US

ISBN: (纸本)0780365143

This paper addresses issues related to the estimation and equalization of channels with a large delay spread and an impulse response with significant values only over small regions. For a time-varying environment, an adaptive matching pursuit (AMP) algorithm is considered which updates the channel estimate while exploiting the channel's sparsity. From the channel estimate, the equalizer taps are then derived. We show through simulations that using AMP to track the time-varying channel gives significant improvement in equalization performance over using the LMS or RLS algorithms. We also demonstrate how ANP may be modified to more quickly adapt to a fast time-varying channel.

关键词： Matching pursuit algorithms pursuit algorithms Adaptive equalizers Time-varying channels Least squares approximation Delay estimation Resonance light scattering Intersymbol interference HDTV Underwater acoustics

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：