scholarly journals ON THE PROBLEM OF TRAINING THE COULOMB ENERGY NETWORK

2002 ◽  
Vol 11 (04) ◽  
pp. 475-497
Author(s):  
JOHN F. VASSILOPOULOS ◽  
CRIS KOUTSOUGERAS ◽  
ARTURO HERNÁNDEZ-AGUIRRE

The Coulomb Energy network offers a unique perspective towards nonlinear transformations. However, its training as it was originally proposed by C. Scofield [1] presented difficulties that prevented its general use. We have investigated this model and we present here the reasons for its shortcomings. Further we propose refinements to the model and its training algorithm, and we present the study and results of various other modifications. We address these problems by constraining its architecture (topology) and present a derivation of the associated training algorithm. We also discuss further refinements of this algorithm. Existing genetic algorithms and simulated annealing are also evaluated as training techniques. Simulation results are also presented.

Author(s):  
Holman Ospina-Mateus ◽  
Leonardo Augusto Quintana Jiménez ◽  
Francisco J. Lopez-Valdes ◽  
Shyrle Berrio Garcia ◽  
Lope H. Barrero ◽  
...  

2014 ◽  
Vol 643 ◽  
pp. 237-242 ◽  
Author(s):  
Tahari Abdou El Karim ◽  
Bendakmousse Abdeslam ◽  
Ait Aoudia Samy

The image registration is a very important task in image processing. In the field of medical imaging, it is used to compare the anatomical structures of two or more images taken at different time to track for example the evolution of a disease. Intensity-based techniques are widely used in the multi-modal registration. To have the best registration, a cost function expressing the similarity between these images is maximized. The registration problem is reduced to the optimization of a cost function. We propose to use neighborhood meta-heuristics (tabu search, simulated annealing) and a meta-heuristic population (genetic algorithms). An evaluation step is necessary to estimate the quality of registration obtained. In this paper we present some results of medical image registration


2013 ◽  
Vol 756-759 ◽  
pp. 3466-3470
Author(s):  
Xu Min Song ◽  
Qi Lin

The trajcetory plan problem of spece reandezvous mission was studied in this paper using nolinear optimization method. The optimization model was built based on the Hills equations. And by analysis property of the design variables, a transform was put forward , which eliminated the equation and nonlinear constraints as well as decreaseing the problem dimensions. The optimization problem was solved using Adaptive Simulated Annealing (ASA) method, and the rendezvous trajectory was designed.The method was validated by simulation results.


2015 ◽  
Vol 785 ◽  
pp. 14-18 ◽  
Author(s):  
Badar ul Islam ◽  
Zuhairi Baharudin ◽  
Perumal Nallagownden

Although, Back Propagation Neural Network are frequently implemented to forecast short-term electricity load, however, this training algorithm is criticized for its slow and improper convergence and poor generalization. There is a great need to explore the techniques that can overcome the above mentioned limitations to improve the forecast accuracy. In this paper, an improved BP neural network training algorithm is proposed that hybridizes simulated annealing and genetic algorithm (SA-GA). This hybrid approach leads to the integration of powerful local search capability of simulated annealing and near accurate global search performance of genetic algorithm. The proposed technique has shown better results in terms of load forecast accuracy and faster convergence. ISO New England data for the period of five years is employed to develop a case study that validates the efficacy of the proposed technique.


Sign in / Sign up

Export Citation Format

Share Document