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 36 for “"composability"”.

  1. Protein potentials and domains : re-use and composability

    Protein-protein interactions are one of the cornerstones of biological processes throughout the cell. Unfortunately, lack of available data precludes many possible approaches to modeling these fundamental interactions at scale. This thesis focuses on a specific set of protein domains, known as …

    mit Repository record for Protein potentials and domains : re-use and composability (opens in a new tab)

  2. Performance composability: An emerging challenge in performance-adaptive systems

    … The problem essentially lies in performance composability or lack thereof; a challenge that arises because individual optimizations in performance-sensitive systems generally do not compose well when combined. Performance adaptation in such systems needs to be carefully designed and …

    uiuc Repository record for Performance composability: An emerging challenge in performance-adaptive systems (opens in a new tab)

  3. Error-free message transmission in the universal composability framework

    … for error-free communication in the Universal Composability framework. Realizing these functionalities enables protocols to make use of cryptographic error-correcting schemes which are more powerful than classical codes. First, we define new ideal functionalities TrCLOSE and FCWT to model …

    mit Repository record for Error-free message transmission in the universal composability framework (opens in a new tab)

  4. On Black-Box Complexity and Adaptive, Universal Composability of Cryptographic Tasks

    … multiparty computation (MPC) in the Universal Composability (UC) model that are secure against malicious, adaptive adversaries. In the standard model, security is only guaranteed in a stand-alone setting; however, nothing is guaranteed when multiple protocols are arbitrarily composed. In …

    columbia-diss Repository record for On Black-Box Complexity and Adaptive, Universal Composability of Cryptographic Tasks (opens in a new tab)

  5. Semantic Web Enabled Composition of Web Services

    … thrusts: semantic description of Web services, composability of participant services, and generation of composite service descriptions. This dissertation deals with the aforementioned research issues. We first propose an ontology-based framework for organizing and describing semantic Web …

    vt Repository record for Semantic Web Enabled Composition of Web Services (opens in a new tab)

  6. Incrementally verifiable computation or knowledge implies time/space efficiency

    … time/space efficiency and the new criterion of composability. We deduce the existence of our proposed proof system by way of a natural new assumption about proofs of knowledge. In fact, a main contribution of our result is showing that knowledge can be "traded" for time and space efficiency in …

    mit Repository record for Incrementally verifiable computation or knowledge implies time/space efficiency (opens in a new tab)

  7. A calculus for composable, computational cryptography

    The universal composability (UC) framework is the established standard for analyzing cryptographic protocols in a modular way, such that security is preserved under concurrent composition with arbitrary other protocols. However, although UC is widely used for on-paper proofs, prior attempts at …

    uiuc Repository record for A calculus for composable, computational cryptography (opens in a new tab)

  8. Building a Distributed Transaction Processing System Using DARQ

    … related to fault tolerance, resilience, and composability. Composable Resilient Steps (CReSt) and its implementation, Deduplicated Asynchronously Recoverable Queues (DARQ), provide an abstraction to address these challenges by separating application logic from resilience mechanisms. This …

    mit Repository record for Building a Distributed Transaction Processing System Using DARQ (opens in a new tab)

  9. HyFlow: A High Performance Distributed Software Transactional Memory Framework

    … deadlocks, livelocks, and scalability and composability challenges. These problems are exacerbated in distributed systems due to their distributed versions which are more complex to cope with (e.g., distributed deadlocks). STM and D-STM are promising alternatives to lock-based and …

    vt Repository record for HyFlow: A High Performance Distributed Software Transactional Memory Framework (opens in a new tab)

  10. Implementing a Tiled Singular Value Decomposition: A Framework for Tiled Linear Algebra in Julia

    … and multi-use frameworks by allowing composability. Utilizing a tiled approach, the implemented framework improves data locality, parallelism, and scalability, making it well-suited for modern heterogeneous environments. Its practical benefits are demonstrated through the …

    mit Repository record for Implementing a Tiled Singular Value Decomposition: A Framework for Tiled Linear Algebra in Julia (opens in a new tab)

  11. Globally Synchronized Frames for guaranteed Quality-of-Service in shared memory systems

    … to achieve better hardware efficiency and composability towards end-to-end QoS than component-wise QoS approaches. Finally, we propose the METERG (MEasurement Time Enforcement and Runtime Guarantee) QoS framework.

    mit Repository record for Globally Synchronized Frames for guaranteed Quality-of-Service in shared memory systems (opens in a new tab)

  12. Cryptographic Simulation Techniques with Applications to Quantum Zero-Knowledge and Copy-Protection

    … QPoK with desirable properties needed for composability. The technique combines Watrous’ rewinding with a recently studied cryptographic tool, statistical receiver-private oblivious transfer. This is the first construction of QPoK with the desired composability features. We also introduce a …

    mit Repository record for Cryptographic Simulation Techniques with Applications to Quantum Zero-Knowledge and Copy-Protection (opens in a new tab)

  13. Verifiable compilation of I/O automata without global synchronization

    … the constraints on these definitions, the composability requirements for the components of a composite automaton, and the transformation a definition of a composite automaton into a definition of an equivalent primitive automaton.

    mit Repository record for Verifiable compilation of I/O automata without global synchronization (opens in a new tab)

  14. Cooperative hierarchical resource management for efficient composition of parallel software

    … software environments to provide bolt-on composability - without changing a single line of the original application code. Lithe can also serve as the foundation for building new parallel abstractions and runtime systems that automatically interoperate with one another. We have built and …

    mit Repository record for Cooperative hierarchical resource management for efficient composition of parallel software (opens in a new tab)

  15. Fast and Scalable Subgraph Learning

    … and the model architecture—but at the cost of composability, creating tightly coupled systems that slow further development. This thesis introduces MOSAIC, a lightweight data transformation that reframes subgraph classification as nodewise prediction by augmenting the graph with representative …

    mit Repository record for Fast and Scalable Subgraph Learning (opens in a new tab)

  16. Flexible memory protection for multicore processors

    … the performance, reliability, security, and composability of the software it runs. Desirable features of an access control mechanism include: the ability to grant arbitrary permissions on any region of memory to any thread in the system; zero-copy sharing between threads with no restrictions …

    uiuc Repository record for Flexible memory protection for multicore processors (opens in a new tab)

  17. Principles for the design and construction of synthetic circuits utilizing protein-protein interactions in Saccharomyces cerevisiae

    … with protein devices are created. To illustrate composability, two systems are engineered in yeast, the first of which interfaces a phosphorylation load driver within flanking transcriptional regulatory modules to mitigate retroactivity, exemplifying time-scale separation as a means of realizing …

    mit Repository record for Principles for the design and construction of synthetic circuits utilizing protein-protein interactions in Saccharomyces cerevisiae (opens in a new tab)

  18. Learning to Plan by Learning Rules

    … modified version of value iteration. We achieve composability by building off of a hierarchical reinforcement learning (HRL) framework called the options framework, in which low-level options can be composed arbitrarily. And lastly, we achieve data-efficient learning by integrating our HRL …

    mit Repository record for Learning to Plan by Learning Rules (opens in a new tab)

  19. Tinkering with ScratchBit : explorations in blended making

    … to engage in blended making. With an emphasis on composability, the ScratchBit allows almost any material -- such as cardboard, dolls, sneakers, or even swing sets - to be transformed into a physical interface for projects created with the Scratch visual programming language. This thesis presents …

    mit Repository record for Tinkering with ScratchBit : explorations in blended making (opens in a new tab)

  20. HyflowCPP: A Distributed Software Transactional Memory Framework for C++

    … deadlocks, livelocks, non-scalability, non-composability), which are aggravated in a distributed environment due to the complexity of multi-node concurrency. At its core, DTM's atomic section-based synchronization abstraction enables the execution of a sequence of multi-node object …

    vt Repository record for HyflowCPP: A Distributed Software Transactional Memory Framework for C++ (opens in a new tab)

Page 1 of 2