Maximal σ‐polynomials of connected 3‐chromatic graphs

In the set of graphs of order n and chromatic number k the following partial order relation is defined. One says that a graph G is less than a graph H if c_i(G) ≤ c_i(H) holds for every i, k ≤ i ≤ n and at least one inequality is strict, where c_i(G) denotes the number of i‐color partitions of G. In this paper the first ? n/2 ? levels of the diagram of the partially ordered set of connected 3‐chromatic graphs of order n are described. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 210–222, 2003     

PERIODIC SOLUTIONS OF PLANAR SYSTEM WITH SIX DELAYS

In this paper we obtain some sufficient conditions for the existence of non-constant periodic solutions of the following planar system with six delaysOur approach is based on the continuation theorem of the coincidence degree.     

A Tandem Queue with Coupled Processors: Computational Issues

In Resing and Örmeci [16] it is shown that the two-stage tandem queue with coupled processors can be solved using the theory of boundary value problems. In this paper we consider the issues that arise when calculating performance measures like the mean queue length and the fraction of time a station is empty. It is assumed that jobs arrive at the first station according to a Poisson process and require service at both stations before leaving the system. The amount of work that a job requires at each of the stations is an independent, exponentially distributed random variable. When both stations are nonempty, the total service capacity is shared among the stations according to fixed proportions. When one of the stations becomes empty, the total service capacity is given to the nonempty station. We study the two-dimensional Markov process representing the numbers of jobs at the two stations. The problem of finding the generating function of the stationary distribution can be reduced to two different Riemann-Hilbert boundary value problems, where both problems yield a complete analytical solution. We discuss the similarities and differences between the two problems, and relate them to the computational aspects of obtaining performance measures.     

关于"太阳在银河系中所受引力与到银心距离r的关系"的讨论

讨论了银道面内的引力场强分布和太阳在银河系中所受引力与到银心距离r的关系，指出引力场强g并不是与r的平方成反比，这是由于银河系的大小和形状不能忽略造成的．强调了万有引力定律的适用条件．     

Simultaneous Pseudo-Timestepping for PDE-Model Based Optimization Problems

In this paper we present a new method for the solution of optimization problems with PDE constraints. It is based on simultaneous pseudo-time stepping for evolution equations. The new method can be viewed as a continuous reduced SQP method in the sense that it uses a preconditioner derived from that method. The reduced Hessian in the preconditioner is approximated by a pseudo-differential operator, whose symbol can be investigated analytically. We apply our method to a boundary control model problem. The new optimization method needs 3.2-times the overall computational effort of the solution of simulation problem alone.     

NOTE ON THE OSCILLATION OF THE SOLUTION FOR GENERALIZED LIENARD EQUATIONS

Ｃｏｎｓｉｄｅｒｉｎｇｓｙｓｔｅｍ：ｘ＝φ（ｙ）－Ｆ（ｘ），ｙ＝－ｇ（ｘ）｛（Ｅ）ｉｎｗｈｉｃｈＦ（ｘ）＝∫ｘ０ｆ（ｔ）ｄｔ，ｆ（ｘ），ｇ（ｘ），φ（ｙ）ａｒｅｃｏｎｔｉｎｕｏｕｓ，ａｎｄｓａｔｉｓｆｙｔｈｅｃｏｎｄｉｔｉｏｎｓｗｈｉｃｈｅｎｓｕｒ...     

具有两台专用机,两台通用机的Q4／／Cmax问题的近似算法

本文讨论具有两台专用机、两台通用机的两组工件的同种类平行机的Q4／／Cmax问题，对这类特殊的排序问题，提出一种启发式算法，得到了最差情况下性能指标的严格的界．     

液态金属流的表面张力问题中的两点边值问题解的存在性

本文讨论了在区域提纯过程中，研究液态金属流的表面张力时提出的一个带有非负参数Ｑ的两点边值问题．利用上、下解方法和Ｓｃｈａｕｄｅｒ不动点定理，证明了当０Ｑ８５１时，该问题至少有一个解，对已有结果０Ｑ＜１进行了重要的改进．     

A general converse theorem for mean‐value theorems in linear elasticity

We prove a rather general mean‐value formula in the theory of elasticity, which expresses the value of the displacement at the centre of a sphere in terms of certain combinations of integral averages over the sphere itself of the traction and the displacement. We also establish the corresponding converse to this mean‐value formula under minimal smoothness assumptions on the displacement. Copyright © 2006 John Wiley & Sons, Ltd.