• Journal of Korea Multimedia Society
• /
• v.8 no.2
• /
• pp.154-163
• /
• 2005

Because most researches that were studied so far on XML documents used an absolute coordinate system in most of the index techniques, the update operation makes a large burden. To express the structural relations between elements, attributes and text, we need to reconstruct the structure of the coordinates. As the reconstruction process proceeds through out the entire XML document in a cascade manner, which is not limited to the current changing node, a serious performance problem may be caused by the frequent update operations. In this paper, we propose an index technique based on extensible index that does not cause serious performance degradations. It can limit the number of node to participate in reconstruction process and improve lots of performance capacities on the whole. And extensible index performs the containment relationship query by the simple expression using SQL statement.

• Journal of Internet Computing and Services
• /
• v.8 no.4
• /
• pp.81-91
• /
• 2007

Binding update for the routing optimization in MIPv6 can make the involved nodes vulnerable to various attacks. Therefore, secure binding update becomes an important research issue in MIPv6, and several protocols have been proposed for this purpose. In this paper, we compare several existing binding update protocols such as RR, SUCV and OMIPv6 and analyze the vulnerability of nodes to the possible attacks and drawbacks of address management and scalability and overhead of encryption operations. Then, we suggest the design requirements for the secure binding update and propose an advanced protocol based on the design principle. Through the analysis, we show that our protocol can achieve a higher level of security against the various attacks and enable better management of address, provide the location privacy and reduce the computational overhead of mobile nodes with constraint computational power.

• Journal of the Institute of Convergence Signal Processing
• /
• v.5 no.3
• /
• pp.205-209
• /
• 2004

The K-means algorithm is the most widely used method among the codebook generation algorithms in vector quantization. In this paper, we propose a codebook generation algorithm using a new updating condition to enhance the codebook performance. The conventional K-means algorithm uses a fixed weight of the distance for all training iterations, but the proposed method uses different weights according to the updating condition from the new codevectors for training iterations. Then, different weights can be applied to generate codevectors at each iteration according to this condition, and it can have a similar effect to variable weights. Experimental results show that the proposed algorithm has the better codebook performance than that of K-means algorithm.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.21 no.3
• /
• pp.75-88
• /
• 2011

Messages need to transmit to the neighbors securely in wireless sensor network, because a sensor node is deployed in hostile area. Thus it is necessary to support secure communication. One of the most important communication part is secure multicast. Especially, group rekeying is a big problem for multicast key management. So, group rekeying must be proceed securely when secrete information is exposed by attacker. Many group rekeying schemes have been studied for ad hoc networks. However, these schemes are Ill1desirable in WSNs. In this paper, we proposed a novel group rekeying scheme in WSNs that it has very powerful security.

• Journal of Korean Society for Geospatial Information Science
• /
• v.6 no.2 s.12
• /
• pp.11-20
• /
• 1998

Although aerial photogrammetry has been used to generate or update digital maps. It is difficult to make the spatial and attribute data for all kinds of objects on the ground with only aerial photogrammetry. Therefore, we are getting informations of the object on the ground through an on-the-spot survey In order to improve accuracy and reliability of on-the-spot survey in this study, we obtained stereo images from high resolution digital camera (1152*864 pixels) and developed the video photogrammetry which was able to determine the three dimensional coordinates from stereo images by applying DLT(Direct Linear Transformation). Also, the developed video photogrammetry could generate and update the spatial and attribute data in digital maps by using a function that could connect three dimensional coordinates with the attribute data.

• Journal of the Korean Geophysical Society
• /
• v.9 no.4
• /
• pp.387-395
• /
• 2006

