浅谈21世纪新建电厂热控系统的规划设计

为了适应电力工业发展和国家新兴产业政策的需要,本文扼要介绍了21世纪新建电厂在热控系统的规划设计方面应做的改进和注意的问题.并在此基础上阐述了一些个人的观点和看法供管理、设计和技术人员参考.     

神经网络用于三元分子混合物密度与粘度的预测

以二元系实验为基础，利用反向转播算法训练神经网络，构造混合物组成，温度等与物性关系的模型，用于对４个三元混合物体系（１）邻二甲苯－间二甲苯－对二甲苯；（２）四氯化碳－环己烷－２－丙醇；（３）甲醇－丙酮－水；（４）水－甲醇－乙二醇的密度和５个三元混合物体系（１）信甲苯－间二甲苯－对二甲苯；（２）四氯化碳－环己烷－２－丙醇；（３）氯仿－２－丙醇－２－丁醇；（４）甲醇－丙酮－水；（５）乙醇－甲醇－水的粘     

单片机与微机组成的树型网络远程多机通信

本文简介当前集散控制中的几种常用通信方法，并就此进行分析，然后提出一种实用性强，结构较简单，通信可靠，功能完备，使用十分灵活方便的任意两机间可通信系统     

江苏省本地电话网结构与发展

分片汇接的网状网结构是江苏省本地电话网的基本框架,而汇接局和连接汇接局的传输系统则是网路规划与通信建设的重点。     

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

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

Distributed memory systems for simulating artificial neural networks

In executing tasks involving intelligent information processing, the human brain performs better than the digital computer. The human brain derives its power from a large number [O(10¹¹)] of neurons which are interconnected by a dense interconnection network [O(10⁵) connections per neuron]. Artificial neural network (ANN) paradigms adopt the structure of the brain to try to emulate the intelligent information processing methods of the brain. ANN techniques are being employed to solve problems in areas such as pattern recognition, and robotic processing. Simulation of ANNs involves implementation of large number of neurons and a massive interconnection network. In this paper, we discuss various simulation models of ANNs and their implementation on distributed memory systems. Our investigations reveal that communication-efficient networks of distributed memory systems perform better than other topologies in implementing ANNs.     

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

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

GSM与WCDMA无线网络规划比较

WCDMA与GSM在空中接口上存在较大差异,WCDMA基于码分多址技术,GSM基于时分多址技术。GSM主要处理语音和低速数据,而WCDMA引入了多种速率的数据业务,根据业务的QoS进行资源控制和分配,因此在无线网络规划方法上,WCDMA与GSM存在较大差异。文章从容量规划、覆盖规划、蜂窝布局、规划流程、网络评估等方面对WCDMA与GSM的无线网络规划进行了比较和分析。     

A pattern recognition-based approach for phylogenetic network construction with constrained recombination

The tree representation of evolutionary relationship oversimplifies the view of the process of evolution as it cannot take into account the events such as horizontal gene transfer, hybridization, homoplasy and genetic recombination. Several algorithms exist for constructing phylogenetic networks which result from events such as horizontal gene transfer, hybridization and homoplasy. Very little work has been published on the algorithmic detail of phylogenetic networks with constrained recombination. The problem of minimizing the number of recombinations in a phylogenetic network, constructed using binary DNA sequences, is NP-hard. In this paper, we propose a pattern recognition-based O(n²) time approach for constructing the phylogenetic network, where n is the number of nodes or sequences in the input data. The network is constructed with the restriction that no two cycles in the network share a common node.