• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.26 no.1
• /
• pp.1-22
• /
• 2022

A tandem queue that consists of nodes with buffers of finite capacity and general blocking scheme is considered. The service time distribution of each node is exponential whose rate depends on the state of the node. The blocking scheme at a node may be different from that of other nodes. An approximation method for the system based on decomposition method is presented. The effectiveness of the method is investigated numerically.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.60 no.9
• /
• pp.1748-1753
• /
• 2011

In this paper, we consider the stability of linear systems with an interval time-varying delay. It is known that the adoption of decomposition of delay improves the stability result. For the interval time-delay case, they applied it to the interval of time-delay and got less conservative results. Our basic idea is to apply the general decomposition to the low limit of delay as well as interval of time-delay. Based on this idea, by using the modified Lyapunov-Krasovskii functional and newly derived Lemma, we present a less conservative stability criterion expressed as in the form of linear matrix inequality(LMI). Finally, we show, by well-known two examples, that our result is less conservative than the recent results.

• Bulletin of the Korean Mathematical Society
• /
• v.55 no.4
• /
• pp.1221-1230
• /
• 2018

We derive a sharp decomposition formula for the state polytope of the Hilbert point and the Hilbert-Mumford index of reducible varieties by using the decomposition of characters and basic convex geometry. This proof captures the essence of the decomposition of the state polytopes in general, and considerably simplifies an earlier proof by the authors which uses a careful analysis of initial ideals of reducible varieties.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.18 no.4
• /
• pp.305-316
• /
• 2014

The Hodge-Helmholtz decomposition splits a vector field into the unique sum of a divergence-free vector field (solenoidal part) and a gradient field (irrotational part). In a bounded domain, a boundary condition needs to be supplied to the decomposition. The decomposition with the non-penetration boundary condition is equivalent to solving the Poisson equation with the Neumann boundary condition. The Gibou-Min method is an application of the Poisson solver by Purvis and Burkhalter to the decomposition. Using the $L^2$-orthogonality between the error vector and the consistency, the convergence for approximating the divergence-free vector field was recently proved to be $O(h^{1.5})$ with step size h. In this work, we analyze the convergence of the irrotattional in the decomposition. To the end, we introduce a discrete version of the Poincare inequality, which leads to a proof of the O(h) convergence for the scalar variable of the gradient field in a domain with general intersection property.

• Korean Management Science Review
• /
• v.12 no.2
• /
• pp.63-75
• /
• 1995

The uncapacitated facility location problem considered here is to determine facility location sites, minimizing the total cost of establishing facilities and serving customer demand points which require primary and back-up services. To solve this problem effectively, we propose two things in this study. First, we propose an idea of Benders' decomposition approach as a solution method of the problem. Second, we implement the problem on GAMS. Using GAMS (general Algebraic Modeling System) can utilize an mixed-integer programming solver such as ZOOM/XMP and provide a completely general automated implementation with a proposed solution method.

• Communications of the Korean Mathematical Society
• /
• v.17 no.1
• /
• pp.31-36
• /
• 2002

In this paper we first introduce a space of homogeneous type X, and we consider a kind of generalized upper half-space X $\times$ (0, $\infty$). We are mainly concerned with some inequalities in terms of Carleson measures or in terms of certain maximal operators with respect to general approach regions in X $\times$ (0, $\infty$). The main tool of the proof is the Whitney decomposition.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.24 no.2
• /
• pp.161-197
• /
• 2020

Total variation minimization is standard in mathematical imaging and there have been numerous researches over the last decades. In order to process large-scale images in real-time, it is essential to design parallel algorithms that utilize distributed memory computers efficiently. The aim of this paper is to illustrate recent advances of domain decomposition methods for total variation minimization as parallel algorithms. Domain decomposition methods are suitable for parallel computation since they solve a large-scale problem by dividing it into smaller problems and treating them in parallel, and they already have been widely used in structural mechanics. Differently from problems arising in structural mechanics, energy functionals of total variation minimization problems are in general nonlinear, nonsmooth, and nonseparable. Hence, designing efficient domain decomposition methods for total variation minimization is a quite challenging issue. We describe various existing approaches on domain decomposition methods for total variation minimization in a unified view. We address how the direction of research on the subject has changed over the past few years, and suggest several interesting topics for further research.

• Wind and Structures
• /
• v.10 no.2
• /
• pp.177-208
• /
• 2007

Few mathematical methods attracted theoretical and applied researches, both in the scientific and humanist fields, as the Proper Orthogonal Decomposition (POD) made throughout the last century. However, most of these fields often developed POD in autonomous ways and with different names, discovering more and more times what other scholars already knew in different sectors. This situation originated a broad band of methods and applications, whose collation requires working out a comprehensive viewpoint on the representation problem for random quantities. Based on these premises, this paper provides and discusses the theoretical foundations of POD in a homogeneous framework, emphasising the link between its general position and formulation and its prevalent use in wind engineering. Referring to this framework, some applications recently developed at the University of Genoa are shown and revised. General remarks and some prospects are finally drawn.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.15 no.1
• /
• pp.23-35
• /
• 1990

A mathematical model for a dynamic capacitate facility location problem is formulated by a mixed integer problem. The objective of the model is to minimize total discounted costs that include fixed charges and distributed costs. The Cross Decomposition method of Van Roy is extended and applied to solve the dynamic capacitated facility location problem. The method unifies Benders Decomposition and Lagrangean relaxation into a single framework. It successively solves a transportation problem and a dynamic uncapacitated facility location problem as two subproblems. Computational results are compared with those of general mixed integer programming.

• Journal of the Chungcheong Mathematical Society
• /
• v.8 no.1
• /
• pp.29-36
• /
• 1995