• Journal of the Korean Magnetic Resonance Society
• /
• v.14 no.1
• /
• pp.18-27
• /
• 2010

The NMR spectrum and spin-lattice relaxation times, $T_1$, of the $^{1}H$ nuclei in $(NH_{4})_{2}Cd_{2}(SO_{4})_{3}$ single crystals were obtained. The two minima in $T_1$ in the paraelectric phase are attributed to the reorientational motions of the $NH_{4}^{+}$ groups. The $^{1}H\;T_1$ of the $(NH_{4})_{2}Cd_{2}(SO_{4})_{3}$ crystals can be described with Bloembergen- Purcell-Pound (BPP) theory. The experimental value of $T_1$ can be expressed in terms of an isotropic correlation time ${\tau}_H$ for molecular motions by using the BPP theory, and determine the role of protons in these processes.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.23 no.3
• /
• pp.24-29
• /
• 2009

In case of the optimization problems that have many design variables, the conventional genetic algorithms(GA) fall into a trap of local minima with high probability. This problem is called the premature convergence problem. To overcome it, the parallel genetic algorithms which adopt the migration mechanism have been suggested. But it is hard to determine the several parameters such as the migration size and the migration interval for the parallel GAs. Therefore, we propose a new method to determine the migration interval automatically in this paper. To verify its validity, it is applied to some traditional mathematical optimization problems and is compared with the conventional parallel GA. It is also applied to the optimal design of the brushless DC motor for an electric wheel chair which is a real world problem and has five design variables.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.4 no.2
• /
• pp.17-29
• /
• 2001

In this paper, we designed the hybrid path generation method which is named CAPM(Continuous path generation method based on artificial Potential field) that is able to be used in the obstacles environment. This CAPM was designed so that it puts together two obstacle avoidance algorithm-the continuous path generation method(CPGM) and the artificial potential field method(APFM). Here, the CAPM generate the safety path using continuous path curvature. But, this method has demerits when used in obstacles environment in which are closely located. Another method which is named the APFM generates the path with the artificial potential field in the obstacles environment. But, It has local minima in certain places and unnecessarily calculates the path in which obstacles are not located. So, the CAPM was designed for autonomous underwater vehicle(AUV) obstacle avoidance. As the result of simulation, it was confirmed that the CAPM can be applied to a safe path generation for AUV.

• Journal of information and communication convergence engineering
• /
• v.10 no.1
• /
• pp.40-44
• /
• 2012

Data mining, which is attracting public attention, is a process of drawing out knowledge from a large mass of data. The key technique in data mining is the ability to maximize the similarity in a group and minimize the similarity between groups. Since grouping in data mining deals with a large mass of data, it lessens the amount of time spent with the source data, and grouping techniques that shrink the quantity of the data form to which the algorithm is subjected are actively used. The current grouping algorithm is highly sensitive to static and reacts to local minima. The number of groups has to be stated depending on the initialization value. In this paper we propose a gene algorithm that automatically decides on the number of grouping algorithms. We will try to find the optimal group of the fittest function, and finally apply it to a data mining problem that deals with a large mass of data.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2002.05d
• /
• pp.574-578
• /
• 2002

층 단위로 가공하는 RP(Rapid Prototype) 시스템에서 가공되는 물체의 표면에서는 계단형의 윤곽이 나타난다. 이러한 문제점을 보완하기 위해 경사절단 방법으로 3D 모델을 가공하여 기존의 가공방법에 의해 발생하는 계단형 윤곽 모습과 표면 왜곡 둥의 문제를 보완할 수 있다. 최적의 경사선분의 집합을 구하기 위해 경사절단 선분의 길이와 중간층 점의 거리를 정의하여 이를 최소화하는 에너지 함수를 구현한다. 그러나 이 방법은 경사절단 선분이 에너지가 작아지는 방향으로만 움직이기 때문에 레이어의 윤곽이 복잡한 경우 최적의 위치가 아닌 다른 위치에서 더 이상 움직이지 않는 국부적 최적해(Local Minima)가 발생할 수 있다. 본 논문에서는 국부적 최적해를 벗어나기 위해 경사절단 선분 추출 알고리즘에 시뮬레이티드 어니얼링(Simulated Annealing) 방법을 적용하였다. 제안된 방법으로 테스트한 결과 복잡한 레이어 윤곽에서 생길 수 있는 국부적 최적해가 어느 정도 해결되었다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.10B
• /
• pp.1360-1366
• /
• 2001

