Necessary and sufficient conditions for global optimality of eigenvalue optimization problems

The necessary and sufficient conditions for global optimality are derived for an eigenvalue optimization problem. We consider the generalized eigenvalue problem where real symmetric matrices on both sides are linear functions of design variables. In this case, a minimization problem with eigenvalue constraints can be formulated as Semi-Definite Programming (SDP). From the Karush-Kuhn-Tucker conditions of SDP, the necessary and sufficient conditions are derived for arbitrary multiplicity of the lowest eigenvalues for the case where important lower bound constraints are considered for the design variables. Received May 18, 2000     

Necessary and sufficient conditions for a bounded solution to the optimality equation in average reward Markov decision chains

We consider average reward Markov decision processes with discrete time parameter and denumerable state space. We are concerned with the following problem: Find necessary and sufficient conditions so that, for arbitrary bounded reward function, the corresponding average reward optimality equation has a bounded solution. This problem is solved for a class of systems including the case in which, under the action of any stationary policy, the state space is an irreducible positive recurrent class.     

一类模糊神经网络结构的混沌优化设计

基于混沌变量，提出一种关于模糊神经网络结构的优化设计方法。将混沌变量引入模糊神经网络结构和参数的优化搜索中，使得模糊神经网络的规则数以及所有参数都处于混沌状态中，根据性能指标来寻找一个较优的网络。在线优化采用最小二乘法对去模糊化部分的权参数进行实时修正。仿真实验表明，基于混沌优化的模糊神经网络结构精简，控制精度高。     

Efficient and effective Bayesian network local structure learning

In this paper, we propose a more efficient Bayesian network structure learning algorithm under the framework of score based local learning (SLL). Our algorithm significantly improves computational efficiency by restricting the neighbors of each variable to a small subset of candidates and storing necessary information to uncover the spouses, at the same time guaranteeing to find the optimal neighbor set in the same sense as SLL. The algorithm is theoretically sound in the sense that it is optimal in the limit of large sample size. Empirical results testify its improved speed without loss of quality in the learned structures.     

Using minimal cuts to optimize network reliability for a stochastic computer network subject to assignment budget

In our modern society, information and data are usually transmitted through a computer network. Since the computer network's reliability has a great impact on the quality of data transmission, many organizations devote to evaluating or improving network reliability, especially for network reliability optimization. This study focuses on such a confronted problem that is to find the optimal transmission line assignment to the computer network such that network reliability is maximized subject to the budget constraint. Each transmission line owns several states due to failure, maintenance, etc., and thus the computer network associated with any transmission line assignment is called a stochastic computer network. Network reliability is the probability that the computer network can transmit the specified units of data successfully. Because the discussed problem is NP-hard, an optimization algorithm that integrates the genetic algorithm, minimal cuts and Recursive Sum of Disjoint Products is proposed. Experimental results illustrate the solution procedure and show that the proposed algorithm can be executed in a reasonable time.     

规则网络中的SIRS病毒局域控制建模与仿真*

提出一个带有局域控制的二维规则网络SIRS模型,理论分析和计算机仿真都表明局域控制能很好地抑制此模型中的病毒传播。研究发现系统状态随时间的演化最终会达到一个稳定状态;病毒的稳态感染比例与传播效率、被控制个体比例和免役个体失去免役能力的概率有关。只有当传播效率大于一个临界值时,病毒才能在网络中持续传播。     

Supply chain network design using an integrated neuro-fuzzy and MILP approach: A comparative design study

In this study, an integrated supply chain (SC) design model is developed and a SC network design case is examined for a reputable multinational company in alcohol free beverage sector. Here, a three echelon SC network is considered under demand uncertainty and the proposed integrated neuro-fuzzy and mixed integer linear programming (MILP) approach is applied to this network to realize the design effectively. Matlab 7.0 is used for neuro-fuzzy demand forecasting and, the MILP model is solved using Lingo 10.0. Then Matlab 7.0 is used for artificial neural network (ANN) simulation to supply a comparative study and to show the applicability and efficiency of ANN simulation for this type of problem. By evaluating the output data, the SC network for this case is designed, and the optimal product flow between the factories, warehouses and distributors are calculated. Also it is proved that the ANN simulation can be used instead of analytical computations because of ensuring a simplified representation for this method and time saving.     

