基于改进BP神经网络的柘林湾水质综合评价模型

建立了基于改进 BP神经网络的柘林湾水质综合评价模型 .实验结果表明 ,新模型的网络训练收敛速度比未改进的模型快、误差更小 ,而且能克服 BP网络所存在的“过拟合”现象 .因此 ,它的泛化能力强 ,结果客观、合理 .     

基于PCA与自适应BP算法的侵犯性驾驶行为识别

从机动车安全预警的角度,以有效识别侵犯性驾驶行为为目的,针对传统BP算法学习效率低、收敛速度慢等缺点,提出一种基于PCA与自适应学习速率的BP网络改进识别算法.首先借助人因系统及汽车驾驶平台进行仿真实验,获取驾驶人生理-心理及车辆运行数据集,然后利用主成分分析提取其特征指标,继而应用自适应学习速率BP网络改进算法对驾驶行为进行识别.结果表明:驾驶员呼吸、肌电、速度、油门、车道线偏距以及发动机转速受驾驶行为的影响较大;识别精度为96.17%,对比自适应学习速率BP网络算法、BP网络算法,算法能明显减小训练迭代次数、提高识别精度.     

基于粒子群优化的神经网络预测模型

BP学习算法多采用梯度下降法调整权值,针对其易陷入局部极小、收敛速度慢和易引起振荡的固有缺陷,提出了一种改进粒子群神经网络算法.其基本思想是:首先采用改进粒子群优化算法反复优化BP神经网络模型的权值参数组合,再用BP算法对得到的网络参数进一步精确优化,最后用得到精确的最优参数组合进行预测.实验结果表明,该算法在股指预测中的预测性能明显提高.     

基于改进PSO-BP神经网络的贮存可靠性预测

贮存可靠性是军事储备质量监测的重要环节,科学准确地预测贮存可靠度是现代化军事评估的必然要求。针对历史贮存数据,建立可靠度与年限的贮存可靠性预测模型,采用进化策略改进粒子群算法(PSO)优化BP神经网络进行贮存可靠性预测。通过数据扩充提高样本质量和数量,应用改进后的PSO算法优化BP神经网络的初始权值和阈值,提高网络的泛化能力。PSO算法较好的全局搜索能力与BP网络很强的局部搜索能力相结合,能够避免早熟现象,提高算法的收敛速度及预测精度。实验结果表明,改进的PSO-BP网络模型比PSO-BP和BP神经网络获得更好的预测性能。     

基于PSO_Trainlm BP模型的图像去噪研究

针对在使用BP模型进行图像去噪时,模型存在的对初始权阈值敏感、易陷入局部极小值和收敛速度慢的问题.为了提高模型去噪效率,提出采用改进粒子群神经网络模型进行图像去噪.首先运用改进粒子群算法对BP神经网络权阈值进行初始寻优,再用trainlm BP算法对优化的网络权阈值进一步精确优化,随后建立基于粒子群算法的BP神经网络去噪模型,并将其应用到图像去噪研究中.仿真结果表明,新模型结合了粒子群算法的全局寻优能力和BP算法的局部搜索能力,减小了模型对初始权阈值的敏感性,有效防止了模型陷入局部极小值的可能,提高了图像去噪模型的速度和质量.     

基于改进的BP网络对CET-4累计通过率时间序列的预测

时间序列并非总呈自相关性.与[4]不同,对本文中的CET-4累计通过率时间序列建立线性及二阶自回归模型,仿真计算失效.改进的BP网络,适用所有的一维时间序列.本文采用二步预测法,与其它采用BP网络对时间序列预测不同的是,本文不仅预测下一年的时间序列值,还将整个预测模型仿真出来,画出三维图形,从而为教务政策的制订提供直观易看、合理、客观的依据.     

MEA-BP模型在遥感影像分类中的应用研究

