• Journal of Information Processing Systems
• /
• v.16 no.3
• /
• pp.733-741
• /
• 2020

A smart dust monitoring system is useful for obtaining information on rough terrain that is difficult for humans to access. One of ways to deploy sensors to gather information in smart dust environment is to use an aircraft in the Amazon rainforest to scatter an enormous amount of small and cheap sensors (or smart dust devices), or to use an unmanned spacecraft to throw the sensors on the moon's surface. However, scattering an enormous amount of smart dust devices creates the difficulty of managing such devices as they can be scattered into inaccessible areas, and also causes problems such as bottlenecks, device failure, and high/low density of devices. Of the various problems that may occur in the smart dust environment, this paper is focused on solving the bottleneck problem. To address this, we propose and construct a three-layered hierarchical smart dust monitoring system that includes relay dust devices (RDDs). An RDD is a smart dust device with relatively higher computing/communicating power than a normal smart dust device. RDDs play a crucial role in reducing traffic load for the system. To validate the proposed system, we use climate data obtained from authorized portals to compare the system with other systems (i.e., non-hierarchical system and simple hierarchical system). Through this comparison, we determined that the transmission processing time is reduced by 49%-50% compared to other systems, and the maximum number of connectable devices can be increased by 16-32 times without compromising the system's operations.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.7
• /
• pp.111-123
• /
• 2013

To verify software vulnerability, the method of conjecturing software structure and then testing the software based on the conjectured structure has been highlighted. To utilize the method, an efficient way to conjecture software structure is required. The popular graph and tree methods such as DFG(Data Flow Graph), CFG(Control Flow Graph) and CFA(Control Flow Automata) have a serious drawback. That is, they cannot express software in a hierarchical fashion. In this paper, we propose a method to overcome the drawback. The proposed method applies various input data to a binary code, generate CFG's based on the code output and construct a HCFG (Hierarchical Control Flow Graph) to express the generated CFG's in a hierarchical structure. The components required for HCFG and progressive algorithm to construct HCFG are also proposed. The proposed method is verified through constructing the software architecture of an open SMTP(Simple Mail Transfer Protocol) server program. The structure generated by the proposed method and the real program structure are compared and analyzed.

• Journal of the Korean Society for information Management
• /
• v.20 no.3
• /
• pp.241-259
• /
• 2003

The Basic Semantic Register(BSR) is and official ISO register designed for interoperability among eBusiness and EDI systems. The entities registered in the current BSR are not defined in a machine-understandable way, which renders automatic extraction of structural and relationship information from the register impossible. The purpose of this study is to offer a framework for designing an ontology that can provide semantic interoperability among BSR-based systems by defining data structures and relationships with RDF and OWL, similar meaning by the 'equivalentClass' construct in OWL, the hierachical relationships among classes by the 'subClassOf' construct in RDF schema, definition of any entities in BSR by the 'label' construct in RDF schema, specification of usage guidelines by the 'comment' construct in RDF schema, assignment of classes to BSU's by the 'domain' construct in RDF schema, specification of data types of BSU's by the 'range' construct in RDF schema. Hierarchical relationships among properties in BSR can be expressed using the 'subPropertyOf' in RDF schema. Progress in semantic interoperability can be expected among BSR-based systems through applications of semantic web technology suggested in this study.

• IE interfaces
• /
• v.2 no.1
• /
• pp.69-78
• /
• 1989

The objective of this study is to establish a hierarchical structure for Quality of Service Management (QOSM) from subsriber's viewpoint. First, We construct the hierarchy of the QOSM items. These items are derived from the CCITT concepts and the present Korean Telecommunication Authority(KTA) system. Then QOS performance indicators which consists of the lower levels of the hierarchy and the weight value is constructed. Finally, an evaluation method of the QOS is presented. It is expected that this study offers an evaluation method of network performance and efficiency of operation and maintenance for telecommunication facilities.

• Journal of Computing Science and Engineering
• /
• v.9 no.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.

