1994年, 第7卷, 第1期　刊出日期：1994-01-15

  

• 全选
  |

论文
• Select
  IMPROVEMENT FOR FERRO'S MINIMAX THEOREM

  CHEN Guangya

  Journal of Systems Science and Complexity. 1994, 7(1): 1-004.

  摘要 ( ) PDF全文 ( )   可视化   收藏

  This note solves an open problem, which was proposed by Ferro in [1]. Thisproblem is to derive the minimax theorem with a vector-valued function by replying the proper quasi-C-convexity with a general cone-convexity.
• Select
  BOUNDS AND CONSTRUCTION OF K-SEQUENCES

  CHEN Wende;LI Dongfeng

  Journal of Systems Science and Complexity. 1994, 7(1): 5-016.

  摘要 ( ) PDF全文 ( )   可视化   收藏

  K-sequences are generalization of B_h-sequences and sonar sequences. A number of lower bounds on the maximal element in such a sequence are given, and (h, 2, 4) K-sequences are particularly discussed. Several such sequences are given. We also show that they are optimal.
• Select
  A ROBUSTNESS ANALYSIS OF THE MUSIC AND THE MINIMUM-NORM ALGORITHMS WITH RESPECT TO CORRELMED NOISE

  JIA Peizhang

  Journal of Systems Science and Complexity. 1994, 7(1): 17-028.

  摘要 ( ) PDF全文 ( )   可视化   收藏

  A robustness analysis of the MUSIC and the MiniNorm algorithms with respect to spatially correlated noise in array processing is presented in this paper. Let the covariance matrix of correlated noise be the correlated noise introduces a bias into the direction-of-arrival estimates, producedby the two algorithms. For the else of two closely spaced sources, the influence functions of the two algorithms and the resolving power as a function of e of the two althms are derived. The results show that the above two robust performances of the MiniNorm algorithm are slightly better than those of the MUSIC algorithm, but both algorithms have poor robustness with respect to correlated noise. The analysis assumes thatthe exact covariance matrix of array element outputs is known (the infinite data case).
• Select
  ON THE SMALLEST POSSIBLE ASYMPTOTICALLY EFFICIENT VARIANCE IN SEMIPARAMETRIC MODELS

  LIANG Hua

  Journal of Systems Science and Complexity. 1994, 7(1): 29-033.

  摘要 ( ) PDF全文 ( )   可视化   收藏

  In this paper, the author gives a sufficient and necessary condition under which is the smallest possible asymptotic variance for regular estimators of β given by Schick (1986), and gives an example to explain a negative conclusion.
• Select
  ANALYSIS OF BOUNDARY SHAPE OF SOLUTIONS OF NONLINEAR PERTURBATION PROBLEM

  HE Cheng;ZHANG Weitao

  Journal of Systems Science and Complexity. 1994, 7(1): 34-039.

  摘要 ( ) PDF全文 ( )   可视化   收藏

  Using the monotone operator theory, we prove a convergent relation betweensolutions of a kind of nonlinear singular perturbation problem and their limit problem, andgive a boundary integral identity which depicts the boundary shape of the perturbation solution according to the boundary condition coincidence between the perturbation solution and the limit solution. Furthermore, we obtain a similar result when a small perturbationis added to the right hand side of equation.
• Select
  LOWER CONFIDENCE LIMIT IN CENSORED CASE

  ZHENG Zhongguo;JIN Hua

  Journal of Systems Science and Complexity. 1994, 7(1): 40-044.

  摘要 ( ) PDF全文 ( )   可视化   收藏

  In this paper, the authors consider the problem of setting a lower confidence limit of the unknown parameter of a population. The data are to be right censored, and a lower confidence limit for the unknown parameter based on the selection of fiducial distributions is introduced and the properties are discussed.
• Select
  GLOBAL ASYMPTOTIC STABILITY IN N-SPECIES COOPERATIVE SYSTEM WITH TIME DELAYS

  CUI Jing'an

  Journal of Systems Science and Complexity. 1994, 7(1): 45-048.

  摘要 ( ) PDF全文 ( )   可视化   收藏

  The following n-species cooperative system with time delaysis considered in this paper. It is shown that if the system (1) has a unique positive equilibrium point, then it is globally asymptotically stable.
