Self-Adaptive Algorithms for the Split Common Fixed Point Problem of the Demimetric Mappings

The split common fixed point problem is an inverse problem that consists in finding an element in a fixed point set such that its image under a bounded linear operator belongs to another fixed-point set. In this paper, we present new iterative algorithms for solving the split common fixed point problem of demimetric mappings in Hilbert spaces. Moreover, our algorithm does not need any prior information of the operator norm. Weak and strong convergence theorems are given under some mild assumptions. The results in this paper are the extension and improvement of the recent results in the literature.

A Self-Adaptive Algorithm of the Clean Numerical Simulation(CNS)for Chaos

The background numerical noise#0 is determined by the maximum of truncation error and round-off error.For a chaotic system,the numerical error#(t)grows exponentially,say,#(t)=#0exp(kt),where k>0 is the so-called noise-growing exponent.This is the reason why one can not gain a convergent simulation of chaotic systems in a long enough interval of time by means of traditional algorithms in double precision,since the background numerical noise#0 might stop decreasing because of the use of double precision.This restriction can be overcome by means of the clean numerical simulation(CNS),which can decrease the background numerical noise#0 to any required tiny level.A lot of successful applications show the novelty and validity of the CNS.In this paper,we further propose some strategies to greatly increase the computational efficiency of the CNS algorithms for chaotic dynamical systems.It is highly suggested to keep a balance between truncation error and round-off error and besides to progressively enlarge the background numerical noise#0,since the exponentially increasing numerical noise#(t)is much larger than it.Some examples are given to illustrate the validity of our strategies for the CNS.

Dynamic Economic Scheduling with Self-Adaptive Uncertainty in Distribution Network Based on Deep Reinforcement Learning

Traditional optimal scheduling methods are limited to accurate physical models and parameter settings, which aredifficult to adapt to the uncertainty of source and load, and there are problems such as the inability to make dynamicdecisions continuously. This paper proposed a dynamic economic scheduling method for distribution networksbased on deep reinforcement learning. Firstly, the economic scheduling model of the new energy distributionnetwork is established considering the action characteristics of micro-gas turbines, and the dynamic schedulingmodel based on deep reinforcement learning is constructed for the new energy distribution network system with ahigh proportion of new energy, and the Markov decision process of the model is defined. Secondly, Second, for thechanging characteristics of source-load uncertainty, agents are trained interactively with the distributed networkin a data-driven manner. Then, through the proximal policy optimization algorithm, agents adaptively learn thescheduling strategy and realize the dynamic scheduling decision of the new energy distribution network system.Finally, the feasibility and superiority of the proposed method are verified by an improved IEEE 33-node simulationsystem.

A Self-Adapting and Efficient Dandelion Algorithm and Its Application to Feature Selection for Credit Card Fraud Detection

A dandelion algorithm(DA) is a recently developed intelligent optimization algorithm for function optimization problems. Many of its parameters need to be set by experience in DA,which might not be appropriate for all optimization problems. A self-adapting and efficient dandelion algorithm is proposed in this work to lower the number of DA's parameters and simplify DA's structure. Only the normal sowing operator is retained;while the other operators are discarded. An adaptive seeding radius strategy is designed for the core dandelion. The results show that the proposed algorithm achieves better performance on the standard test functions with less time consumption than its competitive peers. In addition, the proposed algorithm is applied to feature selection for credit card fraud detection(CCFD), and the results indicate that it can obtain higher classification and detection performance than the-state-of-the-art methods.

Self-adaptive PID controller of microwave drying rotary device tuning on-line by genetic algorithms

The control design, based on self-adaptive PID with genetic algorithms(GA) tuning on-line was investigated, for the temperature control of industrial microwave drying rotary device with the multi-layer(IMDRDWM) and with multivariable nonlinear interaction of microwave and materials. The conventional PID control strategy incorporated with optimization GA was put forward to maintain the optimum drying temperature in order to keep the moisture content below 1%, whose adaptation ability included the cost function of optimization GA according to the output change. Simulations on five different industrial process models and practical temperature process control system for selenium-enriched slag drying intensively by using IMDRDWM were carried out systematically, indicating the reliability and effectiveness of control design. The parameters of proposed control design are all on-line implemented without iterative predictive calculations, and the closed-loop system stability is guaranteed, which makes the developed scheme simpler in its synthesis and application, providing the practical guidelines for the control implementation and the parameter design.

