一类求解约束非线性规划问题的神经网络模型

提出一类求解闭凸集上非线性规划问题的神经网络模型。理论分析和计算机模拟表明在适当的假设下所提出的神经网络模型大范围指数级收敛于非线性规划问题的解集。本文神经网络所采用的方法属于广义的最速下降法,甚至当规划问题地正定二次时,本文的模型也比已有的神经网络模型简单。     

基于最小模估计及Tikhonov正则方法的脑磁源重建

脑磁图（magnetoencephalogram,MEG）研究中的磁源分布图象重建,属于不适定问题,需要引入适合的先验约束,把它转化为适定问题。采用非参数的分布源模型,磁源成象问题即为求解病态的欠定的线性方程组。这里采用的方法是建立在最小模估计和Tikhonov正则的基础上,从数学算法本身及相关的解剖学和神经生理学的信息,对解空间加以限制,提出了区域加权算子,再结合深工加权,以期得到合理的神经电流分布。通过仿真实验表明能得出理想的重建结果,同时讨论了该方法的局限性以及下一步的工作方向。     

声聚焦层析增强的三维微波热声成像

本文提出了一种提高微波热声断层成像层析能力的方法和装置.基于热声成像原理和声聚焦理论,搭建了由超短脉冲微波源、384阵元环形探测器、声聚焦透镜、384-64通道采集切换系统、精密扫描位移平台构成的微波热声三维成像系统,并实现了模拟样品的断层成像.实验结果表明该系统能够实现亚毫米级分辨率的热声成像,通过声聚焦方法成倍地提高了其层析分辨率.这对推动微波热声CT技术走向临床具有重要的意义.     

一类混合时滞的非线性耦合神经网络的同步

主要讨论了一类混合时滞的非线性耦合神经网络的同步问题.同时,考虑随机扰动以及参数的切换由某个马尔可夫链所确定等方面对其的影响.文中通过构造新的Lyapunov-Krasovskii泛函,运用线性矩阵不等式（LMI）技术并结合Kronecker积来获得神经网络全局同步的充分性判据.由于这样得到的判据是LMI形式,因此可以由数学软件Matlab的LMI Toolbox对所获得的判据进行有效的验证和求解.此外,本文中我们对细胞激活函数做了更为一般的假设,从而使结论在LMI下可以减少保守性.     

基于BP神经网络和RBF神经网络预测老年痴呆症疾病进展的对比研究

目的:比较反向传播算法(BP)神经网络和径向基函数(RBF)神经网络预测老年痴呆症疾病进展的效果。方法:以老年痴呆症随访数据为研究对象,以性别、年龄、受教育程度、有无高血压、有无高胆固醇、有无心脏病、有无中风史、有无家族史8个指标作为输入变量,以五年随访的MMSE差值为输出变量,构建基于BP神经网络和RBF神经网络的老年痴呆症疾病进展预测模型。结果:与BP神经网络模型相比,RBF神经网络预测的结果更好,能够有效地预测老年痴呆症疾病进展。结论:神经网络模型将老年痴呆症疾病进展预测问题转化为随访数据中相关测量指标与MMSE差值的非线性问题,为复杂的老年痴呆症疾病进展预测提供了新思路。     

人工神经网络在发酵工业中的应用

人工神经网络技术具有很强的非线性映射能力,用于系统的非线性建模,具有无可比拟的优势,广泛应用于发酵过程中培养基的优化和系统建模与控制方面,本主要介绍了人工神经网络的基本原理与使用方法,以及BP神经网络在非线性函数逼近的优点,详细介绍了其在发酵培养基优化,连续搅拌反应器神经网络估计,分批发酵及补料分批发酵过程建模与控制优化中的应用实例。     

微波加热时基托树脂收缩量的研究

目的,针对基托树脂固化的特性,探讨微波加热对树脂收缩量的影响。方法:采用四种常用基托树脂,分别采取单纯微波固化和微波加压固化聚合后,测定开盒后一周内树脂的聚合收缩情况。结果:两种固化方法收缩量均较小,适应性强。微波加压固化虽收缩量相对稍大但收缩均匀各树脂间无显著差异。结论:微波加热固化清洁高效,基托树脂结构致密,收缩量小,是今后树脂固化的一个发展方向。     

基于投影寻踪理论的稻飞虱发生程度预测模型

稻飞虱发生程度与相关气候因子的数据大多具有高维非正态、非线性特征,采用统计预测法会出现预测效果的不稳定,采用人工神经网络预测模型需要较多的训练样本.投影寻踪模型把高维数据投影到低维子空间上,对数据结构进行分析,一定程度上解决了非线性、非正态问题.本文建立了浙江省新昌县单季晚稻稻飞虱主害代发生程度的投影寻踪预测模型,并与BP神经网络模型、线性回归模型的预测结果进行了对比.结果表明:投影寻踪模型优于BP神经网络模型、线性回归模型;投影寻踪模型的历史符合率和预测准确率均为100%;BP神经网络模型历史符合率达到100%,但预测偏差较大;线性回归模型历史符合率和预测偏差均较大.可见,投影寻踪模型在稻飞虱发生程度的预测上具有较好的应用前景.     

