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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

317 篇 会议
178 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

436 篇 工学
- 229 篇 电气工程
- 155 篇 计算机科学与技术...
- 106 篇 信息与通信工程
- 53 篇 控制科学与工程
- 37 篇 机械工程
- 32 篇 软件工程
- 27 篇 电子科学与技术（可...
- 25 篇 仪器科学与技术
- 20 篇 生物医学工程（可授...
- 17 篇 交通运输工程
- 10 篇 航空宇航科学与技...
- 10 篇 核科学与技术
- 7 篇 船舶与海洋工程
- 7 篇 生物工程
- 6 篇 测绘科学与技术
- 4 篇 化学工程与技术
98 篇 理学
- 33 篇 物理学
- 25 篇 统计学（可授理学、...
- 19 篇 系统科学
- 15 篇 生物学
- 11 篇 数学
- 3 篇 化学
46 篇 医学
- 25 篇 临床医学
- 19 篇 基础医学(可授医学...
- 11 篇 特种医学
41 篇 管理学
- 33 篇 管理科学与工程(可...
- 5 篇 图书情报与档案管...
11 篇 农学
- 8 篇 作物学
9 篇 经济学
- 7 篇 应用经济学
- 3 篇 理论经济学
1 篇 法学
1 篇 文学
1 篇 军事学

主题

495 篇 expectation-maxi...
49 篇 em algorithm
37 篇 parameter estima...
35 篇 maximum likeliho...
34 篇 learning (artifi...
34 篇 gaussian process...
30 篇 algorithms
29 篇 mixture models
29 篇 channel estimati...
27 篇 bayes methods
25 篇 expectation-maxi...
24 篇 hidden markov mo...
23 篇 image reconstruc...
22 篇 probability
22 篇 monte carlo meth...
22 篇 medical image pr...
20 篇 maximum likeliho...
19 篇 ofdm modulation
19 篇 iterative method...
18 篇 gaussian distrib...

机构

3 篇 duke univ dept e...
3 篇 univ so calif de...
3 篇 graduate school ...
2 篇 spcom group univ...
2 篇 supelec departme...
2 篇 univ victoria de...
2 篇 inria centre ren...
2 篇 princeton univer...
2 篇 harbin inst tech...
2 篇 oklahoma state u...
2 篇 spcom group univ...
2 篇 microsoft res re...
2 篇 nanjing univ inf...
2 篇 linkoping univ d...
2 篇 calif state univ...
2 篇 northwestern pol...
2 篇 army engn univ d...
2 篇 univ windsor dep...
2 篇 microsoft resear...
2 篇 bar ilan univ fa...

作者

4 篇 calinon sylvain
3 篇 bartolucci franc...
3 篇 caldwell darwin ...
3 篇 okamura hiroyuki
3 篇 yang xianqiang
3 篇 rodrigo carvajal
3 篇 dohi tadashi
3 篇 tomohiro nakatan...
3 篇 krolik jeffrey l...
3 篇 boris i. godoy
3 篇 forbes florence
2 篇 rogers jeffrey s...
2 篇 mehrpouyan hani
2 篇 juan c. agüero
2 篇 wu qing ming jon...
2 篇 a. pages-zamora
2 篇 liu xin
2 篇 moeneclaey marc
2 篇 hirokazu kameoka
2 篇 c. herzet

语言

477 篇 英文
13 篇 其他
5 篇 中文

检索条件"主题词=expectation-maximisation algorithm"

共 495 条记录，以下是311-320 订阅

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

详细简洁

排序：

Non-binary LDPC decoding using truncated messages in the Walsh-Hadamard domain

Non-binary LDPC decoding using truncated messages in the Wal...

引用

International Symposium on Information Theory and its Applications (ISITA)

作者： Sayir, Jossy Univ Cambridge Cambridge CB2 1TN England

ISBN: (纸本)9784885522925

The Extended Min-Sum (EMS) algorithm for non-binary low-density parity-check (LDPC) defined over an alphabet of size q operates on truncated messages of length q' to achieve a complexity of the order q'(2). In contrast, Walsh-Hadamard (WH) transform based iterative decoders achieve a complexity of the order q log q, which is much larger for q' << q. In this paper, we demonstrate that considerable savings can be achieved by letting WH based decoders operate on truncated messages as well. We concentrate on the direct WH transform and compute the number of operations required if only q' of the q inputs are non-zero. Our paper does not cover the inverse WH transform and hence further research is needed to construct WH based decoders that can compete with the EMS algorithm on complexity terms.

关键词： Approximation methods Complexity theory Decoding Energy management Parity check codes Transforms Vectors Transform parity check codes DECODING Complexity theory Approximation method Energy management decoders Messages expectation-maximisation algorithm low density parity check codes

来源：评论

学校读者我要写书评

暂无评论

An Iterative Method of Sensor Calibration in Participatory Sensing Network

An Iterative Method of Sensor Calibration in Participatory S...

引用

IEEE 10th International Conference on Mobile Ad-Hoc and Sensor Systems (MASS)

作者： Xiang, Chaocan Yang, Panlong PLA Univ Sci & Technol Coll Commun Engn Nanjing Jiangsu Peoples R China

ISBN: (纸本)9780769551043

With widespread usages of smart phones, participatory sensing becomes mainstream, especially for applications requiring pervasive deployments with massive sensors. However, sensors on smart phones are prone to the unknown measurement errors, requiring automatical calibration among uncooperative participants. Current methods need either collaboration or explicit calibration process. However, due to the uncooperative and uncontrollable nature of the participants, these methods fail to calibrate sensor nodes effectively. We investigate sensor calibration in monitoring pollution sources, without explicit calibration process in uncooperative environment. We leverage the opportunity in sensing diversity, where a participant will sense multiple pollution sources when roaming in the area. Further, inspired by EM (expectation Maximization) method, we propose a two-level iterative algorithm to estimate the source presences, source parameters and sensor noise iteratively. Our algorithm can converge to the optimal estimation of sensor noise, where the likelihood of observations is maximized.

关键词： calibration expectation-maximisation algorithm measurement errors monitoring parameter estimation smart phones wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Hidden Markov Model Estimation Based on Alpha-EM algorithm: Discrete and Continuous Alpha-HMMs

Hidden Markov Model Estimation Based on Alpha-EM Algorithm: ...

引用

International Joint Conference on Neural Networks (IJCNN)

作者： Matsuyama, Yasuo Waseda Univ Dept Comp Sci & Engn Tokyo 1698555 Japan

ISBN: (纸本)9781424496365

Fast estimation algorithms for Hidden Markov models (HMMs) for given data are presented. These algorithms start from the alpha-EM algorithm which includes the traditional log-EM as its proper subset. Since existing or traditional HMMs are the outcome of the log-EM, it had been expected that the alpha-HMM would exist. In this paper, it is shown that this foresight is true by using methods of the iteration index shift and likelihood ratio expansion. In each iteration, new update equations utilize one-step past terms which are computed and stored during the previous maximization step. Therefore, iteration speedup directly appears as that of CPU time. Since the new method is theoretically based on the alpha-EM, all of its properties are inherited. There are eight types of alpha-HMMs derived. They are discrete, continuous, semi-continuous and discrete-continuous alpha-HMMs, and both for single and multiple sequences. Using the properties of the alpha-EM algorithm, the speedup property is theoretically analyzed. Experimental results including real world data are given.

关键词： algorithm design and analysis Approximation algorithms Covariance matrix Equations Estimation Hidden Markov models Mathematical model alpha-EM algorithm continuous alpha-HMM discrete alpha-HMM expectation-maximisation algorithm hidden Markov model estimation hidden Markov models iteration index shift likelihood ratio expansion

来源：评论

学校读者我要写书评

暂无评论

Handwritten Line Detection via an EM algorithm

Handwritten Line Detection via an EM algorithm

引用

12th International Conference on Document Analysis and Recognition (ICDAR)

作者： Cruz, Francisco Ramos Terrades, Oriol Univ Autonoma Barcelona Comp Vis Ctr E-08193 Barcelona Spain

ISBN: (纸本)9780769549993

In this paper we present a handwritten line segmentation method devised to work on documents composed of several paragraphs with multiple line orientations. The method is based on a variation of the EM algorithm for the estimation of a set of regression lines between the connected components that compose the image. We evaluated our method on the ICDAR2009 handwriting segmentation contest dataset with promising results that overcome most of the presented methods. In addition, we prove the usability of the presented method by performing line segmentation on the George Washington database obtaining encouraging results.

关键词： document image processing expectation-maximisation algorithm handwriting recognition image segmentation

来源：评论

学校读者我要写书评

暂无评论

algorithms for iterative phase noise estimation based on a truncated DCT expansion

Algorithms for iterative phase noise estimation based on a t...

引用

12th IEEE International Workshop on Signal Processing Advances in Wireless Communications

作者： Bhatti, Jabran Noels, Nele Moeneclaey, Marc Univ Ghent Dept Telecommun & Informat Proc Ghent Belgium

ISBN: (纸本)9781424493326

We present two phase noise estimation algorithms for single-carrier burst communications. The first and second estimation techniques (denoted as PEA1 and PEA2 respectively) are based on a truncated discrete cosine transform (DCT) basis expansion of the phase noise and of the corresponding phasor, respectively and do not require any knowledge of the phase noise statistics. An initial pilot-based estimate is iteratively improved by means of the expectation-maximization algorithm, yielding a soft-decision-directed phase noise estimate. The performances of PEA1 and PEA2 are compared in terms of the mean-square phase error and bit-error rate. Numerical results show that PEA2 out performs PEA1 for practical values of the signal-to-noise ratio.

关键词： algorithm design and analysis Bit error rate Discrete cosine transforms Estimation Phase estimation Phase noise Signal processing algorithms bit-error rate channel estimation discrete cosine transforms error statistics expectation-maximisation algorithm expectation-maximization algorithm iterative phase noise estimation algorithm phase noise signal-to-noise ratio single-carrier burst communications telecommunication networks truncated DCT expansion truncated discrete cosine transform

来源：评论

学校读者我要写书评

暂无评论

DREAMS: DFM Rule EvAluation using Manufactured Silicon

DREAMS: DFM Rule EvAluation using Manufactured Silicon

引用

32nd IEEE/ACM International Conference on Computer-Aided Design (ICCAD)

作者： Blanton, R. D. Wang, F. Xue, C. Nag, P. K. Xue, Y. Li, X. Carnegie Mellon Univ Adv Test Chip Lab ECE Dept Pittsburgh PA 15213 USA

ISBN: (纸本)9781479910717

DREAMS (DFM Rule EvAluation using Manufactured Silicon) is a comprehensive methodology for evaluating the yield-preserving capabilities of a set of DFM (design for manufacturability) rules using the results of logic diagnosis performed on failed ICs. DREAMS is an improvement over prior art in that the distribution of rule violations over the diagnosis candidates and the entire design are taken into account along with the nature of the failure (e. g., bridge versus open) to appropriately weight the rules. Silicon and simulation results demonstrate the efficacy of the DREAMS methodology. Specifically, virtual data is used to demonstrate that the DFM rule most responsible for failure can be reliably identified even in light of the ambiguity inherent to a non-ideal diagnostic resolution, and a corresponding rule-violation distribution that is counter-intuitive. We also show that the combination of physically-aware diagnosis and the nature of the violated DFM rule can be used together to improve rule evaluation even further. Application of DREAMS to the diagnostic results from an in-production chip provides valuable insight in how specific DFM rules improve yield (or not) for a given design manufactured in particular facility. Finally, we also demonstrate that a significant artifact of DREAMS is a dramatic improvement in diagnostic resolution. This means that in addition to identifying the most ineffective DFM rule(s), validation of that outcome via physical failure analysis of failed chips can be eased due to the corresponding improvement in diagnostic resolution.

关键词： design for manufacture elemental semiconductors expectation-maximisation algorithm failure analysis integrated circuit design integrated circuit reliability integrated circuit testing integrated circuit yield silicon

来源：评论

学校读者我要写书评

暂无评论

Learning Energy Consumption Profiles from Data 5

Learning Energy Consumption Profiles from Data

引用

IEEE Symposium on Computational Intelligence and Data Mining (CIDM)

作者： Andreoli, Jean-Marc Xerox Res Ctr Europe Grenoble France

ISBN: (纸本)9781479945184

A first step in the optimisation of the power consumption of a device infrastructure is to detect the power consumption signature of the involved devices. In this paper, we are especially interested in devices which spend most of their time waiting for a job to execute, as is often the case of shared devices in a networked infrastructure, like multi-function printing devices in an office or transaction processing terminals in a public service. We formulate the problem as an instance of power disaggregation in non intrusive load monitoring (NILM), with strong prior assumptions on the sources but with specific constraints: in particular, the aggregation is occlusive rather than additive. We use a specific variant of Hidden Semi Markov Models (HSMM) to build a generative model of the data, and adapt the expectation-maximisation (EM) algorithm to that model, in order to learn, from daily operation data, the physical characteristics of the device, separated from those linked to the job load or the device configurations. Finally, we show some experimental results on a multifunction printing device.

关键词： energy conservation expectation-maximisation algorithm hidden Markov models power consumption printers EM algorithm HSMM NILM device infrastructure hidden semi Markov models learning energy consumption profiles multifunction printing device networked infrastructure nonintrusive load monitoring physical characteristics power consumption signature power disaggregation public service transaction processing terminal Data models Energy consumption Hidden Markov models Markov processes Optimization Power demand Printing expectation-maximisation algorithm Hidden Markov models Power consumption printers Power demand data models Printing energy consumption Physical characteristics Markov chain Energy conservation

来源：评论

学校读者我要写书评

暂无评论

Joint estimation of glottal source and vocal tract for vocal synthesis using Kalman smoothing and EM algorithm

Joint estimation of glottal source and vocal tract for vocal...

引用

Workshop on Applications of Signal Processing to Audio and Acoustics

作者： Jinachitra, P Smith, JO Stanford Univ CCRMA Stanford CA 94305 USA

ISBN: (纸本)0780391543

In this paper, a joint parameter estimation of the derivative glottal source waveform and the vocal tract filter is presented where aspiration noise and observation noise are taken into account within a state-space model. The Rosenberg-Klatt glottal model is used in Conjunction with an all-pole filter to model voice production. The EM algorithm is employed to iteratively estimate the model parameters in a maximum-likelihood sense. utilizing a Kalman smoother in the expectation step. The model and estimator allow for improved estimates of model parameters for resynthesis, yielding an output which sounds natural and remains flexible for modification, a desirable property for expressive vocal synthesis.

关键词： Kalman filters expectation-maximisation algorithm smoothing methods speech synthesis EM algorithm Kalman smoothing Rosenberg-Klatt glottal model all-pole filter aspiration noise glottal source waveform joint parameter estimation maximum-likelihood sense

来源：评论

学校读者我要写书评

暂无评论

Learning Multiple Non-Linear Sub-Spaces using K-RBMs

Learning Multiple Non-Linear Sub-Spaces using K-RBMs

引用

26th IEEE Conference on Computer Vision and Pattern Recognition (CVPR)

作者： Chandra, Siddhartha Kumar, Shailesh Jawahar, C. V. IIIT Hyderabad CVIT Hyderabad Andhra Pradesh India Google Hyderabad Andhra Pradesh India

ISBN: (纸本)9780769549897

Understanding the nature of data is the key to building good representations. In domains such as natural images, the data comes from very complex distributions which are hard to capture. Feature learning intends to discover or best approximate these underlying distributions and use their knowledge to weed out irrelevant information, preserving most of the relevant information. Feature learning can thus be seen as a form of dimensionality reduction. In this paper, we describe a feature learning scheme for natural images. We hypothesize that image patches do not all come from the same distribution, they lie in multiple non-linear subspaces. We propose a framework that uses K Restricted Boltzmann Machines (K-RBMS) to learn multiple non-linear subspaces in the raw image space. Projections of the image patches into these subspaces gives us features, which we use to build image representations. Our algorithm solves the coupled problem of finding the right non-linear subspaces in the input space and associating image patches with those subspaces in an iterative EM like algorithm to minimize the overall reconstruction error. Extensive empirical results over several popular image classification datasets show that representations based on our framework outperform the traditional feature representations such as the SIFT based Bag-of-Words (BoW) and convolutional deep belief networks.

关键词： Boltzmann machines expectation-maximisation algorithm feature extraction image classification image representation learning (artificial intelligence) natural scenes

来源：评论

学校读者我要写书评

暂无评论

Blind Modulation Classification for MIMO systems using expectation Maximization 33

Blind Modulation Classification for MIMO systems using Expec...

引用

33rd Annual IEEE Military Communications Conference on Affordable Mission Success - Meeting the Challenge (MILCOM)

作者： Zhu, Zhechen Nandi, Asoke K. Brunel Univ Sch Engn & Design Dept Elect & Comp Engn London UB8 2PL England

ISBN: (纸本)9781479967704

In this paper, we propose a blind modulation classifier for multiple-input multiple-output (MIMO) systems. The assumption of unknown channel matrix and noise variance has not been considered prior to this work. For each modulation candidate, the channel parameters are jointly estimated via expectation maximization (EM). The resulting estimation is used for the likelihood evaluation of the corresponding modulation candidate. Classification decision is reached using the maximum likelihood (ML) criterion. Classification performance is validated in simulated fading channel with white Gaussian noise. The proposed classifiers achieves robust classification accuracy in most scenarios for BPSK, QPSK, and 16-QAM modulations.

关键词： MIMO communication expectation-maximisation algorithm fading channels quadrature amplitude modulation quadrature phase shift keying 16-QAM modulations BPSK MIMO systems QPSK blind modulation classification expectation maximization maximum likelihood criterion noise variance simulated fading channel unknown channel matrix white Gaussian noise Accuracy Binary phase shift keying Channel estimation Estimation MIMO

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共50页 << < 28 29 30 31 32 33 34 35 36 37 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：