algorithms for computing weak bisimulation equivalence

IEEE Comp Soc, IFIP, Tianjin Normal Univ

New Numerical Algorithms in SUPER CE/SE and Their Applications in Explosion Mechanics

The new numerical algorithms in SUPER/CESE and their applications in explosion mechanics are studied. The researched algorithms and models include an improved CE/SE (space-time Conservation Element and Solution Element) method, a local hybrid particle level set method, three chemical reaction models and a two-fluid model. Problems of shock wave reflection over wedges, explosive welding, cellular structure of gaseous detonations and two-phase detonations in the gas-droplet system are simulated by using the above-mentioned algorithms and models. The numerical results reveal that the adopted algorithms have many advantages such as high numerical accuracy, wide application field and good compatibility. The numerical algorithms presented in this paper may be applied to the numerical research of explosion mechanics.

Optimization of positions and currents of tokamak poloidal field coils using genetic algorithms

Plasma equilibrium geometry has a great influence on the confinement and magnetohydrodynamic stability in tokamaks. The poloidal field (PF) system of a tokamak should be optimized to support the prescribed plasma equilibrium geometry. In this paper, a genetic algorithm-based method is applied to solve the optimization of the positions and currents of tokamak PF coils. To achieve this goal, we first describe the free-boundary code EQT Based on the EQT code, a genetic algorithm-based method is introduced to the optimization. We apply this new method to the PF system design of the fusion-driven subcritical system and plasma equilibrium geometry optimization of the Experimental Advanced Superconducting Tokamak (EAST). The results indicate that the optimization of the plasma equilibrium geometry can be improved by using this method.

Phase unwrapping algorithms, respectively, based on path-following and discrete cosine transform

This paper describes a path-following phase unwrapping algorithm and a phase unwrapping algorithm based on discrete cosine transform (DCT) which accelerates the Computation and suppresses the propagation of noise. Through analysis of fringe pattern with serious noises simulated in mathematic model, we make a contrast between path-following algorithm and DCT algorithm. The advantages and disadvantages or analytical fringe pattern are also given through comparison of two algorithms. Three-dimensional experimental results have been given to prove the validity of these algorithms. Despite DCT phase unwrapping technique robustness and speed in some cases, it cannot be unwrapping inconsistencies phase. The path-following algorithm can be used in automation analysis of fringe patterns with little influence of noise. (c) 2007 Elsevier GmbH. All rights reserved.

Design of triangular lattice photonic crystals using genetic algorithms

Genetic Algorithms (GAs) were used to design triangular lattice photonic crystals with large absolute band-gap. Considering fabricating issues, the algorithms represented the unit cell with large pixels and took the largest absolute band-gap under the fifth band as the objective function. By integrating Fourier transform data storage mechanism, the algorithms ran efficiently and effectively and optimized a triangular lattice photonic crystal with scatters in the shape of 'dielectric-air rod'. It had a large absolute band gap with relative width (ratio of gap width to midgap) 23.8%.

New algorithms of the TSM and TOM methods for calibrating microwave test fixtures

Based on the conventional through-short-match (TSM) method, an improved TSM method has been proposed in this Letter. This method gives an analytical solution and has almost all the advantages of conventional TSM methods. For example, it has no phase uncertainty and no bandwidth limitation. The experimental results show that the accuracy can be significantly improved with this method. The proposed theory can be applied to the through-open-match (TOM) method. (C) 2002 Wiley Periodicals. Inc.

基于PAR的高可信装备保障算法推演

算法被誉为计算的“灵魂”（spirit of computing），算法程序的可靠性和正确性对软件系统的可信度起着至关重要的作用。动态规划、贪心、分支限界等传统的算法设计策略缺乏有效的选择标准，一些算法形式化开发方法和工具的应用水平和范围也很有限，因此算法的可靠性已成为高可信软件系统的一个主要瓶颈。 作为军事运筹学的一个重要分支，装备保障计算主要研究军事活动中装备领域的决策优化问题，保障计算软件特别是算法的可靠性在很大程度上决定了装备保障的效率乃至军事行动的成败。利用形式化软件工程的研究成果、特别是引入算法程序的形式化开发方法，对我军通用装备保障领域中的大量算法类问题进行有效求解，有利于优化保障结构、统筹保障资源、整合保障力量、提高保障时效，促进装备整体战斗力水平的提升。 本文以高可信软件开发方法PAR为基础，面向装备保障计算的领域需求，提出了一类离散最优化问题（discrete optimization problem, DOP）的结构模型和算法推演技术，并成功推演了一系列典型的装备保障算法。本论文的主要创新性贡献如下： （1）定义了DOP的结构模型，提出了基于单点结构（Singleton）的问题分划递推策略，进而通过PAR算法推演生成问题的高效求解算法，涵盖了多种传统算法设计策略，显著提高了算法程序设计的机械化水平。 （2）提出了描述DOP分划递推过程的问题简约图（problem reduction graph, PRG）模型，并针对典型DOP结构推演得到了一组PRG构造算法模式，其中每个算法模式都涵盖了满足特定代数结构性质的一大类具体问题。 （3）阐述了PAR算法推演的范畴模型，为算法设计和重用提供了抽象而有效的方法指导。 （4）对我军通用装备保障领域具有代表性的48个问题进行了形式化的算法推演，构建了领域算法库。 （5）在PAR平台的基础上设计了装备保障算法开发平台的原型COPALM，支持DOP算法推演和重用，进而提高了相关应用软件的开发效率。

hyo-xtm: a set of hyper-graph operations on xml topic map toward knowledge management

Knowledge management is a critical issue for the next-generation web application, because the next-generation web is becoming a semantic web, a knowledge-intensive network. XML Topic Map (XTM), a new standard, is appearing in this field as one of the structures for the semantic web. It organizes information in a way that can be optimized for navigation. In this paper, a new set of hyper-graph operations on XTM (HyO-XTM) is proposed to manage the distributed knowledge resources.HyO-XTM is based on the XTM hyper-graph model. It is well applied upon XTM to simplify the workload of knowledge management.The application of the XTM hyper-graph operations is demonstrated by the knowledge management system of a consulting firm. HyO-XTM shows the potential to lead the knowledge management to the next-generation web.