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

2011 4th IEEE International Conference on Computer Science and Information Technology(ICCSIT 2011)

作者： Yang Liu School of Science, Wuhan University of Technology, Wuhan,China Liang Zhang School of Science, Wuhan University of Technology, Wuhan,China

In this paper we investigate the parallel iterative algorithm of parabolic *** we introduce the concept of mathematics stencil to the Crank-Nicolson difference scheme of parabolic equation and the stencil elimination procedure,then we construct an iterative algorithm which has intrinsic *** convergence theory is discussed in ***,some numerical experiments are provided to show the efficiency of the new algorithm.

关键词： iterative algorithm stencil elimination method finite difference parallel parabolic equation

来源：评论

学校读者我要写书评

暂无评论

A provably good approximation algorithm for Rectangle Escape Problem with application to PCB routing 11

A provably good approximation algorithm for Rectangle Escape...

引用

Asia and South Pacific Design Automation Conference

作者： Qiang Ma Hui Kong Martin D. F. Wong Evangeline F. Y. Young Department of Electrical and Computer Engineering University of Illinois Urbana-Champaign USA Department of Computer Science and Engineering Chinese University of Hong Kong Hong Kong China

ISBN: (纸本)9781424475162

In this paper, we introduce and study the Rectangle Escape Problem (REP), which is motivated by PCB bus escape routing. Given a rectangular region R and a set S of rectangles within R, the REP is to choose a direction for each rectangle to escape to the boundary of R, such that the resultant maximum density over R is minimized. We prove that the REP is NP-Complete, and show that it can be formulated as an Integer Linear Program (ILP). A provably good approximation algorithm for the REP is developed by applying Linear Programming (LP) relaxation and a special rounding technique to the ILP. This approximation algorithm is also shown to work for a more general version of REP with weights (weighted REP). In addition, an iterative refinement procedure is proposed as a postprocessing step to further improve the results. Our approach is tested on a set of industrial PCB bus escape routing problems. Experimental results show that the optimal solution can be obtained within 3 seconds for each of the test cases.

关键词： Approximation algorithms Routing Approximation methods Tiles algorithm design and analysis iterative algorithm Polynomials

来源：评论

学校读者我要写书评

暂无评论

Discrete-Time Nonlinear Stochastic Optimal Control in Its Expectation

Discrete-Time Nonlinear Stochastic Optimal Control in Its Ex...

引用

2011 World Congress on Engineering and Technology(CET 2011)

作者： Sie Long Kek Mohd Ismail Abd Aziz Kok Lay Teo Rohanin Ahmad Department of Mathematics Universiti Tun Hussein Onn Malaysia Johor Malaysia Department of Mathematics Universiti Teknologi Malaysia Johor Malaysia Department of Mathematics and Statistics Curtin University of Technology Perth Australia

This paper presents an expectation solution for discrete-time nonlinear stochastic optimal control problems. In the algorithm proposed, a model-based optimal control problem is solved instead of solving the original optimal control problem. Although the structures of these optimal control problems are different, a novel computation scheme is established from an interactive integration based on system optimization and parameter estimation. The model updated with the repetitively adjusted parameters addresses the differences between the real plant and the model that are measured. In this way, the repeated solutions converge to the correct expectation solution of the original optimal control problem despite model-reality differences. To illustrate, the optimal control of a nonlinear continuous stirred tank reactor problem is studied. The simulation results obtained demonstrate the efficiency of the algorithm proposed.

关键词： stochastic optimal control model-reality differences expectation solution parameter estimation iterative algorithm

来源：评论

学校读者我要写书评

暂无评论

iterative Language Model Adaptation for Large Vocabulary Continuous Speech Recognition

Iterative Language Model Adaptation for Large Vocabulary Con...

引用

2011 4th IEEE International Conference on Computer Science and Information Technology(ICCSIT 2011)

作者： Ing Yann Soon School of Electrical and Electronic Engineering Nanyang Technological University Singapore

