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 30 for “"MESSAGE COMPLEXITY"”.

  1. Exploring the effect of news message complexity on cognitive complexity and attitude extremity

    … presented in a news story influences cognitive complexity and attitude extremity. I hypothesized that a news message featuring more than two perspectives – a complex story - would lead to an increase in cognitive complexity, defined as the number of elements a person associates with an issue …

    missouri Repository record for Exploring the effect of news message complexity on cognitive complexity and attitude extremity (opens in a new tab)

  2. Applications of a Novel Sampling Technique to Fully Dynamic Graph Algorithms

    … of a graph with $n$ nodes, with worst case message complexity $\tilde{O}(n)$ per edge insertion or deletion where messages are of size $O(\text{polylog}(n))$. For each node $v$ we require memory of size $\tilde{O}(degree(v))$ bits. This improves upon the best previous algorithm with respect …

    uvic Repository record for Applications of a Novel Sampling Technique to Fully Dynamic Graph Algorithms (opens in a new tab)

  3. Secure and Efficient BFT Consensus for Blockchains

    … in blockchain networks is $n\times n$ message complexity. With a large network size $n$, we will have a quadratic number of messages and transmission and processing of such a large number of messages can cause a performance bottleneck. There have been proposals to improve the message …

    lsu-thes Repository record for Secure and Efficient BFT Consensus for Blockchains (opens in a new tab)

  4. Cellular distributed and parallel computing

    … performance in terms of their worst-case time complexity and message complexity. Given any n-node graph with maximum degree Delta, the expected time complexity of our improved distributed MIS selection algorithm is O(log n) and the message complexity per node is O(1). The expected time …

    oxford Repository record for Cellular distributed and parallel computing (opens in a new tab)

  5. Leader election in distributed networks using agent based self-stabilizing technique

    … agents sometime help in reducing the message complexity of the system and sometimes help in lowering time complexity. In a more practical sense, agents perform operations independent of the processors, thereby lending a more flexible algorithm supporting different types of networks.

    tamu Repository record for Leader election in distributed networks using agent based self-stabilizing technique (opens in a new tab)

  6. Election and termination detection in specialized communication structures.

    … networks is to investigate the effect on the message complexity of the election algorithms when N the size of the complete network is composite. Specifically, it is shown that when N is a multiple of 2, 3, 4, 5, or 6, the message complexity of the existing election algorithm for the complete …

    ottawa-retro Repository record for Election and termination detection in specialized communication structures. (opens in a new tab)

  7. A Survey of Network Coding and Applications

    … in distributed systems which broadcasts a message to all nodes in the network. NC-Flooding is introduced, which uses network coding to possibly decrease the message complexity and/or time complexity of flooding.

    unlv Repository record for A Survey of Network Coding and Applications (opens in a new tab) Download PDF for A Survey of Network Coding and Applications (opens in a new tab)

  8. Data aggregation using peer to peer network and dynamic directed graph operation

    … network and epidemic algorithms to disseminate messages among all nodes to solve a problem cooperatively. A caller node chooses its neighbor, as a called node, randomly in every round to send and receive messages. Push transmission occurs when a message is sent from the caller node to the called …

    freiburg-diss Repository record for Data aggregation using peer to peer network and dynamic directed graph operation (opens in a new tab)

  9. Distributed trigger counting algorithms

    … the processor nodes and all of the in-transit messages of a distributed computation. This is meaningful as it corresponds to the global state where all the local states and communication channels of all the processor nodes in the system are recorded simultaneously. A classic example where …

    texas Repository record for Distributed trigger counting algorithms (opens in a new tab)

  10. Achieving Efficiency, Robustness, and Security in Distributed Computing

    … systems. We begin with a study of the \emph{message complexity} of the \emph{leader election} problem in diameter-two networks. We first give a simple randomized Monte-Carlo leader election algorithm that with high probability\footnote{Throughout this dissertation, we would use ``eith high …

    houston Repository record for Achieving Efficiency, Robustness, and Security in Distributed Computing (opens in a new tab)

  11. Provisioning end-to-end quality of service for real-time interactive video over software-defined networking

    … to application programmable interface. The message complexity of VSDN is linear. In research second area, this thesis presents Explicit Routing in Software-Defined Networking (ERSDN), a routing scheme that selects transit routers at the edge of network. This thesis presents the design and …

    iupui Repository record for Provisioning end-to-end quality of service for real-time interactive video over software-defined networking (opens in a new tab)

  12. Generic Attacks on Hash Functions

    … function. In this thesis, we concentrate on the complexity of the diamond structure and its application in the herding attack. We review the analysis done by Kelsey and Kohno and point out a subtle flaw in their analysis. We propose a correction of their analysis and based on our revised …

    waterloo Repository record for Generic Attacks on Hash Functions (opens in a new tab)

  13. On the use of randomness extractors for practical committee selection

    … Agreement that only costs sub-quadratic message complexity. Most importantly, we make no cryptographic assumptions such as the Random Oracle assumption and the existence of private channels. However, we do assume the network to be peer-to-peer, where a message receiver knows who the …

    uvic Repository record for On the use of randomness extractors for practical committee selection (opens in a new tab)

  14. Two algorithms for leader election and network size estimation in mobile ad hoc networks

    … processors (“nodes”) which communicate via message passing over wireless links. Each node can communicate directly with other nodes within a specified transmission radius; other communication is accomplished via message relay. Communication links may go up and down in a MANET (as nodes move …

    tamu Repository record for Two algorithms for leader election and network size estimation in mobile ad hoc networks (opens in a new tab)

  15. Lorikeet: an efficient multicast protocol for the distribution of multimedia streams.

    … created by algorithms of considerably higher message complexity, such as those that employ exhaustive searches of the tree during joins. We develop the Lorikeet protocol from a set of requirements based on its target application and the properties of the current Internet. After describing the …

    adelaide Repository record for Lorikeet: an efficient multicast protocol for the distribution of multimedia streams. (opens in a new tab)

  16. Gesture-Based Icon Messages: Examining the Effects of a Nonverbal Transparency Strategy for Supporting Situation Awareness in Human-Autonomy Communication

    … (SA). This research examines gesture-based icon messages (GIMs) as a transparency strategy to address challenges present in human-autonomy communication (HAC). Drawing from Endsley’s (1995) three-level model of SA, GIMs were designed to convey different types of information: perception, …

    clemson Repository record for Gesture-Based Icon Messages: Examining the Effects of a Nonverbal Transparency Strategy for Supporting Situation Awareness in Human-Autonomy Communication (opens in a new tab)

  17. Distributed broadcast and minimum spanning tree algorithms with low communication complexity

    … Processors can communicate by exchanging messages of limited size over links available on a predetermined communication network. In this thesis, we consider the problems of broadcast and minimum spanning tree construction in a distributed setting. These problems are of fundamental …

    uvic Repository record for Distributed broadcast and minimum spanning tree algorithms with low communication complexity (opens in a new tab)

  18. Parsimonious Service Replication for Tolerating Malicious Attacks in Asynchronous Environments

    … overall resource use of request execution, (2) message complexity of atomic broadcast, and (3) latency degree of atomic broadcast. We then present a suite of group management protocols that allow for the dynamic change of the composition of the replication group. Our parsimonious protocols are …

    uiuc Repository record for Parsimonious Service Replication for Tolerating Malicious Attacks in Asynchronous Environments (opens in a new tab)

  19. Robust distributed data aggregation

    … graph theory), that are updated using idempotent messages, providing it with unique robustness capabilities. Experimental results showed that Flow Updating outperforms previous averaging algorithms in terms of time and message complexity, and unlike them it self adapts to churn and changes of the …

    minho-thes Repository record for Robust distributed data aggregation (opens in a new tab)

Page 1 of 2