• Proceedings of the Korea Information Processing Society Conference
• /
• 2001.04a
• /
• pp.57-60
• /
• 2001

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

• Journal of KIISE:Databases
• /
• v.35 no.3
• /
• pp.208-217
• /
• 2008

Sensors have a function to gather environment-related information operating by small-size battery in sensor networks. The issue related with energy is still an important in spite of the recent advancements in micro-electro-mechanical-system(MEMS) related techology. Generally it is assumed that replacement or rechargement of battery power in sensor is not feasible and a message send operation may spend at least 1000 times battery than a local operation. Thus, there have been several kinds of research efforts to lessen the number of unnecessary messages by maintaining the information of the other neighboring(or all) sensors. In this paper, we propose an index structure based on parent-children relationship to the purpose. Namely, parent node gathers the set of location information and MBA per child. It's named PH and may allow to process the range query with higher accurate and small size information. Through extensive experiments, we show that our index structure has better energy consumption.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.5
• /
• pp.93-102
• /
• 2007

Metadata and ontology can be used to retrieve related information through the inference mure accurately and simply on the Semantic Web. RDF and RDF Schema are general languages for representing metadata and ontology. An enormous number of keywords on the Semantic Web are very important to make practical applications of the Semantic Web because most users prefer to search with keywords. In this paper, we consider a resource as a unit of query results. And we classily queries with keyword conditions into three patterns and propose indexing techniques for keyword-search considering both metadata and ontology. Our index maintains resources that contain keywords indirectly using conceptual relationships between resources as well as resources that contain keywords directly. So, if user wants to search resources that contain a certain keyword, all resources are retrieved using our keyword index. We propose a structure of table for storing RDF Schema information that is labeled using some simple methods.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.48 no.4
• /
• pp.61-68
• /
• 2011

Event-based service technology integrate service to detect events that occur in real time by analyzing the response. Is the core technology for real-time business and ubiquitous service environment construction. Is required event-based service technology on business processes in real-time business environment that providing rapid response to changing and custom service using a variety of information real-time monitoring and analysis in ubiquitous service environment. Last event-driven business processes can be used as a CEP(Complex Event Processing). The core of CEP technology, the event from multiple event sources analysis of events affecting and the way to handle action, is detect complex event to user. In previous studies, an event occurs that continue to perform without the need for partial operations. so many operations and spend a lot of memory is a problem. To solve these problems, event detection technique is proposed that large streams of data without processing any events, registered to configure a complex event occurs when all events in the application layer, complex event processing. The proposed method, first using a bitmap index to manage the event occurs. The complex events of the last event in response to define a trigger event. The occurrence of an event to display a bitmap index, a composite event occurrence of all event to configure the test through the point at which a trigger event occurs. Is proposed, If any event occurs to perform the operation. The proposed scheme perform operations when all event occurs without events having to perform each of the tests. As a result, avoid unnecessary operations and reducing the number of events to handle the increased efficiency of operations.

• Proceedings of the KIEE Conference
• /
• 2008.07a
• /
• pp.75-76
• /
• 2008

본 논문에서는 한국형 에너지 관리 시스템의 계통 해석용 프로그램을 위한 공통 데이터 모델의 구축에 대해 다루었다. 공통 데이터 모델이란 다양한 어플리케이션이 공유하여 사용할 수 있는 계통 모델의 데이터베이스를 가리키며 본 논문에서는 토폴로지 프로세서(topology processor, TP), 상태추정(state estimator, SE), 급전원 조류계산(dispatcher power flow, DPF), 휴전계획(outage scheduler, OS), 부하 분포계수(bus load distribution factor, BLDF), 송전 손실 민감도 계수(transmission loss sensitivity factor, TLSF) 등을 위한 공통 모델에 대해 다루었다. 공통 모델의 구축을 위해 각 어플리케이션에서 필요한 정보를 수집하여 전력계통의 토폴로지 구조과 계통 설비를 모델링 하였다. 최종적으로 계층적(hierarchy) 구조와 비계층적(non-hierarchy) 구조로 나뉘어진 직접(direct) 및 간접(indirect) 인덱스 코드를 사용하여 데이터로의 빠른 접근이 가능한 실시간 데이터베이스 형태를 제시하였다.

