A genetic algorithm-based joint inversion method is presented for evaluating hydrocarbon-bearing geological formations. Conventional inversion procedures routinely used in the oil industry perform the inversion proces...A genetic algorithm-based joint inversion method is presented for evaluating hydrocarbon-bearing geological formations. Conventional inversion procedures routinely used in the oil industry perform the inversion processing of borehole geophysical data locally. As having barely more types of data than unknowns in a depth, a set of marginally over-determined inverse problems has to be solved along a borehole, which is a rather noise sensitive procedure. For the reduction of noise effect, the amount of overdetermination must be increased. To fulfill this requirement, we suggest the use of our interval inversion method, which inverts simultaneously all data from a greater depth interval to estimate petrophysical parameters of reservoirs to the same interval. A series expansion based discretization scheme ensures much more data against unknowns that significantly reduces the estimation error of model parameters. The knowledge of reservoir boundaries is also required for reserve calculation. Well logs contain information about layer-thicknesses, but they cannot be extracted by the local inversion approach. We showed earlier that the depth coordinates of layerboundaries can be determined within the interval inversion procedure. The weakness of method is that the output of inversion is highly influenced by arbitrary assumptions made for layer-thicknesses when creating a starting model (i.e. number of layers, search domain of thicknesses). In this study, we apply an automated procedure for the determination of rock interfaces. We perform multidimensional hierarchical cluster analysis on well-logging data before inversion that separates the measuring points of different layers on a lithological basis. As a result, the vertical distribution of clusters furnishes the coordinates of layer-boundaries, which are then used as initial model parameters for the interval inversion procedure. The improved inversion method gives a fast, automatic and objective estimation to layer-boundaries and petrophysical parameters, which is demonstrated by a hydrocarbon field example.展开更多
To address the shortcomings of traditional Genetic Algorithm (GA) in multi-agent path planning, such as prolonged planning time, slow convergence, and solution instability, this paper proposes an Asynchronous Genetic ...To address the shortcomings of traditional Genetic Algorithm (GA) in multi-agent path planning, such as prolonged planning time, slow convergence, and solution instability, this paper proposes an Asynchronous Genetic Algorithm (AGA) to solve multi-agent path planning problems effectively. To enhance the real-time performance and computational efficiency of Multi-Agent Systems (MAS) in path planning, the AGA incorporates an Equal-Size Clustering Algorithm (ESCA) based on the K-means clustering method. The ESCA divides the primary task evenly into a series of subtasks, thereby reducing the gene length in the subsequent GA process. The algorithm then employs GA to solve each subtask sequentially. To evaluate the effectiveness of the proposed method, a simulation program was designed to perform path planning for 100 trajectories, and the results were compared with those of State-Of-The-Art (SOTA) methods. The simulation results demonstrate that, although the solutions provided by AGA are suboptimal, it exhibits significant advantages in terms of execution speed and solution stability compared to other algorithms.展开更多
Correlation power analysis(CPA)combined with genetic algorithms(GA)now achieves greater attack efficiency and can recover all subkeys simultaneously.However,two issues in GA-based CPA still need to be addressed:key de...Correlation power analysis(CPA)combined with genetic algorithms(GA)now achieves greater attack efficiency and can recover all subkeys simultaneously.However,two issues in GA-based CPA still need to be addressed:key degeneration and slow evolution within populations.These challenges significantly hinder key recovery efforts.This paper proposes a screening correlation power analysis framework combined with a genetic algorithm,named SFGA-CPA,to address these issues.SFGA-CPA introduces three operations designed to exploit CPA characteris-tics:propagative operation,constrained crossover,and constrained mutation.Firstly,the propagative operation accelerates population evolution by maximizing the number of correct bytes in each individual.Secondly,the constrained crossover and mutation operations effectively address key degeneration by preventing the compromise of correct bytes.Finally,an intelligent search method is proposed to identify optimal parameters,further improving attack efficiency.Experiments were conducted on both simulated environments and real power traces collected from the SAKURA-G platform.In the case of simulation,SFGA-CPA reduces the number of traces by 27.3%and 60%compared to CPA based on multiple screening methods(MS-CPA)and CPA based on simple GA method(SGA-CPA)when the success rate reaches 90%.Moreover,real experimental results on the SAKURA-G platform demonstrate that our approach outperforms other methods.展开更多
In this research,an integrated classification method based on principal component analysis-simulated annealing genetic algorithm-fuzzy cluster means(PCA-SAGA-FCM)was proposed for the unsupervised classification of tig...In this research,an integrated classification method based on principal component analysis-simulated annealing genetic algorithm-fuzzy cluster means(PCA-SAGA-FCM)was proposed for the unsupervised classification of tight sandstone reservoirs which lack the prior information and core experiments.A variety of evaluation parameters were selected,including lithology characteristic parameters,poro-permeability quality characteristic parameters,engineering quality characteristic parameters,and pore structure characteristic parameters.The PCA was used to reduce the dimension of the evaluation pa-rameters,and the low-dimensional data was used as input.The unsupervised reservoir classification of tight sandstone reservoir was carried out by the SAGA-FCM,the characteristics of reservoir at different categories were analyzed and compared with the lithological profiles.The analysis results of numerical simulation and actual logging data show that:1)compared with FCM algorithm,SAGA-FCM has stronger stability and higher accuracy;2)the proposed method can cluster the reservoir flexibly and effectively according to the degree of membership;3)the results of reservoir integrated classification match well with the lithologic profle,which demonstrates the reliability of the classification method.展开更多
The K-means method is one of the most widely used clustering methods and has been implemented in many fields of science and technology. One of the major problems of the k-means algorithm is that it may produce empty c...The K-means method is one of the most widely used clustering methods and has been implemented in many fields of science and technology. One of the major problems of the k-means algorithm is that it may produce empty clusters depending on initial center vectors. Genetic Algorithms (GAs) are adaptive heuristic search algorithm based on the evolutionary principles of natural selection and genetics. This paper presents a hybrid version of the k-means algorithm with GAs that efficiently eliminates this empty cluster problem. Results of simulation experiments using several data sets prove our claim.展开更多
Surface wave inversion is a key step in the application of surface waves to soil velocity profiling.Currently,a common practice for the process of inversion is that the number of soil layers is assumed to be known bef...Surface wave inversion is a key step in the application of surface waves to soil velocity profiling.Currently,a common practice for the process of inversion is that the number of soil layers is assumed to be known before using heuristic search algorithms to compute the shear wave velocity profile or the number of soil layers is considered as an optimization variable.However,an improper selection of the number of layers may lead to an incorrect shear wave velocity profile.In this study,a deep learning and genetic algorithm hybrid learning procedure is proposed to perform the surface wave inversion without the need to assume the number of soil layers.First,a deep neural network is adapted to learn from a large number of synthetic dispersion curves for inferring the layer number.Then,the shear-wave velocity profile is determined by a genetic algorithm with the known layer number.By applying this procedure to both simulated and real-world cases,the results indicate that the proposed method is reliable and efficient for surface wave inversion.展开更多
The existing research of sequential zoning system and simultaneous zoning system mainly focuses on some optimization problems such as workload balance,product assignment and simulation for each system separately.But t...The existing research of sequential zoning system and simultaneous zoning system mainly focuses on some optimization problems such as workload balance,product assignment and simulation for each system separately.But there is little research on comparative study between sequential zoning and simultaneous zoning.In order to help the designers to choose the suitable zoning policy for picker-to-parts system reasonably and quickly,a systemic selection method is presented.Essentially,both zoning and batching are order clustering,so the customer order sheet can be divided into many unit grids.After the time formulation in one-dimensional unit was defined,the time models for each zoning policy in two-dimensional space were established using filling curves and sequence models to link the one-dimensional unit grids.In consideration of "U" shaped dual tour into consideration,the subtraction value of order picking time between sequential zoning and simultaneous zoning was defined as the objective function to select the suitable zoning policy based on time models.As it is convergent enough,genetic algorithm is adopted to find the optimal value of order picking time.In the experimental study,5 different kinds of order/stock keeping unit(SKU) matrices with different densities d and quantities q following uniform distribution were created in order to test the suitability of sequential zoning and simultaneous zoning to different kinds of orders.After parameters setting,experimental orders inputting and iterative computations,the optimal order picking time for each zoning policy was gotten.By observing whether the delta time between them is greater than 0 or not,the suitability of zoning policies for picker-to-parts system were obtained.The significant effect of batch size b,zone number z and density d on suitability was also found by experimental study.The proposed research provides a new method for selection between sequential zoning and simultaneous zoning for picker-to-parts system,and improves the rationality and efficiency of selection process in practical design.展开更多
It is significant to combine multiple tasks into an optimal work package in decision-making of aircraft maintenance to reduce cost,so a cost rate model of combinatorial maintenance is an urgent need.However,the optima...It is significant to combine multiple tasks into an optimal work package in decision-making of aircraft maintenance to reduce cost,so a cost rate model of combinatorial maintenance is an urgent need.However,the optimal combination under various constraints not only involves numerical calculations but also is an NP-hard combinatorial problem.To solve the problem,an adaptive genetic algorithm based on cluster search,which is divided into two phases,is put forward.In the first phase,according to the density,all individuals can be homogeneously scattered over the whole solution space through crossover and mutation and better individuals are collected as candidate cluster centres.In the second phase,the search is confined to the neighbourhood of some selected possible solutions to accurately solve with cluster radius decreasing slowly,meanwhile all clusters continuously move to better regions until all the peaks in the question space is searched.This algorithm can efficiently solve the combination problem.Taking the optimization on decision-making of aircraft maintenance by the algorithm for an example,maintenance which combines multiple parts or tasks can significantly enhance economic benefit when the halt cost is rather high.展开更多
Recognition of substrates in cobalt crust mining areas can improve mining efficiency.Aiming at the problem of unsatisfactory performance of using single feature to recognize the seabed material of the cobalt crust min...Recognition of substrates in cobalt crust mining areas can improve mining efficiency.Aiming at the problem of unsatisfactory performance of using single feature to recognize the seabed material of the cobalt crust mining area,a method based on multiple-feature sets is proposed.Features of the target echoes are extracted by linear prediction method and wavelet analysis methods,and the linear prediction coefficient and linear prediction cepstrum coefficient are also extracted.Meanwhile,the characteristic matrices of modulus maxima,sub-band energy and multi-resolution singular spectrum entropy are obtained,respectively.The resulting features are subsequently compressed by kernel Fisher discriminant analysis(KFDA),the output features are selected using genetic algorithm(GA)to obtain optimal feature subsets,and recognition results of classifier are chosen as genetic fitness function.The advantages of this method are that it can describe the signal features more comprehensively and select the favorable features and remove the redundant features to the greatest extent.The experimental results show the better performance of the proposed method in comparison with only using KFDA or GA.展开更多
There are various intense forces causing customers to use evaluated data when using social media platforms and microblogging sites.Today,customers throughout the world share their points of view on all kinds of topics...There are various intense forces causing customers to use evaluated data when using social media platforms and microblogging sites.Today,customers throughout the world share their points of view on all kinds of topics through these sources.The massive volume of data created by these customers makes it impossible to analyze such data manually.Therefore,an efficient and intelligent method for evaluating social media data and their divergence needs to be developed.Today,various types of equipment and techniques are available for automatically estimating the classification of sentiments.Sentiment analysis involves determining people’s emotions using facial expressions.Sentiment analysis can be performed for any individual based on specific incidents.The present study describes the analysis of an image dataset using CNNswithPCA intended to detect people’s sentiments(specifically,whether a person is happy or sad).This process is optimized using a genetic algorithm to get better results.Further,a comparative analysis has been conducted between the different models generated by changing the mutation factor,performing batch normalization,and applying feature reduction using PCA.These steps are carried out across five experiments using theKaggledataset.The maximum accuracy obtained is 96.984%,which is associated with the Happy and Sad sentiments.展开更多
The imbalance of energy consumption in wireless sensor networks(WSNs)easily results in the“hot spot”problem that the sensor nodes in a particular area die due to fast energy consumption.In order to solve the“hot s...The imbalance of energy consumption in wireless sensor networks(WSNs)easily results in the“hot spot”problem that the sensor nodes in a particular area die due to fast energy consumption.In order to solve the“hot spot”problem in WSNs,we propose an unequal clustering routing algorithm based on genetic algorithm(UCR-GA).In the cluster head election phase,the fitness function is constructed based on the residual energy,density and distance between nodes and base station,and the appropriate node is selected as the cluster head.In the data transmission phase,the cluster head selects single-hop or multi-hop communication mode according to the distance to the base station.After we comprehensively consider the residual energy of the cluster head and its communication energy consumption with the base station,an appropriate relay node is selected.The designed protocal is simulated under energy homogeneous and energy heterogeneity conditions,and the results show that the proposed routing protocal can effectively balance energy consumption,prolong the life cycle of network,and is appicable to heterogeneous networks.展开更多
Smart contract has greatly improved the services and capabilities of blockchain,but it has become the weakest link of blockchain security because of its code nature.Therefore,efficient vulnerability detection of smart...Smart contract has greatly improved the services and capabilities of blockchain,but it has become the weakest link of blockchain security because of its code nature.Therefore,efficient vulnerability detection of smart contract is the key to ensure the security of blockchain system.Oriented to Ethereum smart contract,the study solves the problems of redundant input and low coverage in the smart contract fuzz.In this paper,a taint analysis method based on EVM is proposed to reduce the invalid input,a dangerous operation database is designed to identify the dangerous input,and genetic algorithm is used to optimize the code coverage of the input,which construct the fuzzing framework for smart contract together.Finally,by comparing Oyente and ContractFuzzer,the performance and efficiency of the framework are proved.展开更多
In this study. an automated conformer selection procedure using generic algorithm (GA) has been applied in comparative molecular field analysis (CoMFA) method. Using genetic algorithm. the 3D-QSAR model is optimized t...In this study. an automated conformer selection procedure using generic algorithm (GA) has been applied in comparative molecular field analysis (CoMFA) method. Using genetic algorithm. the 3D-QSAR model is optimized to an optimal one. From the calculation results, a group of QSAR models with high predictive ability can be obtained, which is superior than using conventional CoMFA: meanwhile. the active conformers for these compounds in data set can be determined fi om the best model.展开更多
Pattern discovery from the seasonal time-series is of importance. Traditionally, most of the algorithms of pattern discovery in time series are similar. A novel mode of time series is proposed which integrates the Gen...Pattern discovery from the seasonal time-series is of importance. Traditionally, most of the algorithms of pattern discovery in time series are similar. A novel mode of time series is proposed which integrates the Genetic Algorithm (GA) for the actual problem. The experiments on the electric power yield sequence models show that this algorithm is practicable and effective.展开更多
In this paper Genetic Algorithm has been integrated with Fouquet modal analysis to optimize radiation pattern of coupled periodic antenna. Floquet analysis is used with MoM-GEC (Moment-Generalized Equivalent Circuit) ...In this paper Genetic Algorithm has been integrated with Fouquet modal analysis to optimize radiation pattern of coupled periodic antenna. Floquet analysis is used with MoM-GEC (Moment-Generalized Equivalent Circuit) method to study a finite periodic array with uniform amplitude and linear phase distribution. This method is very advantageous for studying large antenna array since it considerably reduces the computation time and the number of operations. In this way, Genetic algorithm is introduced and combined with Floquet analysis to optimize the radiation pattern distribution of this coupled periodic antenna. The goal of the optimization is to provide a better radiation characteristic for the coupled periodic antenna with maximum side lobe level reduction.展开更多
Smart contract has greatly improved the services and capabilities of blockchain,but it has become the weakest link of blockchain security because of its code nature.Therefore,efficient vulnerability detection of smart...Smart contract has greatly improved the services and capabilities of blockchain,but it has become the weakest link of blockchain security because of its code nature.Therefore,efficient vulnerability detection of smart contract is the key to ensure the security of blockchain system.Oriented to Ethereum smart contract,the study solves the problems of redundant input and low coverage in the smart contract fuzz.In this paper,a taint analysis method based on EVM is proposed to reduce the invalid input,a dangerous operation database is designed to identify the dangerous input,and genetic algorithm is used to optimize the code coverage of the input,which construct the fuzzing framework for smart contract together.Finally,by comparing Oyente and ContractFuzzer,the performance and efficiency of the framework are proved.展开更多
Although the genetic algorithm (GA) has very powerful robustness and fitness, it needs a large size of population and a large number of iterations to reach the optimum result. Especially when GA is used in complex str...Although the genetic algorithm (GA) has very powerful robustness and fitness, it needs a large size of population and a large number of iterations to reach the optimum result. Especially when GA is used in complex structural optimization problems, if the structural reanalysis technique is not adopted, the more the number of finite element analysis (FEA) is, the more the consuming time is. In the conventional structural optimization the number of FEA can be reduced by the structural reanalysis technique based on the approximation techniques and sensitivity analysis. With these techniques, this paper provides a new approximation model-segment approximation model, adopted for the GA application. This segment approximation model can decrease the number of FEA and increase the convergence rate of GA. So it can apparently decrease the computation time of GA. Two examples demonstrate the availability of the new segment approximation model.展开更多
This paper examines the optimization of the lifetime and energy consumption of Wireless Sensor Networks (WSNs). These two competing objectives have a deep influence over the service qualification of networks and accor...This paper examines the optimization of the lifetime and energy consumption of Wireless Sensor Networks (WSNs). These two competing objectives have a deep influence over the service qualification of networks and according to recent studies, cluster formation is an appropriate solution for their achievement. To transmit aggregated data to the Base Station (BS), logical nodes called Cluster Heads (CHs) are required to relay data from the fixed-range sensing nodes located in the ground to high altitude aircraft. This study investigates the Genetic Algorithm (GA) as a dynamic technique to find optimum states. It is a simple framework that includes a proposed mathematical formula, which increasing in coverage is benchmarked against lifetime. Finally, the implementation of the proposed algorithm indicates a better efficiency compared to other simulated works.展开更多
Parkinson’s disease (PD) is the most common disease of motor system degeneration that occurs when the dopamine-producing cells are damaged in substantia nigra. To detect PD, various signals have been investigated, in...Parkinson’s disease (PD) is the most common disease of motor system degeneration that occurs when the dopamine-producing cells are damaged in substantia nigra. To detect PD, various signals have been investigated, including EEG, gait and speech. Since approximately 90 percent of the people with PD suffer from speech disorders, speech analysis is considered as the most common technique for this aim. This paper proposes a new algorithm for diagnosing of Parkinson’s disease based on voice analysis. In the first step, genetic algorithm (GA) is undertaken for selecting optimized features from all extracted features. Afterwards a network based on support vector machine (SVM) is used for classification between healthy and people with Parkinson. The dataset of this research is composed of a range of biomedical voice signals from 31 people, 23 with Parkinson’s disease and 8 healthy people. The subjects were asked to pronounce letter “A” for 3 seconds. 22 linear and non-linear features were extracted from the signals that 14 features were based on F0 (fundamental frequency or pitch), jitter, shimmer and noise to harmonics ratio, which are main factors in voice signal. Because changing in these factors is noticeable for the people with PD, optimized features were selected among them. Of the various numbers of optimized features, the data classification was investigated. Results show that the classification accuracy percent of 94.50 per 4 optimized features, the accuracy percent of 93.66 per 7 optimized features and the accuracy percent of 94.22 per 9 optimized features, could be achieved. It can be observed that the best classification accuracy may be achieved using Fhi (Hz), Fho (Hz), jitter (RAP) and shimmer (APQ5).展开更多
文摘A genetic algorithm-based joint inversion method is presented for evaluating hydrocarbon-bearing geological formations. Conventional inversion procedures routinely used in the oil industry perform the inversion processing of borehole geophysical data locally. As having barely more types of data than unknowns in a depth, a set of marginally over-determined inverse problems has to be solved along a borehole, which is a rather noise sensitive procedure. For the reduction of noise effect, the amount of overdetermination must be increased. To fulfill this requirement, we suggest the use of our interval inversion method, which inverts simultaneously all data from a greater depth interval to estimate petrophysical parameters of reservoirs to the same interval. A series expansion based discretization scheme ensures much more data against unknowns that significantly reduces the estimation error of model parameters. The knowledge of reservoir boundaries is also required for reserve calculation. Well logs contain information about layer-thicknesses, but they cannot be extracted by the local inversion approach. We showed earlier that the depth coordinates of layerboundaries can be determined within the interval inversion procedure. The weakness of method is that the output of inversion is highly influenced by arbitrary assumptions made for layer-thicknesses when creating a starting model (i.e. number of layers, search domain of thicknesses). In this study, we apply an automated procedure for the determination of rock interfaces. We perform multidimensional hierarchical cluster analysis on well-logging data before inversion that separates the measuring points of different layers on a lithological basis. As a result, the vertical distribution of clusters furnishes the coordinates of layer-boundaries, which are then used as initial model parameters for the interval inversion procedure. The improved inversion method gives a fast, automatic and objective estimation to layer-boundaries and petrophysical parameters, which is demonstrated by a hydrocarbon field example.
文摘To address the shortcomings of traditional Genetic Algorithm (GA) in multi-agent path planning, such as prolonged planning time, slow convergence, and solution instability, this paper proposes an Asynchronous Genetic Algorithm (AGA) to solve multi-agent path planning problems effectively. To enhance the real-time performance and computational efficiency of Multi-Agent Systems (MAS) in path planning, the AGA incorporates an Equal-Size Clustering Algorithm (ESCA) based on the K-means clustering method. The ESCA divides the primary task evenly into a series of subtasks, thereby reducing the gene length in the subsequent GA process. The algorithm then employs GA to solve each subtask sequentially. To evaluate the effectiveness of the proposed method, a simulation program was designed to perform path planning for 100 trajectories, and the results were compared with those of State-Of-The-Art (SOTA) methods. The simulation results demonstrate that, although the solutions provided by AGA are suboptimal, it exhibits significant advantages in terms of execution speed and solution stability compared to other algorithms.
基金supported by the Hunan Provincial Natrual Science Foundation of China(2022JJ30103)“the 14th Five-Year”Key Disciplines and Application Oriented Special Disciplines of Hunan Province(Xiangjiaotong[2022],351)the Science and Technology Innovation Program of Hunan Province(2016TP1020).
文摘Correlation power analysis(CPA)combined with genetic algorithms(GA)now achieves greater attack efficiency and can recover all subkeys simultaneously.However,two issues in GA-based CPA still need to be addressed:key degeneration and slow evolution within populations.These challenges significantly hinder key recovery efforts.This paper proposes a screening correlation power analysis framework combined with a genetic algorithm,named SFGA-CPA,to address these issues.SFGA-CPA introduces three operations designed to exploit CPA characteris-tics:propagative operation,constrained crossover,and constrained mutation.Firstly,the propagative operation accelerates population evolution by maximizing the number of correct bytes in each individual.Secondly,the constrained crossover and mutation operations effectively address key degeneration by preventing the compromise of correct bytes.Finally,an intelligent search method is proposed to identify optimal parameters,further improving attack efficiency.Experiments were conducted on both simulated environments and real power traces collected from the SAKURA-G platform.In the case of simulation,SFGA-CPA reduces the number of traces by 27.3%and 60%compared to CPA based on multiple screening methods(MS-CPA)and CPA based on simple GA method(SGA-CPA)when the success rate reaches 90%.Moreover,real experimental results on the SAKURA-G platform demonstrate that our approach outperforms other methods.
基金funded by the National Natural Science Foundation of China(42174131)the Strategic Cooperation Technology Projects of CNPC and CUPB(ZLZX2020-03).
文摘In this research,an integrated classification method based on principal component analysis-simulated annealing genetic algorithm-fuzzy cluster means(PCA-SAGA-FCM)was proposed for the unsupervised classification of tight sandstone reservoirs which lack the prior information and core experiments.A variety of evaluation parameters were selected,including lithology characteristic parameters,poro-permeability quality characteristic parameters,engineering quality characteristic parameters,and pore structure characteristic parameters.The PCA was used to reduce the dimension of the evaluation pa-rameters,and the low-dimensional data was used as input.The unsupervised reservoir classification of tight sandstone reservoir was carried out by the SAGA-FCM,the characteristics of reservoir at different categories were analyzed and compared with the lithological profiles.The analysis results of numerical simulation and actual logging data show that:1)compared with FCM algorithm,SAGA-FCM has stronger stability and higher accuracy;2)the proposed method can cluster the reservoir flexibly and effectively according to the degree of membership;3)the results of reservoir integrated classification match well with the lithologic profle,which demonstrates the reliability of the classification method.
文摘The K-means method is one of the most widely used clustering methods and has been implemented in many fields of science and technology. One of the major problems of the k-means algorithm is that it may produce empty clusters depending on initial center vectors. Genetic Algorithms (GAs) are adaptive heuristic search algorithm based on the evolutionary principles of natural selection and genetics. This paper presents a hybrid version of the k-means algorithm with GAs that efficiently eliminates this empty cluster problem. Results of simulation experiments using several data sets prove our claim.
基金provided through research grant No.0035/2019/A1 from the Science and Technology Development Fund,Macao SARthe assistantship from the Faculty of Science and Technology,University of Macao。
文摘Surface wave inversion is a key step in the application of surface waves to soil velocity profiling.Currently,a common practice for the process of inversion is that the number of soil layers is assumed to be known before using heuristic search algorithms to compute the shear wave velocity profile or the number of soil layers is considered as an optimization variable.However,an improper selection of the number of layers may lead to an incorrect shear wave velocity profile.In this study,a deep learning and genetic algorithm hybrid learning procedure is proposed to perform the surface wave inversion without the need to assume the number of soil layers.First,a deep neural network is adapted to learn from a large number of synthetic dispersion curves for inferring the layer number.Then,the shear-wave velocity profile is determined by a genetic algorithm with the known layer number.By applying this procedure to both simulated and real-world cases,the results indicate that the proposed method is reliable and efficient for surface wave inversion.
基金supported by National Natural Science Foundation of China (Grant No. 50175064)China Scholarship Council (Grant No. 2008622078)Material Handling Industry of America (Grant No. 12251)
文摘The existing research of sequential zoning system and simultaneous zoning system mainly focuses on some optimization problems such as workload balance,product assignment and simulation for each system separately.But there is little research on comparative study between sequential zoning and simultaneous zoning.In order to help the designers to choose the suitable zoning policy for picker-to-parts system reasonably and quickly,a systemic selection method is presented.Essentially,both zoning and batching are order clustering,so the customer order sheet can be divided into many unit grids.After the time formulation in one-dimensional unit was defined,the time models for each zoning policy in two-dimensional space were established using filling curves and sequence models to link the one-dimensional unit grids.In consideration of "U" shaped dual tour into consideration,the subtraction value of order picking time between sequential zoning and simultaneous zoning was defined as the objective function to select the suitable zoning policy based on time models.As it is convergent enough,genetic algorithm is adopted to find the optimal value of order picking time.In the experimental study,5 different kinds of order/stock keeping unit(SKU) matrices with different densities d and quantities q following uniform distribution were created in order to test the suitability of sequential zoning and simultaneous zoning to different kinds of orders.After parameters setting,experimental orders inputting and iterative computations,the optimal order picking time for each zoning policy was gotten.By observing whether the delta time between them is greater than 0 or not,the suitability of zoning policies for picker-to-parts system were obtained.The significant effect of batch size b,zone number z and density d on suitability was also found by experimental study.The proposed research provides a new method for selection between sequential zoning and simultaneous zoning for picker-to-parts system,and improves the rationality and efficiency of selection process in practical design.
基金supported by the National Natural Science Foundation of China(6107901361079014+4 种基金61403198)the National Natural Science Funds and Civil Aviaiton Mutual Funds(U1533128U1233114)the Programs of Natural Science Foundation of China and China Civil Aviation Joint Fund(60939003)the Natural Science Foundation of Jiangsu Province in China(BK2011737)
文摘It is significant to combine multiple tasks into an optimal work package in decision-making of aircraft maintenance to reduce cost,so a cost rate model of combinatorial maintenance is an urgent need.However,the optimal combination under various constraints not only involves numerical calculations but also is an NP-hard combinatorial problem.To solve the problem,an adaptive genetic algorithm based on cluster search,which is divided into two phases,is put forward.In the first phase,according to the density,all individuals can be homogeneously scattered over the whole solution space through crossover and mutation and better individuals are collected as candidate cluster centres.In the second phase,the search is confined to the neighbourhood of some selected possible solutions to accurately solve with cluster radius decreasing slowly,meanwhile all clusters continuously move to better regions until all the peaks in the question space is searched.This algorithm can efficiently solve the combination problem.Taking the optimization on decision-making of aircraft maintenance by the algorithm for an example,maintenance which combines multiple parts or tasks can significantly enhance economic benefit when the halt cost is rather high.
基金Project(51874353)supported by the National Natural Science Foundation of ChinaProject(GCX20190898Y)supported by Mittal Student Innovation Project,China。
文摘Recognition of substrates in cobalt crust mining areas can improve mining efficiency.Aiming at the problem of unsatisfactory performance of using single feature to recognize the seabed material of the cobalt crust mining area,a method based on multiple-feature sets is proposed.Features of the target echoes are extracted by linear prediction method and wavelet analysis methods,and the linear prediction coefficient and linear prediction cepstrum coefficient are also extracted.Meanwhile,the characteristic matrices of modulus maxima,sub-band energy and multi-resolution singular spectrum entropy are obtained,respectively.The resulting features are subsequently compressed by kernel Fisher discriminant analysis(KFDA),the output features are selected using genetic algorithm(GA)to obtain optimal feature subsets,and recognition results of classifier are chosen as genetic fitness function.The advantages of this method are that it can describe the signal features more comprehensively and select the favorable features and remove the redundant features to the greatest extent.The experimental results show the better performance of the proposed method in comparison with only using KFDA or GA.
文摘There are various intense forces causing customers to use evaluated data when using social media platforms and microblogging sites.Today,customers throughout the world share their points of view on all kinds of topics through these sources.The massive volume of data created by these customers makes it impossible to analyze such data manually.Therefore,an efficient and intelligent method for evaluating social media data and their divergence needs to be developed.Today,various types of equipment and techniques are available for automatically estimating the classification of sentiments.Sentiment analysis involves determining people’s emotions using facial expressions.Sentiment analysis can be performed for any individual based on specific incidents.The present study describes the analysis of an image dataset using CNNswithPCA intended to detect people’s sentiments(specifically,whether a person is happy or sad).This process is optimized using a genetic algorithm to get better results.Further,a comparative analysis has been conducted between the different models generated by changing the mutation factor,performing batch normalization,and applying feature reduction using PCA.These steps are carried out across five experiments using theKaggledataset.The maximum accuracy obtained is 96.984%,which is associated with the Happy and Sad sentiments.
基金National Natural Science Foundation of China(No.61862038)Lanzhou Talent Innovation and Entrepreneurship Technology Plan Project(No.2019-RC-14)Foundation of a Hundred Youth Talents Training Program of Lanzhou Jiaotong University。
文摘The imbalance of energy consumption in wireless sensor networks(WSNs)easily results in the“hot spot”problem that the sensor nodes in a particular area die due to fast energy consumption.In order to solve the“hot spot”problem in WSNs,we propose an unequal clustering routing algorithm based on genetic algorithm(UCR-GA).In the cluster head election phase,the fitness function is constructed based on the residual energy,density and distance between nodes and base station,and the appropriate node is selected as the cluster head.In the data transmission phase,the cluster head selects single-hop or multi-hop communication mode according to the distance to the base station.After we comprehensively consider the residual energy of the cluster head and its communication energy consumption with the base station,an appropriate relay node is selected.The designed protocal is simulated under energy homogeneous and energy heterogeneity conditions,and the results show that the proposed routing protocal can effectively balance energy consumption,prolong the life cycle of network,and is appicable to heterogeneous networks.
基金This work is supported by the National Key R&D Program of China(2017YFB0802703)Major Scientific and Technological Special Project of Guizhou Province(20183001)+2 种基金Open Foundation of Guizhou Provincial Key VOLUME XX,2019 Laboratory of Public Big Data(2018BDKFJJ014)Open Foundation of Guizhou Provincial Key Laboratory of Public Big Data(2018BDKFJJ019)Open Foundation of Guizhou Provincial Key Laboratory of Public Big Data(2018BDKFJJ022).
文摘Smart contract has greatly improved the services and capabilities of blockchain,but it has become the weakest link of blockchain security because of its code nature.Therefore,efficient vulnerability detection of smart contract is the key to ensure the security of blockchain system.Oriented to Ethereum smart contract,the study solves the problems of redundant input and low coverage in the smart contract fuzz.In this paper,a taint analysis method based on EVM is proposed to reduce the invalid input,a dangerous operation database is designed to identify the dangerous input,and genetic algorithm is used to optimize the code coverage of the input,which construct the fuzzing framework for smart contract together.Finally,by comparing Oyente and ContractFuzzer,the performance and efficiency of the framework are proved.
文摘In this study. an automated conformer selection procedure using generic algorithm (GA) has been applied in comparative molecular field analysis (CoMFA) method. Using genetic algorithm. the 3D-QSAR model is optimized to an optimal one. From the calculation results, a group of QSAR models with high predictive ability can be obtained, which is superior than using conventional CoMFA: meanwhile. the active conformers for these compounds in data set can be determined fi om the best model.
文摘Pattern discovery from the seasonal time-series is of importance. Traditionally, most of the algorithms of pattern discovery in time series are similar. A novel mode of time series is proposed which integrates the Genetic Algorithm (GA) for the actual problem. The experiments on the electric power yield sequence models show that this algorithm is practicable and effective.
文摘In this paper Genetic Algorithm has been integrated with Fouquet modal analysis to optimize radiation pattern of coupled periodic antenna. Floquet analysis is used with MoM-GEC (Moment-Generalized Equivalent Circuit) method to study a finite periodic array with uniform amplitude and linear phase distribution. This method is very advantageous for studying large antenna array since it considerably reduces the computation time and the number of operations. In this way, Genetic algorithm is introduced and combined with Floquet analysis to optimize the radiation pattern distribution of this coupled periodic antenna. The goal of the optimization is to provide a better radiation characteristic for the coupled periodic antenna with maximum side lobe level reduction.
基金supported by Major Scientific and Technological Special Project of Guizhou Province(20183001)Exploration and Practice on the Education Mode for Engineering Students Based on Technology,Literature and art Inter-disciplinary Integration with the Internet+Background(022150118004/001)+2 种基金Open Foundation of Guizhou Provincial Key Laboratory of Public Big Data(2018BDKFJJ014)Open Foundation of Guizhou Provincial Key Laboratory of Public Big Data(2018BDKFJJ019)Open Foundation of Guizhou Provincial Key Laboratory of Public Big Data(2018BDKFJJ022).
文摘Smart contract has greatly improved the services and capabilities of blockchain,but it has become the weakest link of blockchain security because of its code nature.Therefore,efficient vulnerability detection of smart contract is the key to ensure the security of blockchain system.Oriented to Ethereum smart contract,the study solves the problems of redundant input and low coverage in the smart contract fuzz.In this paper,a taint analysis method based on EVM is proposed to reduce the invalid input,a dangerous operation database is designed to identify the dangerous input,and genetic algorithm is used to optimize the code coverage of the input,which construct the fuzzing framework for smart contract together.Finally,by comparing Oyente and ContractFuzzer,the performance and efficiency of the framework are proved.
文摘Although the genetic algorithm (GA) has very powerful robustness and fitness, it needs a large size of population and a large number of iterations to reach the optimum result. Especially when GA is used in complex structural optimization problems, if the structural reanalysis technique is not adopted, the more the number of finite element analysis (FEA) is, the more the consuming time is. In the conventional structural optimization the number of FEA can be reduced by the structural reanalysis technique based on the approximation techniques and sensitivity analysis. With these techniques, this paper provides a new approximation model-segment approximation model, adopted for the GA application. This segment approximation model can decrease the number of FEA and increase the convergence rate of GA. So it can apparently decrease the computation time of GA. Two examples demonstrate the availability of the new segment approximation model.
文摘This paper examines the optimization of the lifetime and energy consumption of Wireless Sensor Networks (WSNs). These two competing objectives have a deep influence over the service qualification of networks and according to recent studies, cluster formation is an appropriate solution for their achievement. To transmit aggregated data to the Base Station (BS), logical nodes called Cluster Heads (CHs) are required to relay data from the fixed-range sensing nodes located in the ground to high altitude aircraft. This study investigates the Genetic Algorithm (GA) as a dynamic technique to find optimum states. It is a simple framework that includes a proposed mathematical formula, which increasing in coverage is benchmarked against lifetime. Finally, the implementation of the proposed algorithm indicates a better efficiency compared to other simulated works.
文摘Parkinson’s disease (PD) is the most common disease of motor system degeneration that occurs when the dopamine-producing cells are damaged in substantia nigra. To detect PD, various signals have been investigated, including EEG, gait and speech. Since approximately 90 percent of the people with PD suffer from speech disorders, speech analysis is considered as the most common technique for this aim. This paper proposes a new algorithm for diagnosing of Parkinson’s disease based on voice analysis. In the first step, genetic algorithm (GA) is undertaken for selecting optimized features from all extracted features. Afterwards a network based on support vector machine (SVM) is used for classification between healthy and people with Parkinson. The dataset of this research is composed of a range of biomedical voice signals from 31 people, 23 with Parkinson’s disease and 8 healthy people. The subjects were asked to pronounce letter “A” for 3 seconds. 22 linear and non-linear features were extracted from the signals that 14 features were based on F0 (fundamental frequency or pitch), jitter, shimmer and noise to harmonics ratio, which are main factors in voice signal. Because changing in these factors is noticeable for the people with PD, optimized features were selected among them. Of the various numbers of optimized features, the data classification was investigated. Results show that the classification accuracy percent of 94.50 per 4 optimized features, the accuracy percent of 93.66 per 7 optimized features and the accuracy percent of 94.22 per 9 optimized features, could be achieved. It can be observed that the best classification accuracy may be achieved using Fhi (Hz), Fho (Hz), jitter (RAP) and shimmer (APQ5).