Press & Publishing Journal (PPJ),March 6,1991:Upon PPJ edit-orial office's request,Institute of Scientific and Technological lnfor-mation of China (ISTTC) made a survey on the situation that how manytheses fro...Press & Publishing Journal (PPJ),March 6,1991:Upon PPJ edit-orial office's request,Institute of Scientific and Technological lnfor-mation of China (ISTTC) made a survey on the situation that how manytheses from China scientific and technological journals have been sele-cted by the 6 most important search systems (Science Literature Index,展开更多
may incur significant bandwidth for executing more com- plicated search queries such as multiple-attribute queries. In order to reduce query overhead, KSS (keyword-set search) by Gnawali partitions the index by a set ...may incur significant bandwidth for executing more com- plicated search queries such as multiple-attribute queries. In order to reduce query overhead, KSS (keyword-set search) by Gnawali partitions the index by a set of keywords. However, a KSS index is considerably larger than a standard inverted index, since there are more word sets than there are individual words. And the insert overhead and storage overhead are obviously un- acceptable for full-text search on a collection of documents even if KSS uses the distance window technology. In this paper, we extract the relationship information between query keywords from websites’ queries logs to improve performance of KSS system. Experiments results clearly demonstrated that the improved keyword-set search system based on keywords relationship (KRBKSS) is more efficient than KSS index in insert overhead and storage overhead, and a standard inverted index in terms of communication costs for query.展开更多
A wireless search system was integrated on Windows 2000 server.Based on the communication principle between wireless data and Internet,the object expression of search file,the automatic query of document information,t...A wireless search system was integrated on Windows 2000 server.Based on the communication principle between wireless data and Internet,the object expression of search file,the automatic query of document information,the segment browsing of result information,and the receiving and sending of user information were realized by using Active Server Page 3.0,VB Script,WML Script insert languages and object orient database technology.The requirement querying information of material processing through Internet by GPRS,WAP mobile handset and so on was accomplished.展开更多
This paper introduces a parallel search system for dynamic multi-objective traveling salesman problem. We design a multi-objective TSP in a stochastic dynamic environment. This dynamic setting of the problem is very u...This paper introduces a parallel search system for dynamic multi-objective traveling salesman problem. We design a multi-objective TSP in a stochastic dynamic environment. This dynamic setting of the problem is very useful for routing in ad-hoc networks. The proposed search system first uses parallel processors to identify the extreme solutions of the search space for each ofk objectives individually at the same time. These solutions are merged into the so-called hit-frequency matrix E. The solutions in E are then searched by parallel processors and evaluated for dominance relationship. The search system is implemented in two different ways master-worker architecture and pipeline architecture.展开更多
This demo shows a time-based microblog research system which developed based on the time profile to estimate the query model,the document model and rank function for microblog search.The system exploits the time profi...This demo shows a time-based microblog research system which developed based on the time profile to estimate the query model,the document model and rank function for microblog search.The system exploits the time profile to boost the performance of microblog search.A brief description of the time-based query model,time-based document model and time-based similarity score is introduced.The index strategy for temporal microblog search is described.Using TREC 2011 and TREC 2012 microblog retrieval collection,the examples of microblog search results are demonstrated.展开更多
Optimizing Flow Path Design(FPD)is a popular research area in transportation system design,but its application to Overhead Transportation Systems(OTSs)has been limited.This study focuses on optimizing a double-spine f...Optimizing Flow Path Design(FPD)is a popular research area in transportation system design,but its application to Overhead Transportation Systems(OTSs)has been limited.This study focuses on optimizing a double-spine flow path design for OTSs with 10 stations by minimizing the total travel distance for both loaded and empty flows.We employ transportation methods,specifically the North-West Corner and Stepping-Stone methods,to determine empty vehicle travel flows.Additionally,the Tabu Search(TS)algorithm is applied to branch the 10 stations into two main layout branches.The results obtained from our proposed method demonstrate a reduction in the objective function value compared to the initial feasible solution.Furthermore,we explore howchanges in the parameters of the TS algorithm affect the optimal result.We validate the feasibility of our approach by comparing it with relevant literature and conducting additional tests on layouts with 20 and 30 stations.展开更多
The jamming resource allocation problem of the aircraft formation cooperatively jamming netted radar system is investigated.An adaptive allocation strategy based on dynamic adaptive discrete cuckoo search algorithm(DA...The jamming resource allocation problem of the aircraft formation cooperatively jamming netted radar system is investigated.An adaptive allocation strategy based on dynamic adaptive discrete cuckoo search algorithm(DADCS)is proposed,whose core is to adjust allocation scheme of limited jamming resource of aircraft formation in real time to maintain the best jamming effectiveness against netted radar system.Firstly,considering the information fusion rules and different working modes of the netted radar system,a two-factor jamming effectiveness evaluation function is constructed,detection probability and aiming probability are adopted to characterize jamming effectiveness against netted radar system in searching and tracking mode,respectively.Then a nonconvex optimization model for cooperatively jamming netted radar system is established.Finally,a dynamic adaptive discrete cuckoo search algorithm(DADCS)is constructed by improving path update strategies and introducing a global learning mechanism,and a three-step solution method is proposed subsequently.Simulation results are provided to demonstrate the advantages of the proposed optimization strategy and the effectiveness of the improved algorithm.展开更多
Cloud computing has taken over the high-performance distributed computing area,and it currently provides on-demand services and resource polling over the web.As a result of constantly changing user service demand,the ...Cloud computing has taken over the high-performance distributed computing area,and it currently provides on-demand services and resource polling over the web.As a result of constantly changing user service demand,the task scheduling problem has emerged as a critical analytical topic in cloud computing.The primary goal of scheduling tasks is to distribute tasks to available processors to construct the shortest possible schedule without breaching precedence restrictions.Assignments and schedules of tasks substantially influence system operation in a heterogeneous multiprocessor system.The diverse processes inside the heuristic-based task scheduling method will result in varying makespan in the heterogeneous computing system.As a result,an intelligent scheduling algorithm should efficiently determine the priority of every subtask based on the resources necessary to lower the makespan.This research introduced a novel efficient scheduling task method in cloud computing systems based on the cooperation search algorithm to tackle an essential task and schedule a heterogeneous cloud computing problem.The basic idea of thismethod is to use the advantages of meta-heuristic algorithms to get the optimal solution.We assess our algorithm’s performance by running it through three scenarios with varying numbers of tasks.The findings demonstrate that the suggested technique beats existingmethods NewGenetic Algorithm(NGA),Genetic Algorithm(GA),Whale Optimization Algorithm(WOA),Gravitational Search Algorithm(GSA),and Hybrid Heuristic and Genetic(HHG)by 7.9%,2.1%,8.8%,7.7%,3.4%respectively according to makespan.展开更多
Most of the neural network architectures are based on human experience,which requires a long and tedious trial-and-error process.Neural architecture search(NAS)attempts to detect effective architectures without human ...Most of the neural network architectures are based on human experience,which requires a long and tedious trial-and-error process.Neural architecture search(NAS)attempts to detect effective architectures without human intervention.Evolutionary algorithms(EAs)for NAS can find better solutions than human-designed architectures by exploring a large search space for possible architectures.Using multiobjective EAs for NAS,optimal neural architectures that meet various performance criteria can be explored and discovered efficiently.Furthermore,hardware-accelerated NAS methods can improve the efficiency of the NAS.While existing reviews have mainly focused on different strategies to complete NAS,a few studies have explored the use of EAs for NAS.In this paper,we summarize and explore the use of EAs for NAS,as well as large-scale multiobjective optimization strategies and hardware-accelerated NAS methods.NAS performs well in healthcare applications,such as medical image analysis,classification of disease diagnosis,and health monitoring.EAs for NAS can automate the search process and optimize multiple objectives simultaneously in a given healthcare task.Deep neural network has been successfully used in healthcare,but it lacks interpretability.Medical data is highly sensitive,and privacy leaks are frequently reported in the healthcare industry.To solve these problems,in healthcare,we propose an interpretable neuroevolution framework based on federated learning to address search efficiency and privacy protection.Moreover,we also point out future research directions for evolutionary NAS.Overall,for researchers who want to use EAs to optimize NNs in healthcare,we analyze the advantages and disadvantages of doing so to provide detailed guidance,and propose an interpretable privacy-preserving framework for healthcare applications.展开更多
Improvement of integrated battlefield situational awareness in complex environments involving dynamic factors such as restricted communications and electromagnetic interference(EMI)has become a contentious research pr...Improvement of integrated battlefield situational awareness in complex environments involving dynamic factors such as restricted communications and electromagnetic interference(EMI)has become a contentious research problem.In certain mission environments,due to the impact of many interference sources on real-time communication or mission requirements such as the need to implement communication regulations,the mission stages are represented as a dynamic combination of several communication-available and communication-unavailable stages.Furthermore,the data interaction between unmanned aerial vehicles(UAVs)can only be performed in specific communication-available stages.Traditional cooperative search algorithms cannot handle such situations well.To solve this problem,this study constructed a distributed model predictive control(DMPC)architecture for a collaborative control of UAVs and used the Voronoi diagram generation method to re-plan the search areas of all UAVs in real time to avoid repetition of search areas and UAV collisions while improving the search efficiency and safety factor.An attention mechanism ant-colony optimization(AACO)algorithm is proposed for UAV search-control decision planning.The search strategy is adaptively updated by introducing an attention mechanism for regular instruction information,a priori information,and emergent information of the mission to satisfy different search expectations to the maximum extent.Simulation results show that the proposed algorithm achieves better search performance than traditional algorithms in restricted communication constraint scenarios.展开更多
Two novel improved variants of reptile search algorithm(RSA),RSA with opposition-based learning(ORSA)and hybrid ORSA with pattern search(ORSAPS),are proposed to determine the proportional,integral,and derivative(PID)c...Two novel improved variants of reptile search algorithm(RSA),RSA with opposition-based learning(ORSA)and hybrid ORSA with pattern search(ORSAPS),are proposed to determine the proportional,integral,and derivative(PID)controller parameters of an automatic voltage regulator(AVR)system using a novel objective function with augmented flexibility.In the proposed algorithms,the opposition-based learning technique improves the global search abilities of the original RSA algorithm,while the hybridization with the pattern search(PS)algorithm improves the local search abilities.Both algorithms are compared with the original RSA algorithm and have shown to be highly effective algorithms for tuning the PID controller parameters of an AVR system by getting superior results.Several analyses such as transient,stability,robustness,disturbance rejection,and trajectory tracking are conducted to test the performance of the proposed algorithms,which have validated the good promise of the proposed methods for controller designs.The performances of the proposed design approaches are also compared with the previously reported PID controller parameter tuning approaches to assess their success.It is shown that both proposed approaches obtain excellent and robust results among all compared ones.That is,with the adjustment of the weight factorα,which is introduced by the proposed objective function,for a system with high bandwitdh(α=1),the proposed ORSAPS-PID system has 2.08%more bandwidth than the proposed ORSA-PID system and 5.1%faster than the fastest algorithm from the literature.On the other hand,for a system where high phase and gain margins are desired(α=10),the proposed ORSA-PID system has 0.53%more phase margin and 2.18%more gain margin than the proposed ORSAPS-PID system and has 0.71%more phase margin and 2.25%more gain margin than the best performing algorithm from the literature.展开更多
Studies have established that hybrid models outperform single models.The particle swarm algorithm(PSO)-based PID(proportional-integral-derivative)controller control system is used in this study to determine the parame...Studies have established that hybrid models outperform single models.The particle swarm algorithm(PSO)-based PID(proportional-integral-derivative)controller control system is used in this study to determine the parameters that directly impact the speed and performance of the Electro Search(ESO)algorithm to obtain the global optimum point.ESPID algorithm was created by integrating this system with the ESO algorithm.The improved ESPID algorithm has been applied to 7 multi-modal benchmark test functions.The acquired results were compared to those derived using the ESO,PSO,Atom Search Optimization(ASO),and Vector Space Model(VSM)algorithms.As a consequence,it was determined that the ESPID algorithm’s mean score was superior in all functions.Additionally,while comparing the mean duration value and standard deviations,it is observed that it is faster than the ESO algorithm and produces more accurate results than other algorithms.ESPID algorithm has been used for the least cost problem in the production of pressure vessels,which is one of the real-life pro-blems.Statistical results were compared with ESO,Genetic algorithm and ASO.ESPID was found to be superior to other methods with the least production cost value of 5885.452.展开更多
In the contemporary era,the abundant availability of health information through internet and mobile technology raises concerns.Safeguarding and maintaining the confidentiality of patients’medical data becomes paramou...In the contemporary era,the abundant availability of health information through internet and mobile technology raises concerns.Safeguarding and maintaining the confidentiality of patients’medical data becomes paramount when sharing such information with authorized healthcare providers.Although electronic patient records and the internet have facilitated the exchange of medical information among healthcare providers,concerns persist regarding the security of the data.The security of Electronic Health Record Systems(EHRS)can be improved by employing the Cuckoo Search Algorithm(CS),the SHA-256 algorithm,and the Elliptic Curve Cryptography(ECC),as proposed in this study.The suggested approach involves usingCS to generate the ECCprivate key,thereby enhancing the security of data storage in EHR.The study evaluates the proposed design by comparing encoding and decoding times with alternative techniques like ECC-GA-SHA-256.The research findings indicate that the proposed design achieves faster encoding and decoding times,completing 125 and 175 iterations,respectively.Furthermore,the proposed design surpasses other encoding techniques by exhibiting encoding and decoding times that are more than 15.17%faster.These results imply that the proposed design can significantly enhance the security and performance of EHRs.Through the utilization of CS,SHA-256,and ECC,this study presents promising methods for addressing the security challenges associated with EHRs.展开更多
Aiming at the practical application of Unmanned Underwater Vehicle(UUV)in underwater combat,this paper proposes a battlefield ambush scene with UUV considering ocean current.Firstly,by establishing these mathematical ...Aiming at the practical application of Unmanned Underwater Vehicle(UUV)in underwater combat,this paper proposes a battlefield ambush scene with UUV considering ocean current.Firstly,by establishing these mathematical models of ocean current environment,target movement,and sonar detection,the probability calculation methods of single UUV searching target and multiple UUV cooperatively searching target are given respectively.Then,based on the Hybrid Quantum-behaved Particle Swarm Optimization(HQPSO)algorithm,the path with the highest target search probability is found.Finally,through simulation calculations,the influence of different UUV parameters and target parameters on the target search probability is analyzed,and the minimum number of UUVs that need to be deployed to complete the ambush task is demonstrated,and the optimal search path scheme is obtained.The method proposed in this paper provides a theoretical basis for the practical application of UUV in the future combat.展开更多
In differentiable search architecture search methods,a more efficient search space design can significantly improve the performance of the searched architecture,thus requiring people to carefully define the search spa...In differentiable search architecture search methods,a more efficient search space design can significantly improve the performance of the searched architecture,thus requiring people to carefully define the search space with different complexity according to various operations.Meanwhile rationalizing the search strategies to explore the well-defined search space will further improve the speed and efficiency of architecture search.With this in mind,we propose a faster and more efficient differentiable architecture search method,AllegroNAS.Firstly,we introduce a more efficient search space enriched by the introduction of two redefined convolution modules.Secondly,we utilize a more efficient architectural parameter regularization method,mitigating the overfitting problem during the search process and reducing the error brought about by gradient approximation.Meanwhile,we introduce a natural exponential cosine annealing method to make the learning rate of the neural network training process more suitable for the search procedure.Moreover,group convolution and data augmentation are employed to reduce the computational cost.Finally,through extensive experiments on several public datasets,we demonstrate that our method can more swiftly search for better-performing neural network architectures in a more efficient search space,thus validating the effectiveness of our approach.展开更多
Electronic medical records (EMR) facilitate the sharing of medical data, but existing sharing schemes suffer fromprivacy leakage and inefficiency. This article proposes a lightweight, searchable, and controllable EMR ...Electronic medical records (EMR) facilitate the sharing of medical data, but existing sharing schemes suffer fromprivacy leakage and inefficiency. This article proposes a lightweight, searchable, and controllable EMR sharingscheme, which employs a large attribute domain and a linear secret sharing structure (LSSS), the computationaloverhead of encryption and decryption reaches a lightweight constant level, and supports keyword search andpolicy hiding, which improves the high efficiency of medical data sharing. The dynamic accumulator technologyis utilized to enable data owners to flexibly authorize or revoke the access rights of data visitors to the datato achieve controllability of the data. Meanwhile, the data is re-encrypted by Intel Software Guard Extensions(SGX) technology to realize resistance to offline dictionary guessing attacks. In addition, blockchain technology isutilized to achieve credible accountability for abnormal behaviors in the sharing process. The experiments reflectthe obvious advantages of the scheme in terms of encryption and decryption computation overhead and storageoverhead, and theoretically prove the security and controllability in the sharing process, providing a feasible solutionfor the safe and efficient sharing of EMR.展开更多
Cell migration plays a significant role in physiological and pathological processes.Understanding the characteristics of cell movement is crucial for comprehending biological processes such as cell functionality,cell ...Cell migration plays a significant role in physiological and pathological processes.Understanding the characteristics of cell movement is crucial for comprehending biological processes such as cell functionality,cell migration,and cell–cell interactions.One of the fundamental characteristics of cell movement is the specific distribution of cell speed,containing valuable information that still requires comprehensive understanding.This article investigates the distribution of mean velocities along cell trajectories,with a focus on optimizing the efficiency of cell food search in the context of the entire colony.We confirm that the specific velocity distribution in the experiments corresponds to an optimal search efficiency when spatial weighting is considered.The simulation results indicate that the distribution of average velocity does not align with the optimal search efficiency when employing average spatial weighting.However,when considering the distribution of central spatial weighting,the specific velocity distribution in the experiment is shown to correspond to the optimal search efficiency.Our simulations reveal that for any given distribution of average velocity,a specific central spatial weighting can be identified among the possible central spatial weighting that aligns with the optimal search strategy.Additionally,our work presents a method for determining the spatial weights embedded in the velocity distribution of cell movement.Our results have provided new avenues for further investigation of significant topics,such as relationship between cell behavior and environmental conditions throughout their evolutionary history,and how cells achieve collective cooperation through cell-cell communication.展开更多
Contract Bridge,a four-player imperfect information game,comprises two phases:bidding and playing.While computer programs excel at playing,bidding presents a challenging aspect due to the need for information exchange...Contract Bridge,a four-player imperfect information game,comprises two phases:bidding and playing.While computer programs excel at playing,bidding presents a challenging aspect due to the need for information exchange with partners and interference with communication of opponents.In this work,we introduce a Bridge bidding agent that combines supervised learning,deep reinforcement learning via self-play,and a test-time search approach.Our experiments demonstrate that our agent outperforms WBridge5,a highly regarded computer Bridge software that has won multiple world championships,by a performance of 0.98 IMPs(international match points)per deal over 10000 deals,with a much cost-effective approach.The performance significantly surpasses previous state-of-the-art(0.85 IMPs per deal).Note 0.1 IMPs per deal is a significant improvement in Bridge bidding.展开更多
In recent years, a large number of approaches to constrained multi-objective optimization problems(CMOPs) have been proposed, focusing on developing tweaked strategies and techniques for handling constraints. However,...In recent years, a large number of approaches to constrained multi-objective optimization problems(CMOPs) have been proposed, focusing on developing tweaked strategies and techniques for handling constraints. However, an overly finetuned strategy or technique might overfit some problem types,resulting in a lack of versatility. In this article, we propose a generic search strategy that performs an even search in a promising region. The promising region, determined by obtained feasible non-dominated solutions, possesses two general properties.First, the constrained Pareto front(CPF) is included in the promising region. Second, as the number of feasible solutions increases or the convergence performance(i.e., approximation to the CPF) of these solutions improves, the promising region shrinks. Then we develop a new strategy named even search,which utilizes the non-dominated solutions to accelerate convergence and escape from local optima, and the feasible solutions under a constraint relaxation condition to exploit and detect feasible regions. Finally, a diversity measure is adopted to make sure that the individuals in the population evenly cover the valuable areas in the promising region. Experimental results on 45 instances from four benchmark test suites and 14 real-world CMOPs have demonstrated that searching evenly in the promising region can achieve competitive performance and excellent versatility compared to 11 most state-of-the-art methods tailored for CMOPs.展开更多
Prompt radiation emitted during accelerator operation poses a significant health risk,necessitating a thorough search and securing of hazardous areas prior to initiation.Currently,manual sweep methods are employed.How...Prompt radiation emitted during accelerator operation poses a significant health risk,necessitating a thorough search and securing of hazardous areas prior to initiation.Currently,manual sweep methods are employed.However,the limitations of manual sweeps have become increasingly evident with the implementation of large-scale accelerators.By leveraging advancements in machine vision technology,the automatic identification of stranded personnel in controlled areas through camera imagery presents a viable solution for efficient search and security.Given the criticality of personal safety for stranded individuals,search and security processes must be sufficiently reliable.To ensure comprehensive coverage,180°camera groups were strategically positioned on both sides of the accelerator tunnel to eliminate blind spots within the monitoring range.The YOLOV8 network model was modified to enable the detection of small targets,such as hands and feet,as well as larger targets formed by individuals near the cameras.Furthermore,the system incorporates a pedestrian recognition model that detects human body parts,and an information fusion strategy is used to integrate the detected head,hands,and feet with the identified pedestrians as a cohesive unit.This strategy enhanced the capability of the model to identify pedestrians obstructed by equipment,resulting in a notable improvement in the recall rate.Specifically,recall rates of 0.915 and 0.82were obtained for Datasets 1 and 2,respectively.Although there was a slight decrease in accuracy,it aligned with the intended purpose of the search-and-secure software design.Experimental tests conducted within an accelerator tunnel demonstrated the effectiveness of this approach in achieving reliable recognition outcomes.展开更多
文摘Press & Publishing Journal (PPJ),March 6,1991:Upon PPJ edit-orial office's request,Institute of Scientific and Technological lnfor-mation of China (ISTTC) made a survey on the situation that how manytheses from China scientific and technological journals have been sele-cted by the 6 most important search systems (Science Literature Index,
基金Project supported by the National Natural Science Foundation of China (No. 60221120145) and Science & Technology Committee of Shanghai Municipality Key Project (No. 02DJ14045), China
文摘may incur significant bandwidth for executing more com- plicated search queries such as multiple-attribute queries. In order to reduce query overhead, KSS (keyword-set search) by Gnawali partitions the index by a set of keywords. However, a KSS index is considerably larger than a standard inverted index, since there are more word sets than there are individual words. And the insert overhead and storage overhead are obviously un- acceptable for full-text search on a collection of documents even if KSS uses the distance window technology. In this paper, we extract the relationship information between query keywords from websites’ queries logs to improve performance of KSS system. Experiments results clearly demonstrated that the improved keyword-set search system based on keywords relationship (KRBKSS) is more efficient than KSS index in insert overhead and storage overhead, and a standard inverted index in terms of communication costs for query.
基金Item Sponsored by Doctoral Program of Higher Education of China(97014515)
文摘A wireless search system was integrated on Windows 2000 server.Based on the communication principle between wireless data and Internet,the object expression of search file,the automatic query of document information,the segment browsing of result information,and the receiving and sending of user information were realized by using Active Server Page 3.0,VB Script,WML Script insert languages and object orient database technology.The requirement querying information of material processing through Internet by GPRS,WAP mobile handset and so on was accomplished.
文摘This paper introduces a parallel search system for dynamic multi-objective traveling salesman problem. We design a multi-objective TSP in a stochastic dynamic environment. This dynamic setting of the problem is very useful for routing in ad-hoc networks. The proposed search system first uses parallel processors to identify the extreme solutions of the search space for each ofk objectives individually at the same time. These solutions are merged into the so-called hit-frequency matrix E. The solutions in E are then searched by parallel processors and evaluated for dominance relationship. The search system is implemented in two different ways master-worker architecture and pipeline architecture.
文摘This demo shows a time-based microblog research system which developed based on the time profile to estimate the query model,the document model and rank function for microblog search.The system exploits the time profile to boost the performance of microblog search.A brief description of the time-based query model,time-based document model and time-based similarity score is introduced.The index strategy for temporal microblog search is described.Using TREC 2011 and TREC 2012 microblog retrieval collection,the examples of microblog search results are demonstrated.
基金funded by Ho Chi Minh City University of Technology(HCMUT),VNU-HCM under Grant Number B2021-20-04.
文摘Optimizing Flow Path Design(FPD)is a popular research area in transportation system design,but its application to Overhead Transportation Systems(OTSs)has been limited.This study focuses on optimizing a double-spine flow path design for OTSs with 10 stations by minimizing the total travel distance for both loaded and empty flows.We employ transportation methods,specifically the North-West Corner and Stepping-Stone methods,to determine empty vehicle travel flows.Additionally,the Tabu Search(TS)algorithm is applied to branch the 10 stations into two main layout branches.The results obtained from our proposed method demonstrate a reduction in the objective function value compared to the initial feasible solution.Furthermore,we explore howchanges in the parameters of the TS algorithm affect the optimal result.We validate the feasibility of our approach by comparing it with relevant literature and conducting additional tests on layouts with 20 and 30 stations.
文摘The jamming resource allocation problem of the aircraft formation cooperatively jamming netted radar system is investigated.An adaptive allocation strategy based on dynamic adaptive discrete cuckoo search algorithm(DADCS)is proposed,whose core is to adjust allocation scheme of limited jamming resource of aircraft formation in real time to maintain the best jamming effectiveness against netted radar system.Firstly,considering the information fusion rules and different working modes of the netted radar system,a two-factor jamming effectiveness evaluation function is constructed,detection probability and aiming probability are adopted to characterize jamming effectiveness against netted radar system in searching and tracking mode,respectively.Then a nonconvex optimization model for cooperatively jamming netted radar system is established.Finally,a dynamic adaptive discrete cuckoo search algorithm(DADCS)is constructed by improving path update strategies and introducing a global learning mechanism,and a three-step solution method is proposed subsequently.Simulation results are provided to demonstrate the advantages of the proposed optimization strategy and the effectiveness of the improved algorithm.
文摘Cloud computing has taken over the high-performance distributed computing area,and it currently provides on-demand services and resource polling over the web.As a result of constantly changing user service demand,the task scheduling problem has emerged as a critical analytical topic in cloud computing.The primary goal of scheduling tasks is to distribute tasks to available processors to construct the shortest possible schedule without breaching precedence restrictions.Assignments and schedules of tasks substantially influence system operation in a heterogeneous multiprocessor system.The diverse processes inside the heuristic-based task scheduling method will result in varying makespan in the heterogeneous computing system.As a result,an intelligent scheduling algorithm should efficiently determine the priority of every subtask based on the resources necessary to lower the makespan.This research introduced a novel efficient scheduling task method in cloud computing systems based on the cooperation search algorithm to tackle an essential task and schedule a heterogeneous cloud computing problem.The basic idea of thismethod is to use the advantages of meta-heuristic algorithms to get the optimal solution.We assess our algorithm’s performance by running it through three scenarios with varying numbers of tasks.The findings demonstrate that the suggested technique beats existingmethods NewGenetic Algorithm(NGA),Genetic Algorithm(GA),Whale Optimization Algorithm(WOA),Gravitational Search Algorithm(GSA),and Hybrid Heuristic and Genetic(HHG)by 7.9%,2.1%,8.8%,7.7%,3.4%respectively according to makespan.
基金supported in part by the National Natural Science Foundation of China (NSFC) under Grant No.61976242in part by the Natural Science Fund of Hebei Province for Distinguished Young Scholars under Grant No.F2021202010+2 种基金in part by the Fundamental Scientific Research Funds for Interdisciplinary Team of Hebei University of Technology under Grant No.JBKYTD2002funded by Science and Technology Project of Hebei Education Department under Grant No.JZX2023007supported by 2022 Interdisciplinary Postgraduate Training Program of Hebei University of Technology under Grant No.HEBUT-YXKJC-2022122.
文摘Most of the neural network architectures are based on human experience,which requires a long and tedious trial-and-error process.Neural architecture search(NAS)attempts to detect effective architectures without human intervention.Evolutionary algorithms(EAs)for NAS can find better solutions than human-designed architectures by exploring a large search space for possible architectures.Using multiobjective EAs for NAS,optimal neural architectures that meet various performance criteria can be explored and discovered efficiently.Furthermore,hardware-accelerated NAS methods can improve the efficiency of the NAS.While existing reviews have mainly focused on different strategies to complete NAS,a few studies have explored the use of EAs for NAS.In this paper,we summarize and explore the use of EAs for NAS,as well as large-scale multiobjective optimization strategies and hardware-accelerated NAS methods.NAS performs well in healthcare applications,such as medical image analysis,classification of disease diagnosis,and health monitoring.EAs for NAS can automate the search process and optimize multiple objectives simultaneously in a given healthcare task.Deep neural network has been successfully used in healthcare,but it lacks interpretability.Medical data is highly sensitive,and privacy leaks are frequently reported in the healthcare industry.To solve these problems,in healthcare,we propose an interpretable neuroevolution framework based on federated learning to address search efficiency and privacy protection.Moreover,we also point out future research directions for evolutionary NAS.Overall,for researchers who want to use EAs to optimize NNs in healthcare,we analyze the advantages and disadvantages of doing so to provide detailed guidance,and propose an interpretable privacy-preserving framework for healthcare applications.
基金the support of the National Natural Science Foundation of China(Grant No.62076204)the Seed Foundation of Innovation and Creation for Graduate Students in Northwestern Polytechnical University(Grant No.CX2020019)in part by the China Postdoctoral Science Foundation(Grants No.2021M700337)。
文摘Improvement of integrated battlefield situational awareness in complex environments involving dynamic factors such as restricted communications and electromagnetic interference(EMI)has become a contentious research problem.In certain mission environments,due to the impact of many interference sources on real-time communication or mission requirements such as the need to implement communication regulations,the mission stages are represented as a dynamic combination of several communication-available and communication-unavailable stages.Furthermore,the data interaction between unmanned aerial vehicles(UAVs)can only be performed in specific communication-available stages.Traditional cooperative search algorithms cannot handle such situations well.To solve this problem,this study constructed a distributed model predictive control(DMPC)architecture for a collaborative control of UAVs and used the Voronoi diagram generation method to re-plan the search areas of all UAVs in real time to avoid repetition of search areas and UAV collisions while improving the search efficiency and safety factor.An attention mechanism ant-colony optimization(AACO)algorithm is proposed for UAV search-control decision planning.The search strategy is adaptively updated by introducing an attention mechanism for regular instruction information,a priori information,and emergent information of the mission to satisfy different search expectations to the maximum extent.Simulation results show that the proposed algorithm achieves better search performance than traditional algorithms in restricted communication constraint scenarios.
文摘Two novel improved variants of reptile search algorithm(RSA),RSA with opposition-based learning(ORSA)and hybrid ORSA with pattern search(ORSAPS),are proposed to determine the proportional,integral,and derivative(PID)controller parameters of an automatic voltage regulator(AVR)system using a novel objective function with augmented flexibility.In the proposed algorithms,the opposition-based learning technique improves the global search abilities of the original RSA algorithm,while the hybridization with the pattern search(PS)algorithm improves the local search abilities.Both algorithms are compared with the original RSA algorithm and have shown to be highly effective algorithms for tuning the PID controller parameters of an AVR system by getting superior results.Several analyses such as transient,stability,robustness,disturbance rejection,and trajectory tracking are conducted to test the performance of the proposed algorithms,which have validated the good promise of the proposed methods for controller designs.The performances of the proposed design approaches are also compared with the previously reported PID controller parameter tuning approaches to assess their success.It is shown that both proposed approaches obtain excellent and robust results among all compared ones.That is,with the adjustment of the weight factorα,which is introduced by the proposed objective function,for a system with high bandwitdh(α=1),the proposed ORSAPS-PID system has 2.08%more bandwidth than the proposed ORSA-PID system and 5.1%faster than the fastest algorithm from the literature.On the other hand,for a system where high phase and gain margins are desired(α=10),the proposed ORSA-PID system has 0.53%more phase margin and 2.18%more gain margin than the proposed ORSAPS-PID system and has 0.71%more phase margin and 2.25%more gain margin than the best performing algorithm from the literature.
文摘Studies have established that hybrid models outperform single models.The particle swarm algorithm(PSO)-based PID(proportional-integral-derivative)controller control system is used in this study to determine the parameters that directly impact the speed and performance of the Electro Search(ESO)algorithm to obtain the global optimum point.ESPID algorithm was created by integrating this system with the ESO algorithm.The improved ESPID algorithm has been applied to 7 multi-modal benchmark test functions.The acquired results were compared to those derived using the ESO,PSO,Atom Search Optimization(ASO),and Vector Space Model(VSM)algorithms.As a consequence,it was determined that the ESPID algorithm’s mean score was superior in all functions.Additionally,while comparing the mean duration value and standard deviations,it is observed that it is faster than the ESO algorithm and produces more accurate results than other algorithms.ESPID algorithm has been used for the least cost problem in the production of pressure vessels,which is one of the real-life pro-blems.Statistical results were compared with ESO,Genetic algorithm and ASO.ESPID was found to be superior to other methods with the least production cost value of 5885.452.
文摘In the contemporary era,the abundant availability of health information through internet and mobile technology raises concerns.Safeguarding and maintaining the confidentiality of patients’medical data becomes paramount when sharing such information with authorized healthcare providers.Although electronic patient records and the internet have facilitated the exchange of medical information among healthcare providers,concerns persist regarding the security of the data.The security of Electronic Health Record Systems(EHRS)can be improved by employing the Cuckoo Search Algorithm(CS),the SHA-256 algorithm,and the Elliptic Curve Cryptography(ECC),as proposed in this study.The suggested approach involves usingCS to generate the ECCprivate key,thereby enhancing the security of data storage in EHR.The study evaluates the proposed design by comparing encoding and decoding times with alternative techniques like ECC-GA-SHA-256.The research findings indicate that the proposed design achieves faster encoding and decoding times,completing 125 and 175 iterations,respectively.Furthermore,the proposed design surpasses other encoding techniques by exhibiting encoding and decoding times that are more than 15.17%faster.These results imply that the proposed design can significantly enhance the security and performance of EHRs.Through the utilization of CS,SHA-256,and ECC,this study presents promising methods for addressing the security challenges associated with EHRs.
文摘Aiming at the practical application of Unmanned Underwater Vehicle(UUV)in underwater combat,this paper proposes a battlefield ambush scene with UUV considering ocean current.Firstly,by establishing these mathematical models of ocean current environment,target movement,and sonar detection,the probability calculation methods of single UUV searching target and multiple UUV cooperatively searching target are given respectively.Then,based on the Hybrid Quantum-behaved Particle Swarm Optimization(HQPSO)algorithm,the path with the highest target search probability is found.Finally,through simulation calculations,the influence of different UUV parameters and target parameters on the target search probability is analyzed,and the minimum number of UUVs that need to be deployed to complete the ambush task is demonstrated,and the optimal search path scheme is obtained.The method proposed in this paper provides a theoretical basis for the practical application of UUV in the future combat.
基金This work was supported in part by the National Natural Science Foundation of China under Grant 61305001the Natural Science Foundation of Heilongjiang Province of China under Grant F201222.
文摘In differentiable search architecture search methods,a more efficient search space design can significantly improve the performance of the searched architecture,thus requiring people to carefully define the search space with different complexity according to various operations.Meanwhile rationalizing the search strategies to explore the well-defined search space will further improve the speed and efficiency of architecture search.With this in mind,we propose a faster and more efficient differentiable architecture search method,AllegroNAS.Firstly,we introduce a more efficient search space enriched by the introduction of two redefined convolution modules.Secondly,we utilize a more efficient architectural parameter regularization method,mitigating the overfitting problem during the search process and reducing the error brought about by gradient approximation.Meanwhile,we introduce a natural exponential cosine annealing method to make the learning rate of the neural network training process more suitable for the search procedure.Moreover,group convolution and data augmentation are employed to reduce the computational cost.Finally,through extensive experiments on several public datasets,we demonstrate that our method can more swiftly search for better-performing neural network architectures in a more efficient search space,thus validating the effectiveness of our approach.
基金the Natural Science Foundation of Hebei Province under Grant Number F2021201052.
文摘Electronic medical records (EMR) facilitate the sharing of medical data, but existing sharing schemes suffer fromprivacy leakage and inefficiency. This article proposes a lightweight, searchable, and controllable EMR sharingscheme, which employs a large attribute domain and a linear secret sharing structure (LSSS), the computationaloverhead of encryption and decryption reaches a lightweight constant level, and supports keyword search andpolicy hiding, which improves the high efficiency of medical data sharing. The dynamic accumulator technologyis utilized to enable data owners to flexibly authorize or revoke the access rights of data visitors to the datato achieve controllability of the data. Meanwhile, the data is re-encrypted by Intel Software Guard Extensions(SGX) technology to realize resistance to offline dictionary guessing attacks. In addition, blockchain technology isutilized to achieve credible accountability for abnormal behaviors in the sharing process. The experiments reflectthe obvious advantages of the scheme in terms of encryption and decryption computation overhead and storageoverhead, and theoretically prove the security and controllability in the sharing process, providing a feasible solutionfor the safe and efficient sharing of EMR.
基金Project supported by the National Natural Science Foundation of China(Grant No.31971183).
文摘Cell migration plays a significant role in physiological and pathological processes.Understanding the characteristics of cell movement is crucial for comprehending biological processes such as cell functionality,cell migration,and cell–cell interactions.One of the fundamental characteristics of cell movement is the specific distribution of cell speed,containing valuable information that still requires comprehensive understanding.This article investigates the distribution of mean velocities along cell trajectories,with a focus on optimizing the efficiency of cell food search in the context of the entire colony.We confirm that the specific velocity distribution in the experiments corresponds to an optimal search efficiency when spatial weighting is considered.The simulation results indicate that the distribution of average velocity does not align with the optimal search efficiency when employing average spatial weighting.However,when considering the distribution of central spatial weighting,the specific velocity distribution in the experiment is shown to correspond to the optimal search efficiency.Our simulations reveal that for any given distribution of average velocity,a specific central spatial weighting can be identified among the possible central spatial weighting that aligns with the optimal search strategy.Additionally,our work presents a method for determining the spatial weights embedded in the velocity distribution of cell movement.Our results have provided new avenues for further investigation of significant topics,such as relationship between cell behavior and environmental conditions throughout their evolutionary history,and how cells achieve collective cooperation through cell-cell communication.
文摘Contract Bridge,a four-player imperfect information game,comprises two phases:bidding and playing.While computer programs excel at playing,bidding presents a challenging aspect due to the need for information exchange with partners and interference with communication of opponents.In this work,we introduce a Bridge bidding agent that combines supervised learning,deep reinforcement learning via self-play,and a test-time search approach.Our experiments demonstrate that our agent outperforms WBridge5,a highly regarded computer Bridge software that has won multiple world championships,by a performance of 0.98 IMPs(international match points)per deal over 10000 deals,with a much cost-effective approach.The performance significantly surpasses previous state-of-the-art(0.85 IMPs per deal).Note 0.1 IMPs per deal is a significant improvement in Bridge bidding.
基金partly supported by the National Natural Science Foundation of China(62076225)。
文摘In recent years, a large number of approaches to constrained multi-objective optimization problems(CMOPs) have been proposed, focusing on developing tweaked strategies and techniques for handling constraints. However, an overly finetuned strategy or technique might overfit some problem types,resulting in a lack of versatility. In this article, we propose a generic search strategy that performs an even search in a promising region. The promising region, determined by obtained feasible non-dominated solutions, possesses two general properties.First, the constrained Pareto front(CPF) is included in the promising region. Second, as the number of feasible solutions increases or the convergence performance(i.e., approximation to the CPF) of these solutions improves, the promising region shrinks. Then we develop a new strategy named even search,which utilizes the non-dominated solutions to accelerate convergence and escape from local optima, and the feasible solutions under a constraint relaxation condition to exploit and detect feasible regions. Finally, a diversity measure is adopted to make sure that the individuals in the population evenly cover the valuable areas in the promising region. Experimental results on 45 instances from four benchmark test suites and 14 real-world CMOPs have demonstrated that searching evenly in the promising region can achieve competitive performance and excellent versatility compared to 11 most state-of-the-art methods tailored for CMOPs.
文摘Prompt radiation emitted during accelerator operation poses a significant health risk,necessitating a thorough search and securing of hazardous areas prior to initiation.Currently,manual sweep methods are employed.However,the limitations of manual sweeps have become increasingly evident with the implementation of large-scale accelerators.By leveraging advancements in machine vision technology,the automatic identification of stranded personnel in controlled areas through camera imagery presents a viable solution for efficient search and security.Given the criticality of personal safety for stranded individuals,search and security processes must be sufficiently reliable.To ensure comprehensive coverage,180°camera groups were strategically positioned on both sides of the accelerator tunnel to eliminate blind spots within the monitoring range.The YOLOV8 network model was modified to enable the detection of small targets,such as hands and feet,as well as larger targets formed by individuals near the cameras.Furthermore,the system incorporates a pedestrian recognition model that detects human body parts,and an information fusion strategy is used to integrate the detected head,hands,and feet with the identified pedestrians as a cohesive unit.This strategy enhanced the capability of the model to identify pedestrians obstructed by equipment,resulting in a notable improvement in the recall rate.Specifically,recall rates of 0.915 and 0.82were obtained for Datasets 1 and 2,respectively.Although there was a slight decrease in accuracy,it aligned with the intended purpose of the search-and-secure software design.Experimental tests conducted within an accelerator tunnel demonstrated the effectiveness of this approach in achieving reliable recognition outcomes.
