求解机械装配规划的新方法

本文提出一个求解机械装配规划的算法,其计算量～O(sN~2),其中s是零件所有可能装配方向的个数,N是工件的零件数(一般s～O(N)).而现行的求机械装配规划的算法,其计算量均随N的增加按指数律增加.     

引信软件测试模型分析与实践

通过对引信软件特性的分析,结合软件测试理论,建立了针对引信软件开发过程的简化螺旋模型和针对开发组织结构的七人模型,形成一个完整的软件开发模型.同时,结合有关标准,提出以McCabe指数作为引信软件逻辑复杂性测试的指标,并用该指标对某引信软件进行了分析.     

Fast algorithms for computing the diameter of a finite planar set

Three algorithms for computing the diameter of a finite planar set are proposed. Although all three algorithms have (O(n ²) worst-case running time, an expected-complexity analysis shows that, under reasonable probabilistic assumptions, all three algorithms have linear expected running time. Experimental results indicate that two of these algorithms perform very well for some distributions, and are competitive with an existing method. Finally, we exhibit situations where these exact algorithms out-perform a published approximate algorithm.Research of the first author was supported by grant NSERC A 2422. Research of the second author was supported by grants NSERC A 9293, FCAC EQ-1678 and a Killam Senior Research Fellowship awarded by the Canada Council     

Computationally efficient direction-of-arrival estimation of non-circular signal based on subspace rotation technique

In order to solve the problem that the high computational burden of the multiple signal classification algorithm of non-circular signal (NC-MUSIC) in direction-of-arrival (DOA) estimation,a novel computationally efficient DOA estimation algorithm based on subspace rotation technique was proposed.Firstly,the partitioning of noise subspace matrix and the subspace rotation technique (SRT) were used to construct a new reduced-dimension noise subspace.Then,the two-dimensional peak searching was converted to the one-dimensional peak searching on the basis of the separation of variables and the orthogonality between the new reduced-dimension noise subspace and the space spanned by the columns of the extended manifold matrix.The proposed algorithm can enhance the computational efficiency by means of the conversion of the two-dimensional peak searching into the one-dimensional peak searching and the removal of redundant computations.Theoretical analysis and simulation results show that the proposed algorithm can reduce the computational complexity to less than 5% as compared to NC-MUSIC algorithm on the premise of ensuring the accuracy of DOA estimation.Especially,the efficiency advantage of the proposed algorithm is more obvious in scenarios where the large numbers of sensors are required.     

Minimizing the number of tool switches on a flexible machine

This article analyzes a tool switching problem arising in certain flexible manufacturing environments. A batch of jobs have to be successively processed on a single flexible machine. Each job requires a subset of tools, which have to be placed in the tool magazine of the machine before the job can be processed. The tool magazine has a limited capacity, and, in general, the number of tools needed to produce all the jobs exceeds this capacity. Hence, it is sometimes necessary to change tools between two jobs in a sequence. The problem is then to determine a job sequence and an associated sequence of loadings for the tool magazine, such that the total number of tool switches is minimized. This problem has been previously considered by several authors; it is here revisited, both from a theoretical and from a computational viewpoint. Basic results concerning the computational complexity of the problem are established. Several heuristics are proposed for its solution, and their performance is computationally assessed.     

Local and global deadlock-detection in component-based systems are NP-hard

Interaction systems are a formal model for component-based systems. Combining components via connectors to form more complex systems may give rise to deadlock situations. We present here a polynomial time reduction from 3-SAT to the question whether an interaction system contains deadlocks.     

Optimal implementations of UPGMA and other common clustering algorithms

In this work we consider hierarchical clustering algorithms, such as UPGMA, which follow the closest-pair joining scheme. We survey optimal O(n²)-time implementations of such algorithms which use a ‘locally closest’ joining scheme, and specify conditions under which this relaxed joining scheme is equivalent to the original one (i.e. ‘globally closest’).     

Smaller superconcentrators of density 28

An N-superconcentrator is a directed, acyclic graph with N input nodes and N output nodes such that every subset of the inputs and every subset of the outputs of same cardinality can be connected by node-disjoint paths. It is known that linear-size and bounded-degree superconcentrators exist. Here it is proved that such superconcentrators exist (by a random construction of certain expander graphs as building blocks) having density 28 (where the density is the number of edges divided by N). The best known density before this paper was 34.2 [U. Schöning, Construction of expanders and superconcentrators using Kolmogorov complexity, J. Random Structures Algorithms 17 (2000) 64-77] or 33 [L.A. Bassalygo, Personal communication, 2004].     

Continued fraction for formal laurent series and the lattice structure of sequences

Besides equidistribution properties and statistical independence the lattice profile, a generalized version of Marsaglia's lattice test, provides another quality measure for pseudorandom sequences over a (finite) field. It turned out that the lattice profile is closely related with the linear complexity profile. In this article we give a survey of several features of the linear complexity profile and the lattice profile, and we utilize relationships to completely describe the lattice profile of a sequence over a finite field in terms of the continued fraction expansion of its generating function. Finally we describe and construct sequences with a certain lattice profile, and introduce a further complexity measure.