Adaptive optimization of agile organization of command and control resource

Adaptive optimization is one of the means that agile organization of command and control resource （AOC2R） adapts for the dynamic battlefield environment. A math model of the adaptive optimization of AOC2R is put forward by analyzing the interrelating concept and research. The model takes the adaptive process as a multi-stage decision making problem. The 2-phases method is presented to calculate the model, which obtains the related parameters by running the colored Petri net （CPN） model of AOC2R and then searches for the result by ant colony optimization （ACO） algorithm integrated with genetic optimization techniques. The simulation results demonstrate that the proposed algorithm greatly improves the performance of AOC2R.

Stochastic Ranking Improved Teaching-Learning and Adaptive Grasshopper Optimization Algorithm-Based Clustering Scheme for Augmenting Network Lifetime in WSNs

In Wireless Sensor Networks(WSNs),Clustering process is widely utilized for increasing the lifespan with sustained energy stability during data transmission.Several clustering protocols were devised for extending network lifetime,but most of them failed in handling the problem of fixed clustering,static rounds,and inadequate Cluster Head(CH)selection criteria which consumes more energy.In this paper,Stochastic Ranking Improved Teaching-Learning and Adaptive Grasshopper Optimization Algorithm(SRITL-AGOA)-based Clustering Scheme for energy stabilization and extending network lifespan.This SRITL-AGOA selected CH depending on the weightage of factors such as node mobility degree,neighbour's density distance to sink,single-hop or multihop communication and Residual Energy(RE)that directly influences the energy consumption of sensor nodes.In specific,Grasshopper Optimization Algorithm(GOA)is improved through tangent-based nonlinear strategy for enhancing the ability of global optimization.On the other hand,stochastic ranking and violation constraint handling strategies are embedded into Teaching-Learning-based Optimization Algorithm(TLOA)for improving its exploitation tendencies.Then,SR and VCH improved TLOA is embedded into the exploitation phase of AGOA for selecting better CH by maintaining better balance amid exploration and exploitation.Simulation results confirmed that the proposed SRITL-AGOA improved throughput by 21.86%,network stability by 18.94%,load balancing by 16.14%with minimized energy depletion by19.21%,compared to the competitive CH selection approaches.

Identification of time-varying system and energy-based optimization of adaptive control in seismically excited structure

The combination of structural health monitoring and vibration control is of great importance to provide components of smart structures.While synthetic algorithms have been proposed,adaptive control that is compatible with changing conditions still needs to be used,and time-varying systems are required to be simultaneously estimated with the application of adaptive control.In this research,the identification of structural time-varying dynamic characteristics and optimized simple adaptive control are integrated.First,reduced variations of physical parameters are estimated online using the multiple forgetting factor recursive least squares(MFRLS)method.Then,the energy from the structural vibration is simultaneously specified to optimize the control force with the identified parameters to be operational.Optimization is also performed based on the probability density function of the energy under the seismic excitation at any time.Finally,the optimal control force is obtained by the simple adaptive control(SAC)algorithm and energy coefficient.A numerical example and benchmark structure are employed to investigate the efficiency of the proposed approach.The simulation results revealed the effectiveness of the integrated online identification and optimal adaptive control in systems.

Adaptive Butterfly Optimization Algorithm(ABOA)Based Feature Selection and Deep Neural Network(DNN)for Detection of Distributed Denial-of-Service(DDoS)Attacks in Cloud

