Fast fourier transform processors using Gaussian residue arithmetic

Residue arithmetic using moduli which are Gaussian primes is suggested as a method for computing the fast Fourier transform (FFT). For complex operations, a substantial savings in hardware and time over residue arithmetic using real moduli can be obtained using complex moduli. Gaussian residue arithmetic is discussed and methods for conversion into and out of the complex residue representation are developed. This representation lends itself to table-driven computation, allowing very low latency designs to be developed. A 64-point Cooley-Tukey style processor and a 60-point Rader-Winograd style processor using this technique are described and compared. Hardware savings are realized by approximating the rotations necessary to perform the FFT by small complex integers and by scaling the results of the computation at an intermediate point. It is shown that further hardware reductions can be made by developing custom integrated circuits at the expense of latency.     

The use of various properties of amino acids in color and monochrome dot-matrix analyses for protein homologies

Software has been developed to allow the use of a number of parameters in the comparative representation of proteins in color and monochrome dot matrices. They include the parameters of partial specific volume, residue bulkiness, the mean area buried of side chains, seven additional hydropathy scales, mutability, polarity, secondary structure propensities, energy/residue, energy/atom, Rf values, the pKs at the N and C terminals, user-defined parameters and, if desired, randomly generated values. Many of these parameters can be combined in n space using an algorithm based on the Euclidian distance relationship in order to derive consensus values. The problem of scoring matched identities is addressed and the user may stipulate that they score 100 on a 0-100 scale or be determined from the Dayhoff MDM78 values with the rest of the matrix scaled appropriately. The PAMs matrix has been incorporated in such a way to allow the user to stipulate various PAM's values or estimated percentage difference between two peptide sequences, and converting to log odds values. In addition, the similarity ring developed by Swanson and the matrix proposed by Bacon and Anderson have been adapted for use in the program. Color indices have been utilized to give a 'third dimension' to the projections, allowing the user to judge the degree of similarity of different regions which are represented. The software also provides for the plotting of nucleotides in which case color is used to code individual nucleotides, purines versus pyrimidines, or similar colors are used to differentiate between A and T bases on the one hand, and G and C on the other.     

Integration of multiple knowledge representation for classification problems

This paper describes an approach to integrating various knowledge representations for classification problems. Knowledge representation forms have been analysed. The analysis shows that representation suitability depends on a given situation. Therefore, multiple representation form capability and form conversion capability are both necessary to support developing knowledge bases for wide application areas. A classification problem tool, called HOLON/VP(DT), has been developed with the aim of providing experts with the integrated knowledge representation capability. A knowledge base can be represented in a tabular form, a rule form and a tree form. Form conversion can be accomplished at all times. With this integrated representation, an expert is able to build a knowledge base using the most appropriate form.     

分子结构的数学表示式

本文叙述一种用图论方法得出的分子结构的编码方法,我们把这种编码称为分子结构的数学表示式,它具有计算简单、几何意义明显等特点。文中给出了从分子结构图计算出它的数学表示式的两个算法,论证了表示式的唯一性,并编出了分子结构图与它的数学表示式之间互相转换的计算机程序。最后给出若干分子结构的数学表示式的示例。     

Optimization of hierarchical directed graphs

A machine- and language-independent representation for programs suitable for use within a compiler is presented. This representation is the hierarchical directed graph. Powerful code optimization techniques are presented in the context of this representation. An experimental optimizer has been built to validate the ideas discussed. The power of the representation is evident in the compactness of the code implementing the optimizations.     

分数阶线性系统的内部和外部稳定性研究

介绍了分数阶线性定常系统的状态方程描述和传递函数描述．运用拉普拉斯变换和留数定理，给出并证明了分数阶线性定常系统的内部和外部稳定性条件，并讨论了其相互关系．以一个粘弹性系统的实例验证了上述方法的正确性．     

Efficient CRT-based residue-to-binary converter for the arbitrary moduli set

