Showing 341 - 360 results of 1,116 for search 'Node average', query time: 0.17s Refine Results
  1. 341

    Energy-Efficient User Association Strategy for Hyperdense Heterogeneous Networking in the Fifth Generation Systems by Lei Li, Hao Jin, Zhipeng Yan, Changqing Yang, Yong Wu

    Published 2015-01-01
    “…To characterize that densely deployed LPNs would undertake a majority of high-rate services, while HPNs mainly support coverage; the EE metric is defined as average weighted EE of access nodes with the unit of bit per joule. …”
    Get full text
    Article
  2. 342

    Analysis of the diagnostic efficacy of digital mammography by V. I. Apanasevich, L. A. Kulyk, E. V. Roshchina, O. M. Zagrudinova, G. A. Shtitelman, V. S. Shevchuk

    Published 2016-09-01
    “…An average node size was 2.12 ± 0.19 cm, which corresponds to T2 category.…”
    Get full text
    Article
  3. 343

    A Temperature Field Based Routing Algorithm in Content-Centric Networking by Zonghai Liu, Peng Wang, Xiaohui Zhang, Feicai Jin

    Published 2015-12-01
    “…This scheme introduced the conception of temperature fields in physics into CCN and applied a finite element method(FEM), which is one of numerical analysis techniques, to assign a temperature value to each node of CCN in a distributed way. Simulation results show that TFBR can adequately utilize the cache in CCN nodes and decrease the network average delay while improving the performance of load balancing.…”
    Get full text
    Article
  4. 344

    Reliable forwarding strategy based on multiple attribute decision-making in NDN-Ad Hoc networks by HAN Jiangping, WANG Haodong, YANG Jiayu, XUE Kaiping, LI Jian

    Published 2024-05-01
    “…A multi-attribute decision-making method was utilized as the foundation for this strategy, with consideration given to link duration, distances between nodes, and content accessibility. This enabled a more precise selection of the optimal forwarding node, thereby enhancing the content transmission performance. …”
    Get full text
    Article
  5. 345

    Variability Analysis of Ferroelectric FinFETs for Embedded Non-Volatile Memory Applications by Byeongju Ha, Dongyeong Kim, Taekhan Yoon, Sola Woo

    Published 2025-01-01
    “…As a result, the FeM-FinFET can reduce variability by an average of 12.4% compared to the Fe-FinFET structure and by an average of 55% compared to the one-sided FeM-FinFET structures.…”
    Get full text
    Article
  6. 346

    ALRD: AoA Localization with RSSI Differences of Directional Antennas for Wireless Sensor Networks by Jehn-Ruey Jiang, Chih-Ming Lin, Feng-Yi Lin, Shing-Tsaan Huang

    Published 2013-03-01
    “…We apply ALRD to a WSN in a 10 × 10  m indoor area with two beacon nodes installed at two corners of the area. Our experiments demonstrate that the average localization error is 124 cm. …”
    Get full text
    Article
  7. 347

    Breeding report of a new ornamental peach cultivar Fenyujiaoxiang by SUN Yining, MA Hongping, QIAO Yuxuan, YUE Changping, JIAO Xuehui, SHI Xibing

    Published 2025-02-01
    “…The starting node bearing flower buds is at the 3rd to 4th node, and the average number of flowers on a single branch is 11. …”
    Get full text
    Article
  8. 348

    Distributed energy efficient unequal clustering algorithm for wireless sensor networks by SHANG Feng-jun1, Mehran Abolhasan2, Tadeusz Wysocki3

    Published 2009-01-01
    “…Firstly, when tentative clusterheads are selected, an average energy factor was introduced to balance the residual energy of the whole network nodes so that it may improve the network energy efficiency. …”
    Get full text
    Article
  9. 349

    Indoor dynamic environment lo calization algorithm based on transfer learning by Can LIU, Junna SHANG, Ruijiang LI, Keqiang YUE

    Published 2018-08-01
    “…The accuracy of the traditional indoor fingerprint lo calization system is limited bymany factors,such as the density of the reference location node in the fingerprint database and the characteristics of the indoor environment.When the indoor environment changes dynami cally,the RSS fluctuates,and usually does notmeet the assumption of the same distribution.Therefore,it was difficult to obtain high-precision requirements for conventional fingerprint positioningmethod.Aiming at the problem that the traditional algorithm couldn’t locate accurately,an algorithm based on the indoor fingerprint database was designed and implemented.The algorithm adopted the idea ofmigration learning to embed different data sets into the latent feature space,and the adverse effects of environmental changes on the system weremitigated.The simulation results show that the average positioning error of this algorithm is 1.23m.…”
    Get full text
    Article
  10. 350

    SSRC:source rate control algorithm for delay-sensitive flow in data center network by Yang YANG, Min CAO, Jiahai YANG, Rong CHE, Wei LIU

    Published 2019-07-01
    “…Previous work had studied how to ensure the transmission time of delay-sensitive flows,but falled short in its effectiveness for a given period.Motivated by that and based on SDN/OpenFlow framework,a SDN-based source rate control (SSRC) algorithm was proposed.With a global view of network,SSRC can quickly locate the potential congestion node,adjust the transmission rate of source and reduce the response time of SSRC.The experiment results show that compared with DCTCP and other algorithms,SSRC can shorten the completion time of flows by 75% in average,which can ensure the transmission time of delay-sensitive and solve the problem of Incast well.…”
    Get full text
    Article
  11. 351

    An improved distance vector-Hop localization algorithm based on coordinate correction by Xing Wang, Yunfeng Nie

    Published 2017-11-01
    “…Coordinates correction-distance vector-Hop defines the pseudo-range error factor to improve the accuracy of average hop distance. In order to improve the localization accuracy, the unknown node uses distances to part of anchor nodes to locate. …”
    Get full text
    Article
  12. 352

    Social-based routing in pocket switched networks by AOJiu-xin C, HENGao-jun C, ANGJing Y, HUZi-qing Z, IUBo L

    Published 2015-05-01
    “…In pocket switched network,how to make effective balance between the message delivery ratio and transmis-sion delay is a problem to be solved.A community-based PSN routing algorithm,named BridgingCom,is proposed.It uses local community detection method with aging mechanism and introduces the bridging centrality as the basis of for-warding decisions.The algorithm combines the analysis of node centrality with the structure of social mobile network,makes full use of the community relationship and activeness of nodes in PSN.Simulation results show that BridgingCom routing algorithm has better performance in the message delivery ratio and message average delay compared to a number of previously proposed algorithms.…”
    Get full text
    Article
  13. 353

    Deployment strategy for static chargers in WRSN by Hao HE, Yong-rui CHEN, Wei-dong YI, Ming LI

    Published 2017-10-01
    “…The traditional deployment strategy of static chargers in wireless rechargeable sensor networks (WRSN) covers all the area.The basic idea is to cover all the positions of nodes.A mathematical model of distance between a charger and the farthest node was established,the relationship between the number of nodes and the mathematical expectation of minimum radius of charging was analyzed,and deployment strategy for static chargers was proposed.The method based on the locations of all nodes that need to be charged in the area,used the smallest enclosing circle (SEC) algorithm and finds the optimal location of the charger through Euclidean delivery boy algorithm.It will decrease charging radius,reduce the minimum required transmitted power,thereby saving the average charging energy consumption.The experimental results demonstrated that the less the number locations that the nodes existed,the more energy will be saved.…”
    Get full text
    Article
  14. 354

    Reactive Power Optimization of a Distribution Network Based on Graph Security Reinforcement Learning by Xu Zhang, Xiaolin Gui, Pei Sun, Xing Li, Yuan Zhang, Xiaoyu Wang, Chaoliang Dang, Xinghua Liu

    Published 2025-07-01
    “…Experiments conducted on real load profiles demonstrated that the proposed method reduced the voltage violation rate to 0%, compared to 4.92% with the Deep Deterministic Policy Gradient (DDPG) algorithm and 5.14% with the Twin Delayed DDPG (TD3) algorithm. Moreover, the average node voltage deviation was effectively controlled within 0.0073 per unit.…”
    Get full text
    Article
  15. 355

    Traffic flow prediction based on spatial-temporal multi factor fusion graph convolutional networks by Ying-Ting Chen, An Liu, Cheng Li, Shuang Li, Xiao Yang

    Published 2025-04-01
    “…Only considering the interaction influence of limited surrounding nodes on the target node fails to effectively characterize the joint spatial-temporal correlation; (2) receptive field limitation: the existing graph convolution network model may cause the network node features to be too smooth and lose the original information when analyzing the spatial features extracted by the filter used in the traffic flow data. …”
    Get full text
    Article
  16. 356

    Exploring systemic effects of the friendship paradox on social network participation by Ahmed Medhat, Shankar Iyer

    Published 2024-12-01
    “…Abstract The friendship paradox states that, on average, people have fewer friends than their friends do. …”
    Get full text
    Article
  17. 357
  18. 358

    Research on multi dimensional feature extraction and recognition of industrial and mining solid waste images based on mask R-CNN and graph convolutional networks by Shuqin Wang, Na Cheng, Yan Hu

    Published 2025-04-01
    “…The experimental results showed that this method performed well in both processing speed and accuracy, with an average processing time of 108.9 ms, an average accuracy of 96.33%, and an average F1 score of 95.87%. …”
    Get full text
    Article
  19. 359

    Computation Offloading Strategy Based on Improved Polar Lights Optimization Algorithm and Blockchain in Internet of Vehicles by Yubao Liu, Bocheng Yan, Benrui Wang, Quanchao Sun, Yinfei Dai

    Published 2025-06-01
    “…Simulation results show that the strategy significantly reduces the average task processing latency (64.4%), the average system energy consumption (71.1%), and the average system overhead (75.2%), and at the same time effectively extends the vehicle’s power range, improves the real-time performance of the emergency accident warning and dynamic path planning, and significantly reduces the cost of edge computing usage for small and medium-sized fleets, providing an efficient, secure, and stable collaborative computing solution for IoV.…”
    Get full text
    Article
  20. 360

    Solution for Solving Dynamic Partial Differential Equation Model of Natural Gas Pipeline Network Based on Discretization and Linearization by Peiyao ZHAO, Zhengshuo LI

    Published 2025-03-01
    “…The average error in the simulation of a simple pipeline network is 0.279 4%, and the time is 37.285 seconds. …”
    Get full text
    Article