Self-stabilization with r-operators

This paper describes a parameterized distributed algorithm applicable to any directed graph topology. The function parameter of our algorithm is instantiated to produce distributed algorithms for both fundamental and high level applications, such as shortest path calculus and depth-first-search tree construction. Due to fault resilience properties of our algorithm, the resulting protocols are self-stabilizing at no additional cost. Self-stabilizing protocols can resist transient failures and guarantee system recovery in a finite time. Since the condition on the function parameter (being a strictly idempotent r-operator) permits a broad range of applications to be implemented, the solution presented in our paper can be useful for a large class of distributed systems. Received: August 1999 / Accepted: January 2001     

分布式物料管理系统的开发

本文将分布式体系结构应用于某企业的物料管理系统中，对本系统的需求做了一定的分析，介绍了应用系统的结构、开发方法与实现，解决了该公司的实际问题，实现了对企业物料的入库、出库、维修、公司合同，付款等功能的管理，对国内现有企业的物料管理具有现实的指导意义。     

HLA仿真系统中Lookahead的分析与动态调整策略

在HLA仿真系统中，Lookahead是影响系统性能的重要参量，对Lookahead的管理也是实现邦元程序的重要内容。采用时间分段的方式重新定义HLA仿真系统中的Lookahead，很好地解决了仿真运行中时戳增量改变较大的问题。在此基础上提出的Lookahead动态调整算法考虑了邦元程序对要接收事件的经验值，可以有效提高系统运行性能，协助邦元程序设计。     

分散控制系统冗余性及其合理性分析

根据分散控制系统特点 ,从分散控制系统硬件、性能及功能三个方面分析了分散控制系统的冗余性配置及其合理性。     

分布式系统上异步算法的终止

本文论述了一种检测分布式系统上异步算法终止的有效方法．     

分布式防火墙技术研究

介绍了分布式防火墙的产生、体系结构、主要特点及存在的问题.     

用分布式防火墙构建网络屏障

本文介绍了分布式防火墙的结构,工作原理和实现策略.分析了分布式防火墙对各类问题的解决机理.最后作者指出了分布式防火墙存在的一些问题.     

VC下实现基于Modbus协议的DCS与远程I/O系统通信

本文在分析Modbus协议及其通信原理的基础上，结合工程实际，提出了一种在工业PC机上实现串行通信的方法，并在Visual C 6．0环境下开发了通信的应用程序，实现了基于Modbus协议的DCS与远程I／O系统通信。     

A comparative study of some concurrency control algorithms for cluster-based communication networks

This paper presents a comparative study of some concurrency control algorithms for distributed databases of computer clusters which emphasize high availability and high performance requirements. For this purpose, we have analyzed some concurrency control algorithms which are used in commercial DBMSs, such as the pessimistic locking algorithm as it verifies transaction conflicts early in their execution phase, and the optimistic algorithm which investigates the presence of conflicts after the execution phase. A new algorithm is proposed and implemented by a simulation program. The three algorithms were tested using different configurations. Simulation results showed that the locking algorithm performed better than the optimistic method in presence of conflicts between transactions, while the optimistic algorithm provided better results in the absence of conflicts. Furthermore, in a distributed database with a certain probability of conflicts, the locking algorithm can be used to guarantee strong consistency and an acceptable level of performance. However, if this probability is negligible, the system performance can be improved by using the optimistic algorithm. The proposed algorithm offers improved performance in numerous cases. As a result, it can be used in a distributed database to guarantee a satisfactory level of performance in the presence of conflicts.