• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.7A
• /
• pp.1162-1169
• /
• 2001

유연 패턴은 시간 축으로 확장 및 수축할 수 있는 요소들의 순서화된 리스트이다. 유연 패턴은 서로 다른 샘플링 비율을 갖는 데이터 시퀀스들로부터 규칙들을 찾아내는데 유용하게 사용된다. 본 연구에서는 헤드(head: 규칙의 왼쪽 부분)와 바디(body: 규칙의 오른쪽 부분)가 모두 유연 패턴으로 구성된 규칙들을 신속하게 찾도록 하기 위하여 데이터 시퀀스로부터 서픽스 트리(suffix tree)를 구성한다. 이 서픽스 트리는 유연 규칙들의 압축된 표현이며, 타깃 헤드 시퀀스와 매치되는 규칙을 찾기 위한 인덱스 구조로서 사용된다. 만일, 매치되는 규칙을 찾을 수 없는 경우에는 규칙 완화(rule relaxation)의 개념을 이용한다. 클러스터 계층(cluster hierarchy)과 완화 오차(relaxation error)를 사용하여 타깃 헤드 시퀀스의 고유한 정보를 대부분 포함하고 있는 최소한으로 완화된 규칙을 찾는다. 다양한 실험을 통한 성능 평가를 통하여 제안한 기법의 우수성을 검증한다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.5
• /
• pp.986-991
• /
• 2016

In this study, we prepared ITO thin films on $Nb_2O_5/SiO_2$ double buffer layer using DC magnetron sputtering method and investigated electrical and optical properties with various substrate temperatures (room temperature ~ $400^{\circ}C$). The resistivity showed a decreasing tendency, because crystallinity has been improved due to the enlarged grain size with increasing substrate temperature. ITO thin film deposited at $400^{\circ}C$ showed the most excellent value of resistivity and sheet resistance as $3.03{\times}10^{-4}{\Omega}{\cdot}cm$, $86.6{\Omega}/sq.$, respectively. In results of optical properties, average transmittance was increased but chromaticity ($b^*$) was decreased in visible light region (400~800nm) with increasing substrate temperature. Average transmittance and chromaticity ($b^*$) of ITO thin film deposited at $400^{\circ}C$ exhibited significantly improved results as 85.8% and 2.13 compared to 82.8% and 4.56 of the ITO thin film without buffer layer. Finally, we found that ITO thin film introduced $Nb_2O_5/SiO_2$ double buffer layer has a remarkably improved optical property such as transmittance and chromaticity due to the index matching effect.

• Proceedings of the Korea Society for Simulation Conference
• /
• 2005.11a
• /
• pp.130-137
• /
• 2005

본 논문은 심장이 수축$\cdot$이완함에 따라 그 형태와 위치가 변하는 관상동맥의 구조와 그 움직임을 사실적으로 표현하기 위한 매개변수적 모델링 기법을 제안한다. 완성된 모델은 관상동맥의 움직임을 관찰함으로써 심장질환 판단에 도움을 주고, 심장시술 시뮬레이션 및 시술계획수립에 사용될 수 있다. 매개변수적 기법으로 생성된 모델은 메쉬 정점의 인덱스만으로 모델간 매칭을 위한 대응점을 찾을 수 있으므로, 시간대별로 달라지는 정점의 위치를 쉽게 추적함으로써 모델의 움직임을 표현할 수 있다. 그러나 이러한 기법으로 생성된 모델은 분리, 접합 등의 변형조작이 어렵고, 트리형태 객체에 적용하기 힘든 단점이 있다. 본 논문에서는 이를 극복하기 위해 분할된 혈관영역의 골격데이타에서 찾아낸 분기점을 중심으로 Generalized Cylinder를 이용하여 실린더 형태의 각 혈관세그먼트를 모델링 한 후, 분기영역을 3개의 하프파이프(half pipe)와 2개의 삼각형 패치로 연결하여 모델링하였다. 완성된 모델은 다시점 관상동맥데이터에 적용하였고, 각 시점에서 구해진 정점의 위치를 선형보간함으로써 부드러운 혈관의 움직임을 나타내었다.

• Progress in Medical Physics
• /
• v.25 no.4
• /
• pp.233-241
• /
• 2014

The aim of this study is to develop a new software tool for 3D dose verification using $PRESAGE^{REU}$ Gel dosimeter. The tool included following functions: importing 3D doses from treatment planning systems (TPS), importing 3D optical density (OD), converting ODs to doses, 3D registration between two volumetric data by translational and rotational transformations, and evaluation with 3D gamma index. To acquire correlation between ODs and doses, CT images of a $PRESAGE^{REU}$ Gel with cylindrical shape was acquired, and a volumetric modulated arc therapy (VMAT) plan was designed to give radiation doses from 1 Gy to 6 Gy to six disk-shaped virtual targets along z-axis. After the VMAT plan was delivered to the targets, 3D OD data were reconstructed from 512 projection data from $Vista^{TM}$ optical CT scanner (Modus Medical Devices Inc, Canada) per every 2 hours after irradiation. A curve for converting ODs to doses was derived by comparing TPS dose profile to OD profile along z-axis, and the 3D OD data were converted to the absorbed doses using the curve. Supra-linearity was observed between doses and ODs, and the ODs were decayed about 60% per 24 hours depending on their magnitudes. Measured doses from the $PRESAGE^{REU}$ Gel were well agreed with the TPS doses at central region, but large under-doses were observed at peripheral region at the cylindrical geometry. Gamma passing rate for 3D doses was 70.36% under the gamma criteria of 3% of dose difference and 3 mm of distance to agreement. The low passing rate was resulted from the mismatching of the refractive index between the PRESAGE gel and oil bath in the optical CT scanner. In conclusion, the developed software was useful for 3D dose verification from PRESAGE gel dosimetry, but further improvement of the Gel dosimetry system were required.

