• 대한수학회보
• /
• 제56권3호
• /
• pp.757-777
• /
• 2019

In this paper, we study the convergence analysis of the sequences generated by the proximal point method for an infinite family of pseudo-monotone equilibrium problems in Banach spaces. We first prove the weak convergence of the generated sequence to a common solution of the infinite family of equilibrium problems with summable errors. Then, we show the strong convergence of the generated sequence to a common equilibrium point by some various additional assumptions. We also consider two variants for which we establish the strong convergence without any additional assumption. For both of them, each iteration consists of a proximal step followed by a computationally inexpensive step which ensures the strong convergence of the generated sequence. Also, for this two variants we are able to characterize the strong limit of the sequence: for the first variant it is the solution lying closest to an arbitrarily selected point, and for the second one it is the solution of the problem which lies closest to the initial iterate. Finally, we give a concrete example where the main results can be applied.

• Communications for Statistical Applications and Methods
• /
• 제24권3호
• /
• pp.211-226
• /
• 2017

The chain-ladder method, for which run-off data is employed is popularly used in the rate-adjustment and loss-reserving practices of non-life-insurance and health-insurance companies. The method is applicable when the underlying assumption of a consistent development pattern is in regards to a cumulative loss payment after the occurrence of an insurance event. In this study, a modified chain-ladder algorithm is proposed for when the assumption is considered to be only partially appropriate for the given run-off data. The concept of a structural-change point in the run-off data and its reflection in the estimation of unpaid loss amounts are discussed with numerical illustrations. Experience data from private health insurance coverage in Korea were analyzed based on the suggested method. The performance in estimation of loss reserve was also compared with traditional approaches. We present evidence in this paper that shows that a reflection of a structural-change point in the chain-ladder method can improve the risk management of the relevant insurance products. The suggested method is expected to be utilized easily in actuarial practice as the algorithm is straightforward.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2008년도 하계종합학술대회
• /
• pp.739-740
• /
• 2008

Method for 3D reconstruction from image points and geometric clues can be roughly classified as "model-based" and "constraint-based". We present a new method to reconstruct from one image a scene using depth-point. The our method is benchmarked synthetic data and its effectiveness is shown on photograph data.

• 한국컴퓨터정보학회논문지
• /
• 제25권3호
• /
• pp.169-176
• /
• 2020

본 연구는 이송 중 심장정지 환자에게 가슴압박의 질을 높일 수 있는 방법을 제안하였다. 병원 전 단계에서 심장정지 환자에게 심폐소생술을 제공 할 때 구급차에 고정되어 있는 3점식 벨트를 사용하여 가슴압박의 질을 높일 수 있다. 119구급대원이 가슴압박 방법과 더불어 3점식 고정벨트를 착용한 경우 가슴압박의 질이 더 높아졌다. 또한 구급대원의 위험에 노출될 가능성도 적어졌다. 따라서 이송 중 구급차 안에서 3점식 고정벨트를 착용한 경우 119 구급대원은 안전을 확보할 수 있게 되고 심장정지 환자에게는 고품질의 가슴압박을 제공 할 수 있다.

• 대한기계학회:학술대회논문집
• /
• 대한기계학회 2000년도 추계학술대회논문집A
• /
• pp.705-711
• /
• 2000

This paper presents a fast 3D mesh generation method using a surface based method with a stitching algorithm. This method uses the surface based method since the volume based method that uses 3D Delaunay triangulation can hardly deal with a large scale of scanned points. To reduce the processing time, this method also uses a stitching algorithm: after dividing the whole point data into several sections and performing mesh generation on individual sections, the meshes from several sections are stitched into one mesh. Stitching method prevents the surface based method from increasing the processing time exponentially as the number of the points increases. This method works well with different types of scanned points: a scattered type points from a conventional 3D scanner and a cross-sectional type from CT or MRI.

• Journal of Power Electronics
• /
• 제2권3호
• /
• pp.155-161
• /
• 2002

