• Journal of KIISE:Databases
• /
• v.28 no.4
• /
• pp.596-605
• /
• 2001

In this paper we propose a method, called the range-based cube partitioning (RCP)method for reducing I/O cost of cube computation in OLAP The method improves I/O performance of cube partitioning process by overlapping some computation between partitioning stages. For overlapping the computation, the method partitions the cube based on the ranges of attribute values, not the points of attribute value, Through analysis any experiments, we show the performance of the proposed method with comparison of the previous cube partitioning method.

• Journal of Korean Society of Water and Wastewater
• /
• v.28 no.1
• /
• pp.33-45
• /
• 2014

In this study, current sewer infiltration/Inflow(I/I) computation and application method was examined about improvement and adequacy relating to the main issues raised by the field for practitioners. The results of review about infiltration calculation method were considered to be in need of improvement at 'standards of minimum sewage calculation'. Furthermore, the results of review about I/I application method were considered to be in need of improvement at 'standards of seasonal infiltration application' and 'the relative decrease in the Annual evaluation standards'. In addition, annual I/I analysis at JC County for the four years(2009~2012) in respect of operation flow and rainfall data was conducted. The result of annual infiltration analysis, compared average daily sewage generated average infiltration rate was found in 21.95 %, infiltration by unit was found in $0.31m^3/day/cm/km$ and $0.12m^3/day/day$, respectively. The result of annual inflow analysis, average rainfall - Inflow equations was found $y=5.499{\times}$($R^2$ 0.793), and the average Inflow quantity by sewer extension was predicted to $0.66m^3/mm-km$.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.7 no.10
• /
• pp.29-33
• /
• 1984

Many methods have been developed to get a good Computation steps. I think that almost methods of them have been solved by using a theory of [Vj]. But I have thought that it Can be solved by an other method. This method is a way to get a Computations steps by using [Aj] instead of [Vj]. It requires less Computation time than [Vj]. So I think that method is an efficient Algorithm about "the Development of Algorithm method for the 0 - 1 Knapsack problem."

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.4C
• /
• pp.350-357
• /
• 2010

In this paper, we present an auto-range fast bilateral filter (FBF) for high-dynamic-range (HDR) images, which increases computation speed by using adaptive standard deviations for range filter (RF) of FBF in iCAM06. Many images that cover the entire dynamic range of the scene with different exposure times are fused into one High Dynamic Range (HDR) image. The representative algorithm for HDR image rendering is iCAM06, which is based on the iCAM framework, such as the local white point adaptation, chromatic adaptation, and the image processing transform (IPT) uniform color space. FBF in iCAM06 uses constant standard deviation in RF. So, it causes unnecessary FBF computation in high stimulus range with broad and low distribution. To solve this problem, the low stimulus image and high stimulus image of CIE tri-stimulus values (XYZ) divided by the threshold are respectively processed by adaptive standard deviation based on its histogram distribution. Experiment results show that the proposed method reduces computation time than the previous FBF.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.12
• /
• pp.1902-1918
• /
• 1993

Parallel architecture based on the von Neumann computation model has a limitation as a massively parallel architecture due to its inherent drawback of architectural features. The data-flow model of computation has a high programmability in software perspective and high scalability in hardware perspective. However, the practical programming and experimentaion of date-flow architectures are hardly available due to the absence of practical data-flow, we present a programming environment for performing the data-flow computation on conventional parallel machines in general, loosely compled multiprocessor system in particular. We build an emulator for tagged token data-flow architecture on the iPSC/2 hypercube, a loosely coupled multiprocessor system. The emulator is a shallow layer of software executing on an iPSC/2 system, and thus makes the iPSC/2 system work as a data-flow architecture from the programmer`s viewpoint. We implement various numerical and non-numerical algorithm in a data-flow assembler language, and then compare the performance of the program with those of the versions of conventional C language, Consequently, We verify the effectiveness of this programming environment based on the emulator in experimenting the data-flow computation on a conventional parallel machine.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39A no.4
• /
• pp.188-194
• /
• 2014

V2I(Vehicular to Infrastructure) is a one kind of communication systems which is used between the base stations and mobile objects. In V2I communication system, it is difficult to obtain the desired communication performance. Beamforming technology is to find the optimal path. and it can be improved the communication performance. MUSIC algorithm can be estimated the direction of arrival. The directional vector of received signals and the eigenvector has orthogonal property. MUSIC algorithm uses this property. In V2I communication environment, real time optimal path is changed. By the high computational complexity of the MUSIC algorithm, the optimal path estimation error is generated. In this paper, we propose a method of computation reduction algorithm for MUSIC algorithm.

• 한국전산유체공학회:학술대회논문집
• /
• 2008.08a
• /
• pp.78.2-78.2
• /
• 2008

• Bulletin of the Korean Chemical Society
• /
• v.32 no.9
• /
• pp.3425-3428
• /
• 2011

Apolipoprotein A-I (Apo A-I) is a major component for high density lipoproteins (HDL). A number of mimetic peptides of Apo A-I were screened from the phase-displayed random peptide library by utilizing monoclonal antibodies (A12). Mimetic peptide for A12 epitope against Apo A-I was selected as CPFARLPVEHHDVVGL (pA1). From the BLAST search, the mimetic peptide pA1 had 40% homology with Apo A-I. As a result of the structural determination of this mimotope using homo/hetero nuclear 2D-NMR techniques and NMR-based distance geometry (DG)/molecular dynamic (MD) computations, DG structure had low penalty value of 0.3-0.7 ${\AA}^2$ and the total RMSD was 0.6-1.6 ${\AA}$. The mimotope pA1 exhibited characteristic conformation including a ${\beta}$-turn from Pro[7] to His[11].

• Journal of the Korea Computer Graphics Society
• /
• v.23 no.1
• /
• pp.39-48
• /
• 2017

We present penetration depth (PD) computation algorithms using explicit Minkowski sum construction ($PD_e$) and implicit Minkowski sum construction ($PD_i$). Minkowski sum construction is the most time consuming part in fast PD computation. In order to address this issue, we find a candidate solution using a centroid difference and motion coherence. Then, $PD_e$ constructs or updates partial Minkowski sum around the candidate solution. In contrast, $PD_i$ constructs only a tangent plane to the Minkowski sums iteratively. In practice, our algorithms can compute PD for complicated models consisting of thousands of triangles in a few milli-seconds. We also discuss the benefits of using different construction of Minkowski sums in the context of PD.

• Proceedings of the KSME Conference
• /
• 2004.11a
• /
• pp.19-24
• /
• 2004

The mode I stress intensity factor ($K_I$) of a newly proposed slow-crack-growth-test (Notched Ring Test, NRT) specimen was found using finite-element method. The theoretical $K_I$ value of NRT was not available in any references and could not be solved analytically. At first, in order to verify the accuracy of the finite-element approach, published $K_I$ values of several cracks were calculated and compared with finite-element results. The results were in excellent agreement within inherent errors of theoretical $K_I$. Finally the $K_I$ of NRT was found using 2- and 3-dimensional finite-element methods and expressed as a function of the applied load.