• Management Science and Financial Engineering
• /
• 제10권1호
• /
• pp.97-106
• /
• 2004

In this paper, we propose an effective cut generation method based on the Chvatal-Gomory procedure for a variable-capacity (0,l)-Knapsack problem with two general integer variables. We first derive a class of valid inequalities for the problem using Chvatal-Gomory procedure, then analyze the associated separation problem. Based on the results, we show that there exists a pseudo-polynomial time algorithm to solve the separation problem. By analyzing the theoretical strength of the inequalities which can be generated by the proposed cut generation method, we show that generated inequalties define facets under mild conditions. We also extend the result to the case in which a nontrivial upper bound is imposed on a general integer variable.

• 대한기계학회논문집A
• /
• 제27권11호
• /
• pp.1809-1814
• /
• 2003

Differential evolution (DE) algorithm is presented and applied to global optimization in this research. DE suggested initially fur the solution to Chebychev polynomial fitting problem is similar to genetic algorithm(GA) including crossover, mutation and selection process. However, differential evolution algorithm is simpler than GA because it uses a vector concept in populating process. And DE turns out to be converged faster than CA, since it employs the difference information as pseudo-sensitivity In this paper, a trial vector and its control parameters of DE are examined and unconstrained optimization problems of highly nonlinear multimodal functions are demonstrated. To illustrate the efficiency of DE, convergence rates and robustness of global optimization algorithms are compared with those of simple GA.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 2002년도 춘계공동학술대회
• /
• pp.23-30
• /
• 2002

본 연구는 추가제약이 있는 최소 신장나무 문제(Constrained Minimum Spanning Tree : CMST문제)에 대한 유사다항시간 알고리듬 및 근사 해법 개발에 관한 것이다. CMST문제는 NP-hard문제임이 이미 증명되었으며, 이후 이 문제에 대해서는 근사해법 개발이 주된 관심이 되어왔다 [Ravi and Goemans 96]는 다항시간 근사 해법(PTAS)을 이미 개발하였고, [Marathe et at 98]은 가능해(feasible solution)는 아니지만, 앞으로 서술할 $(1+1/\varepsilon,\;+\epsilon)$사해를 구하는 완전다항시간 근사해법 (FPTAS)을 제시하였다. 이와는 달리 [Papa. and Yan, 00]는 파레토 근사 최적해를 구하는 FPTAS를 제시하였는데, 본 연구는 이들의 연구에서 주로 의존하고 있는 행렬-나무 정리(Tree-Matrix Theorem)를 보다 일반화하여, CMST문제에 대한 유사다항시간 알고리듬과 $(1+\varepsilon,\;1+\epsilon)$근사해를 구하는 FPTAS를 제시할 것이다.

• Management Science and Financial Engineering
• /
• 제21권1호
• /
• pp.1-9
• /
• 2015

We consider an m-machine flow shop scheduling problem to minimize the latest completion time, where processing times are uncertain. Processing time uncertainty is described through a finite set of processing time vectors. The objective is to minimize maximum deviation from optimality for all scenarios. Since this problem is known to be NP-hard, we consider it with an ordered property. We discuss optimality properties and develop a pseudo-polynomial time approach for the problem with a fixed number of machines and scenarios. Furthermore, we find two special structures for processing time uncertainty that keep the problem NP-hard, even for two machines and two scenarios. Finally, we investigate a special structure for uncertain processing times that makes the problem polynomially solvable.

• 대한산업공학회지
• /
• 제29권4호
• /
• pp.304-311
• /
• 2003

This paper considers a new variation of scheduling problems where jobs are dispatched in batches. The variation is the case where the batch sequence is fixed. The objective is to minimize the sum of the completion times of the batches. This simple environment has a variety of real world applications such as part kitting and customer order scheduling. We show that this problem is binary NP-complete when there exist two machines. For the same problem, we develop an optimal dynamic programming (DP) algorithm which runs in pseudo-polynomial time. We finally prove the optimality of the DP algorithm.

• 대한수학회논문집
• /
• 제20권2호
• /
• pp.339-350
• /
• 2005

We obtain the following two inequalities on a strongly pseudoconvex domain $\Omega\;in\;\mathbb{C}^n\;:\;for\;f\;{\in}\;O(\Omega)$ $$\int_{0}^{{\delta}0}t^{a{\mid}a{\mid}+b}M_p^a(t, D^{a}f)dt\lesssim\int_{0}^{{\delta}0}t^{b}M_p^a(t,\;f)dt\;\int_{O}^{{\delta}O}t_{b}M_p^a(t,\;f)dt\lesssim\sum_{j=0}^{m}\int_{O}^{{\delta}O}t^{am+b}M_{p}^{a}\(t,\;\aleph^{i}f\)dt$$. In [9], Shi proved these results for the unit ball in $\mathbb{C}^n$. These are generalizations of some classical results of Hardy and Littlewood.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제25권4호
• /
• pp.173-195
• /
• 2021

