This paper presents an Eulerian-Lagrangian algorithm for direct numerical simulation(DNS)of particle-laden flows.The algorithm is applicable to perform simulations of dilute suspensions of small inertial particles in ...This paper presents an Eulerian-Lagrangian algorithm for direct numerical simulation(DNS)of particle-laden flows.The algorithm is applicable to perform simulations of dilute suspensions of small inertial particles in turbulent carrier flow.The Eulerian framework numerically resolves turbulent carrier flow using a parallelized,finite-volume DNS solver on a staggered Cartesian grid.Particles are tracked using a point-particle method utilizing a Lagrangian particle tracking(LPT)algorithm.The proposed Eulerian-Lagrangian algorithm is validated using an inertial particle-laden turbulent channel flow for different Stokes number cases.The particle concentration profiles and higher-order statistics of the carrier and dispersed phases agree well with the benchmark results.We investigated the effect of fluid velocity interpolation and numerical integration schemes of particle tracking algorithms on particle dispersion statistics.The suitability of fluid velocity interpolation schemes for predicting the particle dispersion statistics is discussed in the framework of the particle tracking algorithm coupled to the finite-volume solver.In addition,we present parallelization strategies implemented in the algorithm and evaluate their parallel performance.展开更多
Aiming to solve the steering instability and hysteresis of agricultural robots in the process of movement,a fusion PID control method of particle swarm optimization(PSO)and genetic algorithm(GA)was proposed.The fusion...Aiming to solve the steering instability and hysteresis of agricultural robots in the process of movement,a fusion PID control method of particle swarm optimization(PSO)and genetic algorithm(GA)was proposed.The fusion algorithm took advantage of the fast optimization ability of PSO to optimize the population screening link of GA.The Simulink simulation results showed that the convergence of the fitness function of the fusion algorithm was accelerated,the system response adjustment time was reduced,and the overshoot was almost zero.Then the algorithm was applied to the steering test of agricultural robot in various scenes.After modeling the steering system of agricultural robot,the steering test results in the unloaded suspended state showed that the PID control based on fusion algorithm reduced the rise time,response adjustment time and overshoot of the system,and improved the response speed and stability of the system,compared with the artificial trial and error PID control and the PID control based on GA.The actual road steering test results showed that the PID control response rise time based on the fusion algorithm was the shortest,about 4.43 s.When the target pulse number was set to 100,the actual mean value in the steady-state regulation stage was about 102.9,which was the closest to the target value among the three control methods,and the overshoot was reduced at the same time.The steering test results under various scene states showed that the PID control based on the proposed fusion algorithm had good anti-interference ability,it can adapt to the changes of environment and load and improve the performance of the control system.It was effective in the steering control of agricultural robot.This method can provide a reference for the precise steering control of other robots.展开更多
Optimizing routing and resource allocation in decentralized unmanned aerial vehicle(UAV)networks remains challenging due to interference and rapidly changing topologies.The authors introduce a novel framework combinin...Optimizing routing and resource allocation in decentralized unmanned aerial vehicle(UAV)networks remains challenging due to interference and rapidly changing topologies.The authors introduce a novel framework combining double deep Q-networks(DDQNs)and graph neural networks(GNNs)for joint routing and resource allocation.The framework uses GNNs to model the network topology and DDQNs to adaptively control routing and resource allocation,addressing interference and improving network performance.Simulation results show that the proposed approach outperforms traditional methods such as Closest-to-Destination(c2Dst),Max-SINR(mSINR),and Multi-Layer Perceptron(MLP)-based models,achieving approximately 23.5% improvement in throughput,50% increase in connection probability,and 17.6% reduction in number of hops,demonstrating its effectiveness in dynamic UAV networks.展开更多
Optimization is the key to obtaining efficient utilization of resources in structural design.Due to the complex nature of truss systems,this study presents a method based on metaheuristic modelling that minimises stru...Optimization is the key to obtaining efficient utilization of resources in structural design.Due to the complex nature of truss systems,this study presents a method based on metaheuristic modelling that minimises structural weight under stress and frequency constraints.Two new algorithms,the Red Kite Optimization Algorithm(ROA)and Secretary Bird Optimization Algorithm(SBOA),are utilized on five benchmark trusses with 10,18,37,72,and 200-bar trusses.Both algorithms are evaluated against benchmarks in the literature.The results indicate that SBOA always reaches a lighter optimal.Designs with reducing structural weight ranging from 0.02%to 0.15%compared to ROA,and up to 6%–8%as compared to conventional algorithms.In addition,SBOA can achieve 15%–20%faster convergence speed and 10%–18%reduction in computational time with a smaller standard deviation over independent runs,which demonstrates its robustness and reliability.It is indicated that the adaptive exploration mechanism of SBOA,especially its Levy flight–based search strategy,can obviously improve optimization performance for low-and high-dimensional trusses.The research has implications in the context of promoting bio-inspired optimization techniques by demonstrating the viability of SBOA,a reliable model for large-scale structural design that provides significant enhancements in performance and convergence behavior.展开更多
In this paper,we propose a new privacy-aware transmission scheduling algorithm for 6G ad hoc networks.This system enables end nodes to select the optimum time and scheme to transmit private data safely.In 6G dynamic h...In this paper,we propose a new privacy-aware transmission scheduling algorithm for 6G ad hoc networks.This system enables end nodes to select the optimum time and scheme to transmit private data safely.In 6G dynamic heterogeneous infrastructures,unstable links and non-uniform hardware capabilities create critical issues regarding security and privacy.Traditional protocols are often too computationally heavy to allow 6G services to achieve their expected Quality-of-Service(QoS).As the transport network is built of ad hoc nodes,there is no guarantee about their trustworthiness or behavior,and transversal functionalities are delegated to the extreme nodes.However,while security can be guaranteed in extreme-to-extreme solutions,privacy cannot,as all intermediate nodes still have to handle the data packets they are transporting.Besides,traditional schemes for private anonymous ad hoc communications are vulnerable against modern intelligent attacks based on learning models.The proposed scheme fulfills this gap.Findings show the probability of a successful intelligent attack reduces by up to 65%compared to ad hoc networks with no privacy protection strategy when used the proposed technology.While congestion probability can remain below 0.001%,as required in 6G services.展开更多
This paper introduces a novel nature-inspired metaheuristic algorithm called the Gekko japonicus algorithm.The algo-rithm draws inspiration mainly from the predation strategies and survival behaviors of the Gekko japo...This paper introduces a novel nature-inspired metaheuristic algorithm called the Gekko japonicus algorithm.The algo-rithm draws inspiration mainly from the predation strategies and survival behaviors of the Gekko japonicus.The math-ematical model is developed by simulating various biological behaviors of the Gekko japonicus,such as hybrid loco-motion patterns,directional olfactory guidance,implicit group advantage tendencies,and the tail autotomy mechanism.By integrating multi-stage mutual constraints and dynamically adjusting parameters,GJA maintains an optimal balance between global exploration and local exploitation,thereby effectively solving complex optimization problems.To assess the performance of GJA,comparative analyses were performed against fourteen state-of-the-art metaheuristic algorithms using the CEC2017 and CEC2022 benchmark test sets.Additionally,a Friedman test was performed on the experimen-tal results to assess the statistical significance of differences between various algorithms.And GJA was evaluated using multiple qualitative indicators,further confirming its superiority in exploration and exploitation.Finally,GJA was utilized to solve four engineering optimization problems and further implemented in robotic path planning to verify its practical applicability.Experimental results indicate that,compared to other high-performance algorithms,GJA demonstrates excep-tional performance as a powerful optimization algorithm in complex optimization problems.We make the code publicly available at:https://github.com/zhy1109/Gekko-japonicusalgorithm.展开更多
The Intrusion Detection System(IDS)is a security mechanism developed to observe network traffic and recognize suspicious or malicious activities.Clustering algorithms are often incorporated into IDS;however,convention...The Intrusion Detection System(IDS)is a security mechanism developed to observe network traffic and recognize suspicious or malicious activities.Clustering algorithms are often incorporated into IDS;however,conventional clustering-based methods face notable drawbacks,including poor scalability in handling high-dimensional datasets and a strong dependence of outcomes on initial conditions.To overcome the performance limitations of existing methods,this study proposes a novel quantum-inspired clustering algorithm that relies on a similarity coefficient-based quantum genetic algorithm(SC-QGA)and an improved quantum artificial bee colony algorithm hybrid K-means(IQABC-K).First,the SC-QGA algorithmis constructed based on quantum computing and integrates similarity coefficient theory to strengthen genetic diversity and feature extraction capabilities.For the subsequent clustering phase,the process based on the IQABC-K algorithm is enhanced with the core improvement of adaptive rotation gate and movement exploitation strategies to balance the exploration capabilities of global search and the exploitation capabilities of local search.Simultaneously,the acceleration of convergence toward the global optimum and a reduction in computational complexity are facilitated by means of the global optimum bootstrap strategy and a linear population reduction strategy.Through experimental evaluation with multiple algorithms and diverse performance metrics,the proposed algorithm confirms reliable accuracy on three datasets:KDD CUP99,NSL_KDD,and UNSW_NB15,achieving accuracy of 98.57%,98.81%,and 98.32%,respectively.These results affirm its potential as an effective solution for practical clustering applications.展开更多
Classical computation of electronic properties in large-scale materials remains challenging.Quantum computation has the potential to offer advantages in memory footprint and computational scaling.However,general and v...Classical computation of electronic properties in large-scale materials remains challenging.Quantum computation has the potential to offer advantages in memory footprint and computational scaling.However,general and viable quantum algorithms for simulating large-scale materials are still limited.We propose and implement random-state quantum algorithms to calculate electronic-structure properties of real materials.Using a random state circuit on a small number of qubits,we employ real-time evolution with first-order Trotter decomposition and Hadamard test to obtain electronic density of states,and we develop a modified quantum phase estimation algorithm to calculate real-space local density of states via direct quantum measurements.Furthermore,we validate these algorithms by numerically computing the density of states and spatial distributions of electronic states in graphene,twisted bilayer graphene quasicrystals,and fractal lattices,covering system sizes from hundreds to thousands of atoms.Our results manifest that the random-state quantum algorithms provide a general and qubit-efficient route to scalable simulations of electronic properties in large-scale periodic and aperiodic materials.展开更多
Multi-label feature selection(MFS)is a crucial dimensionality reduction technique aimed at identifying informative features associated with multiple labels.However,traditional centralized methods face significant chal...Multi-label feature selection(MFS)is a crucial dimensionality reduction technique aimed at identifying informative features associated with multiple labels.However,traditional centralized methods face significant challenges in privacy-sensitive and distributed settings,often neglecting label dependencies and suffering from low computational efficiency.To address these issues,we introduce a novel framework,Fed-MFSDHBCPSO—federated MFS via dual-layer hybrid breeding cooperative particle swarm optimization algorithm with manifold and sparsity regularization(DHBCPSO-MSR).Leveraging the federated learning paradigm,Fed-MFSDHBCPSO allows clients to perform local feature selection(FS)using DHBCPSO-MSR.Locally selected feature subsets are encrypted with differential privacy(DP)and transmitted to a central server,where they are securely aggregated and refined through secure multi-party computation(SMPC)until global convergence is achieved.Within each client,DHBCPSO-MSR employs a dual-layer FS strategy.The inner layer constructs sample and label similarity graphs,generates Laplacian matrices to capture the manifold structure between samples and labels,and applies L2,1-norm regularization to sparsify the feature subset,yielding an optimized feature weight matrix.The outer layer uses a hybrid breeding cooperative particle swarm optimization algorithm to further refine the feature weight matrix and identify the optimal feature subset.The updated weight matrix is then fed back to the inner layer for further optimization.Comprehensive experiments on multiple real-world multi-label datasets demonstrate that Fed-MFSDHBCPSO consistently outperforms both centralized and federated baseline methods across several key evaluation metrics.展开更多
ThePigeon-InspiredOptimization(PIO)algorithmconstitutes ametaheuristic method derived fromthe homing behaviour of pigeons.Initially formulated for three-dimensional path planning in unmanned aerial vehicles(UAVs),the ...ThePigeon-InspiredOptimization(PIO)algorithmconstitutes ametaheuristic method derived fromthe homing behaviour of pigeons.Initially formulated for three-dimensional path planning in unmanned aerial vehicles(UAVs),the algorithmhas attracted considerable academic and industrial interest owing to its effective balance between exploration and exploitation,coupled with advantages in real-time performance and robustness.Nevertheless,as applications have diversified,limitations in convergence precision and a tendency toward premature convergence have become increasingly evident,highlighting a need for improvement.This reviewsystematically outlines the developmental trajectory of the PIO algorithm,with a particular focus on its core applications in UAV navigation,multi-objective formulations,and a spectrum of variantmodels that have emerged in recent years.It offers a structured analysis of the foundational principles underlying the PIO.It conducts a comparative assessment of various performance-enhanced versions,including hybrid models that integrate mechanisms from other optimization paradigms.Additionally,the strengths andweaknesses of distinct PIOvariants are critically examined frommultiple perspectives,including intrinsic algorithmic characteristics,suitability for specific application scenarios,objective function design,and the rigor of the statistical evaluation methodologies employed in empirical studies.Finally,this paper identifies principal challenges within current PIO research and proposes several prospective research directions.Future work should focus on mitigating premature convergence by refining the two-phase search structure and adjusting the exponential decrease of individual numbers during the landmark operator.Enhancing parameter adaptation strategies,potentially using reinforcement learning for dynamic tuning,and advancing theoretical analyses on convergence and complexity are also critical.Further applications should be explored in constrained path planning,Neural Architecture Search(NAS),and other real-worldmulti-objective problems.For Multi-objective PIO(MPIO),key improvements include controlling the growth of the external archive and designing more effective selection mechanisms to maintain convergence efficiency.These efforts are expected to strengthen both the theoretical foundation and practical versatility of PIO and its variants.展开更多
In December 2025,Australia became the first country to ban social media for people under 16,sparking a worldwide debate on how to protect teens online without undue interference.While the goal of keeping young people ...In December 2025,Australia became the first country to ban social media for people under 16,sparking a worldwide debate on how to protect teens online without undue interference.While the goal of keeping young people away from harmful content and addictive algorithms is wise,a total ban may be counterproductive.A better approach is to combine regulation,education and parental guidance.展开更多
Community detection is one of the most fundamental applications in understanding the structure of complicated networks.Furthermore,it is an important approach to identifying closely linked clusters of nodes that may r...Community detection is one of the most fundamental applications in understanding the structure of complicated networks.Furthermore,it is an important approach to identifying closely linked clusters of nodes that may represent underlying patterns and relationships.Networking structures are highly sensitive in social networks,requiring advanced techniques to accurately identify the structure of these communities.Most conventional algorithms for detecting communities perform inadequately with complicated networks.In addition,they miss out on accurately identifying clusters.Since single-objective optimization cannot always generate accurate and comprehensive results,as multi-objective optimization can.Therefore,we utilized two objective functions that enable strong connections between communities and weak connections between them.In this study,we utilized the intra function,which has proven effective in state-of-the-art research studies.We proposed a new inter-function that has demonstrated its effectiveness by making the objective of detecting external connections between communities is to make them more distinct and sparse.Furthermore,we proposed a Multi-Objective community strength enhancement algorithm(MOCSE).The proposed algorithm is based on the framework of the Multi-Objective Evolutionary Algorithm with Decomposition(MOEA/D),integrated with a new heuristic mutation strategy,community strength enhancement(CSE).The results demonstrate that the model is effective in accurately identifying community structures while also being computationally efficient.The performance measures used to evaluate the MOEA/D algorithm in our work are normalized mutual information(NMI)and modularity(Q).It was tested using five state-of-the-art algorithms on social networks,comprising real datasets(Zachary,Dolphin,Football,Krebs,SFI,Jazz,and Netscience),as well as twenty synthetic datasets.These results provide the robustness and practical value of the proposed algorithm in multi-objective community identification.展开更多
BACKGROUND:This study aims to develop and validate a machine learning-based in-hospital mortality predictive model for acute aortic syndrome(AAS)in the emergency department(ED)and to derive a simplifi ed version suita...BACKGROUND:This study aims to develop and validate a machine learning-based in-hospital mortality predictive model for acute aortic syndrome(AAS)in the emergency department(ED)and to derive a simplifi ed version suitable for rapid clinical application.METHODS:In this multi-center retrospective cohort study,AAS patient data from three hospitals were analyzed.The modeling cohort included data from the First Affiliated Hospital of Zhengzhou University and the People’s Hospital of Xinjiang Uygur Autonomous Region,with Peking University Third Hospital data serving as the external test set.Four machine learning algorithms—logistic regression(LR),multilayer perceptron(MLP),Gaussian naive Bayes(GNB),and random forest(RF)—were used to develop predictive models based on 34 early-accessible clinical variables.A simplifi ed model was then derived based on fi ve key variables(Stanford type,pericardial eff usion,asymmetric peripheral arterial pulsation,decreased bowel sounds,and dyspnea)via Least Absolute Shrinkage and Selection Operator(LASSO)regression to improve ED applicability.RESULTS:A total of 929 patients were included in the modeling cohort,and 210 were included in the external test set.Four machine learning models based on 34 clinical variables were developed,achieving internal and external validation AUCs of 0.85-0.90 and 0.73-0.85,respectively.The simplifi ed model incorporating fi ve key variables demonstrated internal and external validation AUCs of 0.71-0.86 and 0.75-0.78,respectively.Both models showed robust calibration and predictive stability across datasets.CONCLUSION:Both kinds of models were built based on machine learning tools,and proved to have certain prediction performance and extrapolation.展开更多
With the rapid development of transportation infrastructure,ensuring road safety through timely and accurate highway inspection has become increasingly critical.Traditional manual inspection methods are not only time-...With the rapid development of transportation infrastructure,ensuring road safety through timely and accurate highway inspection has become increasingly critical.Traditional manual inspection methods are not only time-consuming and labor-intensive,but they also struggle to provide consistent,high-precision detection and realtime monitoring of pavement surface defects.To overcome these limitations,we propose an Automatic Recognition of PavementDefect(ARPD)algorithm,which leverages unmanned aerial vehicle(UAV)-based aerial imagery to automate the inspection process.The ARPD framework incorporates a backbone network based on the Selective State Space Model(S3M),which is designed to capture long-range temporal dependencies.This enables effective modeling of dynamic correlations among redundant and often repetitive structures commonly found in road imagery.Furthermore,a neck structure based on Semantics and Detail Infusion(SDI)is introduced to guide cross-scale feature fusion.The SDI module enhances the integration of low-level spatial details with high-level semantic cues,thereby improving feature expressiveness and defect localization accuracy.Experimental evaluations demonstrate that theARPDalgorithm achieves a mean average precision(mAP)of 86.1%on a custom-labeled pavement defect dataset,outperforming the state-of-the-art YOLOv11 segmentation model.The algorithm also maintains strong generalization ability on public datasets.These results confirm that ARPD is well-suited for diverse real-world applications in intelligent,large-scale highway defect monitoring and maintenance planning.展开更多
Community detection is a fundamental problem in network analysis for identifying densely connected node clusters,with successful applications in diverse fields like social networks,recommendation systems,biology,and c...Community detection is a fundamental problem in network analysis for identifying densely connected node clusters,with successful applications in diverse fields like social networks,recommendation systems,biology,and cyberattack detection.Overlapping community detection refers to the case of a node belonging to multiple communities simultaneously,which is a much more meaningful and challenging task.Graph representation learning with Evolutionary Computation has been studied well in overlapping community detection to deal with complex network structures and characteristics.However,most of them focus on searching the entire solution space,which can be inefficient and lead to inadequate results.To overcome the problem,a structural feature node extraction method is first proposed that can effectively map a network into a structural embedding space.Thus,nodes within the network are classified into hierarchical levels based on their structural feature strength,and only nodes with relatively high strength are considered in subsequent search steps to reduce the search space.Then,a maximal-clique representation method is employed on the given vertex set to identify overlapping nodes.A hybrid clique-based multi-objective evolutionary algorithmwith decomposition method is designed to address cliques and the remaining unexplored nodes separately.The number of communities generated with this allocation method is closer to the actual partition count with high division quality.Experimental results on nine usually used real-world networks,five synthetic networks,and two large-scale networks demonstrate the effectiveness of the proposed methodology in terms of community quality and algorithmic efficiency,compared to traditional,MOEA-based,and graph embedding-based community detection algorithms.展开更多
Aiming at the scale adaptation of automatic driving target detection algorithms in low illumination environments and the shortcomings in target occlusion processing,this paper proposes a YOLO-LKSDS automatic driving d...Aiming at the scale adaptation of automatic driving target detection algorithms in low illumination environments and the shortcomings in target occlusion processing,this paper proposes a YOLO-LKSDS automatic driving detection model.Firstly,the Contrast-Limited Adaptive Histogram Equalisation(CLAHE)image enhancement algorithm is improved to increase the image contrast and enhance the detailed features of the target;then,on the basis of the YOLOv5 model,the Kmeans++clustering algorithm is introduced to obtain a suitable anchor frame,and SPPELAN spatial pyramid pooling is improved to enhance the accuracy and robustness of the model for multi-scale target detection.Finally,an improved SEAM(Separated and Enhancement Attention Module)attention mechanism is combined with the DIOU-NMS algorithm to optimize the model’s performance when dealing with occlusion and dense scenes.Compared with the original model,the improved YOLO-LKSDS model achieves a 13.3%improvement in accuracy,a 1.7%improvement in mAP,and 240,000 fewer parameters on the BDD100K dataset.In order to validate the generalization of the improved algorithm,we selected the KITTI dataset for experimentation,which shows that YOLOv5’s accuracy improves by 21.1%,recall by 36.6%,and mAP50 by 29.5%,respectively,on the KITTI dataset.The deployment of this paper’s algorithm is verified by an edge computing platform,where the average speed of detection reaches 24.4 FPS while power consumption remains below 9 W,demonstrating high real-time capability and energy efficiency.展开更多
Selectivity remains a significant challenge for gas sensors. In contrast to conventional gas sensors that depend solely on conductivity to detect gases, we exploited a single NiO-doped SnO_(2) sensor to simultaneously...Selectivity remains a significant challenge for gas sensors. In contrast to conventional gas sensors that depend solely on conductivity to detect gases, we exploited a single NiO-doped SnO_(2) sensor to simultaneously monitor transient changes in both sensor conductivity and temperature. The distinct response profiles of H_(2) and NH_(3) gases were attributed to differences in their redox rates and enthalpy changes during chemical reactions, which provided an opportunity for gas identification using machine learning(ML) algorithms. The test results indicate that preprocessing the extracted calorimetric and chemi-resistive parameters using the principal component analysis(PCA), followed by the application of ML classifiers for identification,enables a 100% accuracy for both target analytes. This work presents a facile gas identification method that enhances chiplevel sensor applications while minimizing the need for complex sensor arrays.展开更多
To solve the false detection and missed detection problems caused by various types and sizes of defects in the detection of steel surface defects,similar defects and background features,and similarities between differ...To solve the false detection and missed detection problems caused by various types and sizes of defects in the detection of steel surface defects,similar defects and background features,and similarities between different defects,this paper proposes a lightweight detection model named multiscale edge and squeeze-and-excitation attention detection network(MSESE),which is built upon the You Only Look Once version 11 nano(YOLOv11n).To address the difficulty of locating defect edges,we first propose an edge enhancement module(EEM),apply it to the process of multiscale feature extraction,and then propose a multiscale edge enhancement module(MSEEM).By obtaining defect features from different scales and enhancing their edge contours,the module uses the dual-domain selection mechanism to effectively focus on the important areas in the image to ensure that the feature images have richer information and clearer contour features.By fusing the squeeze-and-excitation attention mechanism with the EEM,we obtain a lighter module that can enhance the representation of edge features,which is named the edge enhancement module with squeeze-and-excitation attention(EEMSE).This module was subsequently integrated into the detection head.The enhanced detection head achieves improved edge feature enhancement with reduced computational overhead,while effectively adjusting channel-wise importance and further refining feature representation.Experiments on the NEU-DET dataset show that,compared with the original YOLOv11n,the improved model achieves improvements of 4.1%and 2.2%in terms of mAP@0.5 and mAP@0.5:0.95,respectively,and the GFLOPs value decreases from the original value of 6.4 to 6.2.Furthermore,when compared to current mainstream models,Mamba-YOLOT and RTDETR-R34,our method achieves superior performance with 6.5%and 8.9%higher mAP@0.5,respectively,while maintaining a more compact parameter footprint.These results collectively validate the effectiveness and efficiency of our proposed approach.展开更多
Canopy photosynthesis,rather than leaf photosynthesis,is highly related to plant biomass and yield formation.Studying canopy photosynthesis and identifying the parameters that control it can help optimize agricultural...Canopy photosynthesis,rather than leaf photosynthesis,is highly related to plant biomass and yield formation.Studying canopy photosynthesis and identifying the parameters that control it can help optimize agricultural management and achieve crop yield potential.Compared with traditional parameters,canopy occupation volume(COV)offers an integrative parameter on canopy architecture related to canopy photosynthetic rates.In this study,we developed a high-throughput method to derive COV for different rice varieties.We first used multi-perspective two-dimensional imaging to reconstruct three-dimensional point clouds of rice plants and developed a suite of pipelines to calculate plant height,leaf number,tiller number,and biomass,with R^(2) values of 91.8%,95.9%,82.3%,and 94.3%,respectively.We further employed point cloud data to reconstruct the surfaces of rice plants and construct a virtual canopy model of the rice population.Light distribution was simulated using a ray-tracing algorithm and canopy photosynthetic rates were simulated via photosynthetic rate-incident light intensity curve fitting.Furthermore,we systematically explored the relationships between canopy phenotypes and photosynthetic rates,and found that COV was the most effective predictor of canopy photosynthesis,achieving an R^(2) value of 92.1%.Adjustment in atmospheric transmittance showed that COV strongly correlated with canopy photosynthesis under different light conditions,with higher accuracy observed under diffuse light.Variations in planting density confirmed that this correlation remained strong at the community level.In summary,this study demonstrates that COV is closely linked to simulated canopy photosynthesis and the developed pipeline can support future agronomic and breeding research.展开更多
Optimization algorithms are crucial for solving NP-hard problems in engineering and computational sciences.Metaheuristic algorithms,in particular,have proven highly effective in complex optimization scenarios characte...Optimization algorithms are crucial for solving NP-hard problems in engineering and computational sciences.Metaheuristic algorithms,in particular,have proven highly effective in complex optimization scenarios characterized by high dimensionality and intricate variable relationships.The Mountain Gazelle Optimizer(MGO)is notably effective but struggles to balance local search refinement and global space exploration,often leading to premature convergence and entrapment in local optima.This paper presents the Improved MGO(IMGO),which integrates three synergistic enhancements:dynamic chaos mapping using piecewise chaotic sequences to boost explo-ration diversity;Opposition-Based Learning(OBL)with adaptive,diversity-driven activation to speed up convergence;and structural refinements to the position update mechanisms to enhance exploitation.The IMGO underwent a comprehensive evaluation using 52 standardised benchmark functions and seven engineering optimization problems.Benchmark evaluations showed that IMGO achieved the highest rank in best solution quality for 31 functions,the highest rank in mean performance for 18 functions,and the highest rank in worst-case performance for 14 functions among 11 competing algorithms.Statistical validation using Wilcoxon signed-rank tests confirmed that IMGO outperformed individual competitors across 16 to 50 functions,depending on the algorithm.At the same time,Friedman ranking analysis placed IMGO with an average rank of 4.15,compared to the baseline MGO’s 4.38,establishing the best overall performance.The evaluation of engineering problems revealed consistent improvements,including an optimal cost of 1.6896 for the welded beam design vs.MGO’s 1.7249,a minimum cost of 5885.33 for the pressure vessel design vs.MGO’s 6300,and a minimum weight of 2964.52 kg for the speed reducer design vs.MGO’s 2990.00 kg.Ablation studies identified OBL as the strongest individual contributor,whereas complete integration achieved superior performance through synergistic interactions among components.Computational complexity analysis established an O(T×N×5×f(P))time complexity,representing a 1.25×increase in fitness evaluation relative to the baseline MGO,validating the favorable accuracy-efficiency trade-offs for practical optimization applications.展开更多
基金supported by the P.G.Senapathy Center for Computing Resources at IIT Madrasfunding provided by the Ministry of Education,Government of Indiasupported by the National Natural Science Foundation of China(Grant Nos.12388101,12472224 and 92252104).
文摘This paper presents an Eulerian-Lagrangian algorithm for direct numerical simulation(DNS)of particle-laden flows.The algorithm is applicable to perform simulations of dilute suspensions of small inertial particles in turbulent carrier flow.The Eulerian framework numerically resolves turbulent carrier flow using a parallelized,finite-volume DNS solver on a staggered Cartesian grid.Particles are tracked using a point-particle method utilizing a Lagrangian particle tracking(LPT)algorithm.The proposed Eulerian-Lagrangian algorithm is validated using an inertial particle-laden turbulent channel flow for different Stokes number cases.The particle concentration profiles and higher-order statistics of the carrier and dispersed phases agree well with the benchmark results.We investigated the effect of fluid velocity interpolation and numerical integration schemes of particle tracking algorithms on particle dispersion statistics.The suitability of fluid velocity interpolation schemes for predicting the particle dispersion statistics is discussed in the framework of the particle tracking algorithm coupled to the finite-volume solver.In addition,we present parallelization strategies implemented in the algorithm and evaluate their parallel performance.
文摘Aiming to solve the steering instability and hysteresis of agricultural robots in the process of movement,a fusion PID control method of particle swarm optimization(PSO)and genetic algorithm(GA)was proposed.The fusion algorithm took advantage of the fast optimization ability of PSO to optimize the population screening link of GA.The Simulink simulation results showed that the convergence of the fitness function of the fusion algorithm was accelerated,the system response adjustment time was reduced,and the overshoot was almost zero.Then the algorithm was applied to the steering test of agricultural robot in various scenes.After modeling the steering system of agricultural robot,the steering test results in the unloaded suspended state showed that the PID control based on fusion algorithm reduced the rise time,response adjustment time and overshoot of the system,and improved the response speed and stability of the system,compared with the artificial trial and error PID control and the PID control based on GA.The actual road steering test results showed that the PID control response rise time based on the fusion algorithm was the shortest,about 4.43 s.When the target pulse number was set to 100,the actual mean value in the steady-state regulation stage was about 102.9,which was the closest to the target value among the three control methods,and the overshoot was reduced at the same time.The steering test results under various scene states showed that the PID control based on the proposed fusion algorithm had good anti-interference ability,it can adapt to the changes of environment and load and improve the performance of the control system.It was effective in the steering control of agricultural robot.This method can provide a reference for the precise steering control of other robots.
文摘Optimizing routing and resource allocation in decentralized unmanned aerial vehicle(UAV)networks remains challenging due to interference and rapidly changing topologies.The authors introduce a novel framework combining double deep Q-networks(DDQNs)and graph neural networks(GNNs)for joint routing and resource allocation.The framework uses GNNs to model the network topology and DDQNs to adaptively control routing and resource allocation,addressing interference and improving network performance.Simulation results show that the proposed approach outperforms traditional methods such as Closest-to-Destination(c2Dst),Max-SINR(mSINR),and Multi-Layer Perceptron(MLP)-based models,achieving approximately 23.5% improvement in throughput,50% increase in connection probability,and 17.6% reduction in number of hops,demonstrating its effectiveness in dynamic UAV networks.
文摘Optimization is the key to obtaining efficient utilization of resources in structural design.Due to the complex nature of truss systems,this study presents a method based on metaheuristic modelling that minimises structural weight under stress and frequency constraints.Two new algorithms,the Red Kite Optimization Algorithm(ROA)and Secretary Bird Optimization Algorithm(SBOA),are utilized on five benchmark trusses with 10,18,37,72,and 200-bar trusses.Both algorithms are evaluated against benchmarks in the literature.The results indicate that SBOA always reaches a lighter optimal.Designs with reducing structural weight ranging from 0.02%to 0.15%compared to ROA,and up to 6%–8%as compared to conventional algorithms.In addition,SBOA can achieve 15%–20%faster convergence speed and 10%–18%reduction in computational time with a smaller standard deviation over independent runs,which demonstrates its robustness and reliability.It is indicated that the adaptive exploration mechanism of SBOA,especially its Levy flight–based search strategy,can obviously improve optimization performance for low-and high-dimensional trusses.The research has implications in the context of promoting bio-inspired optimization techniques by demonstrating the viability of SBOA,a reliable model for large-scale structural design that provides significant enhancements in performance and convergence behavior.
基金funding from the European Commission by the Ruralities project(grant agreement no.101060876).
文摘In this paper,we propose a new privacy-aware transmission scheduling algorithm for 6G ad hoc networks.This system enables end nodes to select the optimum time and scheme to transmit private data safely.In 6G dynamic heterogeneous infrastructures,unstable links and non-uniform hardware capabilities create critical issues regarding security and privacy.Traditional protocols are often too computationally heavy to allow 6G services to achieve their expected Quality-of-Service(QoS).As the transport network is built of ad hoc nodes,there is no guarantee about their trustworthiness or behavior,and transversal functionalities are delegated to the extreme nodes.However,while security can be guaranteed in extreme-to-extreme solutions,privacy cannot,as all intermediate nodes still have to handle the data packets they are transporting.Besides,traditional schemes for private anonymous ad hoc communications are vulnerable against modern intelligent attacks based on learning models.The proposed scheme fulfills this gap.Findings show the probability of a successful intelligent attack reduces by up to 65%compared to ad hoc networks with no privacy protection strategy when used the proposed technology.While congestion probability can remain below 0.001%,as required in 6G services.
基金CHINA POSTDOCTORAL SCIENCE FOUNDATION(Grant No.2025M771925)Young Scientists Fund(C Class)(Grant No.32501636)Special Fund of Fundamental Scientific Research Business Expense for Higher School of Central Government(Grant No.2572025JT04).
文摘This paper introduces a novel nature-inspired metaheuristic algorithm called the Gekko japonicus algorithm.The algo-rithm draws inspiration mainly from the predation strategies and survival behaviors of the Gekko japonicus.The math-ematical model is developed by simulating various biological behaviors of the Gekko japonicus,such as hybrid loco-motion patterns,directional olfactory guidance,implicit group advantage tendencies,and the tail autotomy mechanism.By integrating multi-stage mutual constraints and dynamically adjusting parameters,GJA maintains an optimal balance between global exploration and local exploitation,thereby effectively solving complex optimization problems.To assess the performance of GJA,comparative analyses were performed against fourteen state-of-the-art metaheuristic algorithms using the CEC2017 and CEC2022 benchmark test sets.Additionally,a Friedman test was performed on the experimen-tal results to assess the statistical significance of differences between various algorithms.And GJA was evaluated using multiple qualitative indicators,further confirming its superiority in exploration and exploitation.Finally,GJA was utilized to solve four engineering optimization problems and further implemented in robotic path planning to verify its practical applicability.Experimental results indicate that,compared to other high-performance algorithms,GJA demonstrates excep-tional performance as a powerful optimization algorithm in complex optimization problems.We make the code publicly available at:https://github.com/zhy1109/Gekko-japonicusalgorithm.
基金supported by the NSFC(Grant Nos.62176273,62271070,62441212)The Open Foundation of State Key Laboratory of Networking and Switching Technology(Beijing University of Posts and Telecommunications)under Grant SKLNST-2024-1-062025Major Project of the Natural Science Foundation of Inner Mongolia(2025ZD008).
文摘The Intrusion Detection System(IDS)is a security mechanism developed to observe network traffic and recognize suspicious or malicious activities.Clustering algorithms are often incorporated into IDS;however,conventional clustering-based methods face notable drawbacks,including poor scalability in handling high-dimensional datasets and a strong dependence of outcomes on initial conditions.To overcome the performance limitations of existing methods,this study proposes a novel quantum-inspired clustering algorithm that relies on a similarity coefficient-based quantum genetic algorithm(SC-QGA)and an improved quantum artificial bee colony algorithm hybrid K-means(IQABC-K).First,the SC-QGA algorithmis constructed based on quantum computing and integrates similarity coefficient theory to strengthen genetic diversity and feature extraction capabilities.For the subsequent clustering phase,the process based on the IQABC-K algorithm is enhanced with the core improvement of adaptive rotation gate and movement exploitation strategies to balance the exploration capabilities of global search and the exploitation capabilities of local search.Simultaneously,the acceleration of convergence toward the global optimum and a reduction in computational complexity are facilitated by means of the global optimum bootstrap strategy and a linear population reduction strategy.Through experimental evaluation with multiple algorithms and diverse performance metrics,the proposed algorithm confirms reliable accuracy on three datasets:KDD CUP99,NSL_KDD,and UNSW_NB15,achieving accuracy of 98.57%,98.81%,and 98.32%,respectively.These results affirm its potential as an effective solution for practical clustering applications.
基金supported by the Major Project for the Integration of ScienceEducation and Industry (Grant No.2025ZDZX02)。
文摘Classical computation of electronic properties in large-scale materials remains challenging.Quantum computation has the potential to offer advantages in memory footprint and computational scaling.However,general and viable quantum algorithms for simulating large-scale materials are still limited.We propose and implement random-state quantum algorithms to calculate electronic-structure properties of real materials.Using a random state circuit on a small number of qubits,we employ real-time evolution with first-order Trotter decomposition and Hadamard test to obtain electronic density of states,and we develop a modified quantum phase estimation algorithm to calculate real-space local density of states via direct quantum measurements.Furthermore,we validate these algorithms by numerically computing the density of states and spatial distributions of electronic states in graphene,twisted bilayer graphene quasicrystals,and fractal lattices,covering system sizes from hundreds to thousands of atoms.Our results manifest that the random-state quantum algorithms provide a general and qubit-efficient route to scalable simulations of electronic properties in large-scale periodic and aperiodic materials.
文摘Multi-label feature selection(MFS)is a crucial dimensionality reduction technique aimed at identifying informative features associated with multiple labels.However,traditional centralized methods face significant challenges in privacy-sensitive and distributed settings,often neglecting label dependencies and suffering from low computational efficiency.To address these issues,we introduce a novel framework,Fed-MFSDHBCPSO—federated MFS via dual-layer hybrid breeding cooperative particle swarm optimization algorithm with manifold and sparsity regularization(DHBCPSO-MSR).Leveraging the federated learning paradigm,Fed-MFSDHBCPSO allows clients to perform local feature selection(FS)using DHBCPSO-MSR.Locally selected feature subsets are encrypted with differential privacy(DP)and transmitted to a central server,where they are securely aggregated and refined through secure multi-party computation(SMPC)until global convergence is achieved.Within each client,DHBCPSO-MSR employs a dual-layer FS strategy.The inner layer constructs sample and label similarity graphs,generates Laplacian matrices to capture the manifold structure between samples and labels,and applies L2,1-norm regularization to sparsify the feature subset,yielding an optimized feature weight matrix.The outer layer uses a hybrid breeding cooperative particle swarm optimization algorithm to further refine the feature weight matrix and identify the optimal feature subset.The updated weight matrix is then fed back to the inner layer for further optimization.Comprehensive experiments on multiple real-world multi-label datasets demonstrate that Fed-MFSDHBCPSO consistently outperforms both centralized and federated baseline methods across several key evaluation metrics.
基金supported by the National Natural Science Foundation of China under grant number 62066016the Natural Science Foundation of Hunan Province of China under grant number 2024JJ7395+2 种基金International and Regional Science and Technology Cooperation and Exchange Program of the Hunan Association for Science and Technology under grant number 025SKX-KJ-04Hunan Provincial Postgraduate Research Innovation Project under grant numberCX20251611Liye Qin Bamboo Slips Research Special Project of JishouUniversity 25LYY03.
文摘ThePigeon-InspiredOptimization(PIO)algorithmconstitutes ametaheuristic method derived fromthe homing behaviour of pigeons.Initially formulated for three-dimensional path planning in unmanned aerial vehicles(UAVs),the algorithmhas attracted considerable academic and industrial interest owing to its effective balance between exploration and exploitation,coupled with advantages in real-time performance and robustness.Nevertheless,as applications have diversified,limitations in convergence precision and a tendency toward premature convergence have become increasingly evident,highlighting a need for improvement.This reviewsystematically outlines the developmental trajectory of the PIO algorithm,with a particular focus on its core applications in UAV navigation,multi-objective formulations,and a spectrum of variantmodels that have emerged in recent years.It offers a structured analysis of the foundational principles underlying the PIO.It conducts a comparative assessment of various performance-enhanced versions,including hybrid models that integrate mechanisms from other optimization paradigms.Additionally,the strengths andweaknesses of distinct PIOvariants are critically examined frommultiple perspectives,including intrinsic algorithmic characteristics,suitability for specific application scenarios,objective function design,and the rigor of the statistical evaluation methodologies employed in empirical studies.Finally,this paper identifies principal challenges within current PIO research and proposes several prospective research directions.Future work should focus on mitigating premature convergence by refining the two-phase search structure and adjusting the exponential decrease of individual numbers during the landmark operator.Enhancing parameter adaptation strategies,potentially using reinforcement learning for dynamic tuning,and advancing theoretical analyses on convergence and complexity are also critical.Further applications should be explored in constrained path planning,Neural Architecture Search(NAS),and other real-worldmulti-objective problems.For Multi-objective PIO(MPIO),key improvements include controlling the growth of the external archive and designing more effective selection mechanisms to maintain convergence efficiency.These efforts are expected to strengthen both the theoretical foundation and practical versatility of PIO and its variants.
文摘In December 2025,Australia became the first country to ban social media for people under 16,sparking a worldwide debate on how to protect teens online without undue interference.While the goal of keeping young people away from harmful content and addictive algorithms is wise,a total ban may be counterproductive.A better approach is to combine regulation,education and parental guidance.
文摘Community detection is one of the most fundamental applications in understanding the structure of complicated networks.Furthermore,it is an important approach to identifying closely linked clusters of nodes that may represent underlying patterns and relationships.Networking structures are highly sensitive in social networks,requiring advanced techniques to accurately identify the structure of these communities.Most conventional algorithms for detecting communities perform inadequately with complicated networks.In addition,they miss out on accurately identifying clusters.Since single-objective optimization cannot always generate accurate and comprehensive results,as multi-objective optimization can.Therefore,we utilized two objective functions that enable strong connections between communities and weak connections between them.In this study,we utilized the intra function,which has proven effective in state-of-the-art research studies.We proposed a new inter-function that has demonstrated its effectiveness by making the objective of detecting external connections between communities is to make them more distinct and sparse.Furthermore,we proposed a Multi-Objective community strength enhancement algorithm(MOCSE).The proposed algorithm is based on the framework of the Multi-Objective Evolutionary Algorithm with Decomposition(MOEA/D),integrated with a new heuristic mutation strategy,community strength enhancement(CSE).The results demonstrate that the model is effective in accurately identifying community structures while also being computationally efficient.The performance measures used to evaluate the MOEA/D algorithm in our work are normalized mutual information(NMI)and modularity(Q).It was tested using five state-of-the-art algorithms on social networks,comprising real datasets(Zachary,Dolphin,Football,Krebs,SFI,Jazz,and Netscience),as well as twenty synthetic datasets.These results provide the robustness and practical value of the proposed algorithm in multi-objective community identification.
基金supported by the special fund of the National Clinical Key Specialty Construction Program[(2022)301-2305].
文摘BACKGROUND:This study aims to develop and validate a machine learning-based in-hospital mortality predictive model for acute aortic syndrome(AAS)in the emergency department(ED)and to derive a simplifi ed version suitable for rapid clinical application.METHODS:In this multi-center retrospective cohort study,AAS patient data from three hospitals were analyzed.The modeling cohort included data from the First Affiliated Hospital of Zhengzhou University and the People’s Hospital of Xinjiang Uygur Autonomous Region,with Peking University Third Hospital data serving as the external test set.Four machine learning algorithms—logistic regression(LR),multilayer perceptron(MLP),Gaussian naive Bayes(GNB),and random forest(RF)—were used to develop predictive models based on 34 early-accessible clinical variables.A simplifi ed model was then derived based on fi ve key variables(Stanford type,pericardial eff usion,asymmetric peripheral arterial pulsation,decreased bowel sounds,and dyspnea)via Least Absolute Shrinkage and Selection Operator(LASSO)regression to improve ED applicability.RESULTS:A total of 929 patients were included in the modeling cohort,and 210 were included in the external test set.Four machine learning models based on 34 clinical variables were developed,achieving internal and external validation AUCs of 0.85-0.90 and 0.73-0.85,respectively.The simplifi ed model incorporating fi ve key variables demonstrated internal and external validation AUCs of 0.71-0.86 and 0.75-0.78,respectively.Both models showed robust calibration and predictive stability across datasets.CONCLUSION:Both kinds of models were built based on machine learning tools,and proved to have certain prediction performance and extrapolation.
基金supported in part by the Technical Service for the Development and Application of an Intelligent Visual Management Platformfor Expressway Construction Progress Based on BIM Technology(grant NO.JKYZLX-2023-09)in partby the Technical Service for the Development of an Early Warning Model in the Research and Application of Key Technologies for Tunnel Operation Safety Monitoring and Early Warning Based on Digital Twin(grant NO.JK-S02-ZNGS-202412-JISHU-FA-0035)sponsored by Yunnan Transportation Science Research Institute Co.,Ltd.
文摘With the rapid development of transportation infrastructure,ensuring road safety through timely and accurate highway inspection has become increasingly critical.Traditional manual inspection methods are not only time-consuming and labor-intensive,but they also struggle to provide consistent,high-precision detection and realtime monitoring of pavement surface defects.To overcome these limitations,we propose an Automatic Recognition of PavementDefect(ARPD)algorithm,which leverages unmanned aerial vehicle(UAV)-based aerial imagery to automate the inspection process.The ARPD framework incorporates a backbone network based on the Selective State Space Model(S3M),which is designed to capture long-range temporal dependencies.This enables effective modeling of dynamic correlations among redundant and often repetitive structures commonly found in road imagery.Furthermore,a neck structure based on Semantics and Detail Infusion(SDI)is introduced to guide cross-scale feature fusion.The SDI module enhances the integration of low-level spatial details with high-level semantic cues,thereby improving feature expressiveness and defect localization accuracy.Experimental evaluations demonstrate that theARPDalgorithm achieves a mean average precision(mAP)of 86.1%on a custom-labeled pavement defect dataset,outperforming the state-of-the-art YOLOv11 segmentation model.The algorithm also maintains strong generalization ability on public datasets.These results confirm that ARPD is well-suited for diverse real-world applications in intelligent,large-scale highway defect monitoring and maintenance planning.
基金supported in part by the National Natural Science Foundation of China under Grants 62473176,62073155,62002137,62106088,and 62206113National Key Laboratory of Ship Structural Safety underGrant 450324300the Postgraduate Research&Practice Innovation Programof Jiangsu Province under Grant KYCX24_2642.
文摘Community detection is a fundamental problem in network analysis for identifying densely connected node clusters,with successful applications in diverse fields like social networks,recommendation systems,biology,and cyberattack detection.Overlapping community detection refers to the case of a node belonging to multiple communities simultaneously,which is a much more meaningful and challenging task.Graph representation learning with Evolutionary Computation has been studied well in overlapping community detection to deal with complex network structures and characteristics.However,most of them focus on searching the entire solution space,which can be inefficient and lead to inadequate results.To overcome the problem,a structural feature node extraction method is first proposed that can effectively map a network into a structural embedding space.Thus,nodes within the network are classified into hierarchical levels based on their structural feature strength,and only nodes with relatively high strength are considered in subsequent search steps to reduce the search space.Then,a maximal-clique representation method is employed on the given vertex set to identify overlapping nodes.A hybrid clique-based multi-objective evolutionary algorithmwith decomposition method is designed to address cliques and the remaining unexplored nodes separately.The number of communities generated with this allocation method is closer to the actual partition count with high division quality.Experimental results on nine usually used real-world networks,five synthetic networks,and two large-scale networks demonstrate the effectiveness of the proposed methodology in terms of community quality and algorithmic efficiency,compared to traditional,MOEA-based,and graph embedding-based community detection algorithms.
基金supported by the Key R&D Program of Shaanxi Province(No.2025CYYBXM-078).
文摘Aiming at the scale adaptation of automatic driving target detection algorithms in low illumination environments and the shortcomings in target occlusion processing,this paper proposes a YOLO-LKSDS automatic driving detection model.Firstly,the Contrast-Limited Adaptive Histogram Equalisation(CLAHE)image enhancement algorithm is improved to increase the image contrast and enhance the detailed features of the target;then,on the basis of the YOLOv5 model,the Kmeans++clustering algorithm is introduced to obtain a suitable anchor frame,and SPPELAN spatial pyramid pooling is improved to enhance the accuracy and robustness of the model for multi-scale target detection.Finally,an improved SEAM(Separated and Enhancement Attention Module)attention mechanism is combined with the DIOU-NMS algorithm to optimize the model’s performance when dealing with occlusion and dense scenes.Compared with the original model,the improved YOLO-LKSDS model achieves a 13.3%improvement in accuracy,a 1.7%improvement in mAP,and 240,000 fewer parameters on the BDD100K dataset.In order to validate the generalization of the improved algorithm,we selected the KITTI dataset for experimentation,which shows that YOLOv5’s accuracy improves by 21.1%,recall by 36.6%,and mAP50 by 29.5%,respectively,on the KITTI dataset.The deployment of this paper’s algorithm is verified by an edge computing platform,where the average speed of detection reaches 24.4 FPS while power consumption remains below 9 W,demonstrating high real-time capability and energy efficiency.
基金supported in part by the National Natural Science Foundation of China (62431018)in part by the Guangzhou Municipal Science and Technology Bureau (SL2023A04J00435)in part by the One Hundred Youth Project of Guangdong University of Technology (263113873)。
文摘Selectivity remains a significant challenge for gas sensors. In contrast to conventional gas sensors that depend solely on conductivity to detect gases, we exploited a single NiO-doped SnO_(2) sensor to simultaneously monitor transient changes in both sensor conductivity and temperature. The distinct response profiles of H_(2) and NH_(3) gases were attributed to differences in their redox rates and enthalpy changes during chemical reactions, which provided an opportunity for gas identification using machine learning(ML) algorithms. The test results indicate that preprocessing the extracted calorimetric and chemi-resistive parameters using the principal component analysis(PCA), followed by the application of ML classifiers for identification,enables a 100% accuracy for both target analytes. This work presents a facile gas identification method that enhances chiplevel sensor applications while minimizing the need for complex sensor arrays.
基金funded by Ministry of Education Humanities and Social Science Research Project,grant number 23YJAZH034The Postgraduate Research and Practice Innovation Program of Jiangsu Province,grant number SJCX25_17National Computer Basic Education Research Project in Higher Education Institutions,grant number 2024-AFCEC-056,2024-AFCEC-057.
文摘To solve the false detection and missed detection problems caused by various types and sizes of defects in the detection of steel surface defects,similar defects and background features,and similarities between different defects,this paper proposes a lightweight detection model named multiscale edge and squeeze-and-excitation attention detection network(MSESE),which is built upon the You Only Look Once version 11 nano(YOLOv11n).To address the difficulty of locating defect edges,we first propose an edge enhancement module(EEM),apply it to the process of multiscale feature extraction,and then propose a multiscale edge enhancement module(MSEEM).By obtaining defect features from different scales and enhancing their edge contours,the module uses the dual-domain selection mechanism to effectively focus on the important areas in the image to ensure that the feature images have richer information and clearer contour features.By fusing the squeeze-and-excitation attention mechanism with the EEM,we obtain a lighter module that can enhance the representation of edge features,which is named the edge enhancement module with squeeze-and-excitation attention(EEMSE).This module was subsequently integrated into the detection head.The enhanced detection head achieves improved edge feature enhancement with reduced computational overhead,while effectively adjusting channel-wise importance and further refining feature representation.Experiments on the NEU-DET dataset show that,compared with the original YOLOv11n,the improved model achieves improvements of 4.1%and 2.2%in terms of mAP@0.5 and mAP@0.5:0.95,respectively,and the GFLOPs value decreases from the original value of 6.4 to 6.2.Furthermore,when compared to current mainstream models,Mamba-YOLOT and RTDETR-R34,our method achieves superior performance with 6.5%and 8.9%higher mAP@0.5,respectively,while maintaining a more compact parameter footprint.These results collectively validate the effectiveness and efficiency of our proposed approach.
基金supported by the National Natural Science Foundation of China(Grant Nos.32201654 and U22A20464)National Key Research and Development Program from the Ministry of Science and Technology of China(Grant No.2020YFA0907600)the 2115 Talent Development Program of China Agricultural University.
文摘Canopy photosynthesis,rather than leaf photosynthesis,is highly related to plant biomass and yield formation.Studying canopy photosynthesis and identifying the parameters that control it can help optimize agricultural management and achieve crop yield potential.Compared with traditional parameters,canopy occupation volume(COV)offers an integrative parameter on canopy architecture related to canopy photosynthetic rates.In this study,we developed a high-throughput method to derive COV for different rice varieties.We first used multi-perspective two-dimensional imaging to reconstruct three-dimensional point clouds of rice plants and developed a suite of pipelines to calculate plant height,leaf number,tiller number,and biomass,with R^(2) values of 91.8%,95.9%,82.3%,and 94.3%,respectively.We further employed point cloud data to reconstruct the surfaces of rice plants and construct a virtual canopy model of the rice population.Light distribution was simulated using a ray-tracing algorithm and canopy photosynthetic rates were simulated via photosynthetic rate-incident light intensity curve fitting.Furthermore,we systematically explored the relationships between canopy phenotypes and photosynthetic rates,and found that COV was the most effective predictor of canopy photosynthesis,achieving an R^(2) value of 92.1%.Adjustment in atmospheric transmittance showed that COV strongly correlated with canopy photosynthesis under different light conditions,with higher accuracy observed under diffuse light.Variations in planting density confirmed that this correlation remained strong at the community level.In summary,this study demonstrates that COV is closely linked to simulated canopy photosynthesis and the developed pipeline can support future agronomic and breeding research.
文摘Optimization algorithms are crucial for solving NP-hard problems in engineering and computational sciences.Metaheuristic algorithms,in particular,have proven highly effective in complex optimization scenarios characterized by high dimensionality and intricate variable relationships.The Mountain Gazelle Optimizer(MGO)is notably effective but struggles to balance local search refinement and global space exploration,often leading to premature convergence and entrapment in local optima.This paper presents the Improved MGO(IMGO),which integrates three synergistic enhancements:dynamic chaos mapping using piecewise chaotic sequences to boost explo-ration diversity;Opposition-Based Learning(OBL)with adaptive,diversity-driven activation to speed up convergence;and structural refinements to the position update mechanisms to enhance exploitation.The IMGO underwent a comprehensive evaluation using 52 standardised benchmark functions and seven engineering optimization problems.Benchmark evaluations showed that IMGO achieved the highest rank in best solution quality for 31 functions,the highest rank in mean performance for 18 functions,and the highest rank in worst-case performance for 14 functions among 11 competing algorithms.Statistical validation using Wilcoxon signed-rank tests confirmed that IMGO outperformed individual competitors across 16 to 50 functions,depending on the algorithm.At the same time,Friedman ranking analysis placed IMGO with an average rank of 4.15,compared to the baseline MGO’s 4.38,establishing the best overall performance.The evaluation of engineering problems revealed consistent improvements,including an optimal cost of 1.6896 for the welded beam design vs.MGO’s 1.7249,a minimum cost of 5885.33 for the pressure vessel design vs.MGO’s 6300,and a minimum weight of 2964.52 kg for the speed reducer design vs.MGO’s 2990.00 kg.Ablation studies identified OBL as the strongest individual contributor,whereas complete integration achieved superior performance through synergistic interactions among components.Computational complexity analysis established an O(T×N×5×f(P))time complexity,representing a 1.25×increase in fitness evaluation relative to the baseline MGO,validating the favorable accuracy-efficiency trade-offs for practical optimization applications.