Unfolding neutron spectra from water-pumping-injection multilayered concentric sphere neutron spectrometer using self-adaptive differential evolution algorithm

A self-adaptive differential evolution neutron spectrum unfolding algorithm(SDENUA)is established in this study to unfold the neutron spectra obtained from a water-pumping-injection multilayered concentric sphere neutron spectrometer(WMNS).Specifically,the neutron fluence bounds are estimated to accelerate the algorithm convergence,and the minimum error between the optimal solution and input neutron counts with relative uncertainties is limited to 10^(-6)to avoid unnecessary calculations.Furthermore,the crossover probability and scaling factor are self-adaptively controlled.FLUKA Monte Carlo is used to simulate the readings of the WMNS under(1)a spectrum of Cf-252 and(2)its spectrum after being moderated,(3)a spectrum used for boron neutron capture therapy,and(4)a reactor spectrum.Subsequently,the measured neutron counts are unfolded using the SDENUA.The uncertainties of the measured neutron count and the response matrix are considered in the SDENUA,which does not require complex parameter tuning or an a priori default spectrum.The results indicate that the solutions of the SDENUA agree better with the IAEA spectra than those of MAXED and GRAVEL in UMG 3.1,and the errors of the final results calculated using the SDENUA are less than 12%.The established SDENUA can be used to unfold spectra from the WMNS.

Dynamic self-adaptive ANP algorithm and its application to electric field simulation of aluminum reduction cell

Region partition(RP) is the key technique to the finite element parallel computing(FEPC),and its performance has a decisive influence on the entire process of analysis and computation.The performance evaluation index of RP method for the three-dimensional finite element model(FEM) has been given.By taking the electric field of aluminum reduction cell(ARC) as the research object,the performance of two classical RP methods,which are Al-NASRA and NGUYEN partition(ANP) algorithm and the multi-level partition(MLP) method,has been analyzed and compared.The comparison results indicate a sound performance of ANP algorithm,but to large-scale models,the computing time of ANP algorithm increases notably.This is because the ANP algorithm determines only one node based on the minimum weight and just adds the elements connected to the node into the sub-region during each iteration.To obtain the satisfied speed and the precision,an improved dynamic self-adaptive ANP(DSA-ANP) algorithm has been proposed.With consideration of model scale,complexity and sub-RP stage,the improved algorithm adaptively determines the number of nodes and selects those nodes with small enough weight,and then dynamically adds these connected elements.The proposed algorithm has been applied to the finite element analysis(FEA) of the electric field simulation of ARC.Compared with the traditional ANP algorithm,the computational efficiency of the proposed algorithm has been shortened approximately from 260 s to 13 s.This proves the superiority of the improved algorithm on computing time performance.

Enhanced self-adaptive evolutionary algorithm for numerical optimization

There are many population-based stochastic search algorithms for solving optimization problems. However, the universality and robustness of these algorithms are still unsatisfactory. This paper proposes an enhanced self-adaptiveevolutionary algorithm （ESEA） to overcome the demerits above. In the ESEA, four evolutionary operators are designed to enhance the evolutionary structure. Besides, the ESEA employs four effective search strategies under the framework of the self-adaptive learning. Four groups of the experiments are done to find out the most suitable parameter values for the ESEA. In order to verify the performance of the proposed algorithm, 26 state-of-the-art test functions are solved by the ESEA and its competitors. The experimental results demonstrate that the universality and robustness of the ESEA out-perform its competitors.

Self-adaptive learning based discrete differential evolution algorithm for solving CJWTA problem

