An algorithm for architecture partitioning in high-speed networks with bursty traffic

This paper analyzes the performance of a switching architecture. The performance measures include the elapsed time of packet transfer and the waiting time to begin transfer. The architecture is partitioned depending on the type of network used and the expected traffic in the network. Every partition has a switch with a buffer that can absorb surges of bursty traffic within the network partition. The buffer size depends on the type of the network and incoming traffic. The partition size depends on the network bandwidth, network traffic, packet size and buffer size. Examples of different networks are used to show the applications of the model. The results show that the elapsed time of packet switch transfer depends exponentially on the number of partitions in the network.     

Polymer networks based on α,ω-methacrylate-terminated poly(1,3-dioxolane)

α,ω-Methacrylate-terminated poly(1,3-dioxolane)s (polyDXL) were synthesized by cationic ring-opening polymerization of DXL in the presence of methylene-bis(oxyethylmethacrylate) as transfer agent. If the initiator concentration is small compared with the transfer agent concentration, the molecular weights of the polymers are governed by the ratio of the reacted monomer to the reacted transfer agent. The α,ω-methacrylate-terminated polyDXLs obtained undergo free radical polymerization with formation of polyacetal networks. The properties of the networks as function of the molecular weight of the corresponding prepolymers are reported.     

Efficient simulation of hierarchical stochastic activity network models

Stochastic extensions to Petri nets have gained widespread acceptance as a method for describing the dynamic behavior of discrete-event systems. Both simulation and analytic methods have been proposed to solve such models. This paper describes a set of efficient procedures for simulating models that are represented as stochastic activity networks (SANs, a variant of stochastic Petri nets) and composed SAN-based reward models (SBRMs). Composed SBRMs are a hierarchical representation for SANs, in which individual SAN models can be replicated and joined together with other models, in an iterative fashion. The procedures exploit the hierarchical structure and symmetries introduced by the replicate operation in a composed SBRM to reduce the cost of future event list management. The procedures have been implemented as part of a larger performance-dependability modeling package known asUltraSAN, and have been applied to real, large-scale applications. This work was supported in part by the Digital Equipment Corporation Faculty Program: Incentives for Excellence.     

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.     

人工神经网络预测热油环道启动压力

高含蜡原油管道停输后的再启动问题非常复杂。它涉及因素多，问题的非线性很强。而有足够多神经元的S型三层神经网络理论上可逼近任意有理函数。文章采用误差反向传播网络预测环道实验装置中的启动压力，得到了较好结果。     

Dynamical considerations of network properties

Elasticity is discussed as an aspect of viscoelasticity, which is described by the tube model. The effects of both crosslinks and entanglements contribute to this model and a discussion of how these effects can be quantified is given. At high enough concentration, entanglements ensure the existence of elastic effects even without crosslinks, and a theory is presented on how this dynamical phase change comes about.     

Neural Computation of the MoM Matrix Elements for Planar Configurations

In this paper a new artificial neural network (ANN) based model for the calculation of the method of moments (MoM) matrix elements is presented. Training sets that characterize the matrix elements are first constructed. These sets are then utilized to effectively train two radial basis function (RBF) neural networks to accurately estimate all the elements of the MoM matrix for any mesh used. The potential of the proposed approach is demonstrated in the case of a narrow microstrip line. The current distribution on the microstrip line produced by the trained RBF networks agrees very well with the exact distribution. In addition, the proposed ANN model is much faster than the conventional MoM procedure.     

Adaptive motion control using neural network approximations

In this paper, we present a new adaptive technique for tracking control of mechanical systems in the presence of friction and periodic disturbances. Radial Basis Functions (RBFs) are used to compensate for the effects of nonlinearly occurring parameters in the friction and periodic disturbance model. Theoretical analysis, such as stability and transient performance, is provided. Furthermore, the performance of the adaptive RBF controller and its non-adaptive counterpart are compared.     

Image processing using cellular neural networks based on multi-valued and universal binary neurons

Multi-valued and universal binary neurons (MVN and UBN) are the neural processing elements with the complex-valued weights and high functionality. It is possible to implement an arbitrary mapping described by partially defined multiple-valued function on the single MVN. An arbitrary mapping described by partially defined or fully defined Boolean function, which can be non-threshold, may be implemented on the single UBN. The quickly converging learning algorithms exist for both types of neurons. Such features of the MVN and UBN may be used for solving the different problems. One of the most successful applications of the MVN and UBN is their usage as basic neurons in the Cellular Neural Networks (CNN). It opens the new effective opportunities in nonlinear image filtering and its applications to noise reduction, edge detection and solving of the super resolution problem. A number of experimental results are presented to illustrate the performance of the proposed algorithms.An erratum to this article can be found at     

Network topology and the theory of rubber elasticity

The earliest investigations on rubber elasticity, commencing in the 19th century, were necessarily limited to phenomenological interpretations. The realisation that polymers consist of very long molecular chains. commencing c. 1930, gave impetus to the molecular theory of rubber elasticity (1932-). according to which the high deformability of an elastomer, and the elastic force generated by deformation, stem from the configurations accessible to long molecular chains. Theories of rubber elasticity put forward from 1934-1946 relied on the assumption that the junctions of the rubber network undergo displacements that are affine in macroscopic strain. The theory of James and Guth (1947) dispensed with this premise, and demonstrated instead that the mean positions of the junctions of a ‘phantom’ network consisting of Gaussian chains devoid of material properties are affine in the strain. The vital significance of the distinction between the actual distribution of chain vectors in a network and their distribution if the junctions would be fixed at their mean positions went unnoticed for nearly 30 years. Experimental investigations, commencing with the incisive work of Gee in 1946. revealed large departures from the relationship of stress to strain predicted by the theories cited. This discrepancy prompted extensive studies, theoretical and experimental, during succeeding years. Inquiry into the fundamentals of polymer networks, formed for example by interlinking very long polymer molecules, exposed the need to take account of network imperfections, typically consisting of chains attached at only one end to a network junction. Various means were advocated to make corrections for these imperfections. The cycle rank ζ of the network has been shown (1976) to be the fundamental measure of its connectivity, regardless of the junction functionality and pattern of imperfections. Often overlooked is the copious interpenetration of the chains comprising typical elastomeric networks. Theories that attempt to represent such networks on a lattice are incompatible with this universal feature. Moreover, the dense interpenetration of chains may limit the ability of junctions in real networks to accommodate the fluctuations envisaged in the theory of phantom networks. It was suggested in 1975 that departures from the form predicted for the elastic equation of state are due to constraints on the fluctuations of junctions whose effect diminishes with deformation and with dilation. Formulation of a self-consistent theory based on this suggestion required recognition of the non-affine connection between the chain vector distribution function and the macroscopic strain in a real network, which may partake of characteristics of a phantom network in some degree. Implementation of the idea was achieved through postulation of domains of constraint affecting the equilibrium distribution of fluctuations of network junctions from their mean positions. This led in due course to a theory that accounts for the relationship of stress to strain virtually throughout the ranges of strain accessible to measurement. The theory establishes connections between structure and elastic properties. This is achieved with utmost frugality in arbitrary parameters.