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

2010年, 第23卷, 第1期 刊出日期:2010-02-25
  

  • 全选
    |
    论文
  • Yoshimasa Nakamura;Shouyang Wang;Xun Zhang
    Journal of Systems Science and Complexity. 2010, 23(1): 1-002.
    摘要 ( ) PDF全文 ( )   可视化   收藏
  • Qijiang SONG;Han-Fu CHEN
    Journal of Systems Science and Complexity. 2010, 23(1): 3-021. https://doi.org/10.1007/s11424-010-9268-1
    摘要 ( ) PDF全文 ( )   可视化   收藏
    This paper considers identification of the nonlinear autoregression with exogenous inputs (NARX system). The growth rate of the nonlinear function is required be not faster than linear with slope less than one. The value of $f(\cdot)$ at any fixed point is recursively estimated by the stochastic approximation (SA) algorithm with the help of kernel functions. Strong consistency of the estimates is established under reasonable conditions, which, in particular, imply stability of the system. The numerical simulation is consistent with the theoretical analysis.
  • Keigo TAKEUCHI;Mikko VEHKAPERA;Toshiyuki TANAKA;Ralf R. MULLER
    Journal of Systems Science and Complexity. 2010, 23(1): 22-034. https://doi.org/10.1007/s11424-010-9278-z
    摘要 ( ) PDF全文 ( )   可视化   收藏
    This paper analyzes performance of optimal channel estimation and multiuser detection (MUD) in a block-fading code-division multiple-access (CDMA) channel on the assumptions of random spreading and large-system limit, by using the replica method developed in statistical mechanics. The authors find that the asymptotic spectral efficiency of the linear minimum mean-squared error (LMMSE) MUD which was proposed and analyzed by Evans and Tse in 2000 is indistinguishable from that of the optimal MUD for small system loads. Our results imply that performance of MUD scarcely improves even if one spends more computational cost than that of the LMMSE MUD, i.e., at most the cube of the number of users, on the above-described conditions.
  • Cuiqin MA;Tao LI;Jifeng ZHANG
    Journal of Systems Science and Complexity. 2010, 23(1): 35-049. https://doi.org/10.1007/s11424-010-9273-4
    摘要 ( ) PDF全文 ( )   可视化   收藏
    This work is concerned with consensus control for a class of leader-following multi-agent systems (MASs). The information that each agent received is corrupted by measurement noises. To reduce the impact of noises on consensus, time-varying consensus gains are adopted, based on which consensus protocols are designed. By using the tools of stochastic analysis and algebraic graph theory, a sufficient condition is obtained for the protocol to ensure strong mean square consensus under the fixed topologies. This condition is shown to be necessary and sufficient in the noise-free case. Furthermore, by using a common Lyapunov function, the result is extended to the switching topology case.
  • Wladimir BOCQUET;Kazunori HAYASHI;Hideaki SAKAI
    Journal of Systems Science and Complexity. 2010, 23(1): 50-060. https://doi.org/10.1007/s11424-010-9275-2
    摘要 ( ) PDF全文 ( )   可视化   收藏
    This paper proposes a systematic design method of overlap frequency domain equalization (FDE) for single carrier (SC) transmission without a guard interval (GI). Based on the analysis of signal-to-interference-plus-noise ratio (SINR) of the equalizer output for each symbol, the authors adaptively determine the block
    of the overlap FDE, where the block is defined as a set of symbols at the equalizer output with sufficiently low error rate, for a certain fixed sliding window size, which corresponds to a fast Fourier transform (FFT) window size. The proposed method takes advantage of the fact that the utility part of the equalized signal is localized around the center of the FFT window. In addition, the authors also propose to adjust the block size in order to control the computational complexity of the equalization per processed sample associating with the average bit error rate (BER) of the system. Simulation results show that the proposed scheme can achieve
    comparable BER performance to the conventional SC-FDE scheme with sufficient GI insertion for both the coded and uncoded cases with various modulation levels, while requiring lower computational complexity compared to the SC overlap FDE transmission with the fixed block.
  • Lean YU;Wuyi YUE;Shouyang WANG
    Journal of Systems Science and Complexity. 2010, 23(1): 61-070. https://doi.org/10.1007/s11424-010-9272-5
    摘要 ( ) PDF全文 ( )   可视化   收藏
    In communication networks (CNs), the uncertainty is caused by the dynamic nature of the traffic demands. Therefore there is a need to incorporate the uncertainty into the network bandwidth capacity design. For this purpose, this paper developed a fuzzy methodology for network bandwidth design under demand uncertainty. This
    methodology is usually used for offline traffic engineering optimization, which takes a centralized view of bandwidth design, resource utilization, and performance evaluation. In this proposed methodology, uncertain traffic demands are first handled into a fuzzy number via a fuzzification method. Then a fuzzy optimization
    model for the network bandwidth allocation problem is formulated with the consideration of the trade-off between resource utilization and network performance. Accordingly, the optimal network bandwidth capacity can be obtained by maximizing network revenue in CNs. Finally, an illustrative numerical example is presented for the purpose of verification.
  • Shuhei KAMIOKA;Satoru MIZUTANI
    Journal of Systems Science and Complexity. 2010, 23(1): 71-080. https://doi.org/10.1007/s11424-010-9276-1
    摘要 ( ) PDF全文 ( )   可视化   收藏
    A graph is introduced, which allows of a combinatorial interpretation of a discrete-time semi-infinite Lotka-Volterra (dLV) equation. In particular, Hankel determinants used in a determinant solution to the dLV equation are evaluated, via the Gessel-Viennot method, in terms of non-intersecting subgraphs. Further, the recurrence of the dLV equation describing its time-evolution is equivalently expressed as a time-evolution of weight of specific subgraphs.
  • Min XU;Xiaodong HU;Songpu SHANG
    Journal of Systems Science and Complexity. 2010, 23(1): 81-090. https://doi.org/10.1007/s11424-010-9271-6
    摘要 ( ) PDF全文 ( )   可视化   收藏
    In the application of multiple-processor systems some processors or links in a system may not function properly, thus the fault diagnosis is one of the most important issues in the analysis and maintenance of those systems. For the practical fault diagnosis systems, the probability that all neighboring processors of a processor are faulty simultaneously is very small. Thus, the conditional diagnosability, which is a new metric for evaluating such systems, assumes that every fault set does not contain all neighbors of any processor in the system. In this paper, the authors show that the $n$-dimensional shuffle-cube has the conditional diagnosability of $4n-15$ for $n\equiv 2\,({\rm mod}\,4)$ and $n\ge
    10$.
  • Yuichi YOSHIDA;Hiro ITO
    Journal of Systems Science and Complexity. 2010, 23(1): 91-101. https://doi.org/10.1007/s11424-010-9280-5
    摘要 ( ) PDF全文 ( )   可视化   收藏
    This paper presents an algorithm that tests whether a given degree-bounded digraph is $k$-edge-connected or $\varepsilon$-far from $k$-edge-connectivity. This is the first testing algorithm for $k$-edge-connectivity of digraphs whose running time is independent of the number of vertices and edges. A digraph of $n$ vertices with degree bound $d$ is $\varepsilon$-far from $k$-edge-connectivity if
    at least $\varepsilon dn$ edges have to be added or deleted to make the digraph $k$-edge-connected, preserving the degree bound. Given a constant error parameter $\varepsilon$ and a degree bound $d$, our algorithm always accepts all $k$-edge-connected digraphs and rejects all digraphs that is $\varepsilon$-far from $k$-edge-connectivity with probability at least $2/3$. It runs in $O\big(d\left(\frac{c}{\varepsilon d}\right)^{k}\log\frac{1}{\varepsilon d}O\big)$$($$c>1$ is a
    constant$)$ time when input digraphs are restricted to be $(k-1)$-edge connected and runs in $O\big(d\left(\frac{ck}{\varepsilon d}\right)^{k}\log\frac{k} \varepsilon d}O\big)(c>1 \mbox{ is a constant})$ time for general digraphs.
  • Yuanhua NI;Weihai ZHANG;Haitao FANG
    Journal of Systems Science and Complexity. 2010, 23(1): 102-115. https://doi.org/10.1007/s11424-010-9270-7
    摘要 ( ) PDF全文 ( )   可视化   收藏
    This paper presents the notions of exact observability and exact detectability for Markov jump linear stochastic systems of It\^o type with multiplicative noise (for short, MJLSS). Stochastic Popov-Belevith-Hautus (PBH) Criterions for exact observability and exact detectability are respectively obtained. As an application,
    stochastic $H_2/H_\infty$ control for such MJLSS is discussed under exact detectability.
  • Atsunori KANEMURA;Shin-ichi MAEDA;Wataru FUKUDA;Shin ISHII
    Journal of Systems Science and Complexity. 2010, 23(1): 116-136.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    Superresolution is an image processing technique that estimates an original high-resolution image from its low-resolution and degraded observations. In superresolution tasks, there have been problems regarding the computational cost for the estimation of high-dimensional variables. These problems are now being overcome by the recent development of fast computers and the development of
    powerful computational techniques such as variational Bayesian approximation. This paper reviews a Bayesian treatment of the superresolution problem and presents its extensions based on hierarchical modeling by employing hidden variables.
  • Zhao DONG;Yingchao XIE
    Journal of Systems Science and Complexity. 2010, 23(1): 137-152. https://doi.org/10.1007/s11424-010-9269-0
    摘要 ( ) PDF全文 ( )   可视化   收藏
    This paper discusses the ergodicity of a linear stochastic partial differential equation driven by L\'evy noise.
  • Satoshi TSUJIMOTO
    Journal of Systems Science and Complexity. 2010, 23(1): 153-176. https://doi.org/10.1007/s11424-010-9279-y
    摘要 ( ) PDF全文 ( )   可视化   收藏
    It is shown that the nonautonomous discrete Toda equation and its B\"acklund transformation can be derived from the reduction of the hierarchy of the discrete KP equation and the discrete two-dimensional Toda equation. Some explicit examples of the determinant solutions of the nonautonomous discrete Toda equation including the Askey-Wilson polynomial are presented. Finally we discuss the relationship between the nonautonomous discrete Toda system and the nonautonomous discrete Lotka-Volterra equation.
  • Ying YANG;Aihui ZHOU
    Journal of Systems Science and Complexity. 2010, 23(1): 177-193. https://doi.org/10.1007/s11424-010-9274-3
    摘要 ( ) PDF全文 ( )   可视化   收藏
    In this paper, a two-scale finite element approach is proposed and analyzed for
    approximations of Green's function in three-dimensions. This approach is based on
    a two-scale finite element space defined, respectively, on the whole domain with
    size $H$ and on some subdomain containing singular points with size $h~ (h\ll H)$. It is shown that this two-scale discretization approach is very efficient. In particular, the two-scale discretization approach is applied to solve Poisson-Boltzmann equations successfully.
  • Mingxi WANG;Shulin LIU;Shouyang WANG;Kin Keung LAI
    Journal of Systems Science and Complexity. 2010, 23(1): 194-208. https://doi.org/10.1007/s11424-010-9337-5
    摘要 ( ) PDF全文 ( )   可视化   收藏
    To eliminate computational problems involved in evaluating multi-attribute bids with different measures, this article first normalizes each individual component of a bid, and then makes use of the weighted product method to present a new scoring function that converts each bid into a score. Two kinds of multi-attribute auction
    models are introduced in terms of scoring rules and bidding objective functions. Equilibrium bidding strategies, procurer's revenue comparisons and optimal auction design are characterized in these two models. Finally, this article discusses some improvement of robustness of our models, with respect to the assumptions.