An upper bound and a lower bound for a0 are given such that aI+B∈M-1 for a>a0 and aI+BM-1 for a≤a0, where B is a nonnegative matrix and satisfies that for any positive constant β,βI+B is a power invariant zero pattern matrix.

In this paper, a mathematical model of competition between plasmid-bearing and plasmidfree organisms in a chemostat with an inhibitor is investigated. The model is in the form of a system of nonlinear differential equations. By using qualitative

Let J be the zero set of the gradient fx of a function f:Rn→R. Under fairly general conditions the stochastic approximation algorithm ensures d(f(xk),f(J))→0, as k→∞. First of all, the paper considers this problem: Under what conditions the

In this paper we first improve the concentration- compactness lemma by proving that the vanishing case is a special case of dichotomy, then we apply this improved concentration- compactness lemma to a typical restrcted minimization problem, and

In this paper, we consider the existence of solutions for the following equation: where g(x)≥0, g(x)0, and g(x)∈H-1(R3). We prove that there exists a constant C, if ||g(x)||H-1 ≤C, there are at least two solutions of the equation.

In this paper, we present a modified decomposition algorithm and its bundle style variant for convex programming problems with separable structure. We prove that these methods are globally and linearly convergent and discuss the application of th

When a natural number N is large enough, a weak concentration property of the N-spin SK-models is obtained for cylindrical sets.

In this paper, we study a class of simple and easy-to-construct shop schedules, known as dense schedules. We present tight bounds on the maximum deviation in makespan of dense flow-shop and job-shop schedules from their optimal ones. For dense op

Decision tree complexity is an important measure of computational complexity. A graph property is a set of graphs such that if some graph G is in the set then each isomorphic graph to G is also in the set. Let P be a graph property on n vertices,

This paper investigates several different semi-on-line two-machine scheduling problems for maximizing the minimum machine completion time. For each problem, we propose a best possible algorithm.

This paper presents the matrix representation for extension of inverse of restriction of a linear operator to a subspace, on the basis of which we establish useful representations in operator and matrix form for the generalized inverse A(T,S)~(2)

In the present paper we study the long time behavior of solutions to the Davey-Stewartson system in the Banach spaces. We make use of the properties of the semigroup generated by the linear principal operator in Lp() and prove that the Davey-Stew

We discuss the convergence rates in the law of logarithm for partial sums and randomly indexed partial sums of independent random variables in Banach space, and find the necessary and sufficient conditions on the convergence rates. The results of

In this paper, by introducing a new concept of absolute stability for a certain argument, necessary and sufficient conditions for absolute stability of general Lurie indirect control systems are obtained, and some practical sufficient conditions

The existence of periodic solutions for periodic reaction-diffusion systems with time delay by the periodic upper-lower solution method is investigated. Some methods for proving the uniqueness and the stability of the periodic solution are also g

Two fundamental convergence theorems are given for nonlinear conjugate gradient methods only under the descent condition. As a result, methods related to the Fletcher-Reeves algorithm still converge for parameters in a slightly wider range, in pa

This paper provides the parametric expressions satisfied by the enumerating functions for rooted nearly cubic c-nets with the size and/or the root-vertex valency of the maps as the parameters via nonseparable nearly cubic maps. On this basis, tw

In this papers a SQP method, in which the merit function is the continuously differentiable exact penalty function proposed by Fletcher[1] , is proposed and its global and superlinear convergence are ensured.Moreover, the penalty parameter is adjusted automatically,and the infeasibleness of the quadratic programming subproblem can be avoided by the method.

In this paper, the initial value problem of one-dimension heat-conduction equation solved by Daubechies wavelet is discussed. The explicit discrete scheme of the above problem is given using the wavelet representation of differential operator. Becausethe wavelets have the time-frequency lical property,the above method especially adapt to the heat-conduction phenomenon.

In this paper, the natural boundary element method is applied to solve a class of initial boundary value problem of hyperbolic equation. Natural integral equation of the problem and its Poisson integral formula are given, the properties of the natural integral equation is discussed indetail.And at last some numerical examples are provided.

By using Liapunov functional, this paper investigated the existence and uniqueness of almost periodic solutions in the retarded Lienard equation.

In this paper, we obtain a new fixed point theorem for increasing operators in infinite intervals. As an application, we consider the existence of solutions of the initial value problem for nonlinear integro-differential equations with discontinuous terms on inginite intervals in Banach spaces.

