Numerical Analysis and Scientific Computing Commons^™

Academic Hats And Ice Cream: Two Optimization Problems, Valery F. Ochkov, Yulia V. Chudova

Journal of Humanistic Mathematics

This article describes the use of computer software to optimize the design of an academic hat and an ice cream cone!

Dynamic Nonlinear Gaussian Model For Inferring A Graph Structure On Time Series, Abhinuv Uppal

CMC Senior Theses

In many applications of graph analytics, the optimal graph construction is not always straightforward. I propose a novel algorithm to dynamically infer a graph structure on multiple time series by first imposing a state evolution equation on the graph and deriving the necessary equations to convert it into a maximum likelihood optimization problem. The state evolution equation guarantees that edge weights contain predictive power by construction. After running experiments on simulated data, it appears the required optimization is likely non-convex and does not generally produce results significantly better than randomly tweaking parameters, so it is not feasible to use in …

Complex Ciliary Flows Around Stentor Polymorphus In Solutions Of 2% Buttermilk And Chlamydomonas Reinhardtii, Eliana B. Smithstein

Scripps Senior Theses

Stentor are large, unicellular ciliates of the Heterotricha order. They live in both freshwater and marine habitats and are mostly found in ponds. I studied Stentor polymorphus, which is a species of Stentor only recently discovered to be lab culturable. They range from 0.5-1.5mm in length and are unusual because they live with endosymbiotic algae and are much more likely than other, more widely studied, species of Stentor to form aggregates while they are eating. There are three main components to this thesis: First, I established protocols for keeping a viable S. polymorphus culture, since no protocols had been …

Snap Scholar: The User Experience Of Engaging With Academic Research Through A Tappable Stories Medium, Ieva Burk

CMC Senior Theses

With the shift to learn and consume information through our mobile devices, most academic research is still only presented in long-form text. The Stanford Scholar Initiative has explored the segment of content creation and consumption of academic research through video. However, there has been another popular shift in presenting information from various social media platforms and media outlets in the past few years. Snapchat and Instagram have introduced the concept of tappable “Stories” that have gained popularity in the realm of content consumption.

To accelerate the growth of the creation of these research talks, I propose an alternative to video: …

On Cluster Robust Models, José Bayoán Santiago Calderón

CGU Theses & Dissertations

Cluster robust models are a kind of statistical models that attempt to estimate parameters considering potential heterogeneity in treatment effects. Absent heterogeneity in treatment effects, the partial and average treatment effect are the same. When heterogeneity in treatment effects occurs, the average treatment effect is a function of the various partial treatment effects and the composition of the population of interest. The first chapter explores the performance of common estimators as a function of the presence of heterogeneity in treatment effects and other characteristics that may influence their performance for estimating average treatment effects. The second chapter examines various approaches …

Randomized Algorithms For Preconditioner Selection With Applications To Kernel Regression, Conner Dipaolo

HMC Senior Theses

The task of choosing a preconditioner M to use when solving a linear system Ax=b with iterative methods is often tedious and most methods remain ad-hoc. This thesis presents a randomized algorithm to make this chore less painful through use of randomized algorithms for estimating traces. In particular, we show that the preconditioner stability || I - M^-1A ||_F, known to forecast preconditioner quality, can be computed in the time it takes to run a constant number of iterations of conjugate gradients through use of sketching methods. This is in spite of folklore which …

Triple Non-Negative Matrix Factorization Technique For Sentiment Analysis And Topic Modeling, Alexander A. Waggoner

CMC Senior Theses

Topic modeling refers to the process of algorithmically sorting documents into categories based on some common relationship between the documents. This common relationship between the documents is considered the “topic” of the documents. Sentiment analysis refers to the process of algorithmically sorting a document into a positive or negative category depending whether this document expresses a positive or negative opinion on its respective topic. In this paper, I consider the open problem of document classification into a topic category, as well as a sentiment category. This has a direct application to the retail industry where companies may want to scour …

Computational Progress Towards Maximum Distinguishability Of Bell States By Linear Evolution And Local Measurement, Victor Shang

HMC Senior Theses

Many quantum information protocols rely on the ability to distinguish between entangled quantum states known as Bell states. However, theoretical limits exist on the maximal distinguishability of these entangled states using linear evolution and local measurement (LELM) devices. In the case of two particles entangled in multiple qubit variables, the maximum number of distinguishable Bell states is known. However, in the more general case of two particles entangled in multiple qudit variables, only an upper bound is known under additional assumptions. I have written software in Matlab and Mathematica to explore computationally the maximum number of Bell states that can …

Using A Data Warehouse As Part Of A General Business Process Data Analysis System, Amit Maor

CMC Senior Theses

Data analytics queries often involve aggregating over massive amounts of data, in order to detect trends in the data, make predictions about future data, and make business decisions as a result. As such, it is important that a database management system (DBMS) handling data analytics queries perform well when those queries involve massive amounts of data. A data warehouse is a DBMS which is designed specifically to handle data analytics queries.

This thesis describes the data warehouse Amazon Redshift, and how it was used to design a data analysis system for Laserfiche. Laserfiche is a software company that provides each …

Kaczmarz Algorithm With Soft Constraints For User Interface Layout, Noreen Jamil, Deanna Needell, Johannes Muller, Christof Lutteroth, Gerald Weber

CMC Faculty Publications and Research

The Kaczmarz method is an iterative method for solving large systems of equations that projects iterates orthogonally onto the solution space of each equation. In contrast to direct methods such as Gaussian elimination or QR-factorization, this algorithm is efficient for problems with sparse matrices, as they appear in constraint-based user interface (UI) layout specifications. However, the Kaczmarz method as described in the literature has its limitations: it considers only equality constraints and does not support soft constraints, which makes it inapplicable to the UI layout problem.

In this paper we extend the Kaczmarz method for solving specifications containing soft constraints, …

Using Correlated Subset Structure For Compressive Sensing Recovery, Atul Divekar, Deanna Needell

CMC Faculty Publications and Research

Compressive sensing is a methodology for the reconstruction of sparse or compressible signals using far fewer samples than required by the Nyquist criterion. However, many of the results in compressive sensing concern random sampling matrices such as Gaussian and Bernoulli matrices. In common physically feasible signal acquisition and reconstruction scenarios such as super-resolution of images, the sensing matrix has a non-random structure with highly correlated columns. Here we present a compressive sensing recovery algorithm that exploits this correlation structure. We provide algorithmic justification as well as empirical comparisons.

Mixed Operators In Compressed Sensing, Matthew A. Herman, Deanna Needell

CMC Faculty Publications and Research

Applications of compressed sensing motivate the possibility of using different operators to encode and decode a signal of interest. Since it is clear that the operators cannot be too different, we can view the discrepancy between the two matrices as a perturbation. The stability of L1-minimization and greedy algorithms to recover the signal in the presence of additive noise is by now well-known. Recently however, work has been done to analyze these methods with noise in the measurement matrix, which generates a multiplicative noise term. This new framework of generalized perturbations (i.e., both additive and multiplicative noise) extends the prior …