Cloud computing technology provides flexible,on-demand,and completely controlled computing resources and services are highly desirable.Despite this,with its distributed and dynamic nature and shortcomings in virtualization deployment,the cloud environment is exposed to a wide variety of cyber-attacks and security difficulties.The Intrusion Detection System(IDS)is a specialized security tool that network professionals use for the safety and security of the networks against attacks launched from various sources.DDoS attacks are becoming more frequent and powerful,and their attack pathways are continually changing,which requiring the development of new detection methods.Here the purpose of the study is to improve detection accuracy.Feature Selection(FS)is critical.At the same time,the IDS’s computational problem is limited by focusing on the most relevant elements,and its performance and accuracy increase.In this research work,the suggested Adaptive butterfly optimization algorithm(ABOA)framework is used to assess the effectiveness of a reduced feature subset during the feature selection phase,that was motivated by this motive Candidates.Accurate classification is not compromised by using an ABOA technique.The design of Deep Neural Networks(DNN)has simplified the categorization of network traffic into normal and DDoS threat traffic.DNN’s parameters can be finetuned to detect DDoS attacks better using specially built algorithms.Reduced reconstruction error,no exploding or vanishing gradients,and reduced network are all benefits of the changes outlined in this paper.When it comes to performance criteria like accuracy,precision,recall,and F1-Score are the performance measures that show the suggested architecture outperforms the other existing approaches.Hence the proposed ABOA+DNN is an excellent method for obtaining accurate predictions,with an improved accuracy rate of 99.05%compared to other existing approaches.

Adaptive Optimal Output Regulation of Interconnected Singularly Perturbed Systems With Application to Power Systems

This article studies the adaptive optimal output regulation problem for a class of interconnected singularly perturbed systems(SPSs) with unknown dynamics based on reinforcement learning(RL).Taking into account the slow and fast characteristics among system states,the interconnected SPS is decomposed into the slow time-scale dynamics and the fast timescale dynamics through singular perturbation theory.For the fast time-scale dynamics with interconnections,we devise a decentralized optimal control strategy by selecting appropriate weight matrices in the cost function.For the slow time-scale dynamics with unknown system parameters,an off-policy RL algorithm with convergence guarantee is given to learn the optimal control strategy in terms of measurement data.By combining the slow and fast controllers,we establish the composite decentralized adaptive optimal output regulator,and rigorously analyze the stability and optimality of the closed-loop system.The proposed decomposition design not only bypasses the numerical stiffness but also alleviates the high-dimensionality.The efficacy of the proposed methodology is validated by a load-frequency control application of a two-area power system.

Study on Adaptive Shape Optimization

Aim To introduce a new method of adaptive shape optimization (ASOP) based on three-dimensional structure boundary strength and optimize an engine bearing cap with the method. Methods Using the normal substance's property of thermal expansion and cooling shrinkage,the load which is proportional to the difference between the nodes' stress and their respective objective stress were applied to the corresponding variable nodes on the boundary.The thermal load made the nodes whose stress is greater than their objective stress expand along the boundary's normal direction and the nodes whose stress is less than objec- tive stress shrink in the opposite direction , This process would repeat until the stress on the boundary nodes was converge to the objective stress. Results The satisfied results have been obtained when optimizing an engine bearing cap.The mass of the bearing cap is reduced to 55 percent of the total. Conclusion ASOP is an efficient,practical and reliable method which is suitable for optimizing the shape of the continuous structures.

Adaptive Optimization with Periodic Dither Signals

Optimization methods in cyber-physical systems do not involve parameter uncertainties in most existing literature.This paper considers adaptive optimization problems in which searching for optimal solutions and identifying unknown parameters must be performed simultaneously.Due to the dual roles of the input signals on achieving optimization and providing persistent excitation for identification,a fundamental conflict arises.In this paper,a method of adding a small deterministic periodic dither signal to the input is deployed to resolve this conflict and provide sufficient excitation for estimating the unknown parameters.The designing principle of the dither is discussed.Under dithered inputs,the authors show that simultaneous convergence of parameter estimation and optimization can be achieved.Convergence properties and convergence rates of parameter estimation and optimization variable updates are presented under the scenarios of uncertainty-free observations and systems with noisy observation and unmodeled components.The fundamental relationships and tradeoff among updating step sizes,dither magnitudes,parameter estimation errors,optimization accuracy,and convergence rates are further investigated.

Adaptive Multi-Objective Optimization Based on Feedback Design

The problem of adaptive multi-objective optimization(AMOO) has received extensive attention due to its practical significance.An important issue in optimizing a multi-objective system is adjusting the weighting coefficients of multiple objectives so as to keep track of various conditions.In this paper,a feedback structure for AMOO is designed.Moreover,the reinforcement learning combined with hidden biasing information is applied to online tuning weighting coefficients of objective functions.Finally,the prop...

