A Macro Model of Frequently Changing Mobile Networks to Perform Flow and Access Control

The area covered by a mobile ad hoc network consists of obstacles that inhibit transmission and areas where communications can take place. Physical structures, such as buildings, that block transmission, or lakes, where forwarding nodes cannot be located, are permanent obstacles. Temporary obstacles are created as mobile nodes enter or leave an area. Our hypothesis is that the spaces between nearby obstacles are bottlenecks that inhibit the flows in the network. We partition the network into areas that are encompassed by obstacles and bottlenecks. All of the nodes in an area are treated as a single super node, and the bottlenecks between areas are the links between the super nodes. As individual nodes move, the flows and paths in the model change more slowly than the paths and flows between the individual nodes. We apply flow control algorithms to the model and perform admission control within a super node based on the flows that are assigned by the flow control algorithm. We apply the model to the Columbia University campus, and use max–min, fair bottleneck flow control to assign the flows. Our hypothesis is verified for this example.     

Networks for sorting multitonic sequences

Lee and Batcher have designed networks that efficiently merge k separately provided sorted sequences of known lengths totalling n. We show that the design is still possible, and in fact easier to describe, if we do not make use of the lengths, or even the directions of monotonicity, of the individual sequences—the sequences can be provided in a single undelimited concatenation of length n. The depth of the simplest resulting network to sort sequences that are “k-tonic” and of length n is , generalizing Batcher's 1968 results for the extreme values of k (k=2 corresponding to merging, and k=n/2 corresponding to general sorting).The exposition is self-contained and can serve even as an introduction to sorting networks and Batcher's results.     

Nonlinear black-box modeling in system identification: a unified overview

A nonlinear black-box structure for a dynamical system is a model structure that is prepared to describe virtually any nonlinear dynamics. There has been considerable recent interest in this area, with structures based on neural networks, radial basis networks, wavelet networks and hinging hyperplanes, as well as wavelet-transform-based methods and models based on fuzzy sets and fuzzy rules. This paper describes all these approaches in a common framework, from a user's perspective. It focuses on what are the common features in the different approaches, the choices that have to be made and what considerations are relevant for a successful system-identification application of these techniques. It is pointed out that the nonlinear structures can be seen as a concatenation of a mapping form observed data to a regression vector and a nonlinear mapping from the regressor space to the output space. These mappings are discussed separately. The latter mapping is usually formed as a basis function expansion. The basis functions are typically formed from one simple scalar function, which is modified in terms of scale and location. The expansion from the scalar argument to the regressor space is achieved by a radial- or a ridge-type approach. Basic techniques for estimating the parameters in the structures are criterion minimization, as well as two-step procedures, where first the relevant basis functions are determined, using data, and then a linear least-squares step to determine the coordinates of the function approximation. A particular problem is to deal with the large number of potentially necessary parameters. This is handled by making the number of ‘used’ parameters considerably less than the number of ‘offered’ parameters, by regularization, shrinking, pruning or regressor selection.     

A real-time planning algorithm for obstacle avoidance of redundant robots

A computationally efficient, obstacle avoidance algorithm for redundant robots is presented in this paper. This algorithm incorporates the neural networks and pseudodistance function D _p in the framework of resolved motion rate control. Thus, it is well suited for real-time implementation. Robot arm kinematic control is carried out by the Hopfield network. The connection weights of the network can be determined from the current value of Jacobian matrix at each sampling time, and joint velocity commands can be generated from the outputs of the network. The obstacle avoidance task is achieved by formulating the performance criterion as D _p>d _min (d _min represents the minimal distance between the redundant robot and obstacles). Its calculation is only related to some vertices which are used to model the robot and obstacles, and the computational times are nearly linear in the total number of vertices. Several simulation cases for a four-link planar manipulator are given to prove that the proposed collision-free trajectory planning scheme is efficient and practical.     

基于自组织神经网络的实时统计特征抽取方法

应用人工神经网络讨论统计了特征抽取的原理，提出了相应的抽取方法。该方法具有实时性，容错性，高数据压缩率和良好的特征分辨率。通过计算机仿真和桥梁索力状态的实例计算分析证实了该技术具有广泛的应用价值。     

A design and analysis of objective function-based unsupervised neural networks for fuzzy clustering

Fuzzy clustering has played an important role in solving many problems. In this paper, we design an unsupervised neural network model based on a fuzzy objective function, called OFUNN. The learning rule for the OFUNN model is a result of the formal derivation by the gradient descent method of a fuzzy objective function. The performance of the cluster analysis algorithm is often evaluated by counting the number of crisp clustering errors. However, the number of clustering errors alone is not a reliable and consistent measure for the performance of clustering, especially in the case of input data with fuzzy boundaries. We introduce two measures to evaluate the performance of the fuzzy clustering algorithm. The clustering results on three data sets, Iris data and two artificial data sets, are analyzed using the proposed measures. They show that OFUNN is very competitive in terms of speed and accuracy compared to the fuzzy c-means algorithm.     

计算机网络互连模式及实现技术

本文讨论了计算机网络互连的体系结构模式及实现技术。文中先论述了ＩＳＯ、ＤＯＤ和Ｐｕｐ网际互连参考模式，然后讨论了网络互连的主要实现技术：互连层，网际寻址，网际路由选择，信包分拆与重装，网际流控与拥挤控制，网际保安与差错控制，网际信关与桥以及协议转换等技术。     

Deterministic learning of completely resonant nonlinear wave systems with Dirichlet boundary conditions

In this paper, we investigate the approximation of completely resonant nonlinear wave systems via deterministic learning. The plants are distributed parameter systems (DPS) describing homogeneous and isotropic elastic vibrating strings with fixed endpoints. The purpose of the paper is to approximate the infinite-dimensional dynamics, rather than the parameters of the wave systems. To solve the problem, the wave systems are first transformed into finite-dimensional dynamical systems described by ordinary differential equation (ODE). The properties of the finite-dimensional systems, including the convergence of the solution, as well as the dominance of partial system dynamics according to point-wise measurements, are analyzed. Based on the properties, second, by using the deterministic learning algorithm, an approximately accurate neural network (NN) approximation of the the finite-dimensional system dynamics is achieved in a local region along the recurrent trajectories. Simulation studies are included to demonstrate the effectiveness of the proposed approach.     

Negative effects of sufficiently small initial weights on back-propagation neural networks

In the training of feedforward neural networks,it is usually suggested that the initial weights should be small in magnitude in order to prevent premature saturation.The aim of this paper is to point out the other side of the story:In some cases,the gradient of the error functions is zero not only for infinitely large weights but also for zero weights.Slow convergence in the beginning of the training procedure is often the result of sufficiently small initial weights.Therefore,we suggest that,in these cases,the initial values of the weights should be neither too large,nor too small.For instance,a typical range of choices of the initial weights might be something like(0.4,0.1) ∪(0.1,0.4),rather than(0.1,0.1) as suggested by the usual strategy.Our theory that medium size weights should be used has also been extended to a few commonly used transfer functions and error functions.Numerical experiments are carried out to support our theoretical findings.