• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2000.11b
• /
• pp.75-80
• /
• 2000

본 논문은 영상복원을 역확산 과정으로 해석하여 복원된 영상을 역확산 방정식의 해로 구하는 알고리즘을 제안한다. 역확산 과정은 물리적으로 불량위치(ill-posed)과정이기 때문에, 이를 정규화 해주어야 하는데 이를 위해서 역확산 과정을 고유함수(eigenfunction)들의 전개로 나타낸 후에 고유함수들의 계수들을 조작하였다. 본 논문에서는 계수들을 조작할 때 영상이 가지고 있는 주파수 특성을 고려하여 한계주파수(cut-off frequency)를 넘은 경우에 계수들을 시간과 주파수의 감소함수로 나타내어 불량위치문제를 해결하였다. 계수를 주파수에 대한 감소함수로 나타낸 것은 영상에 저주파 성분이 많고, 고주파 성분이 영상의 형성에 끼치는 영향이 상대적으로 적다는 영상의 특성을 고려한 것이다. 이러한 감소함수를 사용하였을 때 불량위치 문제를 해결할 수 있다는 것을 증명하였고, 실험적으로 양질의 영상을 산출함을 보였다.

• Journal of the Korean Society for information Management
• /
• v.18 no.3
• /
• pp.29-40
• /
• 2001

In this paper, we suggest a query optimization algorithm to select the optimal processing method of an extended boolean query on inverted files. There can be a lot of methods for processing an extended boolean query according to the processing sequence oh the keywords con tamed in the query, In this sense, the problem of optimizing an extended boolean query it essentially that of optimizing the keyword sequence in the query. In this paper, we show that the problem is basically analogous to the problem of finding the optimal join order in database query optimization, and apply the ideas in the area to the problem solving. We establish the cost model for processing an extended boolean query and develop an algorithm to filled the optimal keyword-processing sequence based on the concept of keyword rank using the keyword selectivity and the access costs of inverted file. We prove that the method selected by the optimization algorithm is really optimum, and show, through experiments, that the optimal method is superior to the others in performance We believe that the suggested optimization algorithm will contribute to the significant enhancement of the information retrieval performance.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.26 no.4
• /
• pp.213-221
• /
• 2013

This paper introduces a mesh continuation scheme for a one-dimensional inverse medium problem to reconstruct the spatial distribution of elastic wave velocities in heterogeneous semi-infinite solid domains. To formulate the inverse problem, perfectly-matched-layers(PMLs) are introduced as wave-absorbing boundaries that surround the finite computational domain truncated from the originally semi-infinite extent. To tackle the inverse problem in the PML-truncated domain, a partial-differential-equations(PDE)-constrained optimization approach is utilized, where a least-squares misfit between calculated and measured surface responses is minimized under the constraint of PML-endowed wave equations. The optimization problem iteratively solves for the unknown wave velocities with their updates calculated by Fletcher-Reeves conjugate gradient algorithms. The optimization is performed using a mesh continuation scheme through which the wave velocity profile is reconstructed in successively denser mesh conditions. Numerical results showed the robust performance of the mesh continuation scheme in reconstructing target wave velocity profile in a layered heterogeneous solid domain.

• Journal of the Korean Society of Hazard Mitigation
• /
• v.8 no.1
• /
• pp.81-87
• /
• 2008

This study is about the back analysis to optimize the uncertain parameters of geotechnical properties used in stability analysis of cut and cover tunnel. The Simplex algorithm, Powell algorithm, Rosenbrock algorithm, and Levenberg-Marquardt algorithm are applied for artificial problems of ground excavation. Furthermore, results are compared in the matter of the reliability of optimal solutions with a certain accuracy and the computation speed for evaluations of variables. As shown in results of numerical analysis, all of four algorithms are converged to exact solution satisfying the allowable criteria. And Levenberg-Marquardt's and Rosenbrock's algorithms are identified to be the more efficient methods in the evaluations of functions. After the back analysis for Poisson ratio and Young's modulus for cut and cover tunnel has been performed, design parameters have been correctly estimated and computation time has been improved while the number of measure points is increased.

• Proceedings of the Korean Information Science Society Conference
• /
• 2011.06c
• /
• pp.299-302
• /
• 2011

