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

2007年, 第20卷, 第4期 刊出日期:2007-12-20
  

  • 全选
    |
    论文
  • Yanshuo ZHANG;Zhuojun LIU
    Journal of Systems Science and Complexity. 2007, 20(4): 481-485. https://doi.org/1
    摘要 ( ) PDF全文 ( )   可视化   收藏
    A secret sharing scheme permits a secret to be shared among participants in such a way that only qualified subsets of participants can recover the secret. Secret sharing is useful in management of cryptographic keys. Based on identity, we analyze the secret sharing scheme among weighted participants. Then we present a dynamic scheme about secret sharing among weighted participants. At last, we analyze the secret sharing scheme among weighted participants, which can make all weighted participants verifiable and dynamic.
  • Zhaozhi ZHANG;Nan JIANG
    Journal of Systems Science and Complexity. 2007, 20(4): 486-491.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    Most cipher systems designed thus far are binary-valued or integer-valued cipher systems. Their security relies on the assumption that one-way functions exist. Though the existence of one-way functions has not been proved yet, most cryptographic researchers believe that one-way functions exist. In addition, many candidates for one-way functions have been proposed.Therefore, the key step for developing real-valued cipher systems is to define real one-way functions and to propose candidates for them. In this paper, based on computational complexity theory over the real field, we give two definitions of real one-way functions; one is for digital one-way functions and the other is for general one-way functions. Candidates for these two classes of one-way functions are also proposed. Moreover, we present two examples to demonstrate that the candidates for both digital one-way functions and general one-way functions can be applied to construct secure real-valued cipher systems.
  • Yimin SUN;Shengwei MEI;Qiang LU
    Journal of Systems Science and Complexity. 2007, 20(4): 492-500.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    In this paper, we investigate the global controllability of a class of $n$-dimensional affine nonlinear systems with $n-1$ controls and constant control matrix. A necessary and sufficient condition for its global controllability has been obtained by
    using the methods recently developed. Furthermore, we generalize the above result to a class of affine nonlinear systems with a block-triangular-like structure. Finally, we will give three examples to show the applications of our results.
  • S. K. MISHRA;Shouyang WANG;K. K. LAI
    Journal of Systems Science and Complexity. 2007, 20(4): 501-508.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    Minimax programming problems involving generalized $\left({p\,,\,r} \right)$-invex functions are considered. Parametric sufficient optimality conditions and duality results are established under the aforesaid assumptions on the objective and constraint functions.
  • Jinhong YOU;Shangyu XIE;Yong ZHOU
    Journal of Systems Science and Complexity. 2007, 20(4): 509-520.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    This paper is concerned with the estimating problem of seemingly unrelated (SU) nonparametric regression models. The authors propose a new method to estimate the unknown functions, which is an extension of the two-stage procedure in the longitudinal data framework. The authors show the resulted estimators are asymptotically normal and more efficient than those based on only the individual regression equation. Some simulation studies are given in support of the asymptotic results. A real data from an ongoing environmental epidemiologic study are used to illustrate the proposed procedure.
  • Shaobo ZHOU;Shigeng HU
    Journal of Systems Science and Complexity. 2007, 20(4): 521-528.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    In the paper, we investigate the stability of a two-sector economic growth model under stochastic case. A two-dimensional stochastic differential system is deduced by Ito's formula, by using Lyapunov function methods, whether the growth rates of physical capital and human capital are exponentially stable or unstable depends on the values for parameters. Finally, we also illustrate the results with two examples.
  • Zhigang CAO;Yuzhong ZHANG
    Journal of Systems Science and Complexity. 2007, 20(4): 529-535.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    In this paper, we address the scheduling problem with rejection and non-identical job arrivals, in which we may choose not to process certain jobs and each rejected job incurs a penalty. Our goal is to minimize the sum of the total penalties of
    the rejected jobs and the maximum completion time of the processed ones. For the off-line variant, we prove its NP-hardness and present a PTAS, and for the on-line special case with two job arrivals, we design a best possible algorithm with competitive ratio $\frac{(\sqrt{5}+1)}{2}$.
  • Dongyang SHI;Hui LIANG;Caixia WANG
    Journal of Systems Science and Complexity. 2007, 20(4): 536-544.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    The class of anisotropic meshes we conceived abandons the regular assumption. Some distinct properties of Carey's element are used to deal with the superconvergence for a class of two-dimensional second-order elliptic boundary value problems on anisotropic meshes. The optimal results are obtained and numerical examples are given to confirm our theoretical analysis.
  • Weiping BI
    Journal of Systems Science and Complexity. 2007, 20(4): 545-553.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    This paper studies the robust $H_\infty$ disturbance attenuation with internal stability for uncertain nonlinear control systems. By adding one power integrator technique, this paper designs a explicit smooth robust dynamic feedback law while rejecting the disturbance to any specified degree of accuracy. Further, the example and simulation results show the effectiveness of the proposed schemes.
  • Junying PEI;Xuejun ZHANG
    Journal of Systems Science and Complexity. 2007, 20(4): 554-561.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    This paper discusses the enumeration of 1-generator quasi-cyclic codes and describes an algorithm which will obtain one, and only one, generator for each 1-generator quasi-cyclic code.
  • Yinghui TANG
    Journal of Systems Science and Complexity. 2007, 20(4): 562-571.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    This paper studies the transient departure process of $M^x/G/1$ queueing system with single server vacation. We present a simple probability decomposition method to derive the expected number of departures occurring in finite time interval from any initial state and the asymptotic expansion of the expected number. Especially, we derive some more practical results for some special cases.
  • Rendao YE;Songgui WANG
    Journal of Systems Science and Complexity. 2007, 20(4): 572-584.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    Various random models with balanced data that are relevant for analyzing practical test data are described, along with several hypothesis testing and interval estimation problems concerning variance components. In this paper, we mainly consider these problems in general random effect model with balanced data.
    Exact tests and confidence intervals for a single variance component corresponding to random effect are developed by using generalized \textit{p}-values and generalized confidence intervals. The resulting procedures are easy to compute and are applicable to small samples. Exact tests and confidence intervals are also established for comparing the random-effects variance components and the sum of random-effects variance components in two independent general random effect models with balanced data. Furthermore, we investigate the statistical properties of the resulting tests. Finally, some simulation results on the type I error probability and power of the proposed test are reported. The simulation results indicate that exact test is extremely satisfactory for controlling type I error probability.
  • Jing LI;Yuda HU
    Journal of Systems Science and Complexity. 2007, 20(4): 585-591.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    The joint efficient ordering method is a fundamental method of ordering alternatives in group multi-objective programming problems. In this paper, the rational properties of the joint efficient mapping corresponding to the joint efficient ordering
    method are studied, and some necessary conditions of this mapping are proven.
  • Xianzhao ZHANG;Yuzhong ZHANG;Zhigang CAO;Zengxia CAI
    Journal of Systems Science and Complexity. 2007, 20(4): 592-600.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    In this paper we study the problem of scheduling a batching machine with nonidentical job sizes. The jobs arrive simultaneously and have unit processing time. The goal is to minimize the total completion times. Having shown that the
    problem is NP-hard, we put forward three approximation schemes with worst case ratio 4, 2, and $\frac 3 2$, respectively.
  • Yujuan HUANG;Tianming WANG
    Journal of Systems Science and Complexity. 2007, 20(4): 601-609.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    In this paper, the following are introduced briefly: the basic concept of $q$-proper-hypergeometric; an algorithmic proof theory for $q$-proper-hypergeometric identities; and elimination in the non-commutative Weyl algebra. We give an
    algorithm for proving the single-variable $q$-proper-hypergeometric identities that is based on Zeilberger's approach and the elimination in Weyl algebra.
    Finally, we test several examples that have been proven by D. Zeilberger and H. Wilf using the WZ-pair method and Gosper algorithm.
  • Jinwang LIU;Dongmei LI;Xiaosong CHEN
    Journal of Systems Science and Complexity. 2007, 20(4): 610-613.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    Polynomial composition is the operation of replacing variables in a polynomial with other polynomials. $\lambda$-Grobner basis is an especial Grobner basis. The main problem in the paper is: when does composition commute with $\lambda$-Grobner basis computation? We shall answer better the above question. This has a natural application in the computation of $\lambda$-Grobner bases.
  • Huixian WU;Hezhi LUO
    Journal of Systems Science and Complexity. 2007, 20(4): 614-622.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    Recently, various concepts of $D$-$\eta$-properly prequasi-invex functions were introduced and characterizations of $D$-$\eta$-properly prequasi-invex functions were presented under a certain set of conditions. In this paper, we show that the same results can be obtained under weaker assumptions.
  • Baohuai SHENG
    Journal of Systems Science and Complexity. 2007, 20(4): 623-638.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    In this paper, we investigate the order of approximation by reproducing kernel spaces on $(-1,1)$ in weighted $L^p$ spaces. We first restate the translation network from the view of reproducing kernel spaces and then construct a sequence of approximating operators with the help of Jacobi orthogonal polynomials, with which we establish a kind of Jackson inequality to describe the error estimate.
    Finally, The results are used to discuss an approximation problem arising from learning theory.