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

Construction of random perfect phylogeny matrix

Advances and Applications in Bioinformatics and Chemistry 2010年第1期3卷 89-96页

作者： Sadeghi, Mehdi Pezeshk, Hamid Eslahchi, Changiz Ahmadian, Sara Abadi, Sepideh Mah National Institute of Genetic Engineering and Biotechnology Tehran Iran School of Computer Science Institute for Research in Fundamental Sciences (IPM) Tehran Iran School of Mathematics Institute for Research in Fundamental Sciences (IPM) Tehran Iran School of Mathematics Statistics and Computer Sciences Center of Excellence in Biomathematics College of Science University of Tehran Tehran Iran Department of Mathematics Shahid Beheshti University G.C. Tehran Iran Department of Computer Engineering Sharif University of Technology Tehran Iran

Purpose: Interest in developing methods appropriate for mapping increasing amounts of genome-wide molecular data are increasing rapidly. There is also an increasing need for methods that are able to efficiently simulate such data. Patients and methods: In this article, we provide a graph-theory approach to find the necessary and sufficient conditions for the existence of a phylogeny matrix with k nonidentical haplotypes, n single nucleotide polymorphisms (SNPs), and a population size of m for which the minimum allele frequency of each SNP is between two specific numbers a and b. Results: We introduce an O(max(n ², nm)) algorithm for the random construction of such a phy-logeny matrix. The running time of any algorithm for solving this problem would be ω (nm). Conclusion: We have developed software, RAPPER, based on this algorithm, which is available at http://***/softwares/RAPPER. © 2010 Sadeghi et al, publisher and licensee Dove Medical Press Ltd.

关键词： Minimum allele frequency (MAF) Perfect phylogeny recursive algorithm Tree

来源：评论

学校读者我要写书评

暂无评论

recursive algorithm for real-time measurement of electrical variables in power systems

引用

IEEE TRANSACTIONS ON POWER DELIVERY 2006年第1期21卷 15-22页

作者： Lin, T Domijan, A Univ Florida Dept Elect & Comp Engn Gainesville FL 32611 USA Univ S Florida Dept Elect Engn Tampa FL 33620 USA

In this paper, a novel complex bandpass filter is presented which overcomes the pitfalls of the techniques in common use. This complex bandpass filter can correctly extract the phasor of the fundamental component and symmetrical components in voltage or current waveforms and then accurately estimate their instantaneous amplitude, phase angle, and frequency, even encountering various power disturbances. Further, a recursive algorithm is also developed for the complex bandpass filtering that updates current filtering output only using several previous sample values and filtering outputs. This attribute greatly reduces the computational complexity of complex bandpass filtering, which is the weakness of the continuous wavelet transform based on the well-known Morlet Wavelet. Thus, this recursive algorithm is highly desirable for real-time applications. The performance of the proposed technique is ascertained by using both simulated and practical power disturbance waveforms.

关键词： digital filter frequency estimation phasor measurement power system measurement recursive algorithm wavelet transform (WT)

来源：评论

学校读者我要写书评

暂无评论

Fractal Graphics Parallel Design and Analysis

Fractal Graphics Parallel Design and Analysis

引用

The Ninth International Symposium on Distributed Computing and Applications to Business,Engineering and Science

作者： Wenjing LI,Zhenxiong LAN,Ruliang WANG, Weizhi LIAO (College of Computer and Information Engineering, Guangxi Teachers Education University,Nanning, 530001,China)

The paper introduced recursive algorithm of fractal graphics,put forward fractal graphics parallel algorithm. Analyzing recursive algorithmic time complexity and speedup rate of the parallel *** experimental results of PC cluster show that the theoretical analysis and the experimental results of fractal graphics parallel algorithm are consistency with a marked speedup rate.

关键词： Fractal Graphics recursive algorithm Parallel algorithm Complexity Analysis Speedup rate

来源：评论

学校读者我要写书评

暂无评论

recursive Subspace Model Identification Based on Orthogonal Projection and Principal Component Analysis

Recursive Subspace Model Identification Based on Orthogonal ...

引用

The 2010 International Conference on Computer Application and System Modeling(2010计算机应用与系统建模国际会议 ICCASM 2010)

作者： Guozheng Tao epartment of Electrical Engineering Changzhou Institute of Mechatronic Technology Changzhou 213164 Jiangsu P.R.China

