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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Sparsity enhanced fast subsurface imaging with GPR

Sparsity enhanced fast subsurface imaging with GPR

引用

Proceedings of the International Conference on Ground Penetrating Radar, GPR

作者： Ali Cafer Gürbüz Department of Electrical and Electronics Engineering TOBB University of Economics and Technology Ankara Ankara Turkey

ISBN: (纸本)9781424446049;9781424446056

Sparsity of a signal starts to become very important in many applications. In subsurface imaging, generally potential targets covers a small part of the total subsurface volume to be imaged, thus the targets are spatially sparse. Under this assumption it is shown that the subsurface imaging problem can be formulated as a dictionary selection problem which can be solved quickly using basis pursuit type algorithms compared to previously published convex optimization based methods. Spatial sparsity also indicates that the number of measurements (spatial or time/frequency) that GPR collects can be reduced, decreasing the data acquisition time. Orthogonal matching pursuit algorithm is used for reconstructing sparse subsurface images. Results show that the proposed method reduces time both in data acquisition and processing compared to previous methods with similar performance.

关键词： Ground penetrating radar Time measurement Data acquisition Matching pursuit algorithms Image reconstruction EMP radiation effects Dictionaries pursuit algorithms Frequency measurement Radar imaging

来源：评论

学校读者我要写书评

暂无评论

An Adaptive Learning Automata Algorithm for Channel Selection in Cognitive Radio Network

An Adaptive Learning Automata Algorithm for Channel Selectio...

引用

WRI International Conference on Communications and Mobile Computing, CMC

作者： Tran Anh Tuan Lau Chiew Tong A.B. Premkumar School of Computer Engineering Nanyang Technological University Singapore

ISBN: (纸本)9781424463275;9780769539898

Channel selection plays a critical role in cognitive radio networks. In this work, we apply the learning automata techniques to enable a cognitive radio to learn and make decision on channel selection from a set of available channels. The set of randomly available frequency channels is modeled as an unknown environment. As practical networks are usually non-stationary, we propose an adaptive algorithm that enables the cognitive radio to monitor changes in the radio environment and always select the optimal channel after a long run.

关键词： Learning automata Cognitive radio pursuit algorithms Computer networks Mobile communication Mobile computing Adaptive algorithm Monitoring Radio frequency Wireless communication

来源：评论

学校读者我要写书评

暂无评论

Feature space design for image recognition with image screening

Feature space design for image recognition with image screen...

引用

International Conference on Pattern Recognition

作者： K. Arimura N. Hagita NTT Basic Research Laboratories Atsugi Kanagawa Japan

This paper describes a two-stage recognition method that reduces the calculation load of correlation and improves recognition accuracy in statistical image recognition. It consists of an image screening and recognition stage. Image screening selects a candidate set of subimages that are similar to the object class using a lower dimensional feature vector. Since recognition is made for the selected subimages set using a higher dimensional feature vector, overall recognition efficiency is improved. The classifier in recognition designed from the selected subimages also improves recognition accuracy because selected subimages are less contaminated than the original ones. A screening criterion for measuring overall efficiency and accuracy of recognition is introduced to be exploited in designing the feature spaces of image screening and recognition. The results of experiments for the eye- and mouth-area detection in face images and text-area detection in document images show that the designed feature spaces improve recognition accuracy and more efficiency than does the conventional one-stage recognition method.

关键词： Image recognition Face detection Face recognition Principal component analysis Object detection pursuit algorithms Pattern matching Target recognition Character recognition Filters

来源：评论

学校读者我要写书评

暂无评论

On existence of solutions to structured lyapunov inequalities

On existence of solutions to structured lyapunov inequalitie...

引用

American Control Conference

作者： Aivar Sootla James Anderson Montefiore Institute University of Liege B28 Belgium B4000 St John's College Oxford and the Department of Engineering Science University of Oxford Parks Road OX1 3PJ U.K.

ISBN: (纸本)9781467386838

In this paper, we derive sufficient conditions on drift matrices under which block-diagonal solutions to Lyapunov inequalities exist. The motivation for the problem comes from a recently proposed basis pursuit algorithm. In particular, this algorithm can provide approximate solutions to optimisation programmes with constraints involving Lyapunov inequalities using linear or second order cone programming. This algorithm requires an initial feasible point, which we aim to provide in this paper. Our existence conditions are based on the so-called H matrices. We also establish a link between H matrices and an application of a small gain theorem to the drift matrix. We finally show how to construct these solutions in some cases without solving the full Lyapunov inequality.

关键词： Linear matrix inequalities Approximation algorithms Eigenvalues and eigenfunctions Symmetric matrices pursuit algorithms Optimization Linear programming Symmetric matrix Eigenfunctions pursuit algorithms linear matrix inequalities Approximation algorithms linear programming inequalities Solutions small gain theorem matrices

来源：评论

学校读者我要写书评

暂无评论

Learning Automaton based Distributed Caching for Mobile Social Networks

Learning Automaton based Distributed Caching for Mobile Soci...

引用

IEEE Wireless Communications and Networking Conference

作者： Chuan Ma Zihuai Lin Loris Marini Jun Li Branka Vucetic School of Electrical and Information Engineering University of Sydney

