高氧化态（Ⅱ─Ⅳ）三核金属簇合物构型的人工神经网络判别方法

本文运用一典型的人工神经网络模型─“反向传播”模型，对高氧化态（Ⅱ─Ⅳ）三核金属簇合物的构型分布进行了分析，得到了较好的分类、预报结果为化合物结构分析提供了新的工具。     

Windows系统中两种动态交换数据的方法

本文介绍了Ｗｉｎｄｏｗｓ环境下基于消息的ＤＤＥ和基于动态链接库的ＤＤＥＭＬ的区别，并详细叙述了如何使用ＤＤＥＭＬ编制Ｗｉｎｄｏｗｓ应用程序。     

Statistical synchronization among participants in real-time multimedia conferencing

In this paper, an algorithm to determine the set of packets generated continuously and periodically from different participants that are arriving at a node either for mixing at the master of a conference, or for simply playing back at a regular participant of a conference, is proposed. The essence of the algorithm is to estimate the expected packet arrival time (or reference time) for each participant. With the reference time at hand, the maximum jitter and the optimum waiting time for a mixer to wait packets from all participants can be determined. An enhancement to improve synchronization which deals with the estimation of the time offsets between the individual periods of the sources and the period of the receiver is also presented. The error of the proposed algorithm is enumerated by the Chernoff bound and demonstrated by simulation and is shown to be acceptable in practical application. The algorithm can also be employed when traffic sources operate with different periods.     

A formal description of open distributed processing (ODP) trading based on guidelines for the definition of managed objects (GDMO)

New requirements of growing computer networks and information systems have an influence on extended client/server models with increased functionality. This forms the basis for service management in distributed systems which is realized by a service trading concept. This paper studies the requirements derived from the Open Distributed Processing (ODP) Reference Model in order to consider an open service market. Furthermore, it examines management possibilities for describing the service trading scenario. Because of similar architectures and properties ODP services, service offers, types, exporters and traders are mapped onto management components and modeled as managed objects. Therefore, the Guidelines for the Definition of Managed Objects (GDMO) are used. The final concept allows a precise and unambiguous study of the service trading scenario and provides means for exporting and importing of service offers in a distributed environment.     

COATES GRAPH APPROACH FOR GENERATING SYMBOLIC NETWORK FUNCTION

In this paper, symbolic code matrix ,constant matrix and count matrix are defined .The first twomatrices are used to describe the elemental expression of augmented matrix and the nede admittance equa-tion is thus obtained. The third matrix is used to obtain the incoming degree matrix, and according to thematrix all the 1- factors of the Coates graph are given. By using the data code, the determinant is expandedand the same items in the expansion are merged. Thus the symbolic network function in which no term can-cellation occurs is generated.     

Network topology and the theory of rubber elasticity

The earliest investigations on rubber elasticity, commencing in the 19th century, were necessarily limited to phenomenological interpretations. The realisation that polymers consist of very long molecular chains. commencing c. 1930, gave impetus to the molecular theory of rubber elasticity (1932-). according to which the high deformability of an elastomer, and the elastic force generated by deformation, stem from the configurations accessible to long molecular chains. Theories of rubber elasticity put forward from 1934-1946 relied on the assumption that the junctions of the rubber network undergo displacements that are affine in macroscopic strain. The theory of James and Guth (1947) dispensed with this premise, and demonstrated instead that the mean positions of the junctions of a ‘phantom’ network consisting of Gaussian chains devoid of material properties are affine in the strain. The vital significance of the distinction between the actual distribution of chain vectors in a network and their distribution if the junctions would be fixed at their mean positions went unnoticed for nearly 30 years. Experimental investigations, commencing with the incisive work of Gee in 1946. revealed large departures from the relationship of stress to strain predicted by the theories cited. This discrepancy prompted extensive studies, theoretical and experimental, during succeeding years. Inquiry into the fundamentals of polymer networks, formed for example by interlinking very long polymer molecules, exposed the need to take account of network imperfections, typically consisting of chains attached at only one end to a network junction. Various means were advocated to make corrections for these imperfections. The cycle rank ζ of the network has been shown (1976) to be the fundamental measure of its connectivity, regardless of the junction functionality and pattern of imperfections. Often overlooked is the copious interpenetration of the chains comprising typical elastomeric networks. Theories that attempt to represent such networks on a lattice are incompatible with this universal feature. Moreover, the dense interpenetration of chains may limit the ability of junctions in real networks to accommodate the fluctuations envisaged in the theory of phantom networks. It was suggested in 1975 that departures from the form predicted for the elastic equation of state are due to constraints on the fluctuations of junctions whose effect diminishes with deformation and with dilation. Formulation of a self-consistent theory based on this suggestion required recognition of the non-affine connection between the chain vector distribution function and the macroscopic strain in a real network, which may partake of characteristics of a phantom network in some degree. Implementation of the idea was achieved through postulation of domains of constraint affecting the equilibrium distribution of fluctuations of network junctions from their mean positions. This led in due course to a theory that accounts for the relationship of stress to strain virtually throughout the ranges of strain accessible to measurement. The theory establishes connections between structure and elastic properties. This is achieved with utmost frugality in arbitrary parameters.     

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.     

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

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

论计算机通信网络的开放性

本文从开放性原理出发，描述了计算机通信网络系统开放性体系的思想及其实现技术。     

媒体网关控制技术及其在Alcatel 5020 MGC中的应用

分析了目前公用交换电话网(PSTN)中存在的问题和下一代网络(NGN)的优越性,分析了NGN中的关键技术媒体网关控制技术,探讨了媒体网关控制技术在Alcatel5020MGC中的实际应用,讨论了Alcatel5020MGC的软硬件系统架构。最后强调了在PSTN向NGN发展过程中基于演进产品的方法的重要性。