Applications of Soliton Transmission Control in Optimal Design of Long－Haul Soliton Communication System

ＡｐｐｌｉｃａｔｉｏｎｓｏｆｃｈａｏｓｉｎｓｐｒｅａｄｓｐｅｃｔｒｕｍｃｏｍｍｕｎｉｃａｔｉｏｎｓＡｐｐｌｉｃａｔｉｏｎｓｏｆＳｏｌｉｔｏｎＴｒａｎｓｍｉｓｓｉｏｎＣｏｎｔｒｏｌｉｎＯｐｔｉｍａｌＤｅｓｉｇｎｏｆＬｏｎｇ－ＨａｕｌＳｏｌｉｔｏｎＣｏｍ...     

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.     

非线性动态系统“黑箱”建模方法的研究

本文研究弱非线性动态系统“黑箱”建模的理论和方法，并简要给出根据此方法建模的结果。     

On uniform observation of nonuniformly observable systems

In [4,7,9,12], classes of nonlinear systems are considered for which observers can be designed. Although observability of nonlinear systems is known to be dependent on the input, the proposed observers have the property that the estimation error decays to zero irrespective of the input. In the first part of this paper, it is shown that this phenomenon follows from a common property of these systems: for all of them, the “unobservable states” with respect to some input, are in some sense “stable” (in the linear case, these systems are called detectable), and for this reason, a reduced order observer can be designed. In the second part is given a more general class of nonlinear systems for which such an observer can be designed.     

A globally stable discrete-time controller for current-fed induction motors

In this short paper we present a discrete-time field oriented controller (FOC) for current-fed induction motors which insures global asymptotic speed regulation as well as rotor flux norm tracking. To the best of our knowledge, this is the first time such a result is rigorously established for a controller implemented in discrete-time. To insure global stability a condition on the reference for the rotor flux norm, which is time-varying, is imposed. This condition disappears as the sampling period goes to zero, hence allowing for independent speed regulation and rotor flux norm tracking. One important feature of our scheme is that, compared with the first-difference approximation of the classical indirect FOC, the additional computational burden is negligible. It is also shown that the result can easily be extended to the case of tracking time-varying references in speed or position.     

An automated tanh-function method for finding solitary wave solutions to non-linear evolution equations

The tanh-function method for finding explicit travelling solitary wave solutions to non-linear evolution equations is described. The method is usually extremely tedious to use by hand. We present a Mathematica package ATFM that deals with the tedious algebra and outputs directly the required solutions. The use of the package is illustrated by applying it to a variety of equations; not only are previously known solutions recovered but in some cases more general forms of solution are obtained.     

具有多重焦点的波带透镜的设计

本文提出了一种新型的具有多重焦点的波带透镜的概念及其设计方法。可提供某些特定的光场分布,而且具有性能稳定、微型化和可实际制作等特点。     

Robust pole assignment for incomplete nonlinear decoupling applied to robots

A robustness analysis and synthesis for incomplete nonlinear decoupling for a class of nonlinear systems is discussed. Rigid and elastic-joint robot models belong to this class. For the elastic case, a transformation facilitates the robustness analysis under a weak assumption. Charts with H ₁- and H - norms of closed-loop disturbance transfer functions of the nonlinear-decoupled system are presented for a robust pole assignment.     

Routing with multiple quality-of-services constraints: An approximation perspective

Finding a path that satisfies multiple Quality-of-Service (QoS) constraints is vital to the deployment of current emerged services. However, existing algorithms are not very efficient and effective at finding such a path. Moreover, few works focus on three or more QoS constraints. In this paper, we present an enhanced version of fully polynomial time approximation scheme (EFPTAS) for multiconstrainted path optimal (MCOP) problem. Specifically, we make four major contributions. We first allow the proposed algorithm to construct an auxiliary graph, through which the QoS parameters on each of the finding path can be guaranteed not to exceed the given constraints. Then we adopt a concept, called nonlinear definition of path constraints in EFPTAS for reducing both time and space complexity. Also, we enable EFPTAS to run iteratively to facilitate a progressive refinement of the finding result. In addition to these, we identify some “deployment” issues for proposed algorithm, the essential steps that how and when the EFPTAS takes place are presented. By analyzing the proposed algorithm theoretically, we find that the presented EFPTAS can find a (1+ε)-approximation path in the network with time complexity O(|E||V|/ε) (where |E| is the number of edges and |V| is the number of nodes), which outperforms the previous best-known algorithm for MCOP. We conduct an extensive comparison between the algorithm presented in this paper and previous best-known study experimentally, our results indicate that EFPTAS can find a path with low complexity and preferable quality.     

Analysis of nonlinear electrical circuits using bernstein polynomials

In electrical circuit analysis, it is often necessary to find the set of all direct current (d.c.) operating points (either voltages or currents) of nonlinear circuits. In general, these nonlinear equations are often represented as polynomial systems. In this paper, we address the problem of finding the solutions of nonlinear electrical circuits, which are modeled as systems of n polynomial equations contained in an n-dimensional box. Branch and Bound algorithms based on interval methods can give guaranteed enclosures for the solution. However, because of repeated evaluations of the function values, these methods tend to become slower. Branch and Bound algorithm based on Bernstein coefficients can be used to solve the systems of polynomial equations. This avoids the repeated evaluation of function values, but maintains more or less the same number of iterations as that of interval branch and bound methods. We propose an algorithm for obtaining the solution of polynomial systems, which includes a pruning step using Bernstein Krawczyk operator and a Bernstein Coefficient Contraction algorithm to obtain Bernstein coefficients of the new domain. We solved three circuit analysis problems using our proposed algorithm. We compared the performance of our proposed algorithm with INTLAB based solver and found that our proposed algorithm is more efficient and fast.