• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1991년도 한국자동제어학술회의논문집(국내학술편); KOEX, Seoul; 22-24 Oct. 1991
• /
• pp.46-51
• /
• 1991

An algorithm of finding a solution to an $H^{\infty}$-minimization problem is proposed, and the solution is obtained explicity in terms of closed-form. We construct an optimal controller subject to the interpolation constraints such that $H^{\infty}$-norm and the minimized value of transfer function matrix are equal.l.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1987년도 한국자동제어학술회의논문집; 한국과학기술대학, 충남; 16-17 Oct. 1987
• /
• pp.96-99
• /
• 1987

In the way of perception and depth finding of 3-D scene stereo vision is one of the best ways. Matching is important problem of stereo vision. In this paper we develop an algorithm that is adaptable to errors and computation time. And we demonstrate the way of matching.

• 대한수학회지
• /
• 제36권3호
• /
• pp.609-619
• /
• 1999

We give a mathematically rigorous description of the recently popular latent semantic indexing (LSI) method in text information retrieval theory. Also, a related problem of finding a document ranking function in linear relevance feedback is discussed.

• 한국측량학회:학술대회논문집
• /
• 한국측량학회 2003년도 춘계학술발표회 논문집
• /
• pp.527-530
• /
• 2003

The LBS is accurately finding the point such as the moving people or objects and serves information to their position. This study explains the trend of the LBS technology, indicates problems of the recent LBS.

• Journal of applied mathematics & informatics
• /
• 제9권1호
• /
• pp.77-86
• /
• 2002

Ford and Fulkerson have shown that a stationary maximal dynamic flow can be obtained by solving a transhipment problem associated with the static network and thereby finding the maximal temporally repeated dynamic flow. This flow is known to be an optical dynamic flow. This paper presents an algorithm for second best temporal1y repeated flows. A numerical example is presented.

• Journal of the Korean Statistical Society
• /
• 제32권1호
• /
• pp.1-10
• /
• 2003

We consider obtaining graphical summaries of uncertainty in estimates of parameters in nonlinear models. A nonlinear constrained optimization algorithm is developed for likelihood based confidence intervals for the functions of parameters in the model The results are applied to the problem of finding significance levels in nonlinear models.

• 한국정보처리학회논문지
• /
• 제5권11호
• /
• pp.2823-2834
• /
• 1998

본 논문에서는 병렬 프로그램을 구성하는 $2^n$개의 타스크 모듈들을 n-차원 하이퍼큐브 다중 컴퓨터에 전체 통신 비용이 최소가 되도록 일대일 매핑하는 문제를 다룬다. 하이퍼큐브에서 최적 매핑을 구한 것은 NP-complete문제이다. 본 논문에서는 먼저 하이퍼큐브 다중 컴퓨터에서의 매핑 문제를 그래프 상에서의 최대 컷세트 집합을 구하는 문제로 변환시키는 그래프 변형 기법을 제안한다. 이러한 그래프 변형 기법을 사용하여 기존의 그래프 이분할 방법을 변형된 그래프 상에 반복 적용함으로써 하이퍼큐브에 타스크 모듈들을 효율적으로 일대일 매핑하는 반복 매핑 알고리즘을 제안한다. 여러가지 타스크그래프 상에서의 실험을 통해, 제안된 반복 매핑 알고리즘이 기존의 greedy나 recursive 매핑 알고리즘들 보다 성능이 우수함을 보인다. 특히 제안된 알고리즘은 하이퍼큐브-isomorphic, 메쉬등과 같은 정형 그래프 상에서 성능이 우수하며 거의 모든 정형 그래프에서 최적 매핑을 찾음을 보인다.

• 품질경영학회지
• /
• 제45권2호
• /
• pp.227-246
• /
• 2017