The conversion from residue to weighted binary representation plays an important role in the residue number system.Based on Chinese Remainder Theorem,a new residue-to-binary converter using arbitrary moduli set is proposed.The new converter uses the difference-correction algorithm for the conversion output and eliminates the modulo M operation,where M is the dynamic range of the residue number system.The sizes of the multipliers and modular multipliers in the new converter are small,thereby reducing the are...     

Error codes in residue number systems with magnitude index

The idea of adding a magnitude index to the residue representation of numbers is reconsidered. The range of a given Residue Number System is supposed to be divided into intervals of equal width and the magnitude index of a numberX is defined as an integer locatingX into one of such intervals. It is shown that the redundancy implied by the use of the magnitude index introduced in this paper, beside allowing simplification of non-modular operations, can also provide error detection or correction. The redundancy required to detect or correct single residue digit errors is the same as in Redundant Residue Number Systems and in Product Codes in Residue Number Systems. In addition, the codes under consideration allow detection of any error affecting the residue representation, provided that the magnitude of the error exceeds a given threshold, and, whenever an error is detected, it is possible to replace the wrong number with an approximation of the correct number. The accuracy of the approximation increases as the redundancy increases.     

哼唱检索中一种新颖有效的哼唱信息处理方法

在基于哼唱的音乐检索系统的研究中，对哼唱输入与数据库进行合理的近似匹配以及有效的检索方法的研究不断深入，但对于哼唱音频信息的有效处理以提取准确有效的旋律特征信息构造查询的研究还不充分。本文在已有的哼唱信息处理方法之上，提出了一种结合了哼唱语音信号增强技术以及时域与频域处理技术的哼唱转谱方法，包括采用了分级音符分割方法、基于规则的音高跟踪方法，并提出一种合理的旋律特征表达的中问格式，用于哼唱查询构造。实验结果证明了这种时哼唱信息转谱处理新方法的有效性和准确性。通过降低哼唱转谱过程中引入的误差，进而可以有效地提高整个音乐检索系统的性能。     

An image representation algorithm compatible with neural-associative-processor-based hardware recognition systems

A robust image representation algorithm compatible with the VLSI-matching-engine-based image recognition system has been developed. The spatial distributions of four-principal-direction edges in a 64 /spl times/ 64-pels gray scale image are coded to form a 64-dimension feature vector. Since the 2D edge information is reduced to a feature vector by projecting edge flags to the principal directions, it is named the projected principal-edge distribution (PPED) representation. The PPED vectors very well preserve the human perception of similarity among images in the vector space, while achieving a substantial dimensionality reduction in the image data. The PPED algorithm has been applied to medical radiograph analysis, which was taken as a test vehicle for algorithm optimization. The robust nature of the PPED representation has been confirmed by the recognition results comparable to the diagnosis by experts having several years of experience in a university hospital. Dedicated digital VLSI circuits have been developed for PPED vector generation in order to expedite the processing. A test hardware recognition system was constructed using the vector generation circuits, where the analog neural associative processor chip developed in a separate project was employed as a vector-matching engine. As a result, a successful medical radiograph analysis has been experimentally demonstrated using the hardware system. Feasibility of a very low-power operation of the system has been also demonstrated.     

3D representation of the Mandelbrot set

A new 3D representation of the Mandelbrot set is presented. Although the method employing the Douady Hubbard's potential function has been useful for the 3D representation of the Mandelbrot set, in our new method 3D pictures are generated by setting height components normal to the plane of the original Mandelbrot set. The pictures obtained look like natural landscapes with cliffs.     

Knowledge representation-oriented nets for discrete event systemapplications

