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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

14,478 篇 会议
2,084 篇 期刊文献
4 篇 学位论文
1 篇 资讯

馆藏范围

16,567 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

3,849 篇 工学
- 1,978 篇 电气工程
- 1,028 篇 计算机科学与技术...
- 612 篇 信息与通信工程
- 549 篇 控制科学与工程
- 398 篇 电子科学与技术（可...
- 339 篇 机械工程
- 313 篇 仪器科学与技术
- 273 篇 软件工程
- 101 篇 核科学与技术
- 99 篇 生物医学工程（可授...
- 81 篇 交通运输工程
- 53 篇 测绘科学与技术
- 38 篇 航空宇航科学与技...
- 31 篇 网络空间安全
- 28 篇 光学工程
- 24 篇 材料科学与工程（可...
- 21 篇 力学（可授工学、理...
810 篇 理学
- 317 篇 物理学
- 256 篇 数学
- 172 篇 系统科学
- 41 篇 地球物理学
- 20 篇 化学
- 18 篇 生物学
- 15 篇 统计学（可授理学、...
279 篇 管理学
- 275 篇 管理科学与工程(可...
222 篇 医学
- 178 篇 临床医学
- 75 篇 特种医学
- 22 篇 基础医学(可授医学...
136 篇 文学
- 136 篇 新闻传播学
29 篇 艺术学
- 28 篇 设计学（可授艺术学...
14 篇 军事学
12 篇 农学
8 篇 经济学
4 篇 教育学
2 篇 法学

主题

16,567 篇 iterative algori...
2,270 篇 iterative method...
2,022 篇 algorithm design...
1,655 篇 convergence
1,443 篇 iterative decodi...
1,096 篇 image reconstruc...
1,043 篇 computer science
1,036 篇 signal processin...
1,002 篇 clustering algor...
943 篇 equations
761 篇 robustness
753 篇 testing
635 篇 partitioning alg...
560 篇 computational mo...
546 篇 costs
530 篇 maximum likeliho...
485 篇 control systems
483 篇 parity check cod...
483 篇 hardware
472 篇 frequency

机构

45 篇 institute for in...
43 篇 school of electr...
35 篇 department of el...
30 篇 department of el...
30 篇 department of el...
28 篇 department of el...
27 篇 department of el...
27 篇 school of electr...
27 篇 department of el...
26 篇 school of electr...
25 篇 department of el...
24 篇 department of el...
22 篇 department of el...
22 篇 microsoft resear...
22 篇 department of el...
21 篇 school of electr...
21 篇 ibm thomas j. wa...
20 篇 department of el...
20 篇 department of el...
19 篇 department of el...

作者

23 篇 e. rogers
22 篇 j.a. fessler
22 篇 a.k. katsaggelos
21 篇 xianlong hong
18 篇 c.-c.j. kuo
18 篇 d.h. owens
17 篇 li zhang
15 篇 j. white
14 篇 a.e. yagle
14 篇 jing wang
14 篇 yonghuai liu
13 篇 shidong zhou
13 篇 a. anastasopoulo...
13 篇 chong-yung chi
13 篇 w.c. chew
12 篇 dacheng yang
12 篇 an-yeu wu
12 篇 m. fossorier
12 篇 m.a. king
12 篇 eric rogers

语言

16,150 篇 英文
347 篇 其他
66 篇 中文
2 篇 法文
1 篇 西班牙文
1 篇 土耳其文

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

共 16567 条记录，以下是201-210 订阅

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

详细简洁

排序：

Performance analysis of iterative decoding algorithms with memory

Performance analysis of iterative decoding algorithms with m...

引用

IEEE (first ITW conference of the year) Information Theory Workshop (ITW)

作者： Emil Janulewicz Amir H. Banihashemi Department of Systems and Computer Engineering Carleton University Ottawa ONT Canada

ISBN: (纸本)9781424463725

Density evolution is often used to determine the performance of an ensemble of low-density parity-check (LDPC) codes under iterative message-passing algorithms. Conventional density evolution techniques over memoryless channels are based on the independence assumption amongst all the processed messages in variable and check nodes. This assumption is valid for many algorithms such as standard belief propagation (BP) and min-sum (MS) algorithms. However, there are other important iterative algorithms such as successive relaxation (SR) versions of BP and MS, and differential decoding with binary message passing (DD-BMP) algorithm of Mobini et. al., for which this assumption is not valid. The dependence created among messages for these algorithms is due to the introduction of memory in the iterative algorithm. In this work, we propose a model for iterative decoding algorithms with memory which covers SR and DD-BMP algorithms as special cases. Based on this model, we derive a Bayesian network for iterative algorithms with memory over memoryless channels and use this representation to analyze the algorithms using density evolution. The density evolution technique is developed based on truncating the memory of the decoding process and approximating it with a finite order Markov process, and can be implemented efficiently. As an example, we apply our technique to analyze the performance of DD-BMP on regular LDPC code ensembles, and make a number of interesting observations with regard to the performance/complexity trade off of DD-BMP in comparison with BP and MS algorithms.

关键词： Performance analysis iterative decoding iterative algorithms Parity check codes Memoryless systems Strontium Algorithm design and analysis Belief propagation Message passing Bayesian methods

来源：评论

学校读者我要写书评

暂无评论

On soft-decision iterative decoding algorithms by using algebraic decoding for RS codes

On soft-decision iterative decoding algorithms by using alge...

引用

IEEE Conference and Exhibition on Global Telecommunications (GLOBECOM)

作者： H. Tokushige I. Hisadomi T. Kasami Hiroshima City University Asaminami Hiroshima Japan

We consider an iterative decoding algorithm by using algebraic decoding for non-binary codes. In the decoding algorithm, algebraic decoding are carried out with respect to successively chosen input words, called the search centers. We present a new method for selecting sequences of search centers of algebraic decoding. Over the AWGN channel using BPSK signaling, we show simulation results on the error performances of the iterative decoding algorithms whose search centers are given by the proposed method, abbreviated IAD, for Reed-Solomon codes. From the simulation results, IAD provides considerably better error performance than GMD and CGA decoding with the same number of iterations.

关键词： iterative decoding iterative algorithms Binary phase shift keying AWGN channels Block codes Binary codes Reed-Solomon codes Vectors Additive white noise Binary sequences

来源：评论

学校读者我要写书评

暂无评论

Hardware efficient two step iterative matching algorithms for VOQ switches

Hardware efficient two step iterative matching algorithms fo...

引用

International Conference on Parallel and Distributed Systems (ICPADS)

作者： Deng Pan Yuanyuan Yang Department of Computer Science State University of New York Stony Brook NY USA Department of Electrical and Computer Engineering State University of New York Stony Brook NY USA

Virtual output queued (VOQ) crossbar switches have been demonstrating advantages as high speed interconnects. They eliminate the head of line (HOL) blocking, which limits the maximum throughput of single input queued switches, and do not require switching fabrics with speedup capability, which prevents output queued switches from being cheaply implementable. Existing practical VOQ scheduling algorithms work in an iterative manner, and each iteration usually includes three steps: request, grant and accept. By incorporating arbitration into the request step, the accept step can be eliminated, and two step iterative matching can be achieved. While two step algorithms achieve almost identical performance as three step algorithms, they have extra advantages, such as simpler hardware implementation, shorter scheduling time, and less data exchange. As examples of two step iterative matching algorithms, we present two step parallel iterative matching (PIM2) and two step iSLIP (1SLIP2), and theoretically analyze the convergence property of PIM2. Furthermore, because the request step and grant step perform similar operations, and the two steps always progress in a sequential manner, we propose a hardware efficient implementation for two step iterative matching algorithms which requires only one set of arbitration logic. We conduct extensive simulations, and the results demonstrate that our analytical result on the average convergence iterations, in JV + e/(e - 1), is more accurate than the classical result, log 2 N + 4/3, and that two step algorithms and three step algorithms have almost identical performance

关键词： Hardware iterative algorithms Switches Scheduling algorithm Algorithm design and analysis Convergence Throughput Fabrics Logic Analytical models

来源：评论

学校读者我要写书评

暂无评论

iterative decoding algorithms of LDPC codes using TAP approach

Iterative decoding algorithms of LDPC codes using TAP approa...

引用

International Global Information Infrastructure Symposium (GIIS)

作者： Manel Abdelhedi Omessaad Hamdi Ammar Bouallegue ENIT SYSCOM Laboratory Tunis Tunisia

Low-density parity-check (LDPC) codes are based on random construction. Because of this randomness, it is not easy to analyze them with the traditional methods of communication theory. *** [6] was the first to point out that LDPC codes have a similarity to Ising spin systems in statistical physics. Besides, it has been shown that the Belief-Propagation algorithm, the decoding algorithm of LDPC codes, is equivalent to the Thouless-Anderson-Palmer(TAP) [9] approach. In this paper, we develop the log-likelihood ratios-Belief Propagation (LLR-BP) and the BP-Based decoding algorithms with the TAP approach.

关键词： iterative decoding iterative algorithms Parity check codes Digital video broadcasting Laboratories Physics Block codes Sparse matrices Equations Belief propagation

来源：评论

学校读者我要写书评

暂无评论

Estimation of the parameter covariance matrix for a one-compartment cardiac perfusion model estimated from a dynamic sequence reconstructed using MAP iterative reconstruction algorithms

Estimation of the parameter covariance matrix for a one-comp...

引用

IEEE Symposium on Nuclear Science (NSS/MIC)

作者： G.T. Gullberg R.H. Huesman D.N. Ghosh Roy Jinyi Qi B.W. Reutter E. O. Lawrence Berkeley National Laboratory Berkeley CA USA Center of Space Physics Boston University Boston MA USA

In dynamic cardiac SPECT estimates of kinetic parameters of a one-compartment perfusion model are usually obtained in a two step process: 1) first a MAP iterative algorithm, which properly models the Poisson statistics and the physics of the data acquisition, reconstructs a sequence of dynamic reconstructions, 2) then kinetic parameters are estimated from time activity curves generated from the dynamic reconstructions. This paper provides a method for calculating the covariance matrix of the kinetic parameters, which are determined using weighted least squares fitting that incorporates the estimated variance and covariance of the dynamic reconstructions. Sequential tomographic projections are reconstructed into a sequence of transaxial reconstructions for each transaxial slice using for each reconstruction in the time sequence the fixed-point solution to the MAP reconstruction. Time-activity curves for a sum of activity in a blood region inside the left ventricle and a sum in a cardiac tissue region, for the variance of the two estimates of the sum, and for the covariance between the two ROI estimates are generated at convergence. A one-compartment model is fit to the tissue activity curves assuming a noisy blood input function to give weighted least squares estimates of blood volume fraction, wash-in and wash-out rate constants specifying the kinetics for the left ventricular myocardium. Numerical methods are used to calculate the second derivative of the chi-square criterion to obtain estimates of the covariance matrix for the weighted least square parameter estimates. Even though the method requires one matrix inverse for each time interval of tomographic acquisition, efficient estimates of the tissue kinetic parameters in a dynamic cardiac SPECT study can be obtained with present day desk-top computers.

