Index Catalog // ScholarsArchive@OSU

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

Enhancing Resolution and Scalability of Power Grid Reliability Algorithms

Creator:: Lassetter, Austin R.
Abstract:: This Thesis aims to determine whether we can improve the accuracy, resolution, and speed of calculations for common power system problems using simple computational models that scale well to machine learning and high performance computing solutions. The second chapter of this Thesis implements more precise aging and degradation models for...
Resource Type:: Masters Thesis
Full Text:: . . . . . . . . . . . . . . . . . . . . . . . . . . . 38 2 Raw Data Preprocessing . . . . . . . . . . . . . . . . . . . . . . . . 38 3 K-means algorithm

Information-theoretic Approach to Design and Evaluate Privacy-preserving and Fair Frameworks for Continuous High-dimensional Data

Creator:: Alsulaimawi, Zahir Ahmed Hussein
Abstract:: Deep learning is becoming the latest trend in sensitive applications, such as healthcare, criminal justice, and finance. As these new applications emerge, adversaries are circumventing them. Further, there have been concerns about the possibility of bias and discrimination in predictive applications. In order to address these issues, we propose an...
Resource Type:: Dissertation
Full Text:: of training iterations do 2: for k steps do • Sample minibatch of m noise samples { z(1), . . . ,z

Global Hierarchical Control of a Park of Spar Buoy-type Floating Oscillating Water Column Wave Energy Converters

Creator:: Gaebele, Daniel T.
Abstract:: Converting energy from ocean waves is a challenging area for control theory application because of the nonlinear dynamics in various time scales. Generally, wave energy converter (WEC) control is applied in order to maximize power absorption, in the most common wave conditions, and subject to the devices’ physical constraints. Commonly,...
Resource Type:: Dissertation
Full Text:: (regular) k rad/m angular repetency (wave number) ω rad/s angular wave frequency dw m water depth vp m

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

Information theoretic approach to quantization and classification for signal processing, communications, and machine learning applications

Creator:: Thuan Nguyen D.
Abstract:: There are five main contributions of this dissertation. The first contribution is new closed-form expressions for channel capacity of a new class of channel matrices. The second contribution is the discovery of the structure for optimal binary quantizer and the associated methods for finding an optimal quantizer that maximizes mutual...
Resource Type:: Dissertation
Full Text:: is the discovery of the structure for an optimal K-ary quantizer that maximizes the mutual

Process segmentation and modelling applied to time series featuring the response of biological materials to toxic agents

Creator:: Teng, Angela
Abstract:: The detection of biological and chemical toxins has become one of the main concerns in environmental and military fields. In this framework, the department of Microbiology and Biochemistry at Oregon State University has discovered that fish living cells are promising indicators of the presence of a wide range of toxins....
Resource Type:: Masters Thesis
Full Text:: series Y, segmentation produces the best representation using an undefined number K of segments, such

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

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

ScholarsArchive@OSU

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

Enhancing Resolution and Scalability of Power Grid Reliability Algorithms

Information-theoretic Approach to Design and Evaluate Privacy-preserving and Fair Frameworks for Continuous High-dimensional Data

Global Hierarchical Control of a Park of Spar Buoy-type Floating Oscillating Water Column Wave Energy Converters

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

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

Information theoretic approach to quantization and classification for signal processing, communications, and machine learning applications

Process segmentation and modelling applied to time series featuring the response of biological materials to toxic agents

Structuring Teachable Knowledge through Program-Concept Classifications

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

Limit your search

Academic Affiliation

Advisor

Commencement Year

Committee Member

Creator

Contributor

Date

Decade

Degree Field

Degree Level

Degree Name

File Format

Language

License

Non-Academic Affiliation

Peer Reviewed

Resource Type

Rights Statement

Subject

Search Constraints

Search Results

Limit your search