• The Transactions of the Korean Institute of Power Electronics
• /
• v.8 no.4
• /
• pp.344-350
• /
• 2003

In this paper, an estimation technique of initial rotor position at standstill in Switched Reluctance Motor(SRM) is proposed. In case search coils are used as a position sensor, it has many advantages like low cost, decrease in the volume, high robust characteristics and wide applications. However, the initial rotor position detection is very difficult because the search coil's EMF is not exist at a standstill. In this paper, a near estimation method of initial rotor position is suggested using squared Euclidean distance. The simulation and experiment for the proposed method are achieved. The validity of the proposed method is verified by experimental results.

• The Transactions of the Korean Institute of Power Electronics
• /
• v.10 no.1
• /
• pp.45-51
• /
• 2005

This paper presents a comparison of rotor position estimation of a switched reluctance motor(SRM) with built-in search coils by three methods. The search coil EMFs are not generated in the SRM with built-in search coils at standstill. So an initial rotor position estimation method is needed. In this paper squared euclidean distance, fuzzy logic and neural network methods we proposed for the estimation of initial rotor position. The simulated results of the three methods are compared. The simulated result of the squared euclidean distance method, which has the best performance, is supported by the experimental result.

• The KIPS Transactions:PartD
• /
• v.14D no.2
• /
• pp.169-180
• /
• 2007

This paper discusses a new unsupervised XML document clustering technique based on the function transform and FFT(Fast Fourier Transform). An XML document is transformed into a discrete function based on the hierarchical nesting structure of the elements. The discrete function is, then, transformed into vectors using FFT. The vectors of two documents are compared using a weighted Euclidean distance metric. If the comparison is lower than the pre specified threshold, the two documents are considered similar in the structure and are grouped into the same cluster. XML clustering can be useful for the storage and searching of XML documents. The experiments were conducted with 800 synthetic documents and also with 520 real documents. The experiments showed that the function transform and FFT are effective for the incremental and unsupervised clustering of XML documents similar in structure.

• Journal of the Korean Chemical Society
• /
• v.46 no.4
• /
• pp.317-323
• /
• 2002

