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

1990年, 第3卷, 第2期 刊出日期:1990-05-15
  

  • 全选
    |
    论文
  • Kan Jiahai
    Journal of Systems Science and Complexity. 1990, 3(2): 97-101.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    The lower bounds for any R(l_1,…,l_q;r) are investigated. Let K_n~r be the completer-uniform hypergraph on n points. Define R(l_1,…,l_q;r) as the minimal natural number n so that if the edges of K_n~r are q-colored, there is a set S of l_i(i∈{1,…,q})vertices such that alledges on S are of the i-th color. For the special case of q=r=2,the lower bounds were got by P.Erd\"{o}s and J.Spencer. In this paper, we shall give the lower bounds for any R(l_1,…,l_q;r).
  • Song Degong;Wang Miansen;Zhu Guangtian
    Journal of Systems Science and Complexity. 1990, 3(2): 102-125.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    In this paper, the time-dependent neutron transport integro-differential equation in a nonuniform slab with generalized boundary conditions and initial value is considered for general cases concerned with an arbitrary nonhomogeneous medium possibly with cavity, withthe an isotropic scattering and fission, and with continuous energy varying from null to any finite constant or from one positive constant to another positive constant. We prove that the correspon-ding neutron transport operator A has finite Spectrum points in any strip {λ|β_1≤Reλ≤β_2} where β_2>β1>-λ~* (λ~* is the essential infimum of v∑(x,v)), and obtain the asymptotic expansion of the time-dependent solution which exists and is unique. Furthermore, we give the existence of the dominant eigenvalue and indicate the asymptotic behavior of the neutron density as t→+∞.
  • Lin Yanping
    Journal of Systems Science and Complexity. 1990, 3(2): 126-135.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    In this paper we study Galerkin approximations to the solution of the nonlinear Sobolev equation c(u)u_t=▽·{a(u)▽u_t+b(u)▽u}+f(u) in two spatial dimensions and derive optimal L~2 error estimates for the continuous-time, Crank-Nicolson and extrapolated Crank-Nicolson discrete-time approximations.
  • Zhang Zhaozhi;Yang Yixian
    Journal of Systems Science and Complexity. 1990, 3(2): 136-142.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    Let \underline{S}=(S,S,…) be a binary random sequence with period N=2~n, where S=(S_0,…,S_(N-1)) is its one period with N independent and uniformly distributed binary random variables. The main results of this paper are as follows. 1)Var c(\underline{S})=2-(2N+1)2~(-N)-2~(-2N);2)E|c(\underline{S})-c(\underline{S}+\underline{b})|=[2~(c(\underline{b})+1)-2]2~(-N)for any sequence \underline{b} with period 2~n;3)N-1+2~(-N)-(n/2+1-2~(-(N-n)))≤E[\[min_{W(b)\le 1}\]c(\underline{S}+\underline{b})]≤N-1+2~(-N)4)2-2~(-(N-1))≤E[\[min_{W(b)\le 1}\|c(\underline{S})-c(\underline{S}+\underline{b})|]≤2-2~(-N)+n/2-2~(-(N-n)), where E and Var stand for taking expectation and variance respectively, c(\underline{b}) is the linearcomplexity of the sequence \underline{b} and W(b) the Hamming weight of one period of the seqnence \underline{b}.
  • Zheng Zuohuan
    Journal of Systems Science and Complexity. 1990, 3(2): 143-150.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    In this paper, the Josephson equation and its autonomous case are considered. It is shown that for |α|<1 and β>γ>1 or β<γ<-1, there is no periodic solution of the autonomous Josephson equation, For the nonautonomous case, some suffcient conditions for the existence of periodic solutions are given.
  • Wu Chuanyi
    Journal of Systems Science and Complexity. 1990, 3(2): 151-159.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    In this paper, we discuss the regular exponential family(REF), a natural exponentialfamily with minimum dimension and with the mean function m=E_θX taken as a new parameter. We point out the importance of the REF with polynomial variance function(PVF-REF). When m is a single factor of PVF and the left end of its defined domain is zero, the corresponding REF is givenas the single-side lattice distribution family; other PVF-REFs can be obtained by a limit process. As an illustration, the results for all seven cases of polynomial variance functions of third degreeare given.
  • Li Liming;Jiang Jinghong
    Journal of Systems Science and Complexity. 1990, 3(2): 160-165.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    The objective of the paper is to derive new simple criteria for the stability of a linear non-autonomous delay system by using a difference-differential inequality.
  • Gao Hongzhu
    Journal of Systems Science and Complexity. 1990, 3(2): 166-171.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    Let N be a closed, orientable 4-manifold satisfying H_1(N,Z)=0, and M be a closed, connected, nonorientable surface embedded in N with normal bundle v. The Euler class e(v) of v is an element of H_2(M,\mathcal{X}), where \mathcal{X} denotes the twisted integer coefficients determined by w_1(v)=w_1(M). We study the possible values of e(v)[M], and prove H_1(N-M)=Z_2 or 0. Under the condition of H_1(N-M,Z)=Z_2, we conclude that e(v)[M]can only take the following values: 2σ(N)-2(n+β_2),2σ(N)-2(n+β_2-2),2σ(N)-2(n+β_2-4),…,2σ(N)+2(n+β_2), where σ(N) is the usual index of N, n the nonorientable genus of M and β_2 the 2nd real Bettinumber. Finally, we show that these values can be actually attained by appropriate embedding for N=homological sphere. In the case of N=S~4. this is just the well-known Whitney conjecture proved by W.S.Massey in 1969.
  • Zhou Fangjun
    Journal of Systems Science and Complexity. 1990, 3(2): 172-182.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    In this paper, we give the calculation formulae and some properties of symmetric andskew-symmetric procrustes statistics and related transformation matrices. We use the procrustes statistic to provide an overall picture of the response of the classical scaling method to small errors by making expansions in powers of the error term, and retaining the lowest non-cancelling power. A perturbation theory for this is worked out, and is shown to lead to a distribution theory.
  • Le Maohua;Li Weixuan;Edward T.Wang
    Journal of Systems Science and Complexity. 1990, 3(2): 183-192.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    A generalization of the well-known n-queen problem is to put N×k‘queens’on an k×n chessboard in such a way that each row and each column contains exactly k‘queens’and each diagonal with length from 1 to n and slope either 1 or -1 contains at most k‘queens’. Aconstruction is given to show that this is always possible whenever n≥4 and n≥k≥1.