• The KIPS Transactions:PartC
• /
• v.14C no.2
• /
• pp.191-198
• /
• 2007

A mobile ad-hoc network (MANET) is an autonomous, infrastructure-less system that consists of mobile nodes. In MANET, on demand routing protocols are usually used because network topology changes frequently. AODV, which is a representative on demand routing protocol, operates using the routing table of each node that includes next hop of a route for forwarding packets. It maintains the established route if there is not an expiration of route or any link break. In the paper, we propose a partially adaptive route maintenance scheme (AODV-PA) based on AODV, which provides dynamic route modification of initial route for selecting the effective route using not only next hop but also next-hop of next-hop (i.e. 2-hop next node) acquired through route discovery process. In addition, the proposed scheme additionally manages the routing table for preventing exceptional link breaks by route modification using HELLO messages. We use NS 2 for the computer simulation and validate that the proposed scheme is better than general AODV in terms of packet delivery ratio, latency, routing overhead.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.6
• /
• pp.1542-1555
• /
• 1999

This paper proposes an algorithm for class hierarchies which can optimize member data and member function. This algorithm considers single/multiple inheritance, static/dynamic binding, overloading/overriding, pure virtual/virtual function, and constructor on the hierarchy of C++ class. We need to eliminate unused function that possesses many component element, because the program uses a limited of function in class hierarchies. Previous works on slicing mainly focused on selecting output data and including the related program statement. It was consists of structured programming language and also centralized on error detection, maintenance, and flexible testing. In this paper, we extend to the object-oriented language, makes a linked-table for objects to raise the efficiency of information management, and proposes necessary algorithm for optimizing system Through this process, we can obtain the simplification of program code and the progress of system performance by eliminating unused member data and member function.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.4
• /
• pp.111-122
• /
• 2014

Legislation are social norms that give directly or indirectly, huge impact on the social or corporate, personal problems, unlike a normal document. Also, over time it has a feature constantly changing by the laws enactment and amendment, repealed. The amendment statement automatic generated system is used for purpose of proclamation to those. However, existing system is able to generate amendment statement just text body of law how compare and analyze the current legislation and amendment legislation. However, actual legislation to be created attached table of the table form in complex structure besides simple text form as body text. In this paper, we additional implement attached table processing to existing the amendment statement automatic generated system that containing the table does not handle attached table. We were analyse to the amendment statement generated grammar and table structure in attached table of the legislation for processing to attached table. Also proposed a method to compare attached table in the table. So, it is enable the automatic generation with amendment statement which various forms of legislation the documents.

• Journal of Korea Multimedia Society
• /
• v.9 no.9
• /
• pp.1118-1130
• /
• 2006

Existed pattern analysis algorithms in data streams environment have researched performance improvement and effective memory usage. But when new data streams come, existed pattern analysis algorithms have to analyze patterns again and have to generate pattern tree again. This approach needs many calculations in real situation that needs real time pattern analysis. This paper proposes a method that continuously analyzes patterns of incoming data streams in real time. This method analyzes patterns fast, and thereafter obtains real time patterns by updating previously analyzed patterns. The incoming data streams are divided into several sequences based on time based window. Informations of the sequences are inputted into a hash table. When the number of the sequences are over predefined bound, patterns are analyzed from the hash table. The patterns form a pattern tree, and later created new patterns update the pattern tree. In this way, real time patterns are always maintained in the pattern tree. During pattern analysis, suffixes of both new pattern and existed pattern in the tree can be same. Then a pointer is created from the new pattern to the existed pattern. This method reduce calculation time during duplicated pattern analysis. And old patterns in the tree are deleted easily by FIFO method. The advantage of our algorithm is proved by performance comparison with existed method, MILE, in a condition that pattern is changed continuously. And we look around performance variation by changing several variable in the algorithm.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.17 no.6
• /
• pp.766-772
• /
• 2007

