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

11th International Conference on Modelling, Identification and Control (ICMIC)

作者： Xu, Ling Zhang, Xiao Ding, Feng Wuxi Vocat Inst Commerce Sch Internet Things Technol Wuxi 214153 Jiangsu Peoples R China Jiangnan Univ Sch Internet Things Engn Wuxi 214122 Jiangsu Peoples R China

ISBN: (纸本)9789811504747;9789811504730

This paper considers the parameter identification of bilinear systems with unknown states, which are disturbed by an autoregressive moving average noise. The hierarchial identification principle is employed to derive new algorithms for interactively estimating the states and parameters via a bilinear state observer. However, the general bilinear state-space model involves many parameters, which causes heavy computational burden. Motivated by this fact, we propose a hierarchical generalized extended least squares (HGELS) algorithm by decomposing the original system into a series of subsystems with small dimensions for enhancing computational efficiency. The performance of the proposed algorithms is illustrated through a numerical example.

关键词： Parameter estimation Bilinear system recursive algorithm

来源：评论

学校读者我要写书评

暂无评论

Fast algorithm for 2-D entropic thresholding of image segmentation

Fast algorithm for 2-D entropic thresholding of image segmen...

引用

Conference on Image Extraction, Segmentation, and Recognition

作者： Su, JZ Tian, JW Liu, J Sun, ZL Huazhong Univ Sci & Technol State Key Lab Image Proc & Intelligent Control Inst Pattern Recognit & Artificial Intelligence Wuhan 430074 Peoples R China

ISBN: (纸本)081944278X

2-D entropic thresholding method is a very effective approach for image segmentation. But the computational complexity up to O(L-4) greatly limits its application. Wu et al. proposed a fast recursive algorithm based on Abutaleb's 2-D entropic thresholding method, which reduced the computational complexity to O(L-2) with the memory cost of 2*L floating words. This paper should present a novel fast searching algorithm for optimal thresholding vector, which reduces the computational complexity to about (3*L+w*w), where w is less than 10,with very little memory cost.

关键词： 2-D entropic thresholding recursive algorithm fast searching algorithm optimal thresholding vector image segmentation computational complexity

来源：评论

学校读者我要写书评

暂无评论

The sub-band decomposition of fluctuated signals for the estimation of power spectra

The sub-band decomposition of fluctuated signals for the est...

引用

IEEE International Symposium on Intelligent Signal Processing

作者： Zajacek, Jiri Grmela, Lubomir Brno Univ Technol Dept Phys Brno 61600 Czech Republic

ISBN: (纸本)9781424408290

The naive spectroscopy is used to determinate quality and reliabiliy of semiconductor materials. We have used the means of time-frequency analysis for processing of long time duration stochastic signal. Tree-structured FIR filter bank implemented in a recursive way for octave dividing frequency band was designed as full parallel computational algorithm for Power Spectral Density estimation. In the very low frequency area we will obtain high resolution and low level variance of PSD.

关键词： 1/f noise power spectral density (PSD) FIR octave filter bank recursive algorithm

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

ORTHO-ORDENT INITIALIZATION OF FFANNAS TO IMPROVE THEIR GENERALIZATION ABILITY

ORTHO-ORDENT INITIALIZATION OF FFANNAS TO IMPROVE THEIR GENE...

引用

1st International Conference on Applications and Science of Artificial Neural Networks

作者： SARKAR, D UNIV MIAMI DEPT MATH & COMP SCICORAL GABLESFL 33124

ISBN: (纸本)0819418455

There are several models for neurons and their interconnections. Among them, feedforward artificial neural networks (FFANNs) are very popular for being quite simple. However, to make them truly reliable and smart information processing systems, such characteristics as learning speed, local minima, and generalization ability need more understanding. Difficulties such as long learning-time and local minima, may not affect them as much as the question of generalization ability, because in many applications a network needs only one training, and then it may be used for a long time. However, the question of generalization ability of ANNs is of great interest for both theoretical understanding and practical use, because generalization ability is a measure of a learning system that indicates how closely its actual output approximates to the desired output for an input that it has never seen. We investigate novel techniques for systematic initializations (as opposed to purely random initializations) of FFANN architectures for possible improvement of their generalization ability. Our preliminary work has successfully employed row-vectors of Hadamard matrices to generate initializations;this initialization method has produced networks with better generalization ability. © 1995 SPIE.

