For the bin-packing FFD algorithm we give a proof of FFD(L)≤〖SX(〗11〖〗9〖SX)〗OPT(L)+〖SX(〗7〖〗9〖SX)〗.The best bound before was FFD(L)≤〖SX(〗11〖〗9〖SX)〗OPT(L)+1 given by Yue Minyi.
For the bin-packing FFD algorithm we give a proof of FFD(L)≤〖SX(〗11〖〗9〖SX)〗OPT(L)+〖SX(〗7〖〗9〖SX)〗.The best bound before was FFD(L)≤〖SX(〗11〖〗9〖SX)〗OPT(L)+1 given by Yue Minyi.
In this paper we give a rigorous analysis of convergence of algorithms for finding eigenvectors of a real symmetric matrix.The algorithms are deterministic and our methods are very intuitive.
In this paper we give a rigorous analysis of convergence of algorithms for finding eigenvectors of a real symmetric matrix.The algorithms are deterministic and our methods are very intuitive.
This paper derives a new constraint qualification for nondifferential convex programming problem,by using the distance between the feasible set and the perturbed feasible sets.If the feasible set is bounded,then this constraint qualification is weaker than Stater's constraint qualification.
This paper derives a new constraint qualification for nondifferential convex programming problem,by using the distance between the feasible set and the perturbed feasible sets.If the feasible set is bounded,then this constraint qualification is weaker than Stater's constraint qualification.
A relative embedding of a connected graph is an embedding of the graph in some surface with respect to some closed walks,each of which bounds a face of the embedding.The relative maximum genus of a connected graph is the maximum of integer k with the property that the graph has a relative embedding in the orientable surface with k handles.A polynomial algorithm is provided for constructing relative maximum genus embedding of a graph if the relative tree of the graph is planar.Under this condition,just like maximum genus embedding,a graph does not have any locally strict maximum genus.
A relative embedding of a connected graph is an embedding of the graph in some surface with respect to some closed walks,each of which bounds a face of the embedding.The relative maximum genus of a connected graph is the maximum of integer k with the property that the graph has a relative embedding in the orientable surface with k handles.A polynomial algorithm is provided for constructing relative maximum genus embedding of a graph if the relative tree of the graph is planar.Under this condition,just like maximum genus embedding,a graph does not have any locally strict maximum genus.
Let k be any integer and k≥3.In this article it is proved that the necessary condition v≡k (mod k(k-1)) for the existence of an RB(v,k,1) is sufficient whenever v>exp{exp{k~(12k~2)}}.
Let k be any integer and k≥3.In this article it is proved that the necessary condition v≡k (mod k(k-1)) for the existence of an RB(v,k,1) is sufficient whenever v>exp{exp{k~(12k~2)}}.
In this paper,we study the 2m-order nonlinear Ginzburg-Landau system in n spatial dimensions.We show the existence and uniqueness of the global generalized solution,and the existence of the global attractor for this system,and establish the estimates of the upper bounds of Hausdorff and fractal dimensions for the global attractor.
In this paper,we study the 2m-order nonlinear Ginzburg-Landau system in n spatial dimensions.We show the existence and uniqueness of the global generalized solution,and the existence of the global attractor for this system,and establish the estimates of the upper bounds of Hausdorff and fractal dimensions for the global attractor.
Let F_q be a finite field with q elements,where q is a power of an odd prime.In this paper,we assume that δ=0,1 or 2 and consider a projective space PG(2υ+δ,F_q),partitioned into an affine space AG(2υ+δ,F_q) of dimension 2υ+δ and a hyperplane H=PG(2υ+δ-1,F_q) of dimension 2υ+δ-1 at infinity.The points of the hyperplane H are next partitioned into three subsets.A pair of points a and b of the affine space is defined to belong to class i if the line (ab)〖TX-〗 meets the subset i of H.Finally,we derive a family of three-class association schemes,and compute their parameters.
Let F_q be a finite field with q elements,where q is a power of an odd prime.In this paper,we assume that δ=0,1 or 2 and consider a projective space PG(2υ+δ,F_q),partitioned into an affine space AG(2υ+δ,F_q) of dimension 2υ+δ and a hyperplane H=PG(2υ+δ-1,F_q) of dimension 2υ+δ-1 at infinity.The points of the hyperplane H are next partitioned into three subsets.A pair of points a and b of the affine space is defined to belong to class i if the line (ab)〖TX-〗 meets the subset i of H.Finally,we derive a family of three-class association schemes,and compute their parameters.
Wavelets are applied to detect the jumps in a heteroscedastic regression model.By the empirical wavelet coefficients of the conditional mean and the conditonal variance of the time series under consideration,it is shown that the wavelet coefficients exhibit high peaks near the jump points,based on which a procedure is developed to identify and then to locate the jumps.All estimators are proved to be consistent.
Wavelets are applied to detect the jumps in a heteroscedastic regression model.By the empirical wavelet coefficients of the conditional mean and the conditonal variance of the time series under consideration,it is shown that the wavelet coefficients exhibit high peaks near the jump points,based on which a procedure is developed to identify and then to locate the jumps.All estimators are proved to be consistent.
In this article,we analyze and study under what conditions a source-free system has volume-preserving RK schemes.For linear systems,we give a comparatively through discussion about RK methods to be phase volume preserving integrators.We also analyze the relationship between volume-preserving integrators and symplectic integrators.
In this article,we analyze and study under what conditions a source-free system has volume-preserving RK schemes.For linear systems,we give a comparatively through discussion about RK methods to be phase volume preserving integrators.We also analyze the relationship between volume-preserving integrators and symplectic integrators.
In this paper,we consider the residual life at random time,i.e. X_Y=X-Y|X>Y,where X and Y are non-negative random variables.We establish a number of stochastic comparison properties for X_Y under various assumptions of X and Y.Under the assumption that Y has decreasing reverse hazard rate (DRHR),we show that if X is in any one of the classes IFR,DFR,DMRL or IMRL then X_Y is in the same class as X.We also obtain some useful bounds for the distribution and the moment of X_Y.Because the idle time in classical GI/G/1 queuing system can be regarded as the residual life at random time,the results obtained in this paper have applications in the study of such system.
In this paper,we consider the residual life at random time,i.e. X_Y=X-Y|X>Y,where X and Y are non-negative random variables.We establish a number of stochastic comparison properties for X_Y under various assumptions of X and Y.Under the assumption that Y has decreasing reverse hazard rate (DRHR),we show that if X is in any one of the classes IFR,DFR,DMRL or IMRL then X_Y is in the same class as X.We also obtain some useful bounds for the distribution and the moment of X_Y.Because the idle time in classical GI/G/1 queuing system can be regarded as the residual life at random time,the results obtained in this paper have applications in the study of such system.