• Spatial Information Research
• /
• v.14 no.4 s.39
• /
• pp.403-419
• /
• 2006

The well-blown address matching technology developed by the U.S. Census Bureau was applicable only for street addresses. However, many other addressing systems on the basis of a hierarchy of areas (hierarchical areal addressing system), such as Korean or Japanese addressing system, cannot be suitable for the existing address matching method. This paper, therefore, develops an areal address matching method, especially for Korean addressing system, in order to geocode 2D and 3D locational data of human activities. Thus, this study explains a new approach to dealing with 3D positioning method composed of two geocoding methods, which are a '2D Korean Address Matching' technique and a '3D Address Matching' technique.

• 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 Advanced Information Technology and Convergence
• /
• v.9 no.2
• /
• pp.15-27
• /
• 2019

This paper deals with a web-based public address system for conveying information for different institutions. An architecture for a Short Messaging Service (SMS) based public address (PA) system that can be programmed by an authorized mobile phone or device is proposed. This PA system will facilitate information transfer from heads of offices, managers, directors, and deans of the institutions to its constituents or unit area as well as enable postings of information with proper authentication and validation remotely. The system supports high priority messaging, allowing the conveyance of critical and time sensitive information. The mobility management support for the PA system will be based on the Hierarchical Mobile Internet Protocol version 6 (HMIPv6), hence, allowing for a seamless connectivity to the system. The major advantage of this proposed PA system as compared with the traditional electronic displays and bulletin boards is seamless mobility wherein the display devices can be programmed remotely by heads of the institutions and business organization. It also allows faster communication and immediate actions concerning the different institutions, organizations, and businesses, thus, ensuring high productivity.

• Proceedings of the IEEK Conference
• /
• 2004.08c
• /
• pp.571-575
• /
• 2004

Having age of ubiquitous ahead, existing IPv4's address space insufficiency phenomenon appears because of increasing network usage as well as multimedia data transmission becomes much, necessity of new IP address system that guarantee QoS are needed. IPv6 was made to solve these problem. IPv6 solves address space insufficiency phenomenon offering by 128bit address space, and also offers hierarchical address layer that support improved QoS. IPv6 defines relation between surrounding node using Neighbor Discovery protocol. Used Neighbor Discovery messages, grasp surrounding node, include important informations about network. These network information outcrops can give rise in network attack and also service that use network will paralysis. Various kinds of security limitation was found in Present Neighbor Discovery protocol therefore security function to supplement tris problem was required. In this thesis, Secure Neighbor Discovery protocol that add with security function was design and embody by CGA module and SEND module.

• International Journal of Contents
• /
• v.5 no.4
• /
• pp.88-93
• /
• 2009

It is important for communication networks to possess the capability to overcome failures and provide survivable services. We address modeling and analysis of performability affected by both performance and availability of system components for a token ring network under failure and repair conditions. Stochastic reward nets (SRN) is an extension of stochastic Petri nets and provides compact modeling facilities for system analysis. In this paper, hierarchical SRN modeling techniques are used to overcome state largeness problem. The upper level model is used to compute availability and the lower level model captures the performance. And Normalized Throughput Loss (NTL) is obtained for the composite ring network for each node failures occurrence as a performability measure. One of the key contributions of this paper constitutes the Petri nets modeling techniques instead of complicate numerical analysis of Markov chains and easy way of performability analysis for a token ring network under SRN reward concepts.

• Wind and Structures
• /
• v.39 no.1
• /
• pp.1-14
• /
• 2024