遥感影像分类作为遥感技术的一个重要应用,对遥感技术的发展具有重要作用.针对遥感影像数据特点,在目前的非线性研究方法中主要用到的是BP神经网络模型.但是BP神经网络模型存在对初始权阈值敏感、易陷入局部极小值和收敛速度慢的问题.因此,为了提高模型遥感影像分类精度,提出采用MEA-BP模型进行遥感影像数据分类.首先采用思维进化算法代替BP神经网络算法进行初始寻优,再用改进BP算法对优化的网络模型权阈值进一步精确优化,随后建立基于思维进化算法的BP神经网络分类模型,并将其应用到遥感影像数据分类研究中.仿真结果表明,新模型有效提高了遥感影像分类准确性,为遥感影像分类提出了一种新的方法,具有广泛研究价值.     

基于LM算法的BP神经网络的电力负荷短期预测

通过对BP神经网络输入负荷值的归一化处理,同时采用Levenberg-Marquardt(LM)算法,建立了一个改进了的BP神经网络,同时用它来对电力系统进行短期负荷预测.LM算法有效地提高了BP神经网络的收敛速度和负荷的预测精度.仿真结果表明,改进了的BP神经网络具有很高的预测精度和较强的适用能力.     

基于和积和最大积的信念传播算法的收敛性分析

在介绍马尔可夫网络和标准信念传播(Belief Propagation,BP)算法的基础上,以具有4个隐含结点的无环马尔可夫网络为例,详细分析了基于和积和最大积的BP算法收敛性,结果表明,在网络为无环马尔可夫网络时,基于和积的BP算法收敛于全局最优解,而基于最大积的BP算法在任何初值条件下,只要经过有限次迭代,BP算法必收敛到唯一固定点,若算法有唯一最优点,则此固定点为最优点.以实证分析为工具,研究BP算法收敛性,可作为BP算法基础理论研究的一次有益尝试.     

BP模式识别与Hopfield联想记忆识别能力的比较

神经网络可以进行模式识别,这一功能具有很高的实用价值.主要研究BP神经网络和离散Hopfield神经网络的识别能力.BP网络是前向神经网络,使用的是监督式学习规则.离散Hopfield是一种反馈网络,结构上输入、输出节点相连使得网络系统的输出状态具有动态变化特性.就数字,字母,手写体数字比较了BP网络和离散Hopfield网络的识别能力,得到了可观的结论,对两个网络的应用做更进一步的阐述.     

基于学习向量量化神经网络的水环境质量综合评价

针对水环境质量综合评价中指标权重确定方法的不足,利用学习向量量化(LVQ)神经网络具有的强大的非线性运算和相似特征聚类功能,提出一种基于学习向量量化(LVQ)神经网络的水质综合评价决策方法.将它应用于水质综合指标评价,为改进水质综合评价提供了一种简捷的分类评价方法.     

具有非期望产出的混联网络DEA模型

数据包络分析(DEA)是评价系统相对有效性的分析方法,网络DEA模型在评价企业的经济效益、管理效益等实际问题中有着广泛的应用.在网络DEA模型的基础上考虑非期望产出要素,提出了具有非期望产出的混联网络DEA模型.研究了新模型的系统弱DEA有效与各子阶段弱DEA有效之间的关系,找到了无效决策单元的无效阶段,通过有针对性的改进能够提高系统的整体效率.最后通过数值算例验证了模型的可行性.     

基于组合预测模型的广东省第三产业产值预测

首先分析了影响广东省第三产业发展的主要因素,指出由于上述因素相互制约、相互影响,导致第三产业的发展呈现出高度的非线性特征,并使得单一的预测模型在预测效果和泛化能力方面难以胜任.在此基础上,提出了基于神经网络集成的组合预测模型,对广东省第三产业的发展进行预测,阐述了算法的基本原理和数据处理流程,实证分析表明:基于神经网络集成的组合预测模型要比单一预测模型的预测精度高.     

Detecting embedded pure network structures in LP problems

