Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 27 for “"average path length"”.

  1. Critical Node Identifcation for accessing network vulnerability, a necessary consideration

    … participation of a node in forming the shortest path route. The Banzhaf power index is inspired from the theory of voting games in game theory whereas, the diversity index is inspired from the analysis and understanding of the influence of the average path length of a network on its performance. …

    city-london Download PDF for Critical Node Identifcation for accessing network vulnerability, a necessary consideration (opens in a new tab)

  2. Física estatística aplicada a sistemas sociais através do estudo de redes complexas

    … such as aggregation coefficient, minimum average path length and connectivity distribution. Based on these quantities, it can be stated that surnames networks are an example of complex network, showing important features such as preferential attachment and small-world character

    brazil-ufrn Repository record for Física estatística aplicada a sistemas sociais através do estudo de redes complexas (opens in a new tab)

  3. A multi-microcomputer intercommunication structure and multi-tasking algorithm

    … multiple microcomputer systems is described. The average path length through such structures was computed, and the results were used as a measure of performance. Other characteristics such as flexibility, locality and complexity were also considered. An experimental dual-processor configuration …

    iastate Repository record for A multi-microcomputer intercommunication structure and multi-tasking algorithm (opens in a new tab)

  4. Dinâmica e estrutura de redes complexas no modelo de afinidade

    … show by numerical simulations results for the average path length and for the clustering coefficient

    brazil-ufrn Repository record for Dinâmica e estrutura de redes complexas no modelo de afinidade (opens in a new tab)

  5. An Examination of the Fuzzy Inference System on Probabilistic Roadmap Path Planning

    … Probability roadmap (PRM) is a typical path planning algorithm that can determine an optimal trajectory once the robot start and goal positions are specified. However, when the number of robots in the system increases, it converges slowly and may even fail to find the solution. In this …

    calpoly Repository record for An Examination of the Fuzzy Inference System on Probabilistic Roadmap Path Planning (opens in a new tab)

  6. FLOC-SPANNER: An O(1) time, locally self-stabilizing algorithm for geometric spanner construction in a wireless sensor network

    … is verified using large scale simulations. The average path length ratio for routing along the spanner for large networks is shown to be less than 2.;Geometric Spanners is a well-researched topic. The algorithm presented in this thesis differs from other spanner algorithms in the following ways: …

    wvu Repository record for FLOC-SPANNER: An O(1) time, locally self-stabilizing algorithm for geometric spanner construction in a wireless sensor network (opens in a new tab)

  7. A PERFORMANCE EVALUATION OF MILLIMETER-WAVE CELLULAR NETWORKS WITH USER MOBILITY

    … seen by a mobile user traveling over a path at constant and varying speeds. We have obtained the cumulative information received by the user as a function of its path length for different blocking intensities and cell sizes. The results show that while the received information rate …

    concordia Download PDF for A PERFORMANCE EVALUATION OF MILLIMETER-WAVE CELLULAR NETWORKS WITH USER MOBILITY (opens in a new tab)

  8. Throughput and Latency in Reconfigurable Networks

    … the fact that routing becomes more costly when average path length is not an integer, since equalizing the path lengths is not achievable. We show that in order to guarantee the throughput value, Valiant load balancing is necessary, which lengthens routing paths by a factor of two. However, we …

    cornell Repository record for Throughput and Latency in Reconfigurable Networks (opens in a new tab)

  9. Virtualization And Self-organization For Utility Computing

    … resilience to congestion, small diameter, and average path length. Constrains such as limits on the cost of per unit of service, total cost, or the requirement to use only “green" computing cycles are then considered when a node of this overlay network decides whether to join the virtual cloud …

    ucf Repository record for Virtualization And Self-organization For Utility Computing (opens in a new tab)

  10. Delay Sensitive Routing For Real Time Traffic Over Ad-hoc Networks

    … across the network. The selection of the path along which a packet is forwarded from the source node to the destination node is done by the routing algorithm. Most commonly used routing algorithms, though effective for non-real time applications, cannot handle real-time applications that …

    ucf Repository record for Delay Sensitive Routing For Real Time Traffic Over Ad-hoc Networks (opens in a new tab)

  11. The global organization and topological properties of Drosophila melanogaster

    … It is found that the topological parameters of average path length and diameter show a two-fold and three-fold increase on the deletion of hubs for the protein-protein interaction and metabolic interaction network, respectively. The arbitrary exclusion of the nodes does not show any remarkable …

    sask Repository record for The global organization and topological properties of Drosophila melanogaster (opens in a new tab)

  12. Simulation of reactor pulses in fast burst and externally driven nuclear assemblies

    … flux values through the use of view factor and average path length calculations. The neutron transport code is also capable of modeling the highly anisotropic neutron transport of deuterium-tritium fusion external source neutrons using diffusion theory with the aid of a modified first collision …

    texas Repository record for Simulation of reactor pulses in fast burst and externally driven nuclear assemblies (opens in a new tab)

  13. Architecture-independent distributed query processing

    … how logarithmic performance with regard to the average path length and the transmission costs in the distributed system is possible. To further enhance our understanding of this process, we have also performed a number of controlled experiments through simulation. A standard benchmark (TPC-H) is …

    fu-berlin Repository record for Architecture-independent distributed query processing (opens in a new tab)

  14. Graph theory analysis of functional and structural connectome: Links to Auditory Processing Disorder

    … precentral gyrus based on network measures of average path length (APL) and betweenness centrality, respectively. In Study 1, the APD group showed a positive correlation in the left parahippocampal gyrus between PC and Spatial advantage performance on the LiSN-S task. In contrast, in Study 2, …

    auckland-ms Repository record for Graph theory analysis of functional and structural connectome: Links to Auditory Processing Disorder (opens in a new tab)

  15. Ανάλυση και επεξεργασία ιατρικών δεδομένων

    … of graph-theory connectivity metrics such as the average path length, the clustering coefficient, the local and global efficiency, the hubs and the small world properties were explored/investigated. The findings of the latter analysis demonstrated that patients had clearly a disruption of the …

    greece Repository record for Ανάλυση και επεξεργασία ιατρικών δεδομένων (opens in a new tab)

  16. Variational approximation for importance sampling and statistical inference on social influence

    … with a high clustering coefficient and a low average path length. We generalize the regular Erd\H{o}s-R\'enyi dyadic random graph by considering higher-order motif, which is triadic graph. We show some properties of our proposed model, analyze the probability of multi-edges, and compare the …

    uiuc Repository record for Variational approximation for importance sampling and statistical inference on social influence (opens in a new tab)

  17. Key words for learning science: the structure of students' sign networks in mechanics

    … is similar. The networks are sparse, have short average path lengths and low average degree, and high clustering. However, the connections (microstructure) between signs are different in the physics and psychology networks. These structural features suggest conceptual development is guided by a …

    oxford Repository record for Key words for learning science: the structure of students' sign networks in mechanics (opens in a new tab)

  18. Global connectivity, information diffusion, and the role of multilingual users in user-generated content platforms

    … by language, but also that there is a small average path length between any two people on most Internet platforms (including two speakers of different languages). If so, multilingual users may play critical roles as bridges or brokers on these platforms by connecting clusters of monolingual …

    oxford Repository record for Global connectivity, information diffusion, and the role of multilingual users in user-generated content platforms (opens in a new tab)

Page 1 of 2