Search
Now showing items 51-60 of 203
Autonomous Spacecraft Mission Planning And Execution In A Petri Net Framework
(2014-08-01)
Presently, most spacecraft are controlled from ground involving activities such as up-linking the schedule of daily operations and monitoring health parameters. These activities lead to a cognitive overload on human ...
Precise Analysis of Private And Shared Caches for Tight WCET Estimates
(2017-10-31)
Worst Case Execution Time (WCET) is an important metric for programs running on real-time systems, and finding precise estimates of a program’s WCET is crucial to avoid over-allocation and wastage of hardware resources and ...
A GPU Accelerated Tensor Spectral Method for Subspace Clustering
(2017-11-30)
In this thesis we consider the problem of clustering the data lying in a union of subspaces using spectral methods. Though the data generated may have high dimensionality, in many of the applications, such as motion ...
Power Issues in SoCs : Power Aware DFT Architecture and Power Estimation
(2018-01-10)
Test power, data volume, and test time have been long-standing problems for sequential scan based testing of system-on-chip (SoC) design. The modern SoCs fabricated at lower technology nodes are complex in nature, the ...
Morse-Smale Complexes : Computation and Applications
(2018-01-30)
In recent decades, scientific data has become available in increasing sizes and
precision. Therefore techniques to analyze and summarize the ever increasing
datasets are of vital importance. A common form of scientific ...
Designing Energy-Aware Optimization Techniques through Program Behaviour Analysis
(2018-02-18)
Green computing techniques aim to reduce the power foot print of modern embedded devices with particular emphasis on processors, the power hot-spots of these devices. In this thesis we propose compiler-driven and profile-driven ...
Effective Automatic Computation Placement and Data Allocation for Parallelization of Regular Programs
(2018-02-15)
Scientific applications that operate on large data sets require huge amount of computation power and memory. These applications are typically run on High Performance Computing (HPC) systems that consist of multiple compute ...
On Learning k-Parities and the Complexity of k-Vector-SUM
(2018-02-06)
In this work, we study two problems: first is one of the central problem in learning theory of learning sparse parities and the other k-Vector-SUM is an extension of the not oriousk-SUM problem. We first consider the problem ...
Matching Domain Model with Source Code using Relationships
(2018-01-30)
We address the task of mapping a given domain model (e.g., an industry-standard reference model) for a given domain (e.g., ERP), with the source code of an independently developed application in the same domain. This has ...
Variants and Generalization of Some Classical Problems in Combinatorial Geometry
(2018-02-18)
In this thesis we consider extensions and generalizations of some classical problems
in Combinatorial Geometry. Our work is an offshoot of four classical problems in
Combinatorial Geometry. A fundamental assumption in these ...