On the Existence of Solutions to Vector Quasivariational Inequalities and Quasicomplementarity Problems with Applications Break to Traffic Network Equilibria

For vector quasivariational inequalities involving multifunctions in topological vector spaces, an existence result is obtained without a monotonicity assumption and with a convergence assumption weaker than semicontinuity. A new type of quasivariational inequality is proposed. Applications to quasicomplementarity problems and traffic network equilibria are considered. In particular, definitions of weak and strong Wardrop equilibria are introduced for the case of multivalued cost functions.     

The Downs-Thomson Paradox: Existence, Uniqueness and Stability of User Equilibria

Consider a network where two routes are available for users wishing to travel from a source to a destination. On one route (which could be viewed as private transport) service slows as traffic increases. On the other (which could be viewed as public transport) the service frequency increases with demand. The Downs-Thomson paradox occurs when improvements in service produce an overall decline in performance as user equilibria adjust. Using the model proposed by Calvert [10], with a ⋅|M|1 queue corresponding to the private transport route, and a bulk-service infinite server queue modelling the public transport route, we give a complete analysis of this system in the setting of probabilistic routing. We obtain the user equilibria (which are not always unique), and determine their stability.AMS subject classification: 60K30, 90B15, 90B20, 91A10, 91A13This revised version was published online in June 2005 with corrected coverdate     

Parallel Algorithm for Unconstrained Optimization Based on Decomposition Techniques

We present a numerical implementation of the parallel gradient distribution (PGD) method for the solution of large-scale unconstrained optimization problems. The proposed parallel algorithm is characterized by a parallel phase which exploits the portions of the gradient of the objective function assigned to each processor; then, a coordination phase follows which, by a synchronous interaction scheme, optimizes over the partial results obtained by the parallel phase. The parallel and coordination phases are implemented using a quasi-Newton limited-memory BFGS approach. The computational experiments, carried out on a network of UNIX workstations by using the parallel software tool PVM, show that parallelization efficiency was problem dependent and ranged between 0.15 and 8.75. For the 150 problems solved by PGD on more than one processor, 85 cases had parallelization efficiency below 1, while 65 cases had a parallelization efficiency above 1.     

神经网络法计算镉（Ⅱ）,羟基及碳酸根三元体系的形态分布

采用前馈线笥网络ＢＰ算法，计算了Ｃｄ６２＋－ＯＨ＾－ＣＯ＾２－３三元体系的累积稳定常数。用Ｈｏｐｆｉｅｌｄ反馈网络研究了体系中络合物的形态分布。溶液中溶解的ＣＯ２对ｌｇβ１的计算结果有重要影响，对ｌｇβ２，ｌｇβ３，ｌｇβ４的结果影响不大。     

Max—min神经网络的一种有效学习算法

本文在Ａ．Ｂｌａｎｃｏ等人的算法的基础上，提出了ｍａｘ－ｍｉｎ神经网络的一种改进了的反馈学习算法，严格证明了该算法的迭代收敛性，理论分析及实例计算结果均表明，本文算法具有算法简单，收敛速度快，输出误差小等显著特点。     

Hybrid free radical/cationic frontal photopolymerizations

The irradiation of hybrid photopolymer systems consisting of a free radically polymerizable multifunctional acrylate monomer and a cationically polymerizable epoxide or oxetane monomer was conducted under conditions where only the free radical polymerization takes place. This results in the formation of a free‐standing polyacrylate network film containing quiescent oxonium ions along with the unreacted cyclic ether monomer. The subsequent application of a point source of heat to the film ignites a cationic ring‐opening frontal polymerization that emanates from that site and propagates to all portions of the irradiated sample. This article examines the impact of various molecular structural and experimental parameters on these novel hybrid frontal polymerizations that produce interpenetrating network polymers. © 2007 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 45: 4331–4340, 2007     

Identifying sets of key players in a social network

A procedure is described for finding sets of key players in a social network. A key assumption is that the optimal selection of key players depends on what they are needed for. Accordingly, two generic goals are articulated, called KPP-POS and KPP-NEG. KPP-POS is defined as the identification of key players for the purpose of optimally diffusing something through the network by using the key players as seeds. KPP-NEG is defined as the identification of key players for the purpose of disrupting or fragmenting the network by removing the key nodes. It is found that off-the-shelf centrality measures are not optimal for solving either generic problem, and therefore new measures are presented. Stephen P. Borgatti is Professor of Organization Studies at the Carroll School of Management, Boston College. His research is focused on social networks, social cognition and knowledge management. He is also interested in the application of social network analysis to the solution of managerial problems.     

具有时滞的细胞神经网络的全局指数稳定性

利用Liapunov函数方法,结合积分不等式技巧,分析了时滞细胞神经网络的平衡点存在的唯一性和全局指数稳定性,保证时滞细胞神经网络全局指数稳定的一个新的充分判据被得到.所得判据比已有文献具有更少的限制,为实际应用提供了方便.     

二维光电位置敏感器件的非线性修正

根据二维光电位置敏感器件 (PSD)的工作原理 ,分析了影响PSD线性度的主要因素 ,提出了一种用神经网络对PSD进行非线性修正的方法。以PSD的输入输出数据对作为样本训练的神经网络 ,利用神经网络所具有地能够以任意精度逼近非线性函数的能力 ,实现PSD的输出与实际光点位置之间的映射 ,在神经网络的输出端得到线性响应。该方法的优点是不需要很大的数据存储量即可得到很好的修正效果。结果表明 ,修正后的PSD能在较宽的位置范围内输出高线性度的信号