This paper presents a maximum power point tracking algorithm for Photovoltaic array using only instantaneous output current information. The conventional Hill climbing method of peak power tracking has a disadvantage of oscillations about the maximum power point. To overcome this problem, we have developed an algorithm that will estimate the duty ratio corresponding to maximum power operation of solar cell. The estimation of the optimal duty ratio involves, finding the duty ratio at which integral value of output current is maximum. For the estimation, we have used the well know Lagrange's interpolation method. This method can track maximum power point quickly even for changing solar isolation and avoids oscillations after reaching the maximum power point.

• Journal of the Korean Data and Information Science Society
• /
• 제15권3호
• /
• pp.585-592
• /
• 2004

This study detects Korea economic crisis of 1997 using various change-point detection methods and then compares their performance. In change-point detection method, there are three major categories: (1) the parametric approach, (2) the nonparametric approach, and (3) the model-based approach. Through the application to Korea foreign exchange rate during her economic crisis, we compare the employed change-point detection methods and, furthermore, determine which of them performs better.

• 한국컴퓨터그래픽스학회논문지
• /
• 제24권5호
• /
• pp.11-19
• /
• 2018

본 논문에서는 노이즈를 포함한 채 오버랩 영역이 적은 두 점군을 정합할 때 정확도와 수렴 속도를 향상시키는 알고리즘을 제시한다. 정확도를 높이기 위하여 점군의 기하학 정보를 최대한 활용하며, 정합 단계에서는 노이즈가 포함된 점군에서 오버랩 되는 영역을 적절히 선택하고, 개선된 가속 알고리즘을 사용하여 정합 속도를 향상시킨다. 정확도를 향상시키는 기존의 방법은 노이즈가 많은 점군에 적용할 수 없으므로, 본 논문에서는 정합에 사용되는 영역을 선택하는 것으로써 기존 방법의 문제를 해결하였다. 또한 똑같은 점군쌍에서만 적용되는 가속 알고리즘을 낮은 오버랩의 점군쌍에 적용하였다. 기존의 방법에 간단한 알고리즘을 추가함으로써 서너 배 더 빠른 수렴 속도를 낼 수 있도록 하였다. 결론적으로, 노이즈가 많고 오버랩이 적은 점군쌍의 정합에 있어서 본 논문에서 제시하는 알고리즘을 적용하면 속도와 정확도가 향상되었음을 알 수 있다.

• East Asian mathematical journal
• /
• 제29권3호
• /
• pp.279-292
• /
• 2013

It is well known that each kernel function defines a primal-dual interior-point method(IPM). Most of polynomial-time interior-point algorithms for linear optimization(LO) are based on the logarithmic kernel function([2, 11]). In this paper we define a new eligible kernel function and propose a new search direction and proximity function based on this function for LO problems. We show that the new algorithm has ${\mathcal{O}}((log\;p){\sqrt{n}}\;log\;n\;log\;{\frac{n}{\epsilon}})$ and ${\mathcal{O}}((q\;log\;p)^{\frac{3}{2}}{\sqrt{n}}\;log\;{\frac{n}{\epsilon}})$ iteration bound for large- and small-update methods, respectively. These are currently the best known complexity results.

• 호남수학학술지
• /
• 제35권2호
• /
• pp.235-249
• /
• 2013

It is well known that each kernel function defines primal-dual interior-point method (IPM). Most of polynomial-time interior-point algorithms for linear optimization (LO) are based on the logarithmic kernel function ([9]). In this paper we define new eligible kernel function and propose a new search direction and proximity function based on this function for LO problems. We show that the new algorithm has $\mathcal{O}(({\log}\;p)^{\frac{5}{2}}\sqrt{n}{\log}\;n\;{\log}\frac{n}{\epsilon})$ and $\mathcal{O}(q^{\frac{3}{2}}({\log}\;p)^3\sqrt{n}{\log}\;\frac{n}{\epsilon})$ iteration complexity for large- and small-update methods, respectively. These are currently the best known complexity results for such methods.