• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.5_6
• /
• pp.360-370
• /
• 2004

Adaptive mesh refinement(AMR) is one of the popular computational simulation techniques used in various scientific and engineering fields. Although AMR data is organized in a hierarchical multi-resolution data structure, traditional volume visualization algorithms such as ray-casting and splatting cannot handle the form without converting it to a sophisticated data structure. In this paper, we present a hierarchical multi-resolution splatting technique using k-d trees and octrees for AMR data that is suitable for implementation on the latest consumer PC graphics hardware. We describe a graphical user interface to set transfer function and viewing / rendering parameters interactively. Experimental results obtained on a general purpose PC equipped with an nVIDIA GeForce3 card are presented to demonstrate that the proposed techniques can interactively render AMR data(over 20 frames per second). Our scheme can easily be applied to parallel rendering of time-varying AMR data.

• Journal of Navigation and Port Research
• /
• v.46 no.2
• /
• pp.92-98
• /
• 2022

Maritime accidents result in enormous economic loss and loss of life; thus, such accidents must be prevented, and risks must be managed to prevent these occurrences Risk management must be based on statistical evidence such as variables. Because calculating when variables increase statistically can be difficult, compressing the designated variables is necessary to use the maritime accident data in Korea. Thus, in this study, variables of marine accident data are compressed using statistical methods. The date, ship type, and marine accident type included in all maritime accident data were extracted, the number of optimal variables was confirmed using the hierarchical clustering analysis method, and the data were compressed. For the compressed variables, the validity of the data use was statistically confirmed using analysis of variance, and the data of the variables identified using the variable compression method were designated. Consequently, among the monthly and yearly data, statistical significance was confirmed in yearly data, and compression was possible. The significance of the data was confirmed in six and eight types of ships and accidents, respectively, and these were compressed. These results can be directly used for prevention or prediction based on past maritime accident data. Additionally, the data range extracted from past maritime accidents and the number of applicable data will be studied in the future.

• Communications for Statistical Applications and Methods
• /
• v.12 no.3
• /
• pp.759-771
• /
• 2005

Twin studies are one of the most widely used methods for quantifying the influence of genetic and environmental factors on some traits such as a life span or a disease. In this paper we propose a genetic mixed linear model for twin survival time data, which allows us to separate the genetic component from the environmental component. Inferences are based upon the hierarchical likelihood (h-likelihood), which provides a statistically efficient and simple unified framework for various random-effect models. We also propose a simple and fast computation method for analyzing a large data set on twin survival study. The new method is illustrated to the survival data in Swedish Twin Registry. A simulation study is carried out to evaluate the performance.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.30B no.5
• /
• pp.90-102
• /
• 1993

In this paper, we propose a prgressive image transmission technique using hierarchical pyramid data structure which is constructed based on the projection data of an image. To construct hierarchical Gaussian pyramids, we first divide an image into 4$\times$4 subblocks and generate the projection data of each block along the horizontal, vertical, diagonal, and antidiagonal directions. Among images reconstructed by backprojecting the projection data along a single direction, the one giving the minimum distortion is selected. The Gaussian pyramid is recursively generated by the proposed algorithm and the proposed Gaussian images are shown to preserve edge information well. Also, based on the projection concept a new transmission scheme of the lowest Laplacian plane is presented. Computer simulation shows that the quantitative performance of the proposed pyramid coding technique using projection concept is similar to those of the conventional methods with transmission rate reduced by 0.1 ~ 0.2 bpp and its subjective performance is shown to be better due to the edge preserving property of a projection operation.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.4 no.2
• /
• pp.205-210
• /
• 2004

This paper deals with rule extraction from data using rough set theory. We construct the rule base in a hierarchical granulation structure by applying core as a classification criteria at each level. When more than one core exist, the coverage is used for the selection of an appropriate one among them to increase the classification rate and accuracy. In Addition, a probabilistic approach is suggested so that the partially useful information included in inconsistent data can be contributed to knowledge reduction in order to decrease the effect of the uncertainty or vagueness of data. As a result, the proposed method yields more proper and efficient rule base in compatability and size. The simulation result shows that it gives a good performance in spite of very simple rules and short conditionals.

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.109-110
• /
• 2006

We propose a data rate increasing technique for T-DMB (terrestrial digital multimedia broadcasting) system. With the application of hierarchical modulation, it is possible to increase data rate and improve services. We conducted the performance analysis of the proposed hierarchical modulation in AWGN channel and showed the BER analysis. The simulation results show that the proposed method shows possibilities to increase the data rate with a moderate degradation of the existing system.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 2004.11a
• /
• pp.170-170
• /
• 2004

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2010.05a
• /
• pp.894-896
• /
• 2010

In mobile wireless sensor network, Whole nodes can move. In mobile wireless sensor network based on clustering, there can be frequent re-configuration of cluster according to frequent changes of location. Frequent reconfiguration of the cluster cause a lot of power consumption and data loss. To solve this problem, we suggest relay method for sending reliable data and decreases a number of re-configuration of cluster using relay node.

• Journal of Computing Science and Engineering
• /
• v.1 no.2
• /
• pp.195-210
• /
• 2007

Dwarf is a highly compressed structure, which compresses the cube by eliminating the semantic redundancies while computing a data cube. Although it has high compression ratio, Dwarf is slower in querying and more difficult in updating due to its structure characteristics. We all know that the original intention of data cube is to speed up the query performance, so we propose two novel clustering methods for query optimization: the recursion clustering method which clusters the nodes in a recursive manner to speed up point queries and the hierarchical clustering method which clusters the nodes of the same dimension to speed up range queries. To facilitate the implementation, we design a partition strategy and a logical clustering mechanism. Experimental results show our methods can effectively improve the query performance on data cubes, and the recursion clustering method is suitable for both point queries and range queries.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.12 no.6
• /
• pp.2815-2822
• /
• 2011

Clustering method in wireless sensor networks is the technique that forms the cluster to aggregate the data and transmit them at the same time that they can use the energy efficiently. In this paper, I propose the hierarchical unequal clustering method using cluster group model. This divides the entire network into two layers. The data aggregated from layer 2 consisted of cluster group is sent to layer 1, after re-aggregation the total data is sent to base station. This method decreases whole energy consumption by using cluster group model with multi-hop communication architecture. Hot spot problem can be solved by establishing unequal cluster. I also show that proposed hierarchical unequal clustering method is better than previous clustering method at the point of network energy efficiency.