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 5719 for “"COMPUTATIONS"”.
-
Toward seamless multiscale computations
Efficient and robust numerical simulation of multiscale problems encountered in science and engineering is a formidable challenge. Full resolution of multiscale problems using direct numerical simulations requires enormous amounts of computational time and resources. This thesis develops seamless …
-
Transforming Sparse Matrix Computations
Sparse matrix computations are at the heart of many scientific applications and data analytics codes. The performance and memory usage of these codes depend heavily on their use of specialized sparse matrix data structures that only store the nonzero entries. However, such compaction is done using …
-
Automatic Scaling Iterative Computations
… these platforms are ill-fitted for iterative computations due to their ignorance of resident data and enforcement of "embarrassingly parallel" batch-style processing of data sets within every computational operators. To address these challenges we propose a set of methods that leverage certain …
-
Streaming Computations in Feldspar
We present a library for expressing digital signal processing algorithms using a deeply embedded language in Haskell. It is an extension Feldspar's stream library, which provides a data type for infinite sequences of values. Until now, streams have been confined to a set of explicit functions for …
-
Algorithms for analyzing parallel computations
Predicate detection is a powerful technique to verify parallel programs. Verifying correctness of programs using this technique involves two steps: first we create a partial order based model, called a computation, of an execution of a parallel program, and then we check all possible global states …
-
Techniques for analyzing distributed computations
Inherent non-determinism in distributed programs and presence of multiple threads of control makes it difficult to write correct distributed software. Not surprisingly, distributed systems are particularly vulnerable to software faults. To build a distributed system capable of tolerating software …
-
Predicate detection for parallel computations
… part introduces Loset — a new model for parallel computations with locking constraints. We show that the reachability problem in a loset is NP-complete. To tackle the NP-completeness, we present several useful properties. Specifically, if the final global state is reachable, then all lock-free …
-
Correspondence computations in visual cognition
… to investigate the role of object correspondence computations in visual cognition. Correspondence computations refer, here, to algorithms that identify relationships between objects in temporally separate encounters. In Experiment 1-5, I hypothesized that tracking failures occur because of …
-
Matrix Computations on TensorCore GPU
The emergence of neural engines such as Nvidia TensorCore GPU brings a revolution to deep neural networks, as the neural engines can perform extremely fast general matrix multiplications. However, how to deploy other algorithms or applications on neural engines remains questionable. In this …
-
Efficient computations in Galois fields
In this dissertation some algorithms and related hardware structures for computing division and multiplication over finite or Galois fields are presented. The structures are regular, which is important for hardware realization, particularly for large finite fields. The concept of supporting …
-
MULTI-SCALE MODELING AND COMPUTATIONS
In the rarefied gas dynamics, the classic kinetic models are more accurate and complicated, while the fluid models are much simpler but fail in some cases. In this thesis, we propose a new local up-scaling model to couple Euler equations with the kinetic model when the previous up-scaling model in …
-
Efficient Computations of Interesting Paths
Given a high dimensional dataset and a function of interest, the Mapper algorithm outputs a topologically accurate summary. This summary helps identify subpopulations, which motivates the use of this algorithm for data mining. Continuing the work on interesting paths by Kalyanaraman, Kamruzzaman …
-
Large sparse least squares computations
<p>Orthogonal Givens factorization is a popular method for solving large sparse least squares problems. Row and column permutations of the data matrix are necessary to preserve sparsity, and reduce the computational effort during factorization. The computation of a solution is usually divided into …
-
Normal mode computations and applications
<p>Proteins are fundamental functional units in cells. Proteins form stable and yet somewhat flexible 3D structures and often function by interacting with other molecules. Their functional behaviors are determined by their 3-D structures as well as their flexibilities. In this thesis, I focus my …
-
Tools For Hard Bayesian Computations
Each of the three chapters included here attempts to meet a different computing challenge that presents itself in the context in Bayesian statistics. The first deals with the difficulty of evaluating the computationally-expensive likelihood functions that arise from models that include Gaussian …
-
Tensor computations with dimensionality manipulations
Methodologies that ensure the compressibility of tensors are introduced. Bounds on the storage costs with respect to various tensor formats are derived. A new algorithm combining data-sparse tensor formats and factored alternating direction implicit method is designed to solve Sylvester tensor …
-
Force computations in automated docking
<p>Automated docking refers to the problem of computing the optimal complementary fit of two molecules---a macromolecular receptor such as DNA or protein and a small molecule of interest (ligand). AutoDock is a docking software that computes the receptor-ligand binding energy to rank docked …
-
Unambiguous logarithmic space bounded computations
… we study the power of unambiguous log-space computations (denoted as UL) and whether it is general enough to contain all of nondeterministic log-space (denoted as NL). This leads us to the study of the graph reachability problem, which is known to exactly capture the complexity of NL, and …
-
An Environment for Imprecise Computations
This thesis is concerned with the problem of providing operating system support to flexible real-time applications with end-to-end deadlines and of integrating checkpointing and rollback recovery with flexible applications as a means to increase the availability and dependability of real-time …
Page 1 of 286