ISBN: (纸本)9781424472352

Most subspace identification methods are developed for linear time-invariant system. However, in reality, most systems are time-varying. Hence the recursive version of subspace identification methods is urgently desired. In this paper, we propose a unifying framework of recursive subspace model identification algorithm, which is based on the orthogonal projection and principal component analysis (PCA). Based on our framework, the bona fide recursive algorithm is applied to update the QR factorization. Two recursive subspace model identification algorithms are developed for open loop and closed loop condition, respectively. The numerical simulations demonstrate the efficiency of the two algorithms comparing with other algorithms.

关键词： system identification subspace methods recursive algorithm

来源：评论

学校读者我要写书评

暂无评论

A recursive algorithm for generating homogeneous T-shape cutting patterns

引用

PROCEEDINGS OF THE INSTITUTION OF MECHANICAL ENGINEERS PART B-JOURNAL OF ENGINEERING MANUFACTURE 2006年第11期220卷 1767-1774页

作者： Cui, Yaodong Ji, Jun Guangxi Normal Univ Dept Comp Sci Guilin 541004 Guangxi Peoples R China

Both the material utilization and the complexity of the cutting process should be considered when generating cutting patterns. This paper presents a recursive algorithm for constrained two-dimensional guillotine-cutting problems of rectangles. It uses homogeneous T-shape patterns to simplify the cutting process. Only homogeneous strips are allowed, each of which contains rectangular items of the same type. The plate is divided into two segments, each of which consists of strips with the same length and direction. The strip directions of the two segments are perpendicular to each other. Two recursion functions are established. The first generates optimal layouts of parallel strips on segments with specified sizes, and the second determines the optimal T-shape pattern on the plate. The optimal solution to the unconstrained version of the cutting problem is used to reduce the computation time. The computational results indicate that the algorithm is efficient both in computation time and in material utilization.

关键词： metal plates cutting stock problem two-dimensional cutting recursive algorithm

来源：评论

学校读者我要写书评

暂无评论

General solution scheme to spatial complexity of recursive algorithm

General solution scheme to spatial complexity of recursive a...

引用

5th International Conference on Machine Learning and Cybernetics

作者： Sun, Yong Wang, Xuan Shenzhen Polytech Sch Elect Informat Engn Shenzhen 518055 Peoples R China Harbin Inst Technol Dept Comp Sci Shenzhen Grad Sch Shenzhen 518055 Peoples R China

ISBN: (纸本)1424400600

recursive algorithm (RA) need a great number of storage space for continue operations (such as push) on stack, which easily causes stack overflow. In the paper, we present a novel recursive algorithm to solve this intractability throw constructing recursive tree, which only restoring valuable data for decreasing the spatial complexity, and then traversing recursive tree. In this way, the problem of spatial complexity of recursive algorithm could be solved effectively, making recursive algorithm more practical in application.

关键词： recursive algorithm recursive tree spatial complexity

来源：评论

学校读者我要写书评

暂无评论

Design of Optimal Comb FIR Filters-Speed and Robustness

引用

IEEE SIGNAL PROCESSING LETTERS 2009年第6期16卷 465-468页

作者： Zahradnik, Pavel Vlcek, Miroslav Unbehauen, Rolf Czech Tech Univ Fac Elect Engn Dept Telecommun Engn CZ-16627 Prague 6 Czech Republic Czech Tech Univ Fac Transportat Sci Dept Appl Math CZ-11000 Prague Czech Republic Univ Erlangen Nurnberg Lehrstuhl Allgemeine & Theoret Elektrotech D-91058 Erlangen Germany

An extension to the analytical design of digital equiripple comb FIR filters is presented here. The filters are optimal in Chebyshev sense. The design runs from the filter specification through the degree formula to the impulse response coefficients, which are evaluated by an extremely efficient recursive algorithm. The proposed design method outperforms the standard procedures in terms of speed and robustness.

关键词： Comb filter equiripple approximation fast design FIR recursive algorithm optimal filter robustness

来源：评论

学校读者我要写书评

暂无评论

A two-dimensional matrix Pade-type approximation in the inner product space

引用

JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS 2009年第2期231卷 680-695页

作者： Tao, Youtian Gu, Chuanqing Shanghai Univ Dept Math Shanghai 200444 Peoples R China Chaohu Coll Dept Math Chaohu 238000 Peoples R China

