CYCLES CONTAINING MANY VERTICES OF SUBSETS IN GRAPHS WITH LARGE DEGREE SUMS AND NEIGHBORHOOD UNIONS

1. ResultsWe use[IJ for terminology and notations not defined here and consider simple graph only.Let G be a graph of order n and X C V(G). A graph G is called 1--tough if w(G\S) 5 ISIfor any S g V(G) with w(G\S) > 1, where w(G\S) denotes the number of components ofgraph G\S. A cycle C of G is called X-longest if no cycle of G contains more venices of Xthan C, and by c(X) we denote the number of venices of X in an X-longest cycle. A cycle Cof G is called X-dominating if all neigh…     

A PRIOR ESTIMATE AND EXISTENCE OF POSITIVE SOLUTIONS OF SEMILINEAR ELLIPTIC EQUATION WITH THE THIRD BOUNDARY VALUE PROBLEM

1 IntroductionLet n be a bounded open domain with boundary aa, n c R", N 3 2. We consider a priorestimate and ekistence of positive solution of the fOllowing equationsWhere operatorL conforms to the Sum Ru1es, that is: for a repeated i or j, it mean to sum them up from 1 toN, ai;(x), ai(x), a(x) are bounded measurable in a. FOr operator L, we alWays assume: thereealst positive constants po and U1) such thatf(u) is a nonlinear function which grows in the form of Up with p 2 1, n is the out…     

ON ASYMPTOTIC FORMULAE OF EIGENVALUE COUNTING FUNCTIONS OF LAPLACIAN ON AN UNBOUNDED DOMAIN WITH A FRACAL BOUNDARY

1. IntroductionLet D be an unbounded open set in R"(n 2 2) with finite Lebesgue measure. We considerthe following eigenvalue problem on a.where A = Z:=, 6 denotes the Laplacian on a and r ~ oa, the boundary of g. In thispaper we have a special interest in r which is considerably irregular like a fractal.Let N(A) denote the eigenvalue counting function of (P): the number of eigenvalues notexceeding A. When n is a bounded open set, it is well known that Weyl's classical asymptoticformulae f…     

OPTIMAL RATE OF CONVERGENCE FOR ESTIMATORS IN THE NONPARAMETRIC MEDIAN MODEL

Let(Y,X)be a random vector with its value in R~1×R~d,d(?)1.Let(?)be the collection of real valued functions θ(x) on R~d which is p times differ-entiable at x=0 and p-1 times differentiable on an open neighborhood U ofthe origin of R~d.The conditional distribution of Y is assumed to be of the formof f(y|x,θ(x))dy where θ(x)∈(?)is called the parameter of the family.(Y,X)iscalled a nonparametric median model if furthermore the conditional median of Ygiven X=x is θ(x).In this paper,the optimal rate of convergence for estimatorsof T(θ)=θ(0)is discussed.Under certain conditions,it is proved that for thenonparametric median model the optimal rate of convergence is r=p/(2p+d).A sequence of estimators,which is asymptotically normal with the optimal rate ofcovergence,is constructed.     

PACKING A TREE OF ORDER p WITH A （p,p＋1）—GRAPH

Let G1 and G2 be two graphs of the same order,If G1 is isomorphic to a spanning subgraph of the complement of G2,then we say that G1 and G2 are packable.A graph G is called a (p,m)-graph if G has p vertices and m edges.The main purpose of this paper is to present a necessary and sufficient condition for a tree of order p and a (p,p 1)-graph to be packable.     

ON(η,d)-CONTRACTIBLE ORBITS OF VECTOR FIELDS

Let ■ be the linear space of all C~1 vector fields X on a compact n-dimensionalC~∞ Riemann manifold(n≥2),endowed with the C~1 norm ‖X‖_1.Write θ(X)for the numberof contractible periodic orbits of X∈(?),which may be finite or infinite.Let (?)~* be the set ofall X∈(?) possessing the property that X has a neighbourhood (?) such that every Y∈(?) hasonly a finite number of singularities and at most a countable number of periodic orbits.Inthis paper,it is shown that any given S∈(?) has a neighbourhood (?) in (?) together with anumber λ=λ(?)>0 such that θ(X)≤λfor all X∈(?).     

INFERENCE ON THE RANK OF THE GROWTH CURVE MODEL USING MODEL SELECTION METHOD

1 IntroductionConsider the growth curve model introduced by Potthoff and Roy[1] and given byy = Aex e, B ~ (o,In @ z) (1.1)where Y: n x p is an obserwtion ~riX, A: n x k is a destw ~rad across individuals, X: q xpis a design ~rad within individuals, e is an tmknoWn parameter mains, and eaCh row of 6 isindependent and idelltically distribllted with mean zero and positive deface covariance mainsZ. Assume that matrices A and X are Of ranks k and q(S P), respectively. In the aPPlicationt…     

A comparative study of the inventory system with service facility and postponed demands

In this article, we present a continuous review （s,S） inventory system with a service facility consisting of finite buffer （capacity N ） and a single server. The customers arrive according to a Poisson process. The individual customer＇s unit demand is satisfied after a random time of service, which is assumed to be exponential. When the inventory level drops to s＇an order for Q（= S-s） items is placed. The lead time of reorder is assumed to be exponential distribution. An arriving customer, who finds the buffer is full, enters into the pool of infinite size or leaves the system according to a Bernolli trial. At the time of service completion, if the buffer size drops to a preassigned level L （1 〈 L 〈 N） or below and the inventory level is above s, we select the customers from the pool according to two different policy ： in first policy, with probability p （0 〈 p 〈 1） we select the customer from the head of the pool and we place the customer at the end of the buffer; in the second policy, with p （0 〈 p 〈 1） the customer from the pool is transferred to the buffer for immediate service and after completion of his service we provide service to the customer who is in the buffer with probability one. If at a service completion epoch the buffer turns out to be empty, there is at least one customer in the pool and the inventory level is positive, then the one ahead of all waiting in the pool gets transferred to the buffer, and his service starts immediately. The joint probability distribution of the number of customers in the pool, number of customers in the buffer and the inventory level is obtained in the steady-state case. Various stationary system performance measures are computed and total expected cost rate is calculated. A comparative result of two models is illustrate numerically.     

ON CONSTRUCTING THE NATURAL EXPONENTIAL FAMILIES WITH POLYNOMIAL VARIANCE FUNCTIONS

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.Wepoint out the importance of the REF with polynomial variance function(PVF-REF).When m is asingle 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.     

LOCAL ASYMPTOTIC PROPERTIES OF HAZARD RATE ESTIMATORS FOR TRUNCATED AND CENSORED DATA

1 IntroductionLet (X, T, Y) denote random variables where X is the variab1e of interest, called the lifetimevariab1e, with distribution function (d.f.) F; T is the random 1eft truncation time with arbitraryd.f G and Y is the random right censoring time with arbitrary d.f. H. It is assumed that Xis independent Of (T, Y), bnt T and Y may be dePendent and, Without 1oss of generality thatthey are nonnegative. In the random 1eft truncation and right censoring (LTRC) model oneobserves (Z, T…     

ON THE EXISTENCE OF FIXED POINTS FOR MAPPINGS OF ASYMPTOTICALLY NONEXPANSIVE TYPE

Let C be a nonempty weakly compact convex subset of a Banach space X, and T : C →C a mapping of asymptotically nonexpansive type. Then there hold the following conclusions: (i) if X has uniform normal structure and limsup |||TjN||| < N(X)~1/(N(X)) , where|||TjN||| is the exact Lipschitz constant of TjN , N is some positive integer, and N(X) is the normal structure coefficient of X, then T has a fixed point; (ii) if X is uniformly convex in every direction and has weak uniform normal structure, then T has a fixed point.     

MERGING OPTIMALITY CONDITIONS WITH GENETIC ALGORITHM OPERATORS TO SOLVE SINGLE MACHINE TOTAL WEIGHTED TARDINESS PROBLEM

1.Introduction Production sequencing and scheduling is one of the most important activities in production planning and control.Sequencing is defined as the order in which the jobs are processed through the machines.The allocation of machines over time to process a collection of jobs is defined as Scheduling.Several methods have been developed to solve the scheduling problem which can be classified as follows:1)efficient optimal methods,2)implicit and explicit,or complete enumerative methods,a…     