A new implicit discontinuous Galerkin spectral element method (DGSEM) based on the first order hyperbolic system(FOHS) is presented for solving elliptic type partial different equations, such as the Poisson problems. By utilizing the idea of hyperbolic formulation of Nishikawa[1], the original Poisson equation was reformulated in the first-order hyperbolic system. Such hyperbolic system is solved implicitly by the collocation type DGSEM. The steady state solution in pseudo-time, which is the solution of the original Poisson problem, was obtained by the implicit solution of the global linear system. The optimal polynomial orders of 𝒪(𝒽^𝑝+1)) are obtained for both the solution and gradient variables from the test cases in 1D and 2D regular grids. Spectral accuracy of the solution and gradient variables are confirmed from all test cases of using the uniform grids in 2D.

• 대한수학회보
• /
• 제56권1호
• /
• pp.169-178
• /
• 2019

Let $M^{2n+1}$, $n{\geq}1$, be a smooth manifold with a pseudoconvex integrable CR structure of hypersurface type. We consider a sequence of CR invariant subsets $M={\mathcal{S}}_0{\supset}{\mathcal{S}}_1{\supset}{\cdots}{\supset}{\mathcal{S}}_n$, where $S_q$ is the set of points where the Levi-form has nullity ${\geq}q$. We prove that ${\mathcal{S}}{_q}^{\prime}s$ are locally given as common zero sets of the coefficients $A_j$, $j=0,1,{\ldots},q-1$, of the characteristic polynomial of the Levi-form. Some sufficient conditions for local existence of complex submanifolds are presented in terms of the coefficients $A_j$.

• 한국멀티미디어학회논문지
• /
• 제24권3호
• /
• pp.406-415
• /
• 2021

The worldwide spread of the Internet and the digital information revolution have resulted in a rapid increase in the use and transmission of multimedia information due to the rapid development of communication technologies. It is important to protect images in order to prevent problems such as piracy and illegal distribution. To solve this problem, I propose a new digital color image encryption algorithm in this paper. I design a new pseudo-random number generator based on 1D five-neighborhood maximum length cellular automata (FN-MLCA) to change the pixel values of the plain image into unpredictable values. And then I use a 3D chaotic cat map to effectively shuffle the positions of the image pixel. In this paper, I propose a method to construct a new MLCA by modeling 1D FN-MLCA. This result is an extension of 1D 3-neighborhood CA and shows that more 1D MLCAs can be synthesized. The safety of the proposed algorithm is verified through various statistical analyses.

• 대한공간정보학회지
• /
• 제23권4호
• /
• pp.43-48
• /
• 2015

본 논문은 DGNSS(Differential GNSS) 위치정확도 향상을 위한 PRC(Pseudo-Range Correction) 보정정보 모델링에 관한 연구내용이다. PRC는 DGNSS 기법을 이용하여 측위정확도를 향상시키기 위해 사용되는 보정정보로써 사용자가 통신망을 통해 수신한 뒤 사용된다. 그러나 일시적인 통신두절이나 신호간섭 등으로 인해 위치정확도가 급격히 저하되는 일이 발생한다. 그래서 본 논문에서는 이러한 현상을 방지하기 위해 PRC 보정정보를 다항식 곡선접합 방정식을 이용하여 모델링하고 그 정확도를 평가하였다. 모델링 매개변수를 이용하여 계산한 PRC 추정값과 실제 기준국 수신기에서 생산되는 관측값간의 차이를 계산한 결과 GPS의 경우에는 평균 0.1m, RMSE는 1.3m로 나타났고 대부분의 위성들이 ${\pm}1.0m$ 이내의 편향오차와 3.0m 이내의 RMSE를 보였다. GLONASS의 경우에는 평균 0.2m이고 대부분 ${\pm}2.0m$ 이내에 분포하였다. RMSE는 2.6m로 나타났고 다수의 위성들이 3.0m 이내에 분포하였다. 이런 결과는 모델링을 통해 산출한 추정값이 사용자의 위치정확도를 유지하는데 유효하게 사용될 수 있음을 보였다. 그러나 고도각이 낮은 영역에서 두 값의 차이가 크게 나타나 이에 대한 연구를 추가적으로 수행할 필요성이 있다.