Method of Multi-Mode Sensor Data Fusion with an Adaptive Deep Coupling Convolutional Auto-Encoder

To address the difficulties in fusing multi-mode sensor data for complex industrial machinery, an adaptive deep coupling convolutional auto-encoder (ADCCAE) fusion method was proposed. First, the multi-mode features extracted synchronously by the CCAE were stacked and fed to the multi-channel convolution layers for fusion. Then, the fused data was passed to all connection layers for compression and fed to the Softmax module for classification. Finally, the coupling loss function coefficients and the network parameters were optimized through an adaptive approach using the gray wolf optimization (GWO) algorithm. Experimental comparisons showed that the proposed ADCCAE fusion model was superior to existing models for multi-mode data fusion.

Solving Job-Shop Scheduling Problem Based on Improved Adaptive Particle Swarm Optimization Algorithm

An improved adaptive particle swarm optimization(IAPSO)algorithm is presented for solving the minimum makespan problem of job shop scheduling problem(JSP).Inspired by hormone modulation mechanism,an adaptive hormonal factor(HF),composed of an adaptive local hormonal factor(H l)and an adaptive global hormonal factor(H g),is devised to strengthen the information connection between particles.Using HF,each particle of the swarm can adjust its position self-adaptively to avoid premature phenomena and reach better solution.The computational results validate the effectiveness and stability of the proposed IAPSO,which can not only find optimal or close-to-optimal solutions but also obtain both better and more stability results than the existing particle swarm optimization(PSO)algorithms.

Adaptive backtracking search optimization algorithm with pattern search for numerical optimization

The backtracking search optimization algorithm（BSA） is one of the most recently proposed population-based evolutionary algorithms for global optimization. Due to its memory ability and simple structure, BSA has powerful capability to find global optimal solutions. However, the algorithm is still insufficient in balancing the exploration and the exploitation. Therefore, an improved adaptive backtracking search optimization algorithm combined with modified Hooke-Jeeves pattern search is proposed for numerical global optimization. It has two main parts： the BSA is used for the exploration phase and the modified pattern search method completes the exploitation phase. In particular, a simple but effective strategy of adapting one of BSA＇s important control parameters is introduced. The proposed algorithm is compared with standard BSA, three state-of-the-art evolutionary algorithms and three superior algorithms in IEEE Congress on Evolutionary Computation 2014（IEEE CEC2014） over six widely-used benchmarks and 22 real-parameter single objective numerical optimization benchmarks in IEEE CEC2014. The results of experiment and statistical analysis demonstrate the effectiveness and efficiency of the proposed algorithm.

A New Clustering Algorithm Using Adaptive Discrete Particle Swarm Optimization in Wireless Sensor Network

Wireless sensor networks (WSNs) are mainly characterized by their limited and non-replenishable energy supply. Hence, the energy efficiency of the infrastructure greatly affects the network lifetime. Clustering is one of the methods that can expand the lifespan of the whole network by grouping the sensor nodes according to some criteria and choosing the appropriate cluster heads(CHs). The balanced load of the CHs has an important effect on the energy consumption balancing and lifespan of the whole network. Therefore, a new CHs election method is proposed using an adaptive discrete particle swarm optimization (ADPSO) algorithm with a fitness value function considering the load balancing and energy consumption. Simulation results not only demonstrate that the proposed algorithm can have better performance in load balancing than low-energy adaptive clustering hierarchy (LEACH), hybrid energy-efficient distributed clustering (HEED), and dynamic clustering algorithm with balanced load (DCBL), but also imply that the proposed algorithm can extend the network lifetime more.

An adaptive reanalysis method for genetic algorithm with application to fast truss optimization

Although the genetic algorithm （GA） for structural optimization is very robust, it is very computationally intensive and hence slower than optimality criteria and mathematical programming methods. To speed up the design process, the authors present an adaptive reanalysis method for GA and its applications in the optimal design of trusses. This reanalysis technique is primarily derived from the Kirsch＇s combined approximations method. An iteration scheme is adopted to adaptively determine the number of basis vectors at every generation. In order to illustrate this method, three classical examples of optimal truss design are used to validate the proposed reanalysis-based design procedure. The presented numerical results demonstrate that the adaptive reanalysis technique affects very slightly the accuracy of the optimal solutions and does accelerate the design process, especially for large-scale structures.

