Compositional pattern producing networks: A novel abstraction of development

Natural DNA can encode complexity on an enormous scale. Researchers are attempting to achieve the same representational efficiency in computers by implementing developmental encodings, i.e. encodings that map the genotype to the phenotype through a process of growth from a small starting point to a mature form. A major challenge in in this effort is to find the right level of abstraction of biological development to capture its essential properties without introducing unnecessary inefficiencies. In this paper, a novel abstraction of natural development, called Compositional Pattern Producing Networks (CPPNs), is proposed. Unlike currently accepted abstractions such as iterative rewrite systems and cellular growth simulations, CPPNs map to the phenotype without local interaction, that is, each individual component of the phenotype is determined independently of every other component. Results produced with CPPNs through interactive evolution of two-dimensional images show that such an encoding can nevertheless produce structural motifs often attributed to more conventional developmental abstractions, suggesting that local interaction may not be essential to the desirable properties of natural encoding in the way that is usually assumed.

Implementation of particle-in-cell stellar dynamics codes on the connection machine-2

The development of massively parallel supercomputers provides a unique opportunity to advance the state of the art inN-body simulations. TheseN-body codes are of great importance for simulations in stellar dynamics and plasma physics. For systems with long-range forces, such as gravity or electromagnetic forces, it is important to increase the number of particles toN 10⁷ particles. Significantly improved modeling ofN body systems can be expected by increasingN, arising from a more realistic representation of physical transport processes involving particle diffusion and energy and momentum transport. In addition, it will be possible to guarantee that physically significant portions of complex physical systems, such as Lindblad resonances of galaxies or current sheets in magnetospheres, will have an adequate population of particles for a realistic simulation. Particle-mesh (PM) and particle-particle particle-mesh (P³M) algorithms present the best prospects for the simulation of large-scaleN-body systems. As an example we present a two-dimensional PM simulation of a disk galaxy that we have developed on the Connection Machine-2, a massively parallel boolean hypercube supercomputer. The code is scalable to any CM-2 configuration available and, on the largest configuration, simulations withN = 128 M = 2²⁷ particles are possible in reasonable run times.     

Form,interpretation, and the uniqueness of content: Response to Morris

In response to Michael Morris, I attempt to refute the crucial second premise of the argument, which states that the formality condition cannot be satisfied non-stipulatively in computational systems. I defend the view of representation urged in Meaning and Mental Representation against the charge that it makes content stipulative and therefore irrelevant to the explanation of cognition. Some other reservations are expressed.     

数字水印演化设计

数字水印算法中相关参数的选择是水印算法设计的一个关键问题。不同的参数选取，将直接影响到算法的有效性。该文给出一种采用演化计算进行水印参数有效选择的方法，实验结果表明，这种方法在提高水印健壮性的同时保证保真度。     

动态可重构环境下循环计算的位宽优化

动态可重构技术允许根据计算的运行时情况对硬件处理单元进行重构，使其位宽适合计算的需要。而且，对代表计算密集型任务的循环计算进行位宽的动态优化可达到提高处理性能，减少所消耗的芯片资源和功耗的目的。本文构造了一个处理框架对循环计算的位宽进行动态的优化，包括对循环计算的位宽变化情况进行理论和运行时的分析，以及构造1个位宽管理算法选择重构的时机和对配置文件进行调度。通过对实验结果的分析，证明了我们的方案具有较好的性能。     

含化学反应体系多相平衡计算方法的研究进展

首先给出了含化学反应体系多相平衡计算问题的数学方程，然后对国内外含化学反应体系多相平衡计算方法的现状和进展做了综述，包括经典的非化学计量系数法和化学计量系数法以及最近提出的稳定性分析法、全局最优法和遗传算法等，并具体介绍了化学计量系数法中两种常用算法-S-C算法和KZ算法以及遗传算法的算法原理和计算步骤。     

Incorporating Ancestors' Influence in Genetic Algorithms

A new criterion of fitness evaluation for Genetic Algorithms is introduced where the fitness value of an individual is determined by considering its own fitness as well as those of its ancestors. Some guidelines for selecting the weighting coefficients for quantifying the importance to be given to the fitness of the individual and its ancestors are provided. This is done both heuristically and automatically under fixed and adaptive frameworks. The Schema Theorem corresponding to the proposed concept is derived. The effectiveness of this new methodology is demonstrated extensively on the problems of optimizing complex functions including a noisy one and selecting optimal neural network parameters.     

电厂启动备用变压器继电保护应用分析

针对电厂备用变压器分支较多这一特殊情况,从理论上对保护配置与整定上存在的问题进行了深入分析,提出了切实可行的保护配置和整定计算方法,具有较高的应用价值和推广意义。     

多层理论在圆筒型直线感应电动机计算上的应用

本文从麦克斯韦方程出发，在圆柱坐标系下建立了圆筒型直线电机的多层理论分析模用该模型对一台样机进行实例计算，并与磁阻抗法和实验值进行了比较，计算结果表明该方法的正确性和有效性。     

Optimal packing of transformer coil via dynamic programming

One of the transformer major design elements is its core design. The good performance of the transformer requires its coil core to be laminated and composed of different - widths stepped layers of specific steel packed together. For optimum design, the cross sectional shape of the core must be as circular as possible. So, an optimal packing can be attained by maximizing the steel core coverage. The number of different widths of steel plates n is selected to compose the packed core for a coil of diameter d. Then, an optimum sequence of decisions, for the n widths as well as the number of thin plates of each, is required. Dynamic programming (dp) is concerned with this optimum sequential decisions. An adequate forward recursive equation is formulated , because there isn't a standard dp model for all sequential decision making problems. To implement the recursive computations, a FORTRAN program is developed. Assuming that d is given the values 150, 200, 250, 300, 400 and 500 mm. while giving n the values from 2 to 15, the program is run at different combinations of n and d. It is found that maximum core coverage is sensitive to changing of n but it is slightly affected by changing of d.