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 34 for “"Completion problems"”.
-
Solving correlation matrix completion problems using parallel differential evolution
Matrix Completion problems have been receiving increased attention due to their varied applicability in different domains. Correlation matrices arise often in studying multiple streams of time series data like technical analysis of stock market data. Often some of the values in the matrix are …
-
Code Puzzle Completion Problems in Support of Learning Programming Independently
… a method known to support independent learning: completion problems. Through this exploration, I developed code puzzle completion problems and an introductory curriculum introducing novice programmers to basic programming constructs. Through several evaluations, I demonstrate that code puzzle …
-
A graph neural network approach to interval and box graph completion problems
Interval and box graph editing/completion problems are interesting in the field of graph theory, whose aim is to transform an arbitrary graph into an interval or box graph by adding or removing edges, with a minimum number of such modifications. There are many existing algorithms that make use of …
-
Training Teachers to Differentiate Instruction to Address Work Completion Problems in Math
… confirm significant improvements in student work completion or accuracy. Teachers’ ability to generalize training to a case example was also measured with mixed results. Limitations in terms of teacher training and environmental conditions are examined. Areas for future research are discussed.
-
A Comparison of Zero-History & Continuing Groups in Two Communication Networks
… and zero-history groups solved sentence-completion problems in two communication networks: the comcon and the wheel. Oral communication was utilized and all problem solving sessions were tape recorded for analysis. Analysis of variance revealed that the comcon network was significantly …
-
Completion of partial operator matrices
This work concerns completion problems for partial operator matrices. A partial matrix is an m-by-n array in which some entries are specified and the remaining are unspecified. We allow the entries to be operators acting between corresponding vector spaces (in general, bounded linear operators …
-
Methods for matrix completion
… to provide major results for two sorts of Matrix Completion problems. One involves the recovery of a low rank matrix and the other involves the recovery of an approximately low rank matrix based on a small number of observed entries. In the end of the paper, we are going to demonstrate the …
-
Fixed Point Iteration Algorithms for Low-rank Matrix Completion
A lot of applications can be formulated as matrix completion problems. In order to address such problems, a common assumption is that the underlying matrix is (approximately) low-rank. Under certain conditions, the recovery of low-rank matrix can be done via nuclear norm minimization, a convex …
-
Optimization Methods for Semi-Supervised Learning
… for many domains. In this thesis, we focus on problems where an underlying structure allows us to leverage the large amounts of unlabeled data, while only requiring small amounts of labeled data. In particular, we consider low-rank matrix completion problems with applications to recommender …
-
Structured eigenvectors, interlacing, and matrix completions
… structured eigenvectors, interlacing, and matrix completion problems. Although these are distinct topics, the structured eigenvector results provide connections.;It is a straightforward matrix calculation that if {dollar}\lambda{dollar} is an eigenvalue of A, x an associated structured eigenvector …
-
Structured and Sparse Signal Estimation - Fundamental Limits and Error Bounds
… this work focuses on noisy matrix estimation and completion problems. We consider the problem of estimating matrices that adhere to a "sparse-factor model" decomposition -- matrices that may be accurately described by a product of two matrices, one of which is sparse -- from noisy observations, …
-
Efficacy of Solution-focused Brief Counseling on Math Assignment Completion and Accuracy in an Elementary School
… six fifth grade students with math assignment completion problems. Weekly 30-minute sessions of SFBC for 5 weeks were sufficient to produce increases in both completion rates (from 29% completion during baseline to 79.63% during treatment) and accuracy rates (from 23.50% during baseline to …
-
Semidefinite Facial Reduction for Low-Rank Euclidean Distance Matrix Completion
… reduction for the Euclidean distance matrix completion problem. Our key result shows a close connection between cliques in the graph of the partial Euclidean distance matrix and faces of the semidefinite cone containing the feasible set of the semidefinite relaxation. We show how using …
-
Matrix Completion Models with Fixed Basis Coefficients and Rank Regularized Problems with Hard Constraints
The problems with embedded low-rank structures arise in diverse areas such as engineering, statistics, quantum information, finance and graph theory. This thesis is devoted to dealing with the low-rank structure via techniques beyond the widely-used nuclear norm for achieving better performance. In …
-
New Guassian Process Modeling for Low-Rank and Simulated Data
… distribution is utilized to avail matrix completion problems. The thesis is composed of the contributions made in these two directions, which include four research topics: (i) a new experimental design approach to multi-fidelity finite element simulations; (ii) a new conglomerate …
-
Obstructions for local tournament orientation completions
The orientation completion problem for a hereditary class C of oriented graphs asks whether a given partially oriented graph can be completed to a graph belonging to C. This problem was introduced recently and is a generalization of several existing problems, including the recognition problem for …
-
Exploiting Data-Dependent Structure for Improving Sensor Acquisition and Integration
… the theory, and proceed into its uses in matrix completion problems via convex optimization. The aim of this research is to prove that a general class of measurement operators, bounded norm Parseval frames, satisfy the necessary conditions for random subsampling and reconstruction. We then …
-
Error Bounds and Singularity Degree in Semidefinite Programming
… 0 and n-1, derived from facial reduction. For problems with small singularity degree, forward error is similar to backward error, but this may not be true for problems with large singularity degree. In this thesis we provide a method to obtain numerical lower bounds on forward error, thereby …
-
Topics in matrix completion and genomic prediction
… focused on low-rank modeling to deal with matrix completion problems and genomic prediction by adjusting spatial effects. One big challenge in matrix completion is that the real data arising are high-dimensional, low-rank and have many missing entries. In the first project (Chapter 2), we propose …
Page 1 of 2