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

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

实用神经网络的生物模拟器 待续

本文介绍一种能模拟单个神经元、触突以及系统的模拟器Ｓｉｍｕｌａｔｏｒ。用它模拟在生物界所熟知的一种无脊椎软体类似海参的食肉类动作Ｐｌｅｕｒｏ－ｂｒａｎｃｈｅａ。它的各种形为如吞食食物，遇敌退缩等用Ｆｏｒｔｒａｎ７７版本编程并在Ｓｕｎ３／５０工作站上进行模拟获得了满意结果。     

BP算法的改进及用模拟电路实现的神经网络分类器

基于用模拟电路实现神经网络分类器的目的，对多层静态前馈神经网络的ＢＰ算法做了改进，采用线性限幅函数代替Ｓｉｇｍｏｉｄ函数作为神经元的激活函数，给出了改进的ＢＰ算法。对该算法性能的实验研究表明：这种改进算法不但方便了用线性模拟集成运算放大电路实现神经网络，而且具有学习速度快，映射能力强等优点。根据本文算法设计的神经网络分类器，无论是计算机仿真，还是模拟电路实现，都得到了比较高的识别率。     

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.     

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

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

Mixed Mode VLSI Implementation of a Neural Associative Memory

A mixed mode digital/analog special purpose VLSI hardware implementation of an associative memory with neural architecture is presented. The memory concept is based on a matrix architecture with binary storage elements holding the connection weights. To enhance the processing speed analog circuit techniques are applied to implement the algorithm for the association. To keep the memory density as high as possible two design strategies are considered. First, the number of transistors per storage element is kept to a minimum. In this paper a circuit technique that uses a single 6-transistor cell for weight storage and analog signal processing is proposed. Second, the device precision has been chosen to a moderate level to save area as much as possible. Since device mismatch limits the performance of analog circuits, the impact of device precision on the circuit performance is explicitly discussed. It is shown that the device precision limits the number of rows activated in parallel. Since the input vector as well as the output vector are considered to be sparsely coded it is concluded, that even for large matrices the proposed circuit technique is appropriate and ultra large scale integration with a large number of connection weights is feasible.     

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.