• Journal of Computing Science and Engineering
• /
• 제9권2호
• /
• pp.73-82
• /
• 2015

Understanding how the topic evolves is an important and challenging task. A topic usually consists of multiple related events, and the accurate identification of event evolution relationship plays an important role in topic evolution analysis. Existing research has used the traditional vector space model to represent the event, which cannot be used to accurately compute the semantic similarity between events. This has led to poor performance in identifying event evolution relationship. This paper suggests constructing a semantic aspect-based vector space model to represent the event: First, use hierarchical Dirichlet process to mine the semantic aspects. Then, construct a semantic aspect-based vector space model according to these aspects. Finally, represent each event as a point and measure the semantic relatedness between events in the space. According to our evaluation experiments, the performance of our proposed technique is promising and significantly outperforms the baseline methods.

• 한국정밀공학회지
• /
• 제15권2호
• /
• pp.162-169
• /
• 1998

Lacking for the skilled grinding operator possessed of the experiential knowledges in machine shop, there is the just requirement which includes the establishment of the optimal grinding conditions. Accordingly, we attemt to develope the selection system of optimal grinding conditions such as workpiece velocity, depth of cut and wheel velocity and to add the trouble shooting system by means of the neural network. Those systems are robust to the each machine error and environmental unstable state. In addition. we produce the loaming process that is progressed with additional data modified by skilled operators, and excluding is advanced to similarity of input data.

• 대한기계학회:학술대회논문집
• /
• 대한기계학회 2001년도 추계학술대회논문집B
• /
• pp.59-64
• /
• 2001

The fluid flow, mass transfer and film thickness variation during a wafer spin coating process are numerically studied. Governing equations for the cylindrical coordinates are simplified using the similarity transformation and solved efficiently using the finite difference method. Concentration dependent viscosity and the binary diffusivity of the coating liquid are used in the analysis. The time variational velocity components of the coating liquid and the film thickness are analyzed according to the various spin speed. When the evaporation is considered, the flow decease in the early times due to the increase of the viscosity and the resultant flow resistance. Effects of the two film thinning mechanism, the flow-out and evaporation are also considered in the analysis.

• 한국방송∙미디어공학회:학술대회논문집
• /
• 한국방송공학회 2009년도 IWAIT
• /
• pp.28-31
• /
• 2009

In this paper, a new approach for solid texture synthesis from input volume data is presented. In the pre-process, feature vectors and a similarity set were constructed for input volume data. The feature vectors were used to construct neighboring vectors for more accurate neighborhood matching. The similarity set which recorded 3 candidates for each voxel helped more effective neighborhood matching. In the synthesis process, the pyramid synthesis method was used to synthesize solid textures from coarse to fine level. The results of the proposed approach were satisfactory.

• 반도체디스플레이기술학회지
• /
• 제2권1호
• /
• pp.25-29
• /
• 2003

The fluid flow, mass transfer, heat transfer and film thickness variation during the spin coating process are numerically studied. The model is said to be I-dimensional because radial variations in film thickness, concentration and temperature are ignored. The finite difference method is employed to solve the equations that are simplified using the similarity transformation. In early time, the film thinning is due to the radial convective outflow. However that slows during the first seconds of spinning so the film thinning due to evaporation of solvent becomes sole. The time varing film thickness is analyzed according to the wafer spin speed, the various solvent fraction in the coating liquid, and the various solvent vapor fraction in the bulk of the overlying gas during the spin coating is estimated.

• 산업경영시스템학회지
• /
• 제24권65호
• /
• pp.41-50
• /
• 2001

Clustering in data mining is a discovery process that groups a set of data such that the intracluster similarity is maximized and intercluster similarity is minimized. The discovered clusters from clustering process are used to explain the characteristics of the data distribution. In this paper we propose a new methodology for clustering related transactions with categorical attributes. Our approach starts with transforming general relational databases into a transactional databases. We make use of inter-dimensional association rules for composing hypergraph edges, and a hypergraph partitioning algorithm for clustering the values of attributes. The clusters of the values of attributes are used to find the clusters of transactions. The suggested procedure can enhance the interpretation of resulting clusters with allocated attribute values.

