• Proceedings of the Korean Society of Machine Tool Engineers Conference
• /
• 2004.10a
• /
• pp.422-427
• /
• 2004

The tool geometry parameters and cutting process have complex relationships. Until now, various cutting test were needed to acquire optimal design of end mill for the purpose of high speed machining, due to the insufficient knowledge about cutting process in high speed machining. Using various tools with different geometry, relationships between tool geometry parameter (rake angle, clearance angle, length of cutter) and cutting process (cutting force, surface accuracy, surface roughness) have been studied. Acquired data can be used to design optimal tool for high speed machining and to develop a software for design of end mill geometry.

• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10b
• /
• pp.217-219
• /
• 1998

시간지원 데이터베이스는 시간에 따른 이력데이터가 단조증가 형태를 띄고 있는데 반해 이력질의는 주로 최근 생성된 데이터에 관한 질의 비율이 상대적으로 높다. 또한 방대한 양의 데이터를 관리하기 위해 3차 저장장치를 효율적으로 사용할 필요가 있으며 이를 위해 시간지원 데이테베이스 관리시스템은 특정 시간마다 이력데이터를 3차 저장자치에 이동시키는 버큐밍(Vacuming)작업을 수행한다. 이 논문에서는 이력데이터 페이지와 현재 데이터 페이지의 시간선상에서의 참조 빈도수를 고려하며, 이력질의에 대하여는 페이지의 과거의 참조밀도 이력을 고려하여 버퍼를 관리하는 LRU/PRD기법을 제안한다.

• Journal of KIISE:Databases
• /
• v.29 no.5
• /
• pp.367-380
• /
• 2002

Due to recent increase in applications requiring huge amount of data such as spatial data analysis and image analysis, clustering on large databases has been actively studied. In a hierarchical clustering method, a tree representing hierarchical decomposition of the database is first created, and then, used for efficient clustering. Existing hierarchical clustering methods mainly adopted the bottom-up approach, which creates a tree from the bottom to the topmost level of the hierarchy. These bottom-up methods require at least one scan over the entire database in order to build the tree and need to search most nodes of the tree since the clustering algorithm starts from the leaf level. In this paper, we propose a novel top-down hierarchical clustering method that uses multidimensional indexes that are already maintained in most database applications. Generally, multidimensional indexes have the clustering property storing similar objects in the same (or adjacent) data pares. Using this property we can find adjacent objects without calculating distances among them. We first formally define the cluster based on the density of objects. For the definition, we propose the concept of the region contrast partition based on the density of the region. To speed up the clustering algorithm, we use the branch-and-bound algorithm. We propose the bounds and formally prove their correctness. Experimental results show that the proposed method is at least as effective in quality of clustering as BIRCH, a bottom-up hierarchical clustering method, while reducing the number of page accesses by up to 26～187 times depending on the size of the database. As a result, we believe that the proposed method significantly improves the clustering performance in large databases and is practically usable in various database applications.

• Journal of KIISE:Databases
• /
• v.36 no.4
• /
• pp.247-253
• /
• 2009

Rank learning and processing have gained much attention in the IR and data mining communities for the last decade. While other data mining techniques such as classification and regression have been actively researched to interoperate with RDBMS by using the tightly coupled or loose coupling approaches, ranking has been researched independently without integrating into RDBMS. This paper proposes a tightly coupled integration of the Ranking SVM into MySQL in order to perform the rank learning task efficiently within the RDBMS. We implemented new SQL commands for learning ranking functions and predicting ranking scores. We evaluated our tightly coupled integration of Ranking SVM by comparing it to a loose coupling implementation. The experiment results show that our approach has a performance improvement of $10{\sim}40%$ in the training phase and 60% in the prediction phase.

• Journal of KIISE:Databases
• /
• v.31 no.1
• /
• pp.13-22
• /
• 2004

With the proliferation of multimedia data, there is an increasing need to support the indexing and retrieval of high-dimensional image data. Although there have been many efforts, the performance of existing multidimensional indexing methods is not satisfactory in high dimensions. Thus the dimensionality reduction and the approximate solution methods were tried to deal with the so-called dimensionality curse. But these methods are inevitably accompanied by the loss of precision of query results. Therefore, recently, the vector approximation-based methods such as the VA- file and the LPC-file were developed to preserve the precision of query results. However, the performance of the vector approximation-based methods depend largely on the size of the approximation file and they lose the advantages of the multidimensional indexing methods that prune much search space. In this paper, we propose a new index structure called the GC-tree for efficient similarity search in image databases. The GC-tree is based on a special subspace partitioning strategy which is optimized for clustered high-dimensional images. It adaptively partitions the data space based on a density function and dynamically constructs an index structure. The resultant index structure adapts well to the strongly clustered distribution of high-dimensional images.

• Journal of KIISE:Databases
• /
• v.32 no.5
• /
• pp.547-557
• /
• 2005

The purpose of selectivity estimation is to maintain the summary data in a very small memory space and to minimize the error of estimated value and query result. In case of estimating selectivity for large spatial data, the existing works need summary information which reflect spatial data distribution well to get the exact result for query. In order to get such summary information, they require a much memory space. Therefore In this paper, we propose a new technique cumulative density wavelet Histogram, called CDW Histogram, which gets a high accurate selectivity in small memory space. The proposed method is to utilize the sub-histograms created by CD histogram. The each sub-histograms are used to generate the wavelet summary information by applying the wavelet transform. This fact gives us good selectivity even if the memory sire is very small. The experimental results show that the proposed method simultaneously takes full advantage of their strong points - gets a good selectivity using the previous histogram in ($25\%\~50\%$) memory space and is superior to the existing selectivity estimation techniques. The proposed technique can be used to accurately quantify the selectivity of the spatial range query in databases which have very restrictive memory.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.45 no.3
• /
• pp.54-59
• /
• 2008

