一种工程软件可靠性评估方法

本文在分析多种软件可靠性模型的基础上，提出一种综合“Ｎａｓｌｏｎ模型”与“硬－软件复合系统结构模型”二者优点的软件可靠性评估方法，本方法简单，可行，对其它领域的软件可靠性评估有一定参考价值。     

网络流在清理三角债问题中的应用

本文把清理三角债中两种优化数学模型问题，化成求解相应网络上最小费用流的问题，从而得到（强）多项式算法，并把另外的一种优化数学模型问题。化成线性规划问题.于是解答了文[3]中提出的清理三角债的三个基本问题．     

与两个更新过程有关的某些联合分布

本文讨论的两个时偶问题涉及来一个泊松过程与一个更新过程穿越时间和更新数的联合分布．利用向量马氏过程方法得到了这些联合分布的变换，给出了一个与分布均值有关量的数值结果．     

多项式的最大公因式的一种新求法

本文介绍了一种利用数域上矩阵的初等行变换求一组一元ｎ次多项式的最大公因式的方法．     

Polynomial continuity on

A mapping between Banach spaces is said to be polynomially continuous if its restriction to any bounded set is uniformly continuous for the weak polynomial topology. A Banach space has property (RP) if given two bounded sequences , we have that for every polynomial on whenever for every polynomial on ; i.e., the restriction of every polynomial on to each bounded set is uniformly sequentially continuous for the weak polynomial topology. We show that property (RP) does not imply that every scalar valued polynomial on must be polynomially continuous.

     

Factorisation in the ring of exponential polynomials

We study factorisation in the ring of exponential polynomials and provide a proof of Ritt's factorisation theorem in modern notation and so generalised as to deal with polynomial coefficients as well as with several variables. We do this in the more general context of a group ring of a divisible torsion-free ordered abelian group over a unique factorisation domain.

     

Classification problems for shifts on modules over a principal ideal domain

In this paper we study symbolic dynamics over alphabets which are modules over a principal ideal domain, considering topological shifts which are also submodules. Our main result is the classification, up to algebraic and topological conjugacy, of the torsion-free, transitive, finite memory shifts.

     

The Expected Number of Local Maxima of a Random Algebraic Polynomial

In this work we obtain an asymptotic estimate for the expected number of maxima of the random algebraic polynomial , where a _j (j=0, 1,...,n–1) are independent, normally distributed random variables with mean and variance one. It is shown that for nonzero , the expected number of maxima is asymptotic to log n, when n is large.     

Tractable Partially Ordered Sets Derived from Root Systems and Biased Graphs

We study new posets Q obtained by removing from a geometric lattice L ofa biased graph certain flats indexed by a simplicial complex . (One example of L is the lattice of flats of thevector matroid of a root system B _n .) We study the structureand compute the characteristic polynomial of Q. With certainchoices of L and , including ones for which Q is alattice interpolating between those of B _n and D _n , we observe curious relationships among the roots of thecharacteristic polynomials of Q, L, and .