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

IEEE Digital Signal Processing Workshop

作者： Ying Huang B. Suter Dept. of Electr. & Comput. Eng. Air Force Inst. of Technol. Wright-Patterson AFB OH USA Department of Electrical & Computer Engineering Air Force Institute of Technology OH USA

ISBN: (纸本)0780336291

The short-time Fourier transform (STFT), or windowed Fourier transform, is the most widely used method in signal processing. We introduce the concept of the fractional wave packet transform (FRWPT), based on the idea of the fractional Fourier transform (FRFT) and wave packet transform (WPT). We show a version of the resolution of the identity and some properties of FRWPT connected with those of the FRFT and WPT.

关键词： Fourier transforms Continuous wavelet transforms Frequency Kernel Signal processing Wavelet analysis Chirp Signal resolution Wavelet transforms Energy resolution

来源：评论

学校读者我要写书评

暂无评论

Control distributed parameter systems with orthogonal neural network learning

引用

Informatica 1996年第4期7卷 431-454页

作者： Garliauskas, Algis Gupta, Madan M. Inst. of Mathematics and Informatics 2600 Vilnius Akademijos 4 Lithuania University of Saskatchewan Saskatoon Sask. S7N 5A9 Canada Computer Center Dept. of the USSR Acad. of Sciences Novosibirsk Russian Federation Laboratory of Neuroinformatics Instit. Math. and Inform. Lithuania Birla Engineering College Pilani India University of Warwick United Kingdom Department of Engineering Ctr. Excellence on Neuro-Vis. Res. University of Saskatchewan Saskatoon Sask. Canada Intelligent Syst. Res. Laboratory Ctr. Excellence on Neuro-Vis. Res. University of Saskatchewan Saskatoon Sask. Canada

Adaptive Control Distributed Parameter Systems (ACDPS) with adaptive learning algorithms based on orthogonal neural network methodology are presented in this paper. We discuss a modification of orthogonal least squares learning to find appropriate efficient algorithms for solution of ACDPS problems. A two times problem linked with the real time of plant control dynamic processes and the learning time for adjustment of parameters in adaptive control of unknown distributed systems is discussed. The simulation results demonstrate that the orthogonal learning algorithms on a neural network concept allow to find perfectly tracked output control distributed parameters in ACDPS and have rather a good perspective in the development of generalised ACDSP theory and practice in the future.

关键词： Adaptive control Distributed parameter system Nonlinear control Orthogonal neural network learning

来源：评论

学校读者我要写书评

暂无评论

Adaptive soft limiter bootstrap separator for one-shot asynchronous CDMA channel with singular partial cross-correlation matrix

Adaptive soft limiter bootstrap separator for one-shot async...

引用

IEEE International Conference on Communications (ICC)

作者： N. Sezgin Y. Bar-Ness Center for Communications and Signal Processing Department of Electrical and Computer Engineering New Jersey Institute of Technology Newark NJ USA New Jersey Institute of Technology Newark NJ US Dept. of Electr. & Comput. Eng. New Jersey Inst. of Technol. Newark NJ USA

The adaptive bootstrap separator has been shown to perform better than the conventional decorrelation detector when used for synchronous code division multiple access (CDMA) channels, or with a one-shot matched filter bank for asynchronous channels when the cross-correlation of the partial sequences is nonsingular. In the later case, however, when the "partial cross-correlation" is singular, the separator weights fail to converge. We propose the use of a soft-limiting decision instead of a hard limiter for controlling the adaptive weights of the separator. We show that the algorithm weights converge, provided that the limiting threshold is not zero or not very large. Due to analytical difficulties, the actual steady state weights are not found, but are shown to exist. Simulation results support these claims. The bit error rate (BER) performance of the adaptive soft limiter bootstrap separator are also found by simulation and compared to the performance of the conventional decorrelator that uses the pseudoinverse of the cross-correlation matrix.

关键词： Particle separators Decorrelation Multiaccess communication Bit error rate Detectors Matched filters Weight control Programmable control Adaptive control Steady-state

来源：评论

学校读者我要写书评

暂无评论

NONORTHOGONAL SIGNAL REPRESENTATION BY GAUSSIANS AND GABOR FUNCTIONS

引用

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-ANALOG AND DIGITAL SIGNAL PROCESSING 1995年第6期42卷 402-413页

作者： BENARIE, J RAO, KR Department of Electrical and Computer Engineering Illinois Institute of Technology Chicago IL USA Illinois Institute of Technology Chicago IL US Dept. of Electr. & Comput. Eng. Illinois Inst. of Technol. Chicago IL USA

