• Journal of the Korean Mathematical Society
• /
• v.42 no.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
• /
• v.34 no.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
• /
• v.25 no.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.

• Honam Mathematical Journal
• /
• v.29 no.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
• /
• v.8 no.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.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.17 no.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.

• Bulletin of the Korean Mathematical Society
• /
• v.60 no.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.

• Communications of the Korean Mathematical Society
• /
• v.39 no.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.

• Journal of applied mathematics & informatics
• /
• v.42 no.4
• /
• pp.777-783
• /
• 2024

Topoloical index is a numerical quantity which is correlates to properties of chemical compound . In this paper, we define operator graph namely, Edge ss-corona graph and we study structured properties of that graph. Also, establish the upper and lower bounds for First Zagreb index, Second Zagreb index, First Gourava index, SK₁ index, Forgotten topological index and EM₁ index of edge SS-corona graph.

• Management Science and Financial Engineering
• /
• v.11 no.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.