林地叶面积指数遥感估算方法适用分析

叶面积指数是与森林冠层能量和CO2交换密切相关的一个重要植被结构参数,为了探讨估算林地叶面积指数LAI的遥感适用方法和提高精度的途径,利用TRAC仪器测定北京城区森林样地的LAI,从Landsat TM遥感图像计算NDVI、SR、RSR、SAVI植被指数,分别建立估算LAI的单植被指数统计模型、多植被指数组合的改进BP神经网络,获取最有效描述LAI与植被指数非线性关系的方法并应用到TM图像估算北京城区LAI。结果表明,单植被指数非线性统计模型估算LAI的精度高于线性统计模型;多植被指数组合神经网络中,以NDVI、RSR、SAVI组合估算LAI的精度最高,估算值与观测值线性回归方程的R2最高,为0.827,而RMSE最低,为0.189,神经网络解决了多植被指数组合统计模型非线性回归方程的系数较多、较难确定的问题,可较为有效的应用于遥感图像林地LAI的估算。     

小波神经网络在脑电信号数据压缩与棘波识别中的应用

介绍了一种新的神经网络模型———小波神经网络,利用它并适当调节网络、小波基参数,实现了对脑电信号的压缩表达,较好的恢复了原有信号。另外,在其算法研究的基础上,提出了适应于非稳态和非线性信号处理的时频分析新方法。在脑电信号的时频谱等高线图上,得到了易于自动识别的棘波和棘慢复合波特征,与传统的短时傅立叶变换（ＳＴＦＴ）和Ｗｉｇｎｅｒ分布相比,此方法有更高的分辨率和自适应性,而且其时频能量分布没有交叉项干扰。     

The simultaneous recurrent neural network for addressing the scaling problem in static optimization.

A trainable recurrent neural network, Simultaneous Recurrent Neural network, is proposed to address the scaling problem faced by neural network algorithms in static optimization. The proposed algorithm derives its computational power to address the scaling problem through its ability to "learn" compared to existing recurrent neural algorithms, which are not trainable. Recurrent backpropagation algorithm is employed to train the recurrent, relaxation-based neural network in order to associate fixed points of the network dynamics with locally optimal solutions of the static optimization problems. Performance of the algorithm is tested on the NP-hard Traveling Salesman Problem in the range of 100 to 600 cities. Simulation results indicate that the proposed algorithm is able to consistently locate high-quality solutions for all problem sizes tested. In other words, the proposed algorithm scales demonstrably well with the problem size with respect to quality of solutions and at the expense of increased computational cost for large problem sizes.     

An annealed chaotic maximum neural network for bipartite subgraph problem

In this paper, based on maximum neural network, we propose a new parallel algorithm that can help the maximum neural network escape from local minima by including a transient chaotic neurodynamics for bipartite subgraph problem. The goal of the bipartite subgraph problem, which is an NP- complete problem, is to remove the minimum number of edges in a given graph such that the remaining graph is a bipartite graph. Lee et al. presented a parallel algorithm using the maximum neural model (winner-take-all neuron model) for this NP- complete problem. The maximum neural model always guarantees a valid solution and greatly reduces the search space without a burden on the parameter-tuning. However, the model has a tendency to converge to a local minimum easily because it is based on the steepest descent method. By adding a negative self-feedback to the maximum neural network, we proposed a new parallel algorithm that introduces richer and more flexible chaotic dynamics and can prevent the network from getting stuck at local minima. After the chaotic dynamics vanishes, the proposed algorithm is then fundamentally reined by the gradient descent dynamics and usually converges to a stable equilibrium point. The proposed algorithm has the advantages of both the maximum neural network and the chaotic neurodynamics. A large number of instances have been simulated to verify the proposed algorithm. The simulation results show that our algorithm finds the optimum or near-optimum solution for the bipartite subgraph problem superior to that of the best existing parallel algorithms.     

A neural network methodology of quadratic optimization.

According to the basic optimization principle of artificial neural networks, a novel kind of neural network model for solving the quadratic programming problem is presented. The methodology is based on the Lagrange multiplier theory in optimization and seeks to provide solutions satisfying the necessary conditions of optimality. The equilibrium point of the network satisfies the Kuhn-Tucker condition for the problem. The stability and convergency of the neural network is investigated and the strategy of the neural optimization is discussed. The feasibility of the neural network method is verified with the computation examples. Results of the simulation of the neural network to solve optimum problems are presented to illustrate the computational power of the neural network method.     