A highly accurate wide swing BiCMOS cascode current mirror is proposed. It uses the base-current compensated BJT current mirror. It increases both output impedance and output voltage range by using the npn-NMOS cascode instead of the NMOS-NMOS cascode. The npn transistor copies the input current and the NMOS transistor increases the output impedance for the accurate current mirroring. The proposed current mirror achieves highly constant current for wide output voltage range. Simulation results were verified with measurements performed on a fabricated chip using a 5/16V 0.5um BCD process. It has only $-2.5%{\sim}1.0%$ current error for $0.3V{\sim}16V$ output voltage range.

• Asia-pacific Journal of Multimedia Services Convergent with Art, Humanities, and Sociology
• /
• v.5 no.5
• /
• pp.167-176
• /
• 2015

Due to the variety of tourist attractions, many people of the world are visiting annually in Mediterranean area. In this paper, we analyze Mediterranean tourism impact by specific events such as the Arab Spring. In details, we make several density maps based on the position and time information of the geo-tagged photos extracted from Panoramio which is a representative photo sharing website. These density maps should be used to analyze how can specific events affect on Mediterranean tourism. To do this, first, a spatial database is constructed using geo-tag and time information of photo data extracted from Panoramio. Using GIS tool, then, several density maps are produced after performing density process based on spatial databases. Based on these density maps, finally, we analyze visually on Mediterranean tourism impact according to before, progress, and after of the Arab Spring.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2004.05a
• /
• pp.265-265
• /
• 2004

최근 IT산업으로 대표되는 광통신 및 광신호 전달에 이용되는 광 반사경 및 렌즈어레이, 광가이드 판넬(BLU, FLU)등 광부품의 수요가 급증하고 있고, 이의 생산을 위한 다양한 제조공정이 연구 개발되고 있다 근년까지 이러한 마이크로 광부품의 제조방법은 포토리소그래피, 에칭기술을 베이스로 한 MEMS 기술, PDMS를 이용한 복재기술에 크게 의존하고 있다. 기계적 가공법으로는 오래전부터 초정밀 경면 선삭이나 연삭에 의한 마이크로 렌즈와 미세 패턴의 금형가공이 이루어져 왔다.(중략)

• Proceedings of the International Union of Geodesy And Geophysics Korea Journal of Geophysical Research Conference
• /
• 2003.05a
• /
• pp.16-16
• /
• 2003

본 연구는 ILP(International Lithosphere Project) Task Group II-4가 진행하고 있는 상부맨틀에 대한 3차원 구조도 작성 연구의 일환으로 수행되어졌으며 구조도 작성을 위한 데이터 베이스의 구조는 task group의 표준안을 따랐다. 기존 문헌과 기존의 데이터 베이스를 통해서 획득된 자료를 이용해 동해와 그 주변을 대상으로 하는 지역의 ($32-45^{\circ}$E, $122-148^{\circ}$N) 상부 670km까지의 3차원 구조도 작성을 위한 초기 모델을 구축하였으며, 이 절차를 최대한 자동화하는 프로그램을 포트란을 이용해 만들어보았다. 연구 지역에 대한 곡율을 계산하기 위해 표준타원체 모델인 WGS84과 geoid undulation 모델인 EGM96을 사용했으며 지형 고도 자료는 GTOPO30, GLOBE 1.0, 그리고 Smith and Sandwell 데이터베이스를 사용하여 지구 중심으로부터 지표까지의 거리를 구하였다. 연구지역은 $0.25^{\circ}$간격으로 나누었으며 총 5777개의 격자점을 정의하였으며 각각의 격자점에 1차원 수직구조를 부여함으로써 3차원 모델을 구축하였다. 그리고 지형적으로나 지질학적으로 유사한 지역을 하나의 구역으로 정의하고 동일한 수직구조를 부여함으로써 모든 격자점에 1차원 수직구조를 정의하지 않도록 하였다. 본 연구에서는 지표 지질은 모델에 고려하지 않았지만 지형학적으로 의미가 있는 분지나 수평적으로 불균질성이 뚜렷한 지역을 중심으로 연구 지역의 리젼을 정의하였다. 중요 리젼에 대한 지각구조에 대해서는 기존의 문헌을 통해 모델치를 정의하였으며 지각 하부부터 상부 670km에 대한 부분은 Task Group에서 제시한 표준 모델을 이용했다. 모델을 정의하기 위해 주어진 격자점에 대한 지구 중심으로부터 지오이드까지의 거리, 지오이드로부터 지표까지의 거리를 정의해주었으며, 각 격자점의 수직구조를 정의하기 위해 깊이에 따른 각 매질의 밀도, P파의 속도, S파의 속도, P파에 대한 Q값, S파에 대한 Q값을 정의 해주었다. S파의 속도를 구하기 위해서 지구 내부 물질을 포아송 매질이라는 가정 하에, 관계식을 $Vp{\;}={\;}SQRT(3){\;}{\times}{\;}Vs$ 이용하였다. 획득한 모델치들을 이용해 동해와 동해 인근 지역에 대한 초기모델을 구축하였다.