Cooperative jamming weapon-target assignment （CJWTA） problem is a key issue in electronic countermeasures （ECM）. Some symbols which relevant to the CJWTA are defined firstly. Then, a formulation of jamming fitness is presented. Final y, a model of the CJWTA problem is constructed. In order to solve the CJWTA problem efficiently, a self-adaptive learning based discrete differential evolution （SLDDE） algorithm is proposed by introduc-ing a self-adaptive learning mechanism into the traditional discrete differential evolution algorithm. The SLDDE algorithm steers four candidate solution generation strategies simultaneously in the framework of the self-adaptive learning mechanism. Computa-tional simulations are conducted on ten test instances of CJWTA problem. The experimental results demonstrate that the proposed SLDDE algorithm not only can generate better results than only one strategy based discrete differential algorithms, but also outper-forms two algorithms which are proposed recently for the weapon-target assignment problems.

Self-adaptive Bat Algorithm With Genetic Operations

Swarm intelligence in a bat algorithm(BA)provides social learning.Genetic operations for reproducing individuals in a genetic algorithm(GA)offer global search ability in solving complex optimization problems.Their integration provides an opportunity for improved search performance.However,existing studies adopt only one genetic operation of GA,or design hybrid algorithms that divide the overall population into multiple subpopulations that evolve in parallel with limited interactions only.Differing from them,this work proposes an improved self-adaptive bat algorithm with genetic operations(SBAGO)where GA and BA are combined in a highly integrated way.Specifically,SBAGO performs their genetic operations of GA on previous search information of BA solutions to produce new exemplars that are of high-diversity and high-quality.Guided by these exemplars,SBAGO improves both BA’s efficiency and global search capability.We evaluate this approach by using 29 widely-adopted problems from four test suites.SBAGO is also evaluated by a real-life optimization problem in mobile edge computing systems.Experimental results show that SBAGO outperforms its widely-used and recently proposed peers in terms of effectiveness,search accuracy,local optima avoidance,and robustness.

Formal Modeling of Self-Adaptive Resource Scheduling in Cloud

A self-adaptive resource provisioning on demand is a critical factor in cloud computing.The selection of accurate amount of resources at run time is not easy due to dynamic nature of requests.Therefore,a self-adaptive strategy of resources is required to deal with dynamic nature of requests based on run time change in workload.In this paper we proposed a Cloud-based Adaptive Resource Scheduling Strategy(CARSS)Framework that formally addresses these issues and is more expressive than traditional approaches.The decision making in CARSS is based on more than one factors.TheMAPE-K based framework determines the state of the resources based on their current utilization.Timed-Arc Petri Net(TAPN)is used to model system formally and behaviour is expressed in TCTL,while TAPAAL model checker verifies the underline properties of the system.

An algorithm to remove noise from locomotive bearing vibration signal based on self-adaptive EEMD filter

An improved ensemble empirical mode decomposition(EEMD) algorithm is described in this work, in which the sifting and ensemble number are self-adaptive. In particular, the new algorithm can effectively avoid the mode mixing problem. The algorithm has been validated with a simulation signal and locomotive bearing vibration signal. The results show that the proposed self-adaptive EEMD algorithm has a better filtering performance compared with the conventional EEMD. The filter results further show that the feature of the signal can be distinguished clearly with the proposed algorithm, which implies that the fault characteristics of the locomotive bearing can be detected successfully.

Self-adaptive bulk/surface engineering of Bi_(x)O_(y)Br_(z) towards enhanced photocatalysis:Current status and future challenges

