The rapid evolution of unmanned aerial vehicle(UAV)technology and autonomous capabilities has positioned UAV as promising last-mile delivery means.Vehicle and onboard UAV collaborative delivery is introduced as a nove...The rapid evolution of unmanned aerial vehicle(UAV)technology and autonomous capabilities has positioned UAV as promising last-mile delivery means.Vehicle and onboard UAV collaborative delivery is introduced as a novel delivery mode.Spatiotemporal collaboration,along with energy consumption with payload and wind conditions play important roles in delivery route planning.This paper introduces the traveling salesman problem with time window and onboard UAV(TSPTWOUAV)and emphasizes the consideration of real-world scenarios,focusing on time collaboration and energy consumption with wind and payload.To address this,a mixed integer linear programming(MILP)model is formulated to minimize the energy consumption costs of vehicle and UAV.Furthermore,an adaptive large neighborhood search(ALNS)algorithm is applied to identify high-quality solutions efficiently.The effectiveness of the proposed model and algorithm is validated through numerical tests on real geographic instances and sensitivity analysis of key parameters is conducted.展开更多
BACKGROUND Colorectal cancer(CRC)is a global health concern,with advanced-stage diagnoses contributing to poor prognoses.The efficacy of CRC screening has been well-established;nevertheless,a significant proportion of...BACKGROUND Colorectal cancer(CRC)is a global health concern,with advanced-stage diagnoses contributing to poor prognoses.The efficacy of CRC screening has been well-established;nevertheless,a significant proportion of patients remain unscreened,with>70%of cases diagnosed outside screening.Although identifying specific subgroups for whom CRC screening should be particularly recommended is crucial owing to limited resources,the association between the diagnostic routes and identification of these subgroups has been less appreciated.In the Japanese cancer registry,the diagnostic routes for groups discovered outside of screening are primarily categorized into those with comorbidities found during hospital visits and those with CRC-related symptoms.AIM To clarify the stage at CRC diagnosis based on diagnostic routes.METHODS We conducted a retrospective observational study using a cancer registry of patients with CRC between January 2016 and December 2019 at two hospitals.The diagnostic routes were primarily classified into three groups:Cancer screening,follow-up,and symptomatic.The early-stage was defined as Stages 0 or I.Multivariate and univariate logistic regressions were exploited to determine the odds of early-stage diagnosis in the symptomatic and cancer screening groups,referencing the follow-up group.The adjusted covariates were age,sex,and tumor location.RESULTS Of the 2083 patients,715(34.4%),1064(51.1%),and 304(14.6%)belonged to the follow-up,symptomatic,and cancer screening groups,respectively.Among the 2083 patients,CRCs diagnosed at an early stage were 57.3%(410 of 715),23.9%(254 of 1064),and 59.5%(181 of 304)in the follow-up,symptomatic,and cancer screening groups,respectively.The symptomatic group exhibited a lower likelihood of early-stage diagnosis than the follow-up group[P<0.001,adjusted odds ratio(aOR),0.23;95%confidence interval(95%CI):0.19-0.29].The likelihood of diagnosis at an early stage was similar between the follow-up and cancer screening groups(P=0.493,aOR for early-stage diagnosis in the cancer screening group vs follow-up group=1.11;95%CI=0.82-1.49).CONCLUSION CRCs detected during hospital visits for comorbidities were diagnosed earlier,similar to cancer screening.CRC screening should be recommended,particularly for patients without periodical hospital visits for comorbidities.展开更多
Demand Responsive Transit (DRT) responds to the dynamic users’ requests without any fixed routes and timetablesand determines the stop and the start according to the demands. This study explores the optimization of d...Demand Responsive Transit (DRT) responds to the dynamic users’ requests without any fixed routes and timetablesand determines the stop and the start according to the demands. This study explores the optimization of dynamicvehicle scheduling and real-time route planning in urban public transportation systems, with a focus on busservices. It addresses the limitations of current shared mobility routing algorithms, which are primarily designedfor simpler, single origin/destination scenarios, and do not meet the complex demands of bus transit systems. Theresearch introduces an route planning algorithm designed to dynamically accommodate passenger travel needsand enable real-time route modifications. Unlike traditional methods, this algorithm leverages a queue-based,multi-objective heuristic A∗ approach, offering a solution to the inflexibility and limited coverage of suburbanbus routes. Also, this study conducts a comparative analysis of the proposed algorithm with solutions based onGenetic Algorithm (GA) and Ant Colony Optimization Algorithm (ACO), focusing on calculation time, routelength, passenger waiting time, boarding time, and detour rate. The findings demonstrate that the proposedalgorithmsignificantly enhances route planning speed, achieving an 80–100-fold increase in efficiency over existingmodels, thereby supporting the real-time demands of Demand-Responsive Transportation (DRT) systems. Thestudy concludes that this algorithm not only optimizes route planning in bus transit but also presents a scalablesolution for improving urban mobility.展开更多
The emergence of beyond 5G networks has the potential for seamless and intelligent connectivity on a global scale.Network slicing is crucial in delivering services for different,demanding vertical applications in this...The emergence of beyond 5G networks has the potential for seamless and intelligent connectivity on a global scale.Network slicing is crucial in delivering services for different,demanding vertical applications in this context.Next-generation applications have time-sensitive requirements and depend on the most efficient routing path to ensure packets reach their intended destinations.However,the existing IP(Internet Protocol)over a multi-domain network faces challenges in enforcing network slicing due to minimal collaboration and information sharing among network operators.Conventional inter-domain routing methods,like Border Gateway Protocol(BGP),cannot make routing decisions based on performance,which frequently results in traffic flowing across congested paths that are never optimal.To address these issues,we propose CoopAI-Route,a multi-agent cooperative deep reinforcement learning(DRL)system utilizing hierarchical software-defined networks(SDN).This framework enforces network slicing in multi-domain networks and cooperative communication with various administrators to find performance-based routes in intra-and inter-domain.CoopAI-Route employs the Distributed Global Topology(DGT)algorithm to define inter-domain Quality of Service(QoS)paths.CoopAI-Route uses a DRL agent with a message-passing multi-agent Twin-Delayed Deep Deterministic Policy Gradient method to ensure optimal end-to-end routes adapted to the specific requirements of network slicing applications.Our evaluation demonstrates CoopAI-Route’s commendable performance in scalability,link failure handling,and adaptability to evolving topologies compared to state-of-the-art methods.展开更多
We propose a frequency-tunable router of single photons with high routing efficiency, which is constructed by two waveguides mediately linked by a single-mode whispering gallery resonator with a driven three-level emi...We propose a frequency-tunable router of single photons with high routing efficiency, which is constructed by two waveguides mediately linked by a single-mode whispering gallery resonator with a driven three-level emitter. Quantum routing probability in the output port is obtained via the real-space Hamiltonian. By adjusting the resonator–emitter coupling and the drive, the desired continuous central frequencies for the resonance peaks of routing photons can be manipulated nearly linearly, with the assistance of Rabi splitting effect and optical Stark shift. The proposed routing system may provide potential applications in designing other frequency-modulation quantum optical devices, such as multiplexers,filters, and so on.展开更多
As the global temperature continues to increase, the sea level continues to rise at a rapid rate that has never been seen before. This becomes an issue for many facets of life but one of the most impacted is the trans...As the global temperature continues to increase, the sea level continues to rise at a rapid rate that has never been seen before. This becomes an issue for many facets of life but one of the most impacted is the transportation infrastructure. Many people living in low elevation coastal areas can become trapped by flooding with no way in or out. With Delaware being a coastal state, this would affect a large portion of the population and will have detrimental effects over time if nothing is done to combat sea level rise. The issue with sea level rise in transportation is that once the roads become flooded, they become virtually unusable and detour routes would be needed. If all the roads in a coastal area were to be affected by sea level rise, the options for detours would become limited. This article looks at direct solutions to combat sea level rise and indirect solutions that would specifically help transportation infrastructure and evacuation routes in Delaware. There is not one solution that can fix every problem, so many solutions are laid out to see what is applicable to each affected area. Some solutions include defense structures that would be put close to the coast, raising the elevation of vulnerable roads throughout the state and including pumping stations to drain the water on the surface of the road. With an understanding of all these solutions around the world, the ultimate conclusion came in the form of a six-step plan that Delaware should take in order to best design against sea level rise in these coastal areas.展开更多
Using multi-source data like remote sensing images,resource point coordinates,road networks and land type,a suitability assessment system for red study greenway route selection is constructed with red study resource l...Using multi-source data like remote sensing images,resource point coordinates,road networks and land type,a suitability assessment system for red study greenway route selection is constructed with red study resource layer,traffic condition layer,ecological condition layer,and service radius layer as the selection elements.Analytic Hierarchy Process(AHP)and Delphi method aree used to determine the selection factors and weight allocation of each element,and the single factor evaluation and multi factor overlaying analysis are used to accurately identify suitable selection corridors.The potential position is determined based on the lowest cost path.Finally,the final red study greenway is obtained through manual optimization based on the current situation of the road network.The analysis results show that the areas with the highest suitability were those with the richest distribution of first,second,and third level red study resources.An effective connection of red resource points and various elements helps to enhance the competitiveness of red study tours in Ji’an County,providing a realistic path for selecting study greenways for cities rich in red resources.展开更多
Given the prominence and magnitude of airport incentive schemes,it is surprising that literature hitherto remains silent as to their effectiveness.In this paper,the relationship between airport incentive schemes and t...Given the prominence and magnitude of airport incentive schemes,it is surprising that literature hitherto remains silent as to their effectiveness.In this paper,the relationship between airport incentive schemes and the route development behavior of airlines is analyzed.Because of rare and often controversial findings in the extant literature regarding relevant influencing variables for attracting airlines at an airport,expert interviews are used as a complement to formulate testable hypotheses in this regard.A fixed effects regression model is used to test the hypotheses with a dataset that covers all seat capacity offered at the 22 largest German commercial airports in the week 46 from 2004 to 2011.It is found that incentives from primary choice,as well as secondary choice airports,have a significant influence on Low Cost Carriers.Furthermore,Low Cost Carriers,in general,do not leave any of both types of airports when the incentives cease.In the case of Network Carriers,no case is found where one joins a primary choice airport and receives an incentive.Insufficient data between Network Carriers and secondary choice airports in the time when incentives have ceased means that no statement can be given.展开更多
The ability to predict the anti-interference communications performance of unmanned aerial vehicle(UAV)data links is critical for intelligent route planning of UAVs in real combat scenarios.Previous research in this a...The ability to predict the anti-interference communications performance of unmanned aerial vehicle(UAV)data links is critical for intelligent route planning of UAVs in real combat scenarios.Previous research in this area has encountered several limitations:Classifiers exhibit low training efficiency,their precision is notably reduced when dealing with imbalanced samples,and they cannot be applied to the condition where the UAV’s flight altitude and the antenna bearing vary.This paper proposes the sequential Latin hypercube sampling(SLHS)-support vector machine(SVM)-AdaBoost algorithm,which enhances the training efficiency of the base classifier and circumvents local optima during the search process through SLHS optimization.Additionally,it mitigates the bottleneck of sample imbalance by adjusting the sample weight distribution using the AdaBoost algorithm.Through comparison,the modeling efficiency,prediction accuracy on the test set,and macro-averaged values of precision,recall,and F1-score for SLHS-SVM-AdaBoost are improved by 22.7%,5.7%,36.0%,25.0%,and 34.2%,respectively,compared with Grid-SVM.Additionally,these values are improved by 22.2%,2.1%,11.3%,2.8%,and 7.4%,respectively,compared with particle swarm optimization(PSO)-SVM-AdaBoost.Combining Latin hypercube sampling with the SLHS-SVM-AdaBoost algorithm,the classification prediction model of anti-interference performance of UAV data links,which took factors like three-dimensional position of UAV and antenna bearing into consideration,is established and used to assess the safety of the classical flying path and optimize the flying route.It was found that the risk of loss of communications could not be completely avoided by adjusting the flying altitude based on the classical path,whereas intelligent path planning based on the classification prediction model of anti-interference performance can realize complete avoidance of being interfered meanwhile reducing the route length by at least 2.3%,thus benefiting both safety and operation efficiency.展开更多
Due to the effects of the COVID-19 pandemic and the rise of online shopping, the offline sales of IKEA Fuzhou have been declining since 2020. Because the cost of distribution warehouse is a major expense for offline c...Due to the effects of the COVID-19 pandemic and the rise of online shopping, the offline sales of IKEA Fuzhou have been declining since 2020. Because the cost of distribution warehouse is a major expense for offline chain furniture retailers, and the picking process is a key activity in distribution warehouse operations. To reduce the cost of distribution warehouse and alleviate the survival pressure of the offline chain furniture retailers, this paper focuses on optimizing the picking route of the IKEA Fuzhou distribution warehouse. It starts by creating a two-dimensional coordinate system for the storage location of the distribution warehouse using the traditional S-type picking strategy to calculate the distance and time of the sorting route. Then, the problem of optimizing the picking route is then transformed into the travelling salesman problem (TSP), and picking route optimization model is developed using a genetic algorithm to analyze the sorting efficiency and picking route optimization. Results show that the order-picking route using the genetic algorithm strategy is significantly better than the traditional S-type picking strategy, which can improve overall sorting efficiency and operations, reduce costs, and increase efficiency. Thus, this establishes an implementation process for the order-picking path based on genetic algorithm optimization to improve overall sorting efficiency and operations, reduce costs, increase efficiency, and alleviate the survival pressure of pandemic-affected enterprises.展开更多
This paper outlines the basic concept of knowledge graph and its unique advantages, and explains in detail its approach to processing complex data structures through data integration, relationship discovery and semant...This paper outlines the basic concept of knowledge graph and its unique advantages, and explains in detail its approach to processing complex data structures through data integration, relationship discovery and semantic understanding. Knowledge graphs utilize a combination of technologies such as entities, attributes, relationships, and semantic annotations to demonstrate indispensable functionality in standardization processes, and especially excel in achieving semantic connectivity. This paper systematically analyzes the role of knowledge graph in each level using the standards hierarchical model as a framework. In Level 1, knowledge graph supports information extraction and preliminary tagging;in Level 2, it realizes structured and semantic processing of documents;in Level 3, it facilitates complex relationship modeling and executive integration;and it lays the foundation for advanced intelligent applications, autonomous standards governance and dynamic automatic updating in Level 4 and 5. This paper provides an in-depth discussion of its future directions and possible challenges, including key topics such as optimizing the scalability of knowledge graphs and facilitating cross-domain knowledge fusion. It shows that knowledge graphs provide powerful technical support for standards digitization and offer new possibilities for realizing smart manufacturing and cross-domain collaboration.展开更多
Cytidine triphosphate(CTP),as a substance involved in the metabolism of phospholipids,proteins and nucleic acids,has precise drug effects and is a direct precursor for the synthesis of drugs such as citicoline.In this...Cytidine triphosphate(CTP),as a substance involved in the metabolism of phospholipids,proteins and nucleic acids,has precise drug effects and is a direct precursor for the synthesis of drugs such as citicoline.In this study,we established an in vitro six-enzyme cascade system to generate CTP.To avoid thermodynamic bottlenecks,we employed a circuitous and two-stage reaction strategy.Using cytidine as the key substrate,the final product CTP is obtained via the deamination and uridine phosphorylation pathways,relying on the irreversible reaction of cytidine triphosphate synthase to catalyze the amination of uridine triphosphate.Several extremophilic microbial-derived deaminases were screened and characterized,and a suitable cytidine deaminase was selected to match the first-stage reaction conditions.In addition,directed evolution modification of the rate-limiting enzyme CTP synthetase in the pathway yielded a variant that successfully relieved the product feedback inhibition,along with a 1.7-fold increase in activity over the wild type.After optimizing the reaction conditions,we finally carried out the catalytic reaction at an initial cytidine concentration of 20 mM,and the yield of CTP exceeded 82%within 10.0 h.展开更多
Over the last 10 years there have been significant developments and improvements in the understanding of railway track bed in the UK and its relationship and impact on track quality,ballast life and maintenance follow...Over the last 10 years there have been significant developments and improvements in the understanding of railway track bed in the UK and its relationship and impact on track quality,ballast life and maintenance following track renewals.This paper aims to describe the process adopted by Network Rail for track bed investigation and design which offers Network Rail optimum design solutions and value for money from an investigation and construction perspective,balancing design with possession availability to maximise construction output.It also describes innovative investigation and construction techniques that have been developed over the last 5 years maximising the use of rail mounted asset condition data collection systems which run at line speed,allowing targeted investigations and in some case removing the requirements for physical site investigation.It also allows Network Rail to predict sections of track bed which may be affected by line speed increases which would cause the track bed to fail prematurely or,retain its ability to maintain good track geometry post line speed increase.These problems can manifest themselves as stiffness related problems such as critical velocity issues(surface wave velocity,Rayleigh Wave velocity)or,sub-grade erosion resulting in high rates of deterioration in the vertical track geometry.The paper also describes the development and installation process for Enhanced Axial Micropiles to address stiffness related track bed problems whilst leaving the track in-situ a technique which is new to the UK railways.展开更多
This paper proposes an efficient strategy for resource utilization in Elastic Optical Networks (EONs) to minimize spectrum fragmentation and reduce connection blocking probability during Routing and Spectrum Allocatio...This paper proposes an efficient strategy for resource utilization in Elastic Optical Networks (EONs) to minimize spectrum fragmentation and reduce connection blocking probability during Routing and Spectrum Allocation (RSA). The proposed method, Dynamic Threshold-Based Routing and Spectrum Allocation with Fragmentation Awareness (DT-RSAF), integrates rerouting and spectrum defragmentation as needed. By leveraging Yen’s shortest path algorithm, DT-RSAF enhances resource utilization while ensuring improved service continuity. A dynamic threshold mechanism enables the algorithm to adapt to varying network conditions, while its fragmentation awareness effectively mitigates spectrum fragmentation. Simulation results on NSFNET and COST 239 topologies demonstrate that DT-RSAF significantly outperforms methods such as K-Shortest Path Routing and Spectrum Allocation (KSP-RSA), Load Balanced and Fragmentation-Aware (LBFA), and the Invasive Weed Optimization-based RSA (IWO-RSA). Under heavy traffic, DT-RSAF reduces the blocking probability by up to 15% and achieves lower Bandwidth Fragmentation Ratios (BFR), ranging from 74% to 75%, compared to 77% - 80% for KSP-RSA, 75% - 77% for LBFA, and approximately 76% for IWO-RSA. DT-RSAF also demonstrated reasonable computation times compared to KSP-RSA, LBFA, and IWO-RSA. On a small-sized network, its computation time was 8710 times faster than that of Integer Linear Programming (ILP) on the same network topology. Additionally, it achieved a similar execution time to LBFA and outperformed IWO-RSA in terms of efficiency. These results highlight DT-RSAF’s capability to maintain large contiguous frequency blocks, making it highly effective for accommodating high-bandwidth requests in EONs while maintaining reasonable execution times.展开更多
Delay aware routing is now widely used to provide efficient network transmission. However, for newly developing or developed mobile communication networks(MCN), only limited delay data can be obtained. In such a netwo...Delay aware routing is now widely used to provide efficient network transmission. However, for newly developing or developed mobile communication networks(MCN), only limited delay data can be obtained. In such a network, the delay is with epistemic uncertainty, which makes the traditional routing scheme based on deterministic theory or probability theory not applicable. Motivated by this problem, the MCN with epistemic uncertainty is first summarized as a dynamic uncertain network based on uncertainty theory, which is widely applied to model epistemic uncertainties. Then by modeling the uncertain end-toend delay, a new delay bounded routing scheme is proposed to find the path with the maximum belief degree that satisfies the delay threshold for the dynamic uncertain network. Finally, a lowEarth-orbit satellite communication network(LEO-SCN) is used as a case to verify the effectiveness of our routing scheme. It is first modeled as a dynamic uncertain network, and then the delay bounded paths with the maximum belief degree are computed and compared under different delay thresholds.展开更多
The low Earth orbit(LEO)satellite networks have outstanding advantages such as wide coverage area and not being limited by geographic environment,which can provide a broader range of communication services and has bec...The low Earth orbit(LEO)satellite networks have outstanding advantages such as wide coverage area and not being limited by geographic environment,which can provide a broader range of communication services and has become an essential supplement to the terrestrial network.However,the dynamic changes and uneven distribution of satellite network traffic inevitably bring challenges to multipath routing.Even worse,the harsh space environment often leads to incomplete collection of network state data for routing decision-making,which further complicates this challenge.To address this problem,this paper proposes a state-incomplete intelligent dynamic multipath routing algorithm(SIDMRA)to maximize network efficiency even with incomplete state data as input.Specifically,we model the multipath routing problem as a markov decision process(MDP)and then combine the deep deterministic policy gradient(DDPG)and the K shortest paths(KSP)algorithm to solve the optimal multipath routing policy.We use the temporal correlation of the satellite network state to fit the incomplete state data and then use the message passing neuron network(MPNN)for data enhancement.Simulation results show that the proposed algorithm outperforms baseline algorithms regarding average end-to-end delay and packet loss rate and performs stably under certain missing rates of state data.展开更多
Low Earth orbit(LEO)satellite networks exhibit distinct characteristics,e.g.,limited resources of individual satellite nodes and dynamic network topology,which have brought many challenges for routing algorithms.To sa...Low Earth orbit(LEO)satellite networks exhibit distinct characteristics,e.g.,limited resources of individual satellite nodes and dynamic network topology,which have brought many challenges for routing algorithms.To satisfy quality of service(QoS)requirements of various users,it is critical to research efficient routing strategies to fully utilize satellite resources.This paper proposes a multi-QoS information optimized routing algorithm based on reinforcement learning for LEO satellite networks,which guarantees high level assurance demand services to be prioritized under limited satellite resources while considering the load balancing performance of the satellite networks for low level assurance demand services to ensure the full and effective utilization of satellite resources.An auxiliary path search algorithm is proposed to accelerate the convergence of satellite routing algorithm.Simulation results show that the generated routing strategy can timely process and fully meet the QoS demands of high assurance services while effectively improving the load balancing performance of the link.展开更多
An efficient parallel global router using random optimization that is independent of net ordering is proposed.Parallel approaches are described and strategies guaranteeing the routing quality are discussed.The wire le...An efficient parallel global router using random optimization that is independent of net ordering is proposed.Parallel approaches are described and strategies guaranteeing the routing quality are discussed.The wire length model is implemented on multiprocessor,which enables the algorithm to approach feasibility of large scale problems.Timing driven model on multiprocessor and wire length model on distributed processors are also presented.The parallel algorithm greatly reduces the run time of routing.The experimental results show good speedups with no degradation of the routing quality.展开更多
Research about the auto commuter＇s pre-trip route choice behavior ignores the combined influence of the real-time information and all respondents＇ historical information in the existing documents.To overcome this sh...Research about the auto commuter＇s pre-trip route choice behavior ignores the combined influence of the real-time information and all respondents＇ historical information in the existing documents.To overcome this shortcoming,an approach to describing the pre-trip route choice behavior with the incorporation of the real-time and historical information is proposed.Two types of real-time information are investigated,which are quantitative information and prescriptive information.By using the bounded rationality theory,the influence of historical information on the real-time information reference process is examined first.Estimation results show that the historical information has a significant influence on the quantitative information reference process,but not on the prescriptive information reference process.Then the route choice behavior is modeled.A comparison is also made among three route choice models,one of which does not incorporate the real-time information reference process,while the others do.Estimation results show that the route choice behavior is better described with the consideration of the reference process of both quantitative and prescriptive information.展开更多
Through analyzing landscape environment which is the principal factor to be considered in the route design of highway,principles to be followed by the highway route design are proposed,and approaches of maintaining th...Through analyzing landscape environment which is the principal factor to be considered in the route design of highway,principles to be followed by the highway route design are proposed,and approaches of maintaining the harmony between route design and landscape along the highway under different conditions are discussed.展开更多
基金Fundamental Research Funds for the Central Universities(2024JBZX038)National Natural Science F oundation of China(62076023)。
文摘The rapid evolution of unmanned aerial vehicle(UAV)technology and autonomous capabilities has positioned UAV as promising last-mile delivery means.Vehicle and onboard UAV collaborative delivery is introduced as a novel delivery mode.Spatiotemporal collaboration,along with energy consumption with payload and wind conditions play important roles in delivery route planning.This paper introduces the traveling salesman problem with time window and onboard UAV(TSPTWOUAV)and emphasizes the consideration of real-world scenarios,focusing on time collaboration and energy consumption with wind and payload.To address this,a mixed integer linear programming(MILP)model is formulated to minimize the energy consumption costs of vehicle and UAV.Furthermore,an adaptive large neighborhood search(ALNS)algorithm is applied to identify high-quality solutions efficiently.The effectiveness of the proposed model and algorithm is validated through numerical tests on real geographic instances and sensitivity analysis of key parameters is conducted.
基金the Foundation for Cancer Research supported by Kyoto Preventive Medical Center and the Japan Society for the Promotion of Science(JSPS)Grants-in-Aid KAKENHI,No.JP 22K21080.
文摘BACKGROUND Colorectal cancer(CRC)is a global health concern,with advanced-stage diagnoses contributing to poor prognoses.The efficacy of CRC screening has been well-established;nevertheless,a significant proportion of patients remain unscreened,with>70%of cases diagnosed outside screening.Although identifying specific subgroups for whom CRC screening should be particularly recommended is crucial owing to limited resources,the association between the diagnostic routes and identification of these subgroups has been less appreciated.In the Japanese cancer registry,the diagnostic routes for groups discovered outside of screening are primarily categorized into those with comorbidities found during hospital visits and those with CRC-related symptoms.AIM To clarify the stage at CRC diagnosis based on diagnostic routes.METHODS We conducted a retrospective observational study using a cancer registry of patients with CRC between January 2016 and December 2019 at two hospitals.The diagnostic routes were primarily classified into three groups:Cancer screening,follow-up,and symptomatic.The early-stage was defined as Stages 0 or I.Multivariate and univariate logistic regressions were exploited to determine the odds of early-stage diagnosis in the symptomatic and cancer screening groups,referencing the follow-up group.The adjusted covariates were age,sex,and tumor location.RESULTS Of the 2083 patients,715(34.4%),1064(51.1%),and 304(14.6%)belonged to the follow-up,symptomatic,and cancer screening groups,respectively.Among the 2083 patients,CRCs diagnosed at an early stage were 57.3%(410 of 715),23.9%(254 of 1064),and 59.5%(181 of 304)in the follow-up,symptomatic,and cancer screening groups,respectively.The symptomatic group exhibited a lower likelihood of early-stage diagnosis than the follow-up group[P<0.001,adjusted odds ratio(aOR),0.23;95%confidence interval(95%CI):0.19-0.29].The likelihood of diagnosis at an early stage was similar between the follow-up and cancer screening groups(P=0.493,aOR for early-stage diagnosis in the cancer screening group vs follow-up group=1.11;95%CI=0.82-1.49).CONCLUSION CRCs detected during hospital visits for comorbidities were diagnosed earlier,similar to cancer screening.CRC screening should be recommended,particularly for patients without periodical hospital visits for comorbidities.
文摘Demand Responsive Transit (DRT) responds to the dynamic users’ requests without any fixed routes and timetablesand determines the stop and the start according to the demands. This study explores the optimization of dynamicvehicle scheduling and real-time route planning in urban public transportation systems, with a focus on busservices. It addresses the limitations of current shared mobility routing algorithms, which are primarily designedfor simpler, single origin/destination scenarios, and do not meet the complex demands of bus transit systems. Theresearch introduces an route planning algorithm designed to dynamically accommodate passenger travel needsand enable real-time route modifications. Unlike traditional methods, this algorithm leverages a queue-based,multi-objective heuristic A∗ approach, offering a solution to the inflexibility and limited coverage of suburbanbus routes. Also, this study conducts a comparative analysis of the proposed algorithm with solutions based onGenetic Algorithm (GA) and Ant Colony Optimization Algorithm (ACO), focusing on calculation time, routelength, passenger waiting time, boarding time, and detour rate. The findings demonstrate that the proposedalgorithmsignificantly enhances route planning speed, achieving an 80–100-fold increase in efficiency over existingmodels, thereby supporting the real-time demands of Demand-Responsive Transportation (DRT) systems. Thestudy concludes that this algorithm not only optimizes route planning in bus transit but also presents a scalablesolution for improving urban mobility.
文摘The emergence of beyond 5G networks has the potential for seamless and intelligent connectivity on a global scale.Network slicing is crucial in delivering services for different,demanding vertical applications in this context.Next-generation applications have time-sensitive requirements and depend on the most efficient routing path to ensure packets reach their intended destinations.However,the existing IP(Internet Protocol)over a multi-domain network faces challenges in enforcing network slicing due to minimal collaboration and information sharing among network operators.Conventional inter-domain routing methods,like Border Gateway Protocol(BGP),cannot make routing decisions based on performance,which frequently results in traffic flowing across congested paths that are never optimal.To address these issues,we propose CoopAI-Route,a multi-agent cooperative deep reinforcement learning(DRL)system utilizing hierarchical software-defined networks(SDN).This framework enforces network slicing in multi-domain networks and cooperative communication with various administrators to find performance-based routes in intra-and inter-domain.CoopAI-Route employs the Distributed Global Topology(DGT)algorithm to define inter-domain Quality of Service(QoS)paths.CoopAI-Route uses a DRL agent with a message-passing multi-agent Twin-Delayed Deep Deterministic Policy Gradient method to ensure optimal end-to-end routes adapted to the specific requirements of network slicing applications.Our evaluation demonstrates CoopAI-Route’s commendable performance in scalability,link failure handling,and adaptability to evolving topologies compared to state-of-the-art methods.
基金Project supported by the National Natural Science Foundation of China (Grant Nos. 12365003, 12364024, and 11864014)the Natural Science Foundation of Jiangxi Province, China (Grant Nos. 20212BAB201014 and 20224BAB201023)。
文摘We propose a frequency-tunable router of single photons with high routing efficiency, which is constructed by two waveguides mediately linked by a single-mode whispering gallery resonator with a driven three-level emitter. Quantum routing probability in the output port is obtained via the real-space Hamiltonian. By adjusting the resonator–emitter coupling and the drive, the desired continuous central frequencies for the resonance peaks of routing photons can be manipulated nearly linearly, with the assistance of Rabi splitting effect and optical Stark shift. The proposed routing system may provide potential applications in designing other frequency-modulation quantum optical devices, such as multiplexers,filters, and so on.
文摘As the global temperature continues to increase, the sea level continues to rise at a rapid rate that has never been seen before. This becomes an issue for many facets of life but one of the most impacted is the transportation infrastructure. Many people living in low elevation coastal areas can become trapped by flooding with no way in or out. With Delaware being a coastal state, this would affect a large portion of the population and will have detrimental effects over time if nothing is done to combat sea level rise. The issue with sea level rise in transportation is that once the roads become flooded, they become virtually unusable and detour routes would be needed. If all the roads in a coastal area were to be affected by sea level rise, the options for detours would become limited. This article looks at direct solutions to combat sea level rise and indirect solutions that would specifically help transportation infrastructure and evacuation routes in Delaware. There is not one solution that can fix every problem, so many solutions are laid out to see what is applicable to each affected area. Some solutions include defense structures that would be put close to the coast, raising the elevation of vulnerable roads throughout the state and including pumping stations to drain the water on the surface of the road. With an understanding of all these solutions around the world, the ultimate conclusion came in the form of a six-step plan that Delaware should take in order to best design against sea level rise in these coastal areas.
文摘Using multi-source data like remote sensing images,resource point coordinates,road networks and land type,a suitability assessment system for red study greenway route selection is constructed with red study resource layer,traffic condition layer,ecological condition layer,and service radius layer as the selection elements.Analytic Hierarchy Process(AHP)and Delphi method aree used to determine the selection factors and weight allocation of each element,and the single factor evaluation and multi factor overlaying analysis are used to accurately identify suitable selection corridors.The potential position is determined based on the lowest cost path.Finally,the final red study greenway is obtained through manual optimization based on the current situation of the road network.The analysis results show that the areas with the highest suitability were those with the richest distribution of first,second,and third level red study resources.An effective connection of red resource points and various elements helps to enhance the competitiveness of red study tours in Ji’an County,providing a realistic path for selecting study greenways for cities rich in red resources.
文摘Given the prominence and magnitude of airport incentive schemes,it is surprising that literature hitherto remains silent as to their effectiveness.In this paper,the relationship between airport incentive schemes and the route development behavior of airlines is analyzed.Because of rare and often controversial findings in the extant literature regarding relevant influencing variables for attracting airlines at an airport,expert interviews are used as a complement to formulate testable hypotheses in this regard.A fixed effects regression model is used to test the hypotheses with a dataset that covers all seat capacity offered at the 22 largest German commercial airports in the week 46 from 2004 to 2011.It is found that incentives from primary choice,as well as secondary choice airports,have a significant influence on Low Cost Carriers.Furthermore,Low Cost Carriers,in general,do not leave any of both types of airports when the incentives cease.In the case of Network Carriers,no case is found where one joins a primary choice airport and receives an incentive.Insufficient data between Network Carriers and secondary choice airports in the time when incentives have ceased means that no statement can be given.
文摘The ability to predict the anti-interference communications performance of unmanned aerial vehicle(UAV)data links is critical for intelligent route planning of UAVs in real combat scenarios.Previous research in this area has encountered several limitations:Classifiers exhibit low training efficiency,their precision is notably reduced when dealing with imbalanced samples,and they cannot be applied to the condition where the UAV’s flight altitude and the antenna bearing vary.This paper proposes the sequential Latin hypercube sampling(SLHS)-support vector machine(SVM)-AdaBoost algorithm,which enhances the training efficiency of the base classifier and circumvents local optima during the search process through SLHS optimization.Additionally,it mitigates the bottleneck of sample imbalance by adjusting the sample weight distribution using the AdaBoost algorithm.Through comparison,the modeling efficiency,prediction accuracy on the test set,and macro-averaged values of precision,recall,and F1-score for SLHS-SVM-AdaBoost are improved by 22.7%,5.7%,36.0%,25.0%,and 34.2%,respectively,compared with Grid-SVM.Additionally,these values are improved by 22.2%,2.1%,11.3%,2.8%,and 7.4%,respectively,compared with particle swarm optimization(PSO)-SVM-AdaBoost.Combining Latin hypercube sampling with the SLHS-SVM-AdaBoost algorithm,the classification prediction model of anti-interference performance of UAV data links,which took factors like three-dimensional position of UAV and antenna bearing into consideration,is established and used to assess the safety of the classical flying path and optimize the flying route.It was found that the risk of loss of communications could not be completely avoided by adjusting the flying altitude based on the classical path,whereas intelligent path planning based on the classification prediction model of anti-interference performance can realize complete avoidance of being interfered meanwhile reducing the route length by at least 2.3%,thus benefiting both safety and operation efficiency.
文摘Due to the effects of the COVID-19 pandemic and the rise of online shopping, the offline sales of IKEA Fuzhou have been declining since 2020. Because the cost of distribution warehouse is a major expense for offline chain furniture retailers, and the picking process is a key activity in distribution warehouse operations. To reduce the cost of distribution warehouse and alleviate the survival pressure of the offline chain furniture retailers, this paper focuses on optimizing the picking route of the IKEA Fuzhou distribution warehouse. It starts by creating a two-dimensional coordinate system for the storage location of the distribution warehouse using the traditional S-type picking strategy to calculate the distance and time of the sorting route. Then, the problem of optimizing the picking route is then transformed into the travelling salesman problem (TSP), and picking route optimization model is developed using a genetic algorithm to analyze the sorting efficiency and picking route optimization. Results show that the order-picking route using the genetic algorithm strategy is significantly better than the traditional S-type picking strategy, which can improve overall sorting efficiency and operations, reduce costs, and increase efficiency. Thus, this establishes an implementation process for the order-picking path based on genetic algorithm optimization to improve overall sorting efficiency and operations, reduce costs, increase efficiency, and alleviate the survival pressure of pandemic-affected enterprises.
文摘This paper outlines the basic concept of knowledge graph and its unique advantages, and explains in detail its approach to processing complex data structures through data integration, relationship discovery and semantic understanding. Knowledge graphs utilize a combination of technologies such as entities, attributes, relationships, and semantic annotations to demonstrate indispensable functionality in standardization processes, and especially excel in achieving semantic connectivity. This paper systematically analyzes the role of knowledge graph in each level using the standards hierarchical model as a framework. In Level 1, knowledge graph supports information extraction and preliminary tagging;in Level 2, it realizes structured and semantic processing of documents;in Level 3, it facilitates complex relationship modeling and executive integration;and it lays the foundation for advanced intelligent applications, autonomous standards governance and dynamic automatic updating in Level 4 and 5. This paper provides an in-depth discussion of its future directions and possible challenges, including key topics such as optimizing the scalability of knowledge graphs and facilitating cross-domain knowledge fusion. It shows that knowledge graphs provide powerful technical support for standards digitization and offer new possibilities for realizing smart manufacturing and cross-domain collaboration.
基金supported by the National Key Research and Development Program of China(2022YFC3401700)the National Natural Science Foundation of China(Grant No.32171478)the Tianjin Synthetic Biotechnology Innovation Capacity Improvement Project(Grant No.TSBICIP-KJGG-009).
文摘Cytidine triphosphate(CTP),as a substance involved in the metabolism of phospholipids,proteins and nucleic acids,has precise drug effects and is a direct precursor for the synthesis of drugs such as citicoline.In this study,we established an in vitro six-enzyme cascade system to generate CTP.To avoid thermodynamic bottlenecks,we employed a circuitous and two-stage reaction strategy.Using cytidine as the key substrate,the final product CTP is obtained via the deamination and uridine phosphorylation pathways,relying on the irreversible reaction of cytidine triphosphate synthase to catalyze the amination of uridine triphosphate.Several extremophilic microbial-derived deaminases were screened and characterized,and a suitable cytidine deaminase was selected to match the first-stage reaction conditions.In addition,directed evolution modification of the rate-limiting enzyme CTP synthetase in the pathway yielded a variant that successfully relieved the product feedback inhibition,along with a 1.7-fold increase in activity over the wild type.After optimizing the reaction conditions,we finally carried out the catalytic reaction at an initial cytidine concentration of 20 mM,and the yield of CTP exceeded 82%within 10.0 h.
文摘Over the last 10 years there have been significant developments and improvements in the understanding of railway track bed in the UK and its relationship and impact on track quality,ballast life and maintenance following track renewals.This paper aims to describe the process adopted by Network Rail for track bed investigation and design which offers Network Rail optimum design solutions and value for money from an investigation and construction perspective,balancing design with possession availability to maximise construction output.It also describes innovative investigation and construction techniques that have been developed over the last 5 years maximising the use of rail mounted asset condition data collection systems which run at line speed,allowing targeted investigations and in some case removing the requirements for physical site investigation.It also allows Network Rail to predict sections of track bed which may be affected by line speed increases which would cause the track bed to fail prematurely or,retain its ability to maintain good track geometry post line speed increase.These problems can manifest themselves as stiffness related problems such as critical velocity issues(surface wave velocity,Rayleigh Wave velocity)or,sub-grade erosion resulting in high rates of deterioration in the vertical track geometry.The paper also describes the development and installation process for Enhanced Axial Micropiles to address stiffness related track bed problems whilst leaving the track in-situ a technique which is new to the UK railways.
文摘This paper proposes an efficient strategy for resource utilization in Elastic Optical Networks (EONs) to minimize spectrum fragmentation and reduce connection blocking probability during Routing and Spectrum Allocation (RSA). The proposed method, Dynamic Threshold-Based Routing and Spectrum Allocation with Fragmentation Awareness (DT-RSAF), integrates rerouting and spectrum defragmentation as needed. By leveraging Yen’s shortest path algorithm, DT-RSAF enhances resource utilization while ensuring improved service continuity. A dynamic threshold mechanism enables the algorithm to adapt to varying network conditions, while its fragmentation awareness effectively mitigates spectrum fragmentation. Simulation results on NSFNET and COST 239 topologies demonstrate that DT-RSAF significantly outperforms methods such as K-Shortest Path Routing and Spectrum Allocation (KSP-RSA), Load Balanced and Fragmentation-Aware (LBFA), and the Invasive Weed Optimization-based RSA (IWO-RSA). Under heavy traffic, DT-RSAF reduces the blocking probability by up to 15% and achieves lower Bandwidth Fragmentation Ratios (BFR), ranging from 74% to 75%, compared to 77% - 80% for KSP-RSA, 75% - 77% for LBFA, and approximately 76% for IWO-RSA. DT-RSAF also demonstrated reasonable computation times compared to KSP-RSA, LBFA, and IWO-RSA. On a small-sized network, its computation time was 8710 times faster than that of Integer Linear Programming (ILP) on the same network topology. Additionally, it achieved a similar execution time to LBFA and outperformed IWO-RSA in terms of efficiency. These results highlight DT-RSAF’s capability to maintain large contiguous frequency blocks, making it highly effective for accommodating high-bandwidth requests in EONs while maintaining reasonable execution times.
基金National Natural Science Foundation of China (61773044,62073009)National key Laboratory of Science and Technology on Reliability and Environmental Engineering(WDZC2019601A301)。
文摘Delay aware routing is now widely used to provide efficient network transmission. However, for newly developing or developed mobile communication networks(MCN), only limited delay data can be obtained. In such a network, the delay is with epistemic uncertainty, which makes the traditional routing scheme based on deterministic theory or probability theory not applicable. Motivated by this problem, the MCN with epistemic uncertainty is first summarized as a dynamic uncertain network based on uncertainty theory, which is widely applied to model epistemic uncertainties. Then by modeling the uncertain end-toend delay, a new delay bounded routing scheme is proposed to find the path with the maximum belief degree that satisfies the delay threshold for the dynamic uncertain network. Finally, a lowEarth-orbit satellite communication network(LEO-SCN) is used as a case to verify the effectiveness of our routing scheme. It is first modeled as a dynamic uncertain network, and then the delay bounded paths with the maximum belief degree are computed and compared under different delay thresholds.
文摘The low Earth orbit(LEO)satellite networks have outstanding advantages such as wide coverage area and not being limited by geographic environment,which can provide a broader range of communication services and has become an essential supplement to the terrestrial network.However,the dynamic changes and uneven distribution of satellite network traffic inevitably bring challenges to multipath routing.Even worse,the harsh space environment often leads to incomplete collection of network state data for routing decision-making,which further complicates this challenge.To address this problem,this paper proposes a state-incomplete intelligent dynamic multipath routing algorithm(SIDMRA)to maximize network efficiency even with incomplete state data as input.Specifically,we model the multipath routing problem as a markov decision process(MDP)and then combine the deep deterministic policy gradient(DDPG)and the K shortest paths(KSP)algorithm to solve the optimal multipath routing policy.We use the temporal correlation of the satellite network state to fit the incomplete state data and then use the message passing neuron network(MPNN)for data enhancement.Simulation results show that the proposed algorithm outperforms baseline algorithms regarding average end-to-end delay and packet loss rate and performs stably under certain missing rates of state data.
基金National Key Research and Development Program(2021YFB2900604)。
文摘Low Earth orbit(LEO)satellite networks exhibit distinct characteristics,e.g.,limited resources of individual satellite nodes and dynamic network topology,which have brought many challenges for routing algorithms.To satisfy quality of service(QoS)requirements of various users,it is critical to research efficient routing strategies to fully utilize satellite resources.This paper proposes a multi-QoS information optimized routing algorithm based on reinforcement learning for LEO satellite networks,which guarantees high level assurance demand services to be prioritized under limited satellite resources while considering the load balancing performance of the satellite networks for low level assurance demand services to ensure the full and effective utilization of satellite resources.An auxiliary path search algorithm is proposed to accelerate the convergence of satellite routing algorithm.Simulation results show that the generated routing strategy can timely process and fully meet the QoS demands of high assurance services while effectively improving the load balancing performance of the link.
文摘An efficient parallel global router using random optimization that is independent of net ordering is proposed.Parallel approaches are described and strategies guaranteeing the routing quality are discussed.The wire length model is implemented on multiprocessor,which enables the algorithm to approach feasibility of large scale problems.Timing driven model on multiprocessor and wire length model on distributed processors are also presented.The parallel algorithm greatly reduces the run time of routing.The experimental results show good speedups with no degradation of the routing quality.
基金The Scientific Research Innovation Project for College Graduates in Jiangsu Province(No.CX10B_071Z)the National High Technology Research and Development Program of China(863 Program)(No.2011AA110304)
文摘Research about the auto commuter＇s pre-trip route choice behavior ignores the combined influence of the real-time information and all respondents＇ historical information in the existing documents.To overcome this shortcoming,an approach to describing the pre-trip route choice behavior with the incorporation of the real-time and historical information is proposed.Two types of real-time information are investigated,which are quantitative information and prescriptive information.By using the bounded rationality theory,the influence of historical information on the real-time information reference process is examined first.Estimation results show that the historical information has a significant influence on the quantitative information reference process,but not on the prescriptive information reference process.Then the route choice behavior is modeled.A comparison is also made among three route choice models,one of which does not incorporate the real-time information reference process,while the others do.Estimation results show that the route choice behavior is better described with the consideration of the reference process of both quantitative and prescriptive information.
文摘Through analyzing landscape environment which is the principal factor to be considered in the route design of highway,principles to be followed by the highway route design are proposed,and approaches of maintaining the harmony between route design and landscape along the highway under different conditions are discussed.