Nowadays, various digital maps on a reduced scale were drawn in Korea including the topographic series of a nation. Though these digital maps are drawn and revised by using aerial photograph or satellite image, there are some problems that it is difficult to revise or renew the topography and natural feature immediately which changes frequently. As the countermeasures of these problems we use GPS accumbency method, which provides user with convenience and accumbency accuracy which is required to revise and renew digital maps. But acquiring correct position by using GPS only may cause not a few errors because of environmental effect of satellite signal errors that GPS obtains. Although accumulated errors which is the major problem of existing method was diminished owing to the position signal received from satellite which is about 20,183km above, the area that can not receives the signal is occur such as woods and high-rise buildings space. And because of the GDOP (Geometry Dilution of Precision) of GPS satellite and the periodically changing orbit of the satellite, the position calculating problems occur. For settlement of these problems and accurate position determination, DGPS (Differential GPS) is indispensably needed. So, in this study, by adapting Radio Beacon Receiver for marine position determination which is the most convenience method of DGPS methods, we elevated accuracy of modification and renewal of digital map and, having wide application in various measurements, proposed the rapid measurement method about widespread area. In this study, wewant to propose the work scheme of rapid modification and renewal of digital map by using Beacon GPS which is comparatively cheap of all the DGPS methods and which makes it possible to measure independently.

• KIPS Transactions on Computer and Communication Systems
• /
• v.2 no.10
• /
• pp.413-420
• /
• 2013

Redundant arrays of independent disks (RAID) without a power-fail-safe component in small and mid-sized business suffers from intolerably long resynchronization time after a unclean power-failure. Data blocks and a parity block in a stripe must be updated in a consistent manner, however a data block may be updated but the corresponding parity block may not be updated when a power goes off. Such a partially modified stripe must be updated with a correct parity block. However, it is difficult to find which stripe is partially updated (inconsistent). The widely-used traditional parity resynchronization manner is a intolerably long process that scans the entire volume to find and fix inconsistent stripes. This paper presents a fast resynchronization scheme with a negligible overhead for small and mid-sized RAIDs. The proposed scheme is integrated into a software RAID driver in a Linux system. According to the performance evaluation, the proposed scheme shortens the resynchronization process from 200 minutes to 5 seconds with 2% overhead for normal I/Os.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.27 no.2
• /
• pp.195-202
• /
• 2009

As the generation and application of spatial information is gradually expanded not only in traditional surveying fields but also a CNS and an ITS recently. The Accuracy and the newest of data grow to be an important element. But digital map is updated with system based tile. So, it is hard to get the newest of data and to be satisfied with user requirements. In this study, management system is developed to manage feature change efficiently using bid informations from NaraJangter which service the bid informations. A construction works with change possibility of feature from bid informations are classified and are made DB. And the DB is used as the feature change forecast informations. Also, It is converted from bid information of text form to positioning informations connected to spatial information data. If this system is made successfully, this system contributes to reduce the cost for the update of digital map and to take the newest date of spatial informations.

• Journal of Korea Multimedia Society
• /
• v.12 no.9
• /
• pp.1191-1200
• /
• 2009

The replicas in the Grid database is utilized for a lot of application services. And for deferent services or for deferent information depends on location, the access frequency of each replica is dissimilar. When one replica is stored in many nodes, each replicas applies the week-consistency in the grid computing environment. Especially, when a node work load or operation capacity is varied from others, the replica management would cost expansive. Therefore, this paper proposed the Update Method based on Dynamic Access-Frequency Tree. The dynamic access-frequency tree is pre-constructed by grouping nodes based on each nodes access frequency to manage the replica efficiently and avoid unbalance replica tree. The performance evaluation shows the proposed methods support more quick update than current methods.

• Journal of KIISE:Information Networking
• /
• v.31 no.1
• /
• pp.27-36
• /
• 2004

Frequent occurrence of binding update messages may incur high overhead in Mobile IP supporting users mobility. Thus, it needs to develop algorithms to deal with the situation. In this paper, we propose new lifetime assignment schemes for dynamic binding update considering the locality property related with mobile node's movement. Each mobile node maintains a profile which is based on log containing useful information about its visiting subnets. That is, it determines dynamic binding update lifetime for currently visiting subnet by computing past mean resident time recorded in the profile. In addition, we note that the resident time depends on the time when each node enters a subnet and thus, we devise another lifetime assignment algorithm. Extensive experiments are made to compare our schemes with existing Mobile IPv6 where major facts for performance comparison are both the number of binding update messages and the number of binding request messages. From the results, we come to know that our schemes obtain highly considerable performance improvements in terms of communication cost by decreasing the number of those messages.