基于贝叶斯网络的计算机经济信息系统可靠性模型及其应用

主要针对计算机经济信息系统由构件和连接件形成的可靠性模型及其应用进行了研究。根据现代贝叶斯网络方法具有推理精确、直观易理解和较强可操作性的特点,经过对经济信息系统的实例分析可以得到系统可靠性计算概率值与系统诊断的分析结果。说明该模型可方便地用于经济信息系统的可靠性计算和系统可靠性诊断,并可以在第三方构件和异构环境中进行可靠性分析。     

Topological design of a distributed computer communication network in a noisy environment

The effect of noisy links is considered in the design of a computer communication network topology. Because of noisy links, and the consequent probability of bit error, additional network traffic in the form of acknowledgement packets and retransmission packets are generated which load the network. A topological design procedure for obtaining a minimum cost network is proposed which satisfies given constraints of overall network delay, maximum delay on a link, throughput and reliability. Traffic priority for different classes of traffic is also taken into consideration in the design. As expected, the network cost increases as the bit error probability of the links increases.     

不确定非线性系统自适应镇定的充要条件

研究了一类相当广泛的包含未知参数的非线性控制系统的自适应鲁棒控制问题,这类系统的标称系统包含一些非最小相位非线性系统和一些不存在相对阶的非线性系统．其未知定常参数是线性的．在一定假设条件下,对该类系统给出了存在自适应控制器的充要条件,并采用backstepping方法给出了控制器的设计步骤．所得主要结论没有用到增长性假设、最小相位假设和相对阶的假设．同时,还给出了不存在相对阶及非最小相位的非线性系统的例子,对于后者给出了控制器的设计过程．     

关于计算机网络课程教学改革的探讨

随着计算机网络技术和通讯技术的飞速发展,现有的计算机网络课程教学的弊端也逐渐显现了出来。教材更新不及时,教学方法单一,实践应用欠缺等都是目前计算机网络课程教学存在的问题,教学改革已迫在眉睫。如何改正这些问题,让计算机网络课程教学更符合学生的需求,跟上时代发展的需要,是一个值得广大的计算机教师深思的问题。本文就针对这些问题,谈一谈对计算机网络课程教学改革的一点看法。     

Transport network design of integrated networks with real-time dynamic routing

Integrated real-time dynamic routing (IRR) networks provide dynamic routing features for multiple classes-of-service on an integrated transport network. In a previous Journal paper it is shown that IRR networks allow reduced network management costs since with real-time dynamic routing a number of network operations are simplified or eliminated, leading to savings in operations costs and expenses. In this paper a new algorithm is described for the transport design of IRR networks which achieves near-optimal capacity engineering. In particular, a Karmarkar Algorithm optimal solution to the linear programming flow model achieves approximately a 5 to 8 percentage point reduction in network design cost in comparison to the designs of pre-planned dynamic networks solved with heuristic design techniques. The optimization techniques described in this and the previous Journal paper attain significant capital cost reductions and network performance improvements by properly modeling the more efficient operation of IRR networks.     

Necessary and sufficient conditions for the existence of a positive definite solution of a nonlinear matrix equation

Some necessary and sufficient conditions for the existence of a positive definite solution of the nonlinear matrix equation X+A*X ^?α A=Q (0<α≤1) are given. By the way an iterative method is presented. Furthermore, the convergence and error estimation of the iterative algorithm are derived. The illustrative numerical examples due to Peng are worked out.     

The new neighbourhood in the internet era: network communities serving local communities

