HIGH ACCURACY NUMERICAL METHOD OF THIN-FILM PROBLEMS IN MICROMAGNETICS

In this paper, a new high accuracy numerical method for the thin-film problems of micron and submicron size ferromagnetic elements is proposed. For the computation of stray field, we use the finite element method(FEM) by introducing a semi-discrete artificial boundary condition [1, 2]. In our numerical experiments about the domain patterns and their movement, we can see that the results are accordant to that of experiments and other numerical methods. Our method are very convenient to deal with arbitrary shape of thin films such as a polygon with high accuracy.     

微纳米加工技术在纳米物理与器件研究中的应用

物质在纳米尺度下可能呈现出与体材料不同的物理特件，这正是纳米科技发展的基础之一。要想探索在纳米尺度下材料物埋性质的变化规律及可能的应用领域，离不开相应的技术手段，微纳米加工技术作为当今高技术发展的重要技术领域之一，是实现功能人工纳米结构与器件微纳米化的基础。本文根据几个不同的应用领域，介绍了微纳米加工技术在纳米物理与器件研究领域的应用。     

On Numerical Solution of Shape Inverse Problems

The new method is proposed for the numerical solution of a class of shape inverse problems. The size and the location of a small opening in the domain of integration of an elliptic equation is identified on the basis of an observation. The observation includes the finite number of shape functionals. The approximation of the shape functionals by using the so-called topological derivatives is used to perform the learning process of an artificial neural network. The results of computations for 2D examples show, that the method allows to determine an approximation of the global solution to the inverse problem, sufficiently closed to the exact solution. The proposed method can be extended to the problems with an opening of general shape and to the identification problems of small inclusions. However, the mathematical theory of the proposed approach still requires futher research. In particular, the proof of global convergence of the method is an open problem.     

专家系统技术在注塑模故障诊断中的应用

论述了用人工智能技术对模具故障进行诊断和确定对策的原理和方法。对模具在工作中常遇到的与模具制造、工艺条件及塑料材料有关的问题及相应对策进行了归纳整理，组成了模具诊断与维修知识库。收集了常用工程塑料的各种有关成型工艺条件和主要性能，建立了塑料材料数据库。采用正向推理控制策略搜索知识库，并将推理结果与理论计算结果进行对比校验，最后确定出模具工作中出现故障的原因，并输出相应的解决办法和建议．     

器官发育及细胞程序化死亡的基因调节研究

用线虫实验模型系统研究调节器官发育及细胞程序化死亡的基因，且发现这种基因在人体中也存在，这一成果获得了2002年诺贝尔生理学医学奖。“程序性细胞死亡”机理的发现为艾滋病、肿瘤和癌症等疾病的治疗提供了寻找新方法的可能，将在人类战胜疾病过程中发挥重要作用。     

浅谈人工挖孔桩

分析了人工挖孔桩施工中遇到的问题(如水、溶洞、淤泥层、流砂),并提出了相应的处理措施。     

Numerical simulation on an interaction of a vortex street with an elliptical leading edge using an unstructured grid

An algorithm for a time accurate incompressible Navier–Stokes solver on an unstructured grid is presented. The algorithm uses a second order, three‐point, backward difference formula for the physical time marching. For each time step, a divergence free flow field is obtained based on an artificial compressibility method. An implicit method with a local time step is used to accelerate the convergence for the pseudotime iteration. To validate the code, an unsteady laminar flow over a circular cylinder at a Reynolds number of 200 is calculated. The results are compared with available experimental and numerical data and good agreements are achieved. Using the developed unsteady code, an interaction of a Karman vortex street with an elliptical leading edge is simulated. The incident Karman vortex street is generated by a circular cylinder located upstream. A clustering to the path of the vortices is achieved easily due to flexibility of an unstructured grid. Details of the interaction mechanism are analysed by investigating evolutions of vortices. Characteristics of the interactions are compared for large‐ and small‐scale vortex streets. Different patterns of the interaction are observed for those two vortex streets and the observation is in agreement with experiment. Copyright © 2004 John Wiley & Sons, Ltd.     

直接求线性规划可行基的一种方法

本文给出直接求线性规划问题基可行解的一种简易方法,该方法既避免了引入人工变量,减少存储,一般又能较快地得到一个较好的基可行解.     

Branch and win: OR tree search algorithms for solving combinatorial optimisation problems

Currently, most combinatorial optimisation problems have to be solved, if the optimum solution is sought, using general techniques to explore the space of feasible solutions and, more specifically, through exploratory enumerative procedures in trees and search graphs. We propose Branch and Win, a general formulation for understanding and synthesising the different tree search procedures that have been presented in the literature of operations research as well as in that of artificial intelligence. Several general ideas are also presented, whose application allows designing new hybrid search algorithms, in order to implement the procedure.