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

2006年, 第19卷, 第3期 刊出日期:2006-09-20
  

  • 全选
    |
    论文
  • Zhenya Yan
    Journal of Systems Science and Complexity. 2006, 19(3): 301-306.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    In this paper, an isospectral problem with five potentials is investigated in loop algebra $\tilde{A}_2$ such that a new hierarchy of evolution equations with five arbitrary functions is obtained. And then by fixing the five arbitrary functions to be certain functions and using the trace identity, the generalized Hamiltonian structure of
    the hierarchy of evolution equations is given. It is shown that this hierarchy of equations is Liouville integrable. Finally some special cases of the isospectral problem
    are also given.
  • Deepak Kapur
    Journal of Systems Science and Complexity. 2006, 19(3): 307-330.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    A method using quantifier-elimination is proposed for automatically generating program invariants/inductive assertions. Given a program, inductive assertions, hypothesized as {\it parameterized} formulas in a theory, are associated with program locations. Parameters in inductive assertions are discovered by generating constraints on parameters by ensuring that an inductive assertion is indeed preserved by all execution paths leading to the associated location of the program. The method can be used to discover loop invariants--properties of variables that remain invariant at the entry of a loop. The parameterized formula can be successively refined by considering execution paths one by one; heuristics can be developed for determining the order in which the paths are considered. Initialization of program variables as well
    as the precondition and postcondition, if available, can also be used to further refine the hypothesized invariant. The method does not depend on the availability of the precondition and postcondition of a program. Constraints on parameters generated in this way are solved for possible values of parameters. If no solution is possible, this means that an invariant of the hypothesized form is not likely to exist for the loop under the assumptions/approximations made to generate the associated verification condition. Otherwise, if the parametric constraints are solvable, then under certain conditions on methods for generating these constraints, the strongest possible invariant of the hypothesized form can be generated from most general solutions
    of the parametric constraints. The approach is illustrated using the logical languages of conjunction of polynomial equations as well as Presburger arithmetic for expressing
    assertions.
  • Jia LI;Xiaoshan GAO
    Journal of Systems Science and Complexity. 2006, 19(3): 331-339.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    We give a proper reparametrization theorem for a set of rational parametric equations which is proper for all but one of its parameters. We also give an algorithm to determine whether a set of rational parametric equations belongs to this class, and if it does, we reparametrize it such that the new parametric
    equations are proper.
  • Kin Keung Lai;Jun Ma;Shouyang Wang
    Journal of Systems Science and Complexity. 2006, 19(3): 340-351.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    This paper studies one managerial decision problem of the auction sites: how to combine penalties with commissions? It is shown that when there exists secondary auction market, the auction whose penalty is a linear function of the seller's commission will be more efficient than the auction with only commissions but no penalties. It has also been proven that using this strategy can maximize the
    expected revenue for the seller, the auction site and their total expected revenues.
  • Ziming Li;Dabin Zheng
    Journal of Systems Science and Complexity. 2006, 19(3): 352-364.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    Let $F=\bC(x_1,x_2, \cdots, x_\ell, x_{\ell+1}, \cdots,
    x_m)$, where $x_1,x_2, \cdots, x_\ell$ are differential variables,
    and $x_{\ell+1}, \cdots, x_m$ are shift variables. We show that a
    hyperexponential function, which is algebraic over $F$, is of form
    \[
    g(x_1,x_2, \cdots, x_m) q(x_1,x_2, \cdots, x_\ell)^\frac{1}{t}
    \om_{\ell+1}^{x_{\ell+1}} \cdots \om_m^{x_m},
    \]
    where $g \in F$, $q \in \bC(x_1,x_2, \cdots, x_\ell)$, $t \in
    \bZ^+$ and $\om_{\ell+1}, \cdots, \om_m$ are roots of unity.
    Furthermore, we present an algorithm for determining whether a
    hyperexponential function is algebraic over $F$.
  • Jian Zhang
    Journal of Systems Science and Complexity. 2006, 19(3): 365-385.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    The principal component analysis (PCA) is one of the most celebrated methods in analysing multivariate data. An effort of extending PCA is projection pursuit (PP), a more general class of dimension-reduction techniques. However, the application o f this extended procedure is often hampered by its complexity in computation and by lack of some appropriate theory. In this paper, by use of the empirical processes we established a large sample theory for the robust PP estimators of the principal components and dispersion matrix.
  • Lincheng Zhao;Chaofeng Kou;Yaohua Wu
    Journal of Systems Science and Complexity. 2006, 19(3): 386-392.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    This paper is concerned with the estimation of change-point in a binary response model with the assumption that the conditional median of the error term, given the explanatory variable, is zero. We construct an estimation of change-point based on the maximum score function and give its exponential convergence rate under some mild conditions.
  • Helong Liu;Jingyuan Yu;Guangtian Zhu
    Journal of Systems Science and Complexity. 2006, 19(3): 393-402.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    We study the application of a pulse vaccination strategy to eradicate the slowly progressing diseases that have infectiousness in latent period. We derive the condition in which eradication solution is a global attractor, this condition depends on pulse vaccination proportion $p$. We also obtain the condition of the global asymptotic stability of the solution. The condition shows that large enough pulse vaccination proportion and relatively small interpulse time lead to the eradication of the diseases. Moreover the results of the theoretical study might be instructive to the epidemiology of HIV.
  • Jianlin Zhang
    Journal of Systems Science and Complexity. 2006, 19(3): 403-408.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    We study two-weight norm inequality for imaginary powers of
    a Laplace operator in $\rn$, $n\geq 1$, especially from weighted
    Lebesgue space $L^p_\nu(\rn)$ to weighted Lebesgue space
    $L^p_\mu(\rn)$, where $1<p<\infty$. We prove that the two-weighted
    norm inequality holds whenever for some $t>1$, $(\mu^t,\nu^t)\in
    A_p$, or if $(\mu,\nu)\in A_p$, where $\mu$ and
    $\nu^{-{{1}\over{p-1}}}$ satisfy the growth condition and reverse
    doubling property.
  • Jiaqi Mo;Yihua Lin;Hui Wang
    Journal of Systems Science and Complexity. 2006, 19(3): 409-413.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    A coupled system of sea-air oscillator model is studied. Using the perturbed theory, the approximations of the solution for the sea-air oscillator model are obtained.
  • Xueqing Zhang;Shigeng Hu;Haijun Wang
    Journal of Systems Science and Complexity. 2006, 19(3): 414-422.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    Pollution is introduced into the utility function and the productive function in this paper. Under appropriate macroeconomic equilibrium conditions, this paper proves that the equilibrium levels of the main economic indexes are uniquely determined by the model parameters. This paper establishes the following alternative theorem: some factors affect the economic growth and the welfare in opposite way.
  • Qian Liu;Changyu Wang;Xinmin Yang
    Journal of Systems Science and Complexity. 2006, 19(3): 423-430.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    For unconstrained optimization, a new hybrid projection algorithm is presented in the paper. This algorithm has some attractive convergence properties. onvergence theory can be obtained under the condition that $\nabla f(x)$ is uniformly continuous. If $\nabla f(x)$ is continuously differentiable pseudo-convex, the whole sequence of iterates converges to a solution of the problem without any other
    assumptions. Furthermore, under appropriate conditions one shows that the sequence of iterates has a cluster-point if and only if ${\it \Omega} ^*\neq\emptyset$. Numerical examples are given at the end of this paper.
  • Cuixia Miao;Yuzhong Zhang
    Journal of Systems Science and Complexity. 2006, 19(3): 431-435.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    In this paper, we consider the on-line scheduling of unit time jobs with rejection on $m$ identical parallel machines. The objective is to minimize the total completion time of the accepted jobs plus the total penalty of the rejected jobs. We give an
    on-line algorithm for the problem with competitive ratio $\frac{1}{2}(2+\sqrt{3})\approx{1.86602}$.
  • Xi Liu;Qingling Zhang;Lichun Zhao
    Journal of Systems Science and Complexity. 2006, 19(3): 436-440.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    The stabilization problem of a kind of prey-predator model with Holling functional response is investigated. By approximate linearization approach, a feedback control law stabilizing the closed-loop system is obtained. On the other hand, by exact
    linearization approach, a suitable change of coordinates in the state space and a feedback control law render the complex nonlinear system to be a linear controllable one such that the positive equilibrium point of the closed-loop system is globally asymptotically stable.
  • Erling Wei;Yanpei Liu
    Journal of Systems Science and Complexity. 2006, 19(3): 441-446.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    In 1990, Bondy posed the small circuit double cover (SCDC) conjecture: Every $2$-connected graph has a circuit double cover (CDC) with the number of circuits less than $|V|$ (the order of the vertex set $V$). The strong embedding conjecture states that every $2$-connected graph has a strong embedding on some surface
    in which the boundary of each face is a circuit. In this paper, HP-graph is defined as the graph which has a strong embedding on the projective plane with one face of valence $|V|$ and the other faces of valence $3$. And it is proved that the HP-graph has a strong embedding with $|V| -1$ or less faces on some surface, which confirms both the SCDC conjecture and the strong embedding conjecture.