• 한국정보과학회논문지:소프트웨어및응용
• /
• 제31권11호
• /
• pp.1519-1533
• /
• 2004

웹 기반의 학술분야 전문 검색 시스템은 사용자의 정보 요구 표현을 극히 제한적으로 허용함으로써 검색된 정보의 내용 분석과 정보 습득의 과정이 일관되지 못해 무분별한 정보 제공이 이루어진다. 본 논문에서는 용어의 상대적인 중요 정도를 축소용어 집합으로 구성하여 검색 시스템의 높은 시간 복잡도를 해결할 수 있도록 퍼지 검색 모델을 적용하였다. 또한 퍼지 호환관계의 특성을 만족하는 유사관계 행렬을 통해 사용자 질의를 정확하게 반영할 수 있도록 클러스터 검색을 수행하였다. 본 논문에서 제안한 퍼지 검색과 문서 클러스터 검색의 유사도 결합을 통한 순위 재조정 검색 모델은 검색 성능을 표현하는 정확률과 재현율 척도에서 향상됨을 입증하였다.

• 한국멀티미디어학회논문지
• /
• 제11권8호
• /
• pp.1043-1050
• /
• 2008

XML(Extensible Markup Language)은 인터넷 상에서 데이터 표현과 교환을 위한 표준으로 자리 잡고 있다. 웹의 발전과 함께 XML문서들이 정보 검색, 문서 관리, 데이터 마이닝 등의 응용에서 폭 넓게 사용되면서 구조적으로 정보가 풍부한 이러한 문서들을 자동으로 처리하고 검색하는 기술들이 요구되고 있다. 본 연구에서는 XML 문서 의 구조와 내용을 고려하여 유사한 문서들을 검색하는 새로운 방법을 제안한다. XML 문서의 구조적 유사성은 간단한 스트링 매칭 기법으로 찾고, 문서 내용의 유사성은 문서 요소(element)들의 이름과 경로를 고려한 가중치를 통해 찾는 방법으로 전체의 시간 복잡도는 비교되는 두 문서의 크기에 선형적으로 비례한다.

• 한국융합학회논문지
• /
• 제5권3호
• /
• pp.41-44
• /
• 2014

Sequential object analysis are playing vital role in real time application in computer vision and object detections.Measuring the similarity in two images are very important issue any authentication activities with how best to compare two independent images. Identification of similarities of two or more sequential images is also the important in respect to moving of neighborhoods pixels. In our study we introduce the morphological and shared near neighborhoods concept which produces a sufficient results of comparing the two images with objects. Considering the each pixel compare with 8-connectivity pixels of second image. For consider the pixels we expect the noise removed images are to be considered, so we apply the morphological transformations such as opening, closing with erosion and dilations. RGB of pixel values are compared for the two sequential images if it is similar we include the pixels in the resultant image otherwise ignore the pixels. All un-similar pixels are identified and ignored which produces the similarity of two independent images. The results are produced from the images with objects and gray levels. It produces the expected results from our process.

• 한국CDE학회논문집
• /
• 제11권4호
• /
• pp.315-325
• /
• 2006

It is very often necessary to search for similar parts during designing a new product because its parts are often easily designed by modifying existing similar parts. In this way, the design time and cost can be reduced. Thus it would be nice to have an efficient similarity comparison algorithm that can be used anytime in the design process. There have been many approaches to compare shape similarity between two solids. In this paper, two parts represented in B-Rep is compared in two steps: one for overall appearances and the other for detail features. In the first step, geometric information is used in low level of detail for easy and fast pre-classification by the overall appearance. In the second step, feature information is used to compare the detail shape in high level of detail to find more similar design. To realize the idea above, a multi resolution algorithm is proposed so that a given solid is described by an overall appearance in a low resolution and by detail features in high resolution. Using this multi-resolution representation, parts can be compared based on the overall appearance first so that the number of parts to be compared in high resolution is reduced, and then detail features are investigated to retrieve the most similar part. In this way, computational time can be reduced by the fast classification in the first step while reliability can be preserved by detail comparison in the second step.