On trees with a maximum proper partial 0-1 coloring containing a maximum matching

I prove that in a tree in which the distance between any two endpoints is even, there is a maximum proper partial 0-1 coloring such that the edges colored by 0 form a maximum matching.     

MAXIMUM NORM ERROR ESTIMATES OF CROUZEIX-RAVIART NONCONFORMING FINITE ELEMENT APPROXIMATION OF NAVIER-STOKES PROBLEM

1. IntroductionThere are many research works on finite element approximation of Navier-Stokesproblem in the case of lower Reynold number, by using the so-called velocity--pressuremixed by Teman [26], the optimal results were also obtained. The other nonconforming finiteelement schemes for Navie--Stokes problem may be found in [4,8,9,14,15,23,26]. But sofar, maximum norm error estimates for any nonconforming finite element schemes werenot considered.Recently, the quasi--optimal maximum norm …     

A branch-and-bound algorithm of the single machine schedule with sequence-dependent setup times for minimizing maximum tardiness

This paper addresses the NP-hard problem of scheduling N jobs on a single machine with due dates, sequence-dependent setup times and no preemption where the objective is to minimize the maximum tardiness. An algorithm based on branch-and-bound permutation schemes is developed including the implementation of lower and upper bounding procedures, and three dominance rules. Computational experiments demonstrate the effectiveness of the algorithm. In the experiments, the impacts of control parameters to generate test instances on algorithm performance (CPU times) are studied by statistics methods.     

Up-Embeddability of a Graph by Order and Girth

Let G be a connected graph of order n and girth g. If d_G(u) + d_G(v) ≥ n − 2g + 5 for any two non-adjacent vertices u and v, then G is up-embeddable. Further more, the lower bound is best possible. Similarly the result of k-edge connected simple graph with girth g is also obtained, k = 2,3. Partially supported by the Postdoctoral Seience Foundation of Central South University and NNSFC under Grant No. 10751013.     

On the Maximum Number of Cliques in a Graph

A clique is a set of pairwise adjacent vertices in a graph. We determine the maximum number of cliques in a graph for the following graph classes: (1) graphs with n vertices and m edges; (2) graphs with n vertices, m edges, and maximum degree Δ; (3) d-degenerate graphs with n vertices and m edges; (4) planar graphs with n vertices and m edges; and (5) graphs with n vertices and no K₅-minor or no K_3,3-minor. For example, the maximum number of cliques in a planar graph with n vertices is 8(n − 2). Research supported by a Marie Curie Fellowship of the European Community under contract 023865, and by the projects MCYT-FEDER BFM2003-00368 and Gen. Cat 2001SGR00224.     

广义线性回归极大似然估计的强相合性

设有该文第1节所描述的广义线性回归模型,以$\underline{\lambda}_n$和$\overline{\lambda}_n$分别记$\sum\limits_{i=1}^{n}Z_iZ_i^{\prime}$的最小和最大特征根,$\hat{\beta}_n$记$\beta_0$的极大似然估计.在文献[1]中,当\{$Z_i,i\ge1$\}有界时得到$\hat{\beta}_n$强相合的充分条件,在自然联系和非自然联系下分别为$\underline{\lambda}_n\rightarrow\infty$, $(\overline{\lambda}_n)^{1/2+\delta}=O(\underline{\lambda}_n)$（对某$\delta>0$)以及$\underline{\lambda}_n\rightarrow\infty$, $\overline{\lambda}_n=O(\underline{\lambda}_n)$.作者将后一结果改进为只要求$(\overline{\lambda}_n)^{1/2+\delta}=O(\underline{\lambda}_n)$,从而与自然联系情况下的条件达到一致.     

On a proper way to select population failure distribution and a stochastic optimization method in parameter estimation

It is widely accepted that the Weibull distribution plays an important role in reliability applications. The reliability of a product or a system is the probability that the product or the system will still function for a specified time period when operating under some confined conditions. Parameter estimation for the three parameter Weibull distribution has been studied by many researchers in the past. Maximum likelihood has traditionally been the main method of estimation for Weibull parameters along with other recently proposed hybrids of optimization methods. In this paper, we use a stochastic optimization method called the Markov Chain Monte Carlo (MCMC) to carry out the estimation. The method is extremely flexible and inference for any quantity of interest is easily obtained.     

Ground state solutions for the singular Lane-Emden-Fowler equation with sublinear convection term

We are concerned with singular elliptic equations of the form −Δu=p(x)(g(u)+f(u)+a|∇u|) in RN (N?3), where p is a positive weight and 0<a<1. Under the hypothesis that f is a nondecreasing function with sublinear growth and g is decreasing and unbounded around the origin, we establish the existence of a ground state solution vanishing at infinity. Our arguments rely essentially on the maximum principle.     

Electron acceleration using two crossed Bessel beams in vacuum

The direct acceleration of electrons by using two crossed linearly polarized Bessel beams with equal frequency and amplitude in vacuum is studied and compared with the case of single linearly polarized Bessel beam. It is found that two zeroth- and first-order Bessel beams with π-rad phase difference have a nonvanishing longitudinal electric field on the z-axis, which can be maximized under certain conditions and used to accelerate electrons. Two crossed zeroth- and first-order Bessel beams have a larger maximum longitudinal electric field on the z-axis than that of a single first-order Bessel beam, and are suited for laser electron acceleration.     

Maximum principle for functional equations in the space of discontinuous functions of three variables

The paper is devoted to the maximum principles for functional equations in the space of measurable essentially bounded functions. The necessary and sufficient conditions for validity of corresponding maximum principles are obtained in a form of theorems about functional inequalities similar to the classical theorems about differential inequalities of the Vallee Poussin type. Assertions about the strong maximum principle are proposed. All results are also true for difference equations, which can be considered as a particular case of functional equations. The problems of validity of the maximum principles are reduced to nonoscillation properties and disconjugacy of functional equations. Note that zeros and nonoscillation of a solution in a space of discontinuous functions are defined in this paper. It is demonstrated that nonoscillation properties of functional equations are connected with the spectral radius of a corresponding operator acting in the space of essentially bounded functions. Simple sufficient conditions of nonoscillation, disconjugacy and validity of the maximum principles are proposed. The known nonoscillation results for equation in space of functions of one variable follow as a particular cases of these assertions. It should be noted that corresponding coefficient tests obtained on this basis cannot be improved. Various applications to nonoscillation, disconjugacy and the maximum principles for partial differential equations are proposed.