• The KIPS Transactions:PartC
• /
• v.10C no.2
• /
• pp.217-232
• /
• 2003

QoS routing can improve network performance while providing support for QoS guarantees. These benefits, however, comes with additional routing costs such as more complex and frequent route computation and the protocol overheads to exchange dynamic network state information. Moreover, little has been done to mininize the impact of the QoS traffic to the best effort traffic or to enhance the routine Performance of the best effort traffic when QoS routing is deployed. In this paper, it is proposed that a sewer based routing mechanism, which supports the QoS routing without incurring the QoS routing protocol overhead for the network state update exchanges and enhances the performance of the best effort traffic without affecting the performance of QoS routing. Simulation results show that the proposed scheme enhances the routing performance for the QoS traffic while reducing the routing protocol overhead. The routing performance of the best traffic is also improved with virtually no impact to the routine performance of the QoS traffic. The proposed scheme is shown to be especially effective when the ratio of QoS traffic is high, that is, when the impact of the QoS traffic to the performance of best effort traffic is significant.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.26 no.2
• /
• pp.139-146
• /
• 2013

This study is to update of vibration power generating model and to analyze electromotive force on subway. Analysis of electromotive force using power generation depending on classification of locations which are ballast bed and concrete bed. As the section between Seocho and Bangbae in the line 2 subway was changed from ballast bed to concrete bed, it could be analyzed at same condition, train, section. Induced electromotive force equation by Faraday's law was updated using Bayesian regression and correlation analysis with calculate value and experiment value. Using the updated model, it could get 40mV per one power generation in ballast bed, and it also could get 4mV per one power generation in concrete bed. If the updated model apply to subway or any train, it will be more effective to get electric power. In addition to that, it will be good to reduce greenhouse gas and to build a green traffic network.

• The KIPS Transactions:PartD
• /
• v.9D no.5
• /
• pp.801-812
• /
• 2002

On-line reorganization in a shared nothing database cluster is crucial to the performance of the database system in a dynamic environment like WWW where the number of users grows rapidly and changing access patterns may exhibit high skew. In the existing method of on-line reorganization have a drawback that needs excessive data migrations in case more than two nodes within a cluster have overload at the same time. In this paper, we propose an advanced B$^{+}$ tree based on-line reorganization method that solves data skew on multi-nodes. Our method facilitates fast and efficient data migration by including spare nodes that are added to cluster through on-line scaling. Also we apply CSB$^{+}$ tree (Cache Sensitive B$^{+}$ tree) to our method instead of B$^{+}$ tree for fast select and update queries. We conducted performance study and implemented the method on Ultra Fault-Tolerant Database Cluster developed for high scalability and availability. Empirical results demonstrate that our proposed method is indeed effective and fast than the existing method. method.

• The KIPS Transactions:PartB
• /
• v.15B no.5
• /
• pp.457-464
• /
• 2008

