• Proceedings of the Korea Contents Association Conference
• /
• 2007.11a
• /
• pp.346-349
• /
• 2007

In this paper, the integrated search system made for the web news and review retrieval service is introduced. We made XSLTRobot that extract title, date, author and content from html document like news or reviews for search service. XSLTRobot used the XSLT technology in order to extract desired part of html page. The Intergrated Information Retrieval System(IIRS) is suitable for various search data format. And we introduce Dynamic Index Storage which is module of IIRS. Dynamic Index Storage is used to environment which needs fast index update like news. And it's design focused on retrieval performance because there was not many document that it has to update on a real time.

• Journal of information and communication convergence engineering
• /
• v.13 no.1
• /
• pp.42-49
• /
• 2015

In laser pointer interaction systems, laser spot detection is one of the most important technologies, and most of the challenges in this area are related to the varying backgrounds, and the real-time performance of the interaction system. In this paper, we present a robust dictionary construction and update algorithm based on a sparse model of background subtraction. In order to control dynamic backgrounds, first, we determine whether there is a change in the backgrounds; if this is true, the new background can be directly added to the dictionary configurations; otherwise, we run an online cumulative average on the backgrounds to update the dictionary. The proposed dictionary construction and update algorithm for laser spot detection, is robust to the varying backgrounds and noises, and can be implemented in real time. A large number of experimental results have confirmed the superior performance of the proposed method in terms of the detection error and real-time implementation.

• Journal of Korea Society of Industrial Information Systems
• /
• v.16 no.1
• /
• pp.37-48
• /
• 2011

Sensor networks monitor the environment, collect sensed data, and relay the data back to a collection point. Although sensor nodes have very limited hardware resources, they require an operating system that can provide efficient resource management and various application environments. In addition, the wireless sensor networks require the code update previously deployed to patch bugs in program and to improve performance of kernel service routines and application programs. This paper presents EPRCU (Easy to Perform Remote Code Update), a new operating system for wireless sensor nodes, which has enhanced functionalities to perform remote code update. To achieve an efficient code update, the EPRCU provides dynamic memory allocation and program memory management. It supports the event-driven kernel, which uses priority-based scheduling with the application of aging techniques. Therefore, the proposed operating system is not only easy to perform wireless communication with the remote code update but also suitable for various sensor network applications.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.6
• /
• pp.2429-2449
• /
• 2018

Dynamic data possession verification is a common requirement in cloud storage systems. After the client outsources its data to the cloud, it needs to not only check the integrity of its data but also verify whether the update is executed correctly. Previous researches have proposed various schemes based on Merkle Hash Tree (MHT) and implemented some initial improvements to prevent the tree imbalance. This paper tries to take one step further: Is there still any problems remained for optimization? In this paper, we study how to raise the efficiency of data dynamics by improving the parts of query and rebalancing, using a new data structure called Rank-Based Merkle AVL Tree (RB-MAT). Furthermore, we fill the gap of verifying multiple update operations at the same time, which is the novel batch updating scheme. The experimental results show that our efficient scheme has better efficiency than those of existing methods.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.9
• /
• pp.1668-1683
• /
• 2011

The importance of secure communication between only legitimate group members in ad hoc networks has been growing in recent years. Due to the ad hoc nature the scalability on dynamic membership change is a major concern. However, the previous models require at least O(log n) communication cost for key update per each membership change, which imposes a heavy burden on the devices. In this paper we present a scalable model that supports communication-efficient membership change in ad hoc networks by exclusionary keys and RSA functions. The multicast cost for key update is extremely low, that is O(1) , and one-to-one communications occur mostly in neighboring devices.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.46 no.3
• /
• pp.116-122
• /
• 2009

Mobile Wireless Sensor Network is an organized collection of sensor nodes and mobile sink nodes, in which the sensor node transmits the signal to the sink node. In real environment, there are many cases in which sinks have mobility caused by the people, the vehicle and etc. Since all nodes in the sensor networks have limited energy, many researches have been done in order to prolong the lifetime of the entire network. In this paper we propose Dynamic Local Update-based Routing Protocol(D-LURP) that prolong the lifetime of the entire network to efficiently maintain frequent location update of mobile sink static sensor nodes in Mobile WSNs. When the sink node moves out of the local broadcasting area the proposed D-LURP configures dynamically the local update area consisted of the new local broadcasting area and the previous dissemination node(DN) and find the path between the DN and the sink node, instead of processing a new discovering path like LURP. In this way the processing of broadcasting sink node's location information in the entire network will be omitted. and thus less energy will be consumpted. We compare the performances of the proposed scheme and existing Protocols.

• Proceedings of the IEEK Conference
• /
• 2009.05a
• /
• pp.267-269
• /
• 2009

Incomplete knowledge instances may be registered from misidentifications of sensors, such as vision sensor. In previous study, we proposed robust object instance registration method to robot centered knowledge framework to guarantee the consistency of the registered knowledge. In real environment, a persistent update is necessary due to the objects can be moved dynamically. In this paper, we propose the way to update robot knowledge continually using the registration method. Our experiment in this paper shows that sound and complete knowledge can be registered and updated by the proposed method, even under imperfect sensing data.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.15 no.6
• /
• pp.3841-3850
• /
• 2014

Owing to the rapid supply of mobile devices, the requirements of users for new mobile software has increased and software vendors (developers) should be able to provide software fast and appropriately. On the other hand, the mobile application in a mobile platform architecture should pass through a complex process to provide the modified mobile application to users and cannot provide an update quickly and immediately. On the other hand, the use of the mobile web is growing because a mobile web can provide an immediate modification of various update requirements to users. Therefore, this paper proposes a dynamic configuration technique for enhancing the productivity of the mobile web development and maintenance in this paper.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.18 no.3
• /
• pp.387-391
• /
• 2008

For the detection of moving objects, background subtraction methods are widely used. In case the background has variation, we need to update the background in real-time for the reliable detection of foreground objects. Gaussian mixture model (GMM) combined with probabilistic learning is one of the most popular methods for the real-time update of the background. However, it does not work well in the complex and dynamic backgrounds with high traffic regions. In this paper, we propose a new method for modelling and updating more reliably the complex and dynamic backgrounds based on the probabilistic learning and the layered processing.

• Journal of the Korean Society of Manufacturing Technology Engineers
• /
• v.23 no.4
• /
• pp.337-344
• /
• 2014

While implicit integration methods such as Newton's method have excellent stability for the analysis of stiff and constrained mechanical systems, they have the drawback that the evaluation and LU-factorization of the system Jacobian matrix required at every time step are time-consuming. This paper proposes a Jacobian update-free Newton's method in order to overcome these defects. Because the motions of all bodies in a vehicle model are limited with respect to the chassis body, the equations are formulated with respect to the moving chassis-body reference frame instead of the fixed inertial reference frame. This makes the system Jacobian remain nearly constant, and thus allows the Newton's method to be free from the Jacobian update. Consequently, the proposed method significantly decreases the computational cost of the vehicle dynamic simulation. This paper provides detailed generalized formulation procedures for the equations of motion, constraint equations, and generalized forces of the proposed method.