scholarly journals Deep Loving - The Friend of Deep Learning

Author(s):  
Satish Gajawada ◽  
Hassan M. H. Mustafa

Artificial Intelligence and Deep Learning are good fields of research. Recently, the brother of Artificial Intelligence titled "Artificial Satisfaction" was introduced in literature [10]. In this article, we coin the term “Deep Loving”. After the publication of this article, "Deep Loving" will be considered as the friend of Deep Learning. Proposing a new field is different from proposing a new algorithm. In this paper, we strongly focus on defining and introducing "Deep Loving Field" to Research Scientists across the globe. The future of the "Deep Loving" field is predicted by showing few future opportunities in this new field. The definition of Deep Learning is shown followed by a literature review of the "Deep Loving" field. The World's First Deep Loving Algorithm (WFDLA) is designed and implemented in this work by adding Deep Loving concepts to Particle Swarm Optimization Algorithm. Results obtained by WFDLA are compared with the PSO algorithm.

2012 ◽  
Vol 182-183 ◽  
pp. 1953-1957
Author(s):  
Zhao Xia Wu ◽  
Shu Qiang Chen ◽  
Jun Wei Wang ◽  
Li Fu Wang

When the parameters were measured by using fiber Bragg grating (FBG) in practice, there were some parameters hard to measure, which would influenced the reflective spectral of FBG severely, and make the characteristic information harder to be extracted. Therefore, particle swarm optimization algorithm was proposed in analyzing the uniform force reflective spectral of FBG. Based on the uniform force sense theory of FBG and particle swarm optimization algorithm, the objective function were established, meanwhile the experiment and simulation were constructed. And the characteristic information in reflective spectrum of FBG was extracted. By using particle swarm optimization algorithm, experimental data showed that particle swarm optimization algorithm used in extracting the characteristic information not only was efficaciously and easily, but also had some advantages, such as high accuracy, stability and fast convergence rate. And it was useful in high precision measurement of FBG sensor.


2020 ◽  
Vol 2020 ◽  
pp. 1-8
Author(s):  
Xiaofeng Lv ◽  
Deyun Zhou ◽  
Ling Ma ◽  
Yuyuan Zhang ◽  
Yongchuan Tang

The fault rate in equipment increases significantly along with the service life of the equipment, especially for multiple fault. Typically, the Bayesian theory is used to construct the model of faults, and intelligent algorithm is used to solve the model. Lagrangian relaxation algorithm can be adopted to solve multiple fault diagnosis models. But the mathematical derivation process may be complex, while the updating method for Lagrangian multiplier is limited and it may fall into a local optimal solution. The particle swarm optimization (PSO) algorithm is a global search algorithm. In this paper, an improved Lagrange-particle swarm optimization algorithm is proposed. The updating of the Lagrangian multipliers is with the PSO algorithm for global searching. The difference between the upper and lower bounds is proposed to construct the fitness function of PSO. The multiple fault diagnosis model can be solved by the improved Lagrange-particle swarm optimization algorithm. Experiment on a case study of sensor data-based multiple fault diagnosis verifies the effectiveness and robustness of the proposed method.


2013 ◽  
Vol 427-429 ◽  
pp. 1710-1713
Author(s):  
Xiang Tian ◽  
Yue Lin Gao

This paper introduces the principles and characteristics of Particle Swarm Optimization algorithm, and aims at the shortcoming of PSO algorithm, which is easily plunging into the local minimum, then we proposes a new improved adaptive hybrid particle swarm optimization algorithm. It adopts dynamically changing inertia weight and variable learning factors, which is based on the mechanism of natural selection. The numerical results of classical functions illustrate that this hybrid algorithm improves global searching ability and the success rate.


2012 ◽  
Vol 532-533 ◽  
pp. 1664-1669 ◽  
Author(s):  
Jun Li Zhang ◽  
Da Wei Dai

For the purpose of overcoming the premature property and low execution efficiency of the Particle Swarm Optimization (PSO) algorithm, this paper presents a particle swarm optimization algorithm based on the pattern search. In this algorithm, personal and global optimum particles are chosen in every iteration by a probability. Then, local optimization will be performed by the pattern search and then the original individuals will be replaced. The strong local search function of the pattern search provides an effective mechanism for the PSO algorithm to escape from the local optimum, which avoids prematurity of the algorithm. Simulation shows that this algorithm features a stronger function of global search than conventional PSO, so that the optimization process can be improved remarkably.


2014 ◽  
Vol 2014 ◽  
pp. 1-14 ◽  
Author(s):  
Shouwen Chen ◽  
Zhuoming Xu ◽  
Yan Tang ◽  
Shun Liu

Particle swarm optimization algorithm (PSO) is a global stochastic tool, which has ability to search the global optima. However, PSO algorithm is easily trapped into local optima with low accuracy in convergence. In this paper, in order to overcome the shortcoming of PSO algorithm, an improved particle swarm optimization algorithm (IPSO), based on two forms of exponential inertia weight and two types of centroids, is proposed. By means of comparing the optimization ability of IPSO algorithm with BPSO, EPSO, CPSO, and ACL-PSO algorithms, experimental results show that the proposed IPSO algorithm is more efficient; it also outperforms other four baseline PSO algorithms in accuracy.


