• Journal of Integrative Natural Science
• /
• v.6 no.1
• /
• pp.8-11
• /
• 2013

In this manuscript, we report a protocol to determine most of the lowest energy conformations from the ensemble of conformations. 12-crown-4 was taken as study compound to get the most of energy minima conformations. Molecular dynamic (MD) simulation for 1 nanosecond (ns) was performed at 300, 500, 700, 900 and 1100 K temperature. At particular interval conformations were sampled. Then Gaussian program was used to minimize compounds using PM6 energy levels. Duplicates were removed by checking energy as well as mirror image conformations, and only unique conformations were retained for the next $6-31+G^*$ level minimization. It was observed that upto certain increment in temperature the number of unique conformations were increased, but afterword it decreased.

• Proceedings of the IEEK Conference
• /
• 2000.07b
• /
• pp.807-810
• /
• 2000

In this paper, a new hierarchical motion estimation (ME) scheme using the wavelet transformed multi-resolution image layers is proposed. While the coarse-to-fine (CtF) ME, used in previously proposed coding schemes, can provide a better estimate at the coarsest resolution, it is difficult to accurately track motion at finer resolution. On the other hand, in fine-to-coarse (FtC) ME, it can solves this local minima problem by estimating motion track at the finest subband and propagating the motion vector (MV) to coarser subband. But this method causes to higher computational overhead. This paper proposes a new method for reducing the computational overhead of fine-to-coarse rnulti-resolution motion estimation (MRME) at the finest resolution level by searching for the region to consider motion vectors of the coarsest resolution subband.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.9
• /
• pp.1137-1153
• /
• 1995

It is not yet possible to solve the optimal number of neurons in hidden layer at neural networks. However, it has been proposed and proved by experiments that there is a limit in increasing the number of neuron in hidden layer, because too much incrememt will cause instability,local minima and large error. This paper proposes a module neural controller with pattern recognition ability to solve the above trade-off problems and to obtain fast learning convergence speed. The proposed neural controller is composed of several module having Multi-layer Perrceptron(MLP). Each module have the less neurons in hidden layer, because it learns only input patterns having a similar learning directions. Experiments with six joint robot manipulator have shown the effectiveness and the feasibility of the proposed the parallel module neural controller with pattern recognition perceptron.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.34C no.12
• /
• pp.61-69
• /
• 1997

This paper proposes a new method for improving the performances of the neural network for optimization using a hyubrid of gradient descent method and dynamic tunneling system. The update rule of gradient descent method, which has the fast convergence characteristic, is applied for high-speed optimization. The update rule of dynamic tunneling system, which is the deterministic method with a tunneling phenomenon, is applied for global optimization. Having converged to the for escaping the local minima by applying the dynamic tunneling system. The proposed method has been applied to the travelling salesman problems and the optimal task partition problems to evaluate to that of hopfield model using the update rule of gradient descent method.

• Nuclear Engineering and Technology
• /
• v.45 no.7
• /
• pp.911-920
• /
• 2013

Experimental studies on both subcooled and saturated pool boiling of water were performed to obtain local heat transfer coefficients on a $3^{\circ}$ inclined tube of 50.8 mm diameter at atmospheric pressure. The local values were determined at every $45^{\circ}$ from the very bottom to the uppermost of the tube periphery. The maximum and minimum local coefficients were observed at the azimuthal angles of $0^{\circ}$ and $180^{\circ}$, respectively, in saturated water. The locations of the maxima and the minima were dependent on the inclination angle of the tube as well as the degree of subcooling. The major heat transfer mechanisms were considered to be liquid agitation generated by the sliding bubbles and the creation of big size bubbles through bubble coalescence. As a way of quantifying the heat transfer coefficients, an empirical correlation was suggested.

• Journal of Electrical Engineering and information Science
• /
• v.2 no.5
• /
• pp.79-88
• /
• 1997

