A search strategy based on the maximal information gain principle is presented for the cued search of phased array radars. First, the method for the determination of the cued search region, arrangement of beam positio...A search strategy based on the maximal information gain principle is presented for the cued search of phased array radars. First, the method for the determination of the cued search region, arrangement of beam positions, and the calculation of the prior probability distribution of each beam position is discussed. And then, two search algorithms based on information gain are proposed using Shannon entropy and Kullback-Leibler entropy, respectively. With the proposed strategy, the information gain of each beam position is predicted before the radar detection, and the observation is made in the beam position with the maximal information gain. Compared with the conventional method of sequential search and confirm search, simulation results show that the proposed search strategy can distinctly improve the search performance and save radar time resources with the same given detection probability.展开更多
This paper proposes an enhanced arithmetic optimization algorithm(AOA)called PSAOA that incorporates the proposed probabilistic search strategy to increase the searching quality of the original AOA.Furthermore,an adju...This paper proposes an enhanced arithmetic optimization algorithm(AOA)called PSAOA that incorporates the proposed probabilistic search strategy to increase the searching quality of the original AOA.Furthermore,an adjustable parameter is also developed to balance the exploration and exploitation operations.In addition,a jump mechanism is included in the PSAOAto assist individuals in jumping out of local optima.Using 29 classical benchmark functions,the proposed PSAOA is extensively tested.Compared to the AOA and other well-known methods,the experiments demonstrated that the proposed PSAOA beats existing comparison algorithms on the majority of the test functions.展开更多
With the development of the Internet of Things(IoT),it requires better performance from wireless sensor networks(WSNs),such as larger coverage,longer lifetime,and lower latency.However,a large amount of data generated...With the development of the Internet of Things(IoT),it requires better performance from wireless sensor networks(WSNs),such as larger coverage,longer lifetime,and lower latency.However,a large amount of data generated from monitoring and long-distance transmission places a heavy burden on sensor nodes with the limited battery power.For this,we investigate an unmanned aerial vehicles assisted mobile wireless sensor network(UAV-assisted WSN)to prolong the network lifetime in this paper.Specifically,we use UAVs to assist the WSN in collecting data.In the current UAV-assisted WSN,the clustering and routing schemes are determined sequentially.However,such a separate consideration might not maximize the lifetime of the whole WSN due to the mutual coupling of clustering and routing.To efficiently prolong the lifetime of the WSN,we propose an integrated clustering and routing scheme that jointly optimizes the clustering and routing together.In the whole network space,it is intractable to efficiently obtain the optimal integrated clustering and routing scheme.Therefore,we propose the Monte-Las search strategy based on Monte Carlo and Las Vegas ideas,which can generate the chain matrix to guide the algorithm to find the solution faster.Unnecessary point-to-point collection leads to long collection paths,so a triangle optimization strategy is then proposed that finds a compromise path to shorten the collection path based on the geometric distribution and energy of sensor nodes.To avoid the coverage hole caused by the death of sensor nodes,the deployment of mobile sensor nodes and the preventive mechanism design are indispensable.An emergency data transmission mechanism is further proposed to reduce the latency of collecting the latency-sensitive data due to the absence of UAVs.Compared with the existing schemes,the proposed scheme can prolong the lifetime of the UAVassisted WSN at least by 360%,and shorten the collection path of UAVs by 56.24%.展开更多
The artificial bee colony （ABC） algorithm is a sim- ple and effective global optimization algorithm which has been successfully applied in practical optimization problems of various fields. However, the algorithm is...The artificial bee colony （ABC） algorithm is a sim- ple and effective global optimization algorithm which has been successfully applied in practical optimization problems of various fields. However, the algorithm is still insufficient in balancing ex- ploration and exploitation. To solve this problem, we put forward an improved algorithm with a comprehensive search mechanism. The search mechanism contains three main strategies. Firstly, the heuristic Gaussian search strategy composed of three different search equations is proposed for the employed bees, which fully utilizes and balances the exploration and exploitation of the three different search equations by introducing the selectivity probability P,. Secondly, in order to improve the search accuracy, we propose the Gbest-guided neighborhood search strategy for onlooker bees to improve the exploitation performance of ABC. Thirdly, the self- adaptive population perturbation strategy for the current colony is used by random perturbation or Gaussian perturbation to en- hance the diversity of the population. In addition, to improve the quality of the initial population, we introduce the chaotic opposition- based learning method for initialization. The experimental results and Wilcoxon signed ranks test based on 27 benchmark func- tions show that the proposed algorithm, especially for solving high dimensional and complex function optimization problems, has a higher convergence speed and search precision than ABC and three other current ABC-based algorithms.展开更多
In view of the serious reactive power loss in the rural network, improved ant colony optimization algorithm （ACOA） was used to optimize the reactive power compensation for the rural distribution system. In this stud...In view of the serious reactive power loss in the rural network, improved ant colony optimization algorithm （ACOA） was used to optimize the reactive power compensation for the rural distribution system. In this study, the traditional ACOA was improved in two aspects： one was the local search strategy, and the other was pheromone mutation and re-initialization strategies. The reactive power optimization for a county＇s distribution network showed that the improved ACOA was practicable.展开更多
In this paper, we investigate the elastic wave full-waveform inversion (FWI) based on the trust region method. The FWI is an optimization problem of minimizing the misfit between the observed data and simulated data. ...In this paper, we investigate the elastic wave full-waveform inversion (FWI) based on the trust region method. The FWI is an optimization problem of minimizing the misfit between the observed data and simulated data. Usually</span><span style="font-family:"">,</span><span style="font-family:""> the line search method is used to update the model parameters iteratively. The line search method generates a search direction first and then finds a suitable step length along the direction. In the trust region method, it defines a trial step length within a certain neighborhood of the current iterate point and then solves a trust region subproblem. The theoretical methods for the trust region FWI with the Newton type method are described. The algorithms for the truncated Newton method with the line search strategy and for the Gauss-Newton method with the trust region strategy are presented. Numerical computations of FWI for the Marmousi model by the L-BFGS method, the Gauss-Newton method and the truncated Newton method are completed. The comparisons between the line search strategy and the trust region strategy are given and show that the trust region method is more efficient than the line search method and both the Gauss-Newton and truncated Newton methods are more accurate than the L-BFGS method.展开更多
The author studies the markers of searching for a word in spontaneous oral speech of Russian-speaking elderly women. The paper puts a question about age-related features of searching strategies of elderly people. Wh...The author studies the markers of searching for a word in spontaneous oral speech of Russian-speaking elderly women. The paper puts a question about age-related features of searching strategies of elderly people. While searching the informants, as a rule, recollect the only word （a noun, including their own name）, they do not choose the most suitable nominations from the available options. They often refuse to search and realize an alternative speech strategy.展开更多
This study investigated the mechanism underlying electroacupuncture therapy for vascular dementia through electroacupuncture at the acupoints of Baihui （DU20）, Dazhui （DU14）, and bilateral Shenshu （BL23） in a ra...This study investigated the mechanism underlying electroacupuncture therapy for vascular dementia through electroacupuncture at the acupoints of Baihui （DU20）, Dazhui （DU14）, and bilateral Shenshu （BL23） in a rat model of vascular dementia produced by bilateral middle cerebral artery occlusion. Morris water maze test showed that electroacupuncture improved the learning ability of vascular dementia rats. Western blot assay revealed that the expression of p70 ribosomal protein S6 kinase and ribosomal protein S6 in vascular dementia rats was significantly increased after electroacupuncture, compared with the model group that was not treated with acupuncture. The average escape latency was also shortened after electroacupuncture, and escape strategies in the spatial probe test improved from edge and random searches, to linear and trending swim pathways. The experimental findings indicate that electroacupuncture improves learning and memory ability by up-regulating expression of p70 ribosomal protein S6 kinase and ribosomal protein S6 in the hippocampus of vascular dementia rats.展开更多
Smoke detection is the most commonly used method in early warning of fire and is widely used in forest detection.Most existing smoke detection methods contain empty spaces and obstacles which interfere with detection ...Smoke detection is the most commonly used method in early warning of fire and is widely used in forest detection.Most existing smoke detection methods contain empty spaces and obstacles which interfere with detection and extract false smoke roots.This study developed a new smoke roots search algorithm based on a multi-feature fusion dynamic extraction strategy.This determines smoke origin candidate points and region based on a multi-frame discrete confidence level.The results show that the new method provides a more complete smoke contour with no background interference,compared to the results using existing methods.Unlike video-based methods that rely on continuous frames,an adaptive threshold method was developed to build the judgment image set composed of non-consecutive frames.The smoke roots origin search algorithm increased the detection rate and significantly reduced false detection rate compared to existing methods.展开更多
In recent years,learning-based low-light image enhancement methods have shown excellent performance,but the heuristic design adopted by most methods requires high engineering skills for developers,causing expensive in...In recent years,learning-based low-light image enhancement methods have shown excellent performance,but the heuristic design adopted by most methods requires high engineering skills for developers,causing expensive inference costs that are unfriendly to the hardware platform.To handle this issue,we propose to automatically discover an efficient architecture,called progressive attentive Retinex network(PAR-Net).We define a new attentive Retinex framework by introducing the attention mechanism to strengthen structural representation.A multi-level search space containing micro-level on the operation and macro-level on the cell is established to realize meticulous construction.To endow the searched architecture with the hardware-aware property,we develop a latency-constrained progressive search strategy that successfully improves the model capability by explicitly expressing the intrinsic relationship between different models defined in the attentive Retinex framework.Extensive quantitative and qualitative experimental results fully justify the superiority of our proposed approach against other state-of-the-art methods.A series of analytical evaluations is performed to illustrate the validity of our proposed algorithm.展开更多
This paper considers a scheduling problem in industrial make-and-pack batch production process. This process equips with sequence-dependent changeover time, multipurpose storage units with limited capacity, storage ti...This paper considers a scheduling problem in industrial make-and-pack batch production process. This process equips with sequence-dependent changeover time, multipurpose storage units with limited capacity, storage time, batch splitting, partial equipment connectivity and transfer time. The objective is to make a production plan to satisfy all constraints while meeting demand requirement of packed products from various product families. This problem is NP-hard and the problem size is exponentially large for a realistic-sized problem. Therefore,we propose a genetic algorithm to handle this problem. Solutions to the problems are represented by chromosomes of product family sequences. These sequences are decoded to assign the resource for producing packed products according to forward assignment strategy and resource selection rules. These techniques greatly reduce unnecessary search space and improve search speed. In addition, design of experiment is carefully utilized to determine appropriate parameter settings. Ant colony optimization and Tabu search are also implemented for comparison. At the end of each heuristics, local search is applied for the packed product sequence to improve makespan. In an experimental analysis, all heuristics show the capability to solve large instances within reasonable computational time. In all problem instances, genetic algorithm averagely outperforms ant colony optimization and Tabu search with slightly longer computational time.展开更多
In this paper,by designing a normalized nonmonotone search strategy with the BarzilaiBorwein-type step-size,a novel local minimax method(LMM),which is a globally convergent iterative method,is proposed and analyzed to...In this paper,by designing a normalized nonmonotone search strategy with the BarzilaiBorwein-type step-size,a novel local minimax method(LMM),which is a globally convergent iterative method,is proposed and analyzed to find multiple(unstable)saddle points of nonconvex functionals in Hilbert spaces.Compared to traditional LMMs with monotone search strategies,this approach,which does not require strict decrease of the objective functional value at each iterative step,is observed to converge faster with less computations.Firstly,based on a normalized iterative scheme coupled with a local peak selection that pulls the iterative point back onto the solution submanifold,by generalizing the Zhang-Hager(ZH)search strategy in the optimization theory to the LMM framework,a kind of normalized ZH-type nonmonotone step-size search strategy is introduced,and then a novel nonmonotone LMM is constructed.Its feasibility and global convergence results are rigorously carried out under the relaxation of the monotonicity for the functional at the iterative sequences.Secondly,in order to speed up the convergence of the nonmonotone LMM,a globally convergent Barzilai-Borwein-type LMM(GBBLMM)is presented by explicitly constructing the Barzilai-Borwein-type step-size as a trial step-size of the normalized ZH-type nonmonotone step-size search strategy in each iteration.Finally,the GBBLMM algorithm is implemented to find multiple unstable solutions of two classes of semilinear elliptic boundary value problems with variational structures:one is the semilinear elliptic equations with the homogeneous Dirichlet boundary condition and another is the linear elliptic equations with semilinear Neumann boundary conditions.Extensive numerical results indicate that our approach is very effective and speeds up the LMMs significantly.展开更多
The autonomous route planning in coverage search is an important subject of unmanned aerial vehicle(UAV) mission planning. Pre-planning is simple and feasible for the coverage search mission of single UAV in regular a...The autonomous route planning in coverage search is an important subject of unmanned aerial vehicle(UAV) mission planning. Pre-planning is simple and feasible for the coverage search mission of single UAV in regular areas. As to the dynamic mission in complicated environment of multi-UAV, the route planning will encounter the difficulties of reasonable task distribution and the real-time environment changes which include the changes of the mission area, the detection of threat area, the interference of communication and so on. At this point, making the UAV to do real-time autonomous planning is necessary. However, it is hard to fulfil requirements of real-time, autonomous and efficient at the same time. According to a scalable knowledge base,this paper proposes a coverage search algorithm which is based on the mapping between the basic behavior combination and surroundings. A UAV's coverage search simulation model with random shapes is built with a discrete map to update the environment and the changes of the mission on time. Comparison of the simulation analysis and the dynamic programming shows that the method has amazing expandability and can change the search strategy feasibly. It is efficient, and the ratio of coverage redundancy can be decreased to 1.21. It also has the potentiality in real-time calculation, and the computing time can be shortened to about 2 s.展开更多
An enhanced cascading failure model integrating data mining technique is proposed in this paper.In order to better simulate the process of cascading failure propagation and further analyze the relationship between fai...An enhanced cascading failure model integrating data mining technique is proposed in this paper.In order to better simulate the process of cascading failure propagation and further analyze the relationship between failure chains,in view of a basic framework of cascading failure described in this paper,some significant improvements in emerging prevention and control measures,the subsequent failure search strategy as well as the statistical analysis for the failure chains are made elaborately.Especially,a sequential pattern mining model is employed to find out the association pertinent to the obtained failure chains.In addition,a cluster analysis model is applied to evaluate the relationship between the intermediate data and the consequence of obtained failure chain,which can provide the prediction in potential propagation path of cascading failure to reduce the risk of catastrophic events.Finally,the case studies are conducted on the IEEE 10-machine-39-bus test system as benchmark to demonstrate the validity and effectiveness of the proposed enhanced cascading failure model.Some preliminary concluding remarks and comments are drawn.展开更多
Purpose–The purpose of this paper is to design a robust tracking algorithm which is suitable for the real-time requirement and solves the mistake labeling issue in the appearance model of trackers with the spare feat...Purpose–The purpose of this paper is to design a robust tracking algorithm which is suitable for the real-time requirement and solves the mistake labeling issue in the appearance model of trackers with the spare features.Design/methodology/approach–This paper proposes a tracker to select the most discriminative randomly projected ferns and integrates a coarse-to-fine search strategy in this framework.First,the authors exploit multiple instance boosting learning to maximize the bag likelihood and select randomly projected fern from feature pool to degrade the effect of mistake labeling.Second,a coarse-to-fine search approach is first integrated into the framework of multiple instance learning(MIL)for less detections.Findings–The quantitative and qualitative experiments demonstrate that the tracker has shown favorable performance in efficiency and effective among the competitors of tracking algorithms.Originality/value–The proposed method selects the feature from the compressive domain by MIL AnyBoost and integrates the coarse-to-fine search strategy first to reduce the burden of detection.This paper designs a tracker with high speed and favorable results which is more suitable for real-time scene.展开更多
In this paper, we first discuss the direct scattering problem for a cylindrical homogeneous clastic tube with a geometrical method, and then study the inverse problem. The heuristics of B-F procedure (Best-First searc...In this paper, we first discuss the direct scattering problem for a cylindrical homogeneous clastic tube with a geometrical method, and then study the inverse problem. The heuristics of B-F procedure (Best-First search strategy) is used. The inner radius, outer radius, sound velocitics of the tube and sound velocity of the internal medium are obtained with this heuristics.展开更多
This paper introduces a software agent as a virtual player of the business game called Bakery Game. The business game is a tool to understand business and management principles through experience in a virtual world. I...This paper introduces a software agent as a virtual player of the business game called Bakery Game. The business game is a tool to understand business and management principles through experience in a virtual world. In order to construct software agents for the gaming simulation, which is able to participate in a game and become human players' worthy rival, we combine a simple model that considers the property of Bakery Game with a strategy adjustment model. The agent has so-called strategy parameters that are updated through the experience. The agent changes his strategy depending on particular situation. The agent participates in the game that is regenerated from log data in various situations.展开更多
Geoforensic techniques are being deployed in searches for hidden objects to counteract the shortcomings of conventional blunderbuss methods.Processing of crime scenes during searches for clandestine graves and buried ...Geoforensic techniques are being deployed in searches for hidden objects to counteract the shortcomings of conventional blunderbuss methods.Processing of crime scenes during searches for clandestine graves and buried objects is often destructive.Manual excavation and other invasive methods are restricted in many contemporary situations,and the location of a body is essential for forensic investigations.Geoforensics and geophysical surveys are important tools for assisting law enforcement agencies in locating crime scenes,clandestine graves,drugs,artifacts,hazardous waste,and illegal weapons and ammunitions stored underground in preparation for terrorist attacks.Geoscience search techniques such as the geoforensic search strategy are among many models used to help find mass graves,locate missing persons,and verify information acquired from incomplete intelligence.Trace amounts of soils,sediments,and other geological materials can provide geolocations and aid in the development of a primary search area.Forensic geoscience techniques and equipment such as metal detectors,magnetic surveys,electromagnetic conductivity surveys,ground penetrating radar surveys,augering(probing),detector dogs surveys,and gravity and seismic fluctuation monitoring are discussed in this paper.In addition to the location of potential graves and ambush sites,the soil beneath the decomposing cadavers can be used to predict the postmortem interval for the deceased.Soil information and geo-mapping data can provide productive intelligence for military and national security agencies.Antiquities crimes and crimes involving gemstones in which the evidence passes through many hands can be traced back to the place of origin by checking for their geo-morphology.Serious crimes,including murder,genocide,and terrorism,can be prevented by the use of operational and decisive geoforensic techniques.This paper highlights the multidisciplinary information exchange that occurs between forensic burial science,forensic geology,and trace evidence in criminal investigations.The paper also focuses on geoforensic approaches to clandestine grave searching,underwater investigations,forensic engineering fallacies,military intelligence,ambush detection,and weapons mining.展开更多
基金the High Technology Research and Development Programme of China (2003AA134030)
文摘A search strategy based on the maximal information gain principle is presented for the cued search of phased array radars. First, the method for the determination of the cued search region, arrangement of beam positions, and the calculation of the prior probability distribution of each beam position is discussed. And then, two search algorithms based on information gain are proposed using Shannon entropy and Kullback-Leibler entropy, respectively. With the proposed strategy, the information gain of each beam position is predicted before the radar detection, and the observation is made in the beam position with the maximal information gain. Compared with the conventional method of sequential search and confirm search, simulation results show that the proposed search strategy can distinctly improve the search performance and save radar time resources with the same given detection probability.
基金partially supported by the Fundamental Research Funds for the Central Universities(WUT:2022IVA067)the National Natural Science Foundation of China(Grant No.:72172112)the Fundamental Research Funds for the Central Universities(HUST:2019kfyRCPY038).
文摘This paper proposes an enhanced arithmetic optimization algorithm(AOA)called PSAOA that incorporates the proposed probabilistic search strategy to increase the searching quality of the original AOA.Furthermore,an adjustable parameter is also developed to balance the exploration and exploitation operations.In addition,a jump mechanism is included in the PSAOAto assist individuals in jumping out of local optima.Using 29 classical benchmark functions,the proposed PSAOA is extensively tested.Compared to the AOA and other well-known methods,the experiments demonstrated that the proposed PSAOA beats existing comparison algorithms on the majority of the test functions.
基金supported in part by National Natural Science Foundation of China under Grants 62122069, 62071431, 62072490 and 62301490in part by Science and Technology Development Fund of Macao SAR, China under Grant 0158/2022/A+2 种基金in part by the Guangdong Basic and Applied Basic Research Foundation (2022A1515011287)in part by MYRG202000107-IOTSCin part by FDCT SKL-IOTSC (UM)-2021-2023
文摘With the development of the Internet of Things(IoT),it requires better performance from wireless sensor networks(WSNs),such as larger coverage,longer lifetime,and lower latency.However,a large amount of data generated from monitoring and long-distance transmission places a heavy burden on sensor nodes with the limited battery power.For this,we investigate an unmanned aerial vehicles assisted mobile wireless sensor network(UAV-assisted WSN)to prolong the network lifetime in this paper.Specifically,we use UAVs to assist the WSN in collecting data.In the current UAV-assisted WSN,the clustering and routing schemes are determined sequentially.However,such a separate consideration might not maximize the lifetime of the whole WSN due to the mutual coupling of clustering and routing.To efficiently prolong the lifetime of the WSN,we propose an integrated clustering and routing scheme that jointly optimizes the clustering and routing together.In the whole network space,it is intractable to efficiently obtain the optimal integrated clustering and routing scheme.Therefore,we propose the Monte-Las search strategy based on Monte Carlo and Las Vegas ideas,which can generate the chain matrix to guide the algorithm to find the solution faster.Unnecessary point-to-point collection leads to long collection paths,so a triangle optimization strategy is then proposed that finds a compromise path to shorten the collection path based on the geometric distribution and energy of sensor nodes.To avoid the coverage hole caused by the death of sensor nodes,the deployment of mobile sensor nodes and the preventive mechanism design are indispensable.An emergency data transmission mechanism is further proposed to reduce the latency of collecting the latency-sensitive data due to the absence of UAVs.Compared with the existing schemes,the proposed scheme can prolong the lifetime of the UAVassisted WSN at least by 360%,and shorten the collection path of UAVs by 56.24%.
基金supported by the Aviation Science Foundation of China(20105196016)the Postdoctoral Science Foundation of China(2012M521807)
文摘The artificial bee colony （ABC） algorithm is a sim- ple and effective global optimization algorithm which has been successfully applied in practical optimization problems of various fields. However, the algorithm is still insufficient in balancing ex- ploration and exploitation. To solve this problem, we put forward an improved algorithm with a comprehensive search mechanism. The search mechanism contains three main strategies. Firstly, the heuristic Gaussian search strategy composed of three different search equations is proposed for the employed bees, which fully utilizes and balances the exploration and exploitation of the three different search equations by introducing the selectivity probability P,. Secondly, in order to improve the search accuracy, we propose the Gbest-guided neighborhood search strategy for onlooker bees to improve the exploitation performance of ABC. Thirdly, the self- adaptive population perturbation strategy for the current colony is used by random perturbation or Gaussian perturbation to en- hance the diversity of the population. In addition, to improve the quality of the initial population, we introduce the chaotic opposition- based learning method for initialization. The experimental results and Wilcoxon signed ranks test based on 27 benchmark func- tions show that the proposed algorithm, especially for solving high dimensional and complex function optimization problems, has a higher convergence speed and search precision than ABC and three other current ABC-based algorithms.
基金Supported by China Postdoctoral Science Foundation(20090460873)
文摘In view of the serious reactive power loss in the rural network, improved ant colony optimization algorithm （ACOA） was used to optimize the reactive power compensation for the rural distribution system. In this study, the traditional ACOA was improved in two aspects： one was the local search strategy, and the other was pheromone mutation and re-initialization strategies. The reactive power optimization for a county＇s distribution network showed that the improved ACOA was practicable.
文摘In this paper, we investigate the elastic wave full-waveform inversion (FWI) based on the trust region method. The FWI is an optimization problem of minimizing the misfit between the observed data and simulated data. Usually</span><span style="font-family:"">,</span><span style="font-family:""> the line search method is used to update the model parameters iteratively. The line search method generates a search direction first and then finds a suitable step length along the direction. In the trust region method, it defines a trial step length within a certain neighborhood of the current iterate point and then solves a trust region subproblem. The theoretical methods for the trust region FWI with the Newton type method are described. The algorithms for the truncated Newton method with the line search strategy and for the Gauss-Newton method with the trust region strategy are presented. Numerical computations of FWI for the Marmousi model by the L-BFGS method, the Gauss-Newton method and the truncated Newton method are completed. The comparisons between the line search strategy and the trust region strategy are given and show that the trust region method is more efficient than the line search method and both the Gauss-Newton and truncated Newton methods are more accurate than the L-BFGS method.
文摘The author studies the markers of searching for a word in spontaneous oral speech of Russian-speaking elderly women. The paper puts a question about age-related features of searching strategies of elderly people. While searching the informants, as a rule, recollect the only word （a noun, including their own name）, they do not choose the most suitable nominations from the available options. They often refuse to search and realize an alternative speech strategy.
基金supported by the National Natural Science Foundation of China, No. 81001541
文摘This study investigated the mechanism underlying electroacupuncture therapy for vascular dementia through electroacupuncture at the acupoints of Baihui （DU20）, Dazhui （DU14）, and bilateral Shenshu （BL23） in a rat model of vascular dementia produced by bilateral middle cerebral artery occlusion. Morris water maze test showed that electroacupuncture improved the learning ability of vascular dementia rats. Western blot assay revealed that the expression of p70 ribosomal protein S6 kinase and ribosomal protein S6 in vascular dementia rats was significantly increased after electroacupuncture, compared with the model group that was not treated with acupuncture. The average escape latency was also shortened after electroacupuncture, and escape strategies in the spatial probe test improved from edge and random searches, to linear and trending swim pathways. The experimental findings indicate that electroacupuncture improves learning and memory ability by up-regulating expression of p70 ribosomal protein S6 kinase and ribosomal protein S6 in the hippocampus of vascular dementia rats.
基金supported by the National Natural Science Foundation of China(grants no.32171797 and 31800549)。
文摘Smoke detection is the most commonly used method in early warning of fire and is widely used in forest detection.Most existing smoke detection methods contain empty spaces and obstacles which interfere with detection and extract false smoke roots.This study developed a new smoke roots search algorithm based on a multi-feature fusion dynamic extraction strategy.This determines smoke origin candidate points and region based on a multi-frame discrete confidence level.The results show that the new method provides a more complete smoke contour with no background interference,compared to the results using existing methods.Unlike video-based methods that rely on continuous frames,an adaptive threshold method was developed to build the judgment image set composed of non-consecutive frames.The smoke roots origin search algorithm increased the detection rate and significantly reduced false detection rate compared to existing methods.
文摘In recent years,learning-based low-light image enhancement methods have shown excellent performance,but the heuristic design adopted by most methods requires high engineering skills for developers,causing expensive inference costs that are unfriendly to the hardware platform.To handle this issue,we propose to automatically discover an efficient architecture,called progressive attentive Retinex network(PAR-Net).We define a new attentive Retinex framework by introducing the attention mechanism to strengthen structural representation.A multi-level search space containing micro-level on the operation and macro-level on the cell is established to realize meticulous construction.To endow the searched architecture with the hardware-aware property,we develop a latency-constrained progressive search strategy that successfully improves the model capability by explicitly expressing the intrinsic relationship between different models defined in the attentive Retinex framework.Extensive quantitative and qualitative experimental results fully justify the superiority of our proposed approach against other state-of-the-art methods.A series of analytical evaluations is performed to illustrate the validity of our proposed algorithm.
基金Thailand Research Fund (Grant #MRG5480176)National Research University Project of Thailand Office of Higher Education Commission
文摘This paper considers a scheduling problem in industrial make-and-pack batch production process. This process equips with sequence-dependent changeover time, multipurpose storage units with limited capacity, storage time, batch splitting, partial equipment connectivity and transfer time. The objective is to make a production plan to satisfy all constraints while meeting demand requirement of packed products from various product families. This problem is NP-hard and the problem size is exponentially large for a realistic-sized problem. Therefore,we propose a genetic algorithm to handle this problem. Solutions to the problems are represented by chromosomes of product family sequences. These sequences are decoded to assign the resource for producing packed products according to forward assignment strategy and resource selection rules. These techniques greatly reduce unnecessary search space and improve search speed. In addition, design of experiment is carefully utilized to determine appropriate parameter settings. Ant colony optimization and Tabu search are also implemented for comparison. At the end of each heuristics, local search is applied for the packed product sequence to improve makespan. In an experimental analysis, all heuristics show the capability to solve large instances within reasonable computational time. In all problem instances, genetic algorithm averagely outperforms ant colony optimization and Tabu search with slightly longer computational time.
基金supported by the NSFC(Grant Nos.12171148,11771138)the NSFC(Grant Nos.12101252,11971007)+2 种基金the NSFC(Grant No.11901185)the National Key R&D Program of China(Grant No.2021YFA1001300)by the Fundamental Research Funds for the Central Universities(Grant No.531118010207).
文摘In this paper,by designing a normalized nonmonotone search strategy with the BarzilaiBorwein-type step-size,a novel local minimax method(LMM),which is a globally convergent iterative method,is proposed and analyzed to find multiple(unstable)saddle points of nonconvex functionals in Hilbert spaces.Compared to traditional LMMs with monotone search strategies,this approach,which does not require strict decrease of the objective functional value at each iterative step,is observed to converge faster with less computations.Firstly,based on a normalized iterative scheme coupled with a local peak selection that pulls the iterative point back onto the solution submanifold,by generalizing the Zhang-Hager(ZH)search strategy in the optimization theory to the LMM framework,a kind of normalized ZH-type nonmonotone step-size search strategy is introduced,and then a novel nonmonotone LMM is constructed.Its feasibility and global convergence results are rigorously carried out under the relaxation of the monotonicity for the functional at the iterative sequences.Secondly,in order to speed up the convergence of the nonmonotone LMM,a globally convergent Barzilai-Borwein-type LMM(GBBLMM)is presented by explicitly constructing the Barzilai-Borwein-type step-size as a trial step-size of the normalized ZH-type nonmonotone step-size search strategy in each iteration.Finally,the GBBLMM algorithm is implemented to find multiple unstable solutions of two classes of semilinear elliptic boundary value problems with variational structures:one is the semilinear elliptic equations with the homogeneous Dirichlet boundary condition and another is the linear elliptic equations with semilinear Neumann boundary conditions.Extensive numerical results indicate that our approach is very effective and speeds up the LMMs significantly.
基金the Postdoctoral Science Foundation of China(No.2015M582881)
文摘The autonomous route planning in coverage search is an important subject of unmanned aerial vehicle(UAV) mission planning. Pre-planning is simple and feasible for the coverage search mission of single UAV in regular areas. As to the dynamic mission in complicated environment of multi-UAV, the route planning will encounter the difficulties of reasonable task distribution and the real-time environment changes which include the changes of the mission area, the detection of threat area, the interference of communication and so on. At this point, making the UAV to do real-time autonomous planning is necessary. However, it is hard to fulfil requirements of real-time, autonomous and efficient at the same time. According to a scalable knowledge base,this paper proposes a coverage search algorithm which is based on the mapping between the basic behavior combination and surroundings. A UAV's coverage search simulation model with random shapes is built with a discrete map to update the environment and the changes of the mission on time. Comparison of the simulation analysis and the dynamic programming shows that the method has amazing expandability and can change the search strategy feasibly. It is efficient, and the ratio of coverage redundancy can be decreased to 1.21. It also has the potentiality in real-time calculation, and the computing time can be shortened to about 2 s.
基金the National Basic Research Program of China,973 program(2013CB228203).
文摘An enhanced cascading failure model integrating data mining technique is proposed in this paper.In order to better simulate the process of cascading failure propagation and further analyze the relationship between failure chains,in view of a basic framework of cascading failure described in this paper,some significant improvements in emerging prevention and control measures,the subsequent failure search strategy as well as the statistical analysis for the failure chains are made elaborately.Especially,a sequential pattern mining model is employed to find out the association pertinent to the obtained failure chains.In addition,a cluster analysis model is applied to evaluate the relationship between the intermediate data and the consequence of obtained failure chain,which can provide the prediction in potential propagation path of cascading failure to reduce the risk of catastrophic events.Finally,the case studies are conducted on the IEEE 10-machine-39-bus test system as benchmark to demonstrate the validity and effectiveness of the proposed enhanced cascading failure model.Some preliminary concluding remarks and comments are drawn.
基金the National Natural Science Foundation of China(Nos.61202085,61300019)the Ningxia Hui Autonomous Region Natural Science Foundation(No.NZ13265)the Special Fund for Fundamental Research of Central Universities of Northeastern University(Nos.N120804001,N120204003)
基金This work is supported by the National Natural Science Foundation of China under Grant No.61571345the Fundamental Research Funds for the Central Universities under Grant No.K5051203005the National Natural Science Foundation of China under Grant No.6150110247.
文摘Purpose–The purpose of this paper is to design a robust tracking algorithm which is suitable for the real-time requirement and solves the mistake labeling issue in the appearance model of trackers with the spare features.Design/methodology/approach–This paper proposes a tracker to select the most discriminative randomly projected ferns and integrates a coarse-to-fine search strategy in this framework.First,the authors exploit multiple instance boosting learning to maximize the bag likelihood and select randomly projected fern from feature pool to degrade the effect of mistake labeling.Second,a coarse-to-fine search approach is first integrated into the framework of multiple instance learning(MIL)for less detections.Findings–The quantitative and qualitative experiments demonstrate that the tracker has shown favorable performance in efficiency and effective among the competitors of tracking algorithms.Originality/value–The proposed method selects the feature from the compressive domain by MIL AnyBoost and integrates the coarse-to-fine search strategy first to reduce the burden of detection.This paper designs a tracker with high speed and favorable results which is more suitable for real-time scene.
文摘In this paper, we first discuss the direct scattering problem for a cylindrical homogeneous clastic tube with a geometrical method, and then study the inverse problem. The heuristics of B-F procedure (Best-First search strategy) is used. The inner radius, outer radius, sound velocitics of the tube and sound velocity of the internal medium are obtained with this heuristics.
基金The original version was presented at the congress of the IFSR2005
文摘This paper introduces a software agent as a virtual player of the business game called Bakery Game. The business game is a tool to understand business and management principles through experience in a virtual world. In order to construct software agents for the gaming simulation, which is able to participate in a game and become human players' worthy rival, we combine a simple model that considers the property of Bakery Game with a strategy adjustment model. The agent has so-called strategy parameters that are updated through the experience. The agent changes his strategy depending on particular situation. The agent participates in the game that is regenerated from log data in various situations.
文摘Geoforensic techniques are being deployed in searches for hidden objects to counteract the shortcomings of conventional blunderbuss methods.Processing of crime scenes during searches for clandestine graves and buried objects is often destructive.Manual excavation and other invasive methods are restricted in many contemporary situations,and the location of a body is essential for forensic investigations.Geoforensics and geophysical surveys are important tools for assisting law enforcement agencies in locating crime scenes,clandestine graves,drugs,artifacts,hazardous waste,and illegal weapons and ammunitions stored underground in preparation for terrorist attacks.Geoscience search techniques such as the geoforensic search strategy are among many models used to help find mass graves,locate missing persons,and verify information acquired from incomplete intelligence.Trace amounts of soils,sediments,and other geological materials can provide geolocations and aid in the development of a primary search area.Forensic geoscience techniques and equipment such as metal detectors,magnetic surveys,electromagnetic conductivity surveys,ground penetrating radar surveys,augering(probing),detector dogs surveys,and gravity and seismic fluctuation monitoring are discussed in this paper.In addition to the location of potential graves and ambush sites,the soil beneath the decomposing cadavers can be used to predict the postmortem interval for the deceased.Soil information and geo-mapping data can provide productive intelligence for military and national security agencies.Antiquities crimes and crimes involving gemstones in which the evidence passes through many hands can be traced back to the place of origin by checking for their geo-morphology.Serious crimes,including murder,genocide,and terrorism,can be prevented by the use of operational and decisive geoforensic techniques.This paper highlights the multidisciplinary information exchange that occurs between forensic burial science,forensic geology,and trace evidence in criminal investigations.The paper also focuses on geoforensic approaches to clandestine grave searching,underwater investigations,forensic engineering fallacies,military intelligence,ambush detection,and weapons mining.
