• ETRI Journal
• /
• v.14 no.3
• /
• pp.67-74
• /
• 1992

Discrete variable을 갖는 Mean Field Theory(MFT) neural network은 이미 많은 combinatorial optimization 문제에 적용되어져 왔다. 본 논문에서는 이를 확장하여 continuous variable을 갖는 mean field annealing을 제안하고, 이러한 network에서 integral로 표현되는 spin average를 mean field에 기초하여 어렵지 않게 구할 수 있는 one-variable stochastic simulated annealing을 제안하였다. 이런 방법으로 multi-body problem을 single-body problem으로 바꿀 수 있었다. 또한 이 방법을 이용한 응용으로서 통계학에서 잘 알려진 문제중의 하나인 quantification analysis 문제에 적용하여 타당성을 보였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.6
• /
• pp.2128-2147
• /
• 2021

Cognitive radio systems are being implemented recently to tackle spectrum underutilization problems and aid efficient data traffic. Spectrum sensing is the crucial step in cognitive applications in which cognitive user detects the presence of primary user (PU) in a particular channel thereby switching to another channel for continuous transmission. In cognitive radio systems, the capacity to precisely identify the primary user's signal is essential to secondary user so as to use idle licensed spectrum. Based on the inherent capability, a new spectrum sensing technique is proposed in this paper to identify all types of primary user signals in a cognitive radio condition. Hence, a spectrum sensing algorithm using improved convolutional neural network and long short-term memory (CNN-LSTM) is presented. The principle used in our approach is simulated annealing that discovers reasonable number of neurons for each layer of a completely associated deep neural network to tackle the streamlining issue. The probability of detection is considered as the determining parameter to find the efficiency of the proposed algorithm. Experiments are carried under different signal to noise ratio to indicate better performance of the proposed algorithm. The PU signal will have an associated modulation format and hence identifying the presence of a modulation format itself establishes the presence of PU signal.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.1
• /
• pp.206-211
• /
• 2006

The quantification analysis problem is that how the m entities that have n characteristics can be linked to p-dimension space to reflect the similarity of each entity In this paper, the optimization approach for the quantification analysis problem using neural networks is suggested, and the performance is analyzed The computation of average variation volume by mean field theory that is analytical approximated mobility of a molecule system and the annealed mean field neural network approach are applied in this paper for solving the quantification analysis problem. As a result, the suggested approach by a mean field annealing neural network can obtain more optimal solution than the eigen value analysis approach in processing costs.

• Proceedings of the KIEE Conference
• /
• 1991.07a
• /
• pp.333-336
• /
• 1991

In this paper, Hopfield & Tank model-like artificial neural network structure is proposed, which can be used for the optimal path planning problems such as the unit commitment problems or the maintenance scheduling problems which have been solved by the dynamic programming method or the branch and bound method. To construct the structure of the neural network, an energy function is defined, of which the global minimum means the optimal path of the problem. To avoid falling into one of the local minima during the optimization process, the simulated annealing method is applied via making the slope of the sigmoid transfer functions steeper gradually while the process progresses. As a result, computer(IBM 386-AT 34MHz) simulations can finish the optimal unit commitment problem with 10 power units and 24 hour periods (1 hour factor) in 5 minites. Furthermore, if the full parallel neural network hardware is contructed, the optimization time will be reduced remarkably.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.5 no.1
• /
• pp.33-44
• /
• 2012

A class of recurrent neural networks is proposed and proven to be capable of identifying any discrete-time dynamical system. The applications of the proposed network are addressed in the encoding, identification, and extraction of finite state automata. Simulation results show that the identification of finite state automata using the proposed network, trained by the hybrid greedy simulated annealing with a modified error function in the learning stage, exhibits generally better performance than other conventional identification schemes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.5
• /
• pp.881-888
• /
• 1997

The existing method s for curvature estimation have a common problem in determining a unique smoothong factor. we previously proposed two approaches to overcome that problem: a constrained regularization approach and a mean field annealing approach. We consistently detected corners from the perprocessed smooth boundary obtained by either the constrained eglarization approach or the mean field annealing approach. Moreover, we defined corner sharpness to increase the robustness of both approaches. We evaluate the performance of those methods proposed in this paper. In addition, we show some matching results using a two-dimensional Hopfield neural network in the presence of occlusion as a demonstration of the power of our proposed methods.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.3
• /
• pp.417-424
• /
• 1995

This paper describes MFT(Mean Field Theory) neural network with continuous with continuous variables is applied to quantification analysis problem. A quantification analysis problem, one of the important problems in statistics, is NP complete and arises in the optimal location of objects in the design space according to the given similarities only. This paper presents a MFT neural network with continuous variables for the quantification problem. Starting with reformulation of the quantification problem to the penalty problem, this paper propose a "one-variable stochastic simulated annealing(one-variable SSA)" based on the mean field approximation. This makes it possible to evaluate of the spin average faster than real value calculating in the MFT neural network with continuous variables. Consequently, some experimental results show the feasibility of this approach to overcome the difficulties to evaluate the spin average value expressed by the integral in such models.ch models.

• Journal of Internet of Things and Convergence
• /
• v.9 no.3
• /
• pp.93-98
• /
• 2023

In this paper, an artificial neural network based on simulated annealing was constructed. The mapping relationship between the parameters of micro-scaled flow channels electrochemical machining and the channel shape was established by training the samples. The depth and width of micro-scaled flow channels electrochemical machining on stainless steel surface were predicted, and the flow channels experiment was carried out with pulse power supply in NaNO3 solution to verify the established network model. The results show that the depth and width of the channel predicted by the simulated annealing artificial neural network with "4-7-2" structure are very close to the experimental values, and the error is less than 5.3%. The predicted and experimental data show that the etching degree in the process of channels electrochemical machining is closely related to voltage and current density. When the voltage is less than 5V, a "small island" is formed in the channel; When the voltage is greater than 40V, the lateral etching of the channel is relatively large, and the "dam" between the channels disappears. When the voltage is 25V, the machining morphology of the channel is the best.

• Journal of Information Processing Systems
• /
• v.18 no.4
• /
• pp.562-574
• /
• 2022

As traditional ways of evaluation prove to be ineffective in evaluating the effect of interactive multimedia physical education (PE) teaching, this study develops a new evaluation model based on the simulated annealing algorithm. After the evaluation subjects and the principle of the evaluation system are determined, different subjects are well chosen to constitute the evaluation system and given the weight. The backpropagation neural network has been improved through the simulated annealing algorithm, whose improvement indicates the completion of the evaluation model. Simulation results show that the evaluation model is highly efficient. Compared with traditional evaluation models, the proposed one enhances students' performance in PE classes by 50%.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.6
• /
• pp.149-155
• /
• 1996

In this paper, we designed binary phase grating with SA (simulated annealing) algorithm for image generation, and used LCTV(liquid crystal television) as phase modulator. We generated optical image using LCTV which controlled by personal computer in real time. Many parameters in SA algorithm are determined by average deviation of the cost function, not experimental method. It was confirmed that the LCTV could be used as a phase modulator through mach-zehnder interferometering experiment. The various optical images are generated in real itme by fourier transforming of the phase gratings on LCTV which is controlled by personal computer and they can be used for optical interconnection in a neural network and addressing information in a volume hologram etc.