基于Petri网与萤火虫算法的任务分配可视化建模

为了解决民用飞机故障诊断中任务分配问题,提出了使用新型离散萤火虫算法对任务分配问题进行研究,并在此基础上,使用Petri网进行可视化建模与仿真。新型的萤火虫算法离散方法,使得原本应用于连续问题的萤火虫算法适用于任务分配问题,这样使Petri网建模的复杂性降低,更利于建模。最后,对一实例进行分析并进行可视化建模与仿真,动态的仿真过程及最终结果验证了模型的可行性及算法的正确性。因此,使用该方法可有效地降低建模的复杂性,提高任务分配的效率,同时能够应用于协同可视化诊断平台中的任务分配模块。     

旅行推销员问题的凸包收缩法

本提出一种用凸包收缩来解决旅行推销员问题。首先形成一个凸包初始环路。然后，逐个考察凸包内的点，按照增加值从小到大的顺序依次插入，直至考察完所有的点。从而得到一个包含所有点的环路，即旅行推销员问题的一个满意解。     

On the existence and approximation of zeroes

In this paper we consider the problem of finding zeroes of a continuous functionf from a convex, compact subsetU of ℝ ⁿ to ℝ ⁿ . In the first part of the paper it is proved thatf has a computable zero iff:C ⁿ →ℝ ⁿ satisfies the nonparallel condition for any two antipodal points on bdC ⁿ, i.e. if for anyx∈bdC ⁿ ,f(x)≠αf(−x), α≥0, holds. Therefore we describe a simplicial algorithm to approximate such a zero. It is shown that generally the degree of the approximate zero depends on the number of reflection steps made by the algorithm, i.e. the number of times the algorithm switches from a face τ on bdC ⁿ to the face −τ. Therefore the index of a terminal simplex σ is defined which equals the local Brouwer degree of the function if σ is full-dimensional. In the second part of the paper the algorithm is used to generate possibly several approximate zeroes off. Two sucessive solutions may have both the same or opposite degrees, again depending on the number of reflection steps. By extendingf:U→ℝ ⁿ to a function g from a cube containingU to ℝ ⁿ , the procedure can be applied to any continuous functionf without having any information about the global and local Brouwer degrees a priori.     

An algorithmic approach to the construction of homomorphisms induced by maps in homology

This paper is devoted to giving the theoretical background for an algorithm for computing homomorphisms induced by maps in homology. The principal idea is to insert the graph of a given continuous map into a graph of a multi-valued representable map . The multi-valued representable maps have well developed continuity properties and admit a finite coding that permits treating them by combinatorial methods. We provide the construction of the homomorphism induced by such that . The presented construction does not require subsequent barycentric subdivisions and simplicial approximations of . The main motivation for this paper comes from the project of computing the Conley Index for discrete dynamical systems.

     

QF-环上有限生成模嵌入自由模的秩数和最小嵌入的算法

一个模嵌入自由模相当于用坐标来表示元素,这在数学上一直有重要意义．理论上, ＱＦ－环上的模都可以嵌入自由模,但没有好的算法,影响了它的应用．本文给出ＱＦ－环上有限生成模的最小嵌入的一种算法和所嵌入自由模的秩数的估计．     

Pure adaptive search for finite global optimization

Pure Adaptive Search is a stochastic algorithm which has been analyzed for continuous global optimization. When a uniform distribution is used in PAS, it has been shown to have complexity which is linear in dimension. We define strong and weak variations of PAS in the setting of finite global optimization and prove analogous results. In particular, for then-dimensional lattice {1,,k} ⁿ , the expected number of iterations to find the global optimum is linear inn. Many discrete combinatorial optimization problems, although having intractably large domains, have quite small ranges. The strong version of PAS for all problems, and the weak version of PAS for a limited class of problems, has complexity the order of the size of the range.The authors would like to thank the Department of Mathematics and Statistics at the University of Canterbury for support of this research.     

解线性方程组的一种新方法

本文提出一种求解线性方程组的快速Ｊａｃｏｂｉ迭代方法，该方法在通常的串行计算机上比Ｇａｕｓｓ－Ｓｅｉｄｅｌ方法快，而且精度高，它对收敛慢的大型线性计算特别有效。     

一种遗传模糊神经网络数据挖掘算法

数据挖掘是近年来信息处理领域出现的新的研究方向。本文探讨了扩展型TS模糊神经网络和遗传算法在数据挖掘中的应用,并提出了一种把模糊神经网络与遗传算法相结合的数据挖掘方法。在该方法中由遗传算法自适应地构造和优化TS模型,TS模型完成预测,这种预测是建立在遗传算法的聚类结果之上的。二者的结合,提高数据挖掘的应用效果。文章最后给出该方法的应用实例。     

Kullback-Liebler测度在地震记录反演中的应用

在地震记录反演中,盲目反褶积是一个相当困难的问题.讨论这个问题现有各种方法,如累积矩法等.本文利用Likas等处理图像恢复的变分法来讨论地震记录反演中的盲目反褶积问题.利用Kullback-Liebler信息测度获得一个非常有用的统计函数(即变分函数),此函数的极值点就含有所要求的反射系数序列的信息,并且拟订出求此泛数极值点的一套算法.     

Extremal point queries with lines and line segments and related problems

We address a number of extremal point query problems when P is a set of n points in , d3 a constant, including the computation of the farthest point from a query line and the computation of the farthest point from each of the lines spanned by the points in P. In , we give a data structure of size O(n¹⁺), that can be constructed in O(n¹⁺) time and can report the farthest point of P from a query line segment in O(n^2/3+) time, where >0 is an arbitrarily small constant. Applications of our results also include: (1) Sub-cubic time algorithms for fitting a polygonal chain through an indexed set of points in , d3 a constant, and (2) A sub-quadratic time and space algorithm that, given P and an anchor point q, computes the minimum (maximum) area triangle defined by q with P{q}.