scholarly journals Particle Swarm Optimization-Based Noise Filtering Algorithm for Photon Cloud Data in Forest Area

2019 ◽  
Vol 11 (8) ◽  
pp. 980 ◽  
Author(s):  
Jiapeng Huang ◽  
Yanqiu Xing ◽  
Haotian You ◽  
Lei Qin ◽  
Jing Tian ◽  
...  
Keyword(s):  
Particle Swarm Optimization ◽  
Background Noise ◽  
Spatial Clustering ◽  
Particle Swarm ◽  
Noise Filtering ◽  
Swarm Optimization ◽  
Cloud Data ◽  
Filtering Algorithm ◽  
Statistical Algorithm ◽  
The Mean

The Ice, Cloud, and land Elevation Satellite-2 (ICESat-2), which is equipped with the Advanced Topographic Laser Altimeter System (ATLAS), was launched successfully in 15 September 2018. The ATLAS represents a micro-pulse photon-counting laser system, which is expected to provide more comprehensive and scientific data for carbon storage. However, the ATLAS system is sensitive to the background noise, which poses a tremendous challenge to the photon cloud noise filtering. Moreover, the Density Based Spatial Clustering of Applications with Noise (DBSCAN) is a commonly used algorithm for noise removal from the photon cloud but there has not been an in-depth study on its parameter selection yet. This paper presents an automatic photon cloud filtering algorithm based on the Particle Swarm Optimization (PSO) algorithm, which can be used to optimize the two key parameters of the DBSCAN algorithm instead of using the manual parameter adjustment. The Particle Swarm Optimization Density Based Spatial Clustering of Applications with Noise (PSODBSCAN) algorithm was tested at different laser intensities and laser pointing types using the MATLAS dataset of the forests located in Virginia, East Coast, and the West Coast, USA. The results showed that the PSODBSCAN algorithm and the localized statistical algorithm were effective in identifying the background noise and preserving the signal photons in the raw MATLAS data. Namely, the PSODBSCAN achieved the mean F value of 0.9759, and the localized statistical algorithm achieved the mean F value of 0.6978. For both laser pointing types and laser intensities, the proposed algorithm achieved better results than the localized statistical algorithm. Therefore, the PSODBSCAN algorithm could support the MATLAS photon cloud data noise filtering applicably without manually selecting parameters.

scholarly journals Virtual Machine Placement via Bin Packing in Cloud Data Centers

Electronics ◽  
2018 ◽  
Vol 7 (12) ◽  
pp. 389 ◽  
Author(s):  
Aisha Fatima ◽  
Nadeem Javaid ◽  
Tanzeela Sultana ◽  
Waqar Hussain ◽  
Muhammad Bilal ◽  
...  
Keyword(s):  
Particle Swarm Optimization ◽  
Data Centers ◽  
Bin Packing ◽  
Virtual Machines ◽  
Particle Swarm ◽  
Vm Placement ◽  
Swarm Optimization ◽  
Cloud Data ◽  
Cloud Data Centers ◽  
Vm Consolidation

With the increasing size of cloud data centers, the number of users and virtual machines (VMs) increases rapidly. The requests of users are entertained by VMs residing on physical servers. The dramatic growth of internet services results in unbalanced network resources. Resource management is an important factor for the performance of a cloud. Various techniques are used to manage the resources of a cloud efficiently. VM-consolidation is an intelligent and efficient strategy to balance the load of cloud data centers. VM-placement is an important subproblem of the VM-consolidation problem that needs to be resolved. The basic objective of VM-placement is to minimize the utilization rate of physical machines (PMs). VM-placement is used to save energy and cost. An enhanced levy-based particle swarm optimization algorithm with variable sized bin packing (PSOLBP) is proposed for solving the VM-placement problem. Moreover, the best-fit strategy is also used with the variable sized bin packing problem (VSBPP). Simulations are done to authenticate the adaptivity of the proposed algorithm. Three algorithms are implemented in Matlab. The given algorithm is compared with simple particle swarm optimization (PSO) and a hybrid of levy flight and particle swarm optimization (LFPSO). The proposed algorithm efficiently minimized the number of running PMs. VM-consolidation is an NP-hard problem, however, the proposed algorithm outperformed the other two algorithms.

scholarly journals Eagle Strategy with Cauchy Mutation Particle Swarm Optimization for Energy Management in Cloud Computing

2020 ◽  
Vol 13 (6) ◽  
pp. 42-51
Author(s):  
Archana Kollu ◽  
◽  
Sucharita Vadlamudi ◽  
Keyword(s):  
Particle Swarm Optimization ◽  
Energy Consumption ◽  
Energy Management ◽  
Optimization Technique ◽  
Service Level Agreement ◽  
Particle Swarm ◽  
Swarm Optimization ◽  
Cloud Data ◽  
Cauchy Mutation ◽  
Eagle Strategy