ASYMPTOTIC STABILITY OF VISCOUS SHOCK PROFILE FOR NON-CONVEX SYSTEM OF ONE-DIMENSIONAL VISCOELASTIC MATERIALS WITH BOUNDARY EFFECT

1 IntroductionWe consider the system of one-dimensiona1 viscoelastic materials with non--convekity of thefOrm.with the illitial-boundary conditionshere v is the strain, u is the ve1ocity p > 0 is the viscous constallt, v and u are givenconstants, a is the pressure to be a known smooth fUnction of v satisfying the fOllOwing signconditions:a'(v) > 0 fOr all v u-nder consideration, (1.4)a"(v) 2 0 fOr v 2 0 under consideration, (l.5)so that rr(v) has a point of inflection at v = 0. We see that…     

The Algebraic Properties of Concept Lattice

Concept lattice is a powerful tool for data analysis. It has been applied widely to machine learning, knowledge discovery and software engineering and so on. Some aspects of concept lattice have been studied widely such as building lattice and rules extraction, as for its algebraic properties, there has not been discussed systematically. The paper suggests a binary operation between the elements for the set of all concepts in formal context. This turns the concept lattice in general significance into those with operators. We also proved that the concept lattice is a lattice in algebraic significance and studied its algebraic properties.These results provided theoretical foundation and a new method for further study of concept lattice.     