As XML is widely used, many researches on the XML storage and query processing have been done. But, previous works on path query processing have mainly focused on the storage and retrieval methods for a large XML document or XML documents had a same DTD. Those researches did not efficiently process partial match queries on the differently-structured document set. To resolve the problem, we suggested a new index structure using relational table. The method constructs the $B^+$-tree index using backward label paths instead of forward label paths used in previous researches for storing path information and allows for finding the label paths that match the partial match queries efficiently using it when process the queries.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.29 no.3
• /
• pp.277-283
• /
• 2016

A high-precision force-feedback 3-axes accelerometer developed in Korea has been investigated and studied for the verification of feasibility in the computational analysis and health monitoring of civil infrastructures. Through a series of experiment, the nonlinearity, bandwidth, low-frequency signal measurement accuracy and bias characteristics of the accelerometer has been thoroughly compared to those of two accelerometers produced by two market leaders in domestic and global accelerometer market. The experiment results shows that the overall measurement performance of the accelerometer has superiority over the performance of the two accelerometers from global market leader companies. Especially, the accelerometer shows a better low-frequency signal measurement accuracy and constant bias characteristic, which are mostly required in the computational analysis and the long-term health monitoring of large-scale civil infrastructures.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.4 no.2
• /
• pp.63-70
• /
• 2003

In this paper, an MFC (Mass Flow Controller) which is widely used in many semiconductor manufacturing processes for controlling the mass flow rate of a gas is designed and implemented using the PIC 16F876 of Microchip, Inc. The MFC implemented in this thesis has the form of hybrid-type, i.e., the mixed-type of the analog-type MFC, which has many problems such as low accurary, and digital-type MFC, which use an expensive DSP (Digital Signal Processor) and an ADC (Analog to Digital Convertor) with high precision. The MFC is consists of the sensor unit, the control unit and the actuator unit, and it has used the automatic calibration algorithm and the reference table method for the improvement of the performance.

• Journal of Korean Institute of Industrial Engineers
• /
• v.27 no.4
• /
• pp.406-412
• /
• 2001

IP address lookup is to determine the next hop destination of an incoming packet in the router. The address lookup is a major bottleneck in high performance router due to the increased routing table sizes, increased traffic, higher speed links, and the migration to 128 bits IPv6 addresses. IP lookup time is dependent on data structure of lookup table and search scheme. In this paper, we propose a new approach to build a lookup table that satisfies the memory constraint. The design of lookup table is formulated as an optimization problem. The objective is to minimize average depth from the root node for lookup. We assume that the frequencies with which prefixes are accessed are known and the data structure is level compressed trie with branching factor $\kappa$ at the root and binary at all other nodes. Thus, the problem is to determine the branching factor k at the root node such that the average depth is minimized. A heuristic procedure is proposed to solve the problem. Experimental results show that the lookup table based on the proposed heuristic has better average and the worst-case depth for lookup.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.16 no.4
• /
• pp.128-134
• /
• 2008

In this paper, a hydropneumatic modeling and analysis of a heavy truck cabin air suspension system is presented. Cabin air suspension system is a system which improves ride comfort of a heavy truck and it can reduce vibration between truck frame and cabin. The components of the system, air spring, shock absorber, leveling valve and full cabin system are mathematically modelled using AMESim software. Simulation results of components and full cabin system are compared with experimental data of components and test results of a cabin using 6 axis simulation table. It is found that the simulation results are in good agreements with test results, and the hydropneumatic model can be used well to predict dynamic characteric of heavy truck cabin air suspension system.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.6 no.1
• /
• pp.37-47
• /
• 2003

In this paper, a component was designed for a loom in a window, and then a user interface was implemented to be able to connect database and to process various queries. The implemented system has aggregate query processing functions for the loom components existing in the selected area by the mouse and it also supports high level query processing functions represented with chart and pivot table; we can use it as a decision support system. The proposed system can detect temporal or persistent problems in the looms. Therefore, it can be used to raise the productivity and to reduce the cost in textile companies by coping with the situation properly.