An improved representation for evolving programs

A representation has been developed that addresses some of the issues with other Genetic Program representations while maintaining their advantages. This combines the easy reproduction of the linear representation with the inheritable characteristics of the tree representation by using fixed-length blocks of genes representing single program statements. This means that each block of genes will always map to the same statement in the parent and child unless it is mutated, irrespective of changes to the surrounding blocks. This method is compared to the variable length gene blocks used by other representations with a clear improvement in the similarity between parent and child. In addition, a set of list evaluation and manipulation functions was evolved as an application of the new Genetic Program components. These functions have the common feature that they all need to be 100% correct to be useful. Traditional Genetic Programming problems have mainly been optimization or approximation problems. The list results are good but do highlight the problem of scalability in that more complex functions lead to a dramatic increase in the required evolution time.     

A method for graphic stress representation

Stress representation by coloured patterns and contours through the use of the finite element method is presented in this paper. Stresses are computed in the center of each subregion defined in the element surface being displayed. These stresses define a matrix of codes related to the “stress bands” which must be represented. This matrix is used to “paint” every subregion and to generate contours defined by points located between two adjacent subregions of different codes. Some examples are presented to show the effectiveness of the method.     

Methods for the graphic representation of systems simulated data

Abstract

This paper explores the use of three multidimensional graphic techniques as a means of quick and easy exploration of computer-simulated data. Harmonic function plots, facial plots and three-dimensional box plots are presented as tools for quickly assessing simulated data structures: These techniques are then experimentally compared to assess their efficacy in recovering simulated data clusters. Findings indicate that the techniques vary in their ability to correctly recover clusters. The factor of user familiarity with the type of graphic representation used seems to be most influential in obtaining true insight into the data.     

图形变换和运动的共形几何代数表示方法*

共形几何代数是一种新的几何表示和几何计算工具,它具有直观、简洁、高效、统一、雅致等特性。在简单介绍外积、内积和几何积等基本概念之后,重点论述了共形几何代数在图形反射、旋转、平移等变换和刚体运动、螺旋运动等方面的描述和计算方法,并给出了实验示例。共形几何代数在计算机图形学、计算机视觉和机器人学等领域将有广泛应用。     

A program for the graphic representation and manipulation of DNA sequences

We have developed a program for the graphic representation and manipulation of DNA sequences. The program (named CARTE from the French for 'map') is intended as a tool in the planning and analysis of recombinant DNA experiments. DNA sequences are represented as standard restriction maps, using any desired combination of restriction enzymes. Features of interest, such as promoters or coding sequences, can be highlighted. The sequence can be manipulated to mimic cloning, using deletions, insertions or replacements at specified sites. This process is facilitated by the simultaneous display of a graphic map of the entire sequence, a detailed picture of the work in progress, and a menu of functions.     

An Algorithm for Finding the K-Best Allocations of a Tree Structured Program

We consider the problem of allocating n tasks of a distributed program to m processors of a distributed system in order to minimize total communication and processing costs. If the intertask communication can be represented by a tree and if the communication costs are uniform, it is known that an optimal allocation can be determined in O(nm) time. A K-optimal solution set Ω = { ₁,..., _K} of a given task allocation problem is a set of allocations such that no allocation which is not contained in Ω is better than any _i, i = 1,..., K. In this paper, an algorithm is presented which computes a K-optimal set for the considered task allocation problem in O(Knm).     

New graphic representation of structural parameters of proteins

A computer program is described that is designed to make the visual inspection of classical plots of protein properties (e.g. hydrophobicity, volume, etc.) as a function of sequence easier. An algorithm written in BASIC language has been used in order to generate a pseudo-tridimensional representation of the desired protein property. The data utilized by the program are arithmetic averages of the selected parameter obtained by using a five-residue window as a shuttle along the given amino acid sequence.     

基于物体坐标系的三维图形数据表示

鉴于世界坐标系定义的空间往往远大于被描绘物体的几何尺寸。导至了数据冗余、分辩率低、本文提出用物体坐标系表示三维图形，使存储空间减少，分辨率提高，并可提高运算速度。     