Covid-19 CT Lung Image Segmentation Using Adaptive Donkey and Smuggler Optimization Algorithm

COVID’19 has caused the entire universe to be in existential healthcrisis by spreading globally in the year 2020. The lungs infection is detected inComputed Tomography (CT) images which provide the best way to increasethe existing healthcare schemes in preventing the deadly virus. Nevertheless,separating the infected areas in CT images faces various issues such as lowintensity difference among normal and infectious tissue and high changes inthe characteristics of the infection. To resolve these issues, a new inf-Net (LungInfection Segmentation Deep Network) is designed for detecting the affectedareas from the CT images automatically. For the worst segmentation results,the Edge-Attention Representation (EAR) is optimized using AdaptiveDonkey and Smuggler Optimization (ADSO). The edges which are identifiedby the ADSO approach is utilized for calculating dissimilarities. An IFCM(Intuitionistic Fuzzy C-Means) clustering approach is applied for computingthe similarity of the EA component among the generated edge maps andGround-Truth (GT) edge maps. Also, a Semi-Supervised Segmentation(SSS) structure is designed using the Randomly Selected Propagation (RP)technique and Inf-Net, which needs only less number of images and unlabelleddata. Semi-Supervised Multi-Class Segmentation (SSMCS) is designed usinga Bi-LSTM (Bi-Directional Long-Short-Term-memory), acquires all theadvantages of the disease segmentation done using Semi Inf-Net and enhancesthe execution of multi-class disease labelling. The newly designed SSMCSapproach is compared with existing U-Net++, MCS, and Semi-Inf-Net.factors such as MAE (Mean Absolute Error), Structure measure, Specificity(Spec), Dice Similarity coefficient, Sensitivity (Sen), and Enhance-AlignmentMeasure are considered for evaluation purpose.

Adaptive Maxwell’s Equations Derived Optimization and Its Application in Antenna Array Synthesis

In this paper,a self-adaptive method for the Maxwell’s Equations Derived Optimization(MEDO)is proposed.It is implemented by applying the Sequential Model-Based Optimization(SMBO)algorithm to the iterations of the MEDO,and achieves the automatic adjustment of the parameters.The proposed method is named as adaptive Maxwell’s equations derived optimization(AMEDO).In order to evaluate the performance of AMEDO,eight benchmarks are used and the results are compared with the original MEDO method.The results show that AMEDO can greatly reduce the workload of manual adjustment of parameters,and at the same time can keep the accuracy and stability.Moreover,the convergence of the optimization can be accelerated due to the dynamical adjustment of the parameters.In the end,the proposed AMEDO is applied to the side lobe level suppression and array failure correction of a linear antenna array,and shows great potential in antenna array synthesis.

Adaptive Particle Swarm Optimization Data Hiding for High Security Secret Image Sharing

The main aim of this work is to improve the security of data hiding forsecret image sharing. The privacy and security of digital information have becomea primary concern nowadays due to the enormous usage of digital technology.The security and the privacy of users’ images are ensured through reversible datahiding techniques. The efficiency of the existing data hiding techniques did notprovide optimum performance with multiple end nodes. These issues are solvedby using Separable Data Hiding and Adaptive Particle Swarm Optimization(SDHAPSO) algorithm to attain optimal performance. Image encryption, dataembedding, data extraction/image recovery are the main phases of the proposedapproach. DFT is generally used to extract the transform coefficient matrix fromthe original image. DFT coefficients are in float format, which assists in transforming the image to integral format using the round function. After obtainingthe encrypted image by data-hider, additional data embedding is formulated intohigh-frequency coefficients. The proposed SDHAPSO is mainly utilized for performance improvement through optimal pixel location selection within the imagefor secret bits concealment. In addition, the secret data embedding capacityenhancement is focused on image visual quality maintenance. Hence, it isobserved from the simulation results that the proposed SDHAPSO techniqueoffers high-level security outcomes with respect to higher PSNR, security level,lesser MSE and higher correlation than existing techniques. Hence, enhancedsensitive information protection is attained, which improves the overall systemperformance.