Recently, linear programming problems with special structures have assumed growing importance in mathematical programming. It is well known that exploiting network structures within linear programs can lead to considerable improvement of the computational solution of large-scale linear programming problems. A linear program is said to contain an embedded network structure provided that some subset of its constraints can be interpreted as specifying conservation of flow. If a column of the constraint matrix has at most two non-zeros, then it leads to embedded generalized network structure and if these non-zeros are unit elements and of opposite signs, then it leads to embedded pure network structure. In this paper, we are concerned with algorithms for detecting embedded pure network structures within linear programs. The network extraction methods are presented in two groups. The first group covers deletion and addition based algorithms and the second group covers GUB based algorithms. We have extended the GUB based algorithm appearing in the second group by introducing Markowitz merit count approach for exploiting matrix non zeros. A set of well known test problems has been used to carry out computational experiments which show that our extensions to the GUB based algorithms give better results than the algorithms reported earlier.     

An Adaptive System for Global Optimization

An experimental system for global optimization has been developed,which relies on an internal model of the objective functionto represent its state of knowledge. A simple inference networkis used to turn this into strategic decisions at each stageof optimization. The parameters of the inference network canbe adapted by ‘training’ the system on test functions,and this produces a significant improvement in the efficiencyof the system.     

Using neural networks for identifying organizational improvement strategies

The struggle to remain competitive in the global marketplace occupies much of the energy of today's firms. Although there are many performance improvement strategies that can be implemented by an organization, it is yet to be determined which strategy or combination of these strategies, if any, is most helpful in improving performance. A genetic algorithm trained neural network is used to identify such combinations to provide direction to managers as to which performance improvement strategies are associated with increases in performance as reported by operations managers. This study shows that this neural network approach can identify combinations that result in better approximations of performance, as compared to standard statistical techniques, and should be considered as an appropriate tool for performance improvement strategy selection.     

Computing pure Nash and strong equilibria in bottleneck congestion games

Bottleneck congestion games properly model the properties of many real-world network routing applications. They are known to possess strong equilibria—a strengthening of Nash equilibrium to resilience against coalitional deviations. In this paper, we study the computational complexity of pure Nash and strong equilibria in these games. We provide a generic centralized algorithm to compute strong equilibria, which has polynomial running time for many interesting classes of games such as, e.g., matroid or single-commodity bottleneck congestion games. In addition, we examine the more demanding goal to reach equilibria in polynomial time using natural improvement dynamics. Using unilateral improvement dynamics in matroid games pure Nash equilibria can be reached efficiently. In contrast, computing even a single coalitional improvement move in matroid and single-commodity games is strongly NP-hard. In addition, we establish a variety of hardness results and lower bounds regarding the duration of unilateral and coalitional improvement dynamics. They continue to hold even for convergence to approximate equilibria.     

两个逆网络选址问题的计算复杂性

本文考虑两个我们称之为逆网络选址的改进问题,它们是修改网络上各个边的长度,分别使得网络上某个给定的顶点到网络上所有点的最大距离以及该点到其它顶点的距离之和不大于预先给定的上界,并且所做的修改总量最小.我们将证明这两个逆网络选址问题都是强NP困难的.     

Construction of a real-world bilevel linear programming model of the highway network design problem

The formulation of the highway network design problem (NDP) as a bilevel linear program (BLP) allows more realistic solutions taking into account the reaction of users to improvements made by the system. In this paper, a conceptual framework for the optimization of investments in inter-regional highway networks in developing countries is proposed. The model is applied to the Tunisian network using actual data. Considerable effort was expended to make the implementation as realistic as possible, taking into consideration travel times, operating costs, accident costs, improvement costs, conservation laws, and effects of intra-regional flows. A new formulation allowing the incorporation of any improvement cost functions, including non-convex and non-concave functions, is introduced.     

An analysis of the topological properties of the interlaced bypass torus (iBT) networks

We analyze a new class of interconnection networks that are constructed by interlacing bypass rings to the torus network (iBT network). We establish the minimum conditions a bypass scheme needs to satisfy for generating a qualified iBT network and then we develop a recursive algorithm to calculate all of the qualified bypass schemes for a given network size and node degree. Our algorithm enables us to discover a class of the most efficient networks with up to 1 million nodes when considering the diameters of various iBT networks as a function of the bypass schemes. These analyses help achieve maximal performance improvement by the best bypass schemes.