Widespread damages from extreme winds have attracted lots of attentions of the resilience assessment of power distribution systems. With many related environmental parameters as well as numerous power infrastructure components, such as poles and wires, the increased challenge of power asset management before, during and after extreme events have to be addressed to prevent possible cascading failures in the power distribution system. Many extreme winds from weather events, such as hurricanes, generate widespread damages in multiple areas such as the economy, social security, and infrastructure management. The livelihoods of residents in the impaired areas are devastated largely due to the paucity of vital utilities, such as electricity. To address the challenge of power grid asset management, power system clustering is needed to partition a complex power system into several stable clusters to prevent the cascading failure from happening. Traditionally, system clustering uses the Binary Decision Diagram (BDD) to derive the clustering result, which is time-consuming and inefficient. Meanwhile, the previous studies considering the weather hazards did not include any detailed weather-related meteorologic parameters which is not appropriate as the heterogeneity of the parameters could largely affect the system performance. Therefore, a fragility-based network hierarchical spectral clustering method is proposed. In the present paper, the fragility curve and surfaces for a power distribution subsystem are obtained first. The fragility of the subsystem under typical failure mechanisms is calculated as a function of wind speed and pole characteristic dimension (diameter or span length). Secondly, the proposed fragility-based hierarchical spectral clustering method (F-HSC) integrates the physics-based fragility analysis into Hierarchical Spectral Clustering (HSC) technique from graph theory to achieve the clustering result for the power distribution system under extreme weather events. From the results of vulnerability analysis, it could be seen that the system performance after clustering is better than before clustering. With the F-HSC method, the impact of the extreme weather events could be considered with topology to cluster different power distribution systems to prevent the system from experiencing power blackouts.

• International Journal of Contents
• /
• v.6 no.3
• /
• pp.19-24
• /
• 2010

Task scheduling is an integrated component of computing with the emergence of grid computing. In this paper, we address two different task scheduling models, which are static Round-Robin (RR) and dynamic Fastest Site First (FSF) task scheduling method, using extended timed marked graphs, which is a special case of Stochastic Petri Nets (SPN). Stochastic reward nets (SRN) is an extension of SPN and provides compact modeling facilities for system analysis. We build hierarchical SRN models to compare two task scheduling methods. The upper level model simulates task scheduling and the lower level model implements task serving process for different sites with multiple servers. We compare these two models and analyze their performances by giving reward measures in SRN.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.20 no.5
• /
• pp.716-721
• /
• 2010

In this work we address the use of support vector machine (SVM) in the multi-class gas classification system. The objective is to classify single gases and their mixture with a semiconductor-type electronic nose. The SVM has some typical multi-class classification models; One vs. One (OVO) and One vs. All (OVA). However, studies on those models show weaknesses on calculation time, decision time and the reject region. We propose a hierarchical clustering method (HCM) based on the SVM for real-time gas mixture classification. Experimental results show that the proposed method has better performance than the typical multi-class systems based on the SVM, and that the proposed method can classify single gases and their mixture easily and fast in the embedded system compared with BP-MLP and Fuzzy ARTMAP.

• Journal of Korea Multimedia Society
• /
• v.19 no.8
• /
• pp.1597-1608
• /
• 2016

Recently, a number of solutions were proposed to address the challenges and issues of vehicular networks. Vehicular Cloud Computing (VCC) is one of the solutions. The vehicular cloud computing is a new hybrid technology that has a remarkable impact on traffic management and road safety by instantly using vehicular resources. In this paper, we study an important vehicular cloud service, content-based delivery, that allows future vehicular cloud applications to store, share and search data totally within the cloud. We design a VCC-based system architecture for efficient sharing of vehicular contents, and propose a Hierarchical Hybrid Content Delivery scheme using Bloom Filter (H2CDBF) for efficient vehicular content delivery in Vehicular Ad-hoc Networks (VANETs). The performance of the proposed H2CDBF is evaluated through an analytical model, and is compared to the proactive content discovery scheme, Bloom-Filter Routing (BFR).

• ETRI Journal
• /
• v.27 no.5
• /
• pp.595-607
• /
• 2005

The widespread use of the Internet has led to the problem of intellectual property and copyright infringement. Digital rights management (DRM) technologies have been developed to protect digital content items. Digital content can be classified into static content (for example, text or media files) and dynamic content (for example, VOD or multicast streams). This paper deals with the protection of a multicast stream on set-top boxes connected to an IP network. In this paper, we examine the following design and architectural issues to be considered when applying DRM functions to multicast streaming service environments: transparent streaming service and large-scale user environments. To address the transparency issue, we introduce a 'selective encryption scheme'. To address the second issue, a 'key packet insertion scheme' and 'hierarchical key management scheme' are introduced. Based on the above design and architecture, we developed a prototype of a multicasting DRM system. The analysis of our implementation shows that it supports transparent and scalable DRM multicasting service in a large-scale user environment.