Developing a chiral material as versatile and universal chiral stationary phase(CSP) for chiral separation in diverse chromatographic techniques simultaneously is of great significance.In this study,we demonstrated fo...Developing a chiral material as versatile and universal chiral stationary phase(CSP) for chiral separation in diverse chromatographic techniques simultaneously is of great significance.In this study,we demonstrated for the first time that a chiral metal-organic cage(MOC),[Zn_(6)M_(4)],as a universal chiral recognition material for both multi-mode high-performance liquid chromatography(HPLC) and capillary gas chromatography(GC) enantioseparation.Two novel HPLC CSPs with different bonding arms(CSP-A with a cationic imidazolium bonding arm and CSP-B with an alkyl chain bonding arm) were prepared by clicking of functionalized chiral MOC [Zn_(6)M_(4)] onto thiolated silica via thiol-ene click chemistry.Meanwhile,a capillary GC column statically coated with the chiral MOC [Zn_(6)M_(4)] was also fabricated.The results showed that the chiral MOC exhibits excellent enantioselectivity not only in normal phase HPLC(NP-HPLC) and reversed phase(RP-HPLC) but also in GC,and various racemates were well separated,including alcohols,diols,esters,ketones,ethers,amines,and epoxides.Importantly,CSP-A and CSP-B are complementary to commercially available Chiralcel OD-H and Chiralpak AD-H columns in enantioseparation,which can separate some racemates that could not be or could not well be separated by the two widely used commercial columns,suggesting the great potential of the two prepared CSPs in enantioseparation.This work reveals that the chiral MOC is potential versatile chiral recognition materials for both HPLC and GC,and also paves the way to expand the potential applications of MOCs.展开更多
The open-source finite element software,OpenSees,is widely used in the earthquake engineering community.However,the shell elements and explicit algorithm in OpenSees still require further improvements.Therefore,in thi...The open-source finite element software,OpenSees,is widely used in the earthquake engineering community.However,the shell elements and explicit algorithm in OpenSees still require further improvements.Therefore,in this work,a triangular shell element,NLDKGT,and an explicit algorithm are proposed and implemented in OpenSees.Specifically,based on the generalized conforming theory and the updated Lagrangian formulation,the proposed NLDKGT element is suitable for problems with complicated boundary conditions and strong nonlinearity.The accuracy and reliability of the NLDKGT element are validated through typical cases.Furthermore,by adopting the leapfrog integration method,an explicit algorithm in OpenSees and a modal damping model are developed.Finally,the stability and efficiency of the proposed shell element and explicit algorithm are validated through the nonlinear time-history analysis of a highrise building.展开更多
Metasurfaces,composed of planar arrays of intricately designed meta-atom structures,possess remarkable capabilities in controlling electromagnetic waves in various ways.A critical aspect of metasurface design involves...Metasurfaces,composed of planar arrays of intricately designed meta-atom structures,possess remarkable capabilities in controlling electromagnetic waves in various ways.A critical aspect of metasurface design involves selecting suitable meta-atoms to achieve target functionalities such as phase retardation,amplitude modulation,and polarization conversion.Conventional design processes often involve extensive parameter sweeping,a laborious and computationally intensive task heavily reliant on designer expertise and judgement.Here,we present an efficient genetic algorithm assisted meta-atom optimization method for high-performance metasurface optics,which is compatible to both single-and multiobjective device design tasks.We first employ the method for a single-objective design task and implement a high-efficiency Pancharatnam-Berry phase based metalens with an average focusing efficiency exceeding 80%in the visible spectrum.We then employ the method for a dual-objective metasurface design task and construct an efficient spin-multiplexed structural beam generator.The device is capable of generating zeroth-order and first-order Bessel beams respectively under right-handed and left-handed circular polarized illumination,with associated generation efficiencies surpassing 88%.Finally,we implement a wavelength and spin co-multiplexed four-channel metahologram capable of projecting two spin-multiplexed holographic images under each operational wavelength,with efficiencies over 50%.Our work offers a streamlined and easy-to-implement approach to meta-atom design and optimization,empowering designers to create diverse high-performance and multifunctional metasurface optics.展开更多
[Objectives]To establish an HPLC method for the quantitative determination of multiple phenolic acid components in Tetracera asiatica medicinal material,providing a basis for establishing its quality standards.[Method...[Objectives]To establish an HPLC method for the quantitative determination of multiple phenolic acid components in Tetracera asiatica medicinal material,providing a basis for establishing its quality standards.[Methods]An Inertsil ODS-C 18 column(250 mm×4.6 mm,5μm)was used.The mobile phase consisted of acetonitrile-0.2% phosphoric acid solution(10:90).The flow rate was 1.0 mL/min.The detection wavelength was 274 nm.The column temperature was 25℃.The injection volume was 10μL.The content of three components,gallic acid,protocatechuic acid,and protocatechualdehyde,was determined in 13 batches of T.asiatica.[Results]Gallic acid showed good linearity within the range of 0.020-6.400μg/mL,protocatechuic acid within 0.201-6.432μg/mL,and protocatechualdehyde within 0.202-6.464μg/mL(r>0.9990).The average recovery rates ranged from 98.61%to 101.17%,with RSD s between 1.21%and 2.69%.[Conclusions]The quantitative determination method established in this study is simple and feasible,and can provide a basis for the quality evaluation of T.asiatica.展开更多
Fiber reinforcement significantly enhances the strength,toughness,and durability of concrete by reducing the propagation of microcracks in the concrete matrix.With the rising demand for high-performance concrete(HPC),...Fiber reinforcement significantly enhances the strength,toughness,and durability of concrete by reducing the propagation of microcracks in the concrete matrix.With the rising demand for high-performance concrete(HPC),this study investigates the mechanical properties of HPC with varying proportions of polypropylene(PP)and steel(ST)fibers.Supplementary cementitious materials(SCMs)toward partial replacement of ordinary Portland cement(OPC)were incorporated to prepare HPC mixes as a ternary composite system using Fly Ash(FA),Silica Fume(SF),and Ground Granulated Blast Furnace Slag(GGBS).Each HPC mix comprised two SCMs,accounting for 20%of the mass fraction of the OPC binder.The study encompassed fiber percentages ranging from 0 to 0.075%PP and 0 to 2%ST,incorporating them into the HPC mixes with gradual increases of 0.025%for PP and 0.5%for ST fiber by mass fraction.All HPC mixes were tested for mechanical properties using compressive and split tensile strength tests.The influence of SCMs on HPC was studied using X-ray diffraction(XRD)for microstructural analyses.It was found that the compressive and split tensile strengths of HPC increased up to an optimal fiber percentage and then decreased.A comparison of the test results of high-performance fiber-reinforced concrete with those of plain HPC revealed significant improvements in compressive and splitting tensile strengths by 26.59%and 57.74%,respectively.Also,the XRD analysis revealed that the composition of the SCMs in HPC was a significant and effective solution for the mechanical properties of the concrete.展开更多
Covalent organic frameworks(COFs)have demonstrated great potential in chromatographic separation because of unique structure and superior performance.Herein,single-crystal three-dimensional(3D)COFs with regular morpho...Covalent organic frameworks(COFs)have demonstrated great potential in chromatographic separation because of unique structure and superior performance.Herein,single-crystal three-dimensional(3D)COFs with regular morphology,good monodispersity and high specific surface area,were used as a stationary phase for high-performance liquid chromatography(HPLC).The single-crystal 3D COFs packed column not only exhibits high efficiency in separating hydrophobic molecules involving substituted benzenes,halogenated benzenes,halogenated nitrobenzenes,aromatic amines,aromatic hydrocarbons(PAHs)and phthalate esters(PAEs),but also achieves baseline separation of acenaphthene and acenaphthylene with similar physical and chemical properties as well as environmental pollutants,which cannot be quickly separated on commercial C18 column and a polycrystalline 3D COFs packed column.Especially,the column efficiency of 17303-24255 plates/m was obtained for PAEs,and the resolution values for acenaphthene and acenaphthylene,and carbamazepine(CBZ)and carbamazepine-10,11-epoxide(CBZEP)were 1.7and 2.2,respectively.This successful application not only confirmed the great potential of the singlecrystal 3D COFs in HPLC separation of the organic molecules,but also facilitates the application of COFs in separation science.展开更多
Compared to subtractive manufacturing and casting,3D printing(additive manufacturing)offers advantages,such as the rapid production of complex structures,reduced material waste,and environmental friendliness.Direct in...Compared to subtractive manufacturing and casting,3D printing(additive manufacturing)offers advantages,such as the rapid production of complex structures,reduced material waste,and environmental friendliness.Direct ink writing(DIW)is one of the most popular 3D printing techniques owing to its ability to print multiple materials simultaneously and its high compatibility with printing inks.However,DIW presents significant challenges,particularly in the printing of high-performance polymers.The main challenges are as follows:1.The rigid structures and reaction kinetics of high-performance polymers make developing new inks difficult.2.The limited types of available high-performance polymers underscore the need for new DIW-suitable materials.3.Layer-by-layer stacking weakens interlayer bonding,affecting the mechanical properties of the printed product.4.The accuracy and speed of DIW printing are insufficient for large-scale manufacturing.After introducing the topic,the requirements for DIW printing inks are first reviewed,emphasizing the importance of thixotropic agents.Then,research progress regarding DIW printing of high-performance polymers is comprehensively reviewed according to the requirements of different polymer inks.Additionally,the applications of these materials across various fields are summarized.Finally,the challenges in DIW printing of high-performance polymers,along with corresponding solutions and future development prospects,are discussed in detail.展开更多
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.展开更多
As electronic devices continue to evolve toward higher power densities,faster speeds,and smaller form factors,the demand for high-performance electronic packaging materials has become increasingly critical.These mater...As electronic devices continue to evolve toward higher power densities,faster speeds,and smaller form factors,the demand for high-performance electronic packaging materials has become increasingly critical.These materials serve as the physical and functional interface between semiconductor components and their operating environment,impacting the overall reliability,thermal management,mechanical protection,and electrical performance of modern electronic systems.This study investigates the development,formulation,and performance evaluation of advanced packaging materials,focusing on polymer-based composites,metal and ceramic matrix systems,and nanomaterial-enhanced formulations.A comprehensive analysis of key performance metrics-including thermal conductivity,electrical insulation,mechanical robustness,and environmental resistance-is presented,alongside strategies for material optimization through interface engineering and processing innovations.Furthermore,the study explores cutting-edge integration technologies such as 3D packaging compatibility,low-temperature co-firing,and high-density interconnects.The findings provide critical insights into the structure-property-processing relationships that define the effectiveness of next-generation packaging materials and offer a roadmap for material selection and system integration in high-reliability electronic applications.展开更多
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.展开更多
The Steiner k-eccentricity of a vertex is the maximum Steiner distance over all k-sets each of which contains the given vertex,where the Steiner distance of a vertex set is the size of a minimum Steiner tree on this s...The Steiner k-eccentricity of a vertex is the maximum Steiner distance over all k-sets each of which contains the given vertex,where the Steiner distance of a vertex set is the size of a minimum Steiner tree on this set.Since the minimum Steiner tree problem is well-known NP-hard,the Steiner k-eccentricity is not so easy to compute.This paper attempts to efficiently solve this problem on block graphs and general graphs with limited cycles.A block graph is a graph in which each block is a clique,and is also called a clique-tree.On block graphs,we propose an O(k(n+m))-time algorithm to compute the Steiner k-eccentricity of a vertex where n and m are respectively the order and size of a block graph.On general graphs with limited cycles,we take the cyclomatic numberν(G)as a parameter which is the minimum number of edges of G whose removal makes G acyclic,and devise an O(n^(ν(G)+1)(n(G)+m(G)+k))-time algorithm.展开更多
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.展开更多
Data serves as the foundation for training and testing machine learning and artificial intelligencemodels.The most fundamental part of data is its attributes or features.The feature set size changes from one dataset t...Data serves as the foundation for training and testing machine learning and artificial intelligencemodels.The most fundamental part of data is its attributes or features.The feature set size changes from one dataset to another.Only the relevant features contributemeaningfully to classificationaccuracy.The presence of irrelevant features reduces the system’s effectiveness.Classification performance often deteriorates on high-dimensional datasets due to the large search space.Thus,one of the significant obstacles affecting the performance of the learning process in the majority of machine learning and data mining techniques is the dimensionality of the datasets.Feature selection(FS)is an effective preprocessing step in classification tasks.The aim of applying FS is to exclude redundant and unrelated features while retaining the most informative ones to optimize classification capability and compress computational complexity.In this paper,a novel hybrid binary metaheuristic algorithm,termed hSC-FPA,is proposed by hybridizing the Flower Pollination Algorithm(FPA)and the Sine Cosine Algorithm(SCA).Hybridization controls the exploration capacity of SCA and the exploitation behavior of FPA to maintain a balanced search process.SCA guides the global search in the early iterations,while FPA’s local pollination refines promising solutions in later stages.A binary conversion mechanism using a threshold function is implemented to handle the discrete nature of the feature selection problem.The functionality of the proposed hSC-FPA is authenticated on fourteen standard datasets from the UCI repository using the K-Nearest Neighbors(K-NN)classifier.Experimental results are benchmarked against the standalone SCA and FPA algorithms.The hSC-FPA consistently achieves higher classification accuracy,selects a more compact feature subset,and demonstrates superior convergence behavior.These findings support the stability and outperformance of the hybrid feature selection method presented.展开更多
Traditional sampling-based path planning algorithms,such as the rapidly-exploring random tree star(RRT^(*)),encounter critical limitations in unstructured orchard environments,including low sampling efficiency in narr...Traditional sampling-based path planning algorithms,such as the rapidly-exploring random tree star(RRT^(*)),encounter critical limitations in unstructured orchard environments,including low sampling efficiency in narrow passages,slow convergence,and high computational costs.To address these challenges,this paper proposes a novel hybrid global path planning algorithm integrating Gaussian sampling and quadtree optimization(RRT^(*)-GSQ).This methodology aims to enhance path planning by synergistically combining a Gaussian mixture sampling strategy to improve node generation in critical regions,an adaptive step-size and direction optimization mechanism for enhanced obstacle avoidance,a Quadtree-AABB collision detection framework to lower computational complexity,and a dynamic iteration control strategy for more efficient convergence.In obstacle-free and obstructed scenarios,compared with the conventional RRT^(*),the proposed algorithm reduced the number of node evaluations by 67.57%and 62.72%,and decreased the search time by 79.72%and 78.52%,respectively.In path tracking tests,the proposed algorithm achieved substantial reductions in RMSE of the final path compared to the conventional RRT^(*).Specifically,the lateral RMSE was reduced by 41.5%in obstacle-free environments and 59.3%in obstructed environments,while the longitudinal RMSE was reduced by 57.2%and 58.5%,respectively.Furthermore,the maximum absolute errors in both lateral and longitudinal directions were constrained within 0.75 m.Field validation experiments in an operational orchard confirmed the algorithm's practical effectiveness,showing reductions in the mean tracking error of 47.6%(obstacle-free)and 58.3%(with obstructed),alongside a 5.1%and 7.2%shortening of the path length compared to the baseline method.The proposed algorithm effectively enhances path planning efficiency and navigation accuracy for robots,presenting a superior solution for high-precision autonomous navigation of agricultural robots in orchard environments and holding significant value for engineering applications.展开更多
We study the split common solution problem with multiple output sets for monotone operator equations in Hilbert spaces.To solve this problem,we propose two new parallel algorithms.We establish a weak convergence theor...We study the split common solution problem with multiple output sets for monotone operator equations in Hilbert spaces.To solve this problem,we propose two new parallel algorithms.We establish a weak convergence theorem for the first and a strong convergence theorem for the second.展开更多
Metaheuristic optimization algorithms continue to be essential for solving complex real-world problems,yet existingmethods often struggle with balancing exploration and exploitation across diverse problem landscapes.T...Metaheuristic optimization algorithms continue to be essential for solving complex real-world problems,yet existingmethods often struggle with balancing exploration and exploitation across diverse problem landscapes.This paper proposes a novel nature-inspired metaheuristic optimization algorithm named the Painted Wolf Optimization(PWO)algorithm.The main inspiration for the PWO algorithm is the group behavior and hunting strategy of painted wolves,also known as African wild dogs in the wild,particularly their unique consensus-based voting rally mechanism,a behavior fundamentally distinct fromthe social dynamics of grey wolves.In this innovative process,pack members explore different areas to find prey;then,they hold a pre-hunting voting rally based on the alpha member to determine who will begin the hunt and attack the prey.The efficiency of the proposed PWO algorithm is evaluated by a comparison study with other well-known optimization algorithms on 33 test functions,including the Congress on Evolutionary Computation(CEC)2017 suite and different real-world engineering design cases.Furthermore,the algorithm’s performance is further tested across a spectrum of optimization problems with extensive unknown search spaces.This includes its application within the field of cybersecurity,specifically in the context of training a machine learning-based intrusion detection system(ML-IDS),achieving an accuracy of 0.90 and an F-measure of 0.9290.Statistical analyses using the Wilcoxon signed-rank test(all p<0.05)indicate that the PWO algorithm outperforms existing state-of-the-art algorithms,providing superior solutions in diverse and unpredictable optimization landscapes.This demonstrates its potential as a robust method for tackling complex optimization problems in various fields.The source code for thePWOalgorithmis publicly available at https://github.com/saeidsheikhi/Painted-Wolf-Optimization.展开更多
To enhance the accuracy of path planning of unmanned surface vehicles(USVs),the particle swarm optimization algorithm(PSO)is improved based on species migration strategies observed in ecology.By incorporating the conc...To enhance the accuracy of path planning of unmanned surface vehicles(USVs),the particle swarm optimization algorithm(PSO)is improved based on species migration strategies observed in ecology.By incorporating the concept of particle sight distance,an improved algorithm,called SD-IPSO,is proposed for the real-time autonomous navigation of USVs in marine environments.The algorithm refines the individual behavior pattern of particles in the population,effectively improving both local and global search capabilities while avoiding premature convergence.The effectiveness of the algorithm is validated using standard test functions from CEC-2017 function library,assessing it from multiple dimensions.Sensitivity analysis is conducted on key parameters in the algorithm,including particle sight distance and population size.Results indicate that compared with PSO,SD-IPSO demonstrates significant advantages in optimization accuracy and convergence speed.The application of SD-IPSO in path planning is further investigated through a 14-point traveling salesman problem(TSP)example and navigation autonomous tests of USVs in marine environments.Findings demonstrate that the proposed algorithm exhibits superior optimization capabilities and can effectively address the path planning challenges of USVs.展开更多
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.展开更多
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.展开更多
基金supported by the National Natural Science Foundation of China (Nos.22064020,22364022,and 22174125)the Applied Basic Research Foundation of Yunnan Province (Nos.202101AT070101 and 202201AT070029)。
文摘Developing a chiral material as versatile and universal chiral stationary phase(CSP) for chiral separation in diverse chromatographic techniques simultaneously is of great significance.In this study,we demonstrated for the first time that a chiral metal-organic cage(MOC),[Zn_(6)M_(4)],as a universal chiral recognition material for both multi-mode high-performance liquid chromatography(HPLC) and capillary gas chromatography(GC) enantioseparation.Two novel HPLC CSPs with different bonding arms(CSP-A with a cationic imidazolium bonding arm and CSP-B with an alkyl chain bonding arm) were prepared by clicking of functionalized chiral MOC [Zn_(6)M_(4)] onto thiolated silica via thiol-ene click chemistry.Meanwhile,a capillary GC column statically coated with the chiral MOC [Zn_(6)M_(4)] was also fabricated.The results showed that the chiral MOC exhibits excellent enantioselectivity not only in normal phase HPLC(NP-HPLC) and reversed phase(RP-HPLC) but also in GC,and various racemates were well separated,including alcohols,diols,esters,ketones,ethers,amines,and epoxides.Importantly,CSP-A and CSP-B are complementary to commercially available Chiralcel OD-H and Chiralpak AD-H columns in enantioseparation,which can separate some racemates that could not be or could not well be separated by the two widely used commercial columns,suggesting the great potential of the two prepared CSPs in enantioseparation.This work reveals that the chiral MOC is potential versatile chiral recognition materials for both HPLC and GC,and also paves the way to expand the potential applications of MOCs.
基金The authors would like to acknowledge the financial supports of Beijing Natural Science Foundation(No.8182025).
文摘The open-source finite element software,OpenSees,is widely used in the earthquake engineering community.However,the shell elements and explicit algorithm in OpenSees still require further improvements.Therefore,in this work,a triangular shell element,NLDKGT,and an explicit algorithm are proposed and implemented in OpenSees.Specifically,based on the generalized conforming theory and the updated Lagrangian formulation,the proposed NLDKGT element is suitable for problems with complicated boundary conditions and strong nonlinearity.The accuracy and reliability of the NLDKGT element are validated through typical cases.Furthermore,by adopting the leapfrog integration method,an explicit algorithm in OpenSees and a modal damping model are developed.Finally,the stability and efficiency of the proposed shell element and explicit algorithm are validated through the nonlinear time-history analysis of a highrise building.
基金support from the National Science Foundation of China(Grant Nos.62075078 and 62135004)the Knowledge Innovation Program of Wuhan-Shuguang Project(Grant No.2022010801020095).
文摘Metasurfaces,composed of planar arrays of intricately designed meta-atom structures,possess remarkable capabilities in controlling electromagnetic waves in various ways.A critical aspect of metasurface design involves selecting suitable meta-atoms to achieve target functionalities such as phase retardation,amplitude modulation,and polarization conversion.Conventional design processes often involve extensive parameter sweeping,a laborious and computationally intensive task heavily reliant on designer expertise and judgement.Here,we present an efficient genetic algorithm assisted meta-atom optimization method for high-performance metasurface optics,which is compatible to both single-and multiobjective device design tasks.We first employ the method for a single-objective design task and implement a high-efficiency Pancharatnam-Berry phase based metalens with an average focusing efficiency exceeding 80%in the visible spectrum.We then employ the method for a dual-objective metasurface design task and construct an efficient spin-multiplexed structural beam generator.The device is capable of generating zeroth-order and first-order Bessel beams respectively under right-handed and left-handed circular polarized illumination,with associated generation efficiencies surpassing 88%.Finally,we implement a wavelength and spin co-multiplexed four-channel metahologram capable of projecting two spin-multiplexed holographic images under each operational wavelength,with efficiencies over 50%.Our work offers a streamlined and easy-to-implement approach to meta-atom design and optimization,empowering designers to create diverse high-performance and multifunctional metasurface optics.
基金Supported by Regional Science Foundation of China,National Natural Science Foundation(No.82160820)General Program of Guizhou Provincial Natural Science Foundation[QianKeHe Foundation-ZK(2023)General153].
文摘[Objectives]To establish an HPLC method for the quantitative determination of multiple phenolic acid components in Tetracera asiatica medicinal material,providing a basis for establishing its quality standards.[Methods]An Inertsil ODS-C 18 column(250 mm×4.6 mm,5μm)was used.The mobile phase consisted of acetonitrile-0.2% phosphoric acid solution(10:90).The flow rate was 1.0 mL/min.The detection wavelength was 274 nm.The column temperature was 25℃.The injection volume was 10μL.The content of three components,gallic acid,protocatechuic acid,and protocatechualdehyde,was determined in 13 batches of T.asiatica.[Results]Gallic acid showed good linearity within the range of 0.020-6.400μg/mL,protocatechuic acid within 0.201-6.432μg/mL,and protocatechualdehyde within 0.202-6.464μg/mL(r>0.9990).The average recovery rates ranged from 98.61%to 101.17%,with RSD s between 1.21%and 2.69%.[Conclusions]The quantitative determination method established in this study is simple and feasible,and can provide a basis for the quality evaluation of T.asiatica.
基金financed by the Science and Engineering Research Board,India,in Project No.EEQ/2023/000130CSIR-India in Project No.MLP072002.
文摘Fiber reinforcement significantly enhances the strength,toughness,and durability of concrete by reducing the propagation of microcracks in the concrete matrix.With the rising demand for high-performance concrete(HPC),this study investigates the mechanical properties of HPC with varying proportions of polypropylene(PP)and steel(ST)fibers.Supplementary cementitious materials(SCMs)toward partial replacement of ordinary Portland cement(OPC)were incorporated to prepare HPC mixes as a ternary composite system using Fly Ash(FA),Silica Fume(SF),and Ground Granulated Blast Furnace Slag(GGBS).Each HPC mix comprised two SCMs,accounting for 20%of the mass fraction of the OPC binder.The study encompassed fiber percentages ranging from 0 to 0.075%PP and 0 to 2%ST,incorporating them into the HPC mixes with gradual increases of 0.025%for PP and 0.5%for ST fiber by mass fraction.All HPC mixes were tested for mechanical properties using compressive and split tensile strength tests.The influence of SCMs on HPC was studied using X-ray diffraction(XRD)for microstructural analyses.It was found that the compressive and split tensile strengths of HPC increased up to an optimal fiber percentage and then decreased.A comparison of the test results of high-performance fiber-reinforced concrete with those of plain HPC revealed significant improvements in compressive and splitting tensile strengths by 26.59%and 57.74%,respectively.Also,the XRD analysis revealed that the composition of the SCMs in HPC was a significant and effective solution for the mechanical properties of the concrete.
基金the National Natural Science Foundation of China(No.22274021)Natural Science Foundation of Fujian Province(No.2022J01535)for financial support。
文摘Covalent organic frameworks(COFs)have demonstrated great potential in chromatographic separation because of unique structure and superior performance.Herein,single-crystal three-dimensional(3D)COFs with regular morphology,good monodispersity and high specific surface area,were used as a stationary phase for high-performance liquid chromatography(HPLC).The single-crystal 3D COFs packed column not only exhibits high efficiency in separating hydrophobic molecules involving substituted benzenes,halogenated benzenes,halogenated nitrobenzenes,aromatic amines,aromatic hydrocarbons(PAHs)and phthalate esters(PAEs),but also achieves baseline separation of acenaphthene and acenaphthylene with similar physical and chemical properties as well as environmental pollutants,which cannot be quickly separated on commercial C18 column and a polycrystalline 3D COFs packed column.Especially,the column efficiency of 17303-24255 plates/m was obtained for PAEs,and the resolution values for acenaphthene and acenaphthylene,and carbamazepine(CBZ)and carbamazepine-10,11-epoxide(CBZEP)were 1.7and 2.2,respectively.This successful application not only confirmed the great potential of the singlecrystal 3D COFs in HPLC separation of the organic molecules,but also facilitates the application of COFs in separation science.
基金supported by National Key Research and Development Program of China(Grant No.2022YFB3809000)Major Science and Technology Project of Gansu Province(Grant No.23ZDGA011)+1 种基金National Natural Science Foundation of China(Grant No.22275199,52105224)the Strategic Priority Research Program of the Chinese Academy of Sciences(Grant No.XDB04701022021).
文摘Compared to subtractive manufacturing and casting,3D printing(additive manufacturing)offers advantages,such as the rapid production of complex structures,reduced material waste,and environmental friendliness.Direct ink writing(DIW)is one of the most popular 3D printing techniques owing to its ability to print multiple materials simultaneously and its high compatibility with printing inks.However,DIW presents significant challenges,particularly in the printing of high-performance polymers.The main challenges are as follows:1.The rigid structures and reaction kinetics of high-performance polymers make developing new inks difficult.2.The limited types of available high-performance polymers underscore the need for new DIW-suitable materials.3.Layer-by-layer stacking weakens interlayer bonding,affecting the mechanical properties of the printed product.4.The accuracy and speed of DIW printing are insufficient for large-scale manufacturing.After introducing the topic,the requirements for DIW printing inks are first reviewed,emphasizing the importance of thixotropic agents.Then,research progress regarding DIW printing of high-performance polymers is comprehensively reviewed according to the requirements of different polymer inks.Additionally,the applications of these materials across various fields are summarized.Finally,the challenges in DIW printing of high-performance polymers,along with corresponding solutions and future development prospects,are discussed in detail.
基金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.
文摘As electronic devices continue to evolve toward higher power densities,faster speeds,and smaller form factors,the demand for high-performance electronic packaging materials has become increasingly critical.These materials serve as the physical and functional interface between semiconductor components and their operating environment,impacting the overall reliability,thermal management,mechanical protection,and electrical performance of modern electronic systems.This study investigates the development,formulation,and performance evaluation of advanced packaging materials,focusing on polymer-based composites,metal and ceramic matrix systems,and nanomaterial-enhanced formulations.A comprehensive analysis of key performance metrics-including thermal conductivity,electrical insulation,mechanical robustness,and environmental resistance-is presented,alongside strategies for material optimization through interface engineering and processing innovations.Furthermore,the study explores cutting-edge integration technologies such as 3D packaging compatibility,low-temperature co-firing,and high-density interconnects.The findings provide critical insights into the structure-property-processing relationships that define the effectiveness of next-generation packaging materials and offer a roadmap for material selection and system integration in high-reliability electronic applications.
文摘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.
基金Supported by Guizhou Provincial Basic Research Program (Natural Science)(No.ZK[2022]020)。
文摘The Steiner k-eccentricity of a vertex is the maximum Steiner distance over all k-sets each of which contains the given vertex,where the Steiner distance of a vertex set is the size of a minimum Steiner tree on this set.Since the minimum Steiner tree problem is well-known NP-hard,the Steiner k-eccentricity is not so easy to compute.This paper attempts to efficiently solve this problem on block graphs and general graphs with limited cycles.A block graph is a graph in which each block is a clique,and is also called a clique-tree.On block graphs,we propose an O(k(n+m))-time algorithm to compute the Steiner k-eccentricity of a vertex where n and m are respectively the order and size of a block graph.On general graphs with limited cycles,we take the cyclomatic numberν(G)as a parameter which is the minimum number of edges of G whose removal makes G acyclic,and devise an O(n^(ν(G)+1)(n(G)+m(G)+k))-time algorithm.
文摘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.
基金supported by a research grant from Lahore College for Women University(LCWU),Lahore,Pakistan.
文摘Data serves as the foundation for training and testing machine learning and artificial intelligencemodels.The most fundamental part of data is its attributes or features.The feature set size changes from one dataset to another.Only the relevant features contributemeaningfully to classificationaccuracy.The presence of irrelevant features reduces the system’s effectiveness.Classification performance often deteriorates on high-dimensional datasets due to the large search space.Thus,one of the significant obstacles affecting the performance of the learning process in the majority of machine learning and data mining techniques is the dimensionality of the datasets.Feature selection(FS)is an effective preprocessing step in classification tasks.The aim of applying FS is to exclude redundant and unrelated features while retaining the most informative ones to optimize classification capability and compress computational complexity.In this paper,a novel hybrid binary metaheuristic algorithm,termed hSC-FPA,is proposed by hybridizing the Flower Pollination Algorithm(FPA)and the Sine Cosine Algorithm(SCA).Hybridization controls the exploration capacity of SCA and the exploitation behavior of FPA to maintain a balanced search process.SCA guides the global search in the early iterations,while FPA’s local pollination refines promising solutions in later stages.A binary conversion mechanism using a threshold function is implemented to handle the discrete nature of the feature selection problem.The functionality of the proposed hSC-FPA is authenticated on fourteen standard datasets from the UCI repository using the K-Nearest Neighbors(K-NN)classifier.Experimental results are benchmarked against the standalone SCA and FPA algorithms.The hSC-FPA consistently achieves higher classification accuracy,selects a more compact feature subset,and demonstrates superior convergence behavior.These findings support the stability and outperformance of the hybrid feature selection method presented.
基金National Natural Science Foundation of China(32301712)Natural Science Foundation of Jiangsu Province(BK20230548,BK20250876)+2 种基金Project of Faculty of Agricultural Equipment of Jiangsu University(NGXB20240203)A Project Funded by the Priority Academic Program Development of Jiangsu Higher Education Institutions(PAPD-2023-87)Open Funding Project of the Key Laboratory of Modern Agricultural Equipment and Technology(Jiangsu University),Ministry of Education(MAET202101)。
文摘Traditional sampling-based path planning algorithms,such as the rapidly-exploring random tree star(RRT^(*)),encounter critical limitations in unstructured orchard environments,including low sampling efficiency in narrow passages,slow convergence,and high computational costs.To address these challenges,this paper proposes a novel hybrid global path planning algorithm integrating Gaussian sampling and quadtree optimization(RRT^(*)-GSQ).This methodology aims to enhance path planning by synergistically combining a Gaussian mixture sampling strategy to improve node generation in critical regions,an adaptive step-size and direction optimization mechanism for enhanced obstacle avoidance,a Quadtree-AABB collision detection framework to lower computational complexity,and a dynamic iteration control strategy for more efficient convergence.In obstacle-free and obstructed scenarios,compared with the conventional RRT^(*),the proposed algorithm reduced the number of node evaluations by 67.57%and 62.72%,and decreased the search time by 79.72%and 78.52%,respectively.In path tracking tests,the proposed algorithm achieved substantial reductions in RMSE of the final path compared to the conventional RRT^(*).Specifically,the lateral RMSE was reduced by 41.5%in obstacle-free environments and 59.3%in obstructed environments,while the longitudinal RMSE was reduced by 57.2%and 58.5%,respectively.Furthermore,the maximum absolute errors in both lateral and longitudinal directions were constrained within 0.75 m.Field validation experiments in an operational orchard confirmed the algorithm's practical effectiveness,showing reductions in the mean tracking error of 47.6%(obstacle-free)and 58.3%(with obstructed),alongside a 5.1%and 7.2%shortening of the path length compared to the baseline method.The proposed algorithm effectively enhances path planning efficiency and navigation accuracy for robots,presenting a superior solution for high-precision autonomous navigation of agricultural robots in orchard environments and holding significant value for engineering applications.
基金supported by the Science and Technology Fund of TNU-Thai Nguyen University of Science.
文摘We study the split common solution problem with multiple output sets for monotone operator equations in Hilbert spaces.To solve this problem,we propose two new parallel algorithms.We establish a weak convergence theorem for the first and a strong convergence theorem for the second.
文摘Metaheuristic optimization algorithms continue to be essential for solving complex real-world problems,yet existingmethods often struggle with balancing exploration and exploitation across diverse problem landscapes.This paper proposes a novel nature-inspired metaheuristic optimization algorithm named the Painted Wolf Optimization(PWO)algorithm.The main inspiration for the PWO algorithm is the group behavior and hunting strategy of painted wolves,also known as African wild dogs in the wild,particularly their unique consensus-based voting rally mechanism,a behavior fundamentally distinct fromthe social dynamics of grey wolves.In this innovative process,pack members explore different areas to find prey;then,they hold a pre-hunting voting rally based on the alpha member to determine who will begin the hunt and attack the prey.The efficiency of the proposed PWO algorithm is evaluated by a comparison study with other well-known optimization algorithms on 33 test functions,including the Congress on Evolutionary Computation(CEC)2017 suite and different real-world engineering design cases.Furthermore,the algorithm’s performance is further tested across a spectrum of optimization problems with extensive unknown search spaces.This includes its application within the field of cybersecurity,specifically in the context of training a machine learning-based intrusion detection system(ML-IDS),achieving an accuracy of 0.90 and an F-measure of 0.9290.Statistical analyses using the Wilcoxon signed-rank test(all p<0.05)indicate that the PWO algorithm outperforms existing state-of-the-art algorithms,providing superior solutions in diverse and unpredictable optimization landscapes.This demonstrates its potential as a robust method for tackling complex optimization problems in various fields.The source code for thePWOalgorithmis publicly available at https://github.com/saeidsheikhi/Painted-Wolf-Optimization.
文摘To enhance the accuracy of path planning of unmanned surface vehicles(USVs),the particle swarm optimization algorithm(PSO)is improved based on species migration strategies observed in ecology.By incorporating the concept of particle sight distance,an improved algorithm,called SD-IPSO,is proposed for the real-time autonomous navigation of USVs in marine environments.The algorithm refines the individual behavior pattern of particles in the population,effectively improving both local and global search capabilities while avoiding premature convergence.The effectiveness of the algorithm is validated using standard test functions from CEC-2017 function library,assessing it from multiple dimensions.Sensitivity analysis is conducted on key parameters in the algorithm,including particle sight distance and population size.Results indicate that compared with PSO,SD-IPSO demonstrates significant advantages in optimization accuracy and convergence speed.The application of SD-IPSO in path planning is further investigated through a 14-point traveling salesman problem(TSP)example and navigation autonomous tests of USVs in marine environments.Findings demonstrate that the proposed algorithm exhibits superior optimization capabilities and can effectively address the path planning challenges of USVs.
基金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.
基金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.