The composition of trace materials in domestic circulated LPG are determined. The sampling points are two cylinders of LPG cylinder re-inspection center, six vaporizer of LPG-supplying group facilities, and the compressed oil from one LPG station. In the trace materials from cylinder of LPG cylinder-reinspection center, alkene and diene derivative (No. of carbon ${\leq}9),$ aromatic compounds, and tarry chemicals(No. of carbon ${\geq}10)$ are 1.5~39.9%, 0.7%, 57.8~96.0%, respectively. While in the trace materials from LPG-supplying group facilities and in the oil from LPG station, tarry chemicals(No. of carbon>10) exceed 96.6%. Nine samples are classified into three clusters. One cluster is the sample of SE company cylinder-reinspection center(Euclidian distance between S company LPG cylinder-reinspection center and SE company cylinder-reinspection center=2.11), the other is the sample of SE company LPG cylinder-reinspection center(Euclidian distance between from samples of LPG-supplying group facilities including compressed oil from LPG station=0.110) the third is the samples of LPG-supplying group facilities(Euclidian distances among them<0.075). The compositions of samples from LPG-supplying group facilities are similar to those of oil from LPG station. Furthermore densities of samples from LPG-supplying group facilities and compressed oil in LPG station are 0.873, 0.873 [0.00798 (99% confidence limits) respectively. It was presumed that tarry chemicals had been leached from the compressed oil of LPG supplying facilities.

• The KIPS Transactions:PartD
• /
• v.13D no.7 s.110
• /
• pp.879-888
• /
• 2006

Recently many researchers have focused on management of Historical trajectories of moving objects in Euclidean spaces due to numerous sizes of accumulated data over time. However, the movement of moving objects in real applications generally has some constraints, for example vehicles on roads can only travel along connected road networks. In this paper, we propose an indexing method for trajectories of moving objects on road networks in order to process the network-based spatiotemporal range query. Our method contains the connect information of road networks to use the network distance for query processing, deals with trajectories which are represented by road segments in road networks, and manages them using multiple R-trees assigned per each road segment. Furthermore, it has a structure to be able to share R-tree among several road segments in large road networks. Consequently, we show that our method takes about 30% less in node accesses for the network-based spatiotemporal range query processing than other methods based on the Euclidean distance by experiments.

• Proceedings of the Acoustical Society of Korea Conference
• /
• 1993.06a
• /
• pp.80-83
• /
• 1993

본 논문에서는 양질의 규칙합성을 얻기 위하여, 유성음에 대한 여기신호로 임펄스 스펙트럼과 노이즈 스펙트럼을 다중대역으로 혼합하여 생성한 여기신호를 규칙합성에 적용하는 방법을 제안한다. 이 방법에서는, 분석합성에서 각 프레임별로 요구되었던 혼합여기신호에 대한 정보량 문제를 해결하기 위해 유성음의 정상부분의 한 프레임에 대해 혼합여기신호를 구하여 규칙합성에 적용하였고, 정보량을 더욱 줄이는 방안으로, 켑스트럼 유클리디안 거리를 이용하여 유성음을 분류하여, 각 그룹에 대한 대표 여기신호를 규칙합성의 여기신호로 사용하였다. 제안된 방법으로 음성을 합성한 결과 양질의 합성음을 얻을 수 있음을 확인하였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 1999.10a
• /
• pp.331-333
• /
• 1999

데이터웨어하우스의 주된 용도는 비즈니스 의사결정이며, 이를 위한 경향 및 패턴을 찾는 문제는 매우 중요한 연구분야이다. 경향 및 패턴은 데이터웨어하우스 내의 데이터간의 상호관계를 분석함으로써 찾을 수 있는데, 이를 위한 유사성 검색기법 중 특히 뛰어난 3가지 기법들을 자세히 알아보고, 이들에 모두 적용 가능한 히스토그램 비교법을 제안하였다. 제안된 히스토그램 비교법을 이용하면 유클리디안 거리측정의 부담을 대폭 줄여, 전체 처리시간을 비약적으로 감소시킬 수 있다.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2021.07a
• /
• pp.655-658
• /
• 2021

본 논문에서는 GPU 아키텍처를 이용하여 적응형 부호 거리장을 최적화하여 빠르게 구축하고 시각화 할 수 있는 방법에 대해 제안한다. 쿼드트리를 효율적으로 GPU 메모리로 전달하고, 이를 활용하여 삼각형에 대해 유클리디안 거리를 각 스레드 별로 병렬처리하여 최단 거리를 찾는다. 이 과정에서 GPU를 사용하여 삼각형으로 구성된 3D 메쉬로부터 빠르게 적응형 부호 거리장을 계산할 수 있는 최적화 기법과 절단면 보기, 특정 위치의 값 조회, 실시간 레이트레이싱 및 충돌처리 작업을 빠르고 효율적으로 수행할 수 있는지를 보여준다. 또한, 제안하는 프레임워크를 활용하면 하이 폴리곤 메쉬도 1초 내외로 부호 거리장을 계산할 수 있기 때문에 강체뿐만 아니라 변형체에도 충분히 활용될 수 있다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2010.06c
• /
• pp.49-52
• /
• 2010

본 논문에서는 윤곽선 이미지 매칭에서 회전-불변 거리를 계산하는 효율적 방법을 제안한다. 회전-불변 거리 계산은 이미지 시계열을 한 칸씩 회전하면서 매번 유클리디안 거리를 계산해야 하는 고비용의 연산이다. 본 논문에서는 엔빌로프 기반 하한을 사용하여 불필요한 회전-불변 거리 계산을 크게 줄이는 효율적인 해결책을 제시하다. 이를 위해, 먼저 질의 시퀀스 대상의 엔빌로프 작성과 이의 하한 개념을 제시한다.다음으로, 엔빌로프 기반 하한을 회전-불변 거리 계산에 사용하면 많은 수의 회전-불변 거리계산을 줄일 수 있음을 보인다. 실험 결과, 제안한 엔빌로프 기반 매칭 기법은 기존 기법에 비해 최대 수배에서 수십배까지 매칭 성능을 향상시킨 것으로 나타났다.

• The Journal of the Korea Contents Association
• /
• v.19 no.2
• /
• pp.186-193
• /
• 2019

This article compares the weighted geometric median with the centroid, from the question why they use the centroid when they would find the single facility location(the weighted geometric median) which minimize the sum of weighted Euclidean distances in some text books and papers. Firstly, we show that the demand point whose volume of demand exceeds the half of total demand is the weighted geometric median differently from the centroid, and we examine the weighed geometric median when every demand point is located on a line. Meanwhile, we could simply see that the geometric median and the centroid are coincident in the special case when every demand point is located at a vertex of a regular polygon, and every volume of demand is equal. Furthermore, the geometric medians of convex tetragons could be simply attained unlike triangles.