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.     

Measurement and prediction of pressure drop in two-phase flow

Experimental data for air–water two-phase co-current flow in two different pipe diameters were used to test the prediction of pressure drop by a number of existing theories and correlations. Several models are shown to be useful for prediction, particularly with the stratified regimes which have proved difficult to handle in the past. The model suggested by Olujic proved to be of particular value.     

Rectilinear steiner tree heuristics and minimum spanning tree algorithms using geographic nearest neighbors

We study the application of the geographic nearest neighbor approach to two problems. The first problem is the construction of an approximately minimum length rectilinear Steiner tree for a set ofn points in the plane. For this problem, we introduce a variation of a subgraph of sizeO(n) used by YaO [31] for constructing minimum spanning trees. Using this subgraph, we improve the running times of the heuristics discussed by Bern [6] fromO(n ² log n) toO(n log² n). The second problem is the construction of a rectilinear minimum spanning tree for a set ofn noncrossing line segments in the plane. We present an optimalO(n logn) algorithm for this problem. The rectilinear minimum spanning tree for a set of points can thus be computed optimally without using the Voronoi diagram. This algorithm can also be extended to obtain a rectilinear minimum spanning tree for a set of nonintersecting simple polygons.The results in this paper are a part of Y. C. Yee's Ph.D. thesis done at SUNY at Albany. He was supported in part by NSF Grants IRI-8703430 and CCR-8805782. S. S. Ravi was supported in part by NSF Grants DCI-86-03318 and CCR-89-05296.     

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

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

浅谈程序设计中一题多解的教学方法

中等职业学校一般开设VB、VC及数据库等涉及程序设计的计算机课程。本文拟就程序设计中一题多解的教学方法进行探讨。     

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.     

Prediction of Final Product Properties After Cocurrent Spray Drying

The effect of drying and atomization conditions on the physical properties of powders for agglomerate-like materials and skin-forming material are studied in this article. A neural model is used for powder bulk and tapped density predictions.     

Validation of a Method of Determination of Apparent Diffusivity Versus Composition in Solids

A method is presented for computing the values of apparent diffusivity in solids with respect to the concentration of the diffusing substance (water or sodium chloride). This method does not require any assumption upon the mathematical relationship between diffusivity and concentration. It can be applied to experimental measurements of local concentration versus position within the solid (profiles) with relatively few measurements (circa 10) and a mathematical smoothing of the experimental data by using an artificial neural network model. The method was first validated on simulated data obtained by using a constant diffusivity value and on experimental profiles when the relation between diffusivity and concentration was given. It was then applied to original experimental moisture profiles obtained by putting gelatin gels with different initial moisture contents into contact for up to 14 days. The method was also successfully applied to five sets of experimental moisture and sodium chloride profiles taken from the literature and obtained from different food products. Apparent diffusivities calculated by our method were found in agreement with those obtained by authors using different numerical methods to compute the diffusivity values.