• Journal of the Korean Data and Information Science Society
• /
• v.27 no.3
• /
• pp.803-814
• /
• 2016

Recent times have seen an exponential increase in the amount of spatial data, which is in many cases associated with temporal data. Recent advances in computer technology and computation of hierarchical Bayesian models have enabled to analyze complex spatio-temporal data. Our work aims at modeling data of daily average nitrogen dioxide (NO2) levels obtained from 25 air monitoring sites in Seoul between 2003 and 2010. We considered an independent Gaussian process model and an auto-regressive model and carried out estimation within a hierarchical Bayesian framework with Markov chain Monte Carlo techniques. A Gaussian predictive process approximation has shown the better prediction performance rather than a Hierarchical auto-regressive model for the illustrative NO2 concentration levels at any unmonitored location.

• Proceedings of the KIEE Conference
• /
• 1992.07a
• /
• pp.172-175
• /
• 1992

This paper proposes the methods to construct the tree-structured database and analyze the distribution system network. In order to cope with an extensive amount of data and the frequent breaker switching operations in distribution systems, the database for system configuration is constructed using binary trees. Once the tree-structured database has been built, the system tracing of distribution network can be rapidly performed. This remarkably enhances the efficiency of data search and easily adapts to system changes due to switching operations. The computation method of fast power flow using tree search strategies is presented. The methods in the paper may be available in the field of distribution system operation.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.76.2-76
• /
• 2001

In this paper, a new fusion architecture consisting of a host filter and a do-correlated compression filter is proposed based on propagated measurement fusion. In the proposed architecture, the host filter estimates the system states in long-term sense based on the measurements from the beginning to the current time. The de-correlated compression filter assists the host filter by providing fusion results in short-term sense based on the measurements within a block of time. The proposed de-correlated compression filter alleviates computational burden of the host filter by reducing the maximum amount of instantaneous computation, and provides an efficient environment for real-time fault detection and estimation.

• ETRI Journal
• /
• v.28 no.6
• /
• pp.697-708
• /
• 2006

Various adaptive mesh refinement techniques are often employed in numerical simulations for increasing spatial and temporal resolution beyond the limits imposed by available CPU time and memory space. Recently, an octree-based adaptive mesh structure was successfully used in fluid animation to place more grid cells efficiently in visually interesting regions of fluids. In an attempt to optimize the use of computational resources further in fluid animation, this paper extends this adaptive technique by modifying the mesh refinement scheme so that the camera's viewing properties are dynamically exploited during the simulation. Based on a simple adaptive mesh structure, we show that the new meshing strategy can save a substantial amount of computation time and memory space by using a view-dependent adaptive approach. The experimental results reveal that the proposed technique provides a good compromise between the computational effort and the simulation's fidelity, and may be used quite effectively in 3D animation production.

• ETRI Journal
• /
• v.39 no.1
• /
• pp.116-123
• /
• 2017

Message-locked encryption (MLE) is a widespread cryptographic primitive that enables the deduplication of encrypted data stored within the cloud. Practical client-side contributions of MLE, however, are vulnerable to a poison attack, and server-side MLE schemes require large bandwidth consumption. In this paper, we propose a new client-side secure deduplication method that prevents a poison attack, reduces the amount of traffic to be transmitted over a network, and requires fewer cryptographic operations to execute the protocol. The proposed primitive was analyzed in terms of security, communication costs, and computational requirements. We also compared our proposal with existing MLE schemes.

• Transactions of the Korean Society for Noise and Vibration Engineering
• /
• v.25 no.11
• /
• pp.779-786
• /
• 2015

The Kansa method, which is used for various free vibration problems of arbitrarily shaped plates including membranes, discretizes the domain of a plate using only nodes without elements unlike FEM. The method requires a small amount of computation relative to FEM thanks to this discretization scheme but has limit in the accuracy of its solution. This paper reveals the reason of the limit and, to overcome the limit, proposes the practical method of calculating the singularity of a system matrix and extracting accurate natural frequencies. Case studies for a rectangular plate and an arbitrarily shaped plate validate the proposed method.

• Journal of Korea Society of Industrial Information Systems
• /
• v.17 no.2
• /
• pp.29-32
• /
• 2012

Computer generated holography (CGH) is technology for generating holograms of synthetic, three dimensional (3D) objects which may not exist in the physical world. The process, however, requires heavy amount of computation as the resolution of a hologram is significantly higher than that of a typical optical image. This paper reviews four modern techniques for fast generation of digital Fresnel holograms which are important in the development of holographic video systems. The methods that will be described include the virtual window, sub-line, wavefront recording plane (WRP), and the interpolative WRP schemes. These works share the common objective to generate digital Fresnel hologram at a speed that is close to the video frame rate, and with complexity which is realizable with affordable computing and reconfigurable hardware devices. The author will present the principles and realization of these works, as well as some potential area of research in digital holography.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.1131-1134
• /
• 1999

In general CELP type vocoders provide good speech quality around 4.8kbps. Among them, G.723.1 developed for Internet Phone and videoconferencing includes two vocoders, 5.3kbps ACELP and 6.3kbps MO-MLQ. Since 6.3kbps MP-MLQ requires large amount of computation for fixed codebook search, it is difficult to realize real time processing. In order to improve the problem this paper proposes the new method that reduces the processing time up to about 50% of codebook search time. We first decide the grid bit, then search the codebook. Grid bit is selected by comparison between synthetic speech, which is synthesized with only odd or even pulses of target vector. and DC removed original speech. As a result, we reduced the total processing time of G.723.1 MP-MLQ up to about 26.08%. In objective quality test 11.19㏈ of segSNR was obtained, and in subjective quality test there was almost no speech degradation.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.12
• /
• pp.1624-1634
• /
• 1995

Conventional full search block matching algorithm for motion estimation is computationally intensive and the resulting hardware cost is very high. In this paper, we present an efficient block matching algorithm using a 16:1 subsampling technique, and describe its hardware design. The algorithm reduces the number of pixels in calculating the mean absolute difference at each search location, instead of reducing the search locations.The algorithm is an extension of the block mating algorithm with 4:1 subsampling proposed by Liu and Zaccarin such that the amount of computation is reduced by a fact of 4(16 compared to the full search block matching algorithm) while producing similar performance.The algorithm can efficiently be designed into a hardware for real-time applications.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2006.04a
• /
• pp.514-519
• /
• 2006

This paper presents a new nonlinear analysis algorithm which uses the equivalent nodal load for the element stiffness. The equivalent nodal load represents the influence of the stiffness change such as the addition of elements, the deletion of elements, and/or the partial change of element stiffness. The nonlinear analysis of structures using the equivalent load improves the efficiency very much because the inverse of the structural stiffness matrix, which needs a large amount of computation to calculate, is reused in each loading step. In this paper, the concept of nonlinear analysis using the equivalent load for the element stiffness is described and some numerical examples are provided to verify it.