Objective:We examined the effect of silent myocardial ischemia(SMI)on functional fitness levels and physical independence in 60–79-year-old individuals.Methods:We conducted a cross-sectional study with 716 older adul...Objective:We examined the effect of silent myocardial ischemia(SMI)on functional fitness levels and physical independence in 60–79-year-old individuals.Methods:We conducted a cross-sectional study with 716 older adults and used an electrocardiograph and an ambulatory electrocardiogram to diagnose those with SMI.Physical independence was assessed using the Composite Physical Function scale,whereas physical fitness was assessed using the Senior Fitness Test battery.Results:The 60-79-year-old females and males with SMI were more likely to have lower scores for lower and upper body strength,agility/dynamic balance,and aerobic endurance(p<0.05)than those without SMI.The scores for lower and upper body flexibility in all age groups for both genders were not significant(p>0.05).Binary logistic regression analysis revealed that old adults with SMI had a higher risk of losing physical independence later in life than those without SMI(p<0.05).Conclusion:This study showed that individuals with SMI have lower fitness levels and increased risk of losing physical independence than those without SMI.展开更多
Recently,vehicular ad hoc networks(VANETs)finds applicability in different domains such as security,rescue operations,intelligent transportation systems(ITS),etc.VANET has unique features like high mobility,limited mo...Recently,vehicular ad hoc networks(VANETs)finds applicability in different domains such as security,rescue operations,intelligent transportation systems(ITS),etc.VANET has unique features like high mobility,limited mobility patterns,adequate topologymodifications,and wireless communication.Despite the benefits of VANET,scalability is a challenging issue which could be addressed by the use of cluster-based routing techniques.It enables the vehicles to perform intercluster communication via chosen CHs and optimal routes.The main drawback of VANET network is the network unsteadiness that results in minimum lifetime.In order to avoid reduced network lifetime in VANET,this paper presents an enhanced metaheuristics based clustering with multihop routing technique for lifetime maximization(EMCMHR-LM)in VANET.The presented EMCMHR-LM model involves the procedure of arranging clusters,cluster head(CH)selection,and route selection appropriate for VANETs.The presentedEMCMHR-LMmodel uses slime mold optimization based clustering(SMO-C)technique to group the vehicles into clusters.Besides,an enhanced wild horse optimization based multihop routing(EWHO-MHR)protocol by the optimization of network parameters.The presented EMCMHR-LMmodel is simulated usingNetwork Simulator(NS3)tool and the simulation outcomes reported the enhanced performance of the proposed EMCMHR-LM technique over the other models.展开更多
The nodes in the sensor network have a wide range of uses,particularly on under-sea links that are skilled for detecting,handling as well as management.The underwater wireless sensor networks support collecting pollut...The nodes in the sensor network have a wide range of uses,particularly on under-sea links that are skilled for detecting,handling as well as management.The underwater wireless sensor networks support collecting pollution data,mine survey,oceanographic information collection,aided navigation,strategic surveillance,and collection of ocean samples using detectors that are submerged inwater.Localization,congestion routing,and prioritizing the traffic is the major issue in an underwater sensor network.Our scheme differentiates the different types of traffic and gives every type of traffic its requirements which is considered regarding network resource.Minimization of localization error using the proposed angle-based forwarding scheme is explained in this paper.We choose the shortest path to the destination using the fitness function which is calculated based on fault ratio,dispatching of packets,power,and distance among the nodes.This work contemplates congestion conscious forwarding using hard stage and soft stage schemes which reduce the congestion by monitoring the status of the energy and buffer of the nodes and controlling the traffic.The study with the use of the ns3 simulator demonstrated that a given algorithm accomplishes superior performance for loss of packet,delay of latency,and power utilization than the existing algorithms.展开更多
In a vehicular ad hoc network(VANET),a massive quantity of data needs to be transmitted on a large scale in shorter time durations.At the same time,vehicles exhibit high velocity,leading to more vehicle disconnections...In a vehicular ad hoc network(VANET),a massive quantity of data needs to be transmitted on a large scale in shorter time durations.At the same time,vehicles exhibit high velocity,leading to more vehicle disconnections.Both of these characteristics result in unreliable data communication in VANET.A vehicle clustering algorithm clusters the vehicles in groups employed in VANET to enhance network scalability and connection reliability.Clustering is considered one of the possible solutions for attaining effectual interaction in VANETs.But one such difficulty was reducing the cluster number under increasing transmitting nodes.This article introduces an Evolutionary Hide Objects Game Optimization based Distance Aware Clustering(EHOGO-DAC)Scheme for VANET.The major intention of the EHOGO-DAC technique is to portion the VANET into distinct sets of clusters by grouping vehicles.In addition,the DHOGO-EAC technique is mainly based on the HOGO algorithm,which is stimulated by old games,and the searching agent tries to identify hidden objects in a given space.The DHOGO-EAC technique derives a fitness function for the clustering process,including the total number of clusters and Euclidean distance.The experimental assessment of the DHOGO-EAC technique was carried out under distinct aspects.The comparison outcome stated the enhanced outcomes of the DHOGO-EAC technique compared to recent approaches.展开更多
The developments of multi-core systems(MCS)have considerably improved the existing technologies in thefield of computer architecture.The MCS comprises several processors that are heterogeneous for resource capacities,...The developments of multi-core systems(MCS)have considerably improved the existing technologies in thefield of computer architecture.The MCS comprises several processors that are heterogeneous for resource capacities,working environments,topologies,and so on.The existing multi-core technology unlocks additional research opportunities for energy minimization by the use of effective task scheduling.At the same time,the task scheduling process is yet to be explored in the multi-core systems.This paper presents a new hybrid genetic algorithm(GA)with a krill herd(KH)based energy-efficient scheduling techni-que for multi-core systems(GAKH-SMCS).The goal of the GAKH-SMCS tech-nique is to derive scheduling tasks in such a way to achieve faster completion time and minimum energy dissipation.The GAKH-SMCS model involves a multi-objectivefitness function using four parameters such as makespan,processor utilization,speedup,and energy consumption to schedule tasks proficiently.The performance of the GAKH-SMCS model has been validated against two datasets namely random dataset and benchmark dataset.The experimental outcome ensured the effectiveness of the GAKH-SMCS model interms of makespan,pro-cessor utilization,speedup,and energy consumption.The overall simulation results depicted that the presented GAKH-SMCS model achieves energy effi-ciency by optimal task scheduling process in MCS.展开更多
Wireless Sensor Networks(WSN)has evolved into a key technology for ubiquitous living and the domain of interest has remained active in research owing to its extensive range of applications.In spite of this,it is chall...Wireless Sensor Networks(WSN)has evolved into a key technology for ubiquitous living and the domain of interest has remained active in research owing to its extensive range of applications.In spite of this,it is challenging to design energy-efficient WSN.The routing approaches are leveraged to reduce the utilization of energy and prolonging the lifespan of network.In order to solve the restricted energy problem,it is essential to reduce the energy utilization of data,transmitted from the routing protocol and improve network development.In this background,the current study proposes a novel Differential Evolution with Arithmetic Optimization Algorithm Enabled Multi-hop Routing Protocol(DEAOA-MHRP)for WSN.The aim of the proposed DEAOA-MHRP model is select the optimal routes to reach the destination in WSN.To accomplish this,DEAOA-MHRP model initially integrates the concepts of Different Evolution(DE)and Arithmetic Optimization Algorithms(AOA)to improve convergence rate and solution quality.Besides,the inclusion of DE in traditional AOA helps in overcoming local optima problems.In addition,the proposed DEAOA-MRP technique derives a fitness function comprising two input variables such as residual energy and distance.In order to ensure the energy efficient performance of DEAOA-MHRP model,a detailed comparative study was conducted and the results established its superior performance over recent approaches.展开更多
Cognitive radio wireless sensor networks(CRWSN)can be defined as a promising technology for developing bandwidth-limited applications.CRWSN is widely utilized by future Internet of Things(IoT)applications.Since a prom...Cognitive radio wireless sensor networks(CRWSN)can be defined as a promising technology for developing bandwidth-limited applications.CRWSN is widely utilized by future Internet of Things(IoT)applications.Since a promising technology,Cognitive Radio(CR)can be modelled to alleviate the spectrum scarcity issue.Generally,CRWSN has cognitive radioenabled sensor nodes(SNs),which are energy limited.Hierarchical clusterrelated techniques for overall network management can be suitable for the scalability and stability of the network.This paper focuses on designing the Modified Dwarf Mongoose Optimization Enabled Energy Aware Clustering(MDMO-EAC)Scheme for CRWSN.The MDMO-EAC technique mainly intends to group the nodes into clusters in the CRWSN.Besides,theMDMOEAC algorithm is based on the dwarf mongoose optimization(DMO)algorithm design with oppositional-based learning(OBL)concept for the clustering process,showing the novelty of the work.In addition,the presented MDMO-EAC algorithm computed a multi-objective function for improved network efficiency.The presented model is validated using a comprehensive range of experiments,and the outcomes were scrutinized in varying measures.The comparison study stated the improvements of the MDMO-EAC method over other recent approaches.展开更多
Particle swarm optimization (PSO) is a new heuristic algorithm which has been applied to many optimization problems successfully. Attribute reduction is a key studying point of the rough set theory, and it has been ...Particle swarm optimization (PSO) is a new heuristic algorithm which has been applied to many optimization problems successfully. Attribute reduction is a key studying point of the rough set theory, and it has been proven that computing minimal reduc- tion of decision tables is a non-derterministic polynomial (NP)-hard problem. A new cooperative extended attribute reduction algorithm named Co-PSAR based on improved PSO is proposed, in which the cooperative evolutionary strategy with suitable fitness func- tions is involved to learn a good hypothesis for accelerating the optimization of searching minimal attribute reduction. Experiments on Benchmark functions and University of California, Irvine (UCI) data sets, compared with other algorithms, verify the superiority of the Co-PSAR algorithm in terms of the convergence speed, efficiency and accuracy for the attribute reduction.展开更多
Forecasting crop yields based on remote sensing data is one of the most important tasks in agriculture.Soybean is the main crop in the Russian Far East.It is desirable to forecast soybean yield as early as possible wh...Forecasting crop yields based on remote sensing data is one of the most important tasks in agriculture.Soybean is the main crop in the Russian Far East.It is desirable to forecast soybean yield as early as possible while maintaining high accuracy.This study aimed to investigate seasonal time series of the normalized difference vegetation index(NDVI) to achieve early forecasting of soybean yield.This research used data from the Moderate Resolution Image Spectroradiometer(MODIS),an arable-land mask obtained from the VEGA-Science web service,and soybean yield data for 2008-2017 for the Jewish Autonomous Region(JAR) districts.Four approximating functions were fitted to model the NDVI time series:Gaussian,double logistic(DL),and quadratic and cubic polynomials.In the period from calendar weeks 22-42(end of May to mid-October),averaged over two districts,the model using the DL function showed the highest accuracy(mean absolute percentage error-4.0%,root mean square error(RMSE)-0.029,P <0.01).The yield forecast accuracy of prediction in the period of weeks 25-30 in JAR municipalities using the parameters of the Gaussian function was higher(P <0.05) than that using the other functions.The mean forecast error for the Gaussian function was 14.9% in week 25(RMSE was0.21 t ha) and 5.1%-12.9% in weeks 26-30(RMSE varied from 0.06 to 0.15 t ha) according to the2013-2017 data.In weeks 31-32,the error was 5.0%-5.4%(RMSE was 0.07 t ha) using the Gaussian parameters and 7.4%-7.7%(RMSE was 0.09-0.11 t ha) for the DL function.When the method was applied to municipal districts of other soy-producing regions of the Russian Far East.RMSE was0.14-0.32 t hain weeks 25-26 and did not exceed 0.20 t hain subsequent weeks.展开更多
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 ...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.展开更多
The three-layer forward neural networks are used to establish the inverse kinematics models of robot manipulators. The fuzzy genetic algorithm based on the linear scaling of the fitness value is presented to update th...The three-layer forward neural networks are used to establish the inverse kinematics models of robot manipulators. The fuzzy genetic algorithm based on the linear scaling of the fitness value is presented to update the weights of neural networks. To increase the search speed of the algorithm, the crossover probability and the mutation probability are adjusted through fuzzy control and the fitness is modified by the linear scaling method in FGA. Simulations show that the proposed method improves considerably the precision of the inverse kinematics solutions for robot manipulators and guarantees a rapid global convergence and overcomes the drawbacks of SGA and the BP algorithm.展开更多
To analyze the dynamic mechanism of unusual activities of the subtropical high, the space-time varible separation of the partial differential vortex equations is carried out with Galerkin methods based on the heat for...To analyze the dynamic mechanism of unusual activities of the subtropical high, the space-time varible separation of the partial differential vortex equations is carried out with Galerkin methods based on the heat force and the whirl movement dissipation effect. Aiming at the subjective and man-made conventional method of choice in the space basis functions, we propose to combine the empirical orthogonal function (EOF) analysis with the genetic algorithm to inverse the space basis functions from the actual sequence of fields. A group of trigonometric functions are chosen as a generalized space basis function. With the least-squares error of the basis function and EOF typical fields, and with the complete orthogonality of basis functions, we can get the dual-bound function. A genetic algorithm is then introduced to carry out surface fitting and coefficient optimization of the basis function. As a result, the objective and reasonable constant differential equation of the subtropical high is obtained by inversion. Finally, based on the obtained nonlinear dynamics model, the dynamic behavior and mechanism of the subtropical high is analyzed and discussed under the influence of heat force. We find that solar radiation and zonal differences in land and sea are important factors impacting the potential field and flow field changes of the subtropical areas. These factors lead to strength changes of the subtropical high and medium-term advance/retreat activities. The former is a gradual change, while the latter shows more break characteristics. Meaningful results are obtained in the analysis.展开更多
As one of the typical method for side channel attack,DPA has become a serious trouble for the security of encryption algorithm implementation.The potential capability of DPA attack induces researchers making a lot of ...As one of the typical method for side channel attack,DPA has become a serious trouble for the security of encryption algorithm implementation.The potential capability of DPA attack induces researchers making a lot of efforts in this area,which significantly improved the attack efficiency of DPA.However,most of these efforts were made based on the hypothesis that the gathered power consumption data from the target device were stable and low noise.If large deviation happens in part of the power consumption data sample,the efficiency of DPA attack will be reduced rapidly.In this work,a highly efficient method for DPA attack is proposed with the inspiration of genetic algorithm.Based on the designed fitness function,power consumption data that is stable and less noisy will be selected and the noisy ones will be eliminated.In this way,not only improves the robustness and efficiency of DPA attack,but also reduces the number of samples needed.With experiments on block cipher algorithms of DES and SM4,10%and 12.5%of the number of power consumption curves have been reduced in average with the proposed DPAG algorithm compared to original DPA attack respectively.The high efficiency and correctness of the proposed algorithm and novel model are proved by experiments.展开更多
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 init...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.展开更多
Assessing the slope deformation is significant for landslide prediction. Many researchers have studied the slope displacement based on field data from the inclinometer in combination with complicated numerical analysi...Assessing the slope deformation is significant for landslide prediction. Many researchers have studied the slope displacement based on field data from the inclinometer in combination with complicated numerical analysis. They found that there was a shear zone above the slip surface, and they usually focused on the distribution of velocity and displacement within the shear zone. In this paper,two simple methods are proposed to analyze the distribution of displacement and velocity along the whole profile of a slope from the slip surface to the slope surface during slow movement. In the empirical method, the slope soil above the shear zone is assumed as a rigid body. Dual or triple piecewise fitting functions are empirically proposed for the distribution of velocity along the profile of a slope. In the analytical method, the slope soil is not assumed as a rigid body but as a deformable material. Continuous functions of the velocity and displacement along the profile of a slope are directly obtained by solving the Newton's equation of motion associated with the Bingham model. Using the two proposed methods respectively, the displacement and velocity along the slope profiles of three slopes are determined. A reasonable agreement between the measured data and the calculated results of the two proposed methods has been reached. In comparison with the empirical method, the analytical method would be more beneficial for slope deformation analysis in slope engineering, because the parameters are material constants in the analytical solution independent of time t, and the nonlinear viscosity of the soil can be considered.展开更多
In recent times,internet of things(IoT)applications on the cloud might not be the effective solution for every IoT scenario,particularly for time sensitive applications.A significant alternative to use is edge computi...In recent times,internet of things(IoT)applications on the cloud might not be the effective solution for every IoT scenario,particularly for time sensitive applications.A significant alternative to use is edge computing that resolves the problem of requiring high bandwidth by end devices.Edge computing is considered a method of forwarding the processing and communication resources in the cloud towards the edge.One of the considerations of the edge computing environment is resource management that involves resource scheduling,load balancing,task scheduling,and quality of service(QoS)to accomplish improved performance.With this motivation,this paper presents new soft computing based metaheuristic algorithms for resource scheduling(RS)in the edge computing environment.The SCBMARS model involves the hybridization of the Group Teaching Optimization Algorithm(GTOA)with rat swarm optimizer(RSO)algorithm for optimal resource allocation.The goal of the SCBMA-RS model is to identify and allocate resources to every incoming user request in such a way,that the client’s necessities are satisfied with the minimum number of possible resources and optimal energy consumption.The problem is formulated based on the availability of VMs,task characteristics,and queue dynamics.The integration of GTOA and RSO algorithms assist to improve the allocation of resources among VMs in the data center.For experimental validation,a comprehensive set of simulations were performed using the CloudSim tool.The experimental results showcased the superior performance of the SCBMA-RS model interms of different measures.展开更多
The precision of the kernel independent component analysis( KICA) algorithm depends on the type and parameter values of kernel function. Therefore,it's of great significance to study the choice method of KICA'...The precision of the kernel independent component analysis( KICA) algorithm depends on the type and parameter values of kernel function. Therefore,it's of great significance to study the choice method of KICA's kernel parameters for improving its feature dimension reduction result. In this paper, a fitness function was established by use of the ideal of Fisher discrimination function firstly. Then the global optimal solution of fitness function was searched by particle swarm optimization( PSO) algorithm and a multi-state information dimension reduction algorithm based on PSO-KICA was established. Finally,the validity of this algorithm to enhance the precision of feature dimension reduction has been proven.展开更多
According to traditional card problem solving which is based on the idea of genetic algorithm(GA),a set of algorithms is designed to find final solution.For each process in genetic algorithm,including choices of fitne...According to traditional card problem solving which is based on the idea of genetic algorithm(GA),a set of algorithms is designed to find final solution.For each process in genetic algorithm,including choices of fitness function,parameters determination and coding scheme selection,classic algorithm is used to realize the various steps,and ultimately to find solution of problems.展开更多
Reachability is a key criterion in maintenance design, and human arm is the main object in reachability analysis. The human arm's DOF is reduced, and applying military standards and human physiological constraints, t...Reachability is a key criterion in maintenance design, and human arm is the main object in reachability analysis. The human arm's DOF is reduced, and applying military standards and human physiological constraints, the simplified arm model of 7-DOF using D-H method is built up. Particle Swarm Optimization (PSO) is used to acquire the shoulder, arm and hand posture with adaptive fitness function. A detailed reachability analysis is accomplished for disassembling the bolts from crank shaft is given as an example to validate the feasibility of using teachability analysis on maintenance design.展开更多
Purpose-Current industrial scenario is largely dependent on cloud computing paradigms.On-demand services provided by cloud data centre are paid as per use.Hence,it is very important to make use of the allocated resour...Purpose-Current industrial scenario is largely dependent on cloud computing paradigms.On-demand services provided by cloud data centre are paid as per use.Hence,it is very important to make use of the allocated resources to the maximum.The resource utilization is highly dependent on the allocation of resources to the incoming request.The allocation of requests is done with respect to the physical machines present in the datacenter.While allocating the tasks to these physical machines,it needs to be allocated in such a way that no physical machine is underutilized or over loaded.To make sure of this,optimal load balancing is very important.Design/methodology/approach-The paper proposes an algorithm which makes use of the fitness functions and duopoly game theory to allocate the tasks to the physical machines which can handle the resource requirement of the incoming tasks.The major focus of the proposed work is to optimize the load balancing in a datacenter.When optimization happens,none of the physical machine is neither overloaded nor under-utilized,hence resulting in efficient utilization of the resources.Findings-The performance of the proposed algorithm is compared with different existing load balancing algorithms such as round-robin load(RR)ant colony optimization(ACO),artificial bee colony(ABC)with respect to the selected parameters response time,virtual machine migrations,host shut down and energy consumption.All the four parameters gave a positive result when the algorithm is simulated.Originality/value-The contribution of this paper is towards the domain of cloud load balancing.The paper is proposing a novel approach to optimize the cloud load balancing process.The results obtained show that response time,virtual machine migrations,host shut down and energy consumption are reduced in comparison to few of the existing algorithms selected for the study.The proposed algorithm based on the duopoly function and fitness function brings in an optimized performance compared to the four algorithms analysed.展开更多
基金sponsored by the National General Administration of Sport,China(2015B015,Study on the demonstration community how to keep seniors fit through exercise,2016.1-2018.12).
文摘Objective:We examined the effect of silent myocardial ischemia(SMI)on functional fitness levels and physical independence in 60–79-year-old individuals.Methods:We conducted a cross-sectional study with 716 older adults and used an electrocardiograph and an ambulatory electrocardiogram to diagnose those with SMI.Physical independence was assessed using the Composite Physical Function scale,whereas physical fitness was assessed using the Senior Fitness Test battery.Results:The 60-79-year-old females and males with SMI were more likely to have lower scores for lower and upper body strength,agility/dynamic balance,and aerobic endurance(p<0.05)than those without SMI.The scores for lower and upper body flexibility in all age groups for both genders were not significant(p>0.05).Binary logistic regression analysis revealed that old adults with SMI had a higher risk of losing physical independence later in life than those without SMI(p<0.05).Conclusion:This study showed that individuals with SMI have lower fitness levels and increased risk of losing physical independence than those without SMI.
文摘Recently,vehicular ad hoc networks(VANETs)finds applicability in different domains such as security,rescue operations,intelligent transportation systems(ITS),etc.VANET has unique features like high mobility,limited mobility patterns,adequate topologymodifications,and wireless communication.Despite the benefits of VANET,scalability is a challenging issue which could be addressed by the use of cluster-based routing techniques.It enables the vehicles to perform intercluster communication via chosen CHs and optimal routes.The main drawback of VANET network is the network unsteadiness that results in minimum lifetime.In order to avoid reduced network lifetime in VANET,this paper presents an enhanced metaheuristics based clustering with multihop routing technique for lifetime maximization(EMCMHR-LM)in VANET.The presented EMCMHR-LM model involves the procedure of arranging clusters,cluster head(CH)selection,and route selection appropriate for VANETs.The presentedEMCMHR-LMmodel uses slime mold optimization based clustering(SMO-C)technique to group the vehicles into clusters.Besides,an enhanced wild horse optimization based multihop routing(EWHO-MHR)protocol by the optimization of network parameters.The presented EMCMHR-LMmodel is simulated usingNetwork Simulator(NS3)tool and the simulation outcomes reported the enhanced performance of the proposed EMCMHR-LM technique over the other models.
文摘The nodes in the sensor network have a wide range of uses,particularly on under-sea links that are skilled for detecting,handling as well as management.The underwater wireless sensor networks support collecting pollution data,mine survey,oceanographic information collection,aided navigation,strategic surveillance,and collection of ocean samples using detectors that are submerged inwater.Localization,congestion routing,and prioritizing the traffic is the major issue in an underwater sensor network.Our scheme differentiates the different types of traffic and gives every type of traffic its requirements which is considered regarding network resource.Minimization of localization error using the proposed angle-based forwarding scheme is explained in this paper.We choose the shortest path to the destination using the fitness function which is calculated based on fault ratio,dispatching of packets,power,and distance among the nodes.This work contemplates congestion conscious forwarding using hard stage and soft stage schemes which reduce the congestion by monitoring the status of the energy and buffer of the nodes and controlling the traffic.The study with the use of the ns3 simulator demonstrated that a given algorithm accomplishes superior performance for loss of packet,delay of latency,and power utilization than the existing algorithms.
基金This work was supported by the Ulsan City&Electronics and Telecommunications Research Institute(ETRI)grant funded by the Ulsan City[22AS1600,the development of intelligentization technology for the main industry for manufacturing innovation and Human-mobile-space autonomous collaboration intelligence technology development in industrial sites].
文摘In a vehicular ad hoc network(VANET),a massive quantity of data needs to be transmitted on a large scale in shorter time durations.At the same time,vehicles exhibit high velocity,leading to more vehicle disconnections.Both of these characteristics result in unreliable data communication in VANET.A vehicle clustering algorithm clusters the vehicles in groups employed in VANET to enhance network scalability and connection reliability.Clustering is considered one of the possible solutions for attaining effectual interaction in VANETs.But one such difficulty was reducing the cluster number under increasing transmitting nodes.This article introduces an Evolutionary Hide Objects Game Optimization based Distance Aware Clustering(EHOGO-DAC)Scheme for VANET.The major intention of the EHOGO-DAC technique is to portion the VANET into distinct sets of clusters by grouping vehicles.In addition,the DHOGO-EAC technique is mainly based on the HOGO algorithm,which is stimulated by old games,and the searching agent tries to identify hidden objects in a given space.The DHOGO-EAC technique derives a fitness function for the clustering process,including the total number of clusters and Euclidean distance.The experimental assessment of the DHOGO-EAC technique was carried out under distinct aspects.The comparison outcome stated the enhanced outcomes of the DHOGO-EAC technique compared to recent approaches.
基金supported by Taif University Researchers Supporting Program(Project Number:TURSP-2020/195)Taif University,Saudi Arabia.Princess Nourah bint Abdulrahman University Researchers Supporting Project number(PNURSP2022R203)Princess Nourah bint Abdulrahman University,Riyadh,Saudi Arabia.
文摘The developments of multi-core systems(MCS)have considerably improved the existing technologies in thefield of computer architecture.The MCS comprises several processors that are heterogeneous for resource capacities,working environments,topologies,and so on.The existing multi-core technology unlocks additional research opportunities for energy minimization by the use of effective task scheduling.At the same time,the task scheduling process is yet to be explored in the multi-core systems.This paper presents a new hybrid genetic algorithm(GA)with a krill herd(KH)based energy-efficient scheduling techni-que for multi-core systems(GAKH-SMCS).The goal of the GAKH-SMCS tech-nique is to derive scheduling tasks in such a way to achieve faster completion time and minimum energy dissipation.The GAKH-SMCS model involves a multi-objectivefitness function using four parameters such as makespan,processor utilization,speedup,and energy consumption to schedule tasks proficiently.The performance of the GAKH-SMCS model has been validated against two datasets namely random dataset and benchmark dataset.The experimental outcome ensured the effectiveness of the GAKH-SMCS model interms of makespan,pro-cessor utilization,speedup,and energy consumption.The overall simulation results depicted that the presented GAKH-SMCS model achieves energy effi-ciency by optimal task scheduling process in MCS.
基金The authors extend their appreciation to the Deanship of Scientific Research at King Khalid University for funding this work under grant number(RGP 2/142/43)Princess Nourah bint Abdulrahman University Researchers Supporting Project number(PNURSP2022R237)Princess Nourah bint Abdulrahman University,Riyadh,Saudi Arabia.The authors would like to thank the Deanship of Scientific Research at Umm Al-Qura University for supporting this work by Grant Code:(22UQU4310373DSR14).
文摘Wireless Sensor Networks(WSN)has evolved into a key technology for ubiquitous living and the domain of interest has remained active in research owing to its extensive range of applications.In spite of this,it is challenging to design energy-efficient WSN.The routing approaches are leveraged to reduce the utilization of energy and prolonging the lifespan of network.In order to solve the restricted energy problem,it is essential to reduce the energy utilization of data,transmitted from the routing protocol and improve network development.In this background,the current study proposes a novel Differential Evolution with Arithmetic Optimization Algorithm Enabled Multi-hop Routing Protocol(DEAOA-MHRP)for WSN.The aim of the proposed DEAOA-MHRP model is select the optimal routes to reach the destination in WSN.To accomplish this,DEAOA-MHRP model initially integrates the concepts of Different Evolution(DE)and Arithmetic Optimization Algorithms(AOA)to improve convergence rate and solution quality.Besides,the inclusion of DE in traditional AOA helps in overcoming local optima problems.In addition,the proposed DEAOA-MRP technique derives a fitness function comprising two input variables such as residual energy and distance.In order to ensure the energy efficient performance of DEAOA-MHRP model,a detailed comparative study was conducted and the results established its superior performance over recent approaches.
基金This research work was funded by Institutional Fund Projects under grant no.(IFPIP:14-611-1443)Therefore,the authors gratefully acknowledge technical and financial support provided by the Ministry of Education and Deanship of Scientific Research(DSR),King Abdulaziz University(KAU),Jeddah,Saudi Arabia.
文摘Cognitive radio wireless sensor networks(CRWSN)can be defined as a promising technology for developing bandwidth-limited applications.CRWSN is widely utilized by future Internet of Things(IoT)applications.Since a promising technology,Cognitive Radio(CR)can be modelled to alleviate the spectrum scarcity issue.Generally,CRWSN has cognitive radioenabled sensor nodes(SNs),which are energy limited.Hierarchical clusterrelated techniques for overall network management can be suitable for the scalability and stability of the network.This paper focuses on designing the Modified Dwarf Mongoose Optimization Enabled Energy Aware Clustering(MDMO-EAC)Scheme for CRWSN.The MDMO-EAC technique mainly intends to group the nodes into clusters in the CRWSN.Besides,theMDMOEAC algorithm is based on the dwarf mongoose optimization(DMO)algorithm design with oppositional-based learning(OBL)concept for the clustering process,showing the novelty of the work.In addition,the presented MDMO-EAC algorithm computed a multi-objective function for improved network efficiency.The presented model is validated using a comprehensive range of experiments,and the outcomes were scrutinized in varying measures.The comparison study stated the improvements of the MDMO-EAC method over other recent approaches.
基金supported by the National Natural Science Foundation of China (60873069 61171132)+3 种基金the Jiangsu Government Scholarship for Overseas Studies (JS-2010-K005)the Funding of Jiangsu Innovation Program for Graduate Education (CXZZ11 0219)the Open Project Program of Jiangsu Provincial Key Laboratory of Computer Information Processing Technology (KJS1023)the Applying Study Foundation of Nantong (BK2011062)
文摘Particle swarm optimization (PSO) is a new heuristic algorithm which has been applied to many optimization problems successfully. Attribute reduction is a key studying point of the rough set theory, and it has been proven that computing minimal reduc- tion of decision tables is a non-derterministic polynomial (NP)-hard problem. A new cooperative extended attribute reduction algorithm named Co-PSAR based on improved PSO is proposed, in which the cooperative evolutionary strategy with suitable fitness func- tions is involved to learn a good hypothesis for accelerating the optimization of searching minimal attribute reduction. Experiments on Benchmark functions and University of California, Irvine (UCI) data sets, compared with other algorithms, verify the superiority of the Co-PSAR algorithm in terms of the convergence speed, efficiency and accuracy for the attribute reduction.
文摘Forecasting crop yields based on remote sensing data is one of the most important tasks in agriculture.Soybean is the main crop in the Russian Far East.It is desirable to forecast soybean yield as early as possible while maintaining high accuracy.This study aimed to investigate seasonal time series of the normalized difference vegetation index(NDVI) to achieve early forecasting of soybean yield.This research used data from the Moderate Resolution Image Spectroradiometer(MODIS),an arable-land mask obtained from the VEGA-Science web service,and soybean yield data for 2008-2017 for the Jewish Autonomous Region(JAR) districts.Four approximating functions were fitted to model the NDVI time series:Gaussian,double logistic(DL),and quadratic and cubic polynomials.In the period from calendar weeks 22-42(end of May to mid-October),averaged over two districts,the model using the DL function showed the highest accuracy(mean absolute percentage error-4.0%,root mean square error(RMSE)-0.029,P <0.01).The yield forecast accuracy of prediction in the period of weeks 25-30 in JAR municipalities using the parameters of the Gaussian function was higher(P <0.05) than that using the other functions.The mean forecast error for the Gaussian function was 14.9% in week 25(RMSE was0.21 t ha) and 5.1%-12.9% in weeks 26-30(RMSE varied from 0.06 to 0.15 t ha) according to the2013-2017 data.In weeks 31-32,the error was 5.0%-5.4%(RMSE was 0.07 t ha) using the Gaussian parameters and 7.4%-7.7%(RMSE was 0.09-0.11 t ha) for the DL function.When the method was applied to municipal districts of other soy-producing regions of the Russian Far East.RMSE was0.14-0.32 t hain weeks 25-26 and did not exceed 0.20 t hain subsequent weeks.
基金supported by the National Natural Science Foundation of China(No.60803049,60472060)
文摘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.
文摘The three-layer forward neural networks are used to establish the inverse kinematics models of robot manipulators. The fuzzy genetic algorithm based on the linear scaling of the fitness value is presented to update the weights of neural networks. To increase the search speed of the algorithm, the crossover probability and the mutation probability are adjusted through fuzzy control and the fitness is modified by the linear scaling method in FGA. Simulations show that the proposed method improves considerably the precision of the inverse kinematics solutions for robot manipulators and guarantees a rapid global convergence and overcomes the drawbacks of SGA and the BP algorithm.
基金supported by the Joint Plan to Subsidize Innovative Young Scholars of the Chinese Academy of Sciences (No. IAP09305)
文摘To analyze the dynamic mechanism of unusual activities of the subtropical high, the space-time varible separation of the partial differential vortex equations is carried out with Galerkin methods based on the heat force and the whirl movement dissipation effect. Aiming at the subjective and man-made conventional method of choice in the space basis functions, we propose to combine the empirical orthogonal function (EOF) analysis with the genetic algorithm to inverse the space basis functions from the actual sequence of fields. A group of trigonometric functions are chosen as a generalized space basis function. With the least-squares error of the basis function and EOF typical fields, and with the complete orthogonality of basis functions, we can get the dual-bound function. A genetic algorithm is then introduced to carry out surface fitting and coefficient optimization of the basis function. As a result, the objective and reasonable constant differential equation of the subtropical high is obtained by inversion. Finally, based on the obtained nonlinear dynamics model, the dynamic behavior and mechanism of the subtropical high is analyzed and discussed under the influence of heat force. We find that solar radiation and zonal differences in land and sea are important factors impacting the potential field and flow field changes of the subtropical areas. These factors lead to strength changes of the subtropical high and medium-term advance/retreat activities. The former is a gradual change, while the latter shows more break characteristics. Meaningful results are obtained in the analysis.
基金This work was supported by National Key R&D Program of China(Grant No.2017YFB0802000)National Natural Science Foundation of China(Grant No.U1636114,61772550,61572521)National Cryptography Development Fund of China(Grant No.MMJJ20170112).
文摘As one of the typical method for side channel attack,DPA has become a serious trouble for the security of encryption algorithm implementation.The potential capability of DPA attack induces researchers making a lot of efforts in this area,which significantly improved the attack efficiency of DPA.However,most of these efforts were made based on the hypothesis that the gathered power consumption data from the target device were stable and low noise.If large deviation happens in part of the power consumption data sample,the efficiency of DPA attack will be reduced rapidly.In this work,a highly efficient method for DPA attack is proposed with the inspiration of genetic algorithm.Based on the designed fitness function,power consumption data that is stable and less noisy will be selected and the noisy ones will be eliminated.In this way,not only improves the robustness and efficiency of DPA attack,but also reduces the number of samples needed.With experiments on block cipher algorithms of DES and SM4,10%and 12.5%of the number of power consumption curves have been reduced in average with the proposed DPAG algorithm compared to original DPA attack respectively.The high efficiency and correctness of the proposed algorithm and novel model are proved by experiments.
文摘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.
基金supported by the National Natural Science Foundation of China(Grant No.51579167)the Public Non-profit Welfare Project from China Ministry of Water Resources(Grant No.201301022)the Key Laboratory of Failure Mechanism and Safety Control Techniques of Earth-rock Dam of the Ministry of Water Resources(Grant No.YK915003)
文摘Assessing the slope deformation is significant for landslide prediction. Many researchers have studied the slope displacement based on field data from the inclinometer in combination with complicated numerical analysis. They found that there was a shear zone above the slip surface, and they usually focused on the distribution of velocity and displacement within the shear zone. In this paper,two simple methods are proposed to analyze the distribution of displacement and velocity along the whole profile of a slope from the slip surface to the slope surface during slow movement. In the empirical method, the slope soil above the shear zone is assumed as a rigid body. Dual or triple piecewise fitting functions are empirically proposed for the distribution of velocity along the profile of a slope. In the analytical method, the slope soil is not assumed as a rigid body but as a deformable material. Continuous functions of the velocity and displacement along the profile of a slope are directly obtained by solving the Newton's equation of motion associated with the Bingham model. Using the two proposed methods respectively, the displacement and velocity along the slope profiles of three slopes are determined. A reasonable agreement between the measured data and the calculated results of the two proposed methods has been reached. In comparison with the empirical method, the analytical method would be more beneficial for slope deformation analysis in slope engineering, because the parameters are material constants in the analytical solution independent of time t, and the nonlinear viscosity of the soil can be considered.
基金This research was supported by Hankuk University of Foreign Studies Research Fund of 2021.Also,This research was supported by the MIST(Ministry of Science,ICT),Korea,under the National Program for Excellence in SW),supervised by the IITP(Institute of Information&communications Technology Planing&Evaluation)in 2021”(2019-0-01816).
文摘In recent times,internet of things(IoT)applications on the cloud might not be the effective solution for every IoT scenario,particularly for time sensitive applications.A significant alternative to use is edge computing that resolves the problem of requiring high bandwidth by end devices.Edge computing is considered a method of forwarding the processing and communication resources in the cloud towards the edge.One of the considerations of the edge computing environment is resource management that involves resource scheduling,load balancing,task scheduling,and quality of service(QoS)to accomplish improved performance.With this motivation,this paper presents new soft computing based metaheuristic algorithms for resource scheduling(RS)in the edge computing environment.The SCBMARS model involves the hybridization of the Group Teaching Optimization Algorithm(GTOA)with rat swarm optimizer(RSO)algorithm for optimal resource allocation.The goal of the SCBMA-RS model is to identify and allocate resources to every incoming user request in such a way,that the client’s necessities are satisfied with the minimum number of possible resources and optimal energy consumption.The problem is formulated based on the availability of VMs,task characteristics,and queue dynamics.The integration of GTOA and RSO algorithms assist to improve the allocation of resources among VMs in the data center.For experimental validation,a comprehensive set of simulations were performed using the CloudSim tool.The experimental results showcased the superior performance of the SCBMA-RS model interms of different measures.
文摘The precision of the kernel independent component analysis( KICA) algorithm depends on the type and parameter values of kernel function. Therefore,it's of great significance to study the choice method of KICA's kernel parameters for improving its feature dimension reduction result. In this paper, a fitness function was established by use of the ideal of Fisher discrimination function firstly. Then the global optimal solution of fitness function was searched by particle swarm optimization( PSO) algorithm and a multi-state information dimension reduction algorithm based on PSO-KICA was established. Finally,the validity of this algorithm to enhance the precision of feature dimension reduction has been proven.
文摘According to traditional card problem solving which is based on the idea of genetic algorithm(GA),a set of algorithms is designed to find final solution.For each process in genetic algorithm,including choices of fitness function,parameters determination and coding scheme selection,classic algorithm is used to realize the various steps,and ultimately to find solution of problems.
基金Supported by National Natural Science Funds (50705096)
文摘Reachability is a key criterion in maintenance design, and human arm is the main object in reachability analysis. The human arm's DOF is reduced, and applying military standards and human physiological constraints, the simplified arm model of 7-DOF using D-H method is built up. Particle Swarm Optimization (PSO) is used to acquire the shoulder, arm and hand posture with adaptive fitness function. A detailed reachability analysis is accomplished for disassembling the bolts from crank shaft is given as an example to validate the feasibility of using teachability analysis on maintenance design.
文摘Purpose-Current industrial scenario is largely dependent on cloud computing paradigms.On-demand services provided by cloud data centre are paid as per use.Hence,it is very important to make use of the allocated resources to the maximum.The resource utilization is highly dependent on the allocation of resources to the incoming request.The allocation of requests is done with respect to the physical machines present in the datacenter.While allocating the tasks to these physical machines,it needs to be allocated in such a way that no physical machine is underutilized or over loaded.To make sure of this,optimal load balancing is very important.Design/methodology/approach-The paper proposes an algorithm which makes use of the fitness functions and duopoly game theory to allocate the tasks to the physical machines which can handle the resource requirement of the incoming tasks.The major focus of the proposed work is to optimize the load balancing in a datacenter.When optimization happens,none of the physical machine is neither overloaded nor under-utilized,hence resulting in efficient utilization of the resources.Findings-The performance of the proposed algorithm is compared with different existing load balancing algorithms such as round-robin load(RR)ant colony optimization(ACO),artificial bee colony(ABC)with respect to the selected parameters response time,virtual machine migrations,host shut down and energy consumption.All the four parameters gave a positive result when the algorithm is simulated.Originality/value-The contribution of this paper is towards the domain of cloud load balancing.The paper is proposing a novel approach to optimize the cloud load balancing process.The results obtained show that response time,virtual machine migrations,host shut down and energy consumption are reduced in comparison to few of the existing algorithms selected for the study.The proposed algorithm based on the duopoly function and fitness function brings in an optimized performance compared to the four algorithms analysed.