复数,实数及实对称数据下Bruun FFT算法的实现

本文在复数、实数以及实对称数据下研究和实现了Ｂｒｕｕｎ ＦＦＴ算法。文章分析和评价了各种数据下ＢｒｕｕｎＦＦＴ的运算量和特点，提出了算法的实现结构和方法。最后给了ＴＭＳ３２０Ｃ３０上的运算时间，我们实现的算法比基２ＦＦＴ速度提高３５％。     

冒泡排序算法的改进

本文作者对传统的冒泡排序算法进行了时间复杂性分析，指出其效率不高的缺陷，提出了双向同时浮沉的改进方法，并编程予以实现。其效率较传统的冒泡排序算法有一定程度的提高．     

模糊关系矩阵传递闭包的Warshall算法

通过对照关系的传递闭包和模糊关系的传递闭包，把求关系矩阵的传递闭包的算法完整地推广到模糊关系矩阵上。     

利用DA算法实现大规模FIR滤波器

分布式算法是一种广泛地应用在可编程逻辑序列（FPCA）和ASIC设计中计算乘积和的算法。DA算法的处理速度仅与输入的位宽有关，对于大规模乘积和的运算，其计算速度有着明显的优势。当输入位宽过大时，可以将DA算法改进成并串结构以获得更快的处理速度。该文对在FPCA中利用DA算法实现大规模FIR滤波器，提出了具体的实现方案。     

Drawing c-planar biconnected clustered graphs

In a graph, a cluster is a set of vertices, and two clusters are said to be non-intersecting if they are disjoint or one of them is contained in the other. A clustered graph C consists of a graph G and a set of non-intersecting clusters. In this paper, we assume that C has a compound planar drawing and each cluster induces a biconnected subgraph. Then we show that such a clustered graph admits a drawing in the plane such that (i) edges are drawn as straight-line segments with no edge crossing and (ii) the boundary of the biconnected subgraph induced by each cluster is a convex polygon.     

On the stability of some integer programming algorithms

In the present paper we develop our approach for studying the stability of integer programming problems. We prove that the L-class enumeration method is stable on integer linear programming problems in the case of bounded relaxation sets [9]. The stability of some cutting plane algorithms is discussed.     

SASEGASA: A New Generic Parallel Evolutionary Algorithm for Achieving Highest Quality Results

This paper presents a new generic Evolutionary Algorithm (EA) for retarding the unwanted effects of premature convergence. This is accomplished by a combination of interacting generic methods. These generalizations of a Genetic Algorithm (GA) are inspired by population genetics and take advantage of the interactions between genetic drift and migration. In this regard a new selection scheme is introduced, which is designed to directedly control genetic drift within the population by advantageous self-adaptive selection pressure steering. Additionally this new selection model enables a quite intuitive heuristics to detect premature convergence. Based upon this newly postulated basic principle the new selection mechanism is combined with the already proposed Segregative Genetic Algorithm (SEGA), an advanced Genetic Algorithm (GA) that introduces parallelism mainly to improve global solution quality. As a whole, a new generic evolutionary algorithm (SASEGASA) is introduced. The performance of the algorithm is evaluated on a set of characteristic benchmark problems. Computational results show that the new method is capable of producing highest quality solutions without any problem-specific additions.     

关于解椭圆型问题的多子域D-N交替算法

构造一个求解椭圆型边值问题的多子域D—N交替算法，导出对应的容度方程和等价的迭代法，证明算法的收敛性。     

Introduction to Ant Colony Algorithm and Its Application in CIMS

Ant colony algorithm is a novel simulated ecosystem e volutionary algorithm, which is proposed firstly by Italian scholars M.Dorigo, A . Colormi and V. Maniezzo. Enlightened by the process of ants searching for food , scholars bring forward this new evolutionary algorithm. This algorithm has sev eral characteristics such as positive feedback, distributed computing and stro nger robustness. Positive feedback and distributed computing make it easier to find better solutions. Based on these characteristics...