This paper describes a novel approach for nonorthogonal representation of signals using Gaussians and an extension of this method for Gabor representation of signals, based on the equivalence of Gabor expansion to Gaussian expansion in the frequency domain. The Gaussian expansion scheme yields an efficient representation of signals for low number of bits per pixel and is better than the corresponding Discrete Cosine Transform (DCT) representation for very low bit rates, This advantage diminishes gracefully for higher bit rates where the residual approximation error signal to be represented is more random and less structured. It is proved in this paper that a finite number of Gaussians can theoretically approximate sinusoids in a bounded region with arbitrarily small error, and therefore any finite support L(2)(R) signal as well. Two methods for Gaussian representation of signals are outlined, The first, called the Max-Energy paradigm, involves successive extraction of the highest energy Gaussian that best ''fits'' the signal. The second is a parallel approach and uses an adaptive projection algorithm to first derive the Gaussian basis set to be used in parallel, and then optimizes the coefficients for minimum squared error.

关键词： Signal representations Gaussian processes Discrete cosine transforms Polynomials Frequency domain analysis Bit rate Approximation error Gaussian approximation Projection algorithms Fourier transforms

来源：评论

学校读者我要写书评

暂无评论

Distributed simulation in Ada 95

Distributed simulation in Ada 95

引用

International Conference on TRI-Ada 1995: Ada's Role in Global Markets: Solutions for a Changing Complex World, TRI-Ada 1995

作者： Hamilton, John A. Cook, David A. Pooch, Udo W. Dept. of Electrical Engineering and Computer Science U. S. Militaw Academy West PointNY10996 United States Air Force Inst. of Technology WPAFB OH45433 United States Dept. of Computer Science Texas A and M University College StationTX77843 United States

ISBN: (纸本)0897917057

Discrete-event simulation is undergoing a revolution brought on, in part, by two related technological advances. The first advance is in large distributed computin g systems which are becoming more and more common. Distributed computing systems dramatically increase both the processing power and the representation capabilities of discrete-event simulation. Distributed simulations can represent larger, more interesting problem domains with greater fidelity. © 1995 ACM.

关键词： Discrete event simulation

来源：评论

学校读者我要写书评

暂无评论

A new parallel algorithm for solving sparse linear systems

A new parallel algorithm for solving sparse linear systems

引用

IEEE International Symposium on Circuits and Systems (ISCAS)

作者： K.N. Balasubramanya Murthy C. Siva Ram Murthy Dept. of Comput. Sci. & Eng. Indian Inst. of Technol. Madras India Department of Computer Science and Engineering Indian Institute of Technology Chennai India

In this paper, we consider the problem of solving a sparse system of linear equations using a new LU factorization based algorithm. The algorithm employs a new technique called two-sided factorization to produce the complete solution by solving only one triangular system after the factorization phase against the solution of two triangular systems in the existing LU factorization based methods. The effectiveness of the new algorithm in solving sparse linear systems on hypercubes is demonstrated using IEEE standard power system networks as benchmarks.

关键词： Parallel algorithms Linear systems Hypercubes Sparse matrices Equations Power systems computer science Concurrent computing Binary trees

来源：评论

学校读者我要写书评

暂无评论

A general graph theoretic framework for multi-layer channel routing

A general graph theoretic framework for multi-layer channel ...

引用

International Conference on VLSI Design

作者： R.K. Pal A.K. Datta S.P. Pal M.M. Das A. Pal Department of Computer Science and Engineering Indian Institute of Technology Kharagpur India Department of Computer Science University of Calcutta Kolkata India Department of Computer Science andTechnology Bengal Engineering College (Deemed University) Howrah India Cadence Design Systems (India) Private Limited Noida India Indian Institute of Technology Delhi New Delhi Delhi IN Dept. of Comput. Sci. & Eng. Indian Inst. of Technol. Kharagpur India

In this paper we propose a general framework for viewing a class of heuristics for track assignment in channel routing from a purely graph theoretic angle. Within this framework we propose algorithms for computing routing solutions using optimal or near optimal number of tracks for several well-known benchmark channels in the two-layer VH. Three-layer HVH, and multi-layer V/sub i/H/sub i/ and V/sub i/H/sub i+1/ routing models. Within the same framework we also design an algorithm for minimizing the total wire length in the two-layer VH and three-layer HVH routing models.

关键词： Routing Wire computer science Algorithm design and analysis Integrated circuit modeling Integrated circuit layout NP-complete problem Councils computer industry Design engineering

来源：评论

学校读者我要写书评