FORBIDDEN SUBGRAPHS,DEGREES,NEIGHBORHOOD UNIONS AND CIRCUMFERENCES OF GRAPHS

Combining forbidden subgraphs with degree restrictions and neighborhood unionrestrictions,respectively,we prove the following results:(1) Let G be a 2-connected graph of order n,and 3≤c≤n.If for each induced subgraphL of order four of G(?)|V_1(L)∩S_c|≥2 if L≌K_(1,3),and |V(L)∩S_c|≥1 if L≌P_4,then thecircumference of G is at least c,where V_1(L)is the set of vertices with degree 1 of L,S_c isthe set of vertices with degree at least c/2 of G and P_4 is a path of order 4.(2) Let G be a 2-connected graph of order n,and n≥s+2.If for each induced subgraphL of G isomorphic to K_(1,3)or P_4,d_L(u,v)=2(?)|N(u)∪N(v)|≥s,then the circumferencec (G) of G is at least s+2.Moreover,if n≥s+3 and s is odd,then c(G)≥s+3.     

AN SQP METHOD BASED ON SMOOTHING PENALTY FUNCTION FOR NONLINEAR OPTIMIZATION WITH INEQUALITY CONSTRAINT

1 IntroductionIn tabs paper, we consider the following nonlinear optbostion problem:where j: Re - R, g: Re - Re are continuously ~ntiable functinns. SoP method forproblem (1) generates a sequence of points which converges to a K--T point of problem (1)through the following iterate formulaxk 1 = x* adds (2)adhere da is the solution of the following quadratic Prograrxuning problemin which Bh is a sylnlnetric positive deflate lllatris and A* is a stepsise obtained by some lineseaxch to redu…     

A Stock Pricing Model Based on Arithmetic Brown Motion

1　 IntroductionStock value is an old and new study field.Gordon presented a model to estimate stockvalue in1 962 and now the model is widely used in the world.In Gordon model company′sdividends per share increase in geometric Brown motion,that is,dividend at the end of tyear isDt=D0 eμt ( 1 )where D0 denotes dividend per share in last year;μ denotes the mean of the logarithmnormal distribution and is calculated byμ =1( n -1 )△ t∑n- 1t=1ln( Dt 1 /Dt) ( 2 )where△t is interval of sampl…     

Image completion algorithm based on texture synthesis

A new algorithm is proposed for completing the missing parts caused by the removal of foreground or background elements from an image of natural scenery in a visually plausible way. The major contributions of the proposed algorithm are: (1) for most natural images, there is a strong orientation of texture or color distribution. So a method is introduced to compute the main direction of the texture and complete the image by limiting the search to one direction to carry out image completion quite fast; (2) there exists a synthesis ordering for image completion. The searching order of the patches is defined to ensure the regions with more known information and the structures should be completed before filling in other regions; (3) to improve the visual effect of texture synthesis, an adaptive scheme is presented to determine the size of the template window for capturing the features of various scales. A number of examples are given to demonstrate the effectiveness of the proposed algorithm.     

The Core and Coritivity off a System (IV)——Relations between a System and Its Complement

The coritivity, h(G), of a connected graph G, is defined by h(G) = max{ω(G-S)-|S|: S∈C(G)}, where ω(G) denotes the number of components of a graph G, C(G) denotes the collection of cut-sets of G. In this paper, the notion of complementary coritivity is proposed, and the relations between coritivity and its complement are studied, for example, two bounds, Nordaus-Gaddum problems and some foundational properties etc.     

NOTICE ON ADDED-FACTOR OF MULTIVARIATE GOULD-HSU INVERSION

1. IntroductionIn 1973, W. H. Gould and L. C. Hsu [1] obtained a pair of reciprocal relations as follows.Theorem 1 Let {al}gr and {hi}gr be two sequences of complex number. Define thatand let that of (x, 0) = 1. Then there exists a pair of reciprocal relations as followsandwhere (:) denotes the oofinary binomial coefficients.This result is often called Gould-Hsu inversion formula in the literature, which turns outto be of great importance in the transformation of illtegral sequencest the c…