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

1998年, 第11卷, 第2期 刊出日期:1998-04-15
  

  • 全选
    |
    论文
  • GAO Jialing;CHEN Ping
    Journal of Systems Science and Complexity. 1998, 11(2): 97-106.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    This paper presents the design of sample survey scheme for the study on women's status in contemporary China, and also discusses the precision and design effect of the scheme. In Section 1, the adopted methods of stratified four-stage sampling withunequal probabilities and two-phase sampling are introduced. The determination and allocation of sample size are also discussed. In Section 2, the methods of estimating target variables of population and their variances are described in detail. The relevant formulaefor calculation are given in Section 3, the precisions and design effects for some target variables are listed. Finally, these results are discussed and analyzed by the authors.
  • CAO Feng;CHEN Lansun
    Journal of Systems Science and Complexity. 1998, 11(2): 107-111.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    The purpose of this paper is to investigate the asymptotic behavior of apredator-prey model. The model is composed of two patches. The system has two species: one can dense between the two patches, but the other is confined to one of the patches and cannot diffuse. It is proved that the system is globally stable under appropriate conditions.
  • HAN Jiye;LIU Guanghui;YIN Hongxia
    Journal of Systems Science and Complexity. 1998, 11(2): 112-116.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    In this paper, we investigate the convergence property of the conjugate gradient algorithms which depend on the search directions d_1=-g_1, d_{k+1}=-g_{k+1}+\beta_k d_k ,k\geq 1, by using different choices for the scalar \beta_k, where g_k is the gradient of f at x_k. Under some assumptions which are slightly weaker than those in [1], we prove a global convergence result which allows \beta_k to be set in a wider range than that in [1].
  • CUI Hengjian;YUAN Xiujiu
    Journal of Systems Science and Complexity. 1998, 11(2): 117-124.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    This paper gives an estimate of a symmetric population distribution function Fand a modified K. Pearson statistic in the symmetric auxiliary information. Asymptotical properties show that they dominate the usual statistics. The asymptotic distribution of the modified K. Pearson statistic under the null hypothesis is derived. The approximate Bahadur slope and asymptotic power function of a test based on the modified K. Pearson statistic are given. Numerical results show the modified K. Pearson statistic is better than K. Pearson statistic.
  • WU Shiquan;CHEN Yang;Patrice Marcotte
    Journal of Systems Science and Complexity. 1998, 11(2): 125-133.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    In this papert a cutting planelnethod is presented for solving the linear BLPP. An optimality criterion for the linear BLPP is derived from two related linear programs constructed by using the complementarity conditions for the second level problem. Two types of cutting planes are developed in order to deal with different situations and to obtaina maximal efficiency. The method makes use of the special cuts and the implicit vertex enumeration idea to avoid some drawbacks in some existing cuttillg plane methods. The algorithm can be proved to be finitely convergent.
  • LIN Qun;ZHANG Shuhua
    Journal of Systems Science and Complexity. 1998, 11(2): 134-143.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    In this paper we employ the Petrov-Galerbo method for the first order hyperbolic problems to get the Galerkin approtoation of high accuracy by means of the interpolation postprocessing, extrapolation and defect correction techniques.
  • ZHANG Fubao
    Journal of Systems Science and Complexity. 1998, 11(2): 144-149.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    Some existence theorems of three-point boundary value problems for a class ofthree order differential inclusions are obtained by means of the topological degree theory forset-valued mappings and an improved Wirtinger's inequality. The results, even restrictedto the case of differential equations, have generized and improved on the related results in [1]. Particularly, a problem raised in Remark 5 in [1] is answered definitely.
  • YUAN Zhendong;CHEN Qi;DING Sheng;DIAO Lianwang
    Journal of Systems Science and Complexity. 1998, 11(2): 150-160.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    The credible sets for system parameters and transfer functions are discussedin this paper. The derivations of the credible sets via the Bayesian statistical methods aregiven in various cases and the credible sets of transfer functions are constructed on the basis of the parameter credible sets. In the small sample case the credible set, which the parameters are in, has minimal volume with given credible probability. In the large sample case, it is proved that if the critical boundary is taken properly then the probability, with which the parameters are in the credible set, will tend to one as the number of data tendsto infinity. The credible set for transfer function is an envelope on the complex plane. Under some assumptions, the envelope tends to the curve of true transfer function.
  • LUO Yuan;ZHANG Zhaozhi
    Journal of Systems Science and Complexity. 1998, 11(2): 161-167.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    In this paper, a class of block cipher systems having asymptotically perfect secrecy is constructed by using the neural network models modified from the Hopfield model.
  • FU Fangwei;SHEN Shiyi
    Journal of Systems Science and Complexity. 1998, 11(2): 168-174.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    When the error probability is less than 2^{-nr}, the minimum compression rate(r-optimal rate) of arbitrarily varying source with a fidelity criterion is determined. Thisgeneralizes the result of Arutyunyan and Mekaush[1] for discrete memoryless source witha fidelity criterion, and is called strong coding theorem of arbitrarily varying source with a fidelity criterion. We also determine the asymptotic error exponellt for arbitrarily varying source with a fidelity criterion. This generalizes Marton's result in [2] for discrete memoryless source with a fidelity criterion.
  • ZHU Yuefei
    Journal of Systems Science and Complexity. 1998, 11(2): 175-180.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    In this paper, we discuss the counting of translation equivalellce classes of linear recurrence sequences over Z_{a^p}. For more general linear recurrence relation, we count the number of translation equivalent classes of linear recurrence sequences, and the number of all sequences in every equivalence class.
  • WU Wenda;HUANG Yuzhen
    Journal of Systems Science and Complexity. 1998, 11(2): 181-183.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    The forward analysis of a Florida platform is presented. The degree of the resulting polynomial is studied in detail. The computation is carried out using computer algebra system MAPLE V.
  • WANG Enping
    Journal of Systems Science and Complexity. 1998, 11(2): 184-192.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    In this paper we study the robust stabilization problems of systems with numeratoral factor perturbations, and give a necessary and sufficient condition for the existence of robust stabilization controller. The maximal permitted perturbation radius is derived of the nominal system with the form of G=\tilde{M}^{-1}\tilde{N}\in R L_\infty. Lastly the statespace solution of the parametrized formula of the controller is obtained, through solving the sub-optimal Nehari's problem.