In a post-disaster environment characterized by frequent interruptions in communication links,traditional wireless communication networks are ineffective.Although the“store-carry-forward”mechanism characteristic of ...In a post-disaster environment characterized by frequent interruptions in communication links,traditional wireless communication networks are ineffective.Although the“store-carry-forward”mechanism characteristic of Delay Tolerant Networks(DTNs)can transmit data from Internet of things devices to more reliable base stations or data centres,it also suffers from inefficient data transmission and excessive transmission delays.To address these challenges,we propose an intelligent routing strategy based on node sociability for post-disaster emergency network scenarios.First,we introduce an intelligent routing strategy based on node intimacy,which selects more suitable relay nodes and assigns the corresponding number of message copies based on comprehensive utility values.Second,we present an intelligent routing strategy based on geographical location of nodes to forward message replicas secondarily based on transmission utility values.Finally,experiments demonstrate the effectiveness of our proposed algorithm in terms of message delivery rate,network cost ratio and average transmission delay.展开更多
The foundation of ad hoc networks lies in the guarantee of continuous connectivity.However,critical nodes,whose failure can easily destroy network connectivity,will influence the ad hoc network connectivity significan...The foundation of ad hoc networks lies in the guarantee of continuous connectivity.However,critical nodes,whose failure can easily destroy network connectivity,will influence the ad hoc network connectivity significantly.To protect the network efficiently,critical nodes should be identified accurately and rapidly.Unlike existing critical node identification methods for unknown topology that identify critical nodes according to historical information,this paper develops a critical node identification method to relax the prior topology information condition about critical nodes.Specifically,we first deduce a theorem about the minimum communication range for a node through the number of nodes and deployment ranges,and prove the universality of the theorem in a realistic two-dimensional scenario.After that,we analyze the relationship between communication range and degree value for each node and prove that the greater number of nodes within the communication range of a node,the greater degree value of nodes with high probability.Moreover,we develop a novel strategy to improve the accuracy of critical node identification without topology information.Finally,simulation results indicate the proposed strategy can achieve high accuracy and low redundancy while ensuring low time consumption in the scenarios with unknown topology information in ad hoc networks.展开更多
BACKGROUND Colorectal cancer(CRC)is a significant global health issue,and lymph node metastasis(LNM)is a crucial prognostic factor.Accurate prediction of LNM is essential for developing individualized treatment strate...BACKGROUND Colorectal cancer(CRC)is a significant global health issue,and lymph node metastasis(LNM)is a crucial prognostic factor.Accurate prediction of LNM is essential for developing individualized treatment strategies for patients with CRC.However,the prediction of LNM is challenging and depends on various factors such as tumor histology,clinicopathological features,and molecular characteristics.The most reliable method to detect LNM is the histopathological examination of surgically resected specimens;however,this method is invasive,time-consuming,and subject to sampling errors and interobserver variability.AIM To analyze influencing factors and develop and validate a risk prediction model for LNM in CRC based on a large patient queue.METHODS This study retrospectively analyzed 300 patients who underwent CRC surgery at two Peking University Shenzhen hospitals between January and December 2021.A deep learning approach was used to extract features potentially associated with LNM from primary tumor histological images while a logistic regression model was employed to predict LNM in CRC using machine-learning-derived features and clinicopathological variables as predictors.RESULTS The prediction model constructed for LNM in CRC was based on a logistic regression framework that incorporated machine learning-extracted features and clinicopathological variables.The model achieved high accuracy(0.86),sensitivity(0.81),specificity(0.87),positive predictive value(0.66),negative predictive value(0.94),area under the curve for the receiver operating characteristic(0.91),and a low Brier score(0.10).The model showed good agreement between the observed and predicted probabilities of LNM across a range of risk thresholds,indicating good calibration and clinical utility.CONCLUSION The present study successfully developed and validated a potent and effective risk-prediction model for LNM in patients with CRC.This model utilizes machine-learning-derived features extracted from primary tumor histology and clinicopathological variables,demonstrating superior performance and clinical applicability compared to existing models.The study provides new insights into the potential of deep learning to extract valuable information from tumor histology,in turn,improving the prediction of LNM in CRC and facilitate risk stratification and decision-making in clinical practice.展开更多
There were two strategies for the data forwarding in the content-centric networking(CCN): forwarding strategy and routing strategy. Forwarding strategy only considered a separated node rather than the whole network pe...There were two strategies for the data forwarding in the content-centric networking(CCN): forwarding strategy and routing strategy. Forwarding strategy only considered a separated node rather than the whole network performance, and Interest flooding led to the network overhead and redundancy as well. As for routing strategy in CCN, each node was required to run the protocol. It was a waste of routing cost and unfit for large-scale deployment.This paper presents the super node routing strategy in CCN. Some super nodes selected from the peer nodes in CCN were used to receive the routing information from their slave nodes and compute the face-to-path to establish forwarding information base(FIB). Then FIB was sent to slave nodes to control and manage the slave nodes. The theoretical analysis showed that the super node routing strategy possessed robustness and scalability, achieved load balancing,reduced the redundancy and improved the network performance. In three topologies, three experiments were carried out to test the super node routing strategy. Network performance results showed that the proposed strategy had a shorter delay, lower CPU utilization and less redundancy compared with CCN.展开更多
The trustworthiness and security of routing in the existing Peer-to-Peer (P2P) networks can not be ensured because of the diversity of the strategies of P2P nodes. This paper firstly uses game theory to establish game...The trustworthiness and security of routing in the existing Peer-to-Peer (P2P) networks can not be ensured because of the diversity of the strategies of P2P nodes. This paper firstly uses game theory to establish game model of the strategies and profits of various types of routing nodes. Then,two incentive mechanisms for the corresponding stages of P2P trustworthy routing are proposed,namely trust associated mechanism and trust compensated mechanism. Simulation results show that the incentive mechanisms proposed in this paper will encourage cooperation actions of good nodes and restrain malicious actions of bad nodes,which ensure the trustworthiness of routing consequently.展开更多
为进一步优化重叠社区检测算法,提出了一种新的基于度和节点聚类系数的节点重要性定义,按照节点重要性降序更新节点,固定节点更新策略,提高社区检测的稳定性。在此基础上,提出了一种基于图嵌入和多标签传播的重叠社区检测算法(overlappi...为进一步优化重叠社区检测算法,提出了一种新的基于度和节点聚类系数的节点重要性定义,按照节点重要性降序更新节点,固定节点更新策略,提高社区检测的稳定性。在此基础上,提出了一种基于图嵌入和多标签传播的重叠社区检测算法(overlapping community detection based on graph embedding and multi-label propagation algorithm,OCD-GEMPA)。该算法结合node2vec模型对节点进行低维向量表示,构建节点之间的权重值矩阵,根据权重值计算标签归属系数,据此选择标签,避免了随机选择问题。在真实数据集和人工合成数据集上对该算法进行实验验证。实验结果表明,与其他重叠社区检测算法相比,OCD-GEMPA在EQ和NMI这两个指标都有明显提升,具有更好的准确性和稳定性。展开更多
针对偏远地区低速率、时延非敏感业务的入网问题,提出了一种基于移动捎带的广域物联网信息传输方法。利用移动载体为物联网设备提供无感接入支持,扩展了网络覆盖范围。在无基站信号覆盖区域,移动载体与传感器建立连接,获取传感器数据并...针对偏远地区低速率、时延非敏感业务的入网问题,提出了一种基于移动捎带的广域物联网信息传输方法。利用移动载体为物联网设备提供无感接入支持,扩展了网络覆盖范围。在无基站信号覆盖区域,移动载体与传感器建立连接,获取传感器数据并存储,具备5G接入条件时,将感知信息卸载实现信息入网。提出了一种基于代价函数的数据缓存策略,提高了信息捎带效率,分析了移动捎带方案的覆盖性能,并设计了一种基于远距离无线电(long range radio,LoRa)技术的硬件实现方案。仿真结果表明,基于移动捎带的广域物联网信息传输方法能够提高物联网信息捎带效率,并将5G网络的物联网覆盖范围扩大4.98倍,实地测试验证了所提方法的有效性,移动捎带节点可以实现半径4 km的通信覆盖。展开更多
RRT(Rapidly exploring Random Tree)是一种基于采样的路径规划算法,非常适用于机器人的路径规划中,但是传统RRT^(*)算法存在耗时长、占用内存较大等缺点。所以针对这些问题提出一种改进RRT^(*)算法,该算法优化了父节点选取范围,在传统...RRT(Rapidly exploring Random Tree)是一种基于采样的路径规划算法,非常适用于机器人的路径规划中,但是传统RRT^(*)算法存在耗时长、占用内存较大等缺点。所以针对这些问题提出一种改进RRT^(*)算法,该算法优化了父节点选取范围,在传统随机采样机制的基础上引入了目标偏置采样和启发式策略,减少了算法耗时且缩短了路径长度;引入了节点拒绝策略,消除转弯角太大的冗余路径的同时也进一步提升了算法效率。利用MATLAB进行了仿真实验验证,结果表明改进RRT^(*)算法能在更短的时间内搜索到一条从起点到终点的最短无碰路径,并且可以很好地应用于机械臂的路径规划中。展开更多
基金funded by the Researchers Supporting Project Number RSPD2024R681,King Saud University,Riyadh,Saudi Arabia.
文摘In a post-disaster environment characterized by frequent interruptions in communication links,traditional wireless communication networks are ineffective.Although the“store-carry-forward”mechanism characteristic of Delay Tolerant Networks(DTNs)can transmit data from Internet of things devices to more reliable base stations or data centres,it also suffers from inefficient data transmission and excessive transmission delays.To address these challenges,we propose an intelligent routing strategy based on node sociability for post-disaster emergency network scenarios.First,we introduce an intelligent routing strategy based on node intimacy,which selects more suitable relay nodes and assigns the corresponding number of message copies based on comprehensive utility values.Second,we present an intelligent routing strategy based on geographical location of nodes to forward message replicas secondarily based on transmission utility values.Finally,experiments demonstrate the effectiveness of our proposed algorithm in terms of message delivery rate,network cost ratio and average transmission delay.
基金supported by the National Natural Science Foundation of China(62231020)the Youth Innovation Team of Shaanxi Universities。
文摘The foundation of ad hoc networks lies in the guarantee of continuous connectivity.However,critical nodes,whose failure can easily destroy network connectivity,will influence the ad hoc network connectivity significantly.To protect the network efficiently,critical nodes should be identified accurately and rapidly.Unlike existing critical node identification methods for unknown topology that identify critical nodes according to historical information,this paper develops a critical node identification method to relax the prior topology information condition about critical nodes.Specifically,we first deduce a theorem about the minimum communication range for a node through the number of nodes and deployment ranges,and prove the universality of the theorem in a realistic two-dimensional scenario.After that,we analyze the relationship between communication range and degree value for each node and prove that the greater number of nodes within the communication range of a node,the greater degree value of nodes with high probability.Moreover,we develop a novel strategy to improve the accuracy of critical node identification without topology information.Finally,simulation results indicate the proposed strategy can achieve high accuracy and low redundancy while ensuring low time consumption in the scenarios with unknown topology information in ad hoc networks.
文摘BACKGROUND Colorectal cancer(CRC)is a significant global health issue,and lymph node metastasis(LNM)is a crucial prognostic factor.Accurate prediction of LNM is essential for developing individualized treatment strategies for patients with CRC.However,the prediction of LNM is challenging and depends on various factors such as tumor histology,clinicopathological features,and molecular characteristics.The most reliable method to detect LNM is the histopathological examination of surgically resected specimens;however,this method is invasive,time-consuming,and subject to sampling errors and interobserver variability.AIM To analyze influencing factors and develop and validate a risk prediction model for LNM in CRC based on a large patient queue.METHODS This study retrospectively analyzed 300 patients who underwent CRC surgery at two Peking University Shenzhen hospitals between January and December 2021.A deep learning approach was used to extract features potentially associated with LNM from primary tumor histological images while a logistic regression model was employed to predict LNM in CRC using machine-learning-derived features and clinicopathological variables as predictors.RESULTS The prediction model constructed for LNM in CRC was based on a logistic regression framework that incorporated machine learning-extracted features and clinicopathological variables.The model achieved high accuracy(0.86),sensitivity(0.81),specificity(0.87),positive predictive value(0.66),negative predictive value(0.94),area under the curve for the receiver operating characteristic(0.91),and a low Brier score(0.10).The model showed good agreement between the observed and predicted probabilities of LNM across a range of risk thresholds,indicating good calibration and clinical utility.CONCLUSION The present study successfully developed and validated a potent and effective risk-prediction model for LNM in patients with CRC.This model utilizes machine-learning-derived features extracted from primary tumor histology and clinicopathological variables,demonstrating superior performance and clinical applicability compared to existing models.The study provides new insights into the potential of deep learning to extract valuable information from tumor histology,in turn,improving the prediction of LNM in CRC and facilitate risk stratification and decision-making in clinical practice.
基金Supported by the National Basic Research Program of China("973"Program,No.2013CB329100)Beijing Higher Education Young Elite Teacher Project(No.YETP0534)
文摘There were two strategies for the data forwarding in the content-centric networking(CCN): forwarding strategy and routing strategy. Forwarding strategy only considered a separated node rather than the whole network performance, and Interest flooding led to the network overhead and redundancy as well. As for routing strategy in CCN, each node was required to run the protocol. It was a waste of routing cost and unfit for large-scale deployment.This paper presents the super node routing strategy in CCN. Some super nodes selected from the peer nodes in CCN were used to receive the routing information from their slave nodes and compute the face-to-path to establish forwarding information base(FIB). Then FIB was sent to slave nodes to control and manage the slave nodes. The theoretical analysis showed that the super node routing strategy possessed robustness and scalability, achieved load balancing,reduced the redundancy and improved the network performance. In three topologies, three experiments were carried out to test the super node routing strategy. Network performance results showed that the proposed strategy had a shorter delay, lower CPU utilization and less redundancy compared with CCN.
基金Supported by the Hi-Tech R&D Program (863) of China (2006AA01Z232)the Research Innovation Program for Graduate Student in Jiangsu Province (CX07B-11OZ)
文摘The trustworthiness and security of routing in the existing Peer-to-Peer (P2P) networks can not be ensured because of the diversity of the strategies of P2P nodes. This paper firstly uses game theory to establish game model of the strategies and profits of various types of routing nodes. Then,two incentive mechanisms for the corresponding stages of P2P trustworthy routing are proposed,namely trust associated mechanism and trust compensated mechanism. Simulation results show that the incentive mechanisms proposed in this paper will encourage cooperation actions of good nodes and restrain malicious actions of bad nodes,which ensure the trustworthiness of routing consequently.
文摘为进一步优化重叠社区检测算法,提出了一种新的基于度和节点聚类系数的节点重要性定义,按照节点重要性降序更新节点,固定节点更新策略,提高社区检测的稳定性。在此基础上,提出了一种基于图嵌入和多标签传播的重叠社区检测算法(overlapping community detection based on graph embedding and multi-label propagation algorithm,OCD-GEMPA)。该算法结合node2vec模型对节点进行低维向量表示,构建节点之间的权重值矩阵,根据权重值计算标签归属系数,据此选择标签,避免了随机选择问题。在真实数据集和人工合成数据集上对该算法进行实验验证。实验结果表明,与其他重叠社区检测算法相比,OCD-GEMPA在EQ和NMI这两个指标都有明显提升,具有更好的准确性和稳定性。
文摘针对偏远地区低速率、时延非敏感业务的入网问题,提出了一种基于移动捎带的广域物联网信息传输方法。利用移动载体为物联网设备提供无感接入支持,扩展了网络覆盖范围。在无基站信号覆盖区域,移动载体与传感器建立连接,获取传感器数据并存储,具备5G接入条件时,将感知信息卸载实现信息入网。提出了一种基于代价函数的数据缓存策略,提高了信息捎带效率,分析了移动捎带方案的覆盖性能,并设计了一种基于远距离无线电(long range radio,LoRa)技术的硬件实现方案。仿真结果表明,基于移动捎带的广域物联网信息传输方法能够提高物联网信息捎带效率,并将5G网络的物联网覆盖范围扩大4.98倍,实地测试验证了所提方法的有效性,移动捎带节点可以实现半径4 km的通信覆盖。
文摘RRT(Rapidly exploring Random Tree)是一种基于采样的路径规划算法,非常适用于机器人的路径规划中,但是传统RRT^(*)算法存在耗时长、占用内存较大等缺点。所以针对这些问题提出一种改进RRT^(*)算法,该算法优化了父节点选取范围,在传统随机采样机制的基础上引入了目标偏置采样和启发式策略,减少了算法耗时且缩短了路径长度;引入了节点拒绝策略,消除转弯角太大的冗余路径的同时也进一步提升了算法效率。利用MATLAB进行了仿真实验验证,结果表明改进RRT^(*)算法能在更短的时间内搜索到一条从起点到终点的最短无碰路径,并且可以很好地应用于机械臂的路径规划中。
