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

2011年, 第24卷, 第3期 刊出日期:2011-06-25
  

  • 全选
    |
    论文
  • Guofeng ZHANG;Long WANG;Tongwen CHEN
    Journal of Systems Science and Complexity. 2011, 24(3): 413-432. https://doi.org/10.1007/s11424-011-8173-6
    摘要 ( ) PDF全文 ( )   可视化   收藏
    This paper investigates the nonlinear dynamics of network-based dynamical systems where network communication channels of finite data rates are inserted into the closed loops of the control systems. The authors analyze the bifurcation and chaotic behavior of the non-smooth dynamical systems. The authors
    first prove that for almost all system parameters there are no periodic orbits. This result distinguishes this type of non-smooth dynamical systems from many others exhibiting border-collision bifurcations. Next, the authors show analytically that the chaotic sets are separated from the region containing the line segment of
    all fixed points with a finite distance. Finally, the authors employ a simple model to highlight that both the number of clients sharing a common network channel and fluctuations in the available network bandwidth have significant influence on the performance of such dynamical systems.
  • Juan CHEN;Jun-an LU;Xiaoqun WU
    Journal of Systems Science and Complexity. 2011, 24(3): 433-448. https://doi.org/10.1007/s11424-010-8323-2
    摘要 ( ) PDF全文 ( )   可视化   收藏
    Wu, Chen, and Cai (2007) investigated chaos synchronization of two identical generalized Lorenz systems unidirectionally coupled by a linear state error feedback controller. However, bidirectional coupling in real life such as complex dynamical networks is more universal. This paper provides a unified method for analyzing chaos synchronization of two bidirectionally coupled generalized Lorenz
    systems. Some sufficient synchronization conditions for some special coupling matrices (diagonal matrices, so-called dislocated coupling matrices, and so on) are derived through rigorously mathematical theory. In particular, for the classical Lorenz system, the authors obtain synchronization criteria which only depend upon its parameters using new estimation of the ultimate bounds of Lorenz system (Chaos, Solitons, and Fractals, 2005). The criteria are then applied to four typical generalized Lorenz systems in the numerical simulations for verification.
  • Jinyu HUANG;Xiaogang JIN
    Journal of Systems Science and Complexity. 2011, 24(3): 449-456. https://doi.org/10.1007/s11424-011-8303-1
    摘要 ( ) PDF全文 ( )   可视化   收藏
    Since the spreading of harmful rumors can deeply endanger a society, it is valuable to investigate strategies that can efficiently prevent hazardous rumor propagation. To conduct this investigation, the authors modify the SIR model to describe rumor
    propagation on networks, and apply two major immunization strategies, namely, the random immunization and the targeted immunization to the rumor model on a small-world network. The authors find that when the average degree of the network is small, both two strategies are effective and when the average degree is
    large, neither strategy is efficient in preventing rumor propagation. In the latter case, the authors propose a new strategy by decreasing the credibility of the rumor and applying either the random or the targeted immunization at the same time. Numerical simulations indicate that this strategy is effective in preventing
    rumor spreading on the small-world network with large average degree.
  • Zhaoqiang GE;Guangtian ZHU;Dexing FENG
    Journal of Systems Science and Complexity. 2011, 24(3): 457-465. https://doi.org/10.1007/s11424-011-8244-8
    摘要 ( ) PDF全文 ( )   可视化   收藏
    State feedback and pole assignment of the second order coupled singular distributed parameter systems are discussed via functional analysis and operator theory in Hilbert space, in which infinite many poles are changed. The solutions of the problem and the constructive expression of the solutions are given by the
    generalized inverse of bounded linear operator. This research is theoretically important for studying the pole assignment and stabilization of the singular distributed parameter systems.
  • Kun ZHAO;Mingyu ZHANG;Naiyang DENG
    Journal of Systems Science and Complexity. 2011, 24(3): 466-476. https://doi.org/10.1007/s11424-011-8102-8
    摘要 ( ) PDF全文 ( )   可视化   收藏
    This paper proposes robust version to unsupervised classification algorithm based on modified robust version of primal problem of standard SVMs, which directly relaxes it with label variables to a semi-definite programming. Numerical results confirm the robustness of the proposed method.
  • Bin ZHOU;Guangren DUAN;He KONG
    Journal of Systems Science and Complexity. 2011, 24(3): 477-490. https://doi.org/10.1007/s11424-011-8325-8
    摘要 ( ) PDF全文 ( )   可视化   收藏
    By using the so-called $\mathcal{SP}$-stable polynomials, this paper reconsiders the problem of global stabilization of linear systems with input saturation. Firstly, a new nonlinear feedback law consisting of parallel connections of saturation
    functions by means of the so-called state-dependent saturation function is proposed for global stabilization of chains of integrators system. The state-dependent saturation function allows increasing the control energy when some of the states are badly scaled and can improve significantly the transient performances of the closed-loop system. Secondly, this type of global
    stabilization nonlinear feedback laws is extended to a class of linear systems that can be globally stabilized by bounded controls. Numerical examples show the effectiveness of the proposed approach.
  • Xianping GUO;Lanlan ZHANG
    Journal of Systems Science and Complexity. 2011, 24(3): 491-505. https://doi.org/10.1007/s11424-011-8004-9
    摘要 ( ) PDF全文 ( )   可视化   收藏
    This paper studies denumerable continuous-time Markov decision processes with {expected total reward criteria}. The authors first study the unconstrained model with possible unbounded transition rates, and give suitable conditions on the
    controlled system's primitive data under which the authors show the existence of a solution to the {total reward optimality equation} and also the existence of an optimal stationary policy. Then, the authors impose a constraint on an expected total cost, and consider the associated {constrained model}. Basing on the
    results about the unconstrained model and using the Lagrange multipliers approach, the authors prove the existence of constrained-optimal policies under some additional conditions. Finally, the authors apply the results to controlled queueing systems.
  • Yuesheng LOU;Shuang CONG
    Journal of Systems Science and Complexity. 2011, 24(3): 506-518. https://doi.org/10.1007/s11424-011-9066-4
    摘要 ( ) PDF全文 ( )   可视化   收藏
    The state transfer under control fields is analyzed based on the Bloch sphere representation of a single qubit. In order to achieve the target from an arbitrary initial state to a target state, the conditions that parameters should satisfy are deduced separately in two different requirements: One is in the case of the
    rotation angle around the $x$-axis being fixed and another is in the situation with a given evolution time. Several typical states trajectories are demonstrated by numerical simulations on the Bloch sphere. The relations between parameters and the trajectories are analyzed.
  • Jicai HUANG;Han ZHANG
    Journal of Systems Science and Complexity. 2011, 24(3): 519-531. https://doi.org/10.1007/s11424-010-8209-3
    摘要 ( ) PDF全文 ( )   可视化   收藏
    Bifurcations of periodic orbits of three-well Duffing system with a phase shift are investigated in detail. The conditions of the existence and bifurcations for harmonics, subharmonics (2-order, 3-order and $m$-order) and superharmonics under small perturbations are given by using second-order averaging method and
    Melnikov's method. The influence of the phase shift on the dynamics is also obtained.
  • Limin WEN;Wenli DENG
    Journal of Systems Science and Complexity. 2011, 24(3): 532-539. https://doi.org/10.1007/s11424-010-8328-x
    摘要 ( ) PDF全文 ( )   可视化   收藏
    In almost all credibility estimators considered previously, the claims are assumed to be independent over risks. However, from practical point of view, this paper investigates the credibility premium when risks are dependent on each other. The authors build the B\"{u}hlmann's credibility models to account for an equal
    correlation structure over risks, and parameter estimations are also
    considered. Some desired results are derived.
  • Juan ZHANG;Hengjian CUI
    Journal of Systems Science and Complexity. 2011, 24(3): 540-553. https://doi.org/10.1007/s11424-010-8111-z
    摘要 ( ) PDF全文 ( )   可视化   收藏
    The multivariate linear errors-in-variables model when the regressors are missing at random in the sense of Rubin (1976) is considered in this paper. A constrained empirical likelihood confidence region for a parameter $\beta_0$ in this model is
    proposed, which is constructed by combining the score function corresponding to the weighted squared orthogonal distance based on inverse probability with a constrained region of $\beta_0$. It is shown that the empirical log-likelihood ratio at the true parameter converges to the standard chi-square distribution.
    Simulations show that the coverage rate of the proposed confidence region is closer to the nominal level and the length of confidence interval is narrower than those of the normal approximation of inverse probability weighted adjusted least square estimator in most cases. A real example is studied and the result supports the theory and simulation's conclusion.
  • Yinghui TANG;Miaomiao YU;Cailiang LI
    Journal of Systems Science and Complexity. 2011, 24(3): 554-564. https://doi.org/10.1007/s11424-011-8339-2
    摘要 ( ) PDF全文 ( )   可视化   收藏
    This paper studies a single server discrete-time Erlang loss system with Bernoulli arrival process and no waiting space. The server in the system is assumed to provide two different types of services, namely essential and optional services, to the customer. During the operation of the system, the arrival of the catastrophe
    will break the system down and simultaneously induce customer to leave the system immediately. Using a new type discrete supplementary variable technique, the authors obtain some performance characteristics of the queueing system, including the steady-state availability and failure frequency of the system, the
    steady-state probabilities for the server being idle, busy, breakdown and the loss probability of the system etc. Finally, by the numerical examples, the authors study the influence of the system parameters on several performance measures.
  • Yong ZHANG;Xiaoyun YANG;Zhishan DONG;Dehui WANG
    Journal of Systems Science and Complexity. 2011, 24(3): 565-579. https://doi.org/10.1007/s11424-011-8119-z
    摘要 ( ) PDF全文 ( )   可视化   收藏
    This paper studies the autoregression models of order one, in a general time series setting that allows for weakly dependent innovations. Let $\{X_t\}$ be a linear process defined by $X_t=\sum_{k=0}^{\infty}\psi_k\varepsilon_{t-k}$, where
    $\{\psi_k,k\geq 0\}$ is a sequence of real numbers and $\{\varepsilon_k,~ k=0,\pm1,\pm2,\cdots\}$ is a sequence of random variables. Two results are proved in this paper. In the first result, assuming that $\{\varepsilon_k, k\geq 1\}$ is a sequence of asymptotically linear negative quadrant dependent (ALNQD) random variables, the authors find the limiting distributions of the least
    squares estimator and the associated regression $t$ statistic. It is interesting that the limiting distributions are similar to the one found in earlier work under the assumption of i.i.d. innovations. In the second result the authors prove that the least squares estimator is not a strong consistency estimator of the autoregressive
    parameter $\alpha$ when $\{\varepsilon_k, k\geq 1\}$ is a sequence of negatively associated (NA) random variables, and $\psi_0=1, \psi_k=0,$~$k\geq 1$.
  • Ziming LI;Huaifu WANG
    Journal of Systems Science and Complexity. 2011, 24(3): 580-592. https://doi.org/10.1007/s11424-011-8392-x
    摘要 ( ) PDF全文 ( )   可视化   收藏
    This paper presents a criterion for the similarity of length-two elements in a noncommutative principal ideal domain. The criterion enables the authors to develop an algorithm for determining whether~$B_1A_1$ and~$B_2A_2$ are similar, where~$A_1, A_2, B_1, B_2$ are first-order differential (difference) operators. The main step in the algorithm is to find a rational solution of a
    parametric differential (difference) Risch's equation, which has been well-studied in symbolic integration (summation).
  • Ying GAO
    Journal of Systems Science and Complexity. 2011, 24(3): 593-603. https://doi.org/10.1007/s11424-011-9049-5
    摘要 ( ) PDF全文 ( )   可视化   收藏
    This paper consider Hexagonal-metric codes over certain class f finite fields. The Hexagonal metric as defined by Huber is a on-trivial metric over certain classes of finite fields. exagonal-metric codes are applied in coded modulation scheme based
    on hexagonal-like signal constellations. Since the development of
    tight bounds for error correcting codes using new distance is a
    research problem, the purpose of this note is to generalize the
    Plotkin bound for linear codes over finite fields equipped with the
    Hexagonal metric. By means of a two-step method, the author presents
    a geometric method to construct finite signal constellations from
    quotient lattices associated to the rings of Eisenstein-Jacobi (EJ)
    integers and their prime ideals and thus naturally label the
    constellation points by elements of a finite field. The Plotkin
    bound is derived from simple computing on the geometric figure of a
    finite field.
  • Jinbao JIAN; Guodong MA;Chuanhao GUO
    Journal of Systems Science and Complexity. 2011, 24(3): 604-618. https://doi.org/10.1007/s11424-011-8105-5
    摘要 ( ) PDF全文 ( )   可视化   收藏
    In this paper, the nonlinear optimization problems with
    inequality constraints are discussed. Combining the ideas of the
    strongly sub-feasible directions method and the
    $\varepsilon$-generalized projection technique, a new algorithm
    starting with an arbitrary initial iteration point for the
    discussed problems is presented. At each iteration, the search
    direction is generated by a new $\varepsilon$-generalized
    projection explicit formula, and the step length is yielded by a
    new Armijo line search. Under some necessary assumptions, not only
    the algorithm possesses global and strong convergence, but also
    the iterative points always get into the feasible set after finite
    iterations. Finally, some preliminary numerical results are
    reported.