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

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

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.     

Rapprochement of artificial intelligence and dynamics

It is proposed that continuous time is in effect discretized in the brain by dynamic pattern recognition mechanisms in neurons. Time discretization is required to support formal computations in continuous time systems consisting of a large number of components. The ability to perform formal computations is necessary if the system is to execute high level algorithms of the type used in present day artificial intelligence. The weakness of such algorithms is that they work efficiently only when the forms of patterns and objects presented to them are highly constrained. The dynamic mechanisms which discretize the brain's time line also serve to code patterns into constrained forms suitable for high level processing.     

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.     

集成滤波器在谱图信号除噪中的应用

本文提出了一种由神经元网络与线性自适应滤波器组成的集成滤波器的实现方法，用于谱图信号除噪处理。     

Steroid Cyclophanes as Artificial Cell-surface Receptors. Molecular Recognition and its Consequence in Signal Transduction Behavior

Steroid cyclophanes, bearing four bile acid moieties covalently placed on a tetraazaparacyclophane skeleton, were designed and synthesized as artificial cell-surface receptors. Guest-binding behavior of the steroid cyclophanes embedded in a bilayer membrane formed with a synthetic peptide lipid was clarified by means of fluorescence and circular dichroism spectroscopy. We found that the steroid cyclophane effectively bound aromatic guests in both bilayer membranes and aqueous solution. In addition, copper(II) ions acted as a guest species for the steroid cyclophane and a competitive inhibitor toward a NADH-dependent lactate dehydrogenase (LDH). On these grounds, we constituted a supramolecular assembly as an artificial signaling system in combination with the steroid cyclophane, a cationic peptide lipid, and LDH. As a consequence, the steroid cyclophane acted as an effective artificial cell-surface receptor being capable of transmitting an external signal to the enzyme in collaboration with copper(II) ions as a signal transmitter.