低温高速离心泵的研制与应用

阐述了适合于输送低温介质的高速离心泵的水力设计和结构设计方法，结构上采有长，中，短叶片相间的复合叶轮及双密封结构，理论上采用以效率为目标函数的优化水力设计方法，保证了低温高速离心泵具有很好的工人可靠性和优越的性能指标。     

一种实现最佳用户检测的非线性优化神经网络

本文提出并讨论了实现码分多址（CDMA）系统上最佳多用户检测（MUD）的一种神经网络方法。该方法通过将最佳多用户检测视为非线性优化组合问题，利用神经网络能有效求解非线性优化问题的优势，导出了一种非线性优化神经网络来实现最佳多用户检测，理论分析和计算机模拟表明，所提出的神经网络具有可实时应用的动态性能和较传统方法优越得多的误码率性能和抗多址干扰的性能。     

给水管网计算中的数据转换方法

在给水管网计算中,通过建立环-管段矩阵、环-节点矩阵以及输入节点流量、节点坐标等少量数据,通过计算和数据转换,便可求得经济管径、管段设计流量、节点水压值、水厂供水量、管网造价、年费用折算值等。采用该方法进行管网计算,可以减少40%～70%的计算时间。     

Development of a recurrent Sigma-Pi neural network rainfall forecasting system in Hong Kong

At the moment, weather forecasting is still an art — the experience and intuition of forecasters play a significant role in determining the quality of forecasting. This paper describes the development of a new approach to rainfall forecasting using neural networks. It deals with the extraction of information from radar images and an evaluation of past rain gauge records to provide shortterm rainfall forecasting. All of the meteorological data were provided by the Royal Observatory of Hong Kong (ROHK). Preprocessing procedures were essential for this neural network rainfall forecasting. The forecast of the rainfall was performed every half an hour so that a storm warning signal can be delivered to the public in advance. The network architecture is based on a recurrent Sigma-Pi network. The results are very promising, and this neural-based rainfall forecasting system is capable of providing a rain storm warning signal to the Hong Kong public one hour ahead.     

光纤通信在市内接入网的应用

先说明市内接入网的单位用户和住家用户两大类使用通信和电视、交互型和分配型业务的要求不相同，相应地对光纤传输的应用须作不同的考虑，文中认为；光纤从市内交换局直连办公大楼是合乎现实需要的，而对于居民住家，宜选用光纤连至路边或光纤与同轴结合和适当利用无源光网络等方案，俟将来时机成熟才实行光纤连至每一家，文末有概括总结，说明接入网不同于长途网，接入网的光纤系统可以使用常规单模光纤，工作于波长1．3μm，而光放大器和波分多路系统不是普遍需要，但光电子集成在光端机中是必要的。     

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

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

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.     

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.