Purpose: This study proposes a Shiny-Sigma Methods that combines the advantages of Six Sigma method and Shainin method in order to solve field defect. Each technique has advantages and disadvantages. Methods: This study proposed Shiny-Sigma by combining Six Sigma has the logical advantage of the problem solving road map and Shiny has the merits of finding the root problem from the defective phenomenon. The Six Sigma method has the disadvantage that it is difficult to solve if the number of data is small, but the Shiny method has the advantage of finding the root cause with a small number of data. Results: As a result of applying Shiny-Sigma method to the field, it has advantages of solving the problem easily and quickly than the existing Six Sigma method. It does not require a lot of statistical knowledge, which helps field workers to use it. Based on these successes L Co. company has obtained the effect of improving the production quality by applying the Shiny-Sigma method. Conclusion: The Shiny-Sigma method proved to be suitable for the production site as a result of field application. It is suitable for field workers with low statistical knowledge and is suitable for field where data is difficult to obtain. This method is not a method to solve all the problems because there are problems that can be solved according to the field problems. We hope that this method will spread to many industrial sites and this method will have a great effect on the improvement of field production quality.

• 품질경영학회지
• /
• 제50권2호
• /
• pp.265-286
• /
• 2022

Purpose: The time and cost of a project activity exists in a selected mode and there is a quality level for the selected mode, and the time and cost of the current activity is determined by the quality level of the preceding activity. When an activity is a predecessor activity of an activity, it is characterized as a trade-off problem in which the time and cost of the activity are determined according to the quality level of the activity. Methods: A neighbor search heuristic algorithm obtains a solution by (1) randomly determining the mode, quality level, and assignment order for each activity. (2) get a solution by improving the solution by changing the possible modes and quality levels; (3) to find a solution by improving the solution from the point where it is feasible to advance the start time. Here, Case[1] is a method to find the optimal solution value after repeating (1). Case [2] is a method for finding a solution including (1) and (2). Case [3] refers to a method for finding solutions including (1), (2), and (3). Results: It can be seen that the value of the objective function presented by the algorithm changes depending on how the model of the heuristic algorithm is designed and applied. In other words, it suggests the importance of algorithm design and proves the importance of the quality problem of activities in the project schedule. Conclusion: A study significance of the optimization algorithm and the heuristic algorithm was applied to the effect of the quality of the preceding activity on the duration and cost of itself and the succeeding activity, which was not addressed in the project schedule problem.

• 대한수학교육학회지:학교수학
• /
• 제16권1호
• /
• pp.19-37
• /
• 2014

현대사회는 대량 정보들을 수집하고 활용하는 정보화 사회로 현대인들에게 통계적 소양이 요구된다. 이에 따라 학교수학에서 통계적 소양의 중요성이 점차 강조되고 있으며, 현직교사나 예비교사들에 대한 통계적 소양 능력의 함양 및 지도 능력 향상이 요구되고 있다. 한편 확률변수는 통계 학습에서 가장 기초적인 개념으로 통계량을 다룰 때에 확률변수를 정의하는 과정으로부터 시작된다. 이에 본 연구에서는 고등학교 통계 영역의 기본 개념인 확률변수 개념에 대한 예비교사들의 이해 정도를 탐색해 보고자 하였다. 이를 위하여 우선적으로, 본 연구의 핵심 내용인 확률변수 개념의 이해도를 보다 정확하게 파악하기 위하여 학문적 측면에서의 정의, 상황에서 드러나는 확률변수의 의미, 그리고 현행(2007 개정) 고등학교 교과서에서의 정의 측면으로 구분하여 재탐색, 정리하고자 하였다. 이를 기반으로, 예비교사 대상의 확률변수 개념의 이해 정도를 조사하기 위한 설문 문항을 마련하였으며, 이를 통해 예비교사들의 확률변수에 대한 이해 정도를 조사하여 분석하였다. 이를 토대로 확률변수 개념 및 전반적인 통계 개념에 대한 교수-학습에 대한 시사점을 제시하고자 하였다.