• 대한수학회지
• /
• 제42권6호
• /
• pp.1215-1230
• /
• 2005

In this paper we establish some results on the increments of a d-dimensional Gaussian process with the usual Euclidean norm. In particular we obtain the law of iterated logarithm and the Book-Shore type theorem for the increments of ad-dimensional Gaussian process, via estimating upper bounds and lower bounds of large deviation probabilities on the suprema of the d-dimensional Gaussian process.

• Journal of applied mathematics & informatics
• /
• 제34권3_4호
• /
• pp.319-330
• /
• 2016

The hyper-Zagreb index HM(G) of a simple graph G is defined as the sum of the terms (d_u+d_v)² over all edges uv of G, where d_u denotes the degree of the vertex u of G. In this paper, we present several upper and lower bounds on the hyper-Zagreb index in terms of some molecular structural parameters and relate this index to various well-known molecular descriptors.

• Journal of the Korean Statistical Society
• /
• 제25권4호
• /
• pp.489-497
• /
• 1996

Lower bounds for the full level probabilities are derived under order restrictions in weights. Discussions are made on typical isotonic cones such as linear order, simple tree order, and unimodal order cones. We also discuss applications of these results for constructing conditional likelihood ratio tests for ordered hypotheses in a contingency table. A real data set on torus mandibularis will be analyzed for illustrating the testing procedure.

• 호남수학학술지
• /
• 제29권4호
• /
• pp.535-542
• /
• 2007

In this paper, for each natural number n, we construct a polynomial $p_n$(x) of degree n so that $p_n(x)\;\leq\;p_{n+1}(x)\;\leq\;e^x$ for $x\;\geq\;-1$. These polynomials are optimal in the sense that if p(x) is a polynomial of degree n with $p_{n-l}(x)\;\leq\;p(x)\;\leq\;e^x$, then $p(x)\;\leq\;p_n(x)$.

• Journal of applied mathematics & informatics
• /
• 제8권3호
• /
• pp.881-888
• /
• 2001

Recently, Hooda and Ram [7] have proposed and characterized a new generalized measure of R-norm entropy. In the present communication we have studied its application in coding theory. Various mean codeword lengths and their bounds have been defined and a coding theorem on lower and upper bounds of a generalized mean codeword length in term of the generalized R-norm entropy has been proved.

• 한국경영과학회지
• /
• 제17권2호
• /
• pp.123-130
• /
• 1992

The model of k-out-of n : G repairable system with identical components is extended to a repairable system with n different components. The objective is to analytically derive the mean time of the busy period for a k-out-of-n : G system with unrestricted repair. Then, the lower and upper bounds on the average time of the busy period of the n-component system with restricted repair are also shown.

• 대한수학회보
• /
• 제60권2호
• /
• pp.389-404
• /
• 2023

We prove sharp bounds for Hankel determinants for starlike functions f with respect to symmetrical points, i.e., f given by $f(z)=z+{\sum{_{n=2}^{\infty}}}\,{\alpha}_nz^n$ for z ∈ 𝔻 satisfying $$Re{\frac{zf^{\prime}(z)}{f(z)-f(-z)}}>0,\;z{\in}{\mathbb{D}}$$. We also give sharp upper and lower bounds when the coefficients of f are real.

• 대한수학회논문집
• /
• 제39권2호
• /
• pp.407-420
• /
• 2024

In this paper, we investigate some geometric properties of starlikeness connected with the hyperbolic cosine functions defined in the open unit disk. In particular, for the class of such starlike hyperbolic cosine functions, we determine the lower bounds of partial sums, Briot-Bouquet differential subordination associated with Bernardi integral operator, and bounds on some third Hankel determinants containing initial coefficients.

• Management Science and Financial Engineering
• /
• 제11권2호
• /
• pp.19-43
• /
• 2005

This paper considers a variation of the customer order scheduling problem, and the variation is the case where the machine-job assignment is fixed. We examine the parallel machine environment, and the objective is to minimize the sum of the completion times of the batches. While a machine can process only one job at a time, different machines can simultaneously process different jobs in a batch. The recognition version of this problem is known to be NP-complete in the strong sense even if there exist only two parallel machines. When there are an arbitrary number of parallel machines, we establish three lower bounds and develop a dynamic programming (DP) algorithm which runs in exponential time on the number of batches. We present two simple but intuitive heuristics, SB and GR, and find some special cases where SB and GR generate an optimal schedule. We also find worst case upper bounds on the relative error. For the case of the two parallel machines, we show that GR generates an optimal schedule when processing times of all batches are equal. Finally, the heuristics and the lower bounds are empirically evaluated.

• Structural Engineering and Mechanics
• /
• 제13권3호
• /
• pp.299-312
• /
• 2002

In this paper, a new method to solve the dynamic response problem for structures with interval parameters is presented. It is difficult to obtain all possible solutions with sharp bounds even an optimum scheme is adopted when there are many interval structural parameters. With the interval algorithm, the expressions of the interval stiffness matrix, damping matrix and mass matrices are developed. Based on the matrix perturbation theory and interval extension of function, the upper and lower bounds of dynamic response are obtained, while the sharp bounds are guaranteed by the interval operations. A numerical example, dynamic response analysis of a box cantilever beam, is given to illustrate the validity of the present method.