An algorithm for isochrome raster graphic display

Raster graphic display is used increasingly with microcomputers making use of readily available television monitors. An algorithm for obtaining the variation of a function on a screen by showing isochrome segments is presented. Small isoparametric bilinear elements are used as an adjustable intermediate size between the finite element mesh itself and the pixel. This approach permits a simple computer code that is adjustable to different computer hardware. A flow chart of the algorithm is presented and errors associated with the display are discussed. The results of two analyses are given. These examples were chosen for their differences both in the type of problem and in the numerical methods of solution used. First, the stresses in a gear tooth submitted to a concentrated load are presented. In this case, the algorithm is part of a post-processor following a finite element displacement analysis. A second example illustrates stream lines in a channel with a step. For the latter, the display shows the output data from a Gauss-Siedel resolution of a Laplace equation using a finite difference mesh.     

An improved FORTRAN 77 recombinant DNA database management system with graphic extensions in GKS

We have improved an existing clone database management system written in FORTRAN 77 and adapted it to our software environment. Improvements are that the database can be interrogated for any type of information, not just keywords. Also, recombinant DNA constructions can be represented in a simplified 'shorthand', whereafter a program assembles the full nucleotide sequence from the contributing fragments, which may be obtained from nucleotide sequence databases. Another improvement is the replacement of the database manager by programs, running in batch to maintain the databank and verify its consistency automatically. Finally, graphic extensions are written in Graphical Kernel System, to draw linear and circular restriction maps of recombinants. Besides restriction sites, recombinant features can be presented from the feature lines of recombinant database entries, or from the feature tables of nucleotide databases. The clone database management system is fully integrated into the sequence analysis software package from the Pasteur Institute, Paris, and is made accessible through the same menu. As a result, recombinant DNA sequences can directly be analysed by the sequence analysis programs.     

An effective format for representing graphic information

An intelligent format of the compressed graphic data representation, based on correlation-extremal recognition methods is described in this work. Corresponding fields of a new data representation structure are formed by compression, recognition, masking, and coding methods for describing data in the format of the linear-contour model obtained by vectoring initial images of graphic documents. The theoretical reasoning for the efficiency of the graphic data representation in the proposed format is given, which is demonstrated by examples in comparison with the most known formats.     

一个基于AutoCAD的同步协同设计方案

众所周知,当今的CAD应用系统都是面向单用户的,若要实现团队合作异地开发一项目,可以通过设计一种的Hot-Link功能方法,对AutoCAD进行再次开发,使不同地方的AutoCAD用户利用Internet网实时地相互传递各自AutoCAD 内部数据库中的实体信息,在这种功能支持下,每位用户在自己的AutoCAD中绘图的同时,也可将AutoCAD内部数据库中增加、修改或删除的实体信息发送给其他AutoCAD用户,并在其他用户的AutoCAD中显示出来,以实现用户的设计思想交流.该功能的开发借用局域网中的C/S结构,通过网络通信协议和Winsoket编程把不同地方的AutoCAD应用连接起来,使得在同一个局域网中的不同机器上的AutoCAD实时的协同工作.     

域：支持并行程序概念设计的一种抽象手段

1 引言长期以来,并行计算机在其潜在高性能和现实性能以及简单易用性之间存在着巨大的鸿沟,原因之一在于并行程序设计方法学的滞后导致大量的并行程序设计实践沿袭着传统串行程序开发的思路,而另一个重要的瓶颈在于并行程序的开发缺乏高效编程环境的支持。目前,并行程序的构造主要采取以下两种方式:(一)依据并行算法编写并行程序。这种方式构造的并行程序,一般能达到较高的并行效率,但对广大应用领域的用户要求太高。(二)利用并行化工具对串行程序进行并行改造。由于串行计算机上己经积累了大量成熟的应用程序,通过自动并行编译工具将串行程序移植到并行计算机上运行,无疑具有极为重要的现实意义。并行化方法由于对并行编译的对象缺乏高层的全局信息和并行信息,并行粒度较细,并行效率往往不