This paper introduces a new energy function, as maximum a posteriori(MAP) estimate of binocular disparity, that can deal with both random dot stereo-gram(RDS) and natural scenes. The energy function uses phase-magnitude as features to detect only the shift for a pair of corrupted conjugate images. Also we adopted Fleet singularity that effectively detects unstable areas of image plant and thus eliminates in advance error-prone stereo mathcing. The multi-scale concept is applied to the multi laser architecture that can search the solutions systematically from coarse to fine details and thereby avoids drastically the local minima. Using mean field approximation, we obtained a compact representation that is suitable for fast computation. In this manner, the energy function satisfies major natural constraints and requirements for implementing parallel relaxation. As an experiment, the proposed algorithm is applied to RDS and natural stereo images. As a result we will see that it reveals good performance in terms of recognition errors, parallel implementation, and noise characteristics.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.48 no.4
• /
• pp.371-378
• /
• 1999

This paper presents an efficient algorithm for loss reduction of distribution system by automatic sectionalizing switch operation in large scale distribution systems of radial type. Simulated Annealing algorithm among optimization techniques can avoid escape from local minima by accepting improvements in cost, but the use of this algorithm is also responsible for an excessive computation time requirement. To overcome this major limitation of Simulated Annealing algorithm, we may use advanced Simulated Annealing algorithm. All constaints are divided into two constraint group by using perturbation mechanism and penalty factor, so all trail solutions are feasible. The polynomial-time cooling schedule is used which is based on the statistics calculation during the search. This approaches results in saving CPU time. Numerical examples demonstrate the validity and effectiveness of the proposed methodology.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.48 no.11
• /
• pp.1464-1471
• /
• 1999

This paper introduces complex-valued competitive learning neural network for spatio-temporal pattern recognition. There have been quite a few neural networks for spatio-temporal pattern recognition. Among them, recurrent neural network, TDNN, and avalanche model are acknowledged as standard neural network paradigms for spatio-temporal pattern recognition. Recurrent neural network has complicated learning rules and does not guarantee convergence to global minima. TDNN requires too many neurons, and can not be regarded to deal with spatio-temporal pattern basically. Grossberg's avalanche model is not able to distinguish long patterns, and has to be indicated which layer is to be used in learning. In order to remedy drawbacks of the above networks, unsupervised competitive learning using complex umber is proposed. Suggested neural network also features simultaneous recognition, time-shift invariant recognition, stable categorizing, and learning rate modulation. The network is evaluated by computer simulation with randomly generated patterns.

• Proceedings of the KIEE Conference
• /
• 2001.07d
• /
• pp.2405-2407
• /
• 2001

In this paper, we apply and evolutionary computation(EC), probabilistic optimization algorithm, to active contour. A number of problems exist associated with such as algorithm initialization, existence of local minima, non-convex search space, and the selection of model parameters in conventional models. We propose an adequate fitness function for these problems. The determination of fitness function adequate to active contour using EC is important in search capability. As a result of applying the proposed method to non-convex object shape, we improve the unstability and contraction phenomena, in nature, of snake generated in deformable contour optimization.

• Journal of Information Technology Applications and Management
• /
• v.12 no.3
• /
• pp.41-56
• /
• 2005

Product recommender system is one of the most popular techniques for customer relationship management. In addition, collaborative filtering (CF) has been known to be one of the most successful recommendation techniques in product recommender systems. However, CF has some limitations such as sparsity and scalability problems. This study proposes hybrid cluster analysis and case-based reasoning (CBR) to address these problems. CBR may relieve the sparsity problem because it recommends products using customer profile and transaction data, but it may still give rise to scalability problem. Thus, this study uses cluster analysis to reduce search space prior to CBR for scalability Problem. For cluster analysis, this study employs hybrid genetic and K-Means algorithms to avoid possibility of convergence in local minima of typical cluster analyses. This study also develops a Web-based prototype system to test the superiority of the proposed model.