2012 ◽  
Vol 468-471 ◽  
pp. 2745-2748
Author(s):  
Sheng Long Yu ◽  
Yu Ming Bo ◽  
Zhi Min Chen ◽  
Kai Zhu

A particle swarm optimization algorithm (PSO) is presented for vehicle path planning in the paper. Particle swarm optimization proposed by Kennedy and Eberhart is derived from the social behavior of the birds foraging. Particle swarm optimization algorithm a kind of swarm-based optimization method.The simulation experiments performed in this study show the better vehicle path planning ability of PSO than that of adaptive genetic algorithm and genetic algorithm. The experimental results show that the vehicle path planning by using PSO algorithm has the least cost and it is indicated that PSO algorithm has more excellent vehicle path planning ability than adaptive genetic algorithm,genetic algorithm.


2013 ◽  
Vol 446-447 ◽  
pp. 1541-1545
Author(s):  
Hong Quan Feng ◽  
Bing Heng Wu ◽  
Yuan Yun Liu ◽  
Yi Liao ◽  
Hao Gu ◽  
...  

The thickness of multi-layer absorbing material is optimized to obtain lower electromagnetic reflection coefficient by using particle swarm optimization (PSO) algorithm in this paper. Two examples are employed to validate the excellent performance of PSO. The results show that the reflection coefficient of absorbing material is less than-20 dB over the bandwidth of 2GHz ~ 18GHz, less than-25 dB over the narrowband of 9 GHz ~ 11GHz, less than-30 dB during the bandwidth of 9.5 GHz~10.5 GHz. It also shows that the minimum value approaches to-48 dB in a certain range.


2021 ◽  
Vol 16 (59) ◽  
pp. 141-152
Author(s):  
Cuong Le Thanh ◽  
Thanh Sang-To ◽  
Hoang-Le Hoang-Le ◽  
Tran-Thanh Danh ◽  
Samir Khatir ◽  
...  

Modality and intermittent search strategy in combination with an Improve Particle Swarm Optimization algorithm (IPSO) to detect damage structure via using vibration analysis basic principle of a decline stiffness matrix a structure is presented in the study as a new technique. Unlike an optimization problem using a simplistic algorithm application, the combination leads to promising results. Interestingly, the PSO algorithm solves the optimal problem around the location determined previously. In contrast, Eagle Strategy (ES) is the charging of locating the position in intermittent space for the PSO algorithm to search locally. ES is easy to deal with its problem via drastic support of Levy flight. As known, the PSO algorithm has a fast search speed, yet the accuracy of the PSO algorithm is not as good as expected in many problems. Meanwhile, the combination is powerful to solve two problems: 1) avoiding local optimization, and 2) obtaining more accurate results. The paper compares the results obtained from the PSO algorithm with the combination of IPSO and ES for some problems and between experiment and FEM to demonstrate its effectiveness. Natural frequencies are used in the objective function to solve this optimization problem. The results show that the combination of IPSO and ES is quite effective.


2020 ◽  
pp. 1-12
Author(s):  
Lihua Peng

With the development of artificial intelligence in education, online education has been recognized by the society as a new teaching method. It can make full use of the advantages of the network across regions, and make full use of the advantages of network technology to share the resources of colleges and universities, which is a promising educational method. In response to the demand of online education for learner information, this paper proposes the learner model Neighbor Mean Variation Multi-Objective Particle Swarm Optimization-Genetic Algorithm (NMVMOPSO-GA). This model includes the learner’s learning interest sub-model, the learner’s cognitive ability sub-model and the learner’s knowledge sub-model. The modelling techniques of the three sub-models are discussed separately, and their status and role in the online education system are analyzed. At the same time, for the knowledge model that reflects the learner’s learning progress and knowledge mastery, a learner knowledge sub-model constructed with Bayesian networks is proposed. The neighbor mean mutation operator is introduced to optimize the multi-objective particle swarm optimization algorithm and improve the convergence performance and stability of the multi-objective particle swarm optimization algorithm. We study the application of multi-objective particle swarm optimization algorithm in online course resource generation service. Through simulation experiments, it is verified that the multi-objective particle swarm optimization algorithm can improve the performance and stability of online course resource generation.


Entropy ◽  
2021 ◽  
Vol 24 (1) ◽  
pp. 58
Author(s):  
Jerzy Balicki

Particle swarm optimization algorithm (PSO) is an effective metaheuristic that can determine Pareto-optimal solutions. We propose an extended PSO by introducing quantum gates in order to ensure the diversity of particle populations that are looking for efficient alternatives. The quality of solutions was verified in the issue of assignment of resources in the computing cloud to improve the live migration of virtual machines. We consider the multi-criteria optimization problem of deep learning-based models embedded into virtual machines. Computing clouds with deep learning agents can support several areas of education, smart city or economy. Because deep learning agents require lots of computer resources, seven criteria are studied such as electric power of hosts, reliability of cloud, CPU workload of the bottleneck host, communication capacity of the critical node, a free RAM capacity of the most loaded memory, a free disc memory capacity of the most busy storage, and overall computer costs. Quantum gates modify an accepted position for the current location of a particle. To verify the above concept, various simulations have been carried out on the laboratory cloud based on the OpenStack platform. Numerical experiments have confirmed that multi-objective quantum-inspired particle swarm optimization algorithm provides better solutions than the other metaheuristics.


Sign in / Sign up

Export Citation Format

Share Document