• Proceedings of the Korea Society for Simulation Conference
• /
• 2003.11a
• /
• pp.87-93
• /
• 2003

This paper reviews existing message-filtering schemes and presents a quantization-based message-filtering approach which reduces state update transmission and message traffic requirement. For a realization of the approach we develop a DEVS-based integrator which provides behavior and characteristic of the quantization-based approach. We take a spaceship and space traveling system as a case study to evaluate performance of the quantization-based approach. The approach is validated by DEVSJAVA simulations of the case study. The comparison of message traffic requirement between DTSS (Discrete Time System Specification)-based and DEVS-based systems apparently shows system performance improvement through the quantization-based approach.

• International Journal of Internet, Broadcasting and Communication
• /
• v.8 no.3
• /
• pp.12-24
• /
• 2016

Recently, as the price per bit is decreasing at a fast rate, flash memory is considered to be used as primary storage of large-scale database systems. Although flash memory shows off its high speeds of page reads, however, it has a problem of noticeable performance degradation in the presence of increasing update workloads. When updates are requested for pages with random page IDs, in particular, the shortcoming of flash tends to impair significantly the overall performance of a flash-based database system. Therefore, it is important to have a way to efficiently update the B+-tree, when it is stored in flash storage. This is because most of updates in the B+-tree arise at leaf nodes, whose page IDs are in random. In this light, we propose a new flash B+-tree that stores up-to-date versions of leaf nodes in sibling-leaf blocks (SLBs), while updating them. The use of SLBs improves the update performance of B-trees and provides the mechanism for fast key range searches. To verify the performance advantages of the proposed flash B+-tree, we developed a mathematical performance evaluation model that is suited for assessing B-tree operations. The performance comparisons from it show that the proposed flash B+-tree provides faster range searches and reduces more than 50% of update costs.

• Korean Journal of Computational Design and Engineering
• /
• v.11 no.5
• /
• pp.335-343
• /
• 2006

Design changes for an original surface model are frequently required in a manufacturing area: for example, when the physical parts are modified or when the parts are partially manufactured from analogous shapes. In this case, an efficient 3D model updating method by locally adding scan data for the modified area is highly desirable. For this purpose, this paper presents a new procedure to update an initial model that is composed of combinatorial triangular facets based on a set of locally added point data. The initial surface model is first created from the initial point set by Tight Cocone, which is a water-tight surface reconstructor; and then the point cloud data for the updates is locally added onto the initial model maintaining the same coordinate system. In order to update the initial model, the special region on the initial surface that needs to be updated is recognized through the detection of the overlapping area between the initial model and the boundary of the newly added point cloud. After that, the initial surface model is eventually updated to the final output by replacing the recognized region with the newly added point cloud. The proposed method has been implemented and tested with several examples. This algorithm will be practically useful to modify the surface model with physical part changes and free-form surface design.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10b
• /
• pp.700-702
• /
• 2004

A local-step optimization method is proposed to supplement the global-step optimization methods which adopt online update mode of internal weights and error energy as stop criterion in learning of multilayer perceptrons (MLPs). This optimization method is applied to the standard online error backpropagation(EBP) and the performance is evaluated for a speaker verification system.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.18 no.36
• /
• pp.83-91
• /
• 1995

The objective of this paper is to develop ail algorithm to update probabilities in influence diagrams. Pearl has designed the method of conditioning. This paper applies his algorithm for probability updates by selecting a loop-outset for tile diagram and instantiating these loop-outset nodes. It is discussed the conditions that need to be satisfied by the selected nodes. And a heuristic algorithm is presented for finding a loop-outset that satisfies these conditions.

• Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
• /
• 2007.04a
• /
• pp.383-387
• /
• 2007

The improved accuracy of the Land Cover/Land Use Map constructed using Hyperspectal Satellite Image and the possibility of real time classification of Land Use using optimal Band Selective Factor enable the change detection from automatic classification using the existed Land Cover/Land Use Map and the newly acquired Hyperspectral Satellite Image. In this study, the effective analysis techniques for automatic generation of training regions, automatic classification and automatic change detection are proposed to minimize the expert's interpretation for automatic update of the Land Cover/Land Use Map. The proposed algorithms performed successfully the automatic Land Cover/Land Use Map construction, automatic change detection and automatic update on the image which contained the changed region. It would increase applicability in actual services. Also, it would be expected to present the effective methods of constructing national land monitoring system.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1996.04a
• /
• pp.172-178
• /
• 1996

Databases are critical to business information systems, and RDBMS is most widely usded for the database system. Normalization has been designed to control various anomalies(insert, update, and delete anomalies). However, normalized databese design does not account for the tradeoffs necessary for the performance. In this research, we develop a model for database desin by denormalization of duplicating attributes in order to reduce frequent join processes. In this model, we consider insert, update, and delete costs. The anomalies are treated by additional disk I/O which is necessary for each insert and update transaction. We propose a branch and bound method for this model, and show considerable cost reduction.

• Journal of Communications and Networks
• /
• v.15 no.5
• /
• pp.538-542
• /
• 2013

This paper proposes a broadcast software download (BSD) scheme for a 10-gigabit-capable passive optical network (XG-PON), which dramatically reduces the time required to update a remotely-located user terminal's software. The performance of the proposed BSD is examined by numerical analysis and demonstrated by experimental verification on our XG-PON test platforms. The results show that the BSD takes less than 5 minutes to update 45 user-terminal software, while the conventional unicast software download scheme normally takes more than one and half hours.

• Asia pacific journal of information systems
• /
• v.5 no.2
• /
• pp.131-142
• /
• 1995

In distributed database systems materialized views are useful to solve many problems caused by data replication. This paper deals with the problem of updating materialized views incluing join operations. We use a differential update which uses logs that record the change of base tables in certain periods. This method avoids locking of the base tables so that it makes the system more efficient. We update materialized views periodically to save the updating cost envolved. A screen test is applied to differential files to eliminate tuples that are irrelevant to any of the views being updated. Using these methods, a detailed procedure is addressed to refresh materialized views. Then we show that our update procedure performs better than a semijoin approach.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2008.04a
• /
• pp.939-946
• /
• 2008

본 논문은 시청자의 위치에 최적화된 입체음향을 제공하는 TV 개발에 관한 것으로 2 개의 TV 스피커만으로 5.1 채널 스피커가 주는 입체음향 효과를 제공해준다. 기존의 Speaker Virtualizer 기술은 시청자가 특정 위치(Sweet Spot)를 벗어나면 입체음향 성능이 현저히 저하된다. 반면, 본 논문에서 제안하는 Adaptive Virtualizer 기술은 초음파가 장착된 리모콘을 사용하여 시청자의 위치를 인식하고 인식된 시청자의 위치 정보를 활용하여 청취위치에 해당하는 HRTF로부터 설계된 Filter를 Update 하고 두 스피커의 출력레벨 및 시간지연 값을 보정함으로써 최적의 입체음향을 재현한다. 본 논문에서는 실시간 구현을 위해 Speaker Virtualizer의 계산량을 최소화하는 기술을 제안하고 다양한 청취 위치에 해당하는 Filter를 설계하고 설계된 Filter를 효율적으로 Update 하는 Adaptive Virtualizer 기술을 제안한다. 또한, 초음파를 이용한 시청자 위치 인식 기술 및 전체 시스템 통합 기술을 제시한다.