• Journal of the Korean Data and Information Science Society
• /
• v.22 no.3
• /
• pp.605-612
• /
• 2011

In multi-center randomized clinical trial the treatment eect may be changed over centers. It is thus important to investigate the heterogeneity in treatment eect between centers. For this, uncorrelated random-eect models assuming independence between random-eect terms have been often used, which may be a strong assumption. In this paper we propose a correlated frailty modelling approach of investigating such heterogeneity using the hierarchical-likelihood method when the outcome is time-to-event. In particular, we show how to construct a proper prediction interval for frailty, which explores graphically the potential heterogeneity for a treatment-by-center interaction term. The proposed method is illustrated via numerical studies based on data from the design of a multi-center clinical trial.

• Tribology and Lubricants
• /
• v.26 no.2
• /
• pp.129-135
• /
• 2010

Geckos have a unique ability to cling to ceilings and walls utilizing dry adhesion. Their foot pads are covered by a large number of small hairs (setae) that contain many branches per seta with a lower level of spatulae. Their fibrillar structure is the primary source of high adhesion. In this study, we construct the adhesion design database for biomimetic adhesive system. A simple idealized fibrillar structure consisting of single array of beams is modeled. The fibers are assumed as oriented cylindrical cantilever beams with spherical tip. We consider three necessary conditions; buckling, fracture and sticking of fiber structure, which constrain the allowed geometry. The adhesion analysis is performed for the attachment system in contact with rough surfaces with different s values for different main design variables-fiber radius, aspect ratio and material elastic modulus and so on. The developed adhesion design databases are useful for understanding biological systems and for guiding of fabrication of the biomimetic attachment system.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.30B no.5
• /
• pp.90-102
• /
• 1993

In this paper, we propose a prgressive image transmission technique using hierarchical pyramid data structure which is constructed based on the projection data of an image. To construct hierarchical Gaussian pyramids, we first divide an image into 4$\times$4 subblocks and generate the projection data of each block along the horizontal, vertical, diagonal, and antidiagonal directions. Among images reconstructed by backprojecting the projection data along a single direction, the one giving the minimum distortion is selected. The Gaussian pyramid is recursively generated by the proposed algorithm and the proposed Gaussian images are shown to preserve edge information well. Also, based on the projection concept a new transmission scheme of the lowest Laplacian plane is presented. Computer simulation shows that the quantitative performance of the proposed pyramid coding technique using projection concept is similar to those of the conventional methods with transmission rate reduced by 0.1 ~ 0.2 bpp and its subjective performance is shown to be better due to the edge preserving property of a projection operation.

• Proceedings of the KIEE Conference
• /
• 2002.11c
• /
• pp.521-524
• /
• 2002

This paper deals with the rule generation from data for control system and data mining using rough set. If the cores and reducts are searched for without consideration of the frequency of data belonging to the same equivalent class, the unnecessary attributes may not be discarded, and the resultant rules don't represent well the characteristics of the data. To improve this, we handle the inconsistent data with a probability measure defined by support, As a result the effect of uncertainty in knowledge reduction can be reduced to some extent. Also we construct the rule base in a hierarchical structure by applying core as the classification criteria at each level. If more than one core exist, the coverage degree is used to select an appropriate one among then to increase the classification rate. The proposed method gives more proper and effective rule base in compatibility and size. For some data mining example the simulations are performed to show the effectiveness of the proposed method.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.4 no.2
• /
• pp.205-210
• /
• 2004

This paper deals with rule extraction from data using rough set theory. We construct the rule base in a hierarchical granulation structure by applying core as a classification criteria at each level. When more than one core exist, the coverage is used for the selection of an appropriate one among them to increase the classification rate and accuracy. In Addition, a probabilistic approach is suggested so that the partially useful information included in inconsistent data can be contributed to knowledge reduction in order to decrease the effect of the uncertainty or vagueness of data. As a result, the proposed method yields more proper and efficient rule base in compatability and size. The simulation result shows that it gives a good performance in spite of very simple rules and short conditionals.