• 한국경영과학회지
• /
• 제33권1호
• /
• pp.35-49
• /
• 2008

To load a container in a yard block onto a ship, a Transfer Crane (TC) moves to a target yard bay, then its hoist picks up a selected container and loads it onto a waiting Yard Truck (YT). An optimal routing problem of Transfer Crane is a decision problem which determines a given TC's the visiting sequence of yard-bays and the number of containers to transfer from each yard-bay. The objective is to minimize the travel time of the TC between yard-bays and setup time for the TC in a visiting yard. In this paper, we shows that the problem is NP-complete, and suggests a new formulation for it. Using the new formulation for the problem, we investigate some characteristics of solutions, a lower and upper bounds for it. Moreover, our lower and upper bound is very efficient to applying some instances suggested in a previous work.

• 한국경영과학회지
• /
• 제23권2호
• /
• pp.1-13
• /
• 1998

The purpose of this paper is to formulate the three-dimensional loading problem and to develop an exact algorithm. The three-dimensional loading problem is not only to load as many boxes as possible, but also to ensure load stability. In this Paper, we propose formulation by zero-one integer programming. Further we propose as an algorithm the branch-and-bound enforced by efficient bounding criteria. As an upper bound, we use the solution of the Lagrangean relaxation problem which relaxes constraints of zero-one IP, and as a lower bound, we use a heuristic solution induced by the solution of the Lagrangean relaxation problem. Last, we show computational experiments on convergency of upper and lower bounds.

• Journal of Communications and Networks
• /
• 제17권1호
• /
• pp.21-26
• /
• 2015

The general wiretap channel with noiseless feedback is first investigated by Ahlswede and Cai, where lower and upper bounds on the secrecy capacity are provided in their work. The upper bound is met with equality only in some special cases. In this paper, we study a special case of the general wiretap channel with noiseless feedback (called non-degraded wiretap channel with noiseless feedback). Inner and outer bounds on the capacity-equivocation region of this special model are provided. The outer bound is achievable if the main channel is more capable than the wiretap channel. The inner bound is constructed especially for the case that the wiretap channel is more capable than the main channel. The results of this paper are further explained via binary and Gaussian examples. Compared with the capacity results for the non-degraded wiretap channel, we find that the security is enhanced by using the noiseless feedback.

• 충청수학회지
• /
• 제31권3호
• /
• pp.287-308
• /
• 2018

This paper deals with blow-up phenomena for an initial boundary value problem of a quasilinear parabolic equation with time-dependent coefficient in a bounded star-shaped region under nonlinear boundary flux. Using the auxiliary function method and differential inequality technique, we establish some conditions on time-dependent coefficient and nonlinear functions for which the solution u(x, t) exists globally or blows up at some finite time $t^*$. Moreover, some upper and lower bounds for $t^*$ are derived in higher dimensional spaces. Some examples are presented to illustrate applications of our results.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제13권4호
• /
• pp.267-280
• /
• 2009

In this paper we investigate a simple two-level additive Schwarz preconditioner for the P1 symmetric interior penalty Galerkin method of the Poisson equation on rectangular meshes. The construction is based on the decomposition of the global space of piecewise linear polynomials into the sum of local subspaces, each of which corresponds to an element of the underlying mesh, and the global coarse subspace consisting of piecewise constants. This preconditioner is a direct combination of the block Jacobi iteration and the cell-centered finite difference method, and thus very easy to implement. Explicit upper and lower bounds for the maximum and minimum eigenvalues of the preconditioned matrix system are derived and confirmed by some numerical experiments.

• 대한수학회보
• /
• 제53권6호
• /
• pp.1845-1856
• /
• 2016

In this paper our aim is to study the classical Bessel-Struve kernel. Monotonicity and log-convexity properties for the Bessel-Struve kernel, and the ratio of the Bessel-Struve kernel and the Kummer confluent hypergeometric function are investigated. Moreover, lower and upper bounds are given for the Bessel-Struve kernel in terms of the exponential function and some $Tur{\acute{a}}n$ type inequalities are deduced.

• Journal of applied mathematics & informatics
• /
• 제16권1_2호
• /
• pp.1-17
• /
• 2004

The famous Newton-Kantorovich hypothesis has been used for a long time as a sufficient condition for the convergence of Newton method to a solution of an equation in connection with the Lipschitz continuity of the Frechet-derivative of the operator involved. Using Lipschitz and center-Lipschitz conditions we show that the Newton-Kantorovich hypothesis is weakened. The error bounds obtained under our semilocal convergence result are finer and the information on the location of the solution more precise than the corresponding ones given by the dominating Newton-Kantorovich theorem, and under the same hypotheses/computational cost, since the evaluation of the Lipschitz also requires the evaluation of the center-Lipschitz constant. In the case of local convergence we obtain a larger convergence radius than before. This observation is important in computational mathematics and can be used in connection to projection methods and in the construction of optimum mesh independence refinement strategies.

• Journal of Magnetics
• /
• 제21권1호
• /
• pp.83-93
• /
• 2016

Due to their performances and inherent benefits, especially in medium-voltage and high-power applications, multilevel inverters have received an increasing attention in real world industrial applications. The present paper deals with a review of the main multilevel inverter topologies as well their most common derived and hybrid structures quoted in previous research works. It also encompasses an investigation on voltage harmonic elimination and THD estimation. For that reason, the paper summarizes the most relevant modulation techniques used so far to enhance the output voltage quality. Theoretical formulas evoked in the literature, for calculating the output voltage THD upper and lower bounds are reported and verified by adequate simulations.

• Journal of applied mathematics & informatics
• /
• 제16권1_2호
• /
• pp.407-417
• /
• 2004

It is well known that the nonlinearity of vector Boolean functions F on n-dimensional vector space $GF(2)^n$ to $GF(2)^m$ is bounded above by $2^{n-1} - 2 ^{\frac{n}{2}-1}$. In this paper we derive upper bounds and a lower bound on the nonlinearity of vector Boolean functions in terms of auto-correlations. Strengths and weaknesses of each bounds are examined. Also, we modify the notions of the sum-of-square indicator and absolute indicator for Boolean functions to the case of vector Boolean functions to measure global avalanche characteristics of vector Boolean functions. Using those indicators we compare the global avalanche characteristics of DES (Data Encryption System) and Rijndael.

• 한국경영과학회지
• /
• 제20권3호
• /
• pp.31-41
• /
• 1995

The maximum Origin-Destination Flow Path Problem (MODFP) in an Acyclic Network has known as NP-hard. K. S. Sung has suggested on Optimal Algorithm for MODFP based on the Pseudo flo or arc and the K-th shortest path algorithm. When we try to solve MODFP problem by general Branch and Bound Method (BBM), the upper and lower bounds of subproblems are so weak that the BBM become very inefficient. Here we utilized the Pseudo flow of arc' for the tight bounds of subproblems so that it can produce an efficient BBM for MODFP problem.