3D registration of human face using evolutionary computation and Kriging interpolation

This paper proposes a fast and robust 3D human face geometric data registration strategy dedicated for image-guided medical applications. The registration scheme is composed of a coarse transformation stage and a fine-tuning stage. In the first stage, fuzzy c-mean is used to reduce the data amount of template 3D image, and evolutionary computation is implemented to find optimal initial pose for the Iterative Closest Point plus k-dimensional (KD) tree scheme. In the second stage, the huge reference image data are replaced by a Kriging model. The time-consuming search for corresponding points in evaluating the degree of misalignment is substituted by projecting the points in the template image onto the model. To illustrate the validity and applicability of the proposed approach, a problem composed of 174 635 points reference image and an 11 280 points template image is demonstrated. Computational results show that our approach accelerates the registration process from 1361.28 seconds to 432.85 seconds when compared with the conventional ICP plus K-D tree scheme, while the average misalignment reduces from 11.35 mm to 2.33 mm. This work was presented in part at the 13th International Symposium on Artificial Life and Robotics, Oita, Japan, January 31–February 2, 2008     

A study on a quantum-inspired evolutionary algorithm based on pair swap

A quantum-inspired evolutionary algorithm (QEA) is proposed as a stochastic algorithm to perform combinatorial optimization problems. The QEA is evolutionary computation that uses quantum bits and superposition states in quantum computation. Although the QEA is a coarse-grained parallel algorithm, it involves many parameters that must be adjusted manually. This paper proposes a new method, named pair swap, which exchanges each best solution information between two individuals instead of migration in the QEA. Experimental results show that our proposed method is a simpler algorithm and can find a high quality solution in the 0-1 knapsack problem. This work was presented in part at the 12th International Symposium on Artificial Life and Robotics, Oita, Japan, January 25–27, 2007     

Evolution strategies with cumulative step length adaptation on the noisy parabolic ridge

This paper presents an analysis of the performance of the (μ/μ,λ)-ES with isotropically distributed mutations and cumulative step length adaptation on the noisy parabolic ridge. Several forms of dependency of the noise strength on the distance from the ridge axis are considered. Closed form expressions are derived that describe the mutation strength and the progress rate of the strategy in high-dimensional search spaces. It is seen that as for the sphere model, larger levels of noise present lead to cumulative step length adaptation generating increasingly inadequate mutation strengths, and that the problem can be ameliorated to some degree by working with larger populations.     

An overview of quantum computation models: quantum automata

Quantum automata, as theoretical models of quantum computers, include quantum finite automata (QFA), quantum sequential machines (QSM), quantum pushdown automata (QPDA), quantum Turing machines (QTM), quantum cellular automata (QCA), and the others, for example, automata theory based on quantum logic (orthomodular lattice-valued automata). In this paper, we try to outline a basic progress in the research on these models, focusing on QFA, QSM, QPDA, QTM, and orthomodular lattice-valued automata. Also, other models closely relative to them are mentioned. In particular, based on the existing results in the literature, we finally address a number of problems to be studied in future.     

Approximate calculation of the characteristics of multirate systems with inelastic and elastic calls

Models of multirate systems in which inelastic and elastic calls (ie-calls and e-calls, respectively) are jointly serviced are investigated. It is assumed that through the entire service period the iecalls simultaneously occupy b ≥ 1 channels of the system, moreover, all the channels begin and complete servicing of the same ie-call simultaneously. The elastic calls simultaneously occupy m channels, m ≤ m ≤ \(\bar m\), where m and \(\bar m\) are specified quantities, with the service rate being proportional to the number of channels busy servicing e-calls. Models with continuous and discrete band for servicing e-calls are investigated in detail. Effective numerical algorithms for calculating the characteristics of the models are developed and results of computational experiments are presented.     

H-BSP: A Hierarchical BSP Computation Model

This paper presents a new parallel computing model, called H-BSP, which adds a hierarchical concept to the BSP(Bulk Synchronous Parallel) computing model. An H-BSP program consists of a number of BSP groups which are dynamically created at run time and executed in a hierarchical fashion. H-BSP allows algorithm designers to develop more efficient algorithms by utilizing processor locality in the program. Based on the distributed memory model, H-BSP provides a group-based programming paradigm and supports Divide & Conquer algorithms efficiently. This paper describes the structure of the H-BSP model, complexity analysis and some examples of H-BSP algorithm. Also presented is the performance characteristics of H-BSP algorithms based on the simulation analysis. Simulation results show that H-BSP takes advantages of processor locality and performs well in low bandwidth networks or in a constant-valence architecture such as 2-dimensional mesh. It is also proved that H-BSP can predict algorithm performance better than BSP, due to its locality-preserving nature.     

自变量选择及其并行算法

１．引 言 航天技术的发展带来了超大量的数据,如何从这些超大量的数据中获取所需的信息已成为航天技术发展迫切需要解决的关键技术之一．战略导弹的研制与定型和载人航天工程需要高精度的外测、遥测、光测测量数据．从多套、多站、多种测量设备的联合测量数据中摸清误差规律、调整参数到优选模型环节需要处理成百上千个线性和非线性模型,需要建立一个十分复杂和庞大的数据处理集成系统,其计算量是十分巨大的． 从已知的（多参数的）大型线性模型与非线性模型中,以提高数据处理的质量为依据,建立优选模型的准则,并提供有效的计算方法…     

Symbolic computation with finite biquandles

A method of computing a basis for the second Yang–Baxter cohomology of a finite biquandle with coefficients in Q$\mathbb{Q}$ and _Zp${\mathbb{Z}}_p$ from a matrix presentation of the finite biquandle is described. We also describe a method for computing the Yang–Baxter cocycle invariants of an oriented knot or link represented as a signed Gauss code. We provide a URL for our Maple implementations of these algorithms.     

Arithmetic computation in the tile assembly model: Addition and multiplication

Formalized study of self-assembly has led to the definition of the tile assembly model [Erik Winfree, Algorithmic self-assembly of DNA, Ph.D. Thesis, Caltech, Pasadena, CA, June 1998; Paul Rothemund, Erik Winfree, The program-size complexity of self-assembled squares, in: ACM Symposium on Theory of Computing, STOC02, Montreal, Quebec, Canada, 2001, pp. 459–468]. Research has identified two issues at the heart of self-assembling systems: the number of steps it takes for an assembly to complete, assuming maximum parallelism, and the minimal number of tiles necessary to assemble a shape. In this paper, I define the notion of a tile assembly system that computes a function, and tackle these issues for systems that compute the sum and product of two numbers. I demonstrate constructions of such systems with optimal Θ(1)$\Theta \left(1\right)$ distinct tile types and prove the assembly time is linear in the size of the input.