BP人工神经网络用于除草剂活性预测

采用AMI方法研究了10种新型的磺酰脲类除草剂的电子结构，并以原子的Mulliken净电荷和除草剂在不同浓度(100，10mg／L)下对油菜、稗草两种作物的根、茎部位的抑制率为训练样本集。构造并训练得到具有活性预测能力的BP神经网络．结果表明，该BP网络不仅能对训练样本很好拟合。亦能对未知化合物的活性作出很好的预测．     

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.     

全光网中基于FBG的OADM设计研究

提出一种全新的OADM(Optical Add—Drop Multiplexers)结构设计，此结构仅采用一个多端口环行器，大大减少了环行器的数量，节约了成本。若要上／下路一个波长．则只需要一个FBG(Fiber Bragg Grating)；若要同时上／下路多个波长，则需要2m个FBG。计算机仿真实验证明此结构比H．Yuan提出的结构具有更低的损耗．对全光网络的实现具有重大的意义。     

网络图在产品配送中的应用

面对多样化的市场需求，企业的销售渠道也变得异常复杂，利用网络图可以简化实际问题，并能形象地描述它。本根据网络知识建立了产品分销模型，探求企业在市场需求固定和随机时的最优收益。最后，章还进行实例验算，并做出相应的结果分析。     

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

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

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.     

TG of polytetrahydrofuran/ isophoronediisocyanate reaction products

TG, swelling, and viscometric studies are presented for the residues, PTHF/IPDI polymer networks, and the extracts, the linear polymers and unreacted IPDI, after Soxhlet extraction of PTHF/IPDI reaction products. The products are obtained by reacting PTHF with 650, 1400, (2×650+1×2900), or 2900 of molecular mass with IPDI at various concentrations in bulk. The results on the swelling and the viscosity experiments suggest that the PTHF/IPDI reaction products have a usual expectable structure. All the TG curves are a double stage curve. The initial stage and the last stage seem to reflect decomposition of PTHF chains and vaporization of the remainder, IPDI, respectively. These are analyzed by a trial-and-error construction, supposing double event behavior. The values of ratio of mass loss associated with the initial event, W0₁, to the mass loss associated with the last event, W0₂, are smaller than the expectable those. This suggests that Event 2 involves vaporization of the decomposition products of PTHF moieties bonded to IPDI in addition to vaporization of IPDI. This revised version was published online in July 2006 with corrections to the Cover Date.     

Information processing,memories, and synchronization in chaotic neural network with the time delay

Information processing and two types of memory in an analog neural network model with time delay that produces chaos similar to the human and animal EEGs are considered. There are two levels of information processing in this neural network: the level of individual neurons and the level of the neural network. Similar to the state of brain, the state of chaotic neural network is defined. It is characterized by two types of memories (memory I and memory II) and correlation structure between the neurons. In normal (unperturbed) state, the neural network generates chaotic patterns of averaged neuronal activities (memory I) and patterns of oscillation amplitudes (memory II). In the presence of external stimulation, the activity patterns change, showing changes in both types of memory. As in experiments on stimulation of the brain, the neural network model shows synchronization of neuronal activities due to stimulus measured by Pearson's correlation coefficient. An increase in neural network asymmetry (increase of the neural network excitability) leads to the phenomenon similar to the epilepsy. Modeling of brain injury, Parkinson's disease, and dementia is performed by removing and weakening interneuron connections. In all cases, the chaotic neural network shows a decrease of the degree of chaos and changes in both types of memory similar to those observed in experiments with healthy human subjects and patients with Parkinson's disease and dementia. © 2005 Wiley Periodicals, Inc. Complexity 11:39–52, 2005     

基于人工神经网络的商业银行信用风险模型

在对人工神经网络的基本原理进行简要介绍的基础上 ,着重对构建商业银行信用风险的人工神经网络模型进行了研究 ,实证结果表明 ,人工神经网模型具有很高的预测精度     

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.