• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.22 no.50
• /
• pp.183-193
• /
• 1999

The problem of discovering association rules has received considerable research attention and several fast algorithms for mining association rules have been developed. In this paper, we propose an efficient algorithm for mining quantitative association rules with item constraints. For categorical attributes, we map the values of the attribute to a set of consecutive integers. For quantitative attributes, we can partition the attribute into values or ranges. While such constraints can be applied as a post-processing step, integrating them into the mining algorithm can reduce the execution time. We consider the problem of integrating constraints that are boolean expressions over the presence or absence of items containing quantitative attributes into the association discovery algorithm using Apriori concept.

• Industrial Engineering and Management Systems
• /
• v.14 no.2
• /
• pp.210-219
• /
• 2015

A classification task requires an exponentially growing amount of computation time and number of observations as the variable dimensionality increases. Thus, reducing the dimensionality of the data is essential when the number of observations is limited. Often, dimensionality reduction or feature selection leads to better classification performance than using the whole number of features. In this paper, we study the possibility of utilizing the Markov blanket discovery algorithm as a new feature selection method. The Markov blanket of a target variable is the minimal variable set for explaining the target variable on the basis of conditional independence of all the variables to be connected in a Bayesian network. We apply several Markov blanket discovery algorithms to some high-dimensional categorical and continuous data sets, and compare their classification performance with other feature selection methods using well-known classifiers.

• 한국생물공학회:학술대회논문집
• /
• 2000.11a
• /
• pp.119-122
• /
• 2000

Biological science is being revolutionized by the availability of much sequence information from many genome project With the advanced technology at hand, main trend in biological research is rapidly changing from a structural DNA analysis to understanding cellular function of the DNA sequences. Combined with mechanics, computer, bioinformatics and other advanced technologies, DNA chip technology provides numerous applications because of its robustness, accuracy, and automation. DNA chip is expected to become an indispensable tool in fields of biology, biotechnology, drug discovery, and other application areas. DNA chip can be used for mutation and polymorphism detection, gene expression monitoring and phenotypic analysis as well. If DNA chip is used for the development of pharmaceutical products, it can considerably reduce the cost and time for the entire process of drug discovery and development, and can also contribute in developing personal drugs.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.05a
• /
• pp.363-366
• /
• 2014

OMG 그룹에서 제안하고 있는 DDS(Data Distribution Service) 미들웨어에서 디스커버리 프로토콜은 미들웨어 간의 상호 운용성 지원을 위한 기본 요소이다. DDS 미들웨어가 적용되는 대부분의 환경에서는 다수의 노드에서 생성된 참여자를 찾기 위해 한꺼번에 많은 수의 디스커버리 정보가 교환되기 때문에 노드 및 네트워크의 성능에 많은 영향을 미친다. 본 논문에서는 DDS 미들웨어 개발 후에 시험이 되어야 하는 디스커버리 기능의 검증과 성능 측정을 위한 응용을 설계하고 이를 구현하였다. 디스커버리 시험 응용은 디스커버리 시험 전체를 관리하는 제어 응용, DDS 미들웨어를 통하여 DDS 개체를 생성하고 이들간의 정보교환을 담당하는 DDS 응용, 그리고 DDS 응용을 통제하고 실행 결과를 수집하여 제어 응용으로 전송하는 데몬 서버로 구성된다. 구현된 디스커버리 시험 응용은 디스커버리 기능 검증 및 성능 정보의 수집을 프로세서 간의 통신을 통하여 효과적으로 수행한다. 또한, DDS 응용의 동작 권한을 제어 응용이 위치한 노드에 집중시킴으로써 많은 수의 노드에서 시험이 필요한 환경에 적합하도록 설계되었다.

• Journal of Institute of Control, Robotics and Systems
• /
• v.13 no.9
• /
• pp.920-926
• /
• 2007

Establishing a fixed path for the message delivery through a wireless network is impossible due to the mobility. Among the number of routing protocols that have been proposed for wireless ad-hoc networks, the AODV(Ad-hoc On-demand Distance Vector) algorithm is suitable in the case of highly dynamic topology changes, along with ZigBee Routing(ZBR), with the exception of route maintenance. Accordingly, this paper introduces a routing scheme focusing on the energy efficiency and route discovery time for wireless alarm systems using IEEE 802.15.4-based ZigBee. Essentially, the proposed routing algorithm utilizes a cluster structure and applies ZBR within a cluster and DSR (Dynamic Source Routing) between clusters. The proposed algorithm does not require a routing table for the cluster heads, as the inter-cluster routing is performed using DSR. The performance of the proposed algorithm is evaluated and compared with ZBR using an NS2 simulator. The results confirm that the proposed Cluster-based AODV (CAODV) algorithm is more efficient than ZBR in terms of the route discovery time and energy consumption.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.7
• /
• pp.2212-2230
• /
• 2014

