The detection of small targets poses a significant challenge for infrared search and tracking (IRST) systems,as they must strike a delicate balance between accuracy and speed.In this paper,we propose a detection algor...The detection of small targets poses a significant challenge for infrared search and tracking (IRST) systems,as they must strike a delicate balance between accuracy and speed.In this paper,we propose a detection algorithm based on spatial attention density peaks searching (SADPS) and an adaptive window selection scheme.First,the difference-of-Gaussians (DoG) filter is introduced for preprocessing raw infrared images.Second,the image is processed by SADPS.Third,an adaptive window selection scheme is applied to obtain window templates for the target scale size.Then,the small target feature is used to enhance the target and suppress the background.Finally,the true targets are segmented through a threshold.The experimental results show that compared with the seven state-of-the-art small targets detection baseline algorithms,the proposed method not only has better detection accuracy,but also has reasonable time consumption.展开更多
This paper puts forward adaptive anti collision algorithm based on two fork tree decomposition. New search algorithm built on the basis of binary-tree algorithm, using the uniqueness of the label EPC, to estimate the ...This paper puts forward adaptive anti collision algorithm based on two fork tree decomposition. New search algorithm built on the basis of binary-tree algorithm, using the uniqueness of the label EPC, to estimate the distribution of label by slot allocation, the huge and complicated two fork tree is decomposed into several simple binary-tree by search the collision slots for binary-tree, so, it can simplifies the search process. The algorithm fully considers4 important performance parameters of the reader paging times, transmission delay, energy consumption and throughput label, the simulation results show that, the improved anti-collision algorithm is obviously improved performance than other two fork tree algorithm, it is more suitable for RFID anti-collision protocols.展开更多
To address the issues of unknown target size,blurred edges,background interference and low contrast in infrared small target detection,this paper proposes a method based on density peaks searching and weighted multi-f...To address the issues of unknown target size,blurred edges,background interference and low contrast in infrared small target detection,this paper proposes a method based on density peaks searching and weighted multi-feature local difference.Firstly,an improved high-boost filter is used for preprocessing to eliminate background clutter and high-brightness interference,thereby increasing the probability of capturing real targets in the density peak search.Secondly,a triple-layer window is used to extract features from the area surrounding candidate targets,addressing the uncertainty of small target sizes.By calculating multi-feature local differences between the triple-layer windows,the problems of blurred target edges and low contrast are resolved.To balance the contribution of different features,intra-class distance is used to calculate weights,achieving weighted fusion of multi-feature local differences to obtain the weighted multi-feature local differences of candidate targets.The real targets are then extracted using the interquartile range.Experiments on datasets such as SIRST and IRSTD-IK show that the proposed method is suitable for various complex types and demonstrates good robustness and detection performance.展开更多
Deep learning has become integral to robotics,particularly in tasks such as robotic grasping,where objects often exhibit diverse shapes,textures,and physical properties.In robotic grasping tasks,due to the diverse cha...Deep learning has become integral to robotics,particularly in tasks such as robotic grasping,where objects often exhibit diverse shapes,textures,and physical properties.In robotic grasping tasks,due to the diverse characteristics of the targets,frequent adjustments to the network architecture and parameters are required to avoid a decrease in model accuracy,which presents a significant challenge for non-experts.Neural Architecture Search(NAS)provides a compelling method through the automated generation of network architectures,enabling the discovery of models that achieve high accuracy through efficient search algorithms.Compared to manually designed networks,NAS methods can significantly reduce design costs,time expenditure,and improve model performance.However,such methods often involve complex topological connections,and these redundant structures can severely reduce computational efficiency.To overcome this challenge,this work puts forward a robotic grasp detection framework founded on NAS.The method automatically designs a lightweight network with high accuracy and low topological complexity,effectively adapting to the target object to generate the optimal grasp pose,thereby significantly improving the success rate of robotic grasping.Additionally,we use Class Activation Mapping(CAM)as an interpretability tool,which captures sensitive information during the perception process through visualized results.The searched model achieved competitive,and in some cases superior,performance on the Cornell and Jacquard public datasets,achieving accuracies of 98.3%and 96.8%,respectively,while sustaining a detection speed of 89 frames per second with only 0.41 million parameters.To further validate its effectiveness beyond benchmark evaluations,we conducted real-world grasping experiments on a UR5 robotic arm,where the model demonstrated reliable performance across diverse objects and high grasp success rates,thereby confirming its practical applicability in robotic manipulation tasks.展开更多
Schlieren imaging is a widely used technique to visualize the structure of supersonic flow field,which is usually dominated by shock waves.Precise identification of shock waves in schlieren image provides critical ins...Schlieren imaging is a widely used technique to visualize the structure of supersonic flow field,which is usually dominated by shock waves.Precise identification of shock waves in schlieren image provides critical insights for flow diagnostics,especially for supersonic inlet whose performance is highly associated with that of the whole flight.However,conventional shock wave identification methods have limited accuracy in segmenting the shock wave.To overcome the limitation,we proposed an automated shock wave identification method(SW-Segment)that can attain high resolution and automatic shock wave segmentation by integrating correlation-based feature extraction with graph search.We demonstrated the efficacy of SW-Segment via the identification of shock waves in simulatively and experimentally obtained schlieren image.The results proved that SW-Segment showed a shock wave identification accuracy of 95.24%in the numerical schlieren image and an accuracy of 88.33%in the experimental image,clearly demonstrating its reliability.SW-Segment holds broad applicability for shock wave detection in diverse schlieren imaging scenarios,offering robust data support for flow field analysis and supersonic flight design.展开更多
Cooperative multi-UAV search requires jointly optimizing wide-area coverage,rapid target discovery,and endurance under sensing and motion constraints.Resolving this coupling enables scalable coordination with high dat...Cooperative multi-UAV search requires jointly optimizing wide-area coverage,rapid target discovery,and endurance under sensing and motion constraints.Resolving this coupling enables scalable coordination with high data efficiency and mission reliability.We formulate this problem as a discounted Markov decision process on an occupancy grid with a cellwise Bayesian belief update,yielding a Markov state that couples agent poses with a probabilistic target field.On this belief–MDP we introduce a segment-conditioned latent-intent framework,in which a discrete intent head selects a latent skill every K steps and an intra-segment GRU policy generates per-step control conditioned on the fixed intent;both components are trained end-to-end with proximal updates under a centralized critic.On the 50×50 grid,coverage and discovery convergence times are reduced by up to 48%and 40%relative to a flat actor-critic benchmark,and the aggregated convergence metric improves by about 12%compared with a stateof-the-art hierarchical method.Qualitative analyses further reveal stable spatial sectorization,low path overlap,and fuel-aware patrolling,indicating that segment-conditioned latent intents provide an effective and scalable mechanism for coordinated multi-UAV search.展开更多
For 5G millimeter wave(mm-Wave)user equipments(UEs),all test cases must be evaluated in Over-The-Air(OTA)manner.Test time increases dramatically compared to Sub-6 GHz.Therefore,test time reduction is of great signific...For 5G millimeter wave(mm-Wave)user equipments(UEs),all test cases must be evaluated in Over-The-Air(OTA)manner.Test time increases dramatically compared to Sub-6 GHz.Therefore,test time reduction is of great significance for 5G mm-Wave OTA testing.Among all test cases,beam peak search is the most time-consuming,taking up the majority of the overall test time.Therefore,the objective of this work is to determine a suitable beam peak search grid for 5G mm-Wave UEs with satisfactory accuracy and efficiency.Through radiation property investigation of 5G mm-Wave commercial UEs,more reasonable reference array configuration(4×2)and reference deployment scenario(composite beam)are proposed for beam peak search grid analysis.The effect of different grid configurations on beam peak search precision are characterized quantitatively.The determination of associated measurement uncertainty(MU)term along with quantitative analysis approach are proposed based on statistical analysis.Finally,the recommended minimum number of beam peak search grid points is 182 based on the proposed 4×2 array under composite beam scenario.Compared with currently-required 1106 points in 3GPP/CTIA specifications,over 80%reduction can be achieved without increasing the MU limit.The feasibility of the proposed MU analysis as well as the recommended grids is demonstrated through measurements.展开更多
Engineering optimization problems are often characterized by high dimensionality,constraints,and complex,multimodal landscapes.Traditional deterministic methods frequently struggle under such conditions,prompting incr...Engineering optimization problems are often characterized by high dimensionality,constraints,and complex,multimodal landscapes.Traditional deterministic methods frequently struggle under such conditions,prompting increased interest in swarm intelligence algorithms.Among these,the Cuckoo Search(CS)algorithm stands out for its promising global search capabilities.However,it often suffers from premature convergence when tackling complex problems.To address this limitation,this paper proposes a Grouped Dynamic Adaptive CS(GDACS)algorithm.Theenhancements incorporated intoGDACS can be summarized into two key aspects.Firstly,a chaotic map is employed to generate initial solutions,leveraging the inherent randomness of chaotic sequences to ensure a more uniform distribution across the search space and enhance population diversity from the outset.Secondly,Cauchy and Levy strategies replace the standard CS population update.This strategy involves evaluating the fitness of candidate solutions to dynamically group the population based on performance.Different step-size adaptation strategies are then applied to distinct groups,enabling an adaptive search mechanism that balances exploration and exploitation.Experiments were conducted on six benchmark functions and four constrained engineering design problems,and the results indicate that the proposed GDACS achieves good search efficiency and produces more accurate optimization results compared with other state-of-the-art algorithms.展开更多
The Routing Protocol for Low-power and Lossy Networks(RPL)is widely used in Internet of Things(IoT)systems,where devices usually have very limited resources.However,RPL still faces several problems,such as high energy...The Routing Protocol for Low-power and Lossy Networks(RPL)is widely used in Internet of Things(IoT)systems,where devices usually have very limited resources.However,RPL still faces several problems,such as high energy usage,unstable links,and inefficient routing decisions,which reduce the overall network performance and lifetime.In this work,we introduce TABURPL,an improved routing method that applies Tabu Search(TS)to optimize the parent selection process.The method uses a combined cost function that considers Residual Energy,Transmission Energy,Distance to the Sink,Hop Count,Expected Transmission Count(ETX),and Link Stability Rate(LSR).Simulation results show that TABURPL improves link stability,lowers energy consumption,and increases the packet delivery ratio compared with standard RPL and other existing approaches.These results indicate that Tabu Search can handle the complex trade-offs in IoT routing and can provide a more reliable solution for extending the network lifetime.展开更多
In underwater target search path planning,the accuracy of sonar models directly dictates the accurate assessment of search coverage.In contrast to physics-informed sonar models,traditional geometric sonar models fail ...In underwater target search path planning,the accuracy of sonar models directly dictates the accurate assessment of search coverage.In contrast to physics-informed sonar models,traditional geometric sonar models fail to accurately characterize the complex influence of marine environments.To overcome these challenges,we propose an acoustic physics-informed intelligent path planning framework for underwater target search,integrating three core modules:The acoustic-physical modeling module adopts 3D ray-tracing theory and the active sonar equation to construct a physics-driven sonar detection model,explicitly accounting for environmental factors that influence sonar performance across heterogeneous spaces.The hybrid parallel computing module adopts a message passing interface(MPI)/open multi-processing(Open MP)hybrid strategy for large-scale acoustic simulations,combining computational domain decomposition and physics-intensive task acceleration.The search path optimization module adopts the covariance matrix adaptation evolution algorithm to solve continuous optimization problems of heading angles,which ensures maximum search coverage for targets.Largescale experiments conducted in the Pacific and Atlantic Oceans demonstrate the framework's effectiveness:(1)Precise capture of sonar detection range variations from 5.45 km to 50 km in heterogeneous marine environments.(2)Significant speedup of 453.43×for acoustic physics modeling through hybrid parallelization.(3)Notable improvements of 7.23%in detection coverage and 15.86%reduction in optimization time compared to the optimal baseline method.The framework provides a robust solution for underwater search missions in complex marine environments.展开更多
Frequency diverse array multiple-input multiple-output(FDA-MIMO)radar has gained considerable research attention due to its ability to effectively counter active repeater deception jamming in complex electromagnetic e...Frequency diverse array multiple-input multiple-output(FDA-MIMO)radar has gained considerable research attention due to its ability to effectively counter active repeater deception jamming in complex electromagnetic environments.The effectiveness of interference suppression by FDA-MIMO is limited by the inherent range-angle coupling issue in the FDA beampattern.Existing literature primarily focuses on control methods for FDA-MIMO radar beam direction under the assumption of static beampatterns,with insufficient exploration of techniques for managing nonstationary beam directions.To address this gap,this paper initially introduces the FDA-MIMO signal model and the calculation formula for the FDA-MIMO array output using the minimum variance distortionless response(MVDR)beamformer.Building on this,the problem of determining the optimal frequency offset for the FDA is rephrased as a convex optimization problem,which is then resolved using the cuckoo search(CS)algorithm.Simulations confirm the effectiveness of the proposed approach,showing that the frequency offsets obtained through the CS algorithm can create a dot-shaped beam direction at the target location while effectively suppressing interference signals within the mainlobe.展开更多
Underwater images frequently suffer from chromatic distortion,blurred details,and low contrast,posing significant challenges for enhancement.This paper introduces AquaTree,a novel underwater image enhancement(UIE)meth...Underwater images frequently suffer from chromatic distortion,blurred details,and low contrast,posing significant challenges for enhancement.This paper introduces AquaTree,a novel underwater image enhancement(UIE)method that reformulates the task as a Markov Decision Process(MDP)through the integration of Monte Carlo Tree Search(MCTS)and deep reinforcement learning(DRL).The framework employs an action space of 25 enhancement operators,strategically grouped for basic attribute adjustment,color component balance,correction,and deblurring.Exploration within MCTS is guided by a dual-branch convolutional network,enabling intelligent sequential operator selection.Our core contributions include:(1)a multimodal state representation combining CIELab color histograms with deep perceptual features,(2)a dual-objective reward mechanism optimizing chromatic fidelity and perceptual consistency,and(3)an alternating training strategy co-optimizing enhancement sequences and network parameters.We further propose two inference schemes:an MCTS-based approach prioritizing accuracy at higher computational cost,and an efficient network policy enabling real-time processing with minimal quality loss.Comprehensive evaluations on the UIEB Dataset and Color correction and haze removal comparisons on the U45 Dataset demonstrate AquaTree’s superiority,significantly outperforming nine state-of-the-art methods across five established underwater image quality metrics.展开更多
In consideration of the limitation of super-peer overlay network, the semantic information was introduced into the super-peers＇ organization. A novel P2P （peer-to-peer） searching model, SSP2P, was put forward. The ...In consideration of the limitation of super-peer overlay network, the semantic information was introduced into the super-peers＇ organization. A novel P2P （peer-to-peer） searching model, SSP2P, was put forward. The peers in the model were organized in a natural area autonomy system （AAS） based on the smallworld theory. A super-peer was selected in each AAS based on power law; and all the super-peers formed different super-peer semantic networks. Thus, a hierarchical super-peer overlay network was formed. The results show that the model reduces the communication cost and enhances the search efficiency while ensuring the system expansibility. It proves that the introduction of semantic information in the construction of a super-peer overlay is favorable to P2P system capability.展开更多
Distributed data sources which employ taxonomy hierarchy to describe the contents of their objects are considered, and a super-peer-based semantic overlay network （SSON） is proposed for sharing and searching their d...Distributed data sources which employ taxonomy hierarchy to describe the contents of their objects are considered, and a super-peer-based semantic overlay network （SSON） is proposed for sharing and searching their data objects. In SSON, peers are dynamically clustered into many semantic clusters based on the semantics of their data objects and organized in the semantic clusters into a semantic overlay network. Each semantic cluster consists of a super-peer and more peers, and is only responsible for answering queries in its semantic subspace. A query is first routed to the appropriate semantic clusters by an efficient searching algorithm, and then it is forwarded to the specific peers that hold the relevant data objects. Experimental results indicate that SSON has good scalability and achieves a competitive trade-off between search efficiency and costs.展开更多
A novel idea,called the optimal shape subspace （OSS） is first proposed for optimizing active shape model （ASM） search.It is constructed from the principal shape subspace and the principal shape variance subspace.I...A novel idea,called the optimal shape subspace （OSS） is first proposed for optimizing active shape model （ASM） search.It is constructed from the principal shape subspace and the principal shape variance subspace.It allows the reconstructed shape to vary more than that reconstructed in the standard ASM shape space,hence it is more expressive in representing shapes in real life.Then a cost function is developed,based on a study on the search process.An optimal searching method using the feedback information provided by the evaluation cost is proposed to improve the performance of ASM alignment.Experimental results show that the proposed OSS can offer the maximum shape variation with reserving the principal information and a unique local optimal shape is acquired after optimal searching.The combination of OSS and optimal searching can improve the ASM performance greatly.展开更多
For density inversion of gravity anomaly data, once the inversion method is determined, the main factors affecting the inversion result are the inversion parameters and subdivision scheme. A set of reasonable inversio...For density inversion of gravity anomaly data, once the inversion method is determined, the main factors affecting the inversion result are the inversion parameters and subdivision scheme. A set of reasonable inversion parameters and subdivision scheme can, not only improve the inversion process efficiency, but also ensure inversion result accuracy. The gravity inversion method based on correlation searching and the golden section algorithm is an effective potential field inversion method. It can be used to invert 2D and 3D physical properties with potential data observed on flat or rough surfaces. In this paper, we introduce in detail the density inversion principles based on correlation searching and the golden section algorithm. Considering that the gold section algorithm is not globally optimized. we present a heuristic method to ensure the inversion result is globally optimized. With a series of model tests, we systematically compare and analyze the inversion result efficiency and accuracy with different parameters. Based on the model test results, we conclude the selection principles for each inversion parameter with which the inversion accuracy can be obviously improved.展开更多
A new contact searching algorithm for contact-impact systems is proposed in this paper.In terms of the cell structure and the linked-list,this algo- rithm solves the problem of sorting and searching contacts in three ...A new contact searching algorithm for contact-impact systems is proposed in this paper.In terms of the cell structure and the linked-list,this algo- rithm solves the problem of sorting and searching contacts in three dimensions by transforming it to a retrieving process from two one-dimensional arrays,and binary searching is no longer required.Using this algorithm, the cost of contact searching is reduced to the order of O(N)instead of O(Nlog_2N)for traditional ones,where N is the node number in the system.Moreover,this algorithm can handle contact systems with arbitrary mesh layouts.Due to the simplicity of this algorithm it can be easily implemented in a dynamic explicit finite element program.Our numerical experi- mental result shows that this algorithm is reliable arid efficient for contact searching of three dimensional systems.展开更多
Existing methods of local search mostly focus on how to reach optimal solution.However,in some emergency situations,search time is the hard constraint for job shop scheduling problem while optimal solution is not nece...Existing methods of local search mostly focus on how to reach optimal solution.However,in some emergency situations,search time is the hard constraint for job shop scheduling problem while optimal solution is not necessary.In this situation,the existing method of local search is not fast enough.This paper presents an emergency local search(ELS) approach which can reach feasible and nearly optimal solution in limited search time.The ELS approach is desirable for the aforementioned emergency situations where search time is limited and a nearly optimal solution is sufficient,which consists of three phases.Firstly,in order to reach a feasible and nearly optimal solution,infeasible solutions are repaired and a repair technique named group repair is proposed.Secondly,in order to save time,the amount of local search moves need to be reduced and this is achieved by a quickly search method named critical path search(CPS).Finally,CPS sometimes stops at a solution far from the optimal one.In order to jump out the search dilemma of CPS,a jump technique based on critical part is used to improve CPS.Furthermore,the schedule system based on ELS has been developed and experiments based on this system completed on the computer of Intel Pentium(R) 2.93 GHz.The experimental result shows that the optimal solutions of small scale instances are reached in 2 s,and the nearly optimal solutions of large scale instances are reached in 4 s.The proposed ELS approach can stably reach nearly optimal solutions with manageable search time,and can be applied on some emergency situations.展开更多
We present the design and performance of a home-built scanning tunneling microscope （STM）, which is compact （66 mm tall and 25 mm in diameter）, yet equipped with a 3D atomic precision piezoelectric motor in which ...We present the design and performance of a home-built scanning tunneling microscope （STM）, which is compact （66 mm tall and 25 mm in diameter）, yet equipped with a 3D atomic precision piezoelectric motor in which the Z coarse approach relies on a high simplic-ity friction-type walker （of our own invention） driven by an axially cut piezoelectric tube. The walker is vertically inserted in a piezoelectric scanner tube （PST） with its brim laying at on the PST end as the inertial slider （driven by the PST） for the XZ （sample plane） motion. The STM is designed to be capable of searching rare microscopic targets （defects, dopants, boundaries, nano-devices, etc.） in a macroscopic sample area （square millimeters） under extreme conditions （low temperatures, strong magnetic elds, etc.） in which it ts. It gives good atomic resolution images after scanning a highly oriented pyrolytic graphite sample in air at room temperature.展开更多
An independently developed mobile welding robot system is introduced. Kinematics model is the base of robot planning. With the Denavit-Hartenberg method, robot kinematics equation can be gotten. The robot welding torc...An independently developed mobile welding robot system is introduced. Kinematics model is the base of robot planning. With the Denavit-Hartenberg method, robot kinematics equation can be gotten. The robot welding torch inclination angle consists of the working and moving angles. According to the kinematics model,both the two angles and torch position can be calculated. Under special moving angle, a two-step algorithm is used to obtain the optimal manipulator posture. The calculation result shows that the algorithm has high precision.展开更多
基金supported by the National 14th Five-Year Plan Preliminary Research Project (No.514010405-207)。
文摘The detection of small targets poses a significant challenge for infrared search and tracking (IRST) systems,as they must strike a delicate balance between accuracy and speed.In this paper,we propose a detection algorithm based on spatial attention density peaks searching (SADPS) and an adaptive window selection scheme.First,the difference-of-Gaussians (DoG) filter is introduced for preprocessing raw infrared images.Second,the image is processed by SADPS.Third,an adaptive window selection scheme is applied to obtain window templates for the target scale size.Then,the small target feature is used to enhance the target and suppress the background.Finally,the true targets are segmented through a threshold.The experimental results show that compared with the seven state-of-the-art small targets detection baseline algorithms,the proposed method not only has better detection accuracy,but also has reasonable time consumption.
文摘This paper puts forward adaptive anti collision algorithm based on two fork tree decomposition. New search algorithm built on the basis of binary-tree algorithm, using the uniqueness of the label EPC, to estimate the distribution of label by slot allocation, the huge and complicated two fork tree is decomposed into several simple binary-tree by search the collision slots for binary-tree, so, it can simplifies the search process. The algorithm fully considers4 important performance parameters of the reader paging times, transmission delay, energy consumption and throughput label, the simulation results show that, the improved anti-collision algorithm is obviously improved performance than other two fork tree algorithm, it is more suitable for RFID anti-collision protocols.
基金supported by the National Natural Science Foundation of China (No.52205548)。
文摘To address the issues of unknown target size,blurred edges,background interference and low contrast in infrared small target detection,this paper proposes a method based on density peaks searching and weighted multi-feature local difference.Firstly,an improved high-boost filter is used for preprocessing to eliminate background clutter and high-brightness interference,thereby increasing the probability of capturing real targets in the density peak search.Secondly,a triple-layer window is used to extract features from the area surrounding candidate targets,addressing the uncertainty of small target sizes.By calculating multi-feature local differences between the triple-layer windows,the problems of blurred target edges and low contrast are resolved.To balance the contribution of different features,intra-class distance is used to calculate weights,achieving weighted fusion of multi-feature local differences to obtain the weighted multi-feature local differences of candidate targets.The real targets are then extracted using the interquartile range.Experiments on datasets such as SIRST and IRSTD-IK show that the proposed method is suitable for various complex types and demonstrates good robustness and detection performance.
基金funded by Guangdong Basic and Applied Basic Research Foundation(2023B1515120064)National Natural Science Foundation of China(62273097).
文摘Deep learning has become integral to robotics,particularly in tasks such as robotic grasping,where objects often exhibit diverse shapes,textures,and physical properties.In robotic grasping tasks,due to the diverse characteristics of the targets,frequent adjustments to the network architecture and parameters are required to avoid a decrease in model accuracy,which presents a significant challenge for non-experts.Neural Architecture Search(NAS)provides a compelling method through the automated generation of network architectures,enabling the discovery of models that achieve high accuracy through efficient search algorithms.Compared to manually designed networks,NAS methods can significantly reduce design costs,time expenditure,and improve model performance.However,such methods often involve complex topological connections,and these redundant structures can severely reduce computational efficiency.To overcome this challenge,this work puts forward a robotic grasp detection framework founded on NAS.The method automatically designs a lightweight network with high accuracy and low topological complexity,effectively adapting to the target object to generate the optimal grasp pose,thereby significantly improving the success rate of robotic grasping.Additionally,we use Class Activation Mapping(CAM)as an interpretability tool,which captures sensitive information during the perception process through visualized results.The searched model achieved competitive,and in some cases superior,performance on the Cornell and Jacquard public datasets,achieving accuracies of 98.3%and 96.8%,respectively,while sustaining a detection speed of 89 frames per second with only 0.41 million parameters.To further validate its effectiveness beyond benchmark evaluations,we conducted real-world grasping experiments on a UR5 robotic arm,where the model demonstrated reliable performance across diverse objects and high grasp success rates,thereby confirming its practical applicability in robotic manipulation tasks.
基金supported by the National Natural Science Foundation of China(Grant Nos.12402336,U20A2070,12025202)the Natural Science Foundation of Jiangsu Province(Grant No.BK20230876)+2 种基金the National High-Level Talent Project(Grant No.YQR23069)the Key Laboratory of Intake and Exhaust Technology,Ministry of Education(Grant No.CEPE2024015)the Key Laboratory of Mechanics and Control for Aerospace Structures(Nanjing University of Aeronautics and Astronautics)(Grant No.MCAS-I-0325K01)。
文摘Schlieren imaging is a widely used technique to visualize the structure of supersonic flow field,which is usually dominated by shock waves.Precise identification of shock waves in schlieren image provides critical insights for flow diagnostics,especially for supersonic inlet whose performance is highly associated with that of the whole flight.However,conventional shock wave identification methods have limited accuracy in segmenting the shock wave.To overcome the limitation,we proposed an automated shock wave identification method(SW-Segment)that can attain high resolution and automatic shock wave segmentation by integrating correlation-based feature extraction with graph search.We demonstrated the efficacy of SW-Segment via the identification of shock waves in simulatively and experimentally obtained schlieren image.The results proved that SW-Segment showed a shock wave identification accuracy of 95.24%in the numerical schlieren image and an accuracy of 88.33%in the experimental image,clearly demonstrating its reliability.SW-Segment holds broad applicability for shock wave detection in diverse schlieren imaging scenarios,offering robust data support for flow field analysis and supersonic flight design.
文摘Cooperative multi-UAV search requires jointly optimizing wide-area coverage,rapid target discovery,and endurance under sensing and motion constraints.Resolving this coupling enables scalable coordination with high data efficiency and mission reliability.We formulate this problem as a discounted Markov decision process on an occupancy grid with a cellwise Bayesian belief update,yielding a Markov state that couples agent poses with a probabilistic target field.On this belief–MDP we introduce a segment-conditioned latent-intent framework,in which a discrete intent head selects a latent skill every K steps and an intra-segment GRU policy generates per-step control conditioned on the fixed intent;both components are trained end-to-end with proximal updates under a centralized critic.On the 50×50 grid,coverage and discovery convergence times are reduced by up to 48%and 40%relative to a flat actor-critic benchmark,and the aggregated convergence metric improves by about 12%compared with a stateof-the-art hierarchical method.Qualitative analyses further reveal stable spatial sectorization,low path overlap,and fuel-aware patrolling,indicating that segment-conditioned latent intents provide an effective and scalable mechanism for coordinated multi-UAV search.
基金supported by the Beijing Natural Science Foundation under Grant L253002.
文摘For 5G millimeter wave(mm-Wave)user equipments(UEs),all test cases must be evaluated in Over-The-Air(OTA)manner.Test time increases dramatically compared to Sub-6 GHz.Therefore,test time reduction is of great significance for 5G mm-Wave OTA testing.Among all test cases,beam peak search is the most time-consuming,taking up the majority of the overall test time.Therefore,the objective of this work is to determine a suitable beam peak search grid for 5G mm-Wave UEs with satisfactory accuracy and efficiency.Through radiation property investigation of 5G mm-Wave commercial UEs,more reasonable reference array configuration(4×2)and reference deployment scenario(composite beam)are proposed for beam peak search grid analysis.The effect of different grid configurations on beam peak search precision are characterized quantitatively.The determination of associated measurement uncertainty(MU)term along with quantitative analysis approach are proposed based on statistical analysis.Finally,the recommended minimum number of beam peak search grid points is 182 based on the proposed 4×2 array under composite beam scenario.Compared with currently-required 1106 points in 3GPP/CTIA specifications,over 80%reduction can be achieved without increasing the MU limit.The feasibility of the proposed MU analysis as well as the recommended grids is demonstrated through measurements.
基金supported in part by the Ministry of Higher Education Malaysia(MOHE)through Fundamental Research Grant Scheme(FRGS)Ref:FRGS/1/2024/ICT02/UTM/02/10,Vot.No:R.J130000.7828.5F748the Scientific Research Project of Education Department of Hunan Province(Nos.22B1046 and 24A0771).
文摘Engineering optimization problems are often characterized by high dimensionality,constraints,and complex,multimodal landscapes.Traditional deterministic methods frequently struggle under such conditions,prompting increased interest in swarm intelligence algorithms.Among these,the Cuckoo Search(CS)algorithm stands out for its promising global search capabilities.However,it often suffers from premature convergence when tackling complex problems.To address this limitation,this paper proposes a Grouped Dynamic Adaptive CS(GDACS)algorithm.Theenhancements incorporated intoGDACS can be summarized into two key aspects.Firstly,a chaotic map is employed to generate initial solutions,leveraging the inherent randomness of chaotic sequences to ensure a more uniform distribution across the search space and enhance population diversity from the outset.Secondly,Cauchy and Levy strategies replace the standard CS population update.This strategy involves evaluating the fitness of candidate solutions to dynamically group the population based on performance.Different step-size adaptation strategies are then applied to distinct groups,enabling an adaptive search mechanism that balances exploration and exploitation.Experiments were conducted on six benchmark functions and four constrained engineering design problems,and the results indicate that the proposed GDACS achieves good search efficiency and produces more accurate optimization results compared with other state-of-the-art algorithms.
文摘The Routing Protocol for Low-power and Lossy Networks(RPL)is widely used in Internet of Things(IoT)systems,where devices usually have very limited resources.However,RPL still faces several problems,such as high energy usage,unstable links,and inefficient routing decisions,which reduce the overall network performance and lifetime.In this work,we introduce TABURPL,an improved routing method that applies Tabu Search(TS)to optimize the parent selection process.The method uses a combined cost function that considers Residual Energy,Transmission Energy,Distance to the Sink,Hop Count,Expected Transmission Count(ETX),and Link Stability Rate(LSR).Simulation results show that TABURPL improves link stability,lowers energy consumption,and increases the packet delivery ratio compared with standard RPL and other existing approaches.These results indicate that Tabu Search can handle the complex trade-offs in IoT routing and can provide a more reliable solution for extending the network lifetime.
基金supported by Natural Science Foundation of Hu'nan Province(2024JJ5409)。
文摘In underwater target search path planning,the accuracy of sonar models directly dictates the accurate assessment of search coverage.In contrast to physics-informed sonar models,traditional geometric sonar models fail to accurately characterize the complex influence of marine environments.To overcome these challenges,we propose an acoustic physics-informed intelligent path planning framework for underwater target search,integrating three core modules:The acoustic-physical modeling module adopts 3D ray-tracing theory and the active sonar equation to construct a physics-driven sonar detection model,explicitly accounting for environmental factors that influence sonar performance across heterogeneous spaces.The hybrid parallel computing module adopts a message passing interface(MPI)/open multi-processing(Open MP)hybrid strategy for large-scale acoustic simulations,combining computational domain decomposition and physics-intensive task acceleration.The search path optimization module adopts the covariance matrix adaptation evolution algorithm to solve continuous optimization problems of heading angles,which ensures maximum search coverage for targets.Largescale experiments conducted in the Pacific and Atlantic Oceans demonstrate the framework's effectiveness:(1)Precise capture of sonar detection range variations from 5.45 km to 50 km in heterogeneous marine environments.(2)Significant speedup of 453.43×for acoustic physics modeling through hybrid parallelization.(3)Notable improvements of 7.23%in detection coverage and 15.86%reduction in optimization time compared to the optimal baseline method.The framework provides a robust solution for underwater search missions in complex marine environments.
基金supported by the National Natural Science Foundation of China(61503408)。
文摘Frequency diverse array multiple-input multiple-output(FDA-MIMO)radar has gained considerable research attention due to its ability to effectively counter active repeater deception jamming in complex electromagnetic environments.The effectiveness of interference suppression by FDA-MIMO is limited by the inherent range-angle coupling issue in the FDA beampattern.Existing literature primarily focuses on control methods for FDA-MIMO radar beam direction under the assumption of static beampatterns,with insufficient exploration of techniques for managing nonstationary beam directions.To address this gap,this paper initially introduces the FDA-MIMO signal model and the calculation formula for the FDA-MIMO array output using the minimum variance distortionless response(MVDR)beamformer.Building on this,the problem of determining the optimal frequency offset for the FDA is rephrased as a convex optimization problem,which is then resolved using the cuckoo search(CS)algorithm.Simulations confirm the effectiveness of the proposed approach,showing that the frequency offsets obtained through the CS algorithm can create a dot-shaped beam direction at the target location while effectively suppressing interference signals within the mainlobe.
基金supported by theHubei Provincial Technology Innovation Special Project and the Natural Science Foundation of Hubei Province under Grants 2023BEB024,2024AFC066,respectively.
文摘Underwater images frequently suffer from chromatic distortion,blurred details,and low contrast,posing significant challenges for enhancement.This paper introduces AquaTree,a novel underwater image enhancement(UIE)method that reformulates the task as a Markov Decision Process(MDP)through the integration of Monte Carlo Tree Search(MCTS)and deep reinforcement learning(DRL).The framework employs an action space of 25 enhancement operators,strategically grouped for basic attribute adjustment,color component balance,correction,and deblurring.Exploration within MCTS is guided by a dual-branch convolutional network,enabling intelligent sequential operator selection.Our core contributions include:(1)a multimodal state representation combining CIELab color histograms with deep perceptual features,(2)a dual-objective reward mechanism optimizing chromatic fidelity and perceptual consistency,and(3)an alternating training strategy co-optimizing enhancement sequences and network parameters.We further propose two inference schemes:an MCTS-based approach prioritizing accuracy at higher computational cost,and an efficient network policy enabling real-time processing with minimal quality loss.Comprehensive evaluations on the UIEB Dataset and Color correction and haze removal comparisons on the U45 Dataset demonstrate AquaTree’s superiority,significantly outperforming nine state-of-the-art methods across five established underwater image quality metrics.
基金The National Natural Science Foundation of China(No.60573127), Specialized Research Fund for the Doctoral Program of Higher Education (No.20040533036).
文摘In consideration of the limitation of super-peer overlay network, the semantic information was introduced into the super-peers＇ organization. A novel P2P （peer-to-peer） searching model, SSP2P, was put forward. The peers in the model were organized in a natural area autonomy system （AAS） based on the smallworld theory. A super-peer was selected in each AAS based on power law; and all the super-peers formed different super-peer semantic networks. Thus, a hierarchical super-peer overlay network was formed. The results show that the model reduces the communication cost and enhances the search efficiency while ensuring the system expansibility. It proves that the introduction of semantic information in the construction of a super-peer overlay is favorable to P2P system capability.
基金The National Natural Science Foundation of China(No60573089)the Natural Science Foundation of Liaoning Province(No20052031)the National High Technology Research and Develop-ment Program of China (863Program)(No2006AA09Z139)
文摘Distributed data sources which employ taxonomy hierarchy to describe the contents of their objects are considered, and a super-peer-based semantic overlay network （SSON） is proposed for sharing and searching their data objects. In SSON, peers are dynamically clustered into many semantic clusters based on the semantics of their data objects and organized in the semantic clusters into a semantic overlay network. Each semantic cluster consists of a super-peer and more peers, and is only responsible for answering queries in its semantic subspace. A query is first routed to the appropriate semantic clusters by an efficient searching algorithm, and then it is forwarded to the specific peers that hold the relevant data objects. Experimental results indicate that SSON has good scalability and achieves a competitive trade-off between search efficiency and costs.
基金21st Century Education Revitalization Project (No.301703201).
文摘A novel idea,called the optimal shape subspace （OSS） is first proposed for optimizing active shape model （ASM） search.It is constructed from the principal shape subspace and the principal shape variance subspace.It allows the reconstructed shape to vary more than that reconstructed in the standard ASM shape space,hence it is more expressive in representing shapes in real life.Then a cost function is developed,based on a study on the search process.An optimal searching method using the feedback information provided by the evaluation cost is proposed to improve the performance of ASM alignment.Experimental results show that the proposed OSS can offer the maximum shape variation with reserving the principal information and a unique local optimal shape is acquired after optimal searching.The combination of OSS and optimal searching can improve the ASM performance greatly.
基金supported by Specialized Research Fund for the Doctoral Program of Higher Education of China(20110022120004)the Fundamental Research Funds for the Central Universities
文摘For density inversion of gravity anomaly data, once the inversion method is determined, the main factors affecting the inversion result are the inversion parameters and subdivision scheme. A set of reasonable inversion parameters and subdivision scheme can, not only improve the inversion process efficiency, but also ensure inversion result accuracy. The gravity inversion method based on correlation searching and the golden section algorithm is an effective potential field inversion method. It can be used to invert 2D and 3D physical properties with potential data observed on flat or rough surfaces. In this paper, we introduce in detail the density inversion principles based on correlation searching and the golden section algorithm. Considering that the gold section algorithm is not globally optimized. we present a heuristic method to ensure the inversion result is globally optimized. With a series of model tests, we systematically compare and analyze the inversion result efficiency and accuracy with different parameters. Based on the model test results, we conclude the selection principles for each inversion parameter with which the inversion accuracy can be obviously improved.
基金The project supported by the National Natural Science Foundation of China(59875045)and the State Key Laboratory of Automobile Safety and Energy Saving(K9705)
文摘A new contact searching algorithm for contact-impact systems is proposed in this paper.In terms of the cell structure and the linked-list,this algo- rithm solves the problem of sorting and searching contacts in three dimensions by transforming it to a retrieving process from two one-dimensional arrays,and binary searching is no longer required.Using this algorithm, the cost of contact searching is reduced to the order of O(N)instead of O(Nlog_2N)for traditional ones,where N is the node number in the system.Moreover,this algorithm can handle contact systems with arbitrary mesh layouts.Due to the simplicity of this algorithm it can be easily implemented in a dynamic explicit finite element program.Our numerical experi- mental result shows that this algorithm is reliable arid efficient for contact searching of three dimensional systems.
基金supported by National Natural Science Foundation of China(Grant No.61004109)Fundamental Research Funds for the Central Universities of China(Grant No.FRF-TP-12-071A)
文摘Existing methods of local search mostly focus on how to reach optimal solution.However,in some emergency situations,search time is the hard constraint for job shop scheduling problem while optimal solution is not necessary.In this situation,the existing method of local search is not fast enough.This paper presents an emergency local search(ELS) approach which can reach feasible and nearly optimal solution in limited search time.The ELS approach is desirable for the aforementioned emergency situations where search time is limited and a nearly optimal solution is sufficient,which consists of three phases.Firstly,in order to reach a feasible and nearly optimal solution,infeasible solutions are repaired and a repair technique named group repair is proposed.Secondly,in order to save time,the amount of local search moves need to be reduced and this is achieved by a quickly search method named critical path search(CPS).Finally,CPS sometimes stops at a solution far from the optimal one.In order to jump out the search dilemma of CPS,a jump technique based on critical part is used to improve CPS.Furthermore,the schedule system based on ELS has been developed and experiments based on this system completed on the computer of Intel Pentium(R) 2.93 GHz.The experimental result shows that the optimal solutions of small scale instances are reached in 2 s,and the nearly optimal solutions of large scale instances are reached in 4 s.The proposed ELS approach can stably reach nearly optimal solutions with manageable search time,and can be applied on some emergency situations.
文摘We present the design and performance of a home-built scanning tunneling microscope （STM）, which is compact （66 mm tall and 25 mm in diameter）, yet equipped with a 3D atomic precision piezoelectric motor in which the Z coarse approach relies on a high simplic-ity friction-type walker （of our own invention） driven by an axially cut piezoelectric tube. The walker is vertically inserted in a piezoelectric scanner tube （PST） with its brim laying at on the PST end as the inertial slider （driven by the PST） for the XZ （sample plane） motion. The STM is designed to be capable of searching rare microscopic targets （defects, dopants, boundaries, nano-devices, etc.） in a macroscopic sample area （square millimeters） under extreme conditions （low temperatures, strong magnetic elds, etc.） in which it ts. It gives good atomic resolution images after scanning a highly oriented pyrolytic graphite sample in air at room temperature.
基金the National High Technology Research and Development Program(863) of China(No.2009AAA042221)Shanghai Sciences&Technology Committee(No.11111100302)
文摘An independently developed mobile welding robot system is introduced. Kinematics model is the base of robot planning. With the Denavit-Hartenberg method, robot kinematics equation can be gotten. The robot welding torch inclination angle consists of the working and moving angles. According to the kinematics model,both the two angles and torch position can be calculated. Under special moving angle, a two-step algorithm is used to obtain the optimal manipulator posture. The calculation result shows that the algorithm has high precision.