An equivalent condition on an arbitrary nonnegative square matrix is given for its numerical range to be a circular disk centered at the origin.

In this paper we study the singular perturbation of initial value problem for certain second order nonlinear system. We prove that the solution has double boundarylayer properties. By introducting extened varuabkes. We obtain the uniformly effective asymptotic expansion.

By a Generalized Clark Formula, this paper provides a hedging strategy for the Asian option calculated with geometric averaging. The hedging strategy is uncomplicated and easy to operate.

In this paper, we partially improve a conjecture of Steiner trees proposed by Gilbert-Pollak, proved by Du D Z and Hwang F K. We propose a new inequality.

This paper study the connectedness of the set of cone efficient solutions for cone quasiconvex multiobjective programming in locally convex Hausdorff topological vector space.By using the generalized saddle theorem, under the condition that the obiection mapping is one-for-one and cone quasiconvex,we prove the connectedness results of the set of cone efficient solutions to multiobjective programming.

In the communication network, some users may share a secret key, while nonauthorized user call not compute ally information about this key. Beimelt and Chor first proposed the Key Predistribution Scheme (KPS) in [1]; Stinson summarized and decribed some methods of constructing KPS in[2-4]respectively.The second author of this paperconstructed a new family of strong partially balanced t-designs by means of rationalnormal curves over finite fields in[5].In this paper we will propose a familu of KPS by mean of srrong partially balanced t-designs,and so a new class of KPS can be constructed.

The Author discuses the strongly positive dependence structure among hitting times (x) of the increasing multidimensional processes X(t), Some results obtained by Ebrahimi and Ramallingam have been extended. Also, the SPD (strong positive dependent property among hitting times of max-i.d.processes is described,and the lower bound of the joint distribution of hitting times（t_1(u_1),t_2(u_2)）(where U_i:is an increasing Borek set,=1,2)is given.

A Geometric framework is proposed for semiparametric nonlinear regression models based on the conception of least favorable curve, introduced by Severini and Wong[1], which is similar to the geometric framework of Bates and Watts[2]. We use this geometric framework to study some astmptotic inference in terms of curvatures for semiparametric semipatametric nonlinear regression models.

In 1978, Zheng proposed a conceptual algorithm of integral global optimization and implementable approach by Monte-Carlo method, the convergence of this algorithm is still unsolved. In 1996, Zhang presented a practical algorithm of mean-level methodsd and proved its convergence.In this paper,we give a modified integral-level method and construct an implementable algorithm by using uniformly distributed mumerical integration which approximates the livel set.We also show that this algorithm is convergent.

In this paper the perturbation problem of bisemigroups is considered. First solvability of an operator equation and similarity of operators concerned with the infinitesimal generator of a strongly continuous bisemigroup are investigated. Then based on the obtained results,it is shown that the transmutable exponential decay property of bisemigroups is preserved under a bounded operator perturbation with some conditions.

In this papers the author gave two methods for constructing 3-class association scheme from 2-class association scheme. Another family of association scheme is given as well.

In this paper,several concepts of nonsmooth nonconvex functions (generalized (h,φ)-convex) are presented by using Ben-Tal's algebraic generalized operations and generalized (h,φ)-gradient.The properties of these new generalized convex functions are studied.The relationships of these new generalized convexities and some well-know convexities are discussed.Three examples are given which are (h,φ)_z-pseudoconvex or (h,φ)_z-quasiconvex,but are neither convex nor some generalized convexfunctions,respectively.And then some optimality sufficient conditions and several duality results for a class of nonsmooth (h,φ)-semi-infinite programming are obtained under the weak assumptions that φ is strictly increasing continuous function and that φ(0)=0.

For a partly linear model, when observations of the respond variable are case one interval censored, asymptotic properties of sieve MLE are discussed. Piecewise linear functions are used to struct sieve spaces, under mild conditions, sieve MLE are showm to be strong consistent,sieve MLEof the nonparametric part has an optimal convergence rate,sieve MLE of the parametric part is asymptotic efficient.

A new integral inequality with power nonlinearity is obtained,which generalizes some extensions of L. Ou-Iang's inequality given by B.G. Pachpatte. Discrete analogy of the new integral inequality and some application examples are also indicated.

Some convergence results are given for A(a)-stable linear multistep methods applied to two classes of two-parameter singular perturbation problems, which extend the existing relevant results about one-parameter problems by Lubich~[1]. Some numeri