The bulk/surface states of semiconductor photocatalysts are imperative parameters to maneuver their performance by significantly affecting the key processes of photocatalysis including light absorption,separation of charge carrier,and surface site reaction.Recent years have witnessed the encouraging progress of self-adaptive bulk/surface engineered Bi_(x)O_(y)Br_(z) for photocatalytic applications spanning various fields.However,despite the maturity of current research,the interaction between the bulk/surface state and the performance of Bi_(x)O_(y)Br_(z) has not yet been fully understood and highlighted.In this regard,a timely tutorial overview is quite urgent to summarize the most recent key progress and outline developing obstacles in this exciting area.Herein,the structural characteristics and fundamental principles of Bi_(x)O_(y)Br_(z)for driving photocatalytic reaction as well as related key issues are firstly reviewed.Then,we for the first time summarized different self-adaptive engineering processes over Bi_(x)O_(y)Br_(z)followed by a classification of the generation approaches towards diverse Bi_(x)O_(y)Br_(z)materials.The features of different strategies,the up-to-date characterization techniques to detect bulk/surface states,and the effect of bulk/surface states on improving the photoactivity of Bi_(x)O_(y)Br_(z)in expanded applications are further discussed.Finally,the present research status,challenges,and future research opportunities of self-adaptive bulk/surface engineered Bi_(x)O_(y)Br_(z)are prospected.It is anticipated that this critical review can trigger deeper investigations and attract upcoming innovative ideas on the rational design of Bi_(x)O_(y)Br_(z)-based photocatalysts.

A WSN Node Fault Diagnosis Model Based on BRB with Self-Adaptive Quality Factor

Wireless sensor networks (WSNs) operate in complex and harshenvironments;thus, node faults are inevitable. Therefore, fault diagnosis ofthe WSNs node is essential. Affected by the harsh working environment ofWSNs and wireless data transmission, the data collected by WSNs containnoisy data, leading to unreliable data among the data features extracted duringfault diagnosis. To reduce the influence of unreliable data features on faultdiagnosis accuracy, this paper proposes a belief rule base (BRB) with a selfadaptivequality factor (BRB-SAQF) fault diagnosis model. First, the datafeatures required for WSN node fault diagnosis are extracted. Second, thequality factors of input attributes are introduced and calculated. Third, themodel inference process with an attribute quality factor is designed. Fourth,the projection covariance matrix adaptation evolution strategy (P-CMA-ES)algorithm is used to optimize the model’s initial parameters. Finally, the effectivenessof the proposed model is verified by comparing the commonly usedfault diagnosis methods for WSN nodes with the BRB method consideringstatic attribute reliability (BRB-Sr). The experimental results show that BRBSAQFcan reduce the influence of unreliable data features. The self-adaptivequality factor calculation method is more reasonable and accurate than thestatic attribute reliability method.

A self-adaptive linear evolutionary algorithm for solving constrained optimization problems

In many real-world applications of evolutionary algorithms,the fitness of an individual requires a quantitative measure.This paper proposes a self-adaptive linear evolutionary algorithm （ALEA） in which we introduce a novel strategy for evaluating individual＇s relative strengths and weaknesses.Based on this strategy,searching space of constrained optimization problems with high dimensions for design variables is compressed into two-dimensional performance space in which it is possible to quickly identify ＇good＇ individuals of the performance for a multiobjective optimization application,regardless of original space complexity.This is considered as our main contribution.In addition,the proposed new evolutionary algorithm combines two basic operators with modification in reproduction phase,namely,crossover and mutation.Simulation results over a comprehensive set of benchmark functions show that the proposed strategy is feasible and effective,and provides good performance in terms of uniformity and diversity of solutions.

An improved de-interleaving algorithm of radar pulses based on SOFM with self-adaptive network topology

As a core part of the electronic warfare(EW) system,de-interleaving is used to separate interleaved radar signals. As interleaved radar pulses become more complex and denser, intelligent classification of radar signals has become very important. The self-organizing feature map(SOFM) is an excellent artificial neural network, which has huge advantages in intelligent classification of complex data. However, the de-interleaving process based on SOFM is faced with the problems that the initialization of the map size relies on prior information and the network topology cannot be adaptively adjusted. In this paper, an SOFM with self-adaptive network topology(SANT-SOFM) algorithm is proposed to solve the above problems. The SANT-SOFM algorithm first proposes an adaptive proliferation algorithm to adjust the map size, so that the initialization of the map size is no longer dependent on prior information but is gradually adjusted with the input data. Then,structural optimization algorithms are proposed to gradually optimize the topology of the SOFM network in the iterative process,constructing an optimal SANT. Finally, the optimized SOFM network is used for de-interleaving radar signals. Simulation results show that SANT-SOFM could get excellent performance in complex EW environments and the probability of getting the optimal map size is over 95% in the absence of priori information.