Cognitive radio (CR) users, known as secondary users (SUs), should avoid interference with primary users (PUs) who own the licensed band, while trying to access it; when the licensed band is unused by the PUs. To detect PUs, spectrum sensing should be performed over in-band channels that are currently in use by SUs. If PUs return to access the band, SUs need to vacate it, disrupting the SUs' communication unless a non-utilized band is discovered. Obtaining a non-utilized band in a short period facilitate seamless communication for SUs and avoid interference on PUs by vacating from the channel immediately. Searching for a non-utilized band can be done through proactive out-of-band (OB) sensing. In this paper, we suggest a proactive OB sensing scheme that minimizes the time required to discover a non-utilized spectrum in order to continue communication. Although, the duration spent on OB sensing reduces the throughput of the CR networks that can be achieved on band being utilized, the lost throughput can be compensated in the new discovered band. We demonstrate that, the effect of our proposed scheme on the throughput owing to OB sensing is insignificant, while exhibiting a very short channel discovery time.

• Korean Journal of Heritage: History & Science
• /
• v.34
• /
• pp.196-209
• /
• 2001

Kunjung-mun Gate the only existing multi-level palace gate from the Chosun Dynasty, is the main fate of Kungjung-jun, the central building of Kyungbok-koong Palace. Sangryangmun(a written record of the construction of the ridge beam) of Kunjung-mun Gate was discovered in a hole under its main beam during the renovation project on September 19th, 2000. At the time of discovery, Sangryangmun was found in its original state as a rolled up scroll. On a clould-patterned, red silk cloth, 78 cm in width and 1200 cm in length, each of all 92 lines of the Kunjung-mun Sangryangmun is comprised of either 7 or 11 brush-written, ornamental "Seal" characters. With an exception of its discoloration, the material is considered well preserved. After its discovery, the National Institute of Cultural Properties stored the document in an airtight container for a permanent preservation. In accordance to the Royal Command at the time, the Kunjung-mun Sangryangmun was composed by Kim Byungi, then written by Lee Donsang on January 19th 1867. This document records the meaning and the process of the repair effort of Kunjung-mun Gate includes the wish for peace and longevity of the Chosun Kingdom and its people.

• Journal of the Korean Professional Engineers Association
• /
• v.22 no.2
• /
• pp.61-67
• /
• 1989

The writer, a member of the Society of Vertebrate Paleontology(SVP), succeeds in making the miniatured dinosaur mcdels from the Early Cretaceous dinosaur remains of Korea. The dinosaur species of reconstruction models this time are the Ultrasaurus tabriensis KIM, the Iguanodon kimi KIM, and the Deinonychus koreanesis KIM. Those are reconstructed for the first time in Korea since the first discovery of dinosaur skeletons in 1973 from the country. The miniature models of dinosaurs reconstructed are exhibited by the photographs from lateral, frontal, and dorsal views.

• Proceedings of the IEEK Conference
• /
• 2003.11b
• /
• pp.207-210
• /
• 2003

In this paper, we explore a new data mining capability that is based on Quantitative Attribute and Time Series. Our solution procedure consists of two steps. First, We derive an algorithm to contain the Quantitative Attribute into a set of candidate item. Second, We redefine the concepts of confidence and support for composite association rules. It is shown that proposed methode is very advantageous and can lead to prominent performance improvement.

• Journal of IKEEE
• /
• v.22 no.1
• /
• pp.136-142
• /
• 2018

Recently, as the development system has become larger, sequential simulation methods have become impossible to verify systems that take a long time or require real time results. Therefore, a study of a distributed simulation system that simulates several processes has been conducted. In order to simulate real-time systems, efficient data exchange between distributed systems is required. Data Distribution Service is a data-oriented communication middleware proposed by Object Management Group and provides efficient data exchange and various QoS. However, in a large-scale distributed simulation environment distributed over a wide area, there is a problem of Participant Discovery and QoS guarantee due to domain separation in data exchange. Therefore, in this paper, we propose a DDS/SDN architecture that can guaranteed QoS and effective Participant Discovery in an SDN-based network.