• Journal of the Korea Society for Simulation
• /
• v.4 no.2
• /
• pp.61-68
• /
• 1995

The performance of event-driven logic simulation frequently used for VLSI design verification depends on the data structures for event queues. This paper improves the existing Timing Wheel as a data structure for an event queue. In case of the use of B+ tree, an efficient node degree is also presented based on the experiment results. A new Timing Wheel index structure, which eliminates the insertion and deletion overhead of B+ tree, is proposed and analyzed.

• Journal of information and communication convergence engineering
• /
• v.21 no.1
• /
• pp.54-61
• /
• 2023

The family tree is one of the key elements of humanities classics research and is very important for accurately understanding people or families. In this paper, we introduce a method for automatically generating a family tree using information on interpersonal relationships (IIPR) from the Korean Classics Database (KCDB) and visualize interpersonal searches within a family tree using data-driven document JavaScript (d3.js). To date, researchers of humanities classics have wasted considerable time manually drawing family trees to understand people's influence relationships. An automatic family tree builder analyzes a database that visually expresses the desired family tree. Because a family tree contains a large amount of data, we analyze the performance and bottlenecks according to the amount of data for visualization and propose an optimal way to construct a family tree. To this end, we create an n-ary tree with fake data, visualize it, and analyze its performance using simulation results.

• Journal of the Korea Computer Graphics Society
• /
• v.25 no.3
• /
• pp.105-113
• /
• 2019

Physically-based fluid simulation takes a lot of time for high resolution. To solve this problem, there are studies that make up the limitation of low resolution fluid simulation by using deep running. Among them, Super-resolution, which converts low-resolution simulation data to high resolution is under way. However, traditional techniques require to the entire space where there are no density data, so there are problems that are inefficient in terms of the full simulation speed and that cannot be computed with the lack of GPU memory as input resolution increases. In this paper, we propose a new method that divides and classifies 2D smoke simulation data into the space using the quad tree, one of the spatial partitioning methods, and performs Super-resolution only required space. This technique accelerates the simulation speed by computing only necessary space. It also processes the divided input data, which can solve GPU memory problems.

• Journal of the Korean Statistical Society
• /
• v.25 no.1
• /
• pp.1-24
• /
• 1996

In selecting a final tree, Breiman, Friedman, Olshen, and Stone(1984) compare the prediction risks of a pair of tree, where one contains the other, using the standard error of the prediction risk of the larger one. This paper proposes an approach to selection of a final tree by using the standard error of the difference of the prediction risks between a pair of trees rather than the standard error of the larger one. This approach is compared with CART's for simulated data from a simple regression model. Asymptotic results of the approaches are also derived and compared to each other. Both the asymptotic and the simulation results indicate that final trees by CART tend to be smaller than desired.

• Ecology and Resilient Infrastructure
• /
• v.10 no.4
• /
• pp.250-257
• /
• 2023

Tree in river have environmental functions such as ecosystem preservation and flood control functions that protect the riverbank. On the other hand, excessive tree development can have the negative effect of fixing the sand bar and reducing the cross-sectional area. Nays2D simulation results performing two flow conditions (average dam operation discharge and two-year frequency discharge) and four tree density conditions (current, zero, low, high tree density) used as input data for PHABSIM to calculate WUA (Weighted Usable Area). The results show that riverbed changes occur more significantly in the zero tree density than presence of trees, which could have a positive impact on the biological habitat environment of Zacco platypus.

• Journal of Environmental Science International
• /
• v.21 no.4
• /
• pp.391-399
• /
• 2012

This study proposes lighting simulation approach to assess lighting quality on motor ways and walk ways considering each type of form and growth of roadside trees. Simulation approach to assess quality of lighting is frequently used for lighting design which guarantees secure of drivers and pedestrians during the night time. But, road side trees which have diverse benefits for citizens acts on obstacles during night time needs lighting. The results of this study shows a possible way for tuning the aims of both lighting and road side tree. It will be possible to develop harmonic design standards for road way lighting if further study achieved based on the result of this study.

• Journal of the Korea Society for Simulation
• /
• v.25 no.3
• /
• pp.77-83
• /
• 2016

A new key generation scheme is proposed to support partial encryption and partial decryption of data in cloud computing environment with a minimal key-related traffic overhead. Our proposed scheme employs a concept of hash tree chain to reduce the number of keys that need to be delivered to the decryption node. The performance of the proposed scheme is evaluated through simulation.

• Proceedings of the IEEK Conference
• /
• 2003.07a
• /
• pp.374-377
• /
• 2003

In this paper, a performance evaluation model of the Fat-Tree network with the multiple-buffered crossbar switches is proposed and examined. Buffered switch technique is well known to solve the data collision problem in the switch network The proposed evaluation model is developed by investigating the transfer patterns of data packets in a switch with output-buffers. Steady state probability concept is used to simplify the analyzing processes. Two important parameters of the network performance, throughput and delay, are then evaluated. To validate the proposed analysis model, the simulation is carried out on the various sizes of Fat-tree networks that use the multiple a$\times$b buffered crossbar switches. It is observed that both analysis and simulation results are match closely.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.56 no.11
• /
• pp.2027-2032
• /
• 2007

In this paper, digital watermarking method using quad-tree algorithm and the lowest frequency band is proposed. The proposed algorithm searches the coefficient of the watermark by using quad-tree algorithm and inserts the watermark by the Cox's algorithm. The simulation of the proposed algorithm is implemented about the effect of various weight factors in Cox's algorithm, that of embedding watermark in each subband coefficient (HH, LH, HL), and that of embedding in the lowest frequency band (LL). As a simulation result, the bigger weight factors in Cox's algorithm show strong to noise. The watermarking performance of simultaneously embedding in HH, LH, and HL band is better than that of different cases. In addition, insertion the watermark to the LL band about $30{\sim}60%$ of all watermarks improves the watermarking performance in comparison with the case of not using the LL band.

• Journal of Information Technology Applications and Management
• /
• v.13 no.4
• /
• pp.257-271
• /
• 2006

Recently, flash memories are one of best media to support portable computer's storages in mobile computing environment. The features of non-volatility, low power consumption, and fast access time for read operations are sufficient grounds to support flash memory as major database storage components of portable computers. However, we need to improve traditional Indexing scheme such as B-Tree due to the relatively slow characteristics of flash operation as compared to RAM memory. In order to achieve this goal, we devise a new indexing scheme called F-Tree. F-Tree improves tree operation performance by compressing pointers and keys in tree nodes and rewriting the nodes without a slow erase operation in node insert/delete processes. Based on the results of the performance evaluation, we conclude that F-Tree indexing scheme outperforms the traditional indexing scheme.