By introducing a bivariate matrix-valued linear functional on the scalar polynomial space. a general two-dimensional (2-D) matrix Pade-type approximant (BMPTA) in the inner product space is defined in this paper. The coefficients of its denominator polynomials are determined by taking the direct inner product of matrices. The remainder formula is developed and an algorithm for the numerator polynomials is presented when the generating polynomials are given in advance. By means of the Hankel-like coefficient matrix, a determinantal expression of BMPTA is presented. Moreover, to avoid the computation of the determinants, two efficient recursive algorithms are proposed. At the end the method of BMPTA is applied to partial realization problems of 2-D linear systems. (C) 2009 Elsevier B.V. All rights reserved.

关键词： Multivariate matrix-valued Pade-type approximants Linear functional recursive algorithm Determinantal expression Realization problem 2-D linear systems

来源：评论

学校读者我要写书评

暂无评论

Online updating belief rule based system for pipeline leak detection under expert intervention

引用

EXPERT SYSTEMS WITH APPLICATIONS 2009年第4期36卷 7700-7709页

作者： Zhou, Zhi-Jie Hu, Chang-Hua Yang, Jian-Bo Xu, Dong-Ling Zhou, Dong-Hua Tsinghua Univ Dept Automat TNList Beijing 100084 Peoples R China Univ Manchester Manchester Business Sch Manchester M15 6PB Lancs England High Tech Inst Xian Xian 710025 Shaanxi Peoples R China

A belief rule base inference methodology using the evidential reasoning approach (RIMER) has been developed recently, where a new belief rule base (BRB) is proposed to extend traditional IF-THEN rules and can capture more complicated causal relationships using different types of information with uncertainties, but these models are trained off-line and it is very expensive to train and re-train them. As such, recursive algorithms have been developed to update the BRB systems online and their calculation speed is very high, which is very important, particularly for the systems that have a high level of real-time requirement. The optimization models and recursive algorithms have been used for pipeline leak detection. However, because the proposed algorithms are both locally optimal and there may exist some noise in the real engineering systems, the trained or updated BRB may violate some certain running patterns that the pipeline leak should follow. These patterns can be determined by human experts according to some basic physical principles and the historical information. Therefore, this paper describes under expert intervention, how the recursive algorithm update the BRB system so that the updated BRB cannot only be used for pipeline leak detection but also satisfy the given patterns. Pipeline operations under different conditions are modeled by a BRB using expert knowledge, which is then updated and fine tuned using the proposed recursive algorithm and pipeline operating data, and validated by testing data. All training and testing data are collected from a real pipeline. The study demonstrates that under expert intervention, the BRB expert system is flexible, can be automatically tuned to represent complicated expert systems, and may be applied widely in engineering. It is also demonstrated that compared with other methods such as fuzzy neural networks (FNNs), the RIMER has a special characteristic of allowing direct intervention of human experts in deciding the in

关键词： Belief rule base Expert system Evidential reasoning recursive algorithm Leak detection

来源：评论

学校读者我要写书评

暂无评论

A Computation Structure for 2-D DCT Watermarking

A Computation Structure for 2-D DCT Watermarking

引用

52nd IEEE International Midwest Symposium on Circuits and Systems

作者： An, Shaofeng Wang, Chunyan Concordia Univ Dept Elect & Comp Engn Montreal PQ H3G 1M8 Canada

ISBN: (纸本)9781424444793

In this paper, a new computation structure of image watermarking in DCT domain is presented. This structure employs a single DCT block, instead of two in many existing DCT watermarking systems, for the DCT computation of the image signal and that of the watermark. Using the single DCT block does not double the time required for the two 2-D DCT computations, as the amount of the calculations in this structure is effectively reduced compared to those with two DCT blocks. By using a special condensed 2-D DCT algorithm, the DCT computation of the watermark is divided into two parts and only the part necessary and sufficient for the watermarking is performed to achieve a significant reduction of the overall computation. This structure can be easily implemented into a circuit. Using the single DCT block, the hardware reduction in the 2-D DCT part of the watermarking circuit can reach 50% with the time delay increase of only 34%. It has been confirmed by the preliminary results of the FPGA implementation.

关键词： digital watermarking 2-D DCT algorithm recursive algorithm FPGA implementation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：