ISBN: (纸本)9781467398152

In this paper, a novel distributed caching strategy in mobile social networks based on device-to-device communications is proposed. The proposed approach combines the characters of social networks to handle some practical issues, e.g., the selfishness of users. In order to maximize the throughput of the whole system, a fast convergence learning automaton, called the discrete generalized pursuit algorithm is utilized. Incorporating with social characters, the algorithm not only optimizes the content placement problems in caching theory, but also satisfies the physical and social constraints appropriately. Simulation results show that, compared with other investigated caching strategies, the proposed algorithm has higher convergence speed and at the same time, it can reduce the transmission delay and improve the system throughput. Moreover, the proposed algorithm can get a better performance in higher density district.

关键词： Social Networks learning automata Social Media Cache memory Transport delay Social Capital pursuit algorithms Selfishness Throughput

来源：评论

学校读者我要写书评

暂无评论

Incorporation of Ordinal Optimization into Learning Automata for High Learning Efficiency

Incorporation of Ordinal Optimization into Learning Automata...

引用

IEEE International Conference on Automation Science and Engineering

作者： JunQi Zhang Cheng Wang Di Zang MengChu Zhou Department of Computer Science and Technology the Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Department of Electrical and Computer Engineering New Jersey Institute of Technology

ISBN: (纸本)9781467381840

Learning automata (LA) represent important leaning mechanisms with applications in automated system design, biological system modeling, computer vision, and transportation. They play the critical roles in modeling a process as well as generating the appropriate signal to control it. They update their action probabilities in accordance with the inputs received from the environment and can improve their own performance during operations. The action probability vector in LA takes charge of two functions: 1) The cost of convergence, i.e., the size of sampling budget;2) The allocation of sampling budget among actions to identify the optimal one. These two intertwined functions lead to a problem: The sampling budget mostly goes to the currently estimated optimal action due to its high action probability regardless whether it can help identify the real optimal action or not. This work proposes a new class of LA that separates the allocation of sampling budget from the action probability vector. It uses the action probability vector to determine the size of sampling budget and then uses Optimal Computing Budget Allocation (OCBA) to accomplish the allocation of sampling budget in a way that maximizes the probability of identifying the true optimal action. Simulation results verify its significant speedup ranging from 10.93% to 65.94% over the best existing LA algorithms.

关键词： Convergence Optimization Resource management Learning automata Computational modeling pursuit algorithms Accuracy

来源：评论

学校读者我要写书评

暂无评论

A Practical Sparse Channel Estimation for Current OFDM Standards

A Practical Sparse Channel Estimation for Current OFDM Stand...

引用

International Conference on Telecommunications (ICT)

作者： Mahdi Soltanolkotabi Mojtaba Soltanalian Arash Amini Farokh Marvasti Department of Electrical Engineering Sharif University of Technology Tehran Iran

Wireless channels especially for OFDM transmissions can be precisely approximated by a time varying filter with sparse taps (in the time domain). Sparsity of the channel is a criterion which can highly improve the channel estimation task in mobile applications. In sparse signal processing, many efficient algorithms have been developed for finding the sparsest solution to linear equations (Basis pursuit, Matching pursuit) in the presence of noise. In current OFDM standards, a number of the ending subcarriers at both positive and negative frequencies are left unoccupied (for ease of analog filtering at the receiver) which results in an ill-conditioned frequency to time transformation matrix. This means that the initial estimate for the impulse response of the channel (in time) easily varies as the noise vector changes. Thus in this case we cannot use most of the proposed algorithms in sparse signal processing. In this paper, we propose iteration with adaptive thresholding and MMSE methods to overcome this difficulty. Simulation results indicate that the proposed method is almost perfect for stationary channels and only minor performance degradation is observed with increase of Doppler frequency.

关键词： Channel estimation OFDM Signal processing algorithms Matching pursuit algorithms Filters pursuit algorithms Equations Filtering Sparse matrices Adaptive signal processing

来源：评论

学校读者我要写书评

暂无评论

Adaptive Digital Beamforming Algorithm Using Neighborhood Filter

Adaptive Digital Beamforming Algorithm Using Neighborhood Fi...

引用

Asia-Pacific Microwave Conference

作者： Di Zhu Chen Miao Jingping Yang Yuan Qiu Bo Li School of Electronic Engineering and Optoelectronic Technology Nanjing University of Science and Technology Key Lab of Radio Astronomy Purple Mountain Observatory CAS School of Electronic Science and Engineering Nanjing University of Posts and Telecommunications

ISBN: (纸本)9781479987689

Based on Neighborhood filter, this paper provided a novel subspace pursuit algorithm of compressive sensing for beamforming. After choose the best atom of the dictionary in matching pursuit, Neighborhood filter would find atoms which have a strong relativity larger than a set value. The results obtained this method can avoid overmatching, and get a balance between calculate quantity and the rate of convergence. It has a better performance than conditional LCMV in the condition of large SNR.

关键词： Beamforming Neighborhood Compressed sensing Filters Dictionaries as Topic Atoms pursuit algorithms Converge set value

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共49页 << < 40 41 42 43 44 45 46 47 48 49 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：