Showing 21 - 40 results of 1,116 for search 'Node average', query time: 0.09s Refine Results
  1. 21

    Optimal forwarding policy in opportunistic based on social features of nodes by Zhi-fei WANG, Pei-teng SHI, Su DENG, Hong-bin HUANG, Ya-hui WU

    Published 2016-06-01
    “…A forwarding model of opportunistic network was established based on social features of node and by introducing the Pontryagin’s maximal principle,the optimal policy was got,which obeyed the threshold form.Let h denotes the stop time,when t<h,nodes forward the messages with the maximum probability,when t>h,the node stops sending messages.Experiments show that the optimal strategy is better than optimal static policy.Further analysis show that the bigger the average number of friends of node is,the smaller the stopping time is,the better the performance is.…”
    Get full text
    Article
  2. 22

    Interference-aware node access scheme in UAV-aided VANET by Xiying FAN, Chuanhe HUANG, Junyu ZHU, Shaojie WEN

    Published 2019-06-01
    “…In vehicular Ad Hoc network (VANET),frequent link handovers and channel interference can lead to increased transmission delay and decreased network throughput.To address the issues,unmanned aerial vehicle (UAV) were introduced to cooperate with vehicles and construct UAV-assisted air-ground integrated VANET.An interference-aware node access scheme was proposed.The node access problem was formulated as a multi-objective optimization problem considering link transmission rate,link handovers and transmit power.Then the optimization problem was decomposed into two convex optimization sub-problems by dual decomposition method,the sub-problem jointly optimizes handovers and link transmission rate while the sub-problem optimizes the transmit power based on link reliability.Finally,simulation results show that the proposed mechanism can effectively improve data delivery ratio,average end-to-end delay and network throughput.…”
    Get full text
    Article
  3. 23

    RADIONUCLIDE INDICATION OF SENTINEL LYMPH NODES IN LARYNX AND LARYNGOPHARYNX CANCER by I. G. Sinilkin, V. I. Chernov, Ye. L. Choinzonov, S. Yu. Chizhevskaya, A. A. Titskaya, R. V. Zelchan

    Published 2014-02-01
    “…We found 22 SLN in 17 patients (from 1 to 2 per patient, on average 1.3). Most often SLN were located in the III level of a neck (lymph nodes around of carotid arteries) – 12 SLN (54.5%) and IIA level (under lower jaw lymph nodes) – 6 (27.2%). …”
    Get full text
    Article
  4. 24

    Automatic MRI Lymph Node Annotation From CT Labels by Souraja Kundu, Yuji Iwahori, M. K. Bhuyan, Manish Bhatt, Boonserm Kijsirikul, Aili Wang, Akira Ouchi, Yasuhiro Shimizu

    Published 2025-01-01
    “…Experiments show 2.19% and 4.08% MSE reductions, 5.40% and 3.28% SSIM improvements, 29.85% and 3.82% NCC increases for cross-modality and mono-modality registration, respectively, along with a 36.7% training speedup over state-of-the-art translation-based registration models. The lymph node annotation method achieves an average of 74.3% DSC in the region of interest. …”
    Get full text
    Article
  5. 25

    Minimization of Average Peak Age of Information for Timely Status Updates in Two-Hop IoT Networks by Jin-Ho Chung, Yoora Kim

    Published 2025-06-01
    “…Here, we analyze the average PAoI in this setup as a function of system parameters and minimize this function by jointly optimizing three key parameters: (i) the number of status packets for joint coding at the sink node, (ii) the blocklength of a status packet in the first hop, and (iii) the blocklength of a coded packet in the second hop. …”
    Get full text
    Article
  6. 26

    Utilizing Machine Learning Approach to Forecast Average Location Determination Errors in Wireless Sensor Networks by Zhihui Zhu, Meifang Zhu

    Published 2024-03-01
    “…Evaluation shows that employing three beacon nodes reduces the average localization error (ALE) by up to 40% compared to using two. …”
    Get full text
    Article
  7. 27

    Federated stochastic gradient averaging ring homomorphism based learning for secure data aggregation in WSN by Saravanakumar Pichumani, T. V. P. Sundararajan, S. M. Ramesh

    Published 2025-05-01
    “…First, the copies of the model or data packets are shared between sensor nodes for performing training using the Federated Averaging learning model. …”
    Get full text
    Article
  8. 28

    Autoregressive integrated moving average model–based secure data aggregation for wireless sensor networks by Hongtao Song, Shanshan Sui, Qilong Han, Hui Zhang, Zaiqiang Yang

    Published 2020-03-01
    “…We leverage the autoregressive integrated moving average model to predict the data volume in sensor nodes, and update and synchronize the model as needed. …”
    Get full text
    Article
  9. 29

    Anatomic insights into the vascularized supraclavicular lymph node flap and a novel design for enhanced lymphedema surgery by Thanaphorn Oonjitti, Parkpoom Piyaman, Sirin Apichonbancha, Nutcha Yodrabum

    Published 2025-08-01
    “…The transverse cervical artery, which primarily originated from the thyrocervical trunk (83%), had a mean diameter of $$2.2 \pm 0.4$$ mm, while the transverse cervical vein averaged $$3.5 \pm 0.7$$ mm in diameter. One supraclavicular lymph node flap contains an average of $$4.2 \pm 0.8$$ nodes. …”
    Get full text
    Article
  10. 30

    Improved DV-Hop Node Localization Algorithm in Wireless Sensor Networks by Xiao Chen, Benliang Zhang

    Published 2012-08-01
    “…Firstly, we set some anchor nodes at the border land of monitoring regions. Secondly, the average one-hop distance between anchor nodes is modified, and the average one-hop distance used by each unknown node for estimating its location is modified through weighting the received average one-hop distances from anchor nodes. …”
    Get full text
    Article
  11. 31

    Artificial intelligence contouring in radiotherapy for organs-at-risk and lymph node areas by Céline Meyer, Sandrine Huger, Marie Bruand, Thomas Leroy, Jérémy Palisson, Paul Rétif, Thomas Sarrade, Anais Barateau, Sophie Renard, Maria Jolnerovski, Nicolas Demogeot, Johann Marcel, Nicolas Martz, Anaïs Stefani, Selima Sellami, Juliette Jacques, Emma Agnoux, William Gehin, Ida Trampetti, Agathe Margulies, Constance Golfier, Yassir Khattabi, Olivier Cravéreau, Alizée Renan, Jean-François Py, Jean-Christophe Faivre

    Published 2024-11-01
    “…Results For adults CT scans: There were two AI programs for which the overall average quality score (that is, all areas tested for OARs and lymph nodes) was higher than 2.0: Limbus (overall average score = 2.03 (0.16)) and MVision (overall average score = 2.13 (0.19)). …”
    Get full text
    Article
  12. 32

    Application and advantage of EBUS-TBNB in the diagnosis of enlarged mediastinal lymph nodes by LUO Yutu, HUANG Lei, LIU Jun, TIAN Yinchun, LIU Yun, PAN Jiahua

    Published 2025-05-01
    “…Objective Compared with endobronchial ultrasound-guided transbronchial needle aspiration (EBUS-TBNA), this study aims to explore the diagnostic advantages of endobronchial ultrasound-guided transbronchial node biopsy (EBUS-TBNB) in the diagnosis of mediastinal lymph node metastasis, lymphadenitis, sarcoidosis and other mediastinal lymph node diseases associated with mediastinal enlargement in lung cancer and extra-pulmonary tumors. …”
    Get full text
    Article
  13. 33

    Node centrality metric based caching mechanism in content-centric network by Yue-ping CAI, Jun LIU, Xin-wei FAN

    Published 2017-06-01
    “…In order to reduce the cache redundancy as well as increase the cache hit ratios in content-centric networks,the node centrality metric based caching mechanism (CMC) was proposed.CMC utilized controllers to obtain the topology of the whole network and the idle rate of cache space.According to the connection relation of the topology,the degree centrality,closeness centrality and betweenness centrality of nodes were calculated.When CMC choose the caching nodes,it took the three metrics and the idle rate of cache space into account.Simulation results show that CMC can effectively increase the cache hit ratios and reduce the content fetching hops and average request delay compared with the traditional routing algorithms in CCN.…”
    Get full text
    Article
  14. 34

    Incremental dynamic community discovery algorithm based on multi-core nodes by Jing CHEN, Zhijun LIU, Xinyu YANG, Mingxin LIU, Miaomiao LIU

    Published 2024-03-01
    “…A new incremental dynamic community discovery algorithm MCNIDCD based on multiple core nodes was proposed to address challenges in dynamic community discovery.It adapted to sudden events like the emergence or disappearance of communities during evolution.MCNIDCD categorized core nodes into diffusion and cohesion types, and devised four incremental updating strategies.It adjusted node community membership locally and optimized community structure using an incremental modularity method to facilitate community merging.Evaluation on artificial and real networks shows MCNIDCD’s high conformity to community evolution patterns.In real network experiments, MCNIDCD exhibits a 28% average improvement in modularity performance and significant stability advantages.Its superiority is important for studying dynamic community evolution.…”
    Get full text
    Article
  15. 35

    Optimization model of random load balancing of heterogeneous nodes in complex buildings by Wenlei GUO

    Published 2023-07-01
    “…In order to improve the load balancing of a complex building complex IoT and maintain its stable operation, a random load balance optimization model for non-uniformly distributed nodes in a complex building complex IoT was proposed.Sensor devices were deployed and wireless networks were accessed in complex building clusters to build the Internet of things for complex building clusters.The distribution location of each node in the Internet of things environment was determined, and random load data of non-uniformly distributed nodes was collected and integrated.The priority of non-uniformly distributed nodes was calculated using the IALBR routing protocol.By generating scheduling links and calculating the scheduling amount, the node load balancing scheduling task of the model was completed, and the load balancing of the Internet of things was optimized.The experimental results show that compared with traditional models, the average value of the load balance index of nodes under the design model is 0.002.The application of the design model effectively reduces the congestion probability of the Internet of things and improved network throughput.…”
    Get full text
    Article
  16. 36

    An Opinion Evolution Model Based on Heterogeneous Benefit with Malicious Nodes Added by Junwei Zhao, Xi Chen

    Published 2021-01-01
    “…In this study, malicious nodes, driven by the benefits of a game, were added to groups of individuals with different levels of education, and a theoretical model of the game theory of group opinions that introduces malicious nodes was established. …”
    Get full text
    Article
  17. 37

    Wakeup strategy based on multi-objective optimization for fixed relay nodes by Xue-bin MA, Ai-li LI, Xiao-juan ZHANG

    Published 2017-10-01
    “…In order to deal with the “tidal effect” when people move in the city and solve the problem of high energy consumption of fixed relay nodes in opportunistic networks,a wakeup strategy of multi-objective optimization was proposed,which made use of the message forward ability and energy consumption of fixed relay nodes.This strategy used energy efficiency as the indicator to make the nodes awake,and deployed a network revenue-energy consumption model to resolve the contradiction between energy consumption and message forward ability.As the selection problem of awake relay nodes was a NP-hard problem,genetic algorithm was used to select proper fixed relay nodes to keep awake.In this process,selection operator was improved to make the algorithm converge to solution space quickly.Experiments show that the proposed wakeup strategy can guarantee the successful rate of message transmission and improve the average message forwarding capabilities of fixed relay nodes by consuming a unit energy.…”
    Get full text
    Article
  18. 38

    Efficient node deployment for enhancing coverage and connectivity in Wireless Sensor Networks by Rahul Priyadarshi

    Published 2025-08-01
    “…Traditional deployment strategies such as random, grid-based, and deterministic placements often fail to accommodate heterogeneous node capabilities or adapt to dynamic environmental conditions. …”
    Get full text
    Article
  19. 39
  20. 40

    A Novel Mesh Routing Using the Nodes with Identical Tree Level by Li-yong Yuan, Lin Xu, Yi-hua Zhu, Cong Sun

    Published 2014-11-01
    “…The MRIL outperforms the basic mesh routing in terms of energy consumption, the average number of hops traversed per packet, the sizes of memory used to keep neighbor lists and connectivity matrices at nodes, and the number of packet transmissions in exchanging link state information.…”
    Get full text
    Article