• Journal of Korean Institute of Industrial Engineers
• /
• v.22 no.4
• /
• pp.567-578
• /
• 1996

In relational databases the number of disk accesses depends on the amount of data transferred from disk to main memory for processing the transactions. N-ary vertical partitioning of the relation can often result in a decrease in the number of disk accesses, since not all attributes in a tuple are required by each transactions. In this paper, a 0-1 integer programming model for solving n-ary vertical partitioning problem minimizing the number of disk accesses is formulated and a branch-and-bound method is used to solve it. A preprocessing procedure reducing the number of variables is presented. The algorithm is illustrated with numerical examples and is shown to be computationally efficient. Numerical experiments reveal that the proposed method is more effective in reducing access costs than the existing algorithms.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.2
• /
• pp.215-224
• /
• 1997

This paper addresses the vertical class fragmentation in distributed object-oriented databases. In the proposed vertical fragmentation, after producing the attribute fragment by partitioning attributes, then the method fragment is produced by gathering methods referring the attribute in each fragment. For partitioning attributes, we define query access matrix(QAM) and method access matrix(MAM) to express attributes that method refers, and extend QAM, MAM and attribute usage matrix(AUM) to universal class environment for representing relationship among other classes through class hierarchy and class composite hierarchy.

• Journal of KIISE:Databases
• /
• v.28 no.3
• /
• pp.315-323
• /
• 2001

The concept of vertical partitioning has been discussed so far in an objective of improving the performance of query execution and system throughput. It can be applied to the areas where the match between data and queries affects performance, which includes partitioning of individual files in centralized environments, data distribution in distributed databases, dividing data among different levels of memory hierarchies, and so on. In general, a vertical partitioning algorithm should support n-ary partitioning as well as a globally optimal solution for the generation of all meaningful fragments. Most previous methods, however, have some limitations to support both of them efficiently. Because the vertical partitioning problem basically includes the fuzziness property, the proper management is required for the fuzziness problem. In this paper we propose an efficient vertical $\alpha$-partitioning algorithm which is based on the fuzzy theory. The method can not only generate all meaningful fragments but also support n-ary partitioning without any complex mathematical computations.

• Journal of Soil and Groundwater Environment
• /
• v.12 no.2
• /
• pp.47-54
• /
• 2007

The partitioning tracer method has been studied as an alternative method for detecting and characterizing the distribution of nonaqueous phase liquids (NAPLs) contaminants in subsurface. The reliability of the partitioning tracer method depends on accurate measurements of partition coefficients of the partitioning tracers between water and NAPLs. In this study, partition coefficients of several alcohol tracers between water and benzene, toluene, ethylbenzene, xylene, and BTEX mixtures are estimated using the modified approach of equivalent alkane carbon number (EACN). Agreements between the measured and estimated partition coefficients were generally observed in experiments. Based on these results, it is confirmed that the partition coefficients of tracers are readily obtained without experiments if the EACN values for the tracers and LNAPLs are known.

• Journal of Korea Spatial Information System Society
• /
• v.12 no.1
• /
• pp.37-48
• /
• 2010

In this paper, we analyze the shortcomings of the previous declustering methods, which are based on grid-like partitioning and a mapping function from a cell to a disk number, for high-dimensional space and propose a solution. The problems arise from the fact that the number of splitting is small(for the most part, binary-partitioning is sufficient), and the side length of a range query whose selectivity is small is quite large. To solve this problem, we propose a mathematical model to estimate the performance of a grid-like partitioning method. With the proposed estimation model, we can choose a good grid-like partitioning method among the possible schemes and this results in overall improvement in declustering performance. Several experimental results show that we can improve the performance of a previous declustering method up to 2.7 times.

• Journal of Korea Multimedia Society
• /
• v.17 no.9
• /
• pp.1064-1069
• /
• 2014

In this paper, we propose a novel approach to improve the performance of a voice activity detection(VAD) which is based on the adaptive band-partitioning with the likelihood ratio(LR). The previous method based on the adaptive band-partitioning use the weights that are derived from the variance of the spectral. In our VAD algorithm, the weights are derived from LR, and then the weights are incorporated with the entropy. The proposed algorithm discriminates the voice activity by comparing the weighted entropy with the adaptive threshold. Experimental results show that the proposed algorithm yields better results compared to the conventional VAD algorithms. Especially, the proposed algorithm shows superior improvement in non-stationary noise environments.

• Journal of the Korean Institute of Navigation
• /
• v.10 no.1
• /
• pp.129-138
• /
• 1986

A matrix partitioning method is proposed for the 2-D motion analysis of floating bodies. For the numerical solution, the boundary of a floating body is approximated with a series of line segments and the governing integral equation is transformed into a system of linear equations. A new solution procedure of resulting linear equation with complex coefficients is formulated and programmed using a matrix partitioning scheme and the Choleski decomposition. From the case study, it is found that the proposed method is efficient in the motion analysis of floating bodies, especially in the calculation of hydrodynamic coefficients. Also, it requires smaller memory size and less computing time compared with conventional methods.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.9 no.4
• /
• pp.11-19
• /
• 2013

In this paper we present a reodered simulated-anealing algorithm which is capable of applying odering based k-way partitioned clusters. This method is used for improvement of the objectives of partitioning which are k-way partitioned by using odering algorithm. It changes the positions of the clusters and the vertices in each clusters. Reodered vertices are splitted by using DP-RP method and this process has an opportunity to improve the objective functions. This algorithm has advantages to improve the quality of the solutions for various purposes. Experimental results on several graphs demonstrate that proposed algorithm provides substantial enhancement.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.31 no.10
• /
• pp.1-9
• /
• 2003

In GRID environments, an efficient load balancing algorithm should be adopted since the system performances of GRID system are not homogeneous. In this work, a new two-step mesh-partitioning scheme based on the graph-partitioning scheme was introduced to consider the difference of system performance. In the two-step mesh-partitioning scheme, the system performance weights were calculated to reflect the effect of heterogeneous system performances and WEVM(Weighted Edge and vertex Method) was adopted to minimize the increase' of communications. Numerical experiments were carried out in multi-cluster environment and WAN (Wide Area Network) environment to investigate the effectiveness of the two-step mesh-partitioning scheme.

• Journal of Microbiology and Biotechnology
• /
• v.2 no.2
• /
• pp.135-140
• /
• 1992

The partitioning of recombinant human interleukin-2(rhII-2) in PEG 8000-dextran 38800 aqueous two-phase system has been investigated using three different sources of rhIL-2. In the case of pure rhIL-2, the solubility in a PEG-dextran two-phase system was low and most of rhIL-2 was partitioned into the bottom phase. For the recovery of rhIL-2 from insoluble protein aggregates, the inclusion bodies of recombinant E. coli were solubilized by the treatment with sodium dodecyl sulfate (SDS). The addition of SDS significantly enhanced not only the solubility of rhIL-2 but also the partitioning of rhIL-2 to the top phase. When the ratio of SDS to rhIL-2 was 2.0, the partition coefficient(K) and the recovery yield(Y) at the top phase were 4.5 and 88%, respectively, at pH 6.8. In order to reduce the recovery steps further, SDS was directly added to the intact recombinant E. coli cells and then partitioned into the PEG/dextran aqueous two-phase system. The observed partition coefficient ($K{\cong{3.0$) and recovery yield ($Y{\geq}80%$ )of this method were comparable to the rhIL-2 recovery from insoluble protein aggregates. The results obtained in this work indicate that PEG-dextran two-phase partitioning might provide a simple way for the recovery and partial purification of recombinant proteins which are produced as inclusion bodies.