In this paper,an iterative language model adaptation algorithm for large vocabulary continuous speech recognition is proposed.A closed loop feedback system is established for language model *** the help of confidence measure,the testing material is transferred back for language model *** acoustic score is used as confidence measure to generate the feedback speech *** proposed algorithm is designed to improve the performance of automatic speech recognition(ASR)systems in terrible situations such as insufficient training material and out of vocabulary *** tests are performed on the TIMIT database which is chosen as a simulation of the above mentioned *** results with different iteration numbers are *** results show that significant improvement has been reached by the proposed algorithm. The word error rate(WER)reduction reaches 11.1%.For the sentence level recognition result,a relative improvement of 12.78%is achieved.

关键词： language model adaptation iterative algorithm confidence measures large vocabulary speech recognition TIMIT database

来源：评论

学校读者我要写书评

暂无评论

PAPR Reduction iterative algorithm via Adding Weights to Amplitudes and Phases of OFDM Subcarriers

PAPR Reduction Iterative Algorithm via Adding Weights to Amp...

引用

3rd International Conference on Wireless Communications, Networking and Mobile Computing (WiCOM 2007)

作者： Yao Rugui Wang Yongsheng Kong Weidong Xu Juan Northwestern Polytech Univ Sch Elect & Informat Syst Xian 710072 Peoples R China Northwestern Polytech Univ Sch Comp Sci & Technol Xian Peoples R China

ISBN: (纸本)9781424413119

In this paper, we propose a novel and effective Peak-to-Average Power Ratio (PAPR) reduction algorithm for Orthogonal Frequency Division Multiplexing (OFDM) signals that uses a group of appropriate weights in both amplitude and phases fixed on subcarriers in the frequency domain. Also we deduce a iterative formula to compute the weights. Compared with Partial Transmit Sequence (PTS) and Selected Mapping (SLM) algorithms, the proposed algorithm shows its better performance on PAPR reduction. Bit error rate (BER) analysis indicates that the amplitude of the weights has a great impact on the BER performance of the system. Appropriate restriction on the amplitude can get good performance in both PAPR and BER. Simulation results show that the proposed algorithm is better than PTS and SLM algorithm in PAPR reduction performance, while satisfying BER performance, for example, PAPR reduction can be up to 2.5dB decrease when dividing the subcarriers into 4 subgroups.

关键词： PAPR reduction OFDM iterative algorithm weights subcarrier

来源：评论

学校读者我要写书评

暂无评论

A Compressive Sensing Reconstruction algorithm for Trinary and Binary Sparse Signals Using Pre-mapping

A Compressive Sensing Reconstruction Algorithm for Trinary a...

引用

Data Compression Conference (DCC)

作者： Xinyu Zhang Zhuoyuan Chen Jiangtao Wen Jianwei Ma Yuxing Han John Villasenor Tsinghua University Beijing China Florida State University Tallahassee FL USA University of California Los Angeles CA USA

In this paper, we first analyze impact of the distribution of sparse signals on reconstruction quality in compressive sensing through experimental results and heuristic analysis. We suggest that trinary/binary sparse signals are one of the most difficult signals to reconstruct in terms of error bounds. We then show that by incorporating linear or non-linear mapping prior to sensing, significant improvement in the recovery performance can be achieved.

关键词： Signal to noise ratio Reconstruction algorithms Compressed sensing Matching pursuit algorithms iterative algorithm Minimization Gaussian distribution

来源：评论

学校读者我要写书评

暂无评论

iterative solutions for general coupled matrix equations with real coefficients

Iterative solutions for general coupled matrix equations wit...

引用

American Control Conference

作者： Li Xie Huizhong Yang Yanjun Liu Feng Ding Key Laboratory of Advanced Process Control for Light Industry (Ministry of Education) and the Control Science and Engineering Research Center Jiangnan University Wuxi 214122 P.R. China

ISBN: (纸本)9781457700811

This paper applies the hierarchical identification principle and the gradient search method to study iterative solutions for a class of general coupled matrix equations with real coefficients. As long as the convergence factors are appropriately chosen, the proposed algorithms for any initial values can provide iterative solutions that are arbitrarily close to the unique solutions of the equations. Two numerical examples are given to demonstrate the effectiveness of the proposed algorithms.

