Wind farm layout optimization is a critical challenge in renewable energy development,especially in regions with complex terrain.Micro-siting of wind turbines has a significant impact on the overall efficiency and eco...Wind farm layout optimization is a critical challenge in renewable energy development,especially in regions with complex terrain.Micro-siting of wind turbines has a significant impact on the overall efficiency and economic viability of wind farm,where the wake effect,wind speed,types of wind turbines,etc.,have an impact on the output power of the wind farm.To solve the optimization problem of wind farm layout under complex terrain conditions,this paper proposes wind turbine layout optimization using different types of wind turbines,the aim is to reduce the influence of the wake effect and maximize economic benefits.The linear wake model is used for wake flow calculation over complex terrain.Minimizing the unit energy cost is taken as the objective function,considering that the objective function is affected by cost and output power,which influence each other.The cost function includes construction cost,installation cost,maintenance cost,etc.Therefore,a bi-level constrained optimization model is established,in which the upper-level objective function is to minimize the unit energy cost,and the lower-level objective function is to maximize the output power.Then,a hybrid evolutionary algorithm is designed according to the characteristics of the decision variables.The improved genetic algorithm and differential evolution are used to optimize the upper-level and lower-level objective functions,respectively,these evolutionary operations search for the optimal solution as much as possible.Finally,taking the roughness of different terrain,wind farms of different scales and different types of wind turbines as research scenarios,the optimal deployment is solved by using the algorithm in this paper,and four algorithms are compared to verify the effectiveness of the proposed algorithm.展开更多
The K-means algorithm is one of the most popular techniques in clustering. Nevertheless, the performance of the Kmeans algorithm depends highly on initial cluster centers and converges to local minima. This paper prop...The K-means algorithm is one of the most popular techniques in clustering. Nevertheless, the performance of the Kmeans algorithm depends highly on initial cluster centers and converges to local minima. This paper proposes a hybrid evolutionary programming based clustering algorithm, called PSO-SA, by combining particle swarm optimization (PSO) and simulated annealing (SA). The basic idea is to search around the global solution by SA and to increase the information exchange among particles using a mutation operator to escape local optima. Three datasets, Iris, Wisconsin Breast Cancer, and Ripley's Glass, have been considered to show the effectiveness of the proposed clustering algorithm in providing optimal clusters. The simulation results show that the PSO-SA clustering algorithm not only has a better response but also converges more quickly than the K-means, PSO, and SA algorithms.展开更多
The amplitude versus offset/angle(AVO/AVA)inversion which recovers elastic properties of subsurface media is an essential tool in oil and gas exploration.In general,the exact Zoeppritz equation has a relatively high a...The amplitude versus offset/angle(AVO/AVA)inversion which recovers elastic properties of subsurface media is an essential tool in oil and gas exploration.In general,the exact Zoeppritz equation has a relatively high accuracy in modelling the reflection coefficients.However,amplitude inversion based on it is highly nonlinear,thus,requires nonlinear inversion techniques like the genetic algorithm(GA)which has been widely applied in seismology.The quantum genetic algorithm(QGA)is a variant of the GA that enjoys the advantages of quantum computing,such as qubits and superposition of states.It,however,suffers from limitations in the areas of convergence rate and escaping local minima.To address these shortcomings,in this study,we propose a hybrid quantum genetic algorithm(HQGA)that combines a self-adaptive rotating strategy,and operations of quantum mutation and catastrophe.While the selfadaptive rotating strategy improves the flexibility and efficiency of a quantum rotating gate,the operations of quantum mutation and catastrophe enhance the local and global search abilities,respectively.Using the exact Zoeppritz equation,the HQGA was applied to both synthetic and field seismic data inversion and the results were compared to those of the GA and QGA.A number of the synthetic tests show that the HQGA requires fewer searches to converge to the global solution and the inversion results have generally higher accuracy.The application to field data reveals a good agreement between the inverted parameters and real logs.展开更多
Quantum singular value thresholding(QSVT) algorithm,as a core module of many mathematical models,seeks the singular values of a sparse and low rank matrix exceeding a threshold and their associated singular vectors.Th...Quantum singular value thresholding(QSVT) algorithm,as a core module of many mathematical models,seeks the singular values of a sparse and low rank matrix exceeding a threshold and their associated singular vectors.The existing all-qubit QSVT algorithm demands lots of ancillary qubits,remaining a huge challenge for realization on nearterm intermediate-scale quantum computers.In this paper,we propose a hybrid QSVT(HQSVT) algorithm utilizing both discrete variables(DVs) and continuous variables(CVs).In our algorithm,raw data vectors are encoded into a qubit system and the following data processing is fulfilled by hybrid quantum operations.Our algorithm requires O [log(MN)] qubits with0(1) qumodes and totally performs 0(1) operations,which significantly reduces the space and runtime consumption.展开更多
Although quantum Bayesian networks provide a promising paradigm for multi-agent decision-making,their practical application faces two challenges in the noisy intermediate-scale quantum(NISQ)era.Limited qubit resources...Although quantum Bayesian networks provide a promising paradigm for multi-agent decision-making,their practical application faces two challenges in the noisy intermediate-scale quantum(NISQ)era.Limited qubit resources restrict direct application to large-scale inference tasks.Additionally,no quantum methods are currently available for multi-agent collaborative decision-making.To address these,we propose a hybrid quantum–classical multi-agent decision-making framework based on hierarchical Bayesian networks,comprising two novel methods.The first one is a hybrid quantum–classical inference method based on hierarchical Bayesian networks.It decomposes large-scale hierarchical Bayesian networks into modular subnetworks.The inference for each subnetwork can be performed on NISQ devices,and the intermediate results are converted into classical messages for cross-layer transmission.The second one is a multi-agent decision-making method using the variational quantum eigensolver(VQE)in the influence diagram.This method models the collaborative decision-making with the influence diagram and encodes the expected utility of diverse actions into a Hamiltonian and subsequently determines the intra-group optimal action efficiently.Experimental validation on the IonQ quantum simulator demonstrates that the hierarchical method outperforms the non-hierarchical method at the functional inference level,and the VQE method can obtain the optimal strategy exactly at the collaborative decision-making level.Our research not only extends the application of quantum computing to multi-agent decision-making but also provides a practical solution for the NISQ era.展开更多
A hybrid identification model based on multilayer artificial neural networks(ANNs) and particle swarm optimization(PSO) algorithm is developed to improve the simultaneous identification efficiency of thermal conductiv...A hybrid identification model based on multilayer artificial neural networks(ANNs) and particle swarm optimization(PSO) algorithm is developed to improve the simultaneous identification efficiency of thermal conductivity and effective absorption coefficient of semitransparent materials.For the direct model,the spherical harmonic method and the finite volume method are used to solve the coupled conduction-radiation heat transfer problem in an absorbing,emitting,and non-scattering 2D axisymmetric gray medium in the background of laser flash method.For the identification part,firstly,the temperature field and the incident radiation field in different positions are chosen as observables.Then,a traditional identification model based on PSO algorithm is established.Finally,multilayer ANNs are built to fit and replace the direct model in the traditional identification model to speed up the identification process.The results show that compared with the traditional identification model,the time cost of the hybrid identification model is reduced by about 1 000 times.Besides,the hybrid identification model remains a high level of accuracy even with measurement errors.展开更多
Community detection is one of the most fundamental applications in understanding the structure of complicated networks.Furthermore,it is an important approach to identifying closely linked clusters of nodes that may r...Community detection is one of the most fundamental applications in understanding the structure of complicated networks.Furthermore,it is an important approach to identifying closely linked clusters of nodes that may represent underlying patterns and relationships.Networking structures are highly sensitive in social networks,requiring advanced techniques to accurately identify the structure of these communities.Most conventional algorithms for detecting communities perform inadequately with complicated networks.In addition,they miss out on accurately identifying clusters.Since single-objective optimization cannot always generate accurate and comprehensive results,as multi-objective optimization can.Therefore,we utilized two objective functions that enable strong connections between communities and weak connections between them.In this study,we utilized the intra function,which has proven effective in state-of-the-art research studies.We proposed a new inter-function that has demonstrated its effectiveness by making the objective of detecting external connections between communities is to make them more distinct and sparse.Furthermore,we proposed a Multi-Objective community strength enhancement algorithm(MOCSE).The proposed algorithm is based on the framework of the Multi-Objective Evolutionary Algorithm with Decomposition(MOEA/D),integrated with a new heuristic mutation strategy,community strength enhancement(CSE).The results demonstrate that the model is effective in accurately identifying community structures while also being computationally efficient.The performance measures used to evaluate the MOEA/D algorithm in our work are normalized mutual information(NMI)and modularity(Q).It was tested using five state-of-the-art algorithms on social networks,comprising real datasets(Zachary,Dolphin,Football,Krebs,SFI,Jazz,and Netscience),as well as twenty synthetic datasets.These results provide the robustness and practical value of the proposed algorithm in multi-objective community identification.展开更多
Gene regulatory network inference helps understand the regulatory mechanism among genes, predict the functions of unknown genes, comprehend the pathogenesis of disease and speed up drug development. In this paper, a H...Gene regulatory network inference helps understand the regulatory mechanism among genes, predict the functions of unknown genes, comprehend the pathogenesis of disease and speed up drug development. In this paper, a Hill function-based ordinary differential equation (ODE) model is proposed to infer gene regulatory network (GRN). A hybrid evolutionary algorithm based on binary grey wolf optimization (BGWO) and grey wolf optimization (GWO) is proposed to identify the structure and parameters of the Hill function-based model. In order to restrict the search space and eliminate the redundant regulatory relationships, L1 regularizer was added to the fitness function. SOS repair network was used to test the proposed method. The experimental results show that this method can infer gene regulatory network more accurately than state of the art methods.展开更多
The well-known Riccati differential equations play a key role in many fields,including problems in protein folding,control and stabilization,stochastic control,and cybersecurity(risk analysis and malware propaga-tion)...The well-known Riccati differential equations play a key role in many fields,including problems in protein folding,control and stabilization,stochastic control,and cybersecurity(risk analysis and malware propaga-tion).Quantum computer algorithms have the potential to implement faster approximate solutions to the Riccati equations compared with strictly classical algorithms.While systems with many qubits are still under development,there is significant interest in developing algorithms for near-term quantum computers to determine their accuracy and limitations.In this paper,we propose a hybrid quantum-classical algorithm,the Matrix Riccati Solver(MRS).This approach uses a transformation of variables to turn a set of nonlinear differential equation into a set of approximate linear differential equations(i.e.,second order non-constant coefficients)which can in turn be solved using a version of the Harrow-Hassidim-Lloyd(HHL)quantum algorithm for the case of Hermitian matrices.We implement this approach using the Qiskit language and compute near-term results using a 4 qubit IBM Q System quantum computer.Comparisons with classical results and areas for future research are discussed.展开更多
One of the main problems of machine learning and data mining is to develop a basic model with a few features,to reduce the algorithms involved in classification’s computational complexity.In this paper,the collection...One of the main problems of machine learning and data mining is to develop a basic model with a few features,to reduce the algorithms involved in classification’s computational complexity.In this paper,the collection of features has an essential importance in the classification process to be able minimize computational time,which decreases data size and increases the precision and effectiveness of specific machine learning activities.Due to its superiority to conventional optimization methods,several metaheuristics have been used to resolve FS issues.This is why hybrid metaheuristics help increase the search and convergence rate of the critical algorithms.A modern hybrid selection algorithm combining the two algorithms;the genetic algorithm(GA)and the Particle Swarm Optimization(PSO)to enhance search capabilities is developed in this paper.The efficacy of our proposed method is illustrated in a series of simulation phases,using the UCI learning array as a benchmark dataset.展开更多
This paper introduces a hybrid evolutionary algorithm for the resource-constrained project scheduling problem (RCPSP). Given an RCPSP instance, the algorithm identifies the problem structure and selects a suitable dec...This paper introduces a hybrid evolutionary algorithm for the resource-constrained project scheduling problem (RCPSP). Given an RCPSP instance, the algorithm identifies the problem structure and selects a suitable decoding scheme. Then a multi-pass biased sampling method followed up by a multi-local search is used to generate a diverse and good quality initial population. The population then evolves through modified order-based recombination and mutation operators to perform exploration for promising solutions within the entire region. Mutation is performed only if the current population has converged or the produced offspring by recombination operator is too similar to one of his parents. Finally the algorithm performs an intensified local search on the best solution found in the evolutionary stage. Computational experiments using standard instances indicate that the proposed algorithm works well in both computational time and solution quality.展开更多
We show the practicality of two existing meta-learning algorithms Model-</span></span><span><span><span> </span></span></span><span><span><span><spa...We show the practicality of two existing meta-learning algorithms Model-</span></span><span><span><span> </span></span></span><span><span><span><span style="font-family:Verdana;">Agnostic Meta-Learning and Fast Context Adaptation Via Meta-learning using an evolutionary strategy for parameter optimization, as well as propose two novel quantum adaptations of those algorithms using continuous quantum neural networks, for learning to trade portfolios of stocks on the stock market. The goal of meta-learning is to train a model on a variety of tasks, such that it can solve new learning tasks using only a small number of training samples. In our classical approach, we trained our meta-learning models on a variety of portfolios that contained 5 randomly sampled Consumer Cyclical stocks from a pool of 60. In our quantum approach, we trained our </span><span style="font-family:Verdana;">quantum meta-learning models on a simulated quantum computer with</span><span style="font-family:Verdana;"> portfolios containing 2 randomly sampled Consumer Cyclical stocks. Our findings suggest that both classical models could learn a new portfolio with 0.01% of the number of training samples to learn the original portfolios and can achieve a comparable performance within 0.1% Return on Investment of the Buy and Hold strategy. We also show that our much smaller quantum meta-learned models with only 60 model parameters and 25 training epochs </span><span style="font-family:Verdana;">have a similar learning pattern to our much larger classical meta-learned</span><span style="font-family:Verdana;"> models that have over 250,000 model parameters and 2500 training epochs. Given these findings</span></span></span></span><span style="font-family:Verdana;"><span style="font-family:Verdana;"><span style="font-family:Verdana;">,</span></span></span><span style="font-family:Verdana;"><span style="font-family:Verdana;"><span style="font-family:Verdana;"> we also discuss the benefits of scaling up our experiments from a simulated quantum computer to a real quantum computer. To the best of our knowledge, we are the first to apply the ideas of both classical meta-learning as well as quantum meta-learning to enhance stock trading.展开更多
Fog computing has emerged as an important technology which can improve the performance of computation-intensive and latency-critical communication networks.Nevertheless,the fog computing Internet-of-Things(IoT)systems...Fog computing has emerged as an important technology which can improve the performance of computation-intensive and latency-critical communication networks.Nevertheless,the fog computing Internet-of-Things(IoT)systems are susceptible to malicious eavesdropping attacks during the information transmission,and this issue has not been adequately addressed.In this paper,we propose a physical-layer secure fog computing IoT system model,which is able to improve the physical layer security of fog computing IoT networks against the malicious eavesdropping of multiple eavesdroppers.The secrecy rate of the proposed model is analyzed,and the quantum galaxy–based search algorithm(QGSA)is proposed to solve the hybrid task scheduling and resource management problem of the network.The computational complexity and convergence of the proposed algorithm are analyzed.Simulation results validate the efficiency of the proposed model and reveal the influence of various environmental parameters on fog computing IoT networks.Moreover,the simulation results demonstrate that the proposed hybrid task scheduling and resource management scheme can effectively enhance secrecy performance across different communication scenarios.展开更多
The traveling salesman problem has long been regarded as a challenging application for existing optimization methods as well as a benchmark application for the development of new optimization methods. As with many exi...The traveling salesman problem has long been regarded as a challenging application for existing optimization methods as well as a benchmark application for the development of new optimization methods. As with many existing algorithms, a traditional genetic algorithm will have limited success with this problem class, particularly as the problem size increases. A rule based genetic algorithm is proposed and demonstrated on sets of traveling salesman problems of increasing size. The solution character as well as the solution efficiency is compared against a simulated annealing technique as well as a standard genetic algorithm. The rule based genetic algorithm is shown to provide superior performance for all problem sizes considered. Furthermore, a post optimal analysis provides insight into which rules were successfully applied during the solution process which allows for rule modification to further enhance performance.展开更多
基金supported by the National Natural Science Foundation of China[Grant No.12461035]Qinghai University Students Innovative Training Program Project[2024-QX-57].
文摘Wind farm layout optimization is a critical challenge in renewable energy development,especially in regions with complex terrain.Micro-siting of wind turbines has a significant impact on the overall efficiency and economic viability of wind farm,where the wake effect,wind speed,types of wind turbines,etc.,have an impact on the output power of the wind farm.To solve the optimization problem of wind farm layout under complex terrain conditions,this paper proposes wind turbine layout optimization using different types of wind turbines,the aim is to reduce the influence of the wake effect and maximize economic benefits.The linear wake model is used for wake flow calculation over complex terrain.Minimizing the unit energy cost is taken as the objective function,considering that the objective function is affected by cost and output power,which influence each other.The cost function includes construction cost,installation cost,maintenance cost,etc.Therefore,a bi-level constrained optimization model is established,in which the upper-level objective function is to minimize the unit energy cost,and the lower-level objective function is to maximize the output power.Then,a hybrid evolutionary algorithm is designed according to the characteristics of the decision variables.The improved genetic algorithm and differential evolution are used to optimize the upper-level and lower-level objective functions,respectively,these evolutionary operations search for the optimal solution as much as possible.Finally,taking the roughness of different terrain,wind farms of different scales and different types of wind turbines as research scenarios,the optimal deployment is solved by using the algorithm in this paper,and four algorithms are compared to verify the effectiveness of the proposed algorithm.
文摘The K-means algorithm is one of the most popular techniques in clustering. Nevertheless, the performance of the Kmeans algorithm depends highly on initial cluster centers and converges to local minima. This paper proposes a hybrid evolutionary programming based clustering algorithm, called PSO-SA, by combining particle swarm optimization (PSO) and simulated annealing (SA). The basic idea is to search around the global solution by SA and to increase the information exchange among particles using a mutation operator to escape local optima. Three datasets, Iris, Wisconsin Breast Cancer, and Ripley's Glass, have been considered to show the effectiveness of the proposed clustering algorithm in providing optimal clusters. The simulation results show that the PSO-SA clustering algorithm not only has a better response but also converges more quickly than the K-means, PSO, and SA algorithms.
基金supported by the National Natural Science Foundation of China(U19B6003,42122029)the Strategic Cooperation Technology Projects of CNPC and CUPB(ZLZX 202003)partially supported by SEG/WesternGeco Scholarship,SEG Foundation/Chevron Scholarship,and SEG/Norman and Shirley Domenico Scholarship
文摘The amplitude versus offset/angle(AVO/AVA)inversion which recovers elastic properties of subsurface media is an essential tool in oil and gas exploration.In general,the exact Zoeppritz equation has a relatively high accuracy in modelling the reflection coefficients.However,amplitude inversion based on it is highly nonlinear,thus,requires nonlinear inversion techniques like the genetic algorithm(GA)which has been widely applied in seismology.The quantum genetic algorithm(QGA)is a variant of the GA that enjoys the advantages of quantum computing,such as qubits and superposition of states.It,however,suffers from limitations in the areas of convergence rate and escaping local minima.To address these shortcomings,in this study,we propose a hybrid quantum genetic algorithm(HQGA)that combines a self-adaptive rotating strategy,and operations of quantum mutation and catastrophe.While the selfadaptive rotating strategy improves the flexibility and efficiency of a quantum rotating gate,the operations of quantum mutation and catastrophe enhance the local and global search abilities,respectively.Using the exact Zoeppritz equation,the HQGA was applied to both synthetic and field seismic data inversion and the results were compared to those of the GA and QGA.A number of the synthetic tests show that the HQGA requires fewer searches to converge to the global solution and the inversion results have generally higher accuracy.The application to field data reveals a good agreement between the inverted parameters and real logs.
基金Project supported by the Key Research and Development Program of Guangdong Province,China(Grant No.2018B030326001)the National Natural Science Foundation of China(Grant Nos.61521001,12074179,and 11890704)。
文摘Quantum singular value thresholding(QSVT) algorithm,as a core module of many mathematical models,seeks the singular values of a sparse and low rank matrix exceeding a threshold and their associated singular vectors.The existing all-qubit QSVT algorithm demands lots of ancillary qubits,remaining a huge challenge for realization on nearterm intermediate-scale quantum computers.In this paper,we propose a hybrid QSVT(HQSVT) algorithm utilizing both discrete variables(DVs) and continuous variables(CVs).In our algorithm,raw data vectors are encoded into a qubit system and the following data processing is fulfilled by hybrid quantum operations.Our algorithm requires O [log(MN)] qubits with0(1) qumodes and totally performs 0(1) operations,which significantly reduces the space and runtime consumption.
基金supported by the National Natural Science Foundation of China(Grant Nos.62473371 and 61673389)。
文摘Although quantum Bayesian networks provide a promising paradigm for multi-agent decision-making,their practical application faces two challenges in the noisy intermediate-scale quantum(NISQ)era.Limited qubit resources restrict direct application to large-scale inference tasks.Additionally,no quantum methods are currently available for multi-agent collaborative decision-making.To address these,we propose a hybrid quantum–classical multi-agent decision-making framework based on hierarchical Bayesian networks,comprising two novel methods.The first one is a hybrid quantum–classical inference method based on hierarchical Bayesian networks.It decomposes large-scale hierarchical Bayesian networks into modular subnetworks.The inference for each subnetwork can be performed on NISQ devices,and the intermediate results are converted into classical messages for cross-layer transmission.The second one is a multi-agent decision-making method using the variational quantum eigensolver(VQE)in the influence diagram.This method models the collaborative decision-making with the influence diagram and encodes the expected utility of diverse actions into a Hamiltonian and subsequently determines the intra-group optimal action efficiently.Experimental validation on the IonQ quantum simulator demonstrates that the hierarchical method outperforms the non-hierarchical method at the functional inference level,and the VQE method can obtain the optimal strategy exactly at the collaborative decision-making level.Our research not only extends the application of quantum computing to multi-agent decision-making but also provides a practical solution for the NISQ era.
基金supported by the Fundamental Research Funds for the Central Universities (No.3122020072)the Multi-investment Project of Tianjin Applied Basic Research(No.23JCQNJC00250)。
文摘A hybrid identification model based on multilayer artificial neural networks(ANNs) and particle swarm optimization(PSO) algorithm is developed to improve the simultaneous identification efficiency of thermal conductivity and effective absorption coefficient of semitransparent materials.For the direct model,the spherical harmonic method and the finite volume method are used to solve the coupled conduction-radiation heat transfer problem in an absorbing,emitting,and non-scattering 2D axisymmetric gray medium in the background of laser flash method.For the identification part,firstly,the temperature field and the incident radiation field in different positions are chosen as observables.Then,a traditional identification model based on PSO algorithm is established.Finally,multilayer ANNs are built to fit and replace the direct model in the traditional identification model to speed up the identification process.The results show that compared with the traditional identification model,the time cost of the hybrid identification model is reduced by about 1 000 times.Besides,the hybrid identification model remains a high level of accuracy even with measurement errors.
文摘Community detection is one of the most fundamental applications in understanding the structure of complicated networks.Furthermore,it is an important approach to identifying closely linked clusters of nodes that may represent underlying patterns and relationships.Networking structures are highly sensitive in social networks,requiring advanced techniques to accurately identify the structure of these communities.Most conventional algorithms for detecting communities perform inadequately with complicated networks.In addition,they miss out on accurately identifying clusters.Since single-objective optimization cannot always generate accurate and comprehensive results,as multi-objective optimization can.Therefore,we utilized two objective functions that enable strong connections between communities and weak connections between them.In this study,we utilized the intra function,which has proven effective in state-of-the-art research studies.We proposed a new inter-function that has demonstrated its effectiveness by making the objective of detecting external connections between communities is to make them more distinct and sparse.Furthermore,we proposed a Multi-Objective community strength enhancement algorithm(MOCSE).The proposed algorithm is based on the framework of the Multi-Objective Evolutionary Algorithm with Decomposition(MOEA/D),integrated with a new heuristic mutation strategy,community strength enhancement(CSE).The results demonstrate that the model is effective in accurately identifying community structures while also being computationally efficient.The performance measures used to evaluate the MOEA/D algorithm in our work are normalized mutual information(NMI)and modularity(Q).It was tested using five state-of-the-art algorithms on social networks,comprising real datasets(Zachary,Dolphin,Football,Krebs,SFI,Jazz,and Netscience),as well as twenty synthetic datasets.These results provide the robustness and practical value of the proposed algorithm in multi-objective community identification.
文摘Gene regulatory network inference helps understand the regulatory mechanism among genes, predict the functions of unknown genes, comprehend the pathogenesis of disease and speed up drug development. In this paper, a Hill function-based ordinary differential equation (ODE) model is proposed to infer gene regulatory network (GRN). A hybrid evolutionary algorithm based on binary grey wolf optimization (BGWO) and grey wolf optimization (GWO) is proposed to identify the structure and parameters of the Hill function-based model. In order to restrict the search space and eliminate the redundant regulatory relationships, L1 regularizer was added to the fitness function. SOS repair network was used to test the proposed method. The experimental results show that this method can infer gene regulatory network more accurately than state of the art methods.
文摘The well-known Riccati differential equations play a key role in many fields,including problems in protein folding,control and stabilization,stochastic control,and cybersecurity(risk analysis and malware propaga-tion).Quantum computer algorithms have the potential to implement faster approximate solutions to the Riccati equations compared with strictly classical algorithms.While systems with many qubits are still under development,there is significant interest in developing algorithms for near-term quantum computers to determine their accuracy and limitations.In this paper,we propose a hybrid quantum-classical algorithm,the Matrix Riccati Solver(MRS).This approach uses a transformation of variables to turn a set of nonlinear differential equation into a set of approximate linear differential equations(i.e.,second order non-constant coefficients)which can in turn be solved using a version of the Harrow-Hassidim-Lloyd(HHL)quantum algorithm for the case of Hermitian matrices.We implement this approach using the Qiskit language and compute near-term results using a 4 qubit IBM Q System quantum computer.Comparisons with classical results and areas for future research are discussed.
基金This work was partially supported by the National Natural Science Foundation of China(61876089,61876185,61902281,61375121)the Opening Project of Jiangsu Key Laboratory of Data Science and Smart Software(No.2019DS301)+1 种基金the Engineering Research Center of Digital Forensics,Ministry of Education,the Key Research and Development Program of Jiangsu Province(BE2020633)the Priority Academic Program Development of Jiangsu Higher Education Institutions。
文摘One of the main problems of machine learning and data mining is to develop a basic model with a few features,to reduce the algorithms involved in classification’s computational complexity.In this paper,the collection of features has an essential importance in the classification process to be able minimize computational time,which decreases data size and increases the precision and effectiveness of specific machine learning activities.Due to its superiority to conventional optimization methods,several metaheuristics have been used to resolve FS issues.This is why hybrid metaheuristics help increase the search and convergence rate of the critical algorithms.A modern hybrid selection algorithm combining the two algorithms;the genetic algorithm(GA)and the Particle Swarm Optimization(PSO)to enhance search capabilities is developed in this paper.The efficacy of our proposed method is illustrated in a series of simulation phases,using the UCI learning array as a benchmark dataset.
文摘This paper introduces a hybrid evolutionary algorithm for the resource-constrained project scheduling problem (RCPSP). Given an RCPSP instance, the algorithm identifies the problem structure and selects a suitable decoding scheme. Then a multi-pass biased sampling method followed up by a multi-local search is used to generate a diverse and good quality initial population. The population then evolves through modified order-based recombination and mutation operators to perform exploration for promising solutions within the entire region. Mutation is performed only if the current population has converged or the produced offspring by recombination operator is too similar to one of his parents. Finally the algorithm performs an intensified local search on the best solution found in the evolutionary stage. Computational experiments using standard instances indicate that the proposed algorithm works well in both computational time and solution quality.
文摘We show the practicality of two existing meta-learning algorithms Model-</span></span><span><span><span> </span></span></span><span><span><span><span style="font-family:Verdana;">Agnostic Meta-Learning and Fast Context Adaptation Via Meta-learning using an evolutionary strategy for parameter optimization, as well as propose two novel quantum adaptations of those algorithms using continuous quantum neural networks, for learning to trade portfolios of stocks on the stock market. The goal of meta-learning is to train a model on a variety of tasks, such that it can solve new learning tasks using only a small number of training samples. In our classical approach, we trained our meta-learning models on a variety of portfolios that contained 5 randomly sampled Consumer Cyclical stocks from a pool of 60. In our quantum approach, we trained our </span><span style="font-family:Verdana;">quantum meta-learning models on a simulated quantum computer with</span><span style="font-family:Verdana;"> portfolios containing 2 randomly sampled Consumer Cyclical stocks. Our findings suggest that both classical models could learn a new portfolio with 0.01% of the number of training samples to learn the original portfolios and can achieve a comparable performance within 0.1% Return on Investment of the Buy and Hold strategy. We also show that our much smaller quantum meta-learned models with only 60 model parameters and 25 training epochs </span><span style="font-family:Verdana;">have a similar learning pattern to our much larger classical meta-learned</span><span style="font-family:Verdana;"> models that have over 250,000 model parameters and 2500 training epochs. Given these findings</span></span></span></span><span style="font-family:Verdana;"><span style="font-family:Verdana;"><span style="font-family:Verdana;">,</span></span></span><span style="font-family:Verdana;"><span style="font-family:Verdana;"><span style="font-family:Verdana;"> we also discuss the benefits of scaling up our experiments from a simulated quantum computer to a real quantum computer. To the best of our knowledge, we are the first to apply the ideas of both classical meta-learning as well as quantum meta-learning to enhance stock trading.
基金supported by the National Natural Science Foundation of China(61571149,62001139)the Initiation Fund for Postdoctoral Research in Heilongjiang Province(LBH-Q19098)the Natural Science Foundation of Heilongjiang Province(LH2020F0178).
文摘Fog computing has emerged as an important technology which can improve the performance of computation-intensive and latency-critical communication networks.Nevertheless,the fog computing Internet-of-Things(IoT)systems are susceptible to malicious eavesdropping attacks during the information transmission,and this issue has not been adequately addressed.In this paper,we propose a physical-layer secure fog computing IoT system model,which is able to improve the physical layer security of fog computing IoT networks against the malicious eavesdropping of multiple eavesdroppers.The secrecy rate of the proposed model is analyzed,and the quantum galaxy–based search algorithm(QGSA)is proposed to solve the hybrid task scheduling and resource management problem of the network.The computational complexity and convergence of the proposed algorithm are analyzed.Simulation results validate the efficiency of the proposed model and reveal the influence of various environmental parameters on fog computing IoT networks.Moreover,the simulation results demonstrate that the proposed hybrid task scheduling and resource management scheme can effectively enhance secrecy performance across different communication scenarios.
文摘The traveling salesman problem has long been regarded as a challenging application for existing optimization methods as well as a benchmark application for the development of new optimization methods. As with many existing algorithms, a traditional genetic algorithm will have limited success with this problem class, particularly as the problem size increases. A rule based genetic algorithm is proposed and demonstrated on sets of traveling salesman problems of increasing size. The solution character as well as the solution efficiency is compared against a simulated annealing technique as well as a standard genetic algorithm. The rule based genetic algorithm is shown to provide superior performance for all problem sizes considered. Furthermore, a post optimal analysis provides insight into which rules were successfully applied during the solution process which allows for rule modification to further enhance performance.
