算法框架:算法重定位的一种可操作的方法

算法框架是实现算法重定位的一种可操作的方法.文章给出了算法重定位的定义,讨论了如何通过选择操作和组合操作来设计算法框架.然后给出了定义选择操作和组合操作的一种方法.由文章所定义的算法框架得到求解某一问题的算法模式,从该算法模式就可以生成求解该问题的算法.文章最后讨论了算法框架和算法模式以及模块化算法之间的关系.研究算法重定位及其可操作的方法对软件自动化和机器学习有着重要的意义.     

通过遗传算法进行系统级软硬件划分

介绍采用遗传算法解决软硬件划分问题，具体讨论在遗传算法实现过程中的编码和解码，适应值函数的选取，选择，交叉，变异算子的实现、收敛准则的决定等问题的处理，与已发表文献的处理方法进行比较，最后通过随机实验取得好的结果。     

基于边缘检测技术的指纹预处理研究

介绍了一种基于二维边缘检测方法的指纹图像预处理算法.通过采用基于Gauss-Laplace图像边缘检测技术,来计算指纹脊线的方向,形成精确的指纹方向图.在此基础上,配合其它经典的数字图像像素规格、脊线提取和灰度修正方法形成本指纹图像预处理算法.试验结果表明,本算法在清晰地提取指纹脊线的同时,较好地保留了一些传统指纹预处理方法所容易丢失的精细指纹特征,提高了指纹图像预处理算法的运行速度和处理质量.     

从功能规格说明到设计规格说明的自动转换

本文介绍了算法自动设计的研究背景与设计思想,提出了一种算法设计自动化模型及其形式化的软件规格说明语言表示,并详细讨论了一些常用算法设计方法的自动实现技术.     

一种基于投影算子的二值图像处理算法

二值图像的处理是图像内容分析领域的一个关键环节,处理效果严重影响图像分析的结果.以历史文档为处理对象,提出了基于投影的二值图像处理算法,通过对投影数组的处理实现灰度图像二值化阈值的合理选取、文档外边框的自动检测和图像污点的自动检测.实践证明该算法处理效果好,时间复杂度和空间复杂度低,是一种切实可行的好方法.     

A graphics engine for design of three-dimensional structures from standardized component modules

We present an interactive, menu-driven software package which allows the design of three-dimensional structures from standardized component modules. The standardized component modules used as example building blocks in the project are rectangular solids of several sizes.

The system has been designed such that its output (i.e. the design database) can be used to automatically generate a robot motion program to assemble the designed structure.

Presented are the system database and its internal data structure, an object placement-sequencer algorithm, a height specification and interference checking algorithm, and a balance-checking algorithm. To avoid the creation of dynamic obstacles and interference of the robot arm with these obstacles, the proper sequencing of the blocks in the design database is essential. The object placement-sequencer algorithm is responsible for proper sequencing of the blocks in the design database to avoid the aforementioned problem. The height specification and interference checking algorithm automatically generates the proper positioning of a block in the design by performing a sequential search over the accumulated design structure. The stacking feasibility of the blocks in the design is verified by the balance-checking algorithm, prior to the acceptance of the block as a permanent part of the design.     

基于遗传算法的产品基因重组设计

针对客户定制产品设计灵活性差的问题,提出一种基于遗传算法的产品基因重组的设计方法。在产品的重组 设计中引入基因工程,利用遗传算法对现有的产品设计方案进行优化,以满足制造业客户定制产品的多样化需求,实现客户定 制产品的智能设计。以某机械制造企业的数控机床为例,完成了遗传算法的关键技术：适应度函数、选择算子、交叉算子的设 计开发,验证了该方法的可行性和有效性。     

高精度图像测量与对准系统的算法研究