暂无评论

ANGLABHARTI: a multilingual machine aided translation project on translation from English to Indian languages

ANGLABHARTI: a multilingual machine aided translation projec...

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： R.M.K. Sinha K. Sivaraman A. Agrawal R. Jain R. Srivastava A. Jain Indian Institute of Technology Kanpur Kanpur Uttar Pradesh IN Dept. of Comput. Sci. & Eng. Indian Inst. of Technol. Kanpur India Department of Computer Science and Engineering Indian Institute of Technology Kanpur India

An English to Indian languages machine aided translation system, named ANGLABHARTI, has been developed. It uses pattern directed approach using context free grammar like structures. A 'pseudo-target' is generated which is applicable to a group of Indian languages. Set of rules are acquired through corpus analysis to identify the plausible constituents with respect to which movement rules for the 'pseudo-target' are constructed. A number of semantic tags are used to resolve sense ambiguity in the source language. Alternative meanings for the unresolved ambiguities are retained in the pseudo target language code. A text generator module for each of the target languages transforms the pseudo target language to the target language. A corrector for ill-formed sentences is used for each of the target languages. Finally, a human-engineered post-editing package is used to make the final corrections. The post-editor needs to know only the target language. The strategy used in ANGLABHARTI lies in between the transfer and the interlingua approach. It is better than the transfer approach, as the translation is valid for a host of target language sentences, but falls short of genuine interlingua, in the sense that it ignores complete disambiguation/understanding of the text to be translated.

关键词： Natural languages computer science Humans Packaging Knowledge based systems History Dictionaries

来源：评论

学校读者我要写书评

暂无评论

An efficient data compression hardware based on cellular automata

An efficient data compression hardware based on cellular aut...

引用

Data Compression Conference (DCC)

作者： S. Bhattacharjee J. Bhattacharya P.P. Chaudhuri Department of Computer Science Engineering Indian Institute of Technology Kharagpur India Indian Institute of Technology Delhi New Delhi Delhi IN Dept. of Comput. Sci. & Eng. Indian Inst. of Technol. Kharagpur India

Summary form only given. Reports a parallel scheme for text data compression. The scheme utilizes the simple, regular, modular and cascadable structure of cellular automata (CA) with local interconnection structure that ideally suits VLSI technology. The state transition behaviour of a particular class of non-group CA, referred to as TPSA (two predecessor single attractor) CA, has been studied extensively and the results are utilized to develop a parallel scheme for data compression. The state transition diagram of a TPSA CA generates a unique inverted binary tree. This inverted binary tree is a labeled tree whose leaves and internal nodes have a unique pattern generated by the CA in successive cycles. This unique structure can be viewed as a dictionary for text compression. In effect, storage and retrieval of dictionary of conventional data compression techniques get replaced by the autonomous mode operation of the CA that generates the dictionary dynamically with appropriate mapping of dictionary data to CA states wherever necessary.

关键词： Data compression Hardware Dictionaries Content addressable storage Binary trees computer science Data engineering Very large scale integration Information retrieval Testing

来源：评论

学校读者我要写书评

暂无评论

Equip a Gaussian-vector-field feature extracting mechanism to an MLP for optical character recognition

Equip a Gaussian-vector-field feature extracting mechanism t...

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： Tai-Wen Yue Yu-Jen Chang Chien-Wu Tsai Dept. of Comput. Sci. & Inf. Technol. Tatung Inst. of Technol. Taipei Taiwan Department of Computer Science & Information Engineering Tatung Institute of Technology Taipei Taiwan

ISBN: (纸本)0780325591

To successfully apply a multilayered perceptron neural network (NN) to pattern recognition, the feature vectors fed into the NN must contain rich representative information so that the NN is able to distinguish the patterns belonging to different classes. For optical character recognition (OCR), the feature vectors, hence, must be endowed with a distortion insensitive property. In the paper, the authors propose a 5-layer perceptron (3 hidden layers) for OCR. One hidden layer is dedicated to extract the so-called Gaussian-vector-field (GVF) feature, which is insensitive to patterns deformed in shapes, of input characters. The other two hidden layers perform hyperregion encoding and decoding functions. A traditional error-propagation learning algorithm is used to train the NN for classifying hand-written numeric characters. Simulation result shows that the MLP can tolerate a large degree of pattern distortion. Furthermore, the size of the MLP is quite small when compared with the other approaches.

关键词： Gaussian processes Feature extraction Neural networks Optical character recognition software Optical distortion Data mining Multilayer perceptrons Multi-layer neural network Pattern recognition Optical computing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：