A novel approach to the recognition of protein architecture from sequence using Fourier analysis and neural networks

A novel method is presented for the prediction of protein architecture from sequence using neural networks. The method involves the preprocessing of protein sequence data by numerically encoding it and then applying a Fourier transform. The encoded and transformed data are then used to train a neural network to recognize a number of different protein architectures. The method proved significantly better than comparable alternative strategies such as percentage dipeptide frequency, but is still limited by the size of the data set and the input demands of a neural network. Its main potential is as a complement to existing fold recognition techniques, with its ability to identify global symmetries within protein structures its greatest strength.     

Pruning artificial neural networks using neural complexity measures

This paper describes a new method for pruning artificial neural networks, using a measure of the neural complexity of the neural network. This measure is used to determine the connections that should be pruned. The measure computes the information-theoretic complexity of a neural network, which is similar to, yet different from previous research on pruning. The method proposed here shows how overly large and complex networks can be reduced in size, whilst retaining learnt behaviour and fitness. The technique proposed here helps to discover a network topology that matches the complexity of the problem it is meant to solve. This novel pruning technique is tested in a robot control domain, simulating a racecar. It is shown, that the proposed pruning method is a significant improvement over the most commonly used pruning method Magnitude Based Pruning. Furthermore, some of the pruned networks prove to be faster learners than the benchmark network that they originate from. This means that this pruning method can also help to unleash hidden potential in a network, because the learning time decreases substantially for a pruned a network, due to the reduction of dimensionality of the network.     

Rule extraction from minimal neural networks for credit card screening

While feedforward neural networks have been widely accepted as effective tools for solving classification problems, the issue of finding the best network architecture remains unresolved, particularly so in real-world problem settings. We address this issue in the context of credit card screening, where it is important to not only find a neural network with good predictive performance but also one that facilitates a clear explanation of how it produces its predictions. We show that minimal neural networks with as few as one hidden unit provide good predictive accuracy, while having the added advantage of making it easier to generate concise and comprehensible classification rules for the user. To further reduce model size, a novel approach is suggested in which network connections from the input units to this hidden unit are removed by a very straightaway pruning procedure. In terms of predictive accuracy, both the minimized neural networks and the rule sets generated from them are shown to compare favorably with other neural network based classifiers. The rules generated from the minimized neural networks are concise and thus easier to validate in a real-life setting.     

Predicting protein complex geometries with a neural network

A major challenge of the protein docking problem is to define scoring functions that can distinguish near‐native protein complex geometries from a large number of non‐native geometries (decoys) generated with noncomplexed protein structures (unbound docking). In this study, we have constructed a neural network that employs the information from atom‐pair distance distributions of a large number of decoys to predict protein complex geometries. We found that docking prediction can be significantly improved using two different types of polar hydrogen atoms. To train the neural network, 2000 near‐native decoys of even distance distribution were used for each of the 185 considered protein complexes. The neural network normalizes the information from different protein complexes using an additional protein complex identity input neuron for each complex. The parameters of the neural network were determined such that they mimic a scoring funnel in the neighborhood of the native complex structure. The neural network approach avoids the reference state problem, which occurs in deriving knowledge‐based energy functions for scoring. We show that a distance‐dependent atom pair potential performs much better than a simple atom‐pair contact potential. We have compared the performance of our scoring function with other empirical and knowledge‐based scoring functions such as ZDOCK 3.0, ZRANK, ITScore‐PP, EMPIRE, and RosettaDock. In spite of the simplicity of the method and its functional form, our neural network‐based scoring function achieves a reasonable performance in rigid‐body unbound docking of proteins. Proteins 2010. © 2009 Wiley‐Liss, Inc.     

A self-organising neural network model of image velocity encoding

A self-organising neural network has been developed which maps the image velocities of rigid objects, moving in the fronto-parallel plane, topologically over a neural layer. The input is information in the Fourier domain about the spatial components of the image. The computation performed by the network may be viewed as a neural instantiation of the Intersection of Constraints solution to the aperture problem. The model has biological plausibility in that the connectivity develops simply as a result of exposure to inputs derived from rigid translation of textures and its overall organisation is consistent with psychophysical evidence.     

A bayesian recurrent neural network for unsupervised pattern recognition in large incomplete data sets

A recurrent neural network, modified to handle highly incomplete training data is described. Unsupervised pattern recognition is demonstrated in the WHO database of adverse drug reactions. Comparison is made to a well established method, AutoClass, and the performances of both methods is investigated on simulated data. The neural network method performs comparably to AutoClass in simulated data, and better than AutoClass in real world data. With its better scaling properties, the neural network is a promising tool for unsupervised pattern recognition in huge databases of incomplete observations.