In this paper a new high accuracy image measurement and registration system design is proposed, in which edges of image in pixel are detected by improved Canny operator, edge points are recorded by an auto-tracing algorithm, edges in sub-pixel are located by spatial moment-based operator. The object parameters are calculated by means of Least Squares and the accuracy is improved by a proposed algorithm. Finally an automatic detection,recognition and measurement algorithm is proposed. The simulation experiment on a standard circle shows the properties of validity, feasibility about the design and algorithm proposed.     

An algorithm for generating solid elements in objects with holes

An algorithm for dividing an object with holes into solid elements for finite element preprocessing is presented. Since a tetrahedron can always be subdivided into prisms and cuboids, the approach of first dividing the given object into disjoint tetrahedra is taken.Objects without holes are dealt with first. Two mesh operators, each generating a single tetrahedron, are presented. In addition to the construction procedure, it is shown that they handle all objects without holes. The algorithm for objects with holes requires a third operator. In addition to showing the necessary and sufficient condition for applying such an operator, it is shown that it effectively reduces the number of holes in an object by one while yielding three tetrahedra. The algorithm which sequences the three operators thus reduces a given polyhedron to a single tetrahedron iteratively. Data structure requirements and update procedures are also given in this paper.     

分层多目标最优化进化算法

文章用进化算法给出了求解二层字典分层多目标最优化的方法,该算法把求解问题转化为多目标最优化,并研究了这两个问题的解集之间的联系。对多目标最优化定义了一个新的选择算子和适应值函数,这样定义的选择算子和适应值函数结合均匀设计能有效地引导搜索,直接求出问题的解而不用逐层求解。数值模拟表明该方法十分有效。     

An approach to testing specifications

An approach to testing the consistency of specifications is explored, which is applicable to the design validation of communication protocols and other cases of step-wise refinement. In this approach, a testing module compares a trace of interactions obtained from an execution of the refined specification (e.g., the protocol specification) with the reference specification (e.g., the communication service specification). Nondeterminism in reference specifications presents certain problems. Using an extended finite state transition model for the specifications, a strategy for limiting the amount of nondeterminacy is presented. An automated method for constructing a testing module for a given reference specification is discussed. Experience with the application of this testing approach to the design of a transport protocol and a distributed mutual exclusion algorithm is described.     

基于可变模版的三角网格拓扑压缩

针对三角网格模型的拓扑信息。提出了一种高效压缩方法.不同于以往的单纯利用算术编码或霍夫曼鳊码对遍历三角网格生成的拓扑流进行编码压缩,根据三角网格模型(特别是规则三角网格模型)的特点,自适应地提高编码过程中对当前编码字符发生的预测准确率,实现对三角网格模型的拓扑信息的高效压缩.算法首先遍历三角网格模型,得到操作符序列;然后对得到的操作符序列的每个操作符作模版可变的自适应算术编码.在编码过程中,根据当前编码字符的前一个操作符、三角网格模型的特点以及网格遍历方法为当前编码操作符计算一个模版,在这个模版中,预测准确率高的操作符用较短的二进制串表示.根据当前编码操作符的可变模版,可以得到该操作符的二进制表示,并对这个二进制表示的每个比特作自适应算术编码.该方法是针对流形三角网格模型的拓扑信息作单分辨率的基于面的无损压缩,可以得到很好的三角网格拓扑信息的压缩结果,其压缩比甚至比拓扑压缩领域压缩比方面最好的TG算法的压缩比还要好.     

约束优化问题的改进遗传算法设计

遗传算子是影响遗传算法优化效果的重要因素,针对目前遗传算法研究中对约束优化问题求解的不足,提出基于退火思想的退火选择算子和加权适应度算子,并给出了退火选择算子和加权适应度算子设计方法及其计算过程.在此基础上与现有的遗传算子结合,提出一种新的改进遗传算法,分析了改进遗传算法与基于罚函数遗传算法之间在原理上的区别.最后以两个测试函数为算例对算法进行了性能测试,结果表明改进的遗传算法具有良好的优化性能,能获得更好的优化结果.     

