http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Mathematical Properties of the Medial Axis Transform for Analytic Curves with Some Irrengularities
위남숙 漢城大學校 2000 論文集 Vol.24 No.2
We construct the medial axis transform of a 2-dimensional domain by decomposing the domain into simpler subdomains. Our method is different from the conventional ones and works well for the shape whose boundary consists of free form curves such as polynomial or rational splines with finite number of points of infinite curvature.
Some Mathematical Properties of Two-Dimensional Offsets in Terms of Medial Axis Transform
위남숙 漢城大學校 2001 論文集 Vol.25 No.1
An important theorem stating the interplay between the 2-dimensional offsets and medial axis transform is proved. To do so, we introduce and use the basic concepts and fundamental results in the theory of medial axis transform. Our result can serve as a foundation to devise new efficient algorithm for computing planar offsets of a given domain.
A Neural Network Model for Assessing Expert Judgements
위남숙 漢城大學校 1992 論文集 Vol.16 No.1
We propose a new approach for incorporating conflicting expert opinions in decision making. Our approach utilizes the recent ideas and techniques of the neural network models. Our model can be used as the mediator of several expert systems and also is applicable to group decision support systems. We have tested our model in a simple simulated situation with positive results.
Calculation of the Intersection between Bezier Curves and Reparametrization of the Bezier Segments
위남숙 漢城大學校 1995 論文集 Vol.19 No.1
본 논문에서는 외각선이 Bezier curve로 표시되는 graphic objects가 서로 만났을 때에 그 교점을 구하는 새로운 algorithm을 제안한다. 두 개의 곡선의 교점을 구하는 algorithm은 여러가지가 연구되었다. 그 중에서도 Newton-Raphson algorithm은 일반적으로 다른 algorithm보다 속도가 빠르나, 평행한 도함수를 갖는 곡선에 대해서는 속도가 느리고 안정적이지 못하다. 본 논문에서 연구된 steepest descent method는 두 곡선의 거리함수를 도입하여 그 거리 함수의 gradient 방향으로 움직이며 해를 찾아 나가므로 속도가 빠르며 안정적이다. 또한 본 논문에서는 Bezier 곡선의 일부분을 새로운 Bezier 곡선으로 reparametrize하는 technique을 제시하였다. 이것은 graphic object의 intersection이나 union의 외각선을 표현할 때 필요한 technique이다. In this paper, we investigate the case of two intersecting graphic objects whose boundaries are represented by Bezier curves. We propose a new algorithm to calculate the intersection points of the objects' boundaries and rerepresent the intersecting segment of the boundary as a new Bezier curve.
A FAST METHOD FOR GENERATING OFFSET CURVES IN CAD/CAM
WEE, NAM-SOOK 漢城大學校 1998 論文集 Vol.22 No.3
A fast method of computing the offset curves of a planar shape by using the medial axis transform is discussed. The medial axis transform is constructed by decomposing the domain into simpler subdomains, called fundamental domains, and the offset curves have only to be computed for such fundamental domains. This differentiate our method from the conventional ones which use the Voronoi diagram. Our method works well for the shape whose boundary consists of free form curves such as polynomial or rational splines, and it also avoids expensive trimming processes. As a result our method is fast and robust.
A Cost Analysis of Software Reliability Testing Model
Wee, Nam-Sook 漢城大學校 2002 論文集 Vol.26 No.1
With the advancements in software engineering techniques, software testing cost has become the dominant factor for the high cost of large-scale software. We develop a software reliability testing model and analyze the minimal total expected cost so that the management can plan ahead testing activity from a cost-benefit perspective. Our model account for the average cost per each testing activity and the damage cost per failure with the future cost discounted. Our model assumes that the total number of errors in the software has a Poisson distribution with known mean λ and failure rate is i.i.d with known distribution G. We investigate the important structural properties of the cost function in this framework.
Minimization of Tool-Path in NC Milling Operation
Kim, Byeong Keuk,Park, Joon Young,Wee, Nam Sook 동국대학교 산업기술연구원 1997 산업기술논문집 Vol.10 No.-
This paper describes new methods to minimize the cutting time in zigzag milling operation of two dimensional polygonal surfaces. Previous works have been focused mainly on experimental approaches by considering some machining parameters such as, spindle speed, depth of cut, cutter traverse rate, cutter diameter, number of teeth, and so on. However, in this study, we considered a geometrical factor, which is the length of cut. In an N-sided concave or convex polygon, an algorithm has been developed which minimize the total length of cut.