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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,300 篇 期刊文献
460 篇 会议
5 篇 学位论文

馆藏范围

1,765 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,209 篇 工学
- 489 篇 电气工程
- 366 篇 计算机科学与技术...
- 179 篇 信息与通信工程
- 169 篇 控制科学与工程
- 163 篇 仪器科学与技术
- 130 篇 航空宇航科学与技...
- 83 篇 机械工程
- 83 篇 电子科学与技术（可...
- 66 篇 软件工程
- 49 篇 力学（可授工学、理...
- 46 篇 光学工程
- 31 篇 材料科学与工程（可...
- 30 篇 交通运输工程
- 26 篇 生物医学工程（可授...
- 19 篇 土木工程
- 18 篇 石油与天然气工程
- 14 篇 动力工程及工程热...
- 11 篇 测绘科学与技术
770 篇 理学
- 513 篇 数学
- 179 篇 物理学
- 50 篇 统计学（可授理学、...
- 38 篇 系统科学
- 22 篇 生物学
- 16 篇 化学
- 12 篇 地球物理学
194 篇 管理学
- 188 篇 管理科学与工程(可...
88 篇 医学
- 60 篇 临床医学
- 29 篇 基础医学(可授医学...
- 29 篇 特种医学
37 篇 经济学
- 29 篇 应用经济学
12 篇 农学
4 篇 法学
3 篇 教育学
3 篇 艺术学
2 篇 文学

主题

1,765 篇 iterative algori...
146 篇 iterative method...
95 篇 convergence
46 篇 image reconstruc...
41 篇 optimization
30 篇 parameter estima...
30 篇 fixed point
25 篇 array signal pro...
24 篇 convergence anal...
24 篇 banach space
24 篇 strong convergen...
23 篇 variational ineq...
23 篇 algorithm design...
22 篇 nonexpansive map...
21 篇 resolvent operat...
21 篇 optimisation
20 篇 hilbert space
20 篇 mimo
19 篇 channel estimati...
19 篇 interpolation an...

机构

17 篇 sichuan univ dep...
15 篇 sichuan normal u...
12 篇 shanghai normal ...
10 篇 aligarh muslim u...
9 篇 tianjin polytech...
9 篇 civil aviat univ...
9 篇 sichuan normal u...
8 篇 nanyang technol ...
8 篇 ain shams univ f...
7 篇 univ tehran coll...
7 篇 jiangnan univ sc...
7 篇 zhejiang univ de...
7 篇 southeast univ n...
7 篇 natl sun yat sen...
6 篇 menoufia univ fa...
6 篇 king saud univ c...
6 篇 shanxi univ sch ...
6 篇 jiangsu univ sci...
6 篇 nanjing univ aer...
6 篇 univ hong kong d...

作者

14 篇 hajarian masoud
14 篇 ding feng
11 篇 yao yonghong
10 篇 dehghan mehdi
10 篇 bayoumi ahmed m....
10 篇 lam james
10 篇 ding xp
9 篇 balooee javad
9 篇 kang shin min
9 篇 ding xie ping
9 篇 liu chein-shan
8 篇 huang nan-jing
7 篇 beik fatemeh pan...
7 篇 saito t
7 篇 yang gang
7 篇 ramadan mohamed ...
7 篇 komatsu t
7 篇 liang ying-chang
7 篇 huang nj
7 篇 yao jen-chih

语言

1,594 篇 英文
145 篇 其他
23 篇 中文
3 篇 俄文
1 篇 德文
1 篇 法文

检索条件"主题词=iterative algorithm"

共 1765 条记录，以下是1241-1250 订阅

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

详细简洁

排序：

Nonsmooth Optimization-Based Beamforming in Multiuser Wireless Relay Networks

Nonsmooth Optimization-Based Beamforming in Multiuser Wirele...

引用

4th International Conference on Signal Processing and Communication Systems (ICSPCS)/12th International Symposium on DSP and Communication Systems (DSPCS)/9th Workshop on the Internet, Telecommunications and Signal Processing (WTSP)

作者： Phan, A. H. Tuan, H. D. Kha, H. H. Nguyen, Ha H. Univ New S Wales Sch Elect Engn & Telecommun Unsw Sydney NSW 2052 Australia Univ Saskatchewan Dept Elect & Comp Engn Saskatoon S7N 5A9 SK Canada

ISBN: (纸本)9781424479078

The amplify-and-forward (AF) relay beamforming problems are naturally formulated as indefinite quadratic (nonconvex) optimization programs. The typical methods for solving such optimization problems are to transform them into convex semi-definite programs (SDPs) with additional rank-one (nonconvex and discontinuous) constraints. The rank-one constraints are then dropped to obtain solvable SDP relaxed problems and randomization techniques are employed for seeking the feasible solutions to the original nonconvex optimization problems. In many conventional scenarios, the results from solving the rank-one relaxed SDP problems are enough to conclude the solutions since no rank-higher-than-one SDP resulting matrix can be observed. Through our simulations, we found that there are also many scenarios that the SDP solvers give high-rank solutions. Hence, in this paper the rank-one constraints are equivalently expressed as reverse convex constraints and are incorporated into the optimization problems. Then, we propose an efficient iterative algorithm for solving the nonsmooth reverse convex optimization problems. Our simulations show that our proposed approach yields nearly global optimal solutions.

关键词： amplify and forward communication amplify-and-forward relay beamforming array signal processing indefinite quadratic optimization programs iterative algorithm iterative methods multiuser wireless relay networks nonsmooth optimization-based beamforming qua

来源：评论

学校读者我要写书评

暂无评论

Information Theoretic Optimal Broadband Matching for Communication Systems

Information Theoretic Optimal Broadband Matching for Communi...

引用

IEEE Global Telecommunications Conference (GLOBECOM 2010)

作者： Taluja, Pawandeep S. Hughes, Brian L. N Carolina State Univ Dept Elect & Comp Engn Raleigh NC 27695 USA

ISBN: (纸本)9781424456383

We present an information theoretic perspective on optimal broadband matching. Most of the broadband matching and communication theory literature assumes a frequency-flat reflection coefficient. We derive the optimal capacity and matching network characteristic for a broadband system from an information theoretic view point while incorporating the broadband matching limitations. We also propose an iterative algorithm to arrive at the optimal solution. We illustrate by an example that a white characteristic for a matching network is often sub-optimal for a system with a non-white transfer function.

关键词： MIMO communication MIMO systems communication systems communication theory frequency-flat reflection coefficient information theoretic optimal broadband matching iterative algorithm iterative methods matching network characteristic nonwhite transfer funct

来源：评论

学校读者我要写书评

暂无评论

A Novel algorithm for Multiple Space Vehicles Positioning

A Novel Algorithm for Multiple Space Vehicles Positioning

引用

International Conference on Advanced Measurement and Test (AMT 2010)

作者： Gao Jun-yao Yang Jing-shu Zeng Fang-ling Inst Elect Engn Lab 702 Hefei 230037 Anhui Peoples R China

ISBN: (纸本)0878492712

The paper presents a novel algorithm for multiple space vehicles positioning. The algorithm first positions the ground stations using multiple space vehicles with initial coordinates, then calculates the differences of the ground stations position results and their real coordinates, at last uses the differences to estimate the revised error for space vehicles' coordinates. It can use iterative method to achieve needed precision of the SV's coordinates. At last, simulation results prove the stability and credibility of the algorithm in space vehicles positioning.

关键词： Target localization Taylor-serials expansion iterative algorithm Range-sum position

来源：评论

学校读者我要写书评

暂无评论

The Novel iterative Interference Alignment Scheme for the SISO Interference Channel

The Novel Iterative Interference Alignment Scheme for the SI...

引用

2010 IEEE 71st Vehicular Technology Conference

作者： Shen, Hui Li, Bin Huawei Technol Dept Wireless Res Shenzhen Peoples R China

ISBN: (纸本)9781424425198

In this paper, we propose a novel iterative interference alignment (IA) scheme for the single-input single-output (SISO) interference channel system using minimum total mean square error criterion under the individual transmitter power constraints. We show that interference alignment under such criterion could be realized through an iterative algorithm. The convergence of the proposed algorithm is discussed. Simulation results, compared with several existing IA schemes, show that the proposed scheme can effectively improve the BER performance of the SISO interference channel system while maintaining the same degree of freedom as Cadambe-Jafar scheme.

关键词： SISO interference channel interference alignment iterative algorithm

来源：评论

学校读者我要写书评

暂无评论

Fast Parallel Processing using GPU in computing L1-PCA bases

Fast Parallel Processing using GPU in computing L1-PCA bases

引用

IEEE Region 10 Conference on TENCON 2010

作者： Funatsu, Nobuhiro Kuroki, Yoshimitsu Kurume Natl Coll Technol Kurume Fukuoka 8308555 Japan

ISBN: (纸本)9781424468904

In data-analysis problems with a large number of dimensions, the principal component analysis based on L2-norm ( L2-PCA) is one of the most popular methods, but L2-PCA is sensitive to outliers. Unlike L2-PCA, PCA-L1 is robust to outliers because it utilizes the L1-norm, which is less sensitive to outliers;therefore, some studies have shown the superiority of PCA-L1 to L2-PCA [2][3]. However, PCA-L1 requires enormous computational cost to obtain the bases, because PCA-L1 employs an iterative algorithm, and initial bases are eigenvectors of autocorrelation matrix. The autocorrelation matrix in the PCA-L1 needs to be recalculated for the each basis besides. In previous works [3], the authors proposed a fast PCA-L1 algorithm providing identical bases in terms of theoretical approach, and decreased computational time roughly to a quarter. This paper attempts to accelerate the computation of the L1-PCA bases using GPU.

关键词： GPU L2-PCA L2-norm autocorrelation matrix eigenvectors computer graphic equipment coprocessors data analysis data analysis problem eigenvalues and eigenfunctions fast parallel processing iterative algorithm iterative methods matrix algebra parallel proces

来源：评论

学校读者我要写书评

暂无评论

A Reverse Convex Programming for Beamforming in Cognitive Multicast Transmission

A Reverse Convex Programming for Beamforming in Cognitive Mu...

引用

3rd International Conference on Communications and Electronics

作者： Phan, A. H. Tuan, H. D. Kha, H. H. Ngo, D. T. Univ New South Wales Sch Elect Engn & Telecommun UNSW Sydney NSW 2052 Australia McGill Univ Dept Elect & Comp Engn Montreal PQ Canada

ISBN: (纸本)9781424470587

The cognitive beamforming problems are naturally formulated as indefinite quadratic (nonconvex) optimization programs. The typical methods for solving such optimization problems are to transform them into convex semi-definite programs (SDPs) with additional rank-one (nonconvex and discontinuous) constraints. The rank-one constraints are then dropped to obtain solvable SDP relaxed problems and randomization techniques are employed for seeking the feasible solutions to the original nonconvex optimization problems. In many practical cases, these approaches fail to deliver satisfactory solutions, i.e., their solutions are very far from the optimal ones. In contrast, in this paper the rank-one constraints are equivalently expressed as reverse convex constraints and are incorporated into the optimization problems. Then, we propose an efficient iterative algorithm for solving the nonsmooth reverse convex optimization problems. Our simulations show that our proposed approach yields nearly global optimal solutions with much less computational load as compared to the conventional one.

关键词： array signal processing cognitive beamforming problems cognitive multicast transmission cognitive radio convex programming convex semidefinite programs indefinite quadratic optimization iterative algorithm iterative methods multicast communication optimisation randomization techniques reverse convex programming

来源：评论

学校读者我要写书评

暂无评论

True 2^nd Order Transmission Condition in Conjunction with Corner Edge Penalty Term for Non-conformal Domain Decomposition Methods in Solving Time-Harmonic Maxwell Equations

True 2<SUP>nd</SUP> Order Transmission Condition in Conjunct...

引用

2010 IEEE International Symposium Antennas and Propagation/CNC-USNC/URSI Radio Science Meeting

作者： Peng, Zhen Lee, Jin-Fa Ohio State Univ Electrosci Lab Columbus OH 43210 USA

Non-overlapping domain decomposition methods (DDMs) have been shown to provide efficient iterative algorithm for the finite element (FE) solution of the time-harmonic electromagnetic wave problems.

ISBN: (纸本)9781424449682

Non-overlapping domain decomposition methods (DDMs) have been shown to provide efficient iterative algorithm for the finite element (FE) solution of the time-harmonic electromagnetic wave problems.

关键词： Maxwell equations conjunction corner edge penalty term finite element analysis finite element solution iterative algorithm iterative methods nonconformal domain decomposition time-harmonic Maxwell equations time-harmonic electromagnetic wave problems true 2nd order transmission condition

来源：评论

学校读者我要写书评

暂无评论

Regularized Reconstruction of Irregularly Sampled Scalar Light Fields

Regularized Reconstruction of Irregularly Sampled Scalar Lig...

引用

9th Euro-American Workshop on Information Optics

作者： Uzunov, Vladislav Gotchev, Atanas Egiazarian, Karen Tampere Univ Technol Dept Signal Proc POB 553 FIN-33101 Tampere Finland

ISBN: (纸本)9781424482276

This paper addresses the problem of reconstruction of a monochromatic light field based on data points, irregularly distributed within a volume of interest. Such set up is considered to serve a wide area of applications related with three-dimensional display and beam shaping, where physically inconsistent input data is commonly available. Finite-dimensional models of scalar light fields are used to state the reconstruction problem as matrix inversion. Regularized inversion is done by the Tikhonov method, implemented by the iterative algorithm of conjugate gradients. The problem proves to be ill-posed, where the data points inconsistency is fully compensated by the regularized inversion, showing to be attractive for any application.

关键词： 3D display Tikhonov method beam shaping computer generated holography conjugate gradients finite-dimensional model holography image reconstruction irregularly sampled scalar light field iterative algorithm iterative methods matrix inversion optical pulse shaping regularized inversion regularized reconstruction

来源：评论

学校读者我要写书评

暂无评论

A Simple and Effective Testing Method for the Implementation of Turbo Decoders

A Simple and Effective Testing Method for the Implementation...

引用

6th International Conference on Wireless Communications, Networking and Mobile Computing (WICOM)

作者： Ma, Zheng Fan, Pingzhi Mow, Wai Ho Southwest Jiaotong Univ Prinvential Key Lab Informat Coding & Transmiss Chengdu 610031 Sichuan Peoples R China Hong Kong Univ Sci & Technol Dept EEE Hong Kong Hong Kong Peoples R China

ISBN: (纸本)9781424437092

It is well-known that Turbo codes are very useful in digital communications. However, due to the existence of interleaver/deinterleaver, there is no effective way available to test the correctness of the 'turbo' algorithms in practical use such as FPGA/DSP implementation, especially in very low bit error rate. In this paper, based on the extractable theoretical bounds for interleaver by-passed systems, a simple but effective testing method is proposed by separating the turbo coder into interleaver/deinterleaver part and soft-in soft-out (SISO)-iterative decoding part. Our analysis and simulation results for turbo code shows that the proposed method brings no extra cost in implementation and is proved to be practical and effective. In principle, the proposed method can be generalized to almost all turbo or turbo-like systems, in which the theoretical bounds can be extracted in the absence of interleaver/de-interleaver.

关键词： Turbo system Interleaver iterative algorithm testing technology FPGA/DSP

来源：评论

学校读者我要写书评

暂无评论

Rank Constrained Schur-Convex Optimization with Multiple Trace/Log-Det Constraints

Rank Constrained Schur-Convex Optimization with Multiple Tra...

引用

IEEE Global Telecommunications Conference (GLOBECOM 2010)

作者： Yu, Hao Lau, Vincent K. N. Hong Kong Univ Sci & Technol Dept Elect & Comp Engn Hong Kong Hong Kong Peoples R China

ISBN: (纸本)9781424456383

In this paper, we focus on a rank constrained optimization problem with general Schur-convex/concave objective function and multiple trace/log-determinant constraints. We first derive a structural result on the optimal solution of the rank constrained problem without relaxation using majorization theory. Based on the solution structure, we transform the rank constrained problem into an equivalent problem with a unitary constraint. After that, we derive an iterative projected steepest descent algorithm which converges to a local optimal solution. Furthermore, we shall show that under some special cases, we could even derive closed form global optimal solution. The numerical results show the superior performance of the our proposed technique over the baseline schemes, the rank relaxation based randomization technique.

关键词： Schur-convex optimization convex programming gradient methods iterative algorithm multiple trace/log-det constraints randomised algorithms randomization technique rank constrained problem signal processing steepest descent algorithm unitary constraint

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共177页 << < 121 122 123 124 125 126 127 128 129 130 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：