승무일정계획이란 특정 기간 동안 운행할 차량들을 대상으로 각 차량마다 필요로 하는 승무원을 배정하는 계획을 말한다. 최적 승무일정계획의 수립은 일반적으로 제약 조건을 만족하는 모든 종류의 개별 다이아를 생성한 다음 이들을 대상으로 모든 차량을 운행할 수 있는 최적조합을 선정하는 방식으로 이루어지고 있다. 승무일정계획 문제의 난이도는 제약 내의 개별 다이아 생성하는 단계에서 생성되는 후보다이아 집합에 많은 영향을 받는다. 본 논문에서는 승무일정계획 문제의 난이도를 줄일 수 있는 후보다이아 집합을 생성하기 위한 방안 2가지를 제시한다. 실제 현장의 승무일정계획 문제를 대상으로 한 실험 결과, 방안들을 적용한 경우에 기존의 방법으로는 수립하기 어려웠던 계획을 빠른 시간 내에 수립할 수 있음을 확인하였다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.7B
• /
• pp.1282-1291
• /
• 2000

기존의 LQ-서보형 PI 설계방법은 보드선도 상에서 저주파와 고주파 영역에서의 루프전단함수의 특이값 일치에 기이한 설계상의 문제를 가지고 있다. 이러한 점을 해결하기 위해 역 최적제어와 볼록형 최적화기법에 기초한 새로운 설계 방법을 제안하고자 한다.

• Proceedings of the Korean Statistical Society Conference
• /
• 2003.05a
• /
• pp.131-136
• /
• 2003

소지역에서 유한모집단의 총계등을 추정하는데 있어서 모형-기반 합성치를 예측한다. 즉, 예측(prediction) 문제로 추정치를 다룬다. 초모집단(super-population) 확률 모형을 세우고 최적의 예측치를 유도한다.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.22 no.4
• /
• pp.95-102
• /
• 2022

This paper proposed a linear time algorithm for a three-partition problem(TPP) in which a polynomial time algorithm is not known as NP-complete. This paper proposes a backtracking method that improves the problems of not being able to obtain a solution of the MM method using the sum of max-min values and third numbers, which are known polynomial algorithms in the past. In addition, the problem of MM applying the backtracking method was improved. The proposed algorithm partition the descending ordered set S into three and assigned to the forward, backward, and best-fit allocation method with maximum margin, and found an optimal solution for 50.00%, which is 5 out of 10 data in initial allocation phase. The remaining five data also showed performance to find the optimal solution by exchanging numbers between surplus boxes and shortage boxes at least once and up to seven times. The proposed algorithm that performs simple allocation and exchange optimization with less O(k) linear time performance complexity than the three-partition m=n/3 data, and it was shown that there could be a polynomial time algorithm in which TPP is a P-problem, not NP-complete.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.6
• /
• pp.193-205
• /
• 2011

This paper suggests $p$-facility locations in $m$ candidate locations and $n$ areas in optimal cost side(population${\times}$shortest distance). This problem has been classified by NP-complete because there is not a polynomial time algorithm. In this paper, we suggests reverse-delete method that deletes a candidate facility one by one from $p=m$ until $p=2$. As a result of the proposed algorithm for the $5{\times}5$ and $7{\times}7$, the initial solution is obtained. For the Swain's 55-node network, we obtain the optimal solution through a solution improvement process with $p=4$ and it by using the initial solution with $p=5$.

• Journal of the Economic Geographical Society of Korea
• /
• v.14 no.2
• /
• pp.116-128
• /
• 2011

Some subway passengers may want to have their fresh vegetables purchased through internet at a service facility within the subway station of the Metropolitan Seoul subway system on the way to home, which raises further questions about which stations are chosen to locate service facilities and how many passengers can use the facilities. This problem is well known as the pickup problem, and it can be solved on a traffic network with traffic flows which should be identified from origin stations to destination stations. Since flows of the subway passengers can be found from the smart card transaction database of the Metropolitan Seoul smart card system, the pickup problem in the Metropolitan Seoul subway system is to select subway stations for the service facilities such that captured passenger flows are maximized. In this paper, we have formulated a model of the pickup problem on the Metropolitan Seoul subway system with subway passenger flows, and have proposed a fast heuristic algorithm to select pickup stations which can capture the most passenger flows in each step from an origin-destination matrix which represents the passenger flows. We have applied the heuristic algorithm to select the pickup stations from a large volume of traffic network, the Metropolitan Seoul subway system, with about 400 subway stations and five millions passenger transactions daily. We have obtained not only the experimental results in fast response time, but also displayed the top 10 pickup stations in a subway guide map. In addition, we have shown that the resulting solution is nearly optimal by a few more supplementary experiments.