• Select
  EDGE RECONSTRUCTION OF PLANAR GRAPHS WITH MINIMUM DEGREE AT LEAST THREE-(Ⅱ)

  FAN Hongbing

  Journal of Systems Science and Complexity. 1994, 7(1): 49-055.

  摘要 ( ) PDF全文 ( )   可视化   收藏

  The object of this series of papers is to show that every planar graph ofminimum degree at least 3 is edge reconstructible. In this paper, we prove that planargraphs with minimum degree 4 are edge reconstructible.
• Select
  MINIMUM PROFILE OF GRID NETWORKS

  LIN Yixun;YUAN Jinjiang

  Journal of Systems Science and Complexity. 1994, 7(1): 56-066.

  摘要 ( ) PDF全文 ( )   可视化   收藏

  In structure analysis, one wants to determine the row (column) permutation ofthe stiffness matrix A such that the non-zero elements cluster as close as possible round themain diagonal, that is, minimizing the profile of A, or the profile of the structure network. This paper presents the minimum profiles of Pm× Pn, Pm× Cn, etc.
• Select
  ASYMPTOTICS OF THE “MINIMUM L_1-NORM”ESTIMATES IN A PARTLY LINEAR MODEL

  SHI Peide;LI Guoying

  Journal of Systems Science and Complexity. 1994, 7(1): 67-077.

  摘要 ( ) PDF全文 ( )   可视化   收藏

  This paper is concerned with the L1-norm estimators for the partly linear modelwhere (T_1,X_1, Y_1),…(T_n, X_n, Y_n) are independent random(d +2)-vectors such that K_i is real-valued, X_i is a d-vector of explanatory variables, and T_i is another explanatory variable ranging over a nondegenerate compact interval; u_i is arandom error; β_0 is a d-vector of parameters; and g_0(.) is an unknown function, which is m(≥0) times continuously differentiable and its mth derivative satisfies a Holder condition with exponent γ∈(0, 1]. A piecewise polynomial is used to approximate go(.). The considered estimators of β0 and g_0(t) are respectively and satisfyingwhere is a class of piecewise polynomials of degree m. Under some mild conditions, it is shown that the underlying estimators attain the convergence rate where being a constant in Condition A4.
• Select
  CORRECTION FOR COLLOCATION SOLUTIONS OF WIENER-HOPF EQUATIONS

  SHI Jun;LIN Qun

  Journal of Systems Science and Complexity. 1994, 7(1): 78-081.

  摘要 ( ) PDF全文 ( )   可视化   收藏

  In this paper, we apply a kind of correction method to collocation solutionsof Wiener-Hopf equations and show that this method is not only a high-order method but also a self-adaptive one.
• Select
  LIMIT LAWS OF LIFETIME FOR A CONSECUTIVE K-WITHIN-M-OUT-OF-N SYSTEM

  QI Yongcheng

  Journal of Systems Science and Complexity. 1994, 7(1): 82-088.

  摘要 ( ) PDF全文 ( )   可视化   收藏

  A consecutive k-within-m-out-of-n system consists of n identical and stochastically independent components arranged on a line (or circle).The system will fail if andonly if within m consecutive components, there are at least k failures. Let Tn be the system's lifetime. We prove that only two types are possible for limit distribution of T_n.We also give the conditions under which there exist {a_n}, {b_n}, a_n > 0, b_n∈R such that(T_n - b_n)/a_n converges in distribution to the two given limit types.
• Select
  ON THE LINEAR PREDICTABILITY TEST FOR ENCIPHERING SEQUENCES

  ZENG Kencheng;DAI Zongduo;YANG Junhui

  Journal of Systems Science and Complexity. 1994, 7(1): 89-096.

  摘要 ( ) PDF全文 ( )   可视化   收藏

  Based on the concept of the so-called maximal linear prediction period introduced in the present paper, the square time linear predictability test for enciphering sequences is set up.