This paper presents knowledge representation-oriented nets (KRON), a knowledge representation schema for discrete event systems (DES). KRON enables the representation and use of a variety of knowledge about a DES static structure and its dynamic states and behavior. It is based on the integration of high-level Petri nets with frame-based representation techniques and follows the object-oriented paradigm. The main objective considered in its definition is to obtain a comprehensive and powerful representation model for data and control of DES. The use of the DES behavioral knowledge is governed by a control mechanism stored in a separate inference engine. KRON provides an efficient execution mechanism to make the models evolve. This is an adaptation of the RETE matching algorithm in order to deal with the features provided by high-level Petri nets and it takes advantage of its integration with a frame/object-oriented representation schema, Moreover, KRON facilitates dealing with decision points in the execution of nondeterministic models. A prototype of a simulation tool with graphical display and animation facilities has been implemented for KRON and it has been used in several case studies in the manufacturing systems domain     

An Informal Semantic Analysis of Motion Verbs Based on Physical Primitives

A representation scheme for verbs and prepositions specifying path and locative information is developed. The representation emphasizes the implementability of the underlying semantic primitives. The primitives pertain to mechanical characteristics such as geometric relationships among objects, force or motion characteristics implied by verbs, and their prepositional modifiers. This representation has been used to animate the performance of tasks underlying natural language imperatives.     

Advanced Geometric Modeler with Hybrid Representation

An advanced geometric modeler GEMS4.0 has been developed,in which feature representation is used at the highest level abstraction of a product model.Boundary representation is used at the bottom level,while CSG model is adopted at the median level.A BRep data structure capable of modeling non-manifold is adopted.UNRBS representation is used for all curved surfaces,Quadric surfaces have dual representations consisting of their geometric data such as radius,center point,and center axis.Boundary representation of free form surfaces is easily built by sweeping and skinning method with NURBS geometry.Set operations on curved solids with boundary representation are performed by an evaluation process consisting of four steps.A file exchange facility is provided for the conversion between product data described by STEP and product information generated by GEMS4.0.     

A hybrid,decidable, logic-based knowledge representation system1

The major problem with using standard first-order logic as a basis for knowledge representation systems is its undecidability. A variant of first-order tautological entailment, a simple version of relevance logic, has been developed that has decidable inference and thus overcomes this problem. However, this logic is too weak for knowledge representation and must be strengthened. One way to strengthen the logic is to create a hybrid logic by adding a terminological reasoner. This must be done with care to retain the decidability of the logic as well as its reasonable semantics. The result, a stronger decidable logic, is used in the design of a hybrid, decidable, logic-based knowledge representation system.     

面向生成的美术构图表达研究

面向美术作品的自动创作,提出了美术知识的简化表达模型和基于符号矩阵的美术构图表达方法,并针对二维图案的自动生成,给出了生成性美术知识的一个具体表达实例,该实例已在美术图案综合创作系统中予以了实现。     

基于图的对称智能排样方法

提出一种新颖的使用传递闭包图(TCG)的表示方法,通过TCG表达的广义对称可行性和狭义对称可行性条件,将其引申到探索解决具有高复杂限制条件,并且期望产生对称解空间的排样问题。给出的TCG对称智能排样算法已试用于汽车内饰件、皮料的排样。实验结果证明,该方法优于常规以绝对坐标表示的排样寻优方式和采用对称序列对的排样方法。     

Computing GCDs of Polynomials over Algebraic Number Fields

Modular methods for computing the gcd of two univariate polynomials over an algebraic number field require a priori knowledge about the denominators of the rational numbers in the representation of the gcd. A multiplicative bound for these denominators is derived without assuming that the number generating the field is an algebraic integer. Consequently, the gcd algorithm of Langemyr and McCallum [J. Symbolic Computation8, 429 - 448, 1989] can now be applied directly to polynomials that are not necessarily represented in terms of an algebraic integer. Worst-case analyses and experiments with an implementation show that by avoiding a conversion of representation the reduction in computing time can be significant. A further improvement is achieved by using an algorithm for reconstructing a rational number from its modular residue so that the denominator bound need not be explicitly computed. Experiments and analyses suggest that this is a good practical alternative.