关键词： Coupled matrix equations hierarchical identification gradient search iterative algorithm estimation

来源：评论

学校读者我要写书评

暂无评论

Some iterative algorithms for the obstacle problems

引用

INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS 2010年第11期87卷 2493-2502页

作者： Lian, Xiao-Peng Cen, Zhongdi Cheng, Xiao-Liang Zhejiang Wanli Univ Inst Math Ningbo Zhejiang Peoples R China Zhejiang Univ Dept Math Hangzhou 310003 Zhejiang Peoples R China

In this paper we propose some iterative algorithms for the obstacle problems discretized by the finite difference method. We rewrite the obstacle problem to an equivalent complementarity problem. We use the regularization trick to non-smooth absolute function. Then we apply the Newton's method to obtain an iterative algorithm. Some other two algorithms based on this algorithm are derived. Numerical experiments show the effective of the algorithm.

关键词： obstacle problem iterative algorithm complementarity problem finite difference monotone iteration

来源：评论

学校读者我要写书评

暂无评论

Solvability and convergence of iterative algorithms for certain functional equations arising in dynamic programming

引用

OPTIMIZATION 2010年第6期59卷 887-916页

作者： Liu, Zeqing Kang, Shin Min Ume, Jeong Sheok Liaoning Normal Univ Dept Math Dalian 116029 Liaoning Peoples R China Gyeongsang Natl Univ Dept Math Jinju 660701 South Korea Gyeongsang Natl Univ Res Inst Nat Sci Jinju 660701 South Korea Changwon Natl Univ Dept Appl Math Chang Won 641773 South Korea

In this article, we introduce and study the following functional equation arising in dynamic programming of multistage decision processes: [image omitted] In order to solve the functional equation, we suggest some iterative algorithms. Under certain conditions we give a few sufficient conditions ensuring both the existence and uniqueness of solution for the functional equation and the convergence of these iterative algorithms with respect to the solution. We investigate also properties of nonpositive solutions and nonnegative solutions for several functional equations which are special cases of the above mentioned functional equation. To illustrate the results presented in this article, we construct eight nontrivial examples.

关键词： dynamic programming functional equation solution nonpositive solution nonnegative solution nonexpansive mapping Banach fixed-point theorem iterative algorithm

来源：评论

学校读者我要写书评

暂无评论

Implicit space mapping with adaptive selection of preassigned parameters

引用

IET MICROWAVES ANTENNAS & PROPAGATION 2010年第3期4卷 361-373页

作者： Koziel, S. Cheng, Q. S. Bandler, J. W. Reykjavik Univ Sch Sci & Engn Engn Optimizat & Modeling Ctr IS-103 Reykjavik Iceland McMaster Univ Dept Elect & Comp Engn Simulat Optimizat Syst Res Lab Hamilton ON L8S 4K1 Canada Bandler Corp Dundas ON L9H 5E7 Canada

Implicit space mapping is one of the latest developments in space mapping (SM) technology. Its advantage is that the variables (the so-called preassigned parameters) used to adjust the surrogate model to have it match the fine model are typically separate from the design variables. Also, implicit space mapping offers greater flexibility in creating and enhancing surrogate models. Still, choosing the proper model as well as the right set of preassigned parameters - both being critical for the performance of the space mapping algorithm - is an open problem. Here, the authors apply suitable assessment techniques that help in automatically making the right selection of the model and, consequently, its associated parameters. The assessment is embedded into the SM algorithm so that the choice of the most suitable model is performed before each iteration of the algorithm. Our approach is verified using several microwave design optimisation problems. The authors also present a modified version of the adaptive SM to improve performance. Our examples are repeated using the modified adaptive SM and compared with the basic adaptive SM.

关键词： implicit space mapping technology iterative methods Interpolation and function approximation (numerical analysis) iterative algorithm Filters and other networks optimisation microwave design optimisation problems microstrip filters adaptive SM algorithm Optimisation techniques preassigned parameters Waveguide and microwave transmission line components surrogate model

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：