Aiming at the flexible flowshop group scheduling problem,taking sequence dependent setup time and machine skipping into account, a mathematical model for minimizing makespan is established,and a hybrid differential ev...Aiming at the flexible flowshop group scheduling problem,taking sequence dependent setup time and machine skipping into account, a mathematical model for minimizing makespan is established,and a hybrid differential evolution( HDE) algorithm based on greedy constructive procedure( GCP) is proposed,which combines differential evolution( DE) with tabu search( TS). DE is applied to generating the elite individuals of population,while TS is used for finding the optimal value by making perturbation in selected elite individuals. A lower bounding technique is developed to evaluate the quality of proposed algorithm. Experimental results verify the effectiveness and feasibility of proposed algorithm.展开更多
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.展开更多
The generalized travelling salesman problem(GTSP),a generalization of the well-known travelling salesman problem(TSP),is considered for our study.Since the GTSP is NP-hard and very complex,finding exact solutions is h...The generalized travelling salesman problem(GTSP),a generalization of the well-known travelling salesman problem(TSP),is considered for our study.Since the GTSP is NP-hard and very complex,finding exact solutions is highly expensive,we will develop genetic algorithms(GAs)to obtain heuristic solutions to the problem.In GAs,as the crossover is a very important process,the crossovermethods proposed for the traditional TSP could be adapted for the GTSP.The sequential constructive crossover(SCX)and three other operators are adapted to use in GAs to solve the GTSP.The effectiveness of GA using SCX is verified on some GTSP Library(GTSPLIB)instances first and then compared against GAs using the other crossover methods.The computational results show the success of the GA using SCX for this problem.Our proposed GA using SCX,and swap mutation could find average solutions whose average percentage of excesses fromthe best-known solutions is between 0.00 and 14.07 for our investigated instances.展开更多
Objective:To identify potential key genes associated with pre-eclampsia through bioinformatics analysis,construct predictive models using machine-learning algorithms,and evaluate the models'performance in predicti...Objective:To identify potential key genes associated with pre-eclampsia through bioinformatics analysis,construct predictive models using machine-learning algorithms,and evaluate the models'performance in predicting pre-eclampsia.Methods:Gene-expression microarray datasets GSE10588,GSE66273,and GSE30186 related to pre-eclampsia were downloaded from the gene expression omnibus(GEO).Data were normalized using R,and differentially expressed genes(DEGs)were identified.LASSO regression was applied to further filter DEGs.Based on the selected DEGs,six machine-learning models-logistic regression(LR),random forest(RF),support vector machine(SVM),K-nearest neighbors(KNN),neural network(NN),and eXtreme gradient boosting(XGBoost)were built in R,and their performance was validated.Results:From the three datasets,a total of 1,363 genes were extracted.LASSO regression narrowed these to 265 candidate key genes.Multivariate analysis ultimately identified four genes closely associated with pre-eclampsia:EVI5,GCLM,LEP,and SYNPO2L.Using these four key genes,six machine-learning models were constructed.Receiver operating characteristic(ROC)analysis showed that all models achieved AUC>0.9:LR(AUC=0.983,95%CI=0.942-0.998),RF(AUC=0.961,95%CI=0.912-0.987),SVM(AUC=0.936,95%CI=0.879-0.972),KNN(AUC=0.970,95%CI=0.924-0.992),NN(AUC=0.916,95%CI=0.854-0.958),and XGBoost(AUC=0.952,95%CI=0.900-0.982).There was no statistically significant difference among the AUCs of the models(P>0.05).Conclusion:This study identified four key genes linked to preeclampsia through integrated bioinformatics analysis.Predictive models built on these genes can accurately forecast the occurrence of pre-eclampsia,suggesting that the four genes may serve as potential biomarkers for early diagnosis and therapeutic targeting of pre-eclampsia.展开更多
Aiming at the problems faced by construction site video management in the recognition of cigarette butts,reflective vests,and other objects,such as small target confusion,high-brightness false alarms,occlusion missed ...Aiming at the problems faced by construction site video management in the recognition of cigarette butts,reflective vests,and other objects,such as small target confusion,high-brightness false alarms,occlusion missed detections,and poor adaptability to complex environments,this study proposes a recognition accuracy optimization algorithm based on multimodal fusion.The research constructs a dataset containing three modalities of data:visible light,infrared,and millimeter-wave.The Dust-GAN algorithm is adopted to realize dust removal and enhancement of dusty images,and the SAA module is introduced into YOLOv8-s to improve the small target recall rate.Meanwhile,three-modal feature fusion is achieved,and channel pruning and quantization-aware training are used to realize algorithm lightweighting.The algorithm was deployed and operated on-site for 3 months,effectively reducing the construction site safety accident rate by 65%,which provides a solution for safety management and control in smart construction sites under complex environments.展开更多
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.展开更多
Electrical capacitance tomography technique reconstructs dielectric constant distribution in an object by measuring the capacitances between the eletrode pairs which are mounted around this object. Because of the limi...Electrical capacitance tomography technique reconstructs dielectric constant distribution in an object by measuring the capacitances between the eletrode pairs which are mounted around this object. Because of the limitation of measurement condition, the measured data are imcomplet. This paper describes a multiresolution reconstructive algorithm which is based on network theory for electrical capacitance tomography technique. The dielectric constant distribution of flow of two components in a pipeline is reconstructed. The algorithm is as follows: Firstly, construct a rough, first level system model, and assume the dielectric constant distribution of the region to be reconstructed. After iteration, the dielectic constant of each unit can be reconstructed. Secondly, construct a finer, second level the system model and determine the initial dielectric constant of each unit in the region to be reconstructed according to related information between two levels. After iteration, the image of the pipeline's cross section can be reconstructed. The results of simulated experiments about different kinds of medium distributions show that this algorithm is effective and can converge.展开更多
This part II-C of our work completes the factorizational theory of asymptotic expansions in the real domain. Here we present two algorithms for constructing canonical factorizations of a disconjugate operator starting...This part II-C of our work completes the factorizational theory of asymptotic expansions in the real domain. Here we present two algorithms for constructing canonical factorizations of a disconjugate operator starting from a basis of its kernel which forms a Chebyshev asymptotic scale at an endpoint. These algorithms arise quite naturally in our asymptotic context and prove very simple in special cases and/or for scales with a small numbers of terms. All the results in the three Parts of this work are well illustrated by a class of asymptotic scales featuring interesting properties. Examples and counterexamples complete the exposition.展开更多
This paper presents a novel method for reconstructing a highly accurate 3D nose model of the human from 2D images and pre-marked landmarks based on algorithmic methods.The study focuses on the reconstruction of a 3D n...This paper presents a novel method for reconstructing a highly accurate 3D nose model of the human from 2D images and pre-marked landmarks based on algorithmic methods.The study focuses on the reconstruction of a 3D nose model tailored for applications in healthcare and cosmetic surgery.The approach leverages advanced image processing techniques,3D Morphable Models(3DMM),and deformation techniques to overcome the limita-tions of deep learning models,particularly addressing the interpretability issues commonly encountered in medical applications.The proposed method estimates the 3D coordinates of landmark points using a 3D structure estimation algorithm.Sub-landmarks are extracted through image processing techniques and interpolation.The initial surface is generated using a 3DMM,though its accuracy remains limited.To enhance precision,deformation techniques are applied,utilizing the coordinates of 76 identified landmarks and sub-landmarks.The resulting 3D nose model is constructed based on algorithmic methods and pre-marked landmarks.Evaluation of the 3D model is conducted by comparing landmark distances and shape similarity with expert-determined ground truth on 30 Vietnamese volunteers aged 18 to 47,all of whom were either preparing for or required nasal surgery.Experimental results demonstrate a strong agreement between the reconstructed 3D model and the ground truth.The method achieved a mean landmark distance error of 0.631 mm and a shape error of 1.738 mm,demonstrating its potential for medical applications.展开更多
BACKGROUND Eyelid reconstruction is an intricate process,addressing both aesthetic and functional aspects post-trauma or oncological surgery.Aesthetic concerns and oncological radicality guide personalized approaches....BACKGROUND Eyelid reconstruction is an intricate process,addressing both aesthetic and functional aspects post-trauma or oncological surgery.Aesthetic concerns and oncological radicality guide personalized approaches.The complex anatomy,involving anterior and posterior lamellae,requires tailored reconstruction for optimal functionality.AIM To formulate an eyelid reconstruction algorithm through an extensive literature review and to validate it by juxtaposing surgical outcomes from Cattinara Hos-in dry eye and tears,which may lead to long-term consequences such as chronic conjunctivitis,discomfort,or photo-phobia.To prevent this issue,scars should be oriented vertically or perpendicularly to the free eyelid margin when the size of the tumor allows.In employing a malar flap to repair a lower eyelid defect,the malar incision must ascend diagonally;this facilitates enhanced flap advancement and mitigates ectropion by restricting vertical traction.Conse-quently,it is imperative to maintain that the generated tension remains consistently horizontal and never vertical[9].Lagophthalmos is a disorder characterized by the inability to completely close the eyelids,leading to corneal exposure and an increased risk of keratitis or ulceration;it may arise following upper eyelid surgery.To avert this issue,it is essential to preserve a minimum of 1 cm of skin between the superior edge of the excision and the inferior boundary of the eyebrow.Epiphora may occur in cancers involving the lacrimal puncta,requiring their removal.As previously stated,when employing a glabellar flap to rectify medial canthal abnormalities,it is essential to prevent a trapdoor effect or thickening of the flap relative to the eyelid skin to which it is affixed.Constraints about our proposed algorithm enco-mpass limited sample sizes and possible publication biases in existing studies.Subsequent investigations ought to examine long-term results to further refine the algorithm.Future research should evaluate the algorithm across varied populations and examine the impact of novel graft materials on enhancing reconstructive outcomes.CONCLUSION Eyelid reconstruction remains one of the most intriguing challenges for a plastic surgeon today.The most fascinating aspect of this discipline is the need to restore the functionality of such an essential structure while maintaining its aesthetics.In our opinion,creating decision-making algorithms can facilitate reaching this goal by allowing for the individualization of the reconstructive path while minimizing the incidence of complications.The fact that we have decreased the incidence of severe complications is a sign that the work is moving in the right direction.The fact that there has been no need for reintervention,neither for reconstructive issues nor for inadequate oncological radicality,overall signifies greater patient satisfaction as they do not have to undergo the stress of new surgeries.Even the minor complic-ations recorded are in line with those reported in the literature,and,even more importantly for patients,they are of limited duration.In our experience,after a year of application,we can say that the objective has been achieved,but much more can still be done.Behind every work,a scientific basis must be continually renewed and refreshed to maintain high-quality standards.Therefore,searching for possible alternative solutions to be included in one’s surgical armamentarium is fundamental to providing the patient with a fully personalized option.展开更多
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.展开更多
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.展开更多
This study investigates how artificial intelligence(AI)algorithms enable mainstream media to achieve precise emotional matching and improve communication efficiency through reconstructed communication logic.As digital...This study investigates how artificial intelligence(AI)algorithms enable mainstream media to achieve precise emotional matching and improve communication efficiency through reconstructed communication logic.As digital intelligence technology rapidly evolves,mainstream media organizations are increasingly leveraging AI-driven empathy algorithms to enhance audience engagement and optimize content delivery.This research employs a mixed-methods approach,combining quantitative analysis of algorithmic performance metrics with qualitative examination of media communication patterns.Through systematic review of 150 academic papers and analysis of data from 12 major media platforms,this study reveals that algorithmic empathy systems can improve emotional resonance by 34.7%and increase audience engagement by 28.3%compared to traditional communication methods.The findings demonstrate that AI algorithms reconstruct media communication logic through three primary pathways:emotional pattern recognition,personalized content curation,and real-time sentiment adaptation.However,the study also identifies significant challenges including algorithmic bias,emotional authenticity concerns,and ethical implications of automated empathy.The research contributes to understanding how mainstream media can leverage AI technology to build high-quality empathetic communication while maintaining journalistic integrity and social responsibility.展开更多
Objective To compare the impact of different reconstruction algorithms on the image quality of 60 kVp head and neck CT angiography(CTA)using subjective and objective metrics,with a focus on vessel edge sharpness.Metho...Objective To compare the impact of different reconstruction algorithms on the image quality of 60 kVp head and neck CT angiography(CTA)using subjective and objective metrics,with a focus on vessel edge sharpness.Methods This prospective study enrolled 45 patients who underwent ultra-low-voltage(60 kVp)head and neck CTA.Image datasets were reconstructed with filtered back-projection(FBP),ClearView(CV)and ClearInfinity(CI)algorithms at low(30%),medium(50%),and high(70%)strengths.Image quality was assessed subjectively and objectively via the Kruskal‒Wallis test for multiple comparisons.Objective parameters,including edge rise slope(ERS)and edge rise distance(ERD),were analyzed via the Friedman test of multiple comparisons statistics.Results Subjective assessments favored the CI50 reconstruction algorithm,demonstrating superior or satisfactory results compared to the other algorithms,with significantly better vessel delineation,edge definition and diagnostic confidence(all P<0.05).Objective analysis revealed that the CV50 and CV70 algorithms significantly reduced ERS and/or elevated ERD(both P<0.05).However,the CI50 algorithm maintained comparable vessel edge sharpness(P>0.05)across all evaluated head and neck vascular segments when compared with the FBP algorithm.Conclusions The CI50 reconstruction algorithm optimizes image quality in 60 kVp head and neck CTA.It provides vessel edge sharpness comparable to FBP while offering superior vessel delineation,edge definition,and diagnostic confidence compared to FBP and CV algorithm.These findings suggest that CI50 has the potential to improve diagnostic accuracy in low-dose vascular imaging.展开更多
Background:The nasal alar defect in Asians remains a challenging issue,as do clear classification and algorithm guidance,despite numerous previously described surgical techniques.The aim of this study is to propose a ...Background:The nasal alar defect in Asians remains a challenging issue,as do clear classification and algorithm guidance,despite numerous previously described surgical techniques.The aim of this study is to propose a surgical algorithm that addresses the appropriate surgical procedures for different types of nasal alar defects in Asian patients.Methods:A retrospective case note review was conducted on 32 patients with nasal alar defect who underwent reconstruction between 2008 and 2022.Based on careful analysis and our clinical experience,we proposed a classification system for nasal alar defects and presented a reconstructive algorithm.Patient data,including age,sex,diagnosis,surgical options,and complications,were assessed.The extent of surgical scar formation was evaluated using standard photography based on a 4-grade scar scale.Results:Among the 32 patients,there were 20 males and 12 females with nasal alar defects.The predominant cause of trauma in China was industrial factors.The majority of alar defects were classified as type Ⅰ C(n=8,25%),comprising 18 cases(56.2%);there were 5 cases(15.6%)of type Ⅱ defect,7(21.9%)of type Ⅲ defect,and 2(6.3%)of type Ⅳ defect.The most common surgical option was auricular composite graft(n=8,25%),followed by bilobed flap(n=6,18.8%),free auricular composite flap(n=4,12.5%),and primary closure(n=3,9.4%).Satisfactory improvements were observed postoperatively.Conclusion:Factors contributing to classifications were analyzed and defined,providing a framework for the proposed classification system.The reconstructive algorithm offers surgeons appropriate procedures for treating nasal alar defect in Asians.展开更多
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.展开更多
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.展开更多
Fluorinated motifs are prevalent in both pharmaceuticals and agrochemicals.The incorporation of fluorine-containing moieties to drug candidates has emerged as a potent strategy for lead optimization in pharmaceutical ...Fluorinated motifs are prevalent in both pharmaceuticals and agrochemicals.The incorporation of fluorine-containing moieties to drug candidates has emerged as a potent strategy for lead optimization in pharmaceutical research and development.While extensive research has been devoted to constructing molecules that incorporate a trifluoromethylthio(SCF_(3)−)group on a stereogenic carbon,the synthesis of trifluoromethylthiolated alkanes featuring a SCF_(3)-substituted stereogenic carbon at non-activated site remains understudied.Herein,we report a Cu-catalyzed regio-and enantioselective hydroallylation of 1-trifluoromethylthiolated alkenes.Important to the process is the regio-and enantioselective Cu-H insertion to SCF_(3)-substituted alkene to form chiralα-SCF_(3) alkyl copper intermediates,outcompeting unproductive insertion to the coupling partner,and eventually proceed to afford optically active homoallylic trifluoromethylthiolated products.展开更多
基金Shanghai Municipal Natural Science Foundation of China(No.10ZR1431700)
文摘Aiming at the flexible flowshop group scheduling problem,taking sequence dependent setup time and machine skipping into account, a mathematical model for minimizing makespan is established,and a hybrid differential evolution( HDE) algorithm based on greedy constructive procedure( GCP) is proposed,which combines differential evolution( DE) with tabu search( TS). DE is applied to generating the elite individuals of population,while TS is used for finding the optimal value by making perturbation in selected elite individuals. A lower bounding technique is developed to evaluate the quality of proposed algorithm. Experimental results verify the effectiveness and feasibility of proposed algorithm.
基金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.
基金the Deanship of Scientific Research,Imam Mohammad Ibn Saud Islamic University(IMSIU),Saudi Arabia,for funding this research work through Grant No.(221412020).
文摘The generalized travelling salesman problem(GTSP),a generalization of the well-known travelling salesman problem(TSP),is considered for our study.Since the GTSP is NP-hard and very complex,finding exact solutions is highly expensive,we will develop genetic algorithms(GAs)to obtain heuristic solutions to the problem.In GAs,as the crossover is a very important process,the crossovermethods proposed for the traditional TSP could be adapted for the GTSP.The sequential constructive crossover(SCX)and three other operators are adapted to use in GAs to solve the GTSP.The effectiveness of GA using SCX is verified on some GTSP Library(GTSPLIB)instances first and then compared against GAs using the other crossover methods.The computational results show the success of the GA using SCX for this problem.Our proposed GA using SCX,and swap mutation could find average solutions whose average percentage of excesses fromthe best-known solutions is between 0.00 and 14.07 for our investigated instances.
文摘Objective:To identify potential key genes associated with pre-eclampsia through bioinformatics analysis,construct predictive models using machine-learning algorithms,and evaluate the models'performance in predicting pre-eclampsia.Methods:Gene-expression microarray datasets GSE10588,GSE66273,and GSE30186 related to pre-eclampsia were downloaded from the gene expression omnibus(GEO).Data were normalized using R,and differentially expressed genes(DEGs)were identified.LASSO regression was applied to further filter DEGs.Based on the selected DEGs,six machine-learning models-logistic regression(LR),random forest(RF),support vector machine(SVM),K-nearest neighbors(KNN),neural network(NN),and eXtreme gradient boosting(XGBoost)were built in R,and their performance was validated.Results:From the three datasets,a total of 1,363 genes were extracted.LASSO regression narrowed these to 265 candidate key genes.Multivariate analysis ultimately identified four genes closely associated with pre-eclampsia:EVI5,GCLM,LEP,and SYNPO2L.Using these four key genes,six machine-learning models were constructed.Receiver operating characteristic(ROC)analysis showed that all models achieved AUC>0.9:LR(AUC=0.983,95%CI=0.942-0.998),RF(AUC=0.961,95%CI=0.912-0.987),SVM(AUC=0.936,95%CI=0.879-0.972),KNN(AUC=0.970,95%CI=0.924-0.992),NN(AUC=0.916,95%CI=0.854-0.958),and XGBoost(AUC=0.952,95%CI=0.900-0.982).There was no statistically significant difference among the AUCs of the models(P>0.05).Conclusion:This study identified four key genes linked to preeclampsia through integrated bioinformatics analysis.Predictive models built on these genes can accurately forecast the occurrence of pre-eclampsia,suggesting that the four genes may serve as potential biomarkers for early diagnosis and therapeutic targeting of pre-eclampsia.
文摘Aiming at the problems faced by construction site video management in the recognition of cigarette butts,reflective vests,and other objects,such as small target confusion,high-brightness false alarms,occlusion missed detections,and poor adaptability to complex environments,this study proposes a recognition accuracy optimization algorithm based on multimodal fusion.The research constructs a dataset containing three modalities of data:visible light,infrared,and millimeter-wave.The Dust-GAN algorithm is adopted to realize dust removal and enhancement of dusty images,and the SAA module is introduced into YOLOv8-s to improve the small target recall rate.Meanwhile,three-modal feature fusion is achieved,and channel pruning and quantization-aware training are used to realize algorithm lightweighting.The algorithm was deployed and operated on-site for 3 months,effectively reducing the construction site safety accident rate by 65%,which provides a solution for safety management and control in smart construction sites under complex environments.
文摘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.
文摘Electrical capacitance tomography technique reconstructs dielectric constant distribution in an object by measuring the capacitances between the eletrode pairs which are mounted around this object. Because of the limitation of measurement condition, the measured data are imcomplet. This paper describes a multiresolution reconstructive algorithm which is based on network theory for electrical capacitance tomography technique. The dielectric constant distribution of flow of two components in a pipeline is reconstructed. The algorithm is as follows: Firstly, construct a rough, first level system model, and assume the dielectric constant distribution of the region to be reconstructed. After iteration, the dielectic constant of each unit can be reconstructed. Secondly, construct a finer, second level the system model and determine the initial dielectric constant of each unit in the region to be reconstructed according to related information between two levels. After iteration, the image of the pipeline's cross section can be reconstructed. The results of simulated experiments about different kinds of medium distributions show that this algorithm is effective and can converge.
文摘This part II-C of our work completes the factorizational theory of asymptotic expansions in the real domain. Here we present two algorithms for constructing canonical factorizations of a disconjugate operator starting from a basis of its kernel which forms a Chebyshev asymptotic scale at an endpoint. These algorithms arise quite naturally in our asymptotic context and prove very simple in special cases and/or for scales with a small numbers of terms. All the results in the three Parts of this work are well illustrated by a class of asymptotic scales featuring interesting properties. Examples and counterexamples complete the exposition.
文摘This paper presents a novel method for reconstructing a highly accurate 3D nose model of the human from 2D images and pre-marked landmarks based on algorithmic methods.The study focuses on the reconstruction of a 3D nose model tailored for applications in healthcare and cosmetic surgery.The approach leverages advanced image processing techniques,3D Morphable Models(3DMM),and deformation techniques to overcome the limita-tions of deep learning models,particularly addressing the interpretability issues commonly encountered in medical applications.The proposed method estimates the 3D coordinates of landmark points using a 3D structure estimation algorithm.Sub-landmarks are extracted through image processing techniques and interpolation.The initial surface is generated using a 3DMM,though its accuracy remains limited.To enhance precision,deformation techniques are applied,utilizing the coordinates of 76 identified landmarks and sub-landmarks.The resulting 3D nose model is constructed based on algorithmic methods and pre-marked landmarks.Evaluation of the 3D model is conducted by comparing landmark distances and shape similarity with expert-determined ground truth on 30 Vietnamese volunteers aged 18 to 47,all of whom were either preparing for or required nasal surgery.Experimental results demonstrate a strong agreement between the reconstructed 3D model and the ground truth.The method achieved a mean landmark distance error of 0.631 mm and a shape error of 1.738 mm,demonstrating its potential for medical applications.
文摘BACKGROUND Eyelid reconstruction is an intricate process,addressing both aesthetic and functional aspects post-trauma or oncological surgery.Aesthetic concerns and oncological radicality guide personalized approaches.The complex anatomy,involving anterior and posterior lamellae,requires tailored reconstruction for optimal functionality.AIM To formulate an eyelid reconstruction algorithm through an extensive literature review and to validate it by juxtaposing surgical outcomes from Cattinara Hos-in dry eye and tears,which may lead to long-term consequences such as chronic conjunctivitis,discomfort,or photo-phobia.To prevent this issue,scars should be oriented vertically or perpendicularly to the free eyelid margin when the size of the tumor allows.In employing a malar flap to repair a lower eyelid defect,the malar incision must ascend diagonally;this facilitates enhanced flap advancement and mitigates ectropion by restricting vertical traction.Conse-quently,it is imperative to maintain that the generated tension remains consistently horizontal and never vertical[9].Lagophthalmos is a disorder characterized by the inability to completely close the eyelids,leading to corneal exposure and an increased risk of keratitis or ulceration;it may arise following upper eyelid surgery.To avert this issue,it is essential to preserve a minimum of 1 cm of skin between the superior edge of the excision and the inferior boundary of the eyebrow.Epiphora may occur in cancers involving the lacrimal puncta,requiring their removal.As previously stated,when employing a glabellar flap to rectify medial canthal abnormalities,it is essential to prevent a trapdoor effect or thickening of the flap relative to the eyelid skin to which it is affixed.Constraints about our proposed algorithm enco-mpass limited sample sizes and possible publication biases in existing studies.Subsequent investigations ought to examine long-term results to further refine the algorithm.Future research should evaluate the algorithm across varied populations and examine the impact of novel graft materials on enhancing reconstructive outcomes.CONCLUSION Eyelid reconstruction remains one of the most intriguing challenges for a plastic surgeon today.The most fascinating aspect of this discipline is the need to restore the functionality of such an essential structure while maintaining its aesthetics.In our opinion,creating decision-making algorithms can facilitate reaching this goal by allowing for the individualization of the reconstructive path while minimizing the incidence of complications.The fact that we have decreased the incidence of severe complications is a sign that the work is moving in the right direction.The fact that there has been no need for reintervention,neither for reconstructive issues nor for inadequate oncological radicality,overall signifies greater patient satisfaction as they do not have to undergo the stress of new surgeries.Even the minor complic-ations recorded are in line with those reported in the literature,and,even more importantly for patients,they are of limited duration.In our experience,after a year of application,we can say that the objective has been achieved,but much more can still be done.Behind every work,a scientific basis must be continually renewed and refreshed to maintain high-quality standards.Therefore,searching for possible alternative solutions to be included in one’s surgical armamentarium is fundamental to providing the patient with a fully personalized option.
文摘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.
基金National Natural Science Foundation of China(32301712)Natural Science Foundation of Jiangsu Province(BK20230548+3 种基金BK20250876)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.
文摘This study investigates how artificial intelligence(AI)algorithms enable mainstream media to achieve precise emotional matching and improve communication efficiency through reconstructed communication logic.As digital intelligence technology rapidly evolves,mainstream media organizations are increasingly leveraging AI-driven empathy algorithms to enhance audience engagement and optimize content delivery.This research employs a mixed-methods approach,combining quantitative analysis of algorithmic performance metrics with qualitative examination of media communication patterns.Through systematic review of 150 academic papers and analysis of data from 12 major media platforms,this study reveals that algorithmic empathy systems can improve emotional resonance by 34.7%and increase audience engagement by 28.3%compared to traditional communication methods.The findings demonstrate that AI algorithms reconstruct media communication logic through three primary pathways:emotional pattern recognition,personalized content curation,and real-time sentiment adaptation.However,the study also identifies significant challenges including algorithmic bias,emotional authenticity concerns,and ethical implications of automated empathy.The research contributes to understanding how mainstream media can leverage AI technology to build high-quality empathetic communication while maintaining journalistic integrity and social responsibility.
基金the Grant from the National Key Research and Development Program of China(No.2024YFC2419300)the National Natural Science Foundation of China(No.82471967)+1 种基金the Hubei Provincial Key Research and Development Program(No.2024BCB008)the Hubei Provincial Natural Science Foundation of China(No.2025AFB733).
文摘Objective To compare the impact of different reconstruction algorithms on the image quality of 60 kVp head and neck CT angiography(CTA)using subjective and objective metrics,with a focus on vessel edge sharpness.Methods This prospective study enrolled 45 patients who underwent ultra-low-voltage(60 kVp)head and neck CTA.Image datasets were reconstructed with filtered back-projection(FBP),ClearView(CV)and ClearInfinity(CI)algorithms at low(30%),medium(50%),and high(70%)strengths.Image quality was assessed subjectively and objectively via the Kruskal‒Wallis test for multiple comparisons.Objective parameters,including edge rise slope(ERS)and edge rise distance(ERD),were analyzed via the Friedman test of multiple comparisons statistics.Results Subjective assessments favored the CI50 reconstruction algorithm,demonstrating superior or satisfactory results compared to the other algorithms,with significantly better vessel delineation,edge definition and diagnostic confidence(all P<0.05).Objective analysis revealed that the CV50 and CV70 algorithms significantly reduced ERS and/or elevated ERD(both P<0.05).However,the CI50 algorithm maintained comparable vessel edge sharpness(P>0.05)across all evaluated head and neck vascular segments when compared with the FBP algorithm.Conclusions The CI50 reconstruction algorithm optimizes image quality in 60 kVp head and neck CTA.It provides vessel edge sharpness comparable to FBP while offering superior vessel delineation,edge definition,and diagnostic confidence compared to FBP and CV algorithm.These findings suggest that CI50 has the potential to improve diagnostic accuracy in low-dose vascular imaging.
文摘Background:The nasal alar defect in Asians remains a challenging issue,as do clear classification and algorithm guidance,despite numerous previously described surgical techniques.The aim of this study is to propose a surgical algorithm that addresses the appropriate surgical procedures for different types of nasal alar defects in Asian patients.Methods:A retrospective case note review was conducted on 32 patients with nasal alar defect who underwent reconstruction between 2008 and 2022.Based on careful analysis and our clinical experience,we proposed a classification system for nasal alar defects and presented a reconstructive algorithm.Patient data,including age,sex,diagnosis,surgical options,and complications,were assessed.The extent of surgical scar formation was evaluated using standard photography based on a 4-grade scar scale.Results:Among the 32 patients,there were 20 males and 12 females with nasal alar defects.The predominant cause of trauma in China was industrial factors.The majority of alar defects were classified as type Ⅰ C(n=8,25%),comprising 18 cases(56.2%);there were 5 cases(15.6%)of type Ⅱ defect,7(21.9%)of type Ⅲ defect,and 2(6.3%)of type Ⅳ defect.The most common surgical option was auricular composite graft(n=8,25%),followed by bilobed flap(n=6,18.8%),free auricular composite flap(n=4,12.5%),and primary closure(n=3,9.4%).Satisfactory improvements were observed postoperatively.Conclusion:Factors contributing to classifications were analyzed and defined,providing a framework for the proposed classification system.The reconstructive algorithm offers surgeons appropriate procedures for treating nasal alar defect in Asians.
基金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.
基金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.
基金the National Key R&D Program of China(No.2021YFF0701700)the National Natural Science Foundation of China(Nos.22271264 and 21971228)for financial support.
文摘Fluorinated motifs are prevalent in both pharmaceuticals and agrochemicals.The incorporation of fluorine-containing moieties to drug candidates has emerged as a potent strategy for lead optimization in pharmaceutical research and development.While extensive research has been devoted to constructing molecules that incorporate a trifluoromethylthio(SCF_(3)−)group on a stereogenic carbon,the synthesis of trifluoromethylthiolated alkanes featuring a SCF_(3)-substituted stereogenic carbon at non-activated site remains understudied.Herein,we report a Cu-catalyzed regio-and enantioselective hydroallylation of 1-trifluoromethylthiolated alkenes.Important to the process is the regio-and enantioselective Cu-H insertion to SCF_(3)-substituted alkene to form chiralα-SCF_(3) alkyl copper intermediates,outcompeting unproductive insertion to the coupling partner,and eventually proceed to afford optically active homoallylic trifluoromethylthiolated products.