• Journal of KIISE
• /
• v.42 no.1
• /
• pp.97-106
• /
• 2015

Recently, research on database encryption for data protection and query result authentication methods has been performed more actively in the database outsourcing environment. Existing database encryption schemes are vulnerable to order matching and counting attack of intruders who have background knowledge of the original database domain. Existing query result integrity auditing methods suffer from the transmission overhead of verification object. To resolve these problems, we propose a group-order preserving encryption index and a query result authentication method based on the encryption index. Our group-order preserving encryption index groups the original data for data encryption and support query processing without data decryption. We generate group ids by using the Hilbert-curve so that we can protect the group information while processing a query. Finally, our periodic function based data grouping and query result authentication scheme can reduce the data size of the query result verification. Through performance evaluation, we show that our method achieves better performance than an existing bucket-based verification scheme, it is 1.6 times faster in terms of query processing time and produces verification data that is 20 times smaller.

• 한국HCI학회:학술대회논문집
• /
• 2008.02a
• /
• pp.376-379
• /
• 2008

This paper presents an image retrieval algorithm based on feature vector using color of histogram refinement for a faster and more efficient search in the process of content based image retrieval. First, we segment each of R, G, and B images from RGB color image and extract their respective histograms. Secondly, these histograms of individual R, G and B are divided into sixteen of bins each. Finally, we extract the maximum pixel values in each bins' histogram, which are calculated, compared and analyzed, Now, we can perform image retrieval technique using these maximum pixel value. Hence, the proposed algorithm of this paper effectively extracts features by comparing input and database images, making features from R, G and B into a feature vector table, and prove a batter searching performance than the current algorithm that uses histogram matching and ranks, only.

• The KIPS Transactions:PartB
• /
• v.9B no.1
• /
• pp.29-34
• /
• 2002

Fingerprint recognition technology was studied by classification and matching. In general, there are five different classifications left loop, right loop, whore, arch, and tented-arch. These classifications are used to determine which class an individual's fingerprint belong to, thereby identifying the individual's fingerprint pattern. The result of this classification, which is sent to the large fingerprint database as an index, helps reduce the matching time and enhance the accuracy of fingerprint matching. The existing fingerprint classification method relies on the number and location of cores and delta points called singular points. The drawback of this method is the lack of accuracy stemming from the classification difficulty involving unclear and/or partially-erased fingerprints. The current paper presents an efficient classification method to rectify the problem associated with identifying Singular points from unclear fingerprints. This method, which is based on Gabor filter's unique characteristics for magnifying directional patterns and frequency range selections, improves fingerprint classification accuracy significantly. In this paper, this method is described and its test result is presented for verification.

• Journal of KIISE:Databases
• /
• v.35 no.4
• /
• pp.333-344
• /
• 2008

In recent years, the web services composition has received much attention. By web services composition, we mean providing a new service that does not exist on the repository. In this paper, we propose a new system called PSR for web services composition search using a relational database. We also propose algorithms for pre-computing web services composition using joins and indices. We store ontologies from web services in RDBMS, so that the PSR system returns web services composition in order of similarity with user query through the degree of the ontology matching. We demonstrated that our pre-computing web services composition approach in RDBMS yields lower execution time and good scalability when handling a large number of web services and user queries.

• Journal of KIISE:Databases
• /
• v.35 no.4
• /
• pp.368-378
• /
• 2008

In recent years, publish-subscribe (pub-sub) systems based on XML document filtering have received much attention. In a typical pub-sub system, subscribed users specify their interest in profiles expressed in the XPath language, and each new content is matched against the user profiles so that the content is delivered to only the interested subscribers. As the number of subscribed users and their profiles can grow very large, the scalability of the system is critical to the success of pub-sub services. In this paper, we propose a fast and scalable XML filtering system called SFiST which is an extension of the FiST system. Sharable segments are extracted from twig patterns and stored into the hash-based Segment Table in SFiST system. Segments are used to represent user profiles as Terse Sequences and stored in the Compact Segment Index during filtering. Our experimental study shows that SFiST system has better performance than FiST system in terms of filtering time and memory usage.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.19 no.3
• /
• pp.669-678
• /
• 2018

This study developed information technology infrastructures for building a driving environment analysis platform using various big data, such as vehicle sensing data, public data, etc. First, a small platform server with a parallel structure for big data distribution processing was developed with H/W technology. Next, programs for big data collection/storage, processing/analysis, and information visualization were developed with S/W technology. The collection S/W was developed as a collection interface using Kafka, Flume, and Sqoop. The storage S/W was developed to be divided into a Hadoop distributed file system and Cassandra DB according to the utilization of data. Processing S/W was developed for spatial unit matching and time interval interpolation/aggregation of the collected data by applying the grid index method. An analysis S/W was developed as an analytical tool based on the Zeppelin notebook for the application and evaluation of a development algorithm. Finally, Information Visualization S/W was developed as a Web GIS engine program for providing various driving environment information and visualization. As a result of the performance evaluation, the number of executors, the optimal memory capacity, and number of cores for the development server were derived, and the computation performance was superior to that of the other cloud computing.