BP算法的改进及用模拟电路实现的神经网络分类器

基于用模拟电路实现神经网络分类器的目的，对多层静态前馈神经网络的ＢＰ算法做了改进，采用线性限幅函数代替Ｓｉｇｍｏｉｄ函数作为神经元的激活函数，给出了改进的ＢＰ算法。对该算法性能的实验研究表明：这种改进算法不但方便了用线性模拟集成运算放大电路实现神经网络，而且具有学习速度快，映射能力强等优点。根据本文算法设计的神经网络分类器，无论是计算机仿真，还是模拟电路实现，都得到了比较高的识别率。     

高速网络协议：问题与答案

作者在本文中指出了吉比特网络的目标及其所带来的问题，采用了提出问题并回答问题（或说明可能答案）的方法来阐明。     

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.     

Design and Implementation of a Flexible Manufacturing Control System Using Neural Network

Design and implementation of a sequential controller based on the concept of artificial neural networks for a flexible manufacturing system are presented. The recurrent neural network (RNN) type is used for such a purpose. Contrary to the programmable controller, an RNN-based sequential controller is based on a definite mathematical model rather than depending on experience and trial and error techniques. The proposed controller is also more flexible because it is not limited by the restrictions of the finite state automata theory. Adequate guidelines of how to construct an RNN-based sequential controller are presented. These guidelines are applied to different case studies. The proposed controller is tested by simulations and real-time experiments. These tests prove the successfulness of the proposed controller performances. Theoretical as well as experimental results are presented and discussed indicating that the proposed design procedure using Elman's RNN can be effective in designing a sequential controller for event-based type manufacturing systems. In addition, the simulation results assure the effectiveness of the proposed controller to outperform the effect of noisy inputs.     

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

高含蜡原油管道停输后的再启动问题非常复杂。它涉及因素多，问题的非线性很强。而有足够多神经元的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.     

Bandwidth Adaptation Algorithms for Adaptive Multimedia Services in Mobile Cellular Networks

The fluctuation of available link bandwidth in mobilecellular networks motivates the study of adaptive multimediaservices, where the bandwidth of an ongoing multimedia call can bedynamically adjusted. We analyze the diverse objectives of theadaptive multimedia framework and propose two bandwidth adaptationalgorithms (BAAs) that can satisfy these objectives. The firstalgorithm, BAA-RA, takes into consideration revenue and``anti-adaptation' where anti-adaptation means that a user feelsuncomfortable whenever the bandwidth of the user's call ischanged. This algorithm achieves near-optimal total revenue withmuch less complexity compared to an optimal BAA. The secondalgorithm, BAA-RF, considers revenue and fairness, and aims at themaximum revenue generation while satisfying the fairnessconstraint defined herein. Comprehensive simulation experimentsshow that the difference of the total revenue of BAA-RA and thatof an optimal BAA is negligible. Also, numerical results revealthat there is a conflicting relationship between anti-adaptationand fairness.