The past two decades have witnessed many attempts to transform online communities in new neighbourhoods of the Internet era. In particular, one of the most interesting applications of Internet Technologies in this field have been ‘network communities’, that differ from online communities because they refer to a specific territory and, for this reason, serve as a social catalyst for the corresponding territorial community. Network communities, as virtual neighbourhoods, have the purpose of allowing a better understanding of physical ones, contributing to the creation and the proliferation of services most suited to the needs of residents. For this reason, municipalities and local governments should consider the opportunity to exploit network communities as useful tools for local community management. Following this lead, this article analyses a real case study and highlights the existence of a positive correlation between a constructive utilisation of a network community by its members, their sense of community and the degree of their involvement in local problems.     

计算机网络安全评价中神经网络的应用研究

当前,科学技术快速发展,安全评价对安全生产以及管理具有重要的作用.事实证明,相关方法的选用对于安全评价的顺利进行十分重要,对于评价结果的客观性以及准确度都能够产生重要影响.在传统背景下,计算机网络安全评价方式存在较多问题,使得其对评价结果产生不利影响.为了应对这些方面的问题,将神经网络引入其安全评价之中,对于工作效率的提升具有重要的现实意义.     

计算机网络教学中教学模式的研究

在计算机专业的所有课程中,计算机网络教学是一门很重要的课程,它为学生在今后的工作学习中所用到的知识打下了坚实的基础,本文首先从目前的计算机网络教学存在的问题入手,然后重点讨论了计算机网络教学模式,给广大的计算机教室提供一些可行的建议.     

在线社会网络的网络结构和信息传播研究综述

随着在线社会网络的大规模应用和普及, 亟需对在线社会网络进行深入研究分析。在线社会网络的网络结构和信息传播研究是该领域中的两大研究热点和关键问题。网络结构包括关键节点、网络关系以及社团的挖掘, 通过对网络结构的分析可以掌握被分析网络中存在的社团、节点之间的关系以及关键节点等, 而这种分析对于国家及时掌握在线社会网络的舆情、公司广告在网络上投放策略的制定都具有极大的帮助。对在线社会网络信息传播的研究主要有信息传播动力模型、信息传播源和路径的发现与描绘、信息传播的最大化和最小化等, 通过对在线社会网络信息传播的研究, 人们可以对在线社会网络信息传播的影响进行预测和干预, 从而可以将信息传播的影响按照有利的方向引导。综述了在线社会网络的网络结构和信息传播的研究现状, 并对这两方面的主要研究方法及技术的优势和不足以及适用场合进行了对比分析。     

神经网络结构动态优化设计的分析与展望

阐述了神经网络结构设计对神经网络性能的影响. 介绍了动态结构神经网络, 尤其是增长型和修剪型神经网络研究的发展过程, 分析了动态设计方法研究在计算能力、学习理论和网络的稳定性等方面取得的成果. 最后对神经网络动态设计的研究进行总结, 给出了神经网络结构动态设计研究的发展趋势.     

Towards the fast and robust optimal design of wireless body area networks

Wireless body area networks are wireless sensor networks whose adoption has recently emerged and spread in important healthcare applications, such as the remote monitoring of health conditions of patients. A major issue associated with the deployment of such networks is represented by energy consumption: in general, the batteries of the sensors cannot be easily replaced and recharged, so containing the usage of energy by a rational design of the network and of the routing is crucial. Another issue is represented by traffic uncertainty: body sensors may produce data at a variable rate that is not exactly known in advance, for example because the generation of data is event-driven. Neglecting traffic uncertainty may lead to wrong design and routing decisions, which may compromise the functionality of the network and have very bad effects on the health of the patients. In order to address these issues, in this work we propose the first robust optimization model for jointly optimizing the topology and the routing in body area networks under traffic uncertainty. Since the problem may result challenging even for a state-of-the-art optimization solver, we propose an original optimization algorithm that exploits suitable linear relaxations to guide a randomized fixing of the variables, supported by an exact large variable neighborhood search. Experiments on realistic instances indicate that our algorithm performs better than a state-of-the-art solver, fast producing solutions associated with improved optimality gaps.