In the real-world operational environment, most of text classification systems have the problems of insufficient training documents and no prior knowledge of feature space. In this regard, $Na{\ddot{i}ve$ Bayes is known to be an appropriate algorithm of operational text classification since the classification model can be evolved easily by incrementally updating its pre-learned classification model and feature space. This paper proposes the improving technique of $Na{\ddot{i}ve$ Bayes classifier through feature weighting strategy. The basic idea is that parameter estimation of $Na{\ddot{i}ve$ Bayes considers the degree of feature importance as well as feature distribution. We can develop a more accurate classification model by incorporating feature weights into Naive Bayes learning algorithm, not performing a learning process with a reduced feature set. In addition, we have extended a conventional feature update algorithm for incremental feature weighting in a dynamic operational environment. To evaluate the proposed method, we perform the experiments using the various document collections, and show that the traditional $Na{\ddot{i}ve$ Bayes classifier can be significantly improved by the proposed technique.

• The KIPS Transactions:PartB
• /
• v.9B no.4
• /
• pp.399-406
• /
• 2002

The goal of this research has been to develop an adaptive user agent for web surfing. To achieve this goal, the research has concentrated on three issues: collection of user data, construction and improvement of user profile, and adaptation by applying the user profile. The main outcome from the research is a prototype system that provides the functional definition and componential design scheme for an adaptive user agent for the web environment. Internally, the system achieves its operational goal from the cooperation of two independent agents. They are IIA (Interactive Interface Agent) and UPA (User Profiling Agent). As a tool for providing a user-friendly interface environment, the IIA employs the Keyword Index, which is a list of index terms of a webpage as well as a keyword menu for subsequent queries, and the Suggest Link, which is a hierarchical list of URLs showing the past browsing procedure of the user. The UPA reflects in the User Profile, both the static and the dynamic information obtained from the user's browsing behavior. In particular, a user's interests are represented in the form of Interest Vectors which, based on the similarity of the vectors, is subject to update and creation, thus dynamically profiling the user's ever-shifting interests.

• Journal of the Korea institute for structural maintenance and inspection
• /
• v.20 no.3
• /
• pp.10-17
• /
• 2016

This paper presents a laboratory validation of a new approach for Finite Element Model Updating(FEMU) on short-span bridges by combining ambient vibration measurements with static load input-deflection output measurements. The conventional FEMU approach based on modal parameters requires the assumption on the system mass matrix for the eigen-value analysis. The proposed approach doesn't require the assumption and even provides a way to update the mass matrix. The proposed approach consists of two steps: 1) updating the stiffness matrix using the static input-deflection output measurements, and 2) updating the mass matrix using a few lower natural frequencies. For a validation of the proposed approach, Young's modulus of the laboratory model was updated by the proposed approach and compared with the value obtained from strain-stress tests in a Universal Testing Machine. Result of the conventional FEMU was also compared with the result of the proposed approach. It was found that proposed approach successfully estimated the Young's modulus and the mass density reasonably while the conventional FEMU showed a large error when used with higher-modes. In addition, the FE modeling error was discussed.

• Journal of Korea Society of Industrial Information Systems
• /
• v.16 no.2
• /
• pp.85-97
• /
• 2011

Wireless sensor networks have emerged as one of the key enabling technologies for ubiquitous computing since wireless intelligent sensor nodes connected by short range communication media serve as a smart intermediary between physical objects and people in ubiquitous computing environment. We recognize the wireless sensor network as a massively distributed and deeply embedded system. Such systems require concurrent and asynchronous event handling as a distributed system and resource-consciousness as an embedded system. Since the operating environment and architecture of wireless sensor networks, with the seemingly conflicting requirements, poses unique design challenges and constraints to developers, we propose a very new operating system for sensor nodes based on finite state machine. In this paper, we clarify the design goals reflected from the characteristics of sensor networks, and then present the heart of the design and implementation of a compact and efficient state-driven operating system, SenOS. We describe how SenOS can operate in an extremely resource constrained sensor node while providing the required reactivity and dynamic reconfigurability with low update cost. We also compare our experimental results after executing some benchmark programs on SenOS with those on TinyOS.

• Journal of Korean Society for Geospatial Information Science
• /
• v.1 no.2 s.2
• /
• pp.195-206
• /
• 1993

As the first step in developing the urban information system it is very important to identify the location of the street, and the feature of objects on it Also it is necessary to understand the relationship between objects concerned. In order to manage these information efficiently, the road information should be well organized and standardized for digital data. Because the road is the base place under which most urban utilities are buried. However, the present real situation is that even if we have unique numbers authorized by law for some parts of the road it is too ambiguous to figure out the spatial location of the specific area because the assigned area is so large and incoherent. Therefore, the purpose of this study is to propose a road location identication scheme, to apply this scheme at Kangnam-ku Seoul, and finally to propose the guideline in developing the road management information system in Korea. The road identification scheme developed in this study are as follows: (1) The road is defined as a fixed factor, and was given the identification number which repressents the funtion, relationship, and direction of the road without the road section and absolute coordinates. (2) The parcel identification nutter was given to each route to understand it possible to understand the location of the road itself and surroundings. (3) To update the md information using the scheme developed in this study relative coordinate method(Dynamic Segmentation) based on the road centerline was applied.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.17 no.4
• /
• pp.115-129
• /
• 2007

The ubiquitous and autonomic computing environments is open and dynamic providing the universal wireless access through seamless integration of software and system architectures. The ubiquitous computing have to offer the user-centric pervasive services according to the wireless access. Therefore the roaming services with the predefined security associations among all of the mobile devices in various networks is especially complex and difficult. Furthermore, there has been little study of security coordination for realistic autonomic system capable of authenticating users with different kinds of user interfaces, efficient context modeling with user profiles on Smart Cards, and providing pervasive access service by setting roaming agreements with a variety of wireless network operators. This paper proposes a Roaming Coordinator-based security management framework that supports the capability of interoperator roaming with the pervasive security services among the push service based network domains. Compared to traditional mobile systems in which a Universal Subscriber Identity Module(USIM) is dedicated to one service domain only, our proposed system with Roaming Coordinator is more open, secure, and easy to update for security services throughout the different network domains such as public wireless local area networks(PWLANs), 3G cellular networks and wireless metropolitan area networks(WMANs).

• Journal of Korea Spatial Information System Society
• /
• v.6 no.1 s.11
• /
• pp.73-85
• /
• 2004

Recently, as the growth of the wireless Internet, PDA and HPC, the focus of research and development related with GIS(Geographic Information System) has been changed to the Real-Time Mobile GIS to service LBS. To offer LBS efficiently, there must be the Real-Time GIS platform that can deal with dynamic status of moving objects and a location index which can deal with the characteristics of location data. Location data can use the same data type(e.g., point) of GIS, but the management of location data is very different. Therefore, in this paper, we studied the Real-Time Mobile GIS using the HBR-tree to manage mass of location data efficiently. The Real-Time Mobile GIS which is developed in this paper consists of the HBR-tree and the Real-Time GIS Platform HBR-tree. we proposed in this paper, is a combined index type of the R-tree and the spatial hash Although location data are updated frequently, update operations are done within the same hash table in the HBR-tree, so it costs less than other tree-based indexes Since the HBR-tree uses the same search mechanism of the R-tree, it is possible to search location data quickly. The Real-Time GIS platform consists of a Real-Time GIS engine that is extended from a main memory database system. a middleware which can transfer spatial, aspatial data to clients and receive location data from clients, and a mobile client which operates on the mobile devices. Especially, this paper described the performance evaluation conducted with practical tests if the HBR-tree and the Real-Time GIS engine respectively.