• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2003.10a
• /
• pp.892-896
• /
• 2003

XML is used in various fields such as interface format for data swapping between application between several various system passing over thing to mark to web browser simply. Accordingly, a lot of studies about system that can manage effectively and search XML document with formation of information, reusability, disposal and durability, portability are proceeding. In this paper, explain about XQL and document structure processor and language processor of quality and make contents of XML document by tree structure, structure information presents method that find XML document tree structure information that is correct on question using XQL while do parsing. Through this, described for design and embodiment of efficient XML document search system that use XQL that compose structure information of document in tree structure and is proposed in language of quality after do parsing absorbing XML document that is scattered on web.

• Journal of KIISE:Databases
• /
• v.32 no.3
• /
• pp.285-296
• /
• 2005

In mobile distributed systems the data on the air can be accessed by a lot of mobile clients. And, we need an indexing scheme in order to energy-efficiently access the data on the wireless broadcast stream. In conventional indexing schemes, they use the values of primary key attributes and construct tree-structured index. Therefore, the conventional indexing schemes do not support content-based retrieval queries such as partial-match queries. In this paper we propose an indexing scheme, called B2V-Tree, which supports partial match queries on wireless broadcast data stream. For this purpose, we construct a tree-structured index which is composed of bit-vectors, where the bit-vectors are generated from data records through multi-attribute hashing.

• Journal of KIISE:Databases
• /
• v.29 no.2
• /
• pp.89-98
• /
• 2002

As XML has become an emerging standard for information exchange on the World Wide Web it has gained attention in database communities to extract information from XML seen as a database model. Recently, many researchers have addressed the problem of storing XML data and processing XML queries using traditional database engines. Here, most of them have used relational database systems. In this paper, we show that OODBSs can be another solution. Our technique generates an OODB schema from DTDs and processes XML queries, Especially, we show that the semi-structural part of XML data can be represented by the 'inheritance' and that this can be used to improve query processing.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.14 no.3
• /
• pp.587-594
• /
• 2019

This paper proposes a personalized web search technique that produces ranked results reflecting user's query intents and individual interests. The performance of personalized search relies on an effective users' profiling strategy to accurately capture their interests and preferences. User profile is a data set of words and customized weights based on recent user queries and the topic words of web documents from their click history. Personal profile is used to expand a user query to the personalized query before the web search. To determine the exact meaning of ambiguous queries and topic words, this strategy uses WordNet to calculate semantic similarities to words in the user personal profile. Experimental results with query expansion and re-ranking modules installed on general search systems shows enhanced performance with this personalized search technique in terms of precision and recall.

• Fire Science and Engineering
• /
• v.22 no.3
• /
• pp.300-304
• /
• 2008

The flame retardancy was evaluated to present as the fundamental data to decrease the fire hazard of polymers and life losses according to the addition of clay. The combustion characteristics were examined to increase flame retardancy and to decrease smoke yield of epoxy by the addition of clay such as montmorillonite in this study. For this study, the experiments of flame retardancy were conducted the measurement of the limiting oxygen index (LOI), char yield, and smoke density. As MMT concentration increased, LOI and char yield increased. This result showed that the flame retardancy of epoxy/MMT composite was improved. On the contrary, smoke density increased.

• The KIPS Transactions:PartD
• /
• v.14D no.1 s.111
• /
• pp.1-8
• /
• 2007

As the web document of XML, an exchange language of data in the advanced Internet, is increasing, a target of information retrieval becomes the web documents. Therefore, there we researches on structure, integration and retrieval of XML documents. This paper proposes a clustering method of XML documents based on frequent structures, as a basic research to efficiently process query and retrieval. To do so, first, trees representing XML documents are decomposed and we extract frequent structures from them. Second, we perform clustering considering the weight of large items to adjust cluster creation and cluster cohesion, considering frequent structures as items of transactions. Third, we show the excellence of our method through some experiments which compare which the previous methods.

• Journal of the Korea Computer Industry Society
• /
• v.4 no.4
• /
• pp.613-624
• /
• 2003

This paper proposes a design for efficient and accurate retrieval of similar image subsequences using the multi-dimensional time warping distance as similarity evaluation tool in image sequence database after building of two indexing structures implemented with priority queue and suffix tree respectively. Receiving query image sequence, at first step, the proposed method searches the candidate set of similar image subsequences in priory queue index structure. If it can not get satisfied results, it retrieves another candidate set in suffix tree index structure at second step. The using of the low-bound distance function can remove the dissimilar subsequence without false dismissals during similarity evaluating process between query image sequence and stored sequences in two index structures.

