中国科学院数学与系统科学研究院期刊网

2008年, 第21卷, 第3期 刊出日期:2008-09-20
  

  • 全选
    |
    论文
  • Jiangping HU;Xiaoming HU
    Journal of Systems Science and Complexity. 2008, 21(3): 325-336.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    Target tracking using distributed sensor network is in general a challenging problem because it always needs to deal with real-time processing of noisy information. In this paper the problem of using nonlinear sensors such as distance and direction sensors for estimating a moving target is studied. The problem is
    formulated as a prudent design of nonlinear filters for a linear system subject to noisy nonlinear measurements and partially unknown input, which is generated by an exogenous system. In the worst case where the input is completely unknown, the exogenous dynamics is reduced to the random walk model. It can be shown that the nonlinear filter will have optimal convergence if the number of the sensors are large enough and the convergence rate will be highly improved if the sensors are deployed appropriately. This actually raises an interesting issue on active sensing: how to optimally move the sensors if they are considered as mobile
    multi-agent systems? Finally, a simulation example is given to illustrate and validate the construction of our filter.
  • Xiaoli LI;Yugeng XI
    Journal of Systems Science and Complexity. 2008, 21(3): 337-346.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    This paper investigates distributed flocking problem where the information exchange among agents is modeled by the communication topology changing with time. Previous research on this problem establishes group stabilization by assuming that the dynamic topology is connected all the time, which however cannot be guaranteed by most proposed distributed control laws. In this paper, a distributed algorithm to distill a necessary subgraph of the initial communication topology is presented. This subgraph covers all the vertices of the communication topology and is proved to be connected as long as the initial communication topology is connected. A distributed control law is then designed to pursue the flocking motion while preserving all the edges in this subgraph. In this way, connectivity can be preserved all the time, and flocking problem is thus solved only provided the
    initial communication topology of multi-agent system is connected.
  • Qin LI;Zhongping JIANG
    Journal of Systems Science and Complexity. 2008, 21(3): 347-361.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    This paper proposes relaxed sufficient conditions for the consensus of multi-agent systems by the averaging protocols with time-varying system topology. Bidirectional information exchange between neighboring agents is considered and both the
    discrete-time and continuous-time consensus protocols are studied. It is shown that the consensus is reached if there exists an unbounded time sequence such that two agents who own the maximum and minimum states at each time instant in the sequence will be jointly connected at some future time. Further, this result is
    applied to the original nonlinear Vicsek model, and a sufficient condition for the heading consensus of the group with restricted initial conditions is obtained.
  • Zhiqiang LI;Yupeng QIAO;Hongsheng QI;Daizhan CHENG
    Journal of Systems Science and Complexity. 2008, 21(3): 362-377.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    This paper investigates the stability of (switched) polynomial systems. Using semi-tensor product of matrices, the paper develops two tools for testing the stability of a (switched) polynomial system. One is to convert a product of multi-variable polynomials into a canonical form, and the other is an easily verifiable sufficient condition to justify whether a multi-variable polynomial is positive definite. Using
    these two tools, the authors construct a polynomial function as a candidate Lyapunov function and via testing its derivative the authors provide some sufficient conditions for the global stability of polynomial systems.
  • Qijiang SONG;Hanfu CHEN
    Journal of Systems Science and Complexity. 2008, 21(3): 378-393.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    This paper considers identification of Wiener systems for which the internal variables and output are corrupted by noises. When the internal noise is a sequence of independent and identically distributed (iid) Gaussian random variables, by the Weierstrass transformation (WT) the system under consideration
    turns to be a Wiener system without internal noise. The nonlinear part of the latter is nothing else than the WT of the nonlinear function of the original system, while the linear subsystem is the same for both systems before and after WT. Under reasonable conditions, the recursive identification algorithms are proposed
    for the transformed Wiener system, and strong consistency for the
    estimates is established. By using the inverse WT the nonparametric estimates for the nonlinearity of the original system are derived, and they are strongly consistent if the nonlinearity in the original system is a polynomial. Similar results also hold in the case where the internal noise is non-Gaussian. Simulation results are fully consistent with the theoretical analysis.
  • Qingwei LIU;Yi LI;Shouyang WANG
    Journal of Systems Science and Complexity. 2008, 21(3): 394-405.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    This paper studies the impact of the reference point on a hedger's decision based upon prospect theory and experimental evidence on how prior outcomes affect risky choice. The authors show that in the futures market, a hedger who does not adjust his reference point timely would increase his positions continually as
    his accumulated losses increase, and finally become a speculator. Numerical simulation results under the normal distribution also lend support to the results. The model can help explain why the hedging behavior of firms turns into speculative activities and can offer some new insights into hedging behavior.
  • Lin WANG;Lei GUO
    Journal of Systems Science and Complexity. 2008, 21(3): 406-415.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    This paper considers the problem of robust consensus for a basic class of multi-agent systems with bounded disturbances and with directed information flow. A necessary and sufficient condition on the robust consensus is first presented, which is then applied to the analysis, control and decision making problems in the noise environments. In particular, the authors show how a soft control technique will
    synchronize a group of autonomous mobile agents without changing the existing local rule of interactions, and without assuming any kind of connectivity conditions on the system trajectories.
  • Yuhong LI
    Journal of Systems Science and Complexity. 2008, 21(3): 416-426.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    Given a real-valued separable $M$-type $2$ Banach space $X$with the $p$-th power of the norm of $C^2$-class, the almost sure asymptotic upper bounds of the solutions of the Ornstein-Uhlenbeck Processes described by the following equations
    $$\left\{
    \begin{array}{ll} dz(t)=A(t, z(t))\,dt+\sigma(t,
    z(t))\,dW(t),\\[1mm]
    z(0)=z_0 \in X,\end{array}\right.
    $$
    are investigated. This study generalizes the corresponding well-known finite dimensional results of Lapeyre (1989) and Mao(1992).
  • Xinzhu MENG;Lansun CHEN
    Journal of Systems Science and Complexity. 2008, 21(3): 427-440.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    This paper formulates a robust stage-structured SI eco-epidemiological model with periodic constant pulse releasing of infectious pests with pathogens. The authors show that the conditions for global attractivity of the `pest-eradication' periodic solution and permanence of the system depend on time delay, hence, the authors call it ``profitless". Further, the authors present a pest management strategy in which the pest population is kept under the economic threshold level (ETL) when the pest population is uniformly persistent. By numerical analysis, the authors also show that constant maturation time delay for the susceptible pests and pulse releasing of the infectious pests can bring obvious effects on the dynamics of
    system.
  • Xianjiu HUANG;Xi WEN;Fanping ZENG
    Journal of Systems Science and Complexity. 2008, 21(3): 441-445.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    The authors define and study topological pre-image entropy for the non-autonomous discrete dynamical systems given by a sequence $\{f_{i}\}_{i=1}^{\infty}$ of continuous self-maps of a compact topological space. The basic properties and the invariant with respect to equiconjugacy of pre-image entropy for the non-autonomous discrete dynamical systems are obtained.
  • Xiuli XU;Naishuo TIAN
    Journal of Systems Science and Complexity. 2008, 21(3): 446-455.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    The authors present a new queueing model with (e,d) setup time. Using the quasi-birth-and-death process and matrix-geometric method, the authors obtain the stationary distribution of queue length and the LST of waiting time of a customer in the system. Furthermore, the conditional stochastic decomposition results of queue length and waiting time are given.
  • Dongyang SHI;Xiaobin HAO
    Journal of Systems Science and Complexity. 2008, 21(3): 456-462.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    In this paper, a new triangular element (Quasi-Carey element) is constructed by the idea of Specht element. It is shown that this Quasi-Carey element possesses a very special property, i.e., the consistency error is of order $O(h^2)$, one order higher than its interpolation error when the exact solution belongs to $H^{3}({\it \Omega})$. However, the interpolation error and consistency error of Carey element are of order $O(h)$. It seems that the above special property has never been seen for other triangular elements for the second order problems.
  • Qibing GAO;Yaohua WU;Chunhua ZHU;Zhanfeng WANG
    Journal of Systems Science and Complexity. 2008, 21(3): 463-473.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    In generalized linear models with fixed design, under the assumption $\underline{\lambda}_n\rightarrow\infty$ and other regularity conditions, the asymptotic normality of maximum quasi-likelihood estimator $\widehat{\beta}_n$, which is the root of the quasi-likelihood equation with natural link function $\sum_{i=1}^nX_i(y_i-\mu(X_i'\beta))=0$, is obtained, where $\underline{\lambda}_n$ denotes the minimum eigenvalue of $\sum_{i=1}^nX_iX_i'$, $X_i$ are bounded $p\times q$ regressors, and $y_i$ are $q\times1$ responses.
  • Yongfu SU;Xiaolong QIN
    Journal of Systems Science and Complexity. 2008, 21(3): 474-482.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    K. Nakajo and W. Takahashi in 2003 proved the strong convergence theorems for
    nonexpansive mappings, nonexpansive semigroups, and proximal point
    algorithm for zero point of monotone operators in Hilbert spaces by using the hybrid method in mathematical programming. The purpose of this paper is to modify
    the hybrid iteration method of K. Nakajo and W. Takahashi through the monotone hybrid method, and to prove strong convergence theorems. The convergence rate of iteration process of the monotone hybrid method is faster than that of the iteration process of the hybrid method of K. Nakajo and W. Takahashi. In the
    proofs in this article, Cauchy sequence method is used to avoid the use of the demiclosedness principle and Opial's condition.