基于进化人工神经网络的组合系统滤波技术

在组合系统运用Kalman滤波器技术时,准确的系统模型和可靠的观测数据是保证其性能的重要因素,否则将大大降低Kalman滤波器的估计精度,甚至导致滤波器发散.为解决上述Kalman应用中的实际问题,提出了一种新颖的基于进化人工神经网络技术的自适应Kalman滤波器.仿真试验表明该算法可以在系统模型不准确时、甚至外部观测数据短暂中断时,仍能保证Kalman滤波器的性能.     

Elliptic and parabolic problems in unbounded domains

We consider elliptic and parabolic problems in unbounded domains. We give general existence and regularity results in Besov spaces and semi‐explicit representation formulas via operator‐valued fundamental solutions which turn out to be a powerful tool to derive a series of qualitative results about the solutions. We give a sample of possible applications including asymptotic behavior in the large, singular perturbations, exact boundary conditions on artificial boundaries and validity of maximum principles. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Artificial time integration

Many recent algorithmic approaches involve the construction of a differential equation model for computational purposes, typically by introducing an artificial time variable. The actual computational model involves a discretization of the now time-dependent differential system, usually employing forward Euler. The resulting dynamics of such an algorithm is then a discrete dynamics, and it is expected to be “close enough” to the dynamics of the continuous system (which is typically easier to analyze) provided that small – hence many – time steps, or iterations, are taken. Indeed, recent papers in inverse problems and image processing routinely report results requiring thousands of iterations to converge. This makes one wonder if and how the computational modeling process can be improved to better reflect the actual properties sought. In this article we elaborate on several problem instances that illustrate the above observations. Algorithms may often lend themselves to a dual interpretation, in terms of a simply discretized differential equation with artificial time and in terms of a simple optimization algorithm; such a dual interpretation can be advantageous. We show how a broader computational modeling approach may possibly lead to algorithms with improved efficiency. AMS subject classification (2000)  65L05, 65M32, 65N21, 65N22, 65D18     

人工神经网络在SARS疫情分析与预测中的应用

讨论人工神经网络在 SARS疫情分析与预测中的应用 .采用三层结构的反向传播网络 ( Backpropagation network,简称 BP网络 ) ,对 SARS在中国的传播与流行趋势及控制策略建立了网络模型 .并利用实际数据拟合参数 ,针对北京、山西的疫情进行了计算仿真 .结果表明 ,该网络模型算法收敛速度较快 ,预测精度很高     

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

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

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.     

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.     

Sum-fuzzy implementation of a choice function using artificial learning procedure with fixed fraction

In one if his paper Luo transformed the problem of sum-fuzzy rationality into artificial learning procedure and gave an algorithm which used the learning rule of perception. This paper extends the Luo method for finding a sum-fuzzy implementation of a choice function and offers an algorithm based on the artificial learning procedure with fixed fraction. We also present a concrete example which uses this algorithm.