Average consensus in networks of dynamic agents with switching topologies and multiple time-varying delays

In this paper, we discuss average consensus problem in undirected networks of dynamic agents with fixed and switching topologies as well as multiple time-varying communication delays. By employing a linear matrix inequality method, we prove that all the nodes in the network achieve average consensus asymptotically for appropriate communication delays if the network topology is connected. Particularly, several feasible linear matrix inequalities are established to determine the maximal allowable upper bound of time-varying communication delays. Numerical examples are given to demonstrate the effectiveness and the sharpness of the theoretical results.     

A review on queueing network models with finite capacity queues for software architectures performance prediction

A review is carried out on how queueing network models with blocking have been applied so far into the performance evaluation and prediction of Software Architectures (SA). Queueing network models with finite capacity queues and blocking have recently been introduced and applied as more realistic models of systems with finite capacity resources and population constraints. Queueing network models have been often adopted as models for the evaluation of software performance. Starting from our own experience, we observe the need of a more accurate definition of the performance models of SA to capture some features of the communication systems. We consider queueing networks with finite capacity and blocking after service (BAS) to represent some synchronization constraints that cannot be easily modeled with queueing network models with infinite capacity queues. We investigate the use of queueing networks with blocking as performance models of SA with concurrent components and synchronous communication. Queueing theoretic analysis is used to solve the queueing network model and study the synchronous communication and performance of concurrent software components. Our experience is supported by other approaches that also propose the use of queueing networks with blocking. Directions for future research work in the field are included.     

关于本地传输网网络优化的探讨

根据长期工作经验,对现有网络存在的问题进行分析,提出对本地传输网网络优化的有关建议。     

Individual and structural origins of friendship and social position among professionals.

Friendship affects individual and organizational well-being through direct relations, social positions, and complex network structures. In this study, the authors use longitudinal data from 2 groups of master's of business administration students to increase understanding of how friendship networks develop. The authors propose and test a dynamic model in which attribute similarity facilitates dyadic friendship ties, as well as similar network centrality and social position; early friendship increases later similarity in structural position and centrality; and early structural similarity enhances the likelihood of future friendship. Findings largely supported the model, demonstrating how homophily and early social contacts can jointly shape maturing friendship networks. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

多级网络多处理机系统的性能评估

本文建立了多级网络(δ-网)多处理机系统的马尔柯夫模型,为系统结构参数和任务粒度的选择提供了依据。文中分析了处理机数目、网络结构参数和任务粒度对系统性能的影响,并对模型计算结果和仿真结果作了比较。     

神经网络分类器的快速构造算法

使用ＢＰ算法训练多层网络的速度很慢而且事先难于确定隐节点和隐层的适当数目。本文提出一个有效的算法，先构造决策树，然后将构造的决策树转换为神经网。文中使用一个全局准则函数控制决策树的增长，它较好地匹配了树的复杂性和训练样本量及错分率界。实验结果，本文的算法比用ＢＰ算法训练多层网络要快，而其分类精度不低于用ＢＰ算法训练的多层神经网。     

智能工作站主机的MMPIS实验模型研究──一个全互连式结构MMPIS硬件环境的设计与实现

本文介绍中日国际合作开发研究的Ａ１型智能网（Ａ１型ＩＮ）智能工作站（ＩＷ）主机的并行推理硬件结构的实验模型设计与实现，给出了一种并行推理硬件支持环境实现方案和该方案在实现中若干问题的解决方法。     

小型水电站联网改造应注意的几个问题

针对铜鼓县小水电站联网时存在的问题及其不利影响进行了分析，井提出了改进途径，指出小水电站的联网改造应立足安全，争取效益。     

智能网的计算机技术

文章剖析了应用于智能网的计算机技术，阐述智能网和计算机技术的关系。     

ATM网络的可用比特率业务

本文介绍了可用比特率业务的业务特点，速率控制机制以及该业务存在的问题。