• Journal of KIISE:Computing Practices and Letters
• /
• v.9 no.6
• /
• pp.610-622
• /
• 2003

Metadata Registry was developed to dynamically manage metadata and to increase interoperability between various and heterogeneous metadata. The built metadata registry can be used as a standard guideline for creation of new databases and it provides a radical data integration mechanism. However, in the situation that an enormous databases must be integrated progressively, there is a limit to the existing metadata-based approach. In case that each database has no statistical information for its use rate and the restricted cost is given to us for a unit time, existing metadata-based approaches do not provide how to select some databases to be preferentially integrated and to build a metadata registry progressively, In this paper, we propose a methodology that can create progressively metadata registries in the case. The proposed methodology is based on data visibility and hierarchical metadata registry. We also describe the system that have been developed for applying the methodology to a real domain, and then described its results.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.9
• /
• pp.1865-1872
• /
• 2009

This study suggests a method for extending XMDR to integrate and search legacy system. This extension blends MSO(Meta Semantic Ontology) for the management of metadata, ML(Meta Location) for the management of location information, and Topic Map which is the standard language used to represent semantic web. This study refers to it as TMDR(Topic Map MetaData Registry). As an intelligent layer, Topic Map functions like an index. However, if the data frequently changes, the efficiency of Topic Map may drop. To solve this problem, the proposed system represents the relation among metadata, the relation among real data, and the relation between metadata and real data as Topic Map. The represented Topic Map proposes a method to reduce the changing relation among real data caused by the relation among metadata.

• Journal of Internet Computing and Services
• /
• v.8 no.5
• /
• pp.133-140
• /
• 2007

Currently, as the requirement for high quality Internet access from anywhere at anytime is consistently increasing, the interconnection of pure ad hoc networks to fixed IP networks becomes increasingly important. Such integrated network, referred to as hybrid ad hoc networks, can be extended to many applications, including Sensor Networks, Home Networks, Telematics, and so on. We focus on some data communication problems of hybrid ad hoc networks, such as broadcasting and routing. In particular. power failure of mobile terminals is the most important factor since it affects the overall network lifetime. We propose an energy-efficient routing protocol based on clustering for hybrid ad hoc networks. By applying the index-based data broadcasting and selective tuning methods, the infra system performs the major operations related to clustering and routing on behalf of ad hoc nodes. The proposed scheme reduces power consumption as well as the cost of path discovery and maintenance, and the delay required to configure the route.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.29 no.1
• /
• pp.39-46
• /
• 2011

The present study introduces a comparison between 3D R-tree and octree which are noticeable candidates to index large point clouds gathered from a 3D terrestrial laser scanner. A query method, which is to find neighboring points within given distances, was devised for the comparison, and time lapses for the query along with memory usages were checked. From tests conducted on point clouds scanned from a building and a stone pagoda, it was shown that octree has the advantage of fast generation and query while 3D R-tree is more memory-efficient. Both index and leaf capacity were revealed to be ruling factors to get the best performance of 3D R-tree, while the number of level was of oetree.

• Journal of KIISE
• /
• v.43 no.2
• /
• pp.246-255
• /
• 2016

The orthogonal frequency-division multiple access (OFDMA) systems are well suited to multi-rate multicast transmission, as they allow flexible resource allocation across both frequency and time, and provide adaptive modulation and coding schemes. Unlike layered video coding, the multiple description coding (MDC) enables flexible decomposition of the raw video stream into two or more substreams. The quality of the video stream is expected to be roughly proportional to data rate sustained by the receiver. This paper describes a mathematical model of resource allocation and throughput in the multi-rate video multicast for the OFDMA wireless and mobile networks. The impact on mean opinion score (MOS), as a measurement of user-perceived quality (by employing a variety of scheduling disciplines) is discussed in terms of utility maximization and proportional fairness. We propose a pruning algorithm to ensure a minimum video quality even for a subset of users at the resource limitation, and show the optimal number of substreams and their rates can sustain.