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

1992年, 第5卷, 第1期 刊出日期:1992-02-15
  

  • 全选
    |
    论文
  • Andrew L.Rukhin
    Journal of Systems Science and Complexity. 1992, 5(1): 1-008.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    Inadmissibility of a traditional class of noncentrality parameter estimators under quadratic loss is established. The result is heuristically motivatedby the form of generalized Bayes estimators and is proved via unbiased estimators of the risk function and a solution to an integro-differential inequality.
  • LI Shizheng
    Journal of Systems Science and Complexity. 1992, 5(1): 9-018.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    In this paper we characterize the proper efficient solution of a multiobjective programming problem (P) in terms of the saddle point criterion of a new problem(S)and establish a pair of dual problems (S_α) and (D_α) in order todecide the proper efficient solution by the strong duality. We also give method of characterization in terms of the saddle point criterion of(P). Finally, we prove that every efficient solution of the matrix linear programming problem is a proper efficient solution.
  • K.W.Chen;ZHENG Zhongguo
    Journal of Systems Science and Complexity. 1992, 5(1): 19-026.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    In this paper we develop tests using L-statistic for constant relative failure rate against monotone relative failure rate. Scale invariance, monotonepower and locally asymptotic power results are obtained. Some examples are presented.
  • YANG Junhui;DAI Zongduo;ZENG Kencheng
    Journal of Systems Science and Complexity. 1992, 5(1): 27-032.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    The so-called selected permutations on the set of the first 16 non-negative integers are classified under the action of a certain motion group. A data-base consisted of the class representatives has been provided.
  • SHI Jun
    Journal of Systems Science and Complexity. 1992, 5(1): 33-041.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    For a class of non-smooth Fredholm integral equations we prove that Richardson extrapolation method can be used to increase accuracy for finite element methods. On the basis of local refinement mesh, a superconvergence result is shown. Our theory also covers a class of non-smooth Wiener-Hopf equations and an application includes the calculation in certain linear elastic fracture problems.
  • HUANG Lin;WANG Long;Hollot;C.V.
    Journal of Systems Science and Complexity. 1992, 5(1): 42-054.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    Complex polynomials are of significance in engineering applications. This paper addresses the robust stability of such polynomials. We first systematically discuss the alternative pair of polynomials and obtain some fundamental results. The geometric characterizations of the family of stable complex polynomials are investigated. Some connections with Sturm chains and conditions for theconvex combination of polynomials to be aperiodic are established.
  • HONG Shengyan
    Journal of Systems Science and Complexity. 1992, 5(1): 55-069.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    Let (X,Y) be a pair of R~d×R~1-valued random variables. In thispaper we investigate the asymptotic properties of the L_1-norm kernel estimator of the conditional median function of Y on X. Under appropriate regularity conditions, asymptotic normality and the optimal rates of convergence n~((-1)/(2+d)) and (n~(-1)log n)~(1/(2+d)) in the L~q(1\le q<∞)-and L~∞-norms restricted to a compactset, respectively, are obtained. Our study shows that this estimator and the well-known Nadaraya-Watson's kernel estimator of the conditional mean function of Yon X have the same asymptotic properties.
  • LIN Dongdai;LIU Mulan
    Journal of Systems Science and Complexity. 1992, 5(1): 70-080.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    In this paper, we present an algorithm to find a shortest linear recurring relation generating a given finite array.
  • TIAN Feng
    Journal of Systems Science and Complexity. 1992, 5(1): 81-083.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    We prove that if G is a graph of order n and connectivity k, and there exists some t,t\le k, such that for every independent set S={x_0,x_1,…x_t} of cardinality t+1, we have sum from i=0 to t |N(S/{x_i}|>t(n-1), then G is Hamiltonian.
  • WANG Yuntong
    Journal of Systems Science and Complexity. 1992, 5(1): 84-96.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    Ioffe's approximate subdifferentials are reviewed and some of his results are generalized. An extension of the calculus of the approximate subdifferentials for the sums to any finite number of functions is provided along with a generalization of the Dubovitzkii-Milyutin theorem. The presentation also indicates some of the limitations of nonsmooth analysis and optimization. Restriction to the class of function which is suitable for most of the purposes in nonsmooth optimization is suggested.