• Journal of KIISE:Computer Systems and Theory
• /
• v.28 no.1_2
• /
• pp.1-10
• /
• 2001

본 논문에서는 부쉬 트리를 할당 트리로 변환한 후 결합 연산을 수행하면서 실제 실행시간을 동적으로 계산하고 그 결과에 의해 실시간에 프로세서를 할당하는 동적 프로세서 할당 기법을 이용한 파이프라인 해쉬 결합 알고리즘을 제안하였다. 프로세서를 할당하는 과정에서 초기 릴레이션의 기본 정보만을 이용하여 미리 프로세서를 할당하는 기존의 정적 프로세서 할당 기법은 정확한 실행시간을 예측할 수 없었다. 따라서 본 논문에서는 할당 트리 각 노드의 실행결과를 포함한 결합 과정 중의 정보를 다음 노드의 실행시간에 충분히 반영하는 동적 프로세서 할당 기법을 제안하였으며, 이로써 프로세서를 효율적으로 분배하고 전체적인 실행시간을 최소화하였다. 또한 전체적인 질의 실행시간을 줄이기 위하여 결합 가능성이 없는 튜플들을 제거한 후 결합 연산을 수행할 수 있도록 해쉬 필터 기법을 이용하였다. 결합 연산을 수행하기에 앞서 모든 결합 속성 값에 대해 해쉬 필터를 생성하는 정적 필터 기법은 모든 결합 연산의 중간 결과로 발생할 수 있으나 최종 결과 릴레이션의 튜플이 될 수 없는 튜플들까지도 모두 추출이 가능하다. 따라서 각각의 결합 연산 직전에 해쉬 필터를 생성하는 동적 필터 기법에 비해 결합 가능성이 없는 튜플을 최대한 제거할 수 있으며 이로써 결합 연산의 실행비용을 크게 줄일 수 있었다.

• Journal of Welding and Joining
• /
• v.14 no.2
• /
• pp.1-9
• /
• 1996

철강재료에 대한 플라즈마질화법의 적용에는 지금까지 많은 연구결과가 나와 있는데, 탄소강이나 적합금강의 경우는 그 표면정도가 Hv400 - 900, 고합금강의 경우 는 Hv1000이상의 정도를 얻을 수 있으며, 내마모성도 향상한다고 알려져 있다. 그리 고 플라즈마질화처리에 의한 질화층의 형성기구나 화합물층 및 확산층의 생성에 관여 하는 처리조건의 영향, 질화층의 경도 및 깊이에 대한 합금원소의 영향등이 어느 정도 밝혀져 있다. 그리고 스테인레스강의 경우는 그 표면에 견고한 산화피막을 형성하기 때문에 염욕질화나나 가스질화법에 의한 처리가 일반적으로 곤란하다. 그러나 프라 즈마질화처리에 의하면, 분위기를 질소와 수소의 혼합가스로 함으로서 특별한 전처리 를 하지않고도 질화처리가 가능한 것으로 알려져 있다. 또한 철강재료 이외의 비철 금속에 대한 플라즈마질화처리의 적용이 검토되었으며, 질화물을 형성하기 쉬운 Ti 와 그 합금, Zr, Al 그리고 Va, AIa족원소의 경우는 Hv1000이상의 경도가 얻어진다는 것과 최적 질화조건등이 보고되어져 있다. 또한 질화물을 형성하지 않는 금속, 즉 Ni 나 Cu합금 등에 대하여도 Ti, Al 등의 질화물생성원소를 첨가하여 플라즈마질화법에 의한 표면경화특성도 검토되고 있다. 본 해설에서는, 탄소강, 탄소저합금강 등의 철강 재료를 중심으로하여 플라즈마질화처리한 경우의 표면경화특성에 대하여 서술하고자 한다.

• The Journal of the Korea Contents Association
• /
• v.8 no.5
• /
• pp.44-51
• /
• 2008

Pattern matching and pattern searching in time series data have been active issues in a number of disciplines. This paper suggests a novel pattern matching technology which can be used in the field of stock market analysis as well as in forecasting stock market trend. First, we define conceptual patterns, and extract data forming each pattern from given time series, and then generate learning model using Hidden Markov Model. The results show that the context-based pattern matching makes the matching more accountable and the method would be effectively used in real world applications. This is because the pattern for new data sequence carries not only the matching itself but also a given context in which the data implies.