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

    Learning attribute network algorithm based on high-order similarity by Shaoqing WU, Yihong DONG, Xiong WANG, Yan CAO, Yu XIN

    Published 2020-12-01
    “…Due to the lack of deep-level information mining and utilization in the existing network representation learning methods,the potential pattern structure similarity was proposed by further exploring the potential information in the network.The similarity score between network structures was defined to measure the similarity between various structures so that nodes could cross irrelevant vertices to obtain high-order similarities on the global structure.In order to achieve the best effect,deep learning was used to fuse multiple information sources to participate in training together to make up for the deficiency of random walks.In the experiment,Lap,DeepWalk,TADW,SDNE and CANE were selected as comparison methods,and three real-world networks were used as data sets to verify the validity of the model,and experiments of node classification and link reconstruction are carried out.In the node classification,the average performance is improved by 1.7 percentage points for different datasets and training proportions.In the link reconstruction experiment,only half the dimension is needed to achieve better performance.Finally,the performance improvement of the model under different network depths was discussed.By increasing the depth of the model,the average performance of node classification increased by 1.1 percentage points.…”
    Get full text
    Article
  2. 222

    Q-LME: Q-learning-based local mutual exclusion algorithm for flying ad hoc networks by Sindhuja S, Mary Anita Rajam V

    Published 2025-07-01
    “…Abstract Local mutual exclusion (LME) extends traditional mutual exclusion by preventing two neighboring nodes from accessing the Critical Section (CS) simultaneously while allowing concurrent access for non-neighboring nodes. …”
    Get full text
    Article
  3. 223

    Research on the A* Algorithm for Automatic Guided Vehicles in Large-Scale Maps by Yuandong Chen, Jinhao Pang, Yuchen Gou, Zhiming Lin, Shaofeng Zheng, Dewang Chen

    Published 2024-11-01
    “…Compared with the traditional A* algorithm, the improved algorithm achieved significant optimisation in terms of the average running time, the number of expansion nodes, and the path length, with the average running time shortened by 84%, the number of expansion nodes reduced by 94%, and the path length also shortened by 2.3%.…”
    Get full text
    Article
  4. 224

    Resilient greedy routing on GPS-free surface sensor networks by Buri Ban, Xuan Li, Miao Jin

    Published 2020-04-01
    “…The routing scheme is designed to be resilient to node or link failures especially under random node or link failure model where each node in a network has an equal and independent probability of failure during some time interval. …”
    Get full text
    Article
  5. 225

    Dynamic Cluster Selection DAG Scheduling for Clustered Many-Core Processor Considering Inter-Cluster Communication by Yutaro Nozaki, Fuma Omori, Takuya Azumi

    Published 2025-01-01
    “…Similarly, the average number of inter-cluster communication occurrences between nodes is reduced by up to 53%, 61%, and 59%, respectively. …”
    Get full text
    Article
  6. 226

    Meta-path convolution based heterogeneous graph neural network algorithm by QIN Zhilong, DENG Kun, LIU Xingyan

    Published 2024-03-01
    “…The experimental results show that the average increase of Macro-F1 in the node classification task is 0.5%~3.5%, and the ARI value in the node clustering task is increased by 1%~3%, which proves that the algorithm is effective and feasible.…”
    Get full text
    Article
  7. 227

    HP-ECD: Heuristic Prophet protocol based on energy balance,cache optimization, and asynchronous dormancy by Jingjian Chen, Pengfei Bie, Jie Nie, Zhiqiang Wei

    Published 2024-01-01
    “…Finally, the HP-ECD determines whether a node is in dormancy based on the node running status, to realize the asynchronous dormancy mechanism of nodes. …”
    Get full text
    Article
  8. 228

    Simulation and Experiment of New Ultrasonic Vibration Network by Xiwen Chen, Xiaoqian Li, Weihua Gui

    Published 2020-01-01
    “…The number of vibration nodes can be determined based on the number of layers of the vibration source nodes. …”
    Get full text
    Article
  9. 229

    Energy Efficient Secure Trust Based Clustering Algorithm for Mobile Wireless Sensor Network by Eid Rehman, Muhammad Sher, Syed Hussnain Abbas Naqvi, Khan Badar Khan, Kamran Ullah

    Published 2017-01-01
    “…The selection of CHs is completed utilizing weights of member nodes. The preparatory outcomes acquired through simulation exhibit the adequacy of our proposed scheme as far as average rate of avoiding malicious node as a CH, energy efficiency, and some other performance parameters are concerned.…”
    Get full text
    Article
  10. 230

    A Two-Level Routing Scheme for Wireless Sensor Network by Jinglun Shi, Zhilong Shan, Xuxun Liu

    Published 2012-07-01
    “…The proposed scheme consists of two levels: (i) sink node level and (ii) sensor node level. The proposed scheme exploits independent gradients for each sink node so that the exploratory messages forwarded by the intermediate sensor nodes can be significantly reduced. …”
    Get full text
    Article
  11. 231

    Multi-controller balancing deployment strategy based on reliability evaluation in SDN by Tao HU, Jian-hui ZHANG, Teng MA, Wei ZHAO

    Published 2017-11-01
    “…The control plane has low reliability and controller loads were unbalanced in distributed software defined networks,and a multi-controller balancing deployment strategy based on reliability evaluation was proposed.Firstly,node reliability was evaluated by weighting node efficiency and path quality,optimizing the controller location with balancing factor.Then based on improved k-center clustering,the redundant functions was introduced and the switch allocation was completed according to node attractiveness degree and controller load balancing rate,achieving a reasonable SDN sub-domain planning.The simulations show that compared with the existing strategy the number of required controllers is reduced by an average of 22.1%.The control plane elasticity is enhanced,and the controller load balancing performance has been improved significantly.…”
    Get full text
    Article
  12. 232

    Advantages, disadvantages and optimization of organ-sparing methods for uterine fibroids treatment by A. L. Tikhomirov, V. V. Kazenashev, O. V. Maksimova, M. V. Maminova, N. L. Davydenko, N. V. Rurua, T. A. Sonina

    Published 2024-11-01
    “…Based on UE data, the uterus size in group 1 was enlarged to an average of 129.49 ± 75.57 cm3, the maximum size of dominant node was 38.90 ± 17.38 mm; in group 2, the uterus was as large as 294.83 ± 161.37 cm3 with maximum size of the dominant node of 53.33 ± 25.48 mm. …”
    Get full text
    Article
  13. 233

    A LEO Satellite Handover Strategy Based on Graph and Multiobjective Multiagent Path Finding by Zhiyun Jiang, Wei Li, Xiangtong Wang, Binbin Liang

    Published 2023-01-01
    “…The path from the start node to the end node in each graph is the handover strategy of the corresponding user, and the path length is the reward that the user can get. …”
    Get full text
    Article
  14. 234

    DANCER: The routing algorithm in delay tolerant networks based on dynamic and polymorphic combination of dimensions and energy consideration by Jianxin Jia, Guangzhong Liu, Dezhi Han

    Published 2017-06-01
    “…Be differ from traditional networks, the nodes in delay tolerant networks are connected intermittently and they are mobile continuously, which result in high transmission delay and low delivery ratio. …”
    Get full text
    Article
  15. 235

    Dynamic heterogeneous network representation learning method based on Hawkes process by CHEN Lei, DENG Kun, LIU Xingyan

    Published 2024-08-01
    “…Experimental results on various benchmark datasets indicate that the proposed method significantly outperforms baseline methods. In node classification tasks, Macro-F1 average is increased by 0.15% to 3.45%, and NMI value in node clustering tasks is improved by 1.08% to 3.57%.…”
    Get full text
    Article
  16. 236

    Wireless Sensor Networks Energy Effectively Distributed Target Detection by Xiaogang Qi, Peng Wei, Lifang Liu, Mande Xie, Guoyong Cai

    Published 2014-07-01
    “…According to the simulation results, the probability of the single node target detection is compared with that of the multisensor collaborative target detection, and the influence of the weight coefficient on average node energy consumption is analyzed. …”
    Get full text
    Article
  17. 237

    Cross-Layer Path Configuration for Energy-Efficient Communication over Wireless Ad Hoc Networks by Hong-Chuan Yang, Kui Wu, Wu-Sheng Lu

    Published 2007-01-01
    “…Numerical results demonstrate that the path configuration methods can either significantly reduce the average energy consumption per packet delivery or considerably extend the average lifetime of the multihop route.…”
    Get full text
    Article
  18. 238

    Routing optimization method based on GPCR for vehicular Ad Hoc network by Zhiru GU, Min LI, Yonghong LONG, Xiaohua SHU, Qing RONG

    Published 2020-07-01
    “…To improve the performance in sparse networks,local optimum,and routing loop in the greedy perimeter coordinator routing (GPCR) protocol,the weighted-GPCR (W-GPCR) protocol was proposed.The relationship between vehicle node routing and other parameters such as the Euclidean distance between node pairs,moving direction and density was profoundly analyzed,the composite parameter weighted model was established and the calculation method was designed for the existing routing problems,the weighted parameter ratio was selected adaptively in different scenarios,so as to obtain the optimal next-hop relay node.In order to verify the performance of the W-GPCR method,the proposed method was compared with the existing methods such as the traditional geographic perimeter stateless routing (GPSR) protocol,GPCR and so on,and the results show that the proposed method is superior to the package delivery ratio,end-to-end delay,and average hop count.…”
    Get full text
    Article
  19. 239

    Research on Deep Integration of the “Belt and Road” Aviation Network Based on Community Structure from the Perspective of China by Hongguang Yao, Huihui Xiao

    Published 2023-01-01
    “…They not only have the largest number of key nodes but also the lowest repetition rate of the key nodes. …”
    Get full text
    Article
  20. 240