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

1994年, 第7卷, 第3期 刊出日期:1994-07-15
  

  • 全选
    |
    论文
  • WU Wen jun(WU Wen-tsun)
    Journal of Systems Science and Complexity. 1994, 7(3): 193-200.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    Consider the problem of optimizing a polynomial f(X) for X=(x_1,...,x_n) in a closed rectangular-form domain D of the real Euclidean space Rn(X) under constraint polynomial equations HS=0, where HS = {h_1,..,h_r}\subset R[X]. Applying some modified form of Zero Decomposition Theorem to the HS we get in an algorithmic way a finite set of real values K= Keg(f, D, HS) such that the least or greatest value of K is just the least or greatest value of f to be determined. Numerous problems involving inequalities can be settled by means of the above finiteness theorem.
  • YUAN Xueming
    Journal of Systems Science and Complexity. 1994, 7(3): 201-210.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    The two-stage tandem queueing system M^(x)/M/c→o M^(r) / PH/1/n/K_1/K_2 is studied in this paper consisting of the stage-I service system and the stage-II service system. There are two trees of customers. Type-1 customers arrive at the stage-I service system in batches according to a Poisson process with the batch sizes being r.v.'s ranging over finite positive integers. Type-2 customers arrive at the stage-II service system in batches according to another Poisson process with the batch sizes being a positive integer.The stage-II service system has a finite capacity. One type-1 customer in the stage-II service system, which has been served by the stage-I server, must match n take-2 customers. The type-1 customer and the n type-2 customers are served together as a bulk in the stage-II service system. Only after being served by the stage-II server, can the two type customers depart from the whole system. The Q-matrix of the system state process is obtained, two sufficient-necessary conditions for the system stability are presented, the distribution of ststionary queue length and its algorithms are derived out.
  • LIU Baoding;GU Jifa
    Journal of Systems Science and Complexity. 1994, 7(3): 211-219.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    In this paper, we consider a dynamic inventory system with varying stochastic demands under the probability criterion which is to minimize the sum of all probabilities that the inventory at the end of each stage exceeds a fixed level. The demands are assumed to be nonnegative and independent, and not necessarily identically distributed, stochastic variables with unimodal densities subjected to a certain condition. When the delivery is immediate and the excess demands are backlogged completely, it is shown that the optimal order policy is simply characterized by a certain critical number.
  • FAN Hongbing
    Journal of Systems Science and Complexity. 1994, 7(3): 218-222.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    The object of this series of papers is to show that every planar graph of minimum degree at least 3 is edge reconstructible. In this paper we show that each 3-connected planar graph of minimum degree 3 and with at least one of its 3-vertex deleted subgraphs being not 3-connected, is edge reconstructible. This is the last theorem concerning the assertion that planar graphs with minimum degree at least 3 are edge reconstructible.
  • LI Shurong
    Journal of Systems Science and Complexity. 1994, 7(3): 223-228.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    This paper provides some applications of Wu-Ritt's elimination method in nonlinear control theory.
  • LIANG Hua;CHENG Ping
    Journal of Systems Science and Complexity. 1994, 7(3): 229-240.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    In this paper, authors consider Bahadur asymptotic efficiency of MLE {\bar β}_{ML} of β, which is an unknown parameter vector in the semiparametric regression model Y_i=X_i~T β + g(T_i) + i, where g is an unknown Holder continuous function, i is a random error with density function (.), X_i is a known vector in R_k, T_i is a random variable in [0, 1]with density function T(t).
  • HU Shuhe
    Journal of Systems Science and Complexity. 1994, 7(3): 241-249.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    Let {(X_n, Y_n} be a -mixing sequence. On the basis of (X_1, Y_1 ),... ,(X_n, Y_n),E(β(Y)|X = x) is estimated by kernel estimators, approved kernel estimators and random window width estboators. Under suitable assumptions, we obtain weak and strong cousistency for these estimators. The class of applicable kernels includes those having unbounded support.
  • WANG Liancheng;DONG Jiali;LIU Qinghuai
    Journal of Systems Science and Complexity. 1994, 7(3): 250-255.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    In this paper, a separation theorem is established firstly. Applying this theorem the relationships between the solutions of a series of inequality systems are discussed. Then a necessary optimality condition without distance function is obtained under a new constraint qualification for a multiobjective programming in which all the objective functions and constraint functions are Lipschitz. Finally sufficient conditions are studied.
  • WU Jianhua;LI Yanling
    Journal of Systems Science and Complexity. 1994, 7(3): 256-260.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    By means of the perturbation theorem of simple eigenvalue of linear operator and the stability theorem of bifurcation solutions, we discuss one of the open questions pointed out in [1], and prove that the coexisting steady-state solutions obtained in [1] are stable under suitable conditions.
  • WANG Changyu;ZHAO Fuan
    Journal of Systems Science and Complexity. 1994, 7(3): 261-269.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    In [1] we proved a general result on the directional derivative of optimal value functions in mathematical programming problems. In this paper, we prove, in addition to the general theorem, several other important results. The key applications of the theorems include the convergence properties for gradient projection methods and the property for exact penalty function.
  • SHI Peide
    Journal of Systems Science and Complexity. 1994, 7(3): 270-281.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    This paper deals with M-estimators for a semiparametric regression model Y=X^tβ_0 + g_0(T) + e,where Y is real-valued, T ranges over a nondegenerate compact interval, X ∈R^d, e is a random error, β_0 is a d-vector of parameters to be estimated, and go is an unknown smooth function whose mth derivative function satisfies a Holder condition with exponent γ∈(0, 1]. A B-spline is taken to approximate g_0, the M - estimators of β and go are defined, and their convergence rates are investigated. A Monte Carlo study is carried out. It is shown that when the random errors are normally distributed the M-estimators are as good as least square esthoators; however, when the random errors are drawn from a symmetrically contaminated normal distribution the M-estimators are superior to least square estmators; and when the random errors are distributed as Cauchy distribution the M-edimators seem acceptable but the least Square estimtors behave poorly. It is proved that the B-spline M-estimators of g_0 attain the convergence rate as that of the optimal global rate of convergence for nonparametric regression, and the M-estimators of β_0 attain the convergence rate n-1/2 under some conditions.
  • LIN Yixun
    Journal of Systems Science and Complexity. 1994, 7(3): 282-288.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    The cyclic bandwidth problem for a graph G is to label its n venices by the elements of the additive group (Z_n,\oplus) of integers modulo n so that the quantity max{d(f(u), f(v)): (u,v) ∈E(G)} is minimized, where f(v) is the label of v∈ V(G) and d(x, y)= min{x\oplus(n - y), y \oplus(n - x)} represents the distance of x,y ∈ Z_n. This paper describes the background of this labelling problem, some basic properties, and the computational complexity. In particular, a local density lower bound for trees and several exact results for special graphs are presented.