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.     

A Topological Implementation for Motion Planning of a Robotic Arm

An efficient path planning algorithm based on topologic method is presented in this paper.The collision free path planning for three-joint robotic arm consists of three parts:partition of C-space,construction of CN and search for a path in CN.We mainly solved the problems of partitioning the C-space and undging the connectivity between connected blocks,etc.For the motion planning of a robotic arm with a gripper,we developed the concepts of global planning and local planning,and discussed the basic factors for constructing the planning system.In the paper,some evaluation and analysis of the complexity and reliability of the algorithm are given,together with some ideas to improve the efficiency and increase the reliability.At last,some experimental results are pesented to show the efficency and accuracy of the algorithm.     

井场信息系统建设体系结构

对井场钻井数据实时远程传输的研究和实践进行了总结,从数据远传作用、数据远传通信方式、数据通信网络体系结构、未来发展等几个方面对井场数据远程传输进行了探讨。     

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.     

Design and Implementation of a Flexible Manufacturing Control System Using Neural Network

Design and implementation of a sequential controller based on the concept of artificial neural networks for a flexible manufacturing system are presented. The recurrent neural network (RNN) type is used for such a purpose. Contrary to the programmable controller, an RNN-based sequential controller is based on a definite mathematical model rather than depending on experience and trial and error techniques. The proposed controller is also more flexible because it is not limited by the restrictions of the finite state automata theory. Adequate guidelines of how to construct an RNN-based sequential controller are presented. These guidelines are applied to different case studies. The proposed controller is tested by simulations and real-time experiments. These tests prove the successfulness of the proposed controller performances. Theoretical as well as experimental results are presented and discussed indicating that the proposed design procedure using Elman's RNN can be effective in designing a sequential controller for event-based type manufacturing systems. In addition, the simulation results assure the effectiveness of the proposed controller to outperform the effect of noisy inputs.     

网络安全中的防火墙技术

介绍了防火墙的原理、分类及其应用     

网络展开图与符号网络分析

采用封闭网络模型,按照电路元件参数,采用开路、短路和着色运算,将电路图逐层分解,得到网络展开图.给出网络展开图的概念和运算规则,指出网络展开图中从根到末稍每个路径的值就是网络行列式展开式中的一个有效项,从而由网络展开图得到符号网络函数.该方法直接对电路图进行运算,不需要建立任何形式的电路方程和行列式,适用于一般的有源电路,而且能生成各种类型的网络函数.     

宽带无源光网络(BPON)关键技术的发展与研究

宽带无源光网络（BPON）是实现宽带、多业务接入的理想物理平台，本文介绍了BPON网络的发展，重点讨论了将ATM技术和PON技术相结合的APON系统及其升级系统SuperPON的基本结构和关键技术，对最近兴起的将以太技术和PON技术相结合的EPON系统的基本概念和工作原理也进行了阐述，并对未来BPON技术的发展进行了展望。     

Bandwidth Adaptation Algorithms for Adaptive Multimedia Services in Mobile Cellular Networks

The fluctuation of available link bandwidth in mobilecellular networks motivates the study of adaptive multimediaservices, where the bandwidth of an ongoing multimedia call can bedynamically adjusted. We analyze the diverse objectives of theadaptive multimedia framework and propose two bandwidth adaptationalgorithms (BAAs) that can satisfy these objectives. The firstalgorithm, BAA-RA, takes into consideration revenue and``anti-adaptation' where anti-adaptation means that a user feelsuncomfortable whenever the bandwidth of the user's call ischanged. This algorithm achieves near-optimal total revenue withmuch less complexity compared to an optimal BAA. The secondalgorithm, BAA-RF, considers revenue and fairness, and aims at themaximum revenue generation while satisfying the fairnessconstraint defined herein. Comprehensive simulation experimentsshow that the difference of the total revenue of BAA-RA and thatof an optimal BAA is negligible. Also, numerical results revealthat there is a conflicting relationship between anti-adaptationand fairness.