基于CORDIC算法的NCO实现

介绍了CORDIC算法的原理,给出了为满足某一技术指标而设计的NCO的分析过程,给出了软件仿真波形和硬件实现波形的对比.     

基于设计演算的形式化用例分析建模框架

提出一种形式化用例分析建模框架,引入类图、用例顺序图、用例状态图、功能规约函数和系统不变式从多个角度为需求建模.通过定义这些视图的形式化语义,为需求的各个方面定义了准确的形式化描述.利用该框架,可以从方法的交互行为规约和功能规约合成描述方法全部行为的全规约;也可以定义用例模型的性质,并通过设计演算中的证明来分析验证这些性质.作为应用,研究了检查用例模型一致性的规则.给出一个实例说明建模框架的可行性.     

A novel genetic algorithm based on immunity

A novel algorithm, the immune genetic algorithm (IGA), is proposed based on the theory of immunity in biology which mainly constructs an immune operator accomplished by two steps: 1) a vaccination and 2) an immune selection. IGA proves theoretically convergent with probability 1. Strategies and methods of selecting vaccines and constructing an immune operator are also given. IGA is illustrated to be able to restrain the degenerate phenomenon effectively during the evolutionary process with examples of TSP, and can improve the searching ability and adaptability, greatly increase the convergence rate     

Using Canny's criteria to derive a recursively implemented optimal edge detector

A highly efficient recursive algorithm for edge detection is presented. Using Canny's design [1], we show that a solution to his precise formulation of detection and localization for an infinite extent filter leads to an optimal operator in one dimension, which can be efficiently implemented by two recursive filters moving in opposite directions. In addition to the noise truncature immunity which results, the recursive nature of the filtering operations leads, with sequential machines, to a substantial saving in computational effort (five multiplications and five additions for one pixel, independent of the size of the neighborhood). The extension to the two-dimensional case is considered and the resulting filtering structures are implemented as two-dimensional recursive filters. Hence, the filter size can be varied by simply changing the value of one parameter without affecting the time execution of the algorithm. Performance measures of this new edge detector are given and compared to Canny's filters. Various experimental results are shown.     

基于新一代GPS的垂直度误差评定方法的研究

现代产品几何技术规范(GPS)提出的操作与操作算子技术,为实现几何产品检验/认证过程的数字化和规范化评定提供了必要的技术基础。研究分析了垂直度误差和轴线对端面垂直度误差评定过程中操作算子的构成,并建立了基于最小区域的各拟合操作的数学模型和优化目标函数。介绍了一种基于实数编码的遗传算法来解决误差评定中的目标优化问题,阐述了算法的基本思想和步骤。通过实例介绍了基于实数编码的遗传算法的轴线对端面垂直度误差评定过程。结果表明:该过程规范、有效、可操作性强。     

GSOS for probabilistic transition systems: (extended abstract)

We introduce probabilistic GSOS, an operator specification format for (reactive) probabilistic transition systems which arises as an adaptation of the known GSOS format for labelled (nondeterministic) transition systems. Like the standard one, The format is well behaved in the sense that on all models bisimilarity is a congruence and the up-to-context proof principle is valid. Moreover, every specification has a final model which can be shown to offer unique solutions for guarded recursive equations. The format covers operator specifications from the literature, so that the well-behavedness results given for those arise as instances of our general one.The novel format was obtained via the following procedure: Turi and Plotkin have modelled specifications in the (standard) GSOS format and their models as natural transformations of a certain shape and a class of bialgebras identified by them. Several well-behavedness results for the concrete format can elegantly be proved in the categorical setting. Since the abstract framework is parametric in the type of system behaviour under consideration, it can be instantiated with that of probabilistic transition systems yielding a specification format for them, again in terms of specific natural transformations. The main contribution of this paper is the derivation of probabilistic GSOS as a rule-style representation of those.