关键词： Parameter estimation Covariance matrix Reconstruction algorithms Kinetic theory Least squares approximation Blood Tomography iterative algorithms Statistics Physics

来源：评论

学校读者我要写书评

暂无评论

Fast iterative solution algorithms for the frequency-domain layered finite-element based analysis of large-scale on-chip interconnect structures

Fast iterative solution algorithms for the frequency-domain ...

引用

IEEE Topical Meeting on Electrical Performance of Electronic Packaging (EPEPS)

作者： Feng Sheng Dan Jiao School of Electrical and Computer Engineering Purdue University West Lafayette IN USA

An effective preconditioner P is proposed in this work for solving the surface-unknown-based reduced system matrix in the frequency-domain layered finite element method. This preconditioner is effective because it can converge the iterative solution of the reduced system matrix in a few iterations. It is computationally efficient because P -1 b with b being an arbitrary vector can be obtained in linear complexity in both CPU time and memory consumption. With this preconditioner, the reduced system matrix in the layered finite element method is solved efficiently. The algorithms are rigorous without making any approximation. They apply to any arbitrarily-shaped multilayer structure. Numerical and experimental results demonstrated the accuracy, effectiveness, and efficiency of the proposed fast solution algorithms in analyzing large-scale on-chip interconnects.

关键词： iterative algorithms Frequency domain analysis Finite element methods Algorithm design and analysis Large-scale systems Integrated circuit interconnections Transmission line matrix methods Dielectric substrates Nonhomogeneous media Capacitance