Energy management of the cloud datacentre is a challenging task, especially when the cloud server receives a number of the user’s request simultaneously. This requires an efficient method to optimally allocate the resources to the users. Resource allocation in cloud data centers need to be done in optimized manner for conserving energy keeping in view of Service Level Agreement (SLA). We propose, Eagle Strategy (ES) based Modified Particle Swarm Optimization (ES-MPSO) to minimize the energy consumption and SLA violation. The Eagle Strategy method is applied due to its efficient local optimization technique. The Cauchy Mutation method which schedules the task effectively and minimize energy consumption, is applied to the proposed ES-MPSO method for improving the convergence performance. The simulation result shows that the energy consumption of ES-MPSO is 42J and Particle Swarm Optimization (PSO) is 51J. The proposed method ES-MPSO achieves higher efficiency compared to the PSO method in terms of energy management and SLA.

Magnetic Remanence Prediction of NdFeB Magnets Based on a Novel Machine Learning Intelligence Approach Using a Particle Swarm Optimization Support Vector Regression

2014 ◽  
Vol 6 (4) ◽  
pp. 72-81 ◽  
Author(s):  
WenDe Cheng
Keyword(s):  
Magnetic Properties ◽  
Particle Swarm Optimization ◽  
Support Vector Regression ◽  
Particle Swarm ◽  
Support Vector ◽  
Chemical Compositions ◽  
Swarm Optimization ◽  
Ndfeb Magnets ◽  
Magnetic Remanence ◽  
The Mean

Studies have shown that the chemical compositions affecting the magnetic properties of NdFeB magnets. In order to get the right NdFeB magnets, it is advantageous to have an accurate model with which one can predict the magnetic properties with different components. In this paper, according to an experimental dataset on the magnetic remanence of NdFeB, a predicting and optimizing model using support vector regression (SVR) combined with particle swarm optimization (PSO) was developed. The estimated result of SVR agreed with the experimental data well. Test results of leave-one-out cross validation show that the mean absolute error does not exceed 0.0036, the mean absolute percentage error is solely 0.53%, and the correlation coefficient () is as high as 0.839. This implies that one can estimate an available combination of different proportion components by using support vector regression model to get suitable magnetic remanence of NdFeB.

scholarly journals Multiobjective Robust Design of the Double Wishbone Suspension System Based on Particle Swarm Optimization

2014 ◽  
Vol 2014 ◽  
pp. 1-7 ◽  
Author(s):  
Xianfu Cheng ◽  
Yuqun Lin
Keyword(s):  
Sensitivity Analysis ◽  
Particle Swarm Optimization ◽  
Robust Optimization ◽  
Optimization Design ◽  
Particle Swarm ◽  
Design Sensitivity ◽  
Suspension System ◽  
Design Parameters ◽  
Swarm Optimization ◽  
The Mean

The performance of the suspension system is one of the most important factors in the vehicle design. For the double wishbone suspension system, the conventional deterministic optimization does not consider any deviations of design parameters, so design sensitivity analysis and robust optimization design are proposed. In this study, the design parameters of the robust optimization are the positions of the key points, and the random factors are the uncertainties in manufacturing. A simplified model of the double wishbone suspension is established by software ADAMS. The sensitivity analysis is utilized to determine main design variables. Then, the simulation experiment is arranged and the Latin hypercube design is adopted to find the initial points. The Kriging model is employed for fitting the mean and variance of the quality characteristics according to the simulation results. Further, a particle swarm optimization method based on simple PSO is applied and the tradeoff between the mean and deviation of performance is made to solve the robust optimization problem of the double wishbone suspension system.

scholarly journals A New Ground-Based Pseudolite System Deployment Algorithm Based on MOPSO

Sensors ◽  
2021 ◽  
Vol 21 (16) ◽  
pp. 5364
Author(s):  
Wenjie Tang ◽  
Junping Chen ◽  
Chao Yu ◽  
Junsheng Ding ◽  
Ruyuan Wang
Keyword(s):  
Particle Swarm Optimization ◽  
Convex Polyhedron ◽  
Particle Swarm ◽  
Coverage Area ◽  
Swarm Optimization ◽  
Digital Elevation ◽  
Signal Coverage ◽  
Optimal Deployment ◽  
The Mean ◽  
Elevation Model

Pseudolite deployment is the premise of ground-based pseudolite system networking, which affects the coverage and positioning accuracy of ground-based pseudolite systems. Optimal deployment algorithms can help to achieve a higher signal coverage and lower mean horizontal precision factor (HDOP) with a limited number of pseudolites. In this paper, we proposed a multi-objective particle swarm optimization (MOPSO) algorithm for the deployment of a ground-based pseudolite system. The new algorithm combines Digital Elevation Model (DEM) data and uses the mean HDOP of the DEM grid to measure the geometry of the pseudolite system. The signal coverage of the pseudolite system was calculated based on the visual area analysis with respect to reference planes, which effectively avoids the repeated calculation of the intersection and improves the calculation efficiency. A selected area covering 10 km×10 km in the Jiuzhaigou area of China was used to verify the new algorithm. The results showed that both the coverage and HDOP achieved were optimal using the new algorithm, where the coverage area can be up to approximately 50% and 30% more than using the existing particle swarm optimization (PSO) and convex polyhedron volume optimization (CPVO) algorithms, respectively.

Sign in / Sign up

Export Citation Format

Share Document