As the number of automated guided vehicles(AGVs)within automated container terminals(ACT)continues to rise,conflicts have becomemore frequent.Addressing point and edge conflicts ofAGVs,amulti-AGVconflict-free path pla...As the number of automated guided vehicles(AGVs)within automated container terminals(ACT)continues to rise,conflicts have becomemore frequent.Addressing point and edge conflicts ofAGVs,amulti-AGVconflict-free path planning model has been formulated to minimize the total path length of AGVs between shore bridges and yards.For larger terminalmaps and complex environments,the grid method is employed to model AGVs’road networks.An improved bounded conflict-based search(IBCBS)algorithmtailored to ACT is proposed,leveraging the binary tree principle to resolve conflicts and employing focal search to expand the search range.Comparative experiments involving 60 AGVs indicate a reduction in computing time by 37.397%to 64.06%while maintaining the over cost within 1.019%.Numerical experiments validate the proposed algorithm’s efficacy in enhancing efficiency and ensuring solution quality.展开更多
Link prediction,also known as Knowledge Graph Completion(KGC),is the common task in Knowledge Graphs(KGs)to predict missing connections between entities.Most existing methods focus on designing shallow,scalable models...Link prediction,also known as Knowledge Graph Completion(KGC),is the common task in Knowledge Graphs(KGs)to predict missing connections between entities.Most existing methods focus on designing shallow,scalable models,which have less expressive than deep,multi-layer models.Furthermore,most operations like addition,matrix multiplications or factorization are handcrafted based on a few known relation patterns in several wellknown datasets,such as FB15k,WN18,etc.However,due to the diversity and complex nature of real-world data distribution,it is inherently difficult to preset all latent patterns.To address this issue,we proposeKGE-ANS,a novel knowledge graph embedding framework for general link prediction tasks using automatic network search.KGEANS can learn a deep,multi-layer effective architecture to adapt to different datasets through neural architecture search.In addition,the general search spacewe designed is tailored forKGtasks.We performextensive experiments on benchmark datasets and the dataset constructed in this paper.The results show that our KGE-ANS outperforms several state-of-the-art methods,especially on these datasets with complex relation patterns.展开更多
In recent years,cloud computing has provided a Software As A Service(SaaS)platform where the software can be reused and applied to fulfill compli-cated user demands according to specific Quality of Services(QoS)constrai...In recent years,cloud computing has provided a Software As A Service(SaaS)platform where the software can be reused and applied to fulfill compli-cated user demands according to specific Quality of Services(QoS)constraints.The user requirements are formulated as a workflow consisting of a set of tasks.However,many services may satisfy the functionality of each task;thus,searching for the composition of the optimal service while maximizing the QoS is formulated as an NP-hard problem.This work will introduce a hybrid Artificial Bee Colony(ABC)with a Cuckoo Search(CS)algorithm to untangle service composition problem.The ABC is a well-known metaheuristic algorithm that can be applied when dealing with different NP-hard problems with an outstanding record of performance.However,the ABC suffers from a slow convergence problem.Therefore,the CS is used to overcome the ABC’s limitations by allowing the abandoned bees to enhance their search and override the local optimum.The proposed hybrid algorithm has been tested on 19 datasets and then compared with two standard algorithms(ABC and CS)and three state-of-the-art swarm-based composition algorithms.In addition,extensive parameter study experiments were conducted to set up the proposed algorithm’s parameters.The results indicate that the proposed algorithm outperforms the standard algorithms in the three comparison criteria(bestfitness value,averagefitness value,and average execution time)overall datasets in 30 different runs.Furthermore,the proposed algorithm also exhibits better performance than the state–of–the–art algorithms in the three comparison criteria over 30 different runs.展开更多
The discovery of ubiquitous habitable extrasolar planets,combined with revolutionary advances in instrumentation and observational capabilities,has ushered in a renaissance in the search for extraterrestrial intellige...The discovery of ubiquitous habitable extrasolar planets,combined with revolutionary advances in instrumentation and observational capabilities,has ushered in a renaissance in the search for extraterrestrial intelligence(SETI).Large scale SETI activities are now underway at numerous international facilities.The Five-hundred-meter Aperture Spherical radio Telescope(FAST)is the largest single-aperture radio telescope in the world,and is well positioned to conduct sensitive searches for radio emission indicative of exo-intelligence.SETI is one of the five key science goals specified in the original FAST project plan.A collaboration with the Breakthrough Listen Initiative was initiated in 2016 with a joint statement signed both by Dr.Jun Yan,the then director of National Astronomical Observatories,Chinese Academy of Sciences(NAOC),and Dr.Peter Worden,Chairman of the Breakthrough Prize Foundation.In this paper,we highlight some of the unique features of FAST that will allow for novel SETI observations.We identify and describe three different signal types indicative of a technological source,namely,narrow band,wide-band artificially dispersed and modulated signals.Here,we propose observations with FAST to achieve sensitivities never before explored.For nearby exoplanets,such as TESS targets,FAST will be sensitive to an EIRP of 1.9×1011 W,well within the reach of current human technology.For the Andromeda Galaxy,FAST will be able to detect any Kardashev type II or more advanced civilization there.展开更多
This paper studies the problem of using multiple unmanned air vehicles (UAVs) to search for moving targets with sensing capabilities. When multiple UAVs (multi-UAV) search for a number of moving targets in the mission...This paper studies the problem of using multiple unmanned air vehicles (UAVs) to search for moving targets with sensing capabilities. When multiple UAVs (multi-UAV) search for a number of moving targets in the mission area, the targets can intermittently obtain the position information of the UAVs from sensing devices, and take appropriate actions to increase the distance between themselves and the UAVs. Aiming at this problem, an environment model is established using the search map, and the updating method of the search map is extended by considering the sensing capabilities of the moving targets. A multi-UAV search path planning optimization model based on the model predictive control (MPC) method is constructed, and a hybrid particle swarm optimization algorithm with a crossover operator is designed to solve the model. Simulation results show that the proposed method can effectively improve the cooperative search efficiency and can find more targets per unit time compared with the coverage search method and the random search method.展开更多
A target is assumed to move according to a Brownian motion on the real line. The searcher starts from the origin and moves in the two directions from the starting point. The object is to detect the target. The purpose...A target is assumed to move according to a Brownian motion on the real line. The searcher starts from the origin and moves in the two directions from the starting point. The object is to detect the target. The purpose of this paper is to find the conditions under which the expected value of the first meeting time of the searcher and the target is finite, and to show the existence of a search plan which made this expected value minimum.展开更多
Searching for maritime moving targets using satellites is an attracting but rather difficult problem due to the satellites' orbits and discontinuous visible time windows.From a long term cyclic view,a non-myopic m...Searching for maritime moving targets using satellites is an attracting but rather difficult problem due to the satellites' orbits and discontinuous visible time windows.From a long term cyclic view,a non-myopic method based on reinforcement learning(RL)for multi-pass multi-targets searching was proposed.It learnt system behaviors step by step from each observation which resulted in a dynamic progressive way.Then it decided and adjusted optimal actions in each observation opportunity.System states were indicated by expected information gain.Neural networks algorithm was used to approximate parameters of control policy.Simulation results show that our approach with sufficient training performs significantly better than other myopic approaches which make local optimal decisions for each individual observation opportunity.展开更多
The backtracking search optimization algorithm(BSA) is one of the most recently proposed population-based evolutionary algorithms for global optimization. Due to its memory ability and simple structure, BSA has powe...The backtracking search optimization algorithm(BSA) is one of the most recently proposed population-based evolutionary algorithms for global optimization. Due to its memory ability and simple structure, BSA has powerful capability to find global optimal solutions. However, the algorithm is still insufficient in balancing the exploration and the exploitation. Therefore, an improved adaptive backtracking search optimization algorithm combined with modified Hooke-Jeeves pattern search is proposed for numerical global optimization. It has two main parts: the BSA is used for the exploration phase and the modified pattern search method completes the exploitation phase. In particular, a simple but effective strategy of adapting one of BSA's important control parameters is introduced. The proposed algorithm is compared with standard BSA, three state-of-the-art evolutionary algorithms and three superior algorithms in IEEE Congress on Evolutionary Computation 2014(IEEE CEC2014) over six widely-used benchmarks and 22 real-parameter single objective numerical optimization benchmarks in IEEE CEC2014. The results of experiment and statistical analysis demonstrate the effectiveness and efficiency of the proposed algorithm.展开更多
A novel subspace projection anti-jamming algorithm based on spatial blind search is proposed,which uses multiple single-constrained subspace projection parallel filters.If the direction of arrival(DOA)of a satellite s...A novel subspace projection anti-jamming algorithm based on spatial blind search is proposed,which uses multiple single-constrained subspace projection parallel filters.If the direction of arrival(DOA)of a satellite signal is unknown,the traditional subspace projection anti-jamming algorithm cannot form the correct beam pointing.To overcome the problem of the traditional subspace projection algorithm,multiple single-constrained subspace projection parallel filters are used.Every single-constrained anti-jamming subspace projection algorithm obtains the optimal weight vector by searching the DOA of the satellite signal and uses the output of cross correlation as a decision criterion.Test results show that the algorithm can suppress the jamming effectively,and generate high gain toward the desired signal.The research provides a new idea for the engineering implementation of a multi-beam anti-jamming algorithm based on subspace projection.展开更多
A target is assumed to move randomly on one of two disjoint lines L1 and L2 according to a stochastic process . We have two searchers start looking for the lost target from some points on the two lines separately. Eac...A target is assumed to move randomly on one of two disjoint lines L1 and L2 according to a stochastic process . We have two searchers start looking for the lost target from some points on the two lines separately. Each of the searchers moves continuously along his line in both directions of his starting point. When the target is valuable as a person lost on one of disjoint roads, or is serious as a car filled with explosives which moves randomly in one of disjoint roads, in these cases the search effort must be unrestricted and then we can use more than one searcher. In this paper we show the existence of a search plan such that the expected value of the first meeting time between the target and one of the two searchers is minimum.展开更多
The strong non-deterministic polynomial-hard( NP-hard)character of job shop scheduling problem( JSSP) has been acknowledged widely and it becomes stronger when attaches the nowait constraint,which widely exists in man...The strong non-deterministic polynomial-hard( NP-hard)character of job shop scheduling problem( JSSP) has been acknowledged widely and it becomes stronger when attaches the nowait constraint,which widely exists in many production processes,such as chemistry process, metallurgical process. However,compared with the massive research on traditional job shop problem,little attention has been paid on the no-wait constraint.Therefore,in this paper, we have dealt with this problem by decomposing it into two sub-problems, the timetabling and sequencing problems,in traditional frame work. A new efficient combined non-order timetabling method,coordinated with objective of total tardiness,is proposed for the timetabling problems. As for the sequencing one,we have presented a modified complete local search with memory combined by crossover operator and distance counting. The entire algorithm was tested on well-known benchmark problems and compared with several existing algorithms.Computational experiments showed that our proposed algorithm performed both effectively and efficiently.展开更多
In this paper, we study the quasi-coordinated search technique for a lost target assumed to move randomly on one of two disjoint lines according to a random walk motion, where there are two searchers beginning their s...In this paper, we study the quasi-coordinated search technique for a lost target assumed to move randomly on one of two disjoint lines according to a random walk motion, where there are two searchers beginning their search from the origin on the first line and other two searchers begin their search from the origin on the second line. But the motion of the two searchers on the first line is independent from the motion of the other two searchers on the second line. Here we introduce a model of search plan and investigate the expected value of the first meeting time between one of the searchers and the lost target. Also, we prove the existence of a search plan which minimizes the expected value of the first meeting time between one of the searchers and the target.展开更多
This paper presents an enhanced Particle Swarm Optimization (PSO) algorithm applied to the reactive power compensation (RPC) problem. It is based on the combination of Genetic Algorithm (GA) and PSO. Our approach inte...This paper presents an enhanced Particle Swarm Optimization (PSO) algorithm applied to the reactive power compensation (RPC) problem. It is based on the combination of Genetic Algorithm (GA) and PSO. Our approach integrates the merits of both genetic algorithms (GAs) and particle swarm optimization (PSO) and it has two characteristic features. Firstly, the algorithm is initialized by a set of a random particle which traveling through the search space, during this travel an evolution of these particles is performed by a hybrid PSO with GA to get approximate no dominated solution. Secondly, to improve the solution quality, dynamic version of pattern search technique is implemented as neighborhood search engine where it intends to explore the less-crowded area in the current archive to possibly obtain more nondominated solutions. The proposed approach is carried out on the standard IEEE 30-bus 6-generator test system. The results demonstrate the capabilities of the proposed approach to generate true and well-distributed Pareto optimal nondominated solutions of the multiobjective RPC.展开更多
Diagnosing the cardiovascular disease is one of the biggest medical difficulties in recent years.Coronary cardiovascular(CHD)is a kind of heart and blood vascular disease.Predicting this sort of cardiac illness leads ...Diagnosing the cardiovascular disease is one of the biggest medical difficulties in recent years.Coronary cardiovascular(CHD)is a kind of heart and blood vascular disease.Predicting this sort of cardiac illness leads to more precise decisions for cardiac disorders.Implementing Grid Search Optimization(GSO)machine training models is therefore a useful way to forecast the sickness as soon as possible.The state-of-the-art work is the tuning of the hyperparameter together with the selection of the feature by utilizing the model search to minimize the false-negative rate.Three models with a cross-validation approach do the required task.Feature Selection based on the use of statistical and correlation matrices for multivariate analysis.For Random Search and Grid Search models,extensive comparison findings are produced utilizing retrieval,F1 score,and precision measurements.The models are evaluated using the metrics and kappa statistics that illustrate the three models’comparability.The study effort focuses on optimizing function selection,tweaking hyperparameters to improve model accuracy and the prediction of heart disease by examining Framingham datasets using random forestry classification.Tuning the hyperparameter in the model of grid search thus decreases the erroneous rate achieves global optimization.展开更多
A quantum spin liquid (QSL) is an exotic quantum ground state that does not break conventional symmetries and where the spins in the system remain dynamic down to zero temperature. Unlike a trivial paramagnetic state,...A quantum spin liquid (QSL) is an exotic quantum ground state that does not break conventional symmetries and where the spins in the system remain dynamic down to zero temperature. Unlike a trivial paramagnetic state, it features long-range quantum entanglement and supports fractionalized excitations.展开更多
Background In anticipation of its great potential application to natural human-computer interaction and health monitoring,heart-rate(HR)estimation based on remote photoplethysmography has recently attracted increasing...Background In anticipation of its great potential application to natural human-computer interaction and health monitoring,heart-rate(HR)estimation based on remote photoplethysmography has recently attracted increasing research attention.Whereas the recent deep-learning-based HR estimation methods have achieved promising performance,their computational costs remain high,particularly in mobile-computing scenarios.Methods We propose a neural architecture search approach for HR estimation to automatically search a lightweight network that can achieve even higher accuracy than a complex network while reducing the computational cost.First,we define the regions of interests based on face landmarks and then extract the raw temporal pulse signals from the R,G,and B channels in each ROI.Then,pulse-related signals are extracted using a plane-orthogonal-to-skin algorithm,which are combined with the R and G channel signals to create a spatial-temporal map.Finally,a differentiable architecture search approach is used for the network-structure search.Results Compared with the state-of-the-art methods on the public-domain VIPL-HR and PURE databases,our method achieves better HR estimation performance in terms of several evaluation metrics while requiring a much lower computational cost1.展开更多
The problem of minimizing the maximum lateness on a single machine with family setups is considered.To solve the problem, dominance property is studied and then introduced into the tabu search(TS) algorithm.With the...The problem of minimizing the maximum lateness on a single machine with family setups is considered.To solve the problem, dominance property is studied and then introduced into the tabu search(TS) algorithm.With the dominance property, most unpromising neighbors can be excluded from the neighborhood, which makes the search process always focus on the most promising areas of the solution space.The proposed algorithms are tested both on the randomly generated problems and on the real-life problems.Computational results show that the proposed TS algorithm outperforms the best existing algorithm and can solve the real-life problems in about 1.3 on average.展开更多
For the unsorted database quantum search with the unknown fraction λ of target items, there are mainly two kinds of methods, i.e., fixed-point and trail-and-error.(i) In terms of the fixed-point method, Yoder et al. ...For the unsorted database quantum search with the unknown fraction λ of target items, there are mainly two kinds of methods, i.e., fixed-point and trail-and-error.(i) In terms of the fixed-point method, Yoder et al. [Phys. Rev. Lett.113 210501(2014)] claimed that the quadratic speedup over classical algorithms has been achieved. However, in this paper, we point out that this is not the case, because the query complexity of Yoder’s algorithm is actually in O(1/λ01/2)rather than O(1/λ1/2), where λ0 is a known lower bound of λ.(ii) In terms of the trail-and-error method, currently the algorithm without randomness has to take more than 1 times queries or iterations than the algorithm with randomly selected parameters. For the above problems, we provide the first hybrid quantum search algorithm based on the fixed-point and trail-and-error methods, where the matched multiphase Grover operations are trialed multiple times and the number of iterations increases exponentially along with the number of trials. The upper bound of expected queries as well as the optimal parameters are derived. Compared with Yoder’s algorithm, the query complexity of our algorithm indeed achieves the optimal scaling in λ for quantum search, which reconfirms the practicality of the fixed-point method. In addition, our algorithm also does not contain randomness, and compared with the existing deterministic algorithm, the query complexity can be reduced by about 1/3. Our work provides a new idea for the research on fixed-point and trial-and-error quantum search.展开更多
This paper presents the search technique for a lost target. A lost target is random walker on one of two intersected real lines, and the purpose is to detect the target as fast as possible. We have four searchers star...This paper presents the search technique for a lost target. A lost target is random walker on one of two intersected real lines, and the purpose is to detect the target as fast as possible. We have four searchers start from the point of intersection, they follow the so called Quasi-Coordinated search plan. The expected value of the first meeting time between one of the searchers and the target is investigated, also we show the existence of the optimal search strategy which minimizes this first meeting time.展开更多
基金supported by National Natural Science Foundation of China(No.62073212)Shanghai Science and Technology Commission(No.23ZR1426600).
文摘As the number of automated guided vehicles(AGVs)within automated container terminals(ACT)continues to rise,conflicts have becomemore frequent.Addressing point and edge conflicts ofAGVs,amulti-AGVconflict-free path planning model has been formulated to minimize the total path length of AGVs between shore bridges and yards.For larger terminalmaps and complex environments,the grid method is employed to model AGVs’road networks.An improved bounded conflict-based search(IBCBS)algorithmtailored to ACT is proposed,leveraging the binary tree principle to resolve conflicts and employing focal search to expand the search range.Comparative experiments involving 60 AGVs indicate a reduction in computing time by 37.397%to 64.06%while maintaining the over cost within 1.019%.Numerical experiments validate the proposed algorithm’s efficacy in enhancing efficiency and ensuring solution quality.
基金supported in part by the Major Scientific and Technological Projects of CNPC under Grant ZD2019-183-006.
文摘Link prediction,also known as Knowledge Graph Completion(KGC),is the common task in Knowledge Graphs(KGs)to predict missing connections between entities.Most existing methods focus on designing shallow,scalable models,which have less expressive than deep,multi-layer models.Furthermore,most operations like addition,matrix multiplications or factorization are handcrafted based on a few known relation patterns in several wellknown datasets,such as FB15k,WN18,etc.However,due to the diversity and complex nature of real-world data distribution,it is inherently difficult to preset all latent patterns.To address this issue,we proposeKGE-ANS,a novel knowledge graph embedding framework for general link prediction tasks using automatic network search.KGEANS can learn a deep,multi-layer effective architecture to adapt to different datasets through neural architecture search.In addition,the general search spacewe designed is tailored forKGtasks.We performextensive experiments on benchmark datasets and the dataset constructed in this paper.The results show that our KGE-ANS outperforms several state-of-the-art methods,especially on these datasets with complex relation patterns.
基金Ministry of Education in Saudi Arabia for funding this research work through the project number (IFPSAU-2021/01/17793)rch work through the project number (IFPSAU-2021/01/17793)。
文摘In recent years,cloud computing has provided a Software As A Service(SaaS)platform where the software can be reused and applied to fulfill compli-cated user demands according to specific Quality of Services(QoS)constraints.The user requirements are formulated as a workflow consisting of a set of tasks.However,many services may satisfy the functionality of each task;thus,searching for the composition of the optimal service while maximizing the QoS is formulated as an NP-hard problem.This work will introduce a hybrid Artificial Bee Colony(ABC)with a Cuckoo Search(CS)algorithm to untangle service composition problem.The ABC is a well-known metaheuristic algorithm that can be applied when dealing with different NP-hard problems with an outstanding record of performance.However,the ABC suffers from a slow convergence problem.Therefore,the CS is used to overcome the ABC’s limitations by allowing the abandoned bees to enhance their search and override the local optimum.The proposed hybrid algorithm has been tested on 19 datasets and then compared with two standard algorithms(ABC and CS)and three state-of-the-art swarm-based composition algorithms.In addition,extensive parameter study experiments were conducted to set up the proposed algorithm’s parameters.The results indicate that the proposed algorithm outperforms the standard algorithms in the three comparison criteria(bestfitness value,averagefitness value,and average execution time)overall datasets in 30 different runs.Furthermore,the proposed algorithm also exhibits better performance than the state–of–the–art algorithms in the three comparison criteria over 30 different runs.
文摘The discovery of ubiquitous habitable extrasolar planets,combined with revolutionary advances in instrumentation and observational capabilities,has ushered in a renaissance in the search for extraterrestrial intelligence(SETI).Large scale SETI activities are now underway at numerous international facilities.The Five-hundred-meter Aperture Spherical radio Telescope(FAST)is the largest single-aperture radio telescope in the world,and is well positioned to conduct sensitive searches for radio emission indicative of exo-intelligence.SETI is one of the five key science goals specified in the original FAST project plan.A collaboration with the Breakthrough Listen Initiative was initiated in 2016 with a joint statement signed both by Dr.Jun Yan,the then director of National Astronomical Observatories,Chinese Academy of Sciences(NAOC),and Dr.Peter Worden,Chairman of the Breakthrough Prize Foundation.In this paper,we highlight some of the unique features of FAST that will allow for novel SETI observations.We identify and describe three different signal types indicative of a technological source,namely,narrow band,wide-band artificially dispersed and modulated signals.Here,we propose observations with FAST to achieve sensitivities never before explored.For nearby exoplanets,such as TESS targets,FAST will be sensitive to an EIRP of 1.9×1011 W,well within the reach of current human technology.For the Andromeda Galaxy,FAST will be able to detect any Kardashev type II or more advanced civilization there.
基金supported by the National Natural Science Foundation of China(7140104871671059)the National Natural Science Funds of China for Innovative Research Groups(71521001)
文摘This paper studies the problem of using multiple unmanned air vehicles (UAVs) to search for moving targets with sensing capabilities. When multiple UAVs (multi-UAV) search for a number of moving targets in the mission area, the targets can intermittently obtain the position information of the UAVs from sensing devices, and take appropriate actions to increase the distance between themselves and the UAVs. Aiming at this problem, an environment model is established using the search map, and the updating method of the search map is extended by considering the sensing capabilities of the moving targets. A multi-UAV search path planning optimization model based on the model predictive control (MPC) method is constructed, and a hybrid particle swarm optimization algorithm with a crossover operator is designed to solve the model. Simulation results show that the proposed method can effectively improve the cooperative search efficiency and can find more targets per unit time compared with the coverage search method and the random search method.
文摘A target is assumed to move according to a Brownian motion on the real line. The searcher starts from the origin and moves in the two directions from the starting point. The object is to detect the target. The purpose of this paper is to find the conditions under which the expected value of the first meeting time of the searcher and the target is finite, and to show the existence of a search plan which made this expected value minimum.
基金National Natural Science Foundation of China(No.61203180)
文摘Searching for maritime moving targets using satellites is an attracting but rather difficult problem due to the satellites' orbits and discontinuous visible time windows.From a long term cyclic view,a non-myopic method based on reinforcement learning(RL)for multi-pass multi-targets searching was proposed.It learnt system behaviors step by step from each observation which resulted in a dynamic progressive way.Then it decided and adjusted optimal actions in each observation opportunity.System states were indicated by expected information gain.Neural networks algorithm was used to approximate parameters of control policy.Simulation results show that our approach with sufficient training performs significantly better than other myopic approaches which make local optimal decisions for each individual observation opportunity.
基金supported by the National Natural Science Foundation of China(61271250)
文摘The backtracking search optimization algorithm(BSA) is one of the most recently proposed population-based evolutionary algorithms for global optimization. Due to its memory ability and simple structure, BSA has powerful capability to find global optimal solutions. However, the algorithm is still insufficient in balancing the exploration and the exploitation. Therefore, an improved adaptive backtracking search optimization algorithm combined with modified Hooke-Jeeves pattern search is proposed for numerical global optimization. It has two main parts: the BSA is used for the exploration phase and the modified pattern search method completes the exploitation phase. In particular, a simple but effective strategy of adapting one of BSA's important control parameters is introduced. The proposed algorithm is compared with standard BSA, three state-of-the-art evolutionary algorithms and three superior algorithms in IEEE Congress on Evolutionary Computation 2014(IEEE CEC2014) over six widely-used benchmarks and 22 real-parameter single objective numerical optimization benchmarks in IEEE CEC2014. The results of experiment and statistical analysis demonstrate the effectiveness and efficiency of the proposed algorithm.
基金Supported by the Natural Science Foundation of Hebei Province(F2011205023)the National Natural Science Foundation of China(61175059)。
文摘A novel subspace projection anti-jamming algorithm based on spatial blind search is proposed,which uses multiple single-constrained subspace projection parallel filters.If the direction of arrival(DOA)of a satellite signal is unknown,the traditional subspace projection anti-jamming algorithm cannot form the correct beam pointing.To overcome the problem of the traditional subspace projection algorithm,multiple single-constrained subspace projection parallel filters are used.Every single-constrained anti-jamming subspace projection algorithm obtains the optimal weight vector by searching the DOA of the satellite signal and uses the output of cross correlation as a decision criterion.Test results show that the algorithm can suppress the jamming effectively,and generate high gain toward the desired signal.The research provides a new idea for the engineering implementation of a multi-beam anti-jamming algorithm based on subspace projection.
文摘A target is assumed to move randomly on one of two disjoint lines L1 and L2 according to a stochastic process . We have two searchers start looking for the lost target from some points on the two lines separately. Each of the searchers moves continuously along his line in both directions of his starting point. When the target is valuable as a person lost on one of disjoint roads, or is serious as a car filled with explosives which moves randomly in one of disjoint roads, in these cases the search effort must be unrestricted and then we can use more than one searcher. In this paper we show the existence of a search plan such that the expected value of the first meeting time between the target and one of the two searchers is minimum.
基金National Natural Science Foundations of China(Nos.61174040,61104178)Shanghai Commission of Science and Technology,China(No.12JC1403400)the Fundamental Research Funds for the Central Universities,China
文摘The strong non-deterministic polynomial-hard( NP-hard)character of job shop scheduling problem( JSSP) has been acknowledged widely and it becomes stronger when attaches the nowait constraint,which widely exists in many production processes,such as chemistry process, metallurgical process. However,compared with the massive research on traditional job shop problem,little attention has been paid on the no-wait constraint.Therefore,in this paper, we have dealt with this problem by decomposing it into two sub-problems, the timetabling and sequencing problems,in traditional frame work. A new efficient combined non-order timetabling method,coordinated with objective of total tardiness,is proposed for the timetabling problems. As for the sequencing one,we have presented a modified complete local search with memory combined by crossover operator and distance counting. The entire algorithm was tested on well-known benchmark problems and compared with several existing algorithms.Computational experiments showed that our proposed algorithm performed both effectively and efficiently.
文摘In this paper, we study the quasi-coordinated search technique for a lost target assumed to move randomly on one of two disjoint lines according to a random walk motion, where there are two searchers beginning their search from the origin on the first line and other two searchers begin their search from the origin on the second line. But the motion of the two searchers on the first line is independent from the motion of the other two searchers on the second line. Here we introduce a model of search plan and investigate the expected value of the first meeting time between one of the searchers and the lost target. Also, we prove the existence of a search plan which minimizes the expected value of the first meeting time between one of the searchers and the target.
文摘This paper presents an enhanced Particle Swarm Optimization (PSO) algorithm applied to the reactive power compensation (RPC) problem. It is based on the combination of Genetic Algorithm (GA) and PSO. Our approach integrates the merits of both genetic algorithms (GAs) and particle swarm optimization (PSO) and it has two characteristic features. Firstly, the algorithm is initialized by a set of a random particle which traveling through the search space, during this travel an evolution of these particles is performed by a hybrid PSO with GA to get approximate no dominated solution. Secondly, to improve the solution quality, dynamic version of pattern search technique is implemented as neighborhood search engine where it intends to explore the less-crowded area in the current archive to possibly obtain more nondominated solutions. The proposed approach is carried out on the standard IEEE 30-bus 6-generator test system. The results demonstrate the capabilities of the proposed approach to generate true and well-distributed Pareto optimal nondominated solutions of the multiobjective RPC.
文摘Diagnosing the cardiovascular disease is one of the biggest medical difficulties in recent years.Coronary cardiovascular(CHD)is a kind of heart and blood vascular disease.Predicting this sort of cardiac illness leads to more precise decisions for cardiac disorders.Implementing Grid Search Optimization(GSO)machine training models is therefore a useful way to forecast the sickness as soon as possible.The state-of-the-art work is the tuning of the hyperparameter together with the selection of the feature by utilizing the model search to minimize the false-negative rate.Three models with a cross-validation approach do the required task.Feature Selection based on the use of statistical and correlation matrices for multivariate analysis.For Random Search and Grid Search models,extensive comparison findings are produced utilizing retrieval,F1 score,and precision measurements.The models are evaluated using the metrics and kappa statistics that illustrate the three models’comparability.The study effort focuses on optimizing function selection,tweaking hyperparameters to improve model accuracy and the prediction of heart disease by examining Framingham datasets using random forestry classification.Tuning the hyperparameter in the model of grid search thus decreases the erroneous rate achieves global optimization.
文摘A quantum spin liquid (QSL) is an exotic quantum ground state that does not break conventional symmetries and where the spins in the system remain dynamic down to zero temperature. Unlike a trivial paramagnetic state, it features long-range quantum entanglement and supports fractionalized excitations.
基金the National Key R&D Program of China(2018AAA0102501)the Natural Science Foundation of China(61672496)the Youth Innovation Promotion Association CAS(2018135).
文摘Background In anticipation of its great potential application to natural human-computer interaction and health monitoring,heart-rate(HR)estimation based on remote photoplethysmography has recently attracted increasing research attention.Whereas the recent deep-learning-based HR estimation methods have achieved promising performance,their computational costs remain high,particularly in mobile-computing scenarios.Methods We propose a neural architecture search approach for HR estimation to automatically search a lightweight network that can achieve even higher accuracy than a complex network while reducing the computational cost.First,we define the regions of interests based on face landmarks and then extract the raw temporal pulse signals from the R,G,and B channels in each ROI.Then,pulse-related signals are extracted using a plane-orthogonal-to-skin algorithm,which are combined with the R and G channel signals to create a spatial-temporal map.Finally,a differentiable architecture search approach is used for the network-structure search.Results Compared with the state-of-the-art methods on the public-domain VIPL-HR and PURE databases,our method achieves better HR estimation performance in terms of several evaluation metrics while requiring a much lower computational cost1.
基金supported by the Major State Basic Research Development Program of China (973 Program)(2002CB312205)the National Natural Science Foundation of China (60574077+2 种基金 60874071 60834004)the National High Technology Research and Development Program of China (863 Program) (2007AA04Z102)
文摘The problem of minimizing the maximum lateness on a single machine with family setups is considered.To solve the problem, dominance property is studied and then introduced into the tabu search(TS) algorithm.With the dominance property, most unpromising neighbors can be excluded from the neighborhood, which makes the search process always focus on the most promising areas of the solution space.The proposed algorithms are tested both on the randomly generated problems and on the real-life problems.Computational results show that the proposed TS algorithm outperforms the best existing algorithm and can solve the real-life problems in about 1.3 on average.
基金Project supported by the National Natural Science Foundation of China(Grant Nos.11504430 and 61502526)the National Basic Research Program of China(Grant No.2013CB338002)
文摘For the unsorted database quantum search with the unknown fraction λ of target items, there are mainly two kinds of methods, i.e., fixed-point and trail-and-error.(i) In terms of the fixed-point method, Yoder et al. [Phys. Rev. Lett.113 210501(2014)] claimed that the quadratic speedup over classical algorithms has been achieved. However, in this paper, we point out that this is not the case, because the query complexity of Yoder’s algorithm is actually in O(1/λ01/2)rather than O(1/λ1/2), where λ0 is a known lower bound of λ.(ii) In terms of the trail-and-error method, currently the algorithm without randomness has to take more than 1 times queries or iterations than the algorithm with randomly selected parameters. For the above problems, we provide the first hybrid quantum search algorithm based on the fixed-point and trail-and-error methods, where the matched multiphase Grover operations are trialed multiple times and the number of iterations increases exponentially along with the number of trials. The upper bound of expected queries as well as the optimal parameters are derived. Compared with Yoder’s algorithm, the query complexity of our algorithm indeed achieves the optimal scaling in λ for quantum search, which reconfirms the practicality of the fixed-point method. In addition, our algorithm also does not contain randomness, and compared with the existing deterministic algorithm, the query complexity can be reduced by about 1/3. Our work provides a new idea for the research on fixed-point and trial-and-error quantum search.
文摘This paper presents the search technique for a lost target. A lost target is random walker on one of two intersected real lines, and the purpose is to detect the target as fast as possible. We have four searchers start from the point of intersection, they follow the so called Quasi-Coordinated search plan. The expected value of the first meeting time between one of the searchers and the target is investigated, also we show the existence of the optimal search strategy which minimizes this first meeting time.