来源：评论

学校读者我要写书评

暂无评论

Recursive and iterative estimation algorithms for multiresolution stochastic processes

Recursive and iterative estimation algorithms for multiresol...

引用

IEEE Conference on Decision and Control

作者： K.C. Chou A.S. Willsky A. Benveniste M. Basseville Department of Electrical Engineering and Computer Science Laboratory of Information and Decision Systems MIT Cambridge MA USA IRISA Campus Universitaire de Beaulieu Rennes France

A particular class of processes defined on dyadic trees is treated. Three algorithms are given for optimal estimation/reconstruction for such processes: one reminiscent of the Laplacian pyramid and making efficient use of Haar transforms, a second that is iterative in nature and can be viewed as a multigrid relaxation algorithm, and a third that represents an extension of the Rauch-Tung-Striebel algorithm to processes on dyadic trees. The last involves a discrete Riccati equation, which in this case has three steps: prediction, merging and measurement update. Related work and extensions are briefly discussed.< >

关键词： Recursive estimation iterative algorithms Stochastic processes Signal processing Multiresolution analysis Wavelet transforms Laplace equations Riccati equations Signal resolution Computer science

来源：评论

学校读者我要写书评

暂无评论

Concurrent iterative reconstruction algorithms (CIRAs) in multi-headed SPECT systems

