软交换技术的发展及其应用

软交换是下一代网络NGN的核心技术，本文从软交换的概念入手，介绍了软交换的基本功能及其优点．软交换的网络系统结构、软交换的对外接口等内容，并探讨了软交换技术的应用。     

RanGen: A Random Network Generator for Activity-on-the-Node Networks

In this paper, we describe RanGen, a random network generator for generating activity-on-the-node networks and accompanying data for different classes of project scheduling problems. The objective is to construct random networks which satisfy preset values of the parameters used to control the hardness of a problem instance. Both parameters which are related to the network topology and resource-related parameters are implemented. The network generator meets the shortcomings of former network generators since it employs a wide range of different parameters which have been shown to serve as possible predictors of the hardness of different project scheduling problems. Some of them have been implemented in former network generators while others have not.     

基于网络环境的计算机资料室工作

随着信息技术的迅速发展,基于网络的信息资源共享已成为信息化社会的基本特征。数字化图书馆和电子期刊网的出现,正在改变着人们的阅读习惯,丰富的信息资源和跨时空的浏览方式彻底颠覆了传统的图书馆、资料室的服务模式。同时,数字化图书馆也给资料室管理模式创新带来了新的契机。分析了院系资料室面临的挑战与机遇,探讨了新形势下计算机资料室工作,提出了利用信息技术,改革服务方式,拓展服务内容,提高服务水平,提供有特色的专业服务。     

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.     

硫酸钙氨法制取硫酸钾新工艺的实验研究

利用K2 +2 ,Ca2 +/ /SO2 -4 ,Cl2 -2 ,NH3—H2 O混合体系相图作为工艺指导 ,进行硫酸钙制取硫酸钾工艺的相图研究和分析 ,确定实验优选因素及水平并进行正交实验 ,根据实验结果进行极差分析 ,得出新的结论。合适的工艺条件为 :氨浓度为 40 % ,配料比n( 2KCl) :n(CaSO4 ·2H2 O)为 1:1,反应温度为 5℃ ,反应时间为 1h。     

平差法预计矿区导线网精度

分析了矿区导线网精度预计经典方法存在的问题 ,推导出严密平差法精度预计的数学模型 ,并编制机算程序。     

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.     

基于ANN的声目标识别系统及其DSP实时实现

介绍了一种基于人工神经网络(ANN)的声目标识别系统,概述了用MATLAB专用工具箱对神经网络权值进行训练及仿真的过程,叙述了ANN目标识别系统的数字信号处理器(DSP)实时实现过程,并着重分析定点实现过程中程序变量的定标、非线性运算的实现、溢出的处理等关键步骤.对不同字长的识别结果进行比较表明,基于定点实时实现的系统数据保持很高的精度,可以得到与浮点处理相同的识别率.     

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

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

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)