An MIP model to optimize a Colombian cash supply chain

Financial institutions operate a supply chain where only one product is moved across the network. Although the cash is kept in several nodes to service the demand of final customers, availability causes opportunity cost related with its investment options. When planning the inventory of cash that should be maintained across the network, transportation decisions are also expected to be made. Cash transportation has a high cost, associated with the high risk of theft. Increasing the inventory can reduce the need for transportation, but the opportunity cost can be very high. Moreover, the inventory is also related with the service level perceived for final customers; therefore because of low inventory some people are not able to make some transactions. The aim of this work is to find optimal decisions related with cash inventory and transportation across the network, trying to balance the cost of the service and the quality perceived for final users.     

基于动态BP网络的实验电炉温度控制系统

针对一类不允许出现超调的工艺参数,提出了采用动态BP网络对工艺参数进行控制,可以达到良好的效果。并以实验电炉为对象,用工控机对其炉温进行控制,结果表明,采用动态BP网络进行控制,可以无超调地无限逼近给定值,控制精度高,控制时间较短。因此可以认为,用动态BP网络对这一类工艺参数的控制是有效的。     

人工神经网络的发展及其应用

介绍人工神经网络的发展历史、主要模型、原理及其在各个领域中的应用。     

神经网络在煤矿安全决策支持系统中的研究及应用

主要研究人工神经网络在煤矿安全决策支持系统中的应用。将BP网络用于瓦斯突出,解决了瓦斯突出判别困难、难以建立数学模型的难题,为煤矿瓦斯突出研究找到了一种新的建模和预测方法。     

基于模糊神经网络的感应加热电源温度控制

通过对原有感应加热电源温度控制方法的分析，提出了一种适合于非线性系统基于模糊神经网络的温度控制方法，并介绍了该系统的组成及实现方法。     

The Advice and Influence Networks of Transformational Leaders.

Existing transformational leadership research has focused primarily on the behaviors of leaders and their effects on followers. The authors extended this research by examining the social networks of managers who exhibit transformational leadership behaviors. Their focus was on the network of relationships that managers develop and whether they hold key positions in the organization's informal social networks. In a field study using data from 39 managers and 130 nonmanagement employees of 6 organizations, the authors found that managers who score higher on transformational leadership tend to hold more central positions in organizational advice and influence networks. Furthermore, the direct reports of these leaders were also more central in informal organizational networks. These results illuminate one of the ways that managers who exhibit transformational leadership behaviors may exert influence in organizations. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

VPN构建的一种设计思想

Internet的发展对安全问题的要求越来越高，网络安全日益受到重视。文章以虚拟专用网为主要研究对象，结合软件工程的一些开发思想，对虚拟专用网的构建做出了理论上的设计。文章分析了虚拟专用网目前所涉及的主要几大模型，具体构建了一种可行的VPN设计方案，同时结合软件工程，对VPN构建给出自行设计的一种模块结构图，并对各个模块结构给出了具体解释，今后的工作在于将模块具体细化运用到实践中。     

基于CMAC的电液负载模拟器自学习控制

通过建立某飞行器舵机电液负载模拟器与操舵系统联动的数学模型，分析了电液负载模拟器的多余力产生原理。提出了采用结构不变性原理设计补偿环节的基于CMAC神经网络的控制结构和算法。通过对系统的动态仿真表明，该方法可有效地抑制多余力，明显改善电液负载模拟器的动态加载性能。     

Incorporating Ancestors' Influence in Genetic Algorithms

A new criterion of fitness evaluation for Genetic Algorithms is introduced where the fitness value of an individual is determined by considering its own fitness as well as those of its ancestors. Some guidelines for selecting the weighting coefficients for quantifying the importance to be given to the fitness of the individual and its ancestors are provided. This is done both heuristically and automatically under fixed and adaptive frameworks. The Schema Theorem corresponding to the proposed concept is derived. The effectiveness of this new methodology is demonstrated extensively on the problems of optimizing complex functions including a noisy one and selecting optimal neural network parameters.     

Least possible time paths in stochastic, time-varying networks

In this paper, two computationally efficient algorithms are presented for determining the least possible time paths for all origins to a single destination in networks where the arc weights are discrete random variables whose probability distribution functions vary with time. The first algorithm determines the least possible time path from each node for each departure time interval, the least possible travel time and a lower bound on the associated probability of the occurrence of this travel time. The second algorithm determines up to k least possible time paths, the associated travel times and the corresponding probabilities of occurrence of the travel times (or a lower bound on this probability). No such efficient algorithms for determining least time paths in stochastic, time-varying networks exist in the literature.