Concurrent iterative reconstruction algorithms (CIRAs) in mu...

引用

IEEE Symposium on Nuclear Science (NSS/MIC)

作者： X. Wu J.K. Brown H.R. Tang S.C. Blankespoor B.H. Hasegawa Department of Radiology University of California San Francisco San Francisco CA USA

We are developing concurrent iterative reconstruction algorithms (CIRAs) that use partial sets of projection data to perform iterative reconstruction concurrently with data acquisition. In this study, we investigate CIRAs for multi-headed SPECT systems by simulating data for clinically relevant configurations. We study CIRAs for multi-headed SPECT under three different clinically feasible instances and identify the camera geometries and data acquisition protocols that are favorable for the convergence rates of CIRAs. We demonstrate that CIRA converges faster if projections from widely differing angular views, rather than from consecutive angular views, are available early during the data acquisition. Specifically, we show that CIRAs with single-headed and triple-headed systems show similar convergence rates, and are more efficient than CIRAs with the opposed dual-headed systems. In all cases, CIRAs take less total time to acquire and reconstruct images than conventional reconstruction methods with single-headed or multi-headed SPECT systems.

关键词： Reconstruction algorithms Data acquisition Image reconstruction Convergence Cameras Electrical capacitance tomography iterative algorithms Geometry Protocols Heart

来源：评论

学校读者我要写书评

暂无评论

Application of the Ontological Approach to the iterative GMDH algorithms Metamodel Construction

Application of the Ontological Approach to the Iterative GMD...

引用

International Computer Sciences and Information Technologies (CSIT)

作者： Halyna Pidnebesna Yevgeniya Savchenko-Synyakova Volodymyr Stepashko Department for Information Technologies of Inductive Modelling Systems of the NAS and MES International Research and Training Centre for Information Technologies Kyiv Ukraine

ISBN: (纸本)9798350334326

Construction of an ontological metamodel of iterative algorithms is proposed to structure knowledge about these algorithms and their implementation. The metamodel will automate the design and use of specialized software for solving specific applied modeling problems. The advantage of iterative GMDH algorithms over combinatorial ones is that they allow the big datasets processing. The known generalized iterative algorithm, allows you to create typical architectures of previously developed modifications of these algorithms when setting up various modes of operation of this algorithm. The authors have developed an ontological metamodel of iterative GMDH algorithms using the Protégé environment.

关键词： Computational modeling Software algorithms Buildings Metamodeling Computer architecture iterative algorithms Data models

来源：评论

学校读者我要写书评

暂无评论

The simulation of concurrent iterative reconstruction algorithms for single photon emission computed tomography

The simulation of concurrent iterative reconstruction algori...

引用

IEEE Symposium on Nuclear Science (NSS/MIC)

作者： J.K. Brown B.H. Hasegawa National Institutes of Health DHHS CA USA Department of Radiology and the Bioengineering Graduate Group University of California San Francisco USA

iterative reconstruction algorithms for emission computed tomography potentially offer significantly improved qualitative and quantitative images when compared to those generated by the analytic methods commonly used today, however, iterative techniques require extensive computational resources for use in clinical environments. The authors have developed a new class of iterative reconstruction algorithms designed such that they can be executed concurrently with the acquisition of emission projection data. This feature can dramatically reduce the number of post-acquisition iterations required to reconstruct a complete set of projection data. An important aspect of these algorithms is the method used to select which projections are processed during each concurrent iteration. The method used to partition projections into subsets impacts, among other issues, the convergence rate, stability and spatial resolution of the concurrent algorithms. Via simulations of concurrent SPECT reconstruction, the authors have demonstrated the feasibility of the technique using two projection subset construction methods (independent and sequential subsets). Their preliminary results indicate that both subset construction methods can be used to shorten the post-acquisition reconstruction time, although sequential subsets are generally more efficient. The authors also observe that if SPECT projections are acquired over a period of T seconds, the post-acquisition reconstruction time can be reduced by at least (1/3)T seconds.< >

关键词： Reconstruction algorithms Image reconstruction iterative methods Algorithm design and analysis Partitioning algorithms Computational modeling Computed tomography Image analysis iterative algorithms Convergence

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 17 18 19 20 21 22 23 24 25 26 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：