Search Constraints

Start Over
Filtering by: Creator Whelan, Jean K. Remove constraint Creator: Whelan, Jean K. Degree Field Computer Science Remove constraint Degree Field: Computer Science

Search Results

  • Linda-Smalltalk : parallel implementation of Little Smalltalk using tuple space communication of Linda

    Creator:
    Chung, Jean H.
    Abstract:
    A new technique of implementing the object-oriented language Little Smalltalk is developed using tuple space communication of Linda. In this implementation, the language's abstract constructs such as object, class, and method are naturally mapped into tuple space. Since Linda's tuple space is designed to facilitate parallel processing, this implementation technique...
    Resource Type:
    Capstone Project
    Full Text:
    : Parallel Implementation of Little Smalltalk Using Tuple Space Communication of Linda Jean H. Chung

  • Java style guide and pretty-printer

    Creator:
    Speton, Jean-Guy
    Abstract:
    The Java programming language is a recent entry in the family of object-oriented languages and like all new languages has yet to achieve widespread standardization of coding styles for the unique aspects it possesses. This paper and project address this issue by presenting a complete and rationalized style guide for...
    Resource Type:
    Capstone Project
    Full Text:
    Jean-Guy Speton Dept . of Computer Science Oregon State University Corvallis, OR, 97331 speton

  • Partitioning-Guided K-Means for Effective Empty Cluster Resolution in Extreme Model Compression

    Creator:
    Huang, Tianhong
    Abstract:
    Compactness in deep learning can be critical to a model’s viability in low-resource applications, and a common approach to extreme model compression is quantization. We consider Iterative Product Quantization (iPQ) with Quant-Noise [Fan et al., 2020] to be state-of-the-art in this area, but this quantization framework suffers from preventable inference...
    Resource Type:
    Masters Thesis
    Full Text:
    degree of Master of Science in Computer Science presented on May 31, 2023. Title: Partitioning-Guided K

  • Computing Bounded Chains and Surfaces in a Simplicial Complex with Bounded-treewidth 1-skeleton

    Creator:
    Black, Mitchell
    Abstract:
    We consider three problems on simplicial complexes: the Optimal Bounded Chain Problem, the Optimal Homologous Chain Problem, and 2-Dim-Bounded-Surface. The Optimal Bounded Chain Problem asks to find the minimum weight d-chain in a simplicial complex K bounded by a given (d−1)-chain, if such a d-chain exists. The Optimal Homologous Chain...
    Resource Type:
    Masters Thesis
    Full Text:
    find the minimum weight d-chain in a simpli- cial complex K bounded by a given (d−1)-chain, if such a

  • Communication-Efficient Secure Two-Party Computation From Minicrypt and OT

    Creator:
    Roy, Lawrence
    Abstract:
    Secure two-party computation (2PC) is the task of performing arbitrary calculations on secret inputs provided by two parties, while maintaining secrecy if at least one party is honest. 2PC has been applied to privacy-preserving record linkage and machine learning, in areas such as medicine where maintaining privacy is crucial. One...
    Resource Type:
    Dissertation
    Full Text:
    requires λ bits of communication for each OT, SoftSpokenOT only needs λ/k bits, for any k, at the

  • Structuring Teachable Knowledge through Program-Concept Classifications

    Creator:
    Wilson, Benjamin F.
    Abstract:
    Teaching CS is a challenging task, especially for those without prior programming experience. Even for veteran educators, having to learn CS concepts while also trying to teach those same concepts is difficult; as is the case for many K-12 CS instructors. Unfortunately, there is often no formalized order with CS...
    Resource Type:
    Masters Thesis
    Full Text:
    ; as is the case for many K-12 CS instructors. Unfortunately, there is often no formalized order with

  • Resource placement, data rearrangement, and Hamiltonian cycles in torus networks

    Creator:
    Bae, Myung Mun
    Abstract:
    Many parallel machines, both commercial and experimental, have been/are being designed with toroidal interconnection networks. For a given number of nodes, the torus has a relatively larger diameter, but better cost/performance tradeoffs, such as higher channel bandwidth, and lower node degree, when compared to the hypercube. Thus, the torus is...
    Resource Type:
    Dissertation
    Full Text:
    . The last part of the thesis gives results on generating edge disjoint Hamilto­ nian cycles in k-ary n

  • Efficient Comparative Sequence Analysis Algorithms for RNA Conserved Structure and Region Detection

    Creator:
    Li, Sizhen
    Abstract:
    RNAs play important roles in multiple cellular processes, and many of their functions rely on folding to specific structures. To maintain their functions, secondary structures of RNA homologs are conserved across evolution. These conserved structures provide critical targets for diagnostics and therapeutics. Thus, there is a need for developing fast...
    Resource Type:
    Dissertation
    Full Text:
    approach is that the Sankoff algorithm runs in O(n3k) against averaged sequence length n and k sequences

  • Efficient Public Key Cryptography Frameworks for Emerging IoT Applications

    Creator:
    Ozmen, Muslum Ozgur
    Abstract:
    Internet of Things (IoT) is an integral part of application domains such as smart-home, digital healthcare, smart grid systems and vehicular networks. Various standard public key cryptography techniques (e.g., key exchange, public key encryption, digital signature) are available to provide fundamental security services for IoTs. However, despite their pervasiveness and...
    Resource Type:
    Masters Thesis
    Full Text:
    Authentication with Aggregate Signatures (FAAS), which can transform any single-signer (k-element extraction

  • Awgsome Fault Injection: In-Depth Analysis of Waveform Generation for Voltage Glitches

    Creator:
    Lyakhov, Stanislav
    Abstract:
    Voltage fault injection is a technique to disrupt power supply, such that the data or instruction flow in a microcontroller can be modified. Recently, a new class of voltage glitches was introduced termed arbitrary wave voltage glitches. Despite its demonstrated success in practical studies it comes with additional challenges, such...
    Resource Type:
    Masters Thesis
    Full Text:
    𝑘 > 1 points (𝑥1, 𝑦1), (𝑥2, 𝑦2), . . . , (𝑥𝑘 , 𝑦𝑘 ) such that every 𝑥𝑖 is unique, there