期刊文献+
共找到12,115篇文章
< 1 2 250 >
每页显示 20 50 100
Underwater four-quadrant dual-beam circumferential scanning laser fuze using nonlinear adaptive backscatter filter based on pauseable SAF-LMS algorithm 被引量:1
1
作者 Guangbo Xu Bingting Zha +2 位作者 Hailu Yuan Zhen Zheng He Zhang 《Defence Technology(防务技术)》 SCIE EI CAS CSCD 2024年第7期1-13,共13页
The phenomenon of a target echo peak overlapping with the backscattered echo peak significantly undermines the detection range and precision of underwater laser fuzes.To overcome this issue,we propose a four-quadrant ... The phenomenon of a target echo peak overlapping with the backscattered echo peak significantly undermines the detection range and precision of underwater laser fuzes.To overcome this issue,we propose a four-quadrant dual-beam circumferential scanning laser fuze to distinguish various interference signals and provide more real-time data for the backscatter filtering algorithm.This enhances the algorithm loading capability of the fuze.In order to address the problem of insufficient filtering capacity in existing linear backscatter filtering algorithms,we develop a nonlinear backscattering adaptive filter based on the spline adaptive filter least mean square(SAF-LMS)algorithm.We also designed an algorithm pause module to retain the original trend of the target echo peak,improving the time discrimination accuracy and anti-interference capability of the fuze.Finally,experiments are conducted with varying signal-to-noise ratios of the original underwater target echo signals.The experimental results show that the average signal-to-noise ratio before and after filtering can be improved by more than31 d B,with an increase of up to 76%in extreme detection distance. 展开更多
关键词 Laser fuze Underwater laser detection Backscatter adaptive filter Spline least mean square algorithm Nonlinear filtering algorithm
下载PDF
Stochastic Ranking Improved Teaching-Learning and Adaptive Grasshopper Optimization Algorithm-Based Clustering Scheme for Augmenting Network Lifetime in WSNs
2
作者 N Tamilarasan SB Lenin +1 位作者 P Mukunthan NC Sendhilkumar 《China Communications》 SCIE CSCD 2024年第9期159-178,共20页
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 netw... 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. 展开更多
关键词 adaptive Grasshopper Optimization algorithm(AGOA) Cluster Head(CH) network lifetime Teaching-Learning-based Optimization algorithm(TLOA) Wireless Sensor Networks(WSNs)
下载PDF
Inversion of Seabed Geotechnical Properties in the Arctic Chukchi Deep Sea Basin Based on Time Domain Adaptive Search Matching Algorithm
3
作者 AN Long XU Chong +5 位作者 XING Junhui GONG Wei JIANG Xiaodian XU Haowei LIU Chuang YANG Boxue 《Journal of Ocean University of China》 SCIE CAS CSCD 2024年第4期933-942,共10页
The chirp sub-bottom profiler,for its high resolution,easy accessibility and cost-effectiveness,has been widely used in acoustic detection.In this paper,the acoustic impedance and grain size compositions were obtained... The chirp sub-bottom profiler,for its high resolution,easy accessibility and cost-effectiveness,has been widely used in acoustic detection.In this paper,the acoustic impedance and grain size compositions were obtained based on the chirp sub-bottom profiler data collected in the Chukchi Plateau area during the 11th Arctic Expedition of China.The time-domain adaptive search matching algorithm was used and validated on our established theoretical model.The misfit between the inversion result and the theoretical model is less than 0.067%.The grain size was calculated according to the empirical relationship between the acoustic impedance and the grain size of the sediment.The average acoustic impedance of sub-seafloor strata is 2.5026×10^(6) kg(s m^(2))^(-1)and the average grain size(θvalue)of the seafloor surface sediment is 7.1498,indicating the predominant occurrence of very fine silt sediment in the study area.Comparison of the inversion results and the laboratory measurements of nearby borehole samples shows that they are in general agreement. 展开更多
关键词 time domain adaptive search matching algorithm acoustic impedance inversion sedimentary grain size Arctic Ocean Chukchi Deep Sea Basin
下载PDF
Vibration Suppression for Active Magnetic Bearings Using Adaptive Filter with Iterative Search Algorithm
4
作者 Jin-Hui Ye Dan Shi +2 位作者 Yue-Sheng Qi Jin-Hui Gao Jian-Xin Shen 《CES Transactions on Electrical Machines and Systems》 EI CSCD 2024年第1期61-71,共11页
Active Magnetic Bearing(AMB) is a kind of electromagnetic support that makes the rotor movement frictionless and can suppress rotor vibration by controlling the magnetic force. The most common approach to restrain the... Active Magnetic Bearing(AMB) is a kind of electromagnetic support that makes the rotor movement frictionless and can suppress rotor vibration by controlling the magnetic force. The most common approach to restrain the rotor vibration in AMBs is to adopt a notch filter or adaptive filter in the AMB controller. However, these methods cannot obtain the precise amplitude and phase of the compensation current. Thus, they are not so effective in terms of suppressing the vibrations of the fundamental and other harmonic orders over the whole speed range. To improve the vibration suppression performance of AMBs,an adaptive filter based on Least Mean Square(LMS) is applied to extract the vibration signals from the rotor displacement signal. An Iterative Search Algorithm(ISA) is proposed in this paper to obtain the corresponding relationship between the compensation current and vibration signals. The ISA is responsible for searching the compensating amplitude and shifting phase online for the LMS filter, enabling the AMB controller to generate the corresponding compensation force for vibration suppression. The results of ISA are recorded to suppress vibration using the Look-Up Table(LUT) in variable speed range. Comprehensive simulations and experimental validations are carried out in fixed and variable speed range, and the results demonstrate that by employing the ISA, vibrations of the fundamental and other harmonic orders are suppressed effectively. 展开更多
关键词 Active Magnetic Bearing(AMB) adaptive filter Iterative search algorithm Least mean square(LMS) Vibration suppression
下载PDF
Novel Adaptive Memory Event-Triggered-Based Fuzzy Robust Control for Nonlinear Networked Systems via the Differential Evolution Algorithm
5
作者 Wei Qian Yanmin Wu Bo Shen 《IEEE/CAA Journal of Automatica Sinica》 SCIE EI CSCD 2024年第8期1836-1848,共13页
This article mainly investigates the fuzzy optimization robust control issue for nonlinear networked systems characterized by the interval type-2(IT2)fuzzy technique under a differential evolution algorithm.To provide... This article mainly investigates the fuzzy optimization robust control issue for nonlinear networked systems characterized by the interval type-2(IT2)fuzzy technique under a differential evolution algorithm.To provide a more reasonable utilization of the constrained communication channel,a novel adaptive memory event-triggered(AMET)mechanism is developed,where two event-triggered thresholds can be dynamically adjusted in the light of the current system information and the transmitted historical data.Sufficient conditions with less conservative design of the fuzzy imperfect premise matching(IPM)controller are presented by introducing the Wirtinger-based integral inequality,the information of membership functions(MFs)and slack matrices.Subsequently,under the IPM policy,a new MFs intelligent optimization technique that takes advantage of the differential evolution algorithm is first provided for IT2 TakagiSugeno(T-S)fuzzy systems to update the fuzzy controller MFs in real-time and achieve a better system control effect.Finally,simulation results demonstrate that the proposed control scheme can obtain better system performance in the case of using fewer communication resources. 展开更多
关键词 adaptive memory event-triggered(AMET) differential evolution algorithm fuzzy optimization robust control interval type-2(IT2)fuzzy technique.
下载PDF
A Reference Vector-Assisted Many-Objective Optimization Algorithm with Adaptive Niche Dominance Relation
6
作者 Fangzhen Ge Yating Wu +1 位作者 Debao Chen Longfeng Shen 《Intelligent Automation & Soft Computing》 2024年第2期189-211,共23页
It is still a huge challenge for traditional Pareto-dominatedmany-objective optimization algorithms to solve manyobjective optimization problems because these algorithms hardly maintain the balance between convergence... It is still a huge challenge for traditional Pareto-dominatedmany-objective optimization algorithms to solve manyobjective optimization problems because these algorithms hardly maintain the balance between convergence and diversity and can only find a group of solutions focused on a small area on the Pareto front,resulting in poor performance of those algorithms.For this reason,we propose a reference vector-assisted algorithmwith an adaptive niche dominance relation,for short MaOEA-AR.The new dominance relation forms a niche based on the angle between candidate solutions.By comparing these solutions,the solutionwith the best convergence is found to be the non-dominated solution to improve the selection pressure.In reproduction,a mutation strategy of k-bit crossover and hybrid mutation is used to generate high-quality offspring.On 23 test problems with up to 15-objective,we compared the proposed algorithm with five state-of-the-art algorithms.The experimental results verified that the proposed algorithm is competitive. 展开更多
关键词 Many-objective optimization evolutionary algorithm Pareto dominance reference vector adaptive niche
下载PDF
A Spectral Convolutional Neural Network Model Based on Adaptive Fick’s Law for Hyperspectral Image Classification
7
作者 Tsu-Yang Wu Haonan Li +1 位作者 Saru Kumari Chien-Ming Chen 《Computers, Materials & Continua》 SCIE EI 2024年第4期19-46,共28页
Hyperspectral image classification stands as a pivotal task within the field of remote sensing,yet achieving highprecision classification remains a significant challenge.In response to this challenge,a Spectral Convol... Hyperspectral image classification stands as a pivotal task within the field of remote sensing,yet achieving highprecision classification remains a significant challenge.In response to this challenge,a Spectral Convolutional Neural Network model based on Adaptive Fick’s Law Algorithm(AFLA-SCNN)is proposed.The Adaptive Fick’s Law Algorithm(AFLA)constitutes a novel metaheuristic algorithm introduced herein,encompassing three new strategies:Adaptive weight factor,Gaussian mutation,and probability update policy.With adaptive weight factor,the algorithmcan adjust theweights according to the change in the number of iterations to improve the performance of the algorithm.Gaussianmutation helps the algorithm avoid falling into local optimal solutions and improves the searchability of the algorithm.The probability update strategy helps to improve the exploitability and adaptability of the algorithm.Within the AFLA-SCNN model,AFLA is employed to optimize two hyperparameters in the SCNN model,namely,“numEpochs”and“miniBatchSize”,to attain their optimal values.AFLA’s performance is initially validated across 28 functions in 10D,30D,and 50D for CEC2013 and 29 functions in 10D,30D,and 50D for CEC2017.Experimental results indicate AFLA’s marked performance superiority over nine other prominent optimization algorithms.Subsequently,the AFLA-SCNN model was compared with the Spectral Convolutional Neural Network model based on Fick’s Law Algorithm(FLA-SCNN),Spectral Convolutional Neural Network model based on Harris Hawks Optimization(HHO-SCNN),Spectral Convolutional Neural Network model based onDifferential Evolution(DE-SCNN),SpectralConvolutionalNeuralNetwork(SCNN)model,and SupportVector Machines(SVM)model using the Indian Pines dataset and PaviaUniversity dataset.The experimental results show that the AFLA-SCNN model outperforms other models in terms of Accuracy,Precision,Recall,and F1-score on Indian Pines and Pavia University.Among them,the Accuracy of the AFLA-SCNN model on Indian Pines reached 99.875%,and the Accuracy on PaviaUniversity reached 98.022%.In conclusion,our proposed AFLA-SCNN model is deemed to significantly enhance the precision of hyperspectral image classification. 展开更多
关键词 adaptive Fick’s law algorithm spectral convolutional neural network metaheuristic algorithm intelligent optimization algorithm hyperspectral image classification
下载PDF
Research and Application of a Multi-Field Co-Simulation Data Extraction Method Based on Adaptive Infinitesimal Element
8
作者 Changfu Wan Wenqiang Li +2 位作者 Sitong Ling Yingdong Liu Jiahao Chen 《Computer Modeling in Engineering & Sciences》 SCIE EI 2024年第1期321-348,共28页
Regarding the spatial profile extraction method of a multi-field co-simulation dataset,different extraction directions,locations,and numbers of profileswill greatly affect the representativeness and integrity of data.... Regarding the spatial profile extraction method of a multi-field co-simulation dataset,different extraction directions,locations,and numbers of profileswill greatly affect the representativeness and integrity of data.In this study,a multi-field co-simulation data extractionmethod based on adaptive infinitesimal elements is proposed.Themultifield co-simulation dataset based on related infinitesimal elements is constructed,and the candidate directions of data profile extraction undergo dimension reduction by principal component analysis to determine the direction of data extraction.Based on the fireworks algorithm,the data profile with optimal representativeness is searched adaptively in different data extraction intervals to realize the adaptive calculation of data extraction micro-step length.The multi-field co-simulation data extraction process based on adaptive microelement is established and applied to the data extraction process of the multi-field co-simulation dataset of the sintering furnace.Compared with traditional data extraction methods for multi-field co-simulation,the approximate model constructed by the data extracted from the proposed method has higher construction efficiency.Meanwhile,the relative maximum absolute error,root mean square error,and coefficient of determination of the approximationmodel are better than those of the approximation model constructed by the data extracted from traditional methods,indicating higher accuracy,it is verified that the proposed method demonstrates sound adaptability and extraction efficiency. 展开更多
关键词 Multi-field co-simulation adaptive infinitesimal elements principal component analysis fireworks algorithm sintering furnace simulation
下载PDF
Identification of time-varying system and energy-based optimization of adaptive control in seismically excited structure
9
作者 Elham Aghabarari Fereidoun Amini Pedram Ghaderi 《Earthquake Engineering and Engineering Vibration》 SCIE EI CSCD 2024年第1期227-240,共14页
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 ... 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. 展开更多
关键词 integrated online identification time-varying systems structural energy multiple forgetting factor recursive least squares optimal simple adaptive control algorithm
下载PDF
Adaptive Fault Estimation for Dynamics of High Speed Train Based on Robust UKF Algorithm 被引量:1
10
作者 Kexin Li Tiantian Liang 《Journal of Harbin Institute of Technology(New Series)》 CAS 2023年第1期61-72,共12页
This paper proposes an adaptive unscented Kalman filter algorithm(ARUKF)to implement fault estimation for the dynamics of high⁃speed train(HST)with measurement uncertainty and time⁃varying noise with unknown statistic... This paper proposes an adaptive unscented Kalman filter algorithm(ARUKF)to implement fault estimation for the dynamics of high⁃speed train(HST)with measurement uncertainty and time⁃varying noise with unknown statistics.Firstly,regarding the actuator and sensor fault as the auxiliary variables of the dynamics of HST,an augmented system is established,and the fault estimation problem for dynamics of HST is formulated as the state estimation of the augmented system.Then,considering the measurement uncertainties,a robust lower bound is proposed to modify the update of the UKF to decrease the influence of measurement uncertainty on the filtering accuracy.Further,considering the unknown time⁃varying noise of the dynamics of HST,an adaptive UKF algorithm based on moving window is proposed to estimate the time⁃varying noise so that accurate concurrent actuator and sensor fault estimations of dynamics of HST is implemented.Finally,a five-car model of HST is given to show the effectiveness of this method. 展开更多
关键词 high speed train Kalman filter adaptive algorithm robust algorithm unknown noise measurement uncertainty
下载PDF
Application of a Parallel Adaptive Cuckoo Search Algorithm in the Rectangle Layout Problem 被引量:1
11
作者 Weimin Zheng Mingchao Si +2 位作者 Xiao Sui Shuchuan Chu Jengshyang Pan 《Computer Modeling in Engineering & Sciences》 SCIE EI 2023年第6期2173-2196,共24页
The meta-heuristic algorithm is a global probabilistic search algorithm for the iterative solution.It has good performance in global optimization fields such as maximization.In this paper,a new adaptive parameter stra... The meta-heuristic algorithm is a global probabilistic search algorithm for the iterative solution.It has good performance in global optimization fields such as maximization.In this paper,a new adaptive parameter strategy and a parallel communication strategy are proposed to further improve the Cuckoo Search(CS)algorithm.This strategy greatly improves the convergence speed and accuracy of the algorithm and strengthens the algorithm’s ability to jump out of the local optimal.This paper compares the optimization performance of Parallel Adaptive Cuckoo Search(PACS)with CS,Parallel Cuckoo Search(PCS),Particle Swarm Optimization(PSO),Sine Cosine Algorithm(SCA),Grey Wolf Optimizer(GWO),Whale Optimization Algorithm(WOA),Differential Evolution(DE)and Artificial Bee Colony(ABC)algorithms by using the CEC-2013 test function.The results show that PACS algorithmoutperforms other algorithms in 20 of 28 test functions.Due to the superior performance of PACS algorithm,this paper uses it to solve the problem of the rectangular layout.Experimental results show that this scheme has a significant effect,and the material utilization rate is improved from89.5%to 97.8%after optimization. 展开更多
关键词 Rectangular layout cuckoo search algorithm parallel communication strategy adaptive parameter
下载PDF
An Improved Bald Eagle Search Algorithm with Cauchy Mutation and Adaptive Weight Factor for Engineering Optimization 被引量:1
12
作者 Wenchuan Wang Weican Tian +3 位作者 Kwok-wing Chau Yiming Xue Lei Xu Hongfei Zang 《Computer Modeling in Engineering & Sciences》 SCIE EI 2023年第8期1603-1642,共40页
The Bald Eagle Search algorithm(BES)is an emerging meta-heuristic algorithm.The algorithm simulates the hunting behavior of eagles,and obtains an optimal solution through three stages,namely selection stage,search sta... The Bald Eagle Search algorithm(BES)is an emerging meta-heuristic algorithm.The algorithm simulates the hunting behavior of eagles,and obtains an optimal solution through three stages,namely selection stage,search stage and swooping stage.However,BES tends to drop-in local optimization and the maximum value of search space needs to be improved.To fill this research gap,we propose an improved bald eagle algorithm(CABES)that integrates Cauchy mutation and adaptive optimization to improve the performance of BES from local optima.Firstly,CABES introduces the Cauchy mutation strategy to adjust the step size of the selection stage,to select a better search range.Secondly,in the search stage,CABES updates the search position update formula by an adaptive weight factor to further promote the local optimization capability of BES.To verify the performance of CABES,the benchmark function of CEC2017 is used to simulate the algorithm.The findings of the tests are compared to those of the Particle Swarm Optimization algorithm(PSO),Whale Optimization Algorithm(WOA)and Archimedes Algorithm(AOA).The experimental results show that CABES can provide good exploration and development capabilities,and it has strong competitiveness in testing algorithms.Finally,CABES is applied to four constrained engineering problems and a groundwater engineeringmodel,which further verifies the effectiveness and efficiency of CABES in practical engineering problems. 展开更多
关键词 Bald eagle search algorithm cauchymutation adaptive weight factor CEC2017 benchmark functions engineering optimization problems
下载PDF
Blockchain technology‑based FinTech banking sector involvement using adaptive neuro‑fuzzy‑based K‑nearest neighbors algorithm 被引量:1
13
作者 Husam Rjoub Tomiwa Sunday Adebayo Dervis Kirikkaleli 《Financial Innovation》 2023年第1期1765-1787,共23页
The study aims to investigate the financial technology(FinTech)factors influencing Chinese banking performance.Financial expectations and global realities may be changed by FinTech’s multidimensional scope,which is l... The study aims to investigate the financial technology(FinTech)factors influencing Chinese banking performance.Financial expectations and global realities may be changed by FinTech’s multidimensional scope,which is lacking in the traditional financial sector.The use of technology to automate financial services is becoming more important for economic organizations and industries because the digital age has seen a period of transition in terms of consumers and personalization.The future of FinTech will be shaped by technologies like the Internet of Things,blockchain,and artificial intelligence.The involvement of these platforms in financial services is a major concern for global business growth.FinTech is becoming more popular with customers because of such benefits.FinTech has driven a fundamental change within the financial services industry,placing the client at the center of everything.Protection has become a primary focus since data are a component of FinTech transactions.The task of consolidating research reports for consensus is very manual,as there is no standardized format.Although existing research has proposed certain methods,they have certain drawbacks in FinTech payment systems(including cryptocurrencies),credit markets(including peer-to-peer lending),and insurance systems.This paper implements blockchainbased financial technology for the banking sector to overcome these transition issues.In this study,we have proposed an adaptive neuro-fuzzy-based K-nearest neighbors’algorithm.The chaotic improved foraging optimization algorithm is used to optimize the proposed method.The rolling window autoregressive lag modeling approach analyzes FinTech growth.The proposed algorithm is compared with existing approaches to demonstrate its efficiency.The findings showed that it achieved 91%accuracy,90%privacy,96%robustness,and 25%cyber-risk performance.Compared with traditional approaches,the recommended strategy will be more convenient,safe,and effective in the transition period. 展开更多
关键词 FinTech Economic growth Blockchain technology adaptive neural fuzzy based KNN algorithm Rolling window autoregressive lag modelling
下载PDF
Adaptive genetic algorithm-based design of gamma-graphyne nanoribbon incorporating diamond-shaped segment with high thermoelectric conversion efficiency
14
作者 陆静远 崔春凤 +4 位作者 欧阳滔 李金 何朝宇 唐超 钟建新 《Chinese Physics B》 SCIE EI CAS CSCD 2023年第4期109-117,共9页
The gamma-graphyne nanoribbons(γ-GYNRs) incorporating diamond-shaped segment(DSSs) with excellent thermoelectric properties are systematically investigated by combining nonequilibrium Green’s functions with adaptive... The gamma-graphyne nanoribbons(γ-GYNRs) incorporating diamond-shaped segment(DSSs) with excellent thermoelectric properties are systematically investigated by combining nonequilibrium Green’s functions with adaptive genetic algorithm. Our calculations show that the adaptive genetic algorithm is efficient and accurate in the process of identifying structures with excellent thermoelectric performance. In multiple rounds, an average of 476 candidates(only 2.88% of all16512 candidate structures) are calculated to obtain the structures with extremely high thermoelectric conversion efficiency.The room temperature thermoelectric figure of merit(ZT) of the optimal γ-GYNR incorporating DSSs is 1.622, which is about 5.4 times higher than that of pristine γ-GYNR(length 23.693 nm and width 2.660 nm). The significant improvement of thermoelectric performance of the optimal γ-GYNR is mainly attributed to the maximum balance of inhibition of thermal conductance(proactive effect) and reduction of thermal power factor(side effect). Moreover, through exploration of the main variables affecting the genetic algorithm, it is revealed that the efficiency of the genetic algorithm can be improved by optimizing the initial population gene pool, selecting a higher individual retention rate and a lower mutation rate. The results presented in this paper validate the effectiveness of genetic algorithm in accelerating the exploration of γ-GYNRs with high thermoelectric conversion efficiency, and could provide a new development solution for carbon-based thermoelectric materials. 展开更多
关键词 adaptive genetic algorithm thermoelectric material diamond-like quantum dots gamma-graphyne nanoribbon
下载PDF
Efficient Clustering Using Memetic Adaptive Hill Climbing Algorithm in WSN
15
作者 M.Manikandan S.Sakthivel V.Vivekanandhan 《Intelligent Automation & Soft Computing》 SCIE 2023年第3期3169-3185,共17页
Wireless Sensor Networks are composed of autonomous sensing devices which are interconnected to form a closed network.This closed network is intended to share sensitive location-centric information from a source node ... Wireless Sensor Networks are composed of autonomous sensing devices which are interconnected to form a closed network.This closed network is intended to share sensitive location-centric information from a source node to the base station through efficient routing mechanisms.The efficiency of the sensor node is energy bounded,acts as a concentrated area for most researchers to offer a solution for the early draining power of sensors.Network management plays a significant role in wireless sensor networks,which was obsessed with the factors like the reliability of the network,resource management,energy-efficient routing,and scalability of services.The topology of the wireless sensor networks acts dri-ven factor for network efficiency which can be effectively maintained by perform-ing the clustering process effectively.More solutions and clustering algorithms have been offered by various researchers,but the concern of reduced efficiency in the routing process and network management still exists.This research paper offers a hybrid algorithm composed of a memetic algorithm which is an enhanced version of a genetic algorithm integrated with the adaptive hill-climbing algorithm for performing energy-efficient clustering process in the wireless sensor networks.The memetic algorithm employs a local searching methodology to mitigate the premature convergence,while the adaptive hill-climbing algorithm is a local search algorithm that persistently migrates towards the increased elevation to determine the peak of the mountain(i.e.,)best cluster head in the wireless sensor networks.The proposed hybrid algorithm is compared with the state of art clus-tering algorithm to prove that the proposed algorithm outperforms in terms of a network life-time,energy consumption,throughput,etc. 展开更多
关键词 Wireless sensor networks TOPOLOGY CLUSTERING memetic algorithm adaptive hill climbing algorithm network management energy consumption THROUGHPUT
下载PDF
Adaptive Butterfly Optimization Algorithm(ABOA)Based Feature Selection and Deep Neural Network(DNN)for Detection of Distributed Denial-of-Service(DDoS)Attacks in Cloud
16
作者 S.Sureshkumar G.K.D.Prasanna Venkatesan R.Santhosh 《Computer Systems Science & Engineering》 SCIE EI 2023年第10期1109-1123,共15页
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 virtualiz... 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. 展开更多
关键词 Cloud computing distributed denial of service intrusion detection system adaptive butterfly optimization algorithm deep neural network
下载PDF
An Adaptive Fruit Fly Optimization Algorithm for Optimization Problems
17
作者 L. Q. Zhang J. Xiong J. K. Liu 《Journal of Applied Mathematics and Physics》 2023年第11期3641-3650,共10页
In this paper, we present a new fruit fly optimization algorithm with the adaptive step for solving unconstrained optimization problems, which is able to avoid the slow convergence and the tendency to fall into local ... In this paper, we present a new fruit fly optimization algorithm with the adaptive step for solving unconstrained optimization problems, which is able to avoid the slow convergence and the tendency to fall into local optimum of the standard fruit fly optimization algorithm. By using the information of the iteration number and the maximum iteration number, the proposed algorithm uses the floor function to ensure that the fruit fly swarms adopt the large step search during the olfactory search stage which improves the search speed;in the visual search stage, the small step is used to effectively avoid local optimum. Finally, using commonly used benchmark testing functions, the proposed algorithm is compared with the standard fruit fly optimization algorithm with some fixed steps. The simulation experiment results show that the proposed algorithm can quickly approach the optimal solution in the olfactory search stage and accurately search in the visual search stage, demonstrating more effective performance. 展开更多
关键词 Swarm Intelligent Optimization algorithm Fruit Fly Optimization algorithm adaptive Step Local Optimum Convergence Speed
下载PDF
Improved Adaptive Differential Evolution Algorithm for the Un-Capacitated Facility Location Problem
18
作者 Nan Jiang Huizhen Zhang 《Open Journal of Applied Sciences》 CAS 2023年第5期685-695,共11页
The differential evolution algorithm is an evolutionary algorithm for global optimization and the un-capacitated facility location problem (UFL) is one of the classic NP-Hard problems. In this paper, combined with the... The differential evolution algorithm is an evolutionary algorithm for global optimization and the un-capacitated facility location problem (UFL) is one of the classic NP-Hard problems. In this paper, combined with the specific characteristics of the UFL problem, we introduce the activation function to the algorithm for solving UFL problem and name it improved adaptive differential evolution algorithm (IADEA). Next, to improve the efficiency of the algorithm and to alleviate the problem of being stuck in a local optimum, an adaptive operator was added. To test the improvement of our algorithm, we compare the IADEA with the basic differential evolution algorithm by solving typical instances of UFL problem respectively. Moreover, to compare with other heuristic algorithm, we use the hybrid ant colony algorithm to solve the same instances. The computational results show that IADEA improves the performance of the basic DE and it outperforms the hybrid ant colony algorithm. 展开更多
关键词 Un-Capacitated Facility Location Problem Differential Evolution algorithm adaptive Operator
下载PDF
Adaptive Kernel Firefly Algorithm Based Feature Selection and Q-Learner Machine Learning Models in Cloud
19
作者 I.Mettildha Mary K.Karuppasamy 《Computer Systems Science & Engineering》 SCIE EI 2023年第9期2667-2685,共19页
CC’s(Cloud Computing)networks are distributed and dynamic as signals appear/disappear or lose significance.MLTs(Machine learning Techniques)train datasets which sometime are inadequate in terms of sample for inferrin... CC’s(Cloud Computing)networks are distributed and dynamic as signals appear/disappear or lose significance.MLTs(Machine learning Techniques)train datasets which sometime are inadequate in terms of sample for inferring information.A dynamic strategy,DevMLOps(Development Machine Learning Operations)used in automatic selections and tunings of MLTs result in significant performance differences.But,the scheme has many disadvantages including continuity in training,more samples and training time in feature selections and increased classification execution times.RFEs(Recursive Feature Eliminations)are computationally very expensive in its operations as it traverses through each feature without considering correlations between them.This problem can be overcome by the use of Wrappers as they select better features by accounting for test and train datasets.The aim of this paper is to use DevQLMLOps for automated tuning and selections based on orchestrations and messaging between containers.The proposed AKFA(Adaptive Kernel Firefly Algorithm)is for selecting features for CNM(Cloud Network Monitoring)operations.AKFA methodology is demonstrated using CNSD(Cloud Network Security Dataset)with satisfactory results in the performance metrics like precision,recall,F-measure and accuracy used. 展开更多
关键词 Cloud analytics machine learning ensemble learning distributed learning clustering classification auto selection auto tuning decision feedback cloud DevOps feature selection wrapper feature selection adaptive Kernel Firefly algorithm(AKFA) Q learning
下载PDF
Adaptive genetic algorithm with the criterion of premature convergence 被引量:9
20
作者 袁晓辉 曹玲 夏良正 《Journal of Southeast University(English Edition)》 EI CAS 2003年第1期40-43,共4页
To counter the defect of traditional genetic algorithms, an improved adaptivegenetic algorithm with the criterion of premature convergence is provided. The occurrence ofpremature convergence is forecasted using colony... To counter the defect of traditional genetic algorithms, an improved adaptivegenetic algorithm with the criterion of premature convergence is provided. The occurrence ofpremature convergence is forecasted using colony entropy and colony variance. When prematureconvergence occurs, new individuals are generated in proper scale randomly based on superiorindividuals in the colony. We use these new individuals to replace some individuals in the oldcolony. The updated individuals account for 30 percent - 40 percent of all individuals and the sizeof scale is related to the distribution of the extreme value of the target function. Simulationtests show that there is much improvement in the speed of convergence and the probability of globalconvergence. 展开更多
关键词 genetic algorithm premature convergence adaptATION
下载PDF
上一页 1 2 250 下一页 到第
使用帮助 返回顶部