이 논문에서는, 잡음환경에서의 음성 향상을 위해서 일반적인 주파수 차감법에 기반한 새로운 형태의 방법을 제안한다. 기존의 방법들이 각각의 주파수 성분에 대해 잡음 및 음성스펙트럼을 추정하는데 비해, 본 논문에서는 주파수 대역을 여러 개의 서브밴드로 대역을 나누어 각각의 서브밴드에 대해서 잡음 및 음성의 스펙트럼을 추정한다. 본 논문에서는 잡음 스펙트럼을 추정하기 위하여 최소추적(Minima Tracking) 방법을 선택하였고, 필터링 방법으로는 스펙트럼 차감법에 기반한 Mel-Scaled 필터뱅크를 이용한 새로운 방법을 제안하였다. 모의실험결과, 기존의 방법들에 비해 음성구간에서의 SNR의 향상정도는 입력 SNR이 -10∼4dB의 범위에서 향상된 결과를 얻었다. 또한 전 구간에 대해서도 다른 알고리즘들 보다 향상된 결과를 얻었다.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.53 no.4
• /
• pp.226-234
• /
• 2004

A rapid Prototyping system that laser-cuts and laminates thick layers can fabricate 3D objects promptly with a variety of materials. Building such a system must consider the surface distortions due to both vertical-cut layers and triangular surfaces. We developed a tangential layer-cutting algorithm by rearranging tangential lines such that they reconstruct 3D surfaces more closely and also constitute smoother laser trajectories. An energy function that reflects the surface-closeness with the tangential lines was formulated and then the energy was minimized by a gradient descent method. Since this simple method tends to cause many local minima for complex 3D objects, we tried to solve this problem by adding a simulated annealing process to the proposed method. To view and manipulate 3D objects, we also implemented a 3D visual environment. Under this environment, experiments on various 3D objects showed that our algorithm effectively approximates 3D surfaces and makes laser-trajectory feasibly smooth.

• The Journal of Natural Sciences
• /
• v.18 no.1
• /
• pp.1-8
• /
• 2007

An efficient sampling method of computer simulation is reviewed. Using the method, several thermodynamic states can be investigated at a time in a single simulation. It is due to the ability of the method to explore the relevant parts of configuration space equally for every state being investigated. The method can be used in simulations of complex systems such as biopolymers which are still greatly hampered by the multi-minima problem. In this article I present a brief theoretical review of the method and illustrate how to realize it in the simulations.

• 제어로봇시스템학회:학술대회논문집
• /
• 1994.10a
• /
• pp.434-439
• /
• 1994

Recently neural networks leave been proposed as new computational tools for solving constrained optimization problems because of its computational power. In this paper, the shortest path finding algorithm is proposed by rising a Hopfield type neural network. In order to design a Hopfield type neural network, an energy function must be defined at first. To obtain this energy function, the concept of a vector-represented network is introduced to describe the connected path. Through computer simulations, it will be shown that the proposed algorithm works very well in many cases. The local minima problem of a Hopfield type neural network is discussed.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10b
• /
• pp.466-469
• /
• 1996

In this paper, we present the global minimization condition by an informal analysis of the Langevine competitive learning neural network. From the viewpoint of the stochastic process, it is important that competitive learning guarantees an optimal solution for pattern recognition. By analysis of the Fokker-Plank equation for the proposed neural network, we show that if an energy function has a special pseudo-convexity, Langevine competitive learning can find the global minima. Experimental results for pattern recognition of handwritten numeral data indicate the superiority of the proposed algorithm.