• The Journal of Information Technology and Database
• /
• v.6 no.2
• /
• pp.71-86
• /
• 1999

The performance of relational database is measured by the number of disk accesses necessary to transfer data from disk to main memory. The paper proposes to vertically partition relations into fragments and to allow attribute replication to reduce the number of disk accesses. To reduce the computational time, heuristic search method using genetic algorithm is used. Genetic algorithm used employs a rank-based-sharing fitness function and elitism. Desirable parameters of genetic algorithm are obtained through experiments and used to find the solutions. Solutions of attribute replication and attribute non-replication problems are compared. Optimal solutions obtained by branch and bound method and by heuristic solutions(genetic algorithm) are also discussed. The solution method proposed is able to solve large-sized problems within acceptable time limit and shows solutions near the optimal value.

• Journal of environmental and Sanitary engineering
• /
• v.10 no.3
• /
• pp.78-84
• /
• 1995

Cationic surfactants can be used to modify surface of solids to promote adsorption of hydrophobic organic compounds. This behavior is due to the surfactant forming aggregate structure on the solid surface. Partition coefficients are commonly used to quantify the distribution of organic pollutants between the aqueous and particulate phases of aquatic system Partitioning of hydrophobic compounds to cetyltrimethylammonium bromide ( CTAB ) coated silicate has been investigated as a function of surfactant surface coverage at I=0 and 0.1 ionic strength. Toluene, Xylene, TCI sorption experiments demonstrated that the CTAB coated silicate was able to remove these hydrophobic organic compounds from solution The hydrophobic organic compound with the higher Kow had higher removals than lowest Kow hydrophobic organic compound.

• Bulletin of the Korean Mathematical Society
• /
• v.53 no.6
• /
• pp.1857-1868
• /
• 2016

We consider a natural generalization of $h_2(n)$, denoted $h_m(n)$, which is the number of partitions of n into parts which are power of $m{\geq}2$ wherein each power of m is allowed to be used as a part at most m times. In this note, we approach in three different ways using the recurrences, the matrix and the tree to calculate the value of $h_m(n)$.

• Journal of the Korean Society for information Management
• /
• v.16 no.4
• /
• pp.75-94
• /
• 1999

Indexing is a prerequisite function for the information retrieval system in order to retrieve the information of the documents effectively which are saved in database. As a digital data increases in accordance with the development of a computer, the numbers of literatures to be saved in database have also been increased in a large volume. To retrieve such documents of large volume, a lot of system resources and processing time will be required. In this paper, we suggest a advanced indexing method using text partition. This method can retrieve the documents of large volume in short processing time. We applied this suggested indexing method to real information retrieval system, and proved its excellent functions through the demonstration.

• Proceedings of the KIEE Conference
• /
• 2000.07a
• /
• pp.373-375
• /
• 2000

By DC load flow approximation, we analyzed marginal cost that is the important factor of price signal for network congestion management and expressed as a function of load. In network congestion, a large scale electric network is partitioned into subnetwork to provide a effetive price signal through zonal pricing. We propose a new network partition technique using marginal cost sensitivity with a variety of load consumption.

• Proceedings of the KSME Conference
• /
• 2001.11a
• /
• pp.667-672
• /
• 2001

An optimization approach is used to partition the field of view. A cost function is defined to represent the constraints on the solution, which is then mapped onto a two-dimensional Hopfield neural network for minimization. Each neuron in the network represents a possible match between a field of view and one or multiple objects. Partition is achieved by initializing each neuron that represents a possible match and then allowing the network to settle down into a stable state. The network uses the initial inputs and the compatibility measures between a field of view and one or multiple objects to find a stable state.

• Journal of information and communication convergence engineering
• /
• v.7 no.3
• /
• pp.383-391
• /
• 2009

In this paper, blind equalization using a modified Fuzzy C-Means algorithm with Gaussian Weights (MFCM_GW) is attempted to the heavy noise-corrupted channels. The proposed algorithm can deal with both of linear and nonlinear channels, because it searches for the optimal channel output states of a channel instead of estimating the channel parameters in a direct manner. In contrast to the common Euclidean distance in Fuzzy C-Means (FCM), the use of the Bayesian likelihood fitness function and the Gaussian weighted partition matrix is exploited in its search procedure. The selected channel states by MFCM_GW are always close to the optimal set of a channel even the additive white Gaussian noise (AWGN) is heavily corrupted in it. Simulation studies demonstrate that the performance of the proposed method is relatively superior to existing genetic algorithm (GA) and conventional FCM based methods in terms of accuracy and speed.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.17 no.2
• /
• pp.67-85
• /
• 2013

Reproducing Polynomial Particle Method (RPPM) is one of meshless methods that use meshes minimally or do not use meshes at all. In this paper, the RPPM is employed for free vibration analysis of shear-deformable plates of the first order shear deformation model (FSDT), called Reissner-Mindlin plate. For numerical implementation, we use flat-top partition of unity functions, introduced by Oh et al, and patchwise RPPM in which approximation functions have high order polynomial reproducing property and the Kronecker delta property. Also, we demonstrate that our method is highly effective than other existing results for various aspect ratios and boundary conditions.

• Journal of Institute of Control, Robotics and Systems
• /
• v.8 no.2
• /
• pp.120-125
• /
• 2002

An optimization approach is used to partition the field of view. A cost function is defined to represent the constraints on the solution, which is then mapped onto a two-dimensional Hopfield neural network for minimization. Each neuron in the network represents a possible match between a field of view and one or multiple objects. Partition is achieved by initializing each neuron that represents a possible match and then allowing the network to settle down into a stable state. The network uses the initial inputs and the compatibility measures between a field of view and one or multiple objects to find a stable state.

• Bulletin of the Korean Chemical Society
• /
• v.2 no.3
• /
• pp.90-96
• /
• 1981

The significant structure theory of liquids has been successfully applied to the sodium ammonia solution. In applying the theory to sodium ammonia solution, we assumed there were four species in solution, i.e., sodium cation, solvated electron, triple ion, and free electron and equilibria existed between them. Based on these assumptions, we set up the model explaining the anomalous properties of sodium ammonia solution. The partition function for sodium ammonia solution is composed of the partition functions for the above four species and also for the Debye-Huckel excess free energy term. Agreements between calculated and experimental values of the thermodynamic quantities, such as molar volume, vapor pressure, partial molar enthalpy and entropy, and chemical potential as well as viscosity are quite satisfactory.