关键词： ARTIFICIAL NEURAL NETWORKS (ANNS) BIPOLAR VECTORS ERROR BACKPROPAGATION LEARNING FEEDFORWARD NETWORKS GENERALIZATION ABILITY OF LEARNING SYSTEMS HADAMARD MATRICES INITIALIZATION OF ANNS ORTHOGONAL VECTORS recursive algorithm

来源：评论

学校读者我要写书评

暂无评论

Rotational Speed Estimation Using The Discrete Kalman Filtering Applied To A Tacho Signal 19

Rotational Speed Estimation Using The Discrete Kalman Filter...

引用

19th International Carpathian Control Conference (ICCC)

作者： Tuma, Jiri VSB Tech Univ Ostrava Fac Mech Engn Ostrava Czech Republic

ISBN: (纸本)9781538647622

The paper deals with Kalman's filtering for the rotational speed time history of rotors, which is determined by the use of a tacho-signal that is composed of the string of pulses each of them is generated at least once per the complete rotor revolution. The accuracy of the estimation of the time interval length corresponding to the one complete revolution depends on the number of samples which corresponds to the mentioned time interval. The reciprocal value of the length of this interval determines the rotation frequency. If the rotation speed is multiply increased, the measurement error increases considerably as well. The Kalman filter is a suitable means for smoothing the rotational speed measurement by reducing the measurement error.

关键词： Kalman filter pulse tacho signal rotational speed ramp up increase recursive algorithm

来源：评论

学校读者我要写书评

暂无评论

Base on the database inquiry algorithm of the recursion research and realizes

Base on the database inquiry algorithm of the recursion rese...

引用

International Conference on Computer Science and Network Technology (ICCSNT)

作者： Wang Shishui Guizhou Univ Coll Comp Sci & Informat Guiyan Peoples R China

ISBN: (纸本)9781457715846

With a high priority in database development and application, database query algorithm is especially important for complex data processing in deep level. Aiming at accomplishing queries for multi-level users, a new iterative query algorithm is proposed on top of the recursive algorithms. This algorithm starts from choosing a root node, which taken as the only entry and exit of the algorithm. Then it traverses to all the related nodes from the root node and the corresponding data processing will be conducted. Finally, through the experiment, the algorithm is verified and its performance is evaluated

关键词： recursive algorithm Traverse Data Processing Data Structrue

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

recursive Solution to a Type of Finite Field Matrix Equation and Its Application in Information Security

Recursive Solution to a Type of Finite Field Matrix Equation...

引用

International Conference on Mechatronics and Semiconductor Materials (ICMSCM 2013)

作者： Yan, Shenhai Huang, Xiantong Gannan Normal Univ Coll Math & Comp Sci Ganzhou 341000 Jiangxi Peoples R China

ISBN: (纸本)9783037859391

On the question of solving lower triangular matrices or symmetric matrix by a type of matrix equation, we obtain the necessary and sufficient conditions for its only solution and design a recursive algorithm to compute the solution. With finite domain multiplicative inverse technology and Differ-Hellman protocol, a new cryptosystem is designed based on finite fields matrix equations. Numerical experiments demonstrate the correctness of the new cryptosystem and feasibility.

关键词： finite fields recursive algorithm Differ-Hellman protocol inverse matrix cryptosystem

来源：评论

学校读者我要写书评

暂无评论

A wavelet neural network approach for shape from shading

A wavelet neural network approach for shape from shading

引用

7th International Conference on Signal Processing

作者： Yu, HB Zhao, RC Xu, M Northwestern Polytech Univ Dept Comp Sci & Engn Xian 710072 Peoples R China

ISBN: (纸本)7121002159

A new approach for measuring the shape and surface of an object observed from a single view is proposed. The proposed approach is based on using a single hidden layer wavelet neural network (WNN) to approximate complex nonlinear reflectance map functions in which example data are not explicitly given. The shape from shading problem is formulated as the minimization of an intensity error function with respect to the network weights. Due to the properties of the WNN. the representation of network topology can be definitely developed, and the training problem can be transformed into a convex optimization process, the global minimum can be obtained and the learning speed also increases. Experimental results on synthetic images demonstrate the new algorithm has performed well and compared favorably to the traditional ones.

关键词： Shape from Shading wavelet transform reflectance model feedforward neural network recursive algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：