Prediction model for permeability index by integrating case-based reasoning with adaptive particle swarm optimization

To effectively predict the permeability index of smelting process in the imperial smelting furnace, an intelligent prediction model is proposed. It integrates the case-based reasoning （CBR） with adaptive par- ticle swarm optimization （PSO）. The nmnber of nearest neighbors and the weighted features vector are optimized online using the adaptive PSO to improve the prediction accuracy of CBR. The adaptive inertia weight and mutation operation are used to overcome the premature convergence of the PSO. The proposed method is validated a compared with the basic weighted CBR. The results show that the proposed model has higher prediction accuracy and better performance than the basic CBR model.

Hybrid Optimization Algorithm for Resource Allocation in LTE-Based D2D Communication

In a cellular network,direct Device-to-Device(D2D)communication enhances Quality of Service(QoS)in terms of coverage,throughput and amount of power consumed.Since theD2D pairs involve cellular resources for communication,the chances of interference are high.D2D communications demand minimum interference along with maximum throughput and sum rate which can be achieved by employing optimal resources and efficient power allocation procedures.In this research,a hybrid optimization model called Genetic Algorithm-Adaptive Bat Optimization(GA-ABO)algorithm is proposed for efficient resource allocation in a cellular network with D2D communication.Simulation analysis demonstrates that the proposed model involves reduced interference with maximum sum rate and throughput.The performance of the proposed model is compared with the existing Ant Colony Optimization-based resource exchange and GAME(ACO-GAME)theory models,Trader-assistedResource EXchange mechanism-RadioAccess Network(TREX-RAN)and De-centralized Radio Access Network(TREXDRAN),and greedy CYcle-Complete preferences(CYC)models.The proposed model offers a maximum sum rate of 83 kB/s,which is much better than the existing techniques.

Research on Modulation Signal Denoising Method Based on Improved Variational Mode Decomposition

In order to further analyze the micro-motion modulation signals generated by rotating components and extract micro-motion features,a modulation signal denoising algorithm based on improved variational mode decomposition(VMD)is proposed.To improve the time-frequency performance,this method decomposes the data into narrowband signals and analyzes the internal energy and frequency variations within the signal.Genetic algorithms are used to adaptively optimize the mode number and bandwidth control parameters in the process of VMD.This approach aims to obtain the optimal parameter combination and perform mode decomposition on the micro-motion modulation signal.The optimal mode number and quadratic penalty factor for VMD are determined.Based on the optimal values of the mode number and quadratic penalty factor,the original signal is decomposed using VMD,resulting in optimal mode number intrinsic mode function(IMF)components.The effective modes are then reconstructed with the denoised modes,achieving signal denoising.Through experimental data verification,the proposed algorithm demonstrates effective denoising of modulation signals.In simulation data validation,the algorithm achieves the highest signal-to-noise ratio(SNR)and exhibits the best performance.

The optimal fractional Gabor transform based on the adaptive window function and its application

We designed the window function of the optimal Gabor transform based on the time-frequency rotation property of the fractional Fourier transform. Thus, we obtained the adaptive optimal Gabor transform in the fractional domain and improved the time-frequency concentration of the Gabor transform. The algorithm first searches for the optimal rotation factor, then performs the p-th FrFT of the signal and, finally, performs time and frequency analysis of the FrFT result. Finally, the algorithm rotates the plane in the fractional domain back to the normal time-frequency plane. This promotes the application of FrFT in the field of high-resolution reservoir prediction. Additionally, we proposed an adaptive search method for the optimal rotation factor using the Parseval principle in the fractional domain, which simplifies the algorithm. We carried out spectrum decomposition of the seismic signal, which showed that the instantaneous frequency slices obtained by the proposed algorithm are superior to the ones obtained by the traditional Gabor transform. The adaptive time frequency analysis is of great significance to seismic signal processing.