Generalized Self-Adaptive Genetic Algorithms

In order to solve the problem between searching performance and convergence of genetic algorithms, a fast genetic algorithm generalized self-adaptive genetic algorithm (GSAGA) is presented. (1) Evenly distributed initial population is generated. (2) Superior individuals are not broken because of crossover and mutation operation for they are sent to subgeneration directly. (3) High quality im- migrants are introduced according to the condition of the population schema. (4) Crossover and mutation are operated on self-adaptation. Therefore, GSAGA solves the coordination problem between convergence and searching performance. In GSAGA, the searching per- formance and global convergence are greatly improved compared with many existing genetic algorithms. Through simulation, the val- idity of this modified genetic algorithm is proved.

A Review of Image Steganography Based on Multiple Hashing Algorithm

Steganography is a technique for hiding secret messages while sending and receiving communications through a cover item.From ancient times to the present,the security of secret or vital information has always been a significant problem.The development of secure communication methods that keep recipient-only data transmissions secret has always been an area of interest.Therefore,several approaches,including steganography,have been developed by researchers over time to enable safe data transit.In this review,we have discussed image steganography based on Discrete Cosine Transform(DCT)algorithm,etc.We have also discussed image steganography based on multiple hashing algorithms like the Rivest–Shamir–Adleman(RSA)method,the Blowfish technique,and the hash-least significant bit(LSB)approach.In this review,a novel method of hiding information in images has been developed with minimal variance in image bits,making our method secure and effective.A cryptography mechanism was also used in this strategy.Before encoding the data and embedding it into a carry image,this review verifies that it has been encrypted.Usually,embedded text in photos conveys crucial signals about the content.This review employs hash table encryption on the message before hiding it within the picture to provide a more secure method of data transport.If the message is ever intercepted by a third party,there are several ways to stop this operation.A second level of security process implementation involves encrypting and decrypting steganography images using different hashing algorithms.

Algorithm Selection Method Based on Coupling Strength for Partitioned Analysis of Structure-Piezoelectric-Circuit Coupling

In this study, we propose an algorithm selection method based on coupling strength for the partitioned analysis ofstructure-piezoelectric-circuit coupling, which includes two types of coupling or inverse and direct piezoelectriccoupling and direct piezoelectric and circuit coupling. In the proposed method, implicit and explicit formulationsare used for strong and weak coupling, respectively. Three feasible partitioned algorithms are generated, namely(1) a strongly coupled algorithm that uses a fully implicit formulation for both types of coupling, (2) a weaklycoupled algorithm that uses a fully explicit formulation for both types of coupling, and (3) a partially stronglycoupled and partially weakly coupled algorithm that uses an implicit formulation and an explicit formulation forthe two types of coupling, respectively.Numerical examples using a piezoelectric energy harvester,which is a typicalstructure-piezoelectric-circuit coupling problem, demonstrate that the proposed method selects the most costeffectivealgorithm.

Hybrid Optimization Algorithm for Handwritten Document Enhancement

The Gannet Optimization Algorithm (GOA) and the Whale Optimization Algorithm (WOA) demonstrate strong performance;however, there remains room for improvement in convergence and practical applications. This study introduces a hybrid optimization algorithm, named the adaptive inertia weight whale optimization algorithm and gannet optimization algorithm (AIWGOA), which addresses challenges in enhancing handwritten documents. The hybrid strategy integrates the strengths of both algorithms, significantly enhancing their capabilities, whereas the adaptive parameter strategy mitigates the need for manual parameter setting. By amalgamating the hybrid strategy and parameter-adaptive approach, the Gannet Optimization Algorithm was refined to yield the AIWGOA. Through a performance analysis of the CEC2013 benchmark, the AIWGOA demonstrates notable advantages across various metrics. Subsequently, an evaluation index was employed to assess the enhanced handwritten documents and images, affirming the superior practical application of the AIWGOA compared with other algorithms.