Computer Science and Automation (CSA): Recent submissions
Now showing items 181-200 of 377
-
Algorithms for Product Pricing and Energy Allocation in Energy Harvesting Sensor Networks
(2018-05-09)In this thesis, we consider stochastic systems which arise in different real-world application contexts. The first problem we consider is based on product adoption and pricing. A monopolist selling a product has to appropriately ... -
Algorithmic and Combinatorial Questions on Some Geometric Problems on Graphs
(2018-05-08)This thesis mainly focuses on algorithmic and combinatorial questions related to some geometric problems on graphs. In the last part of this thesis, a graph coloring problem is also discussed. Boxicity and Cubicity: These ... -
Efficient Algorithms for Structured Output Learning
(2018-05-08)Structured output learning is the machine learning task of building a classifier to predict structured outputs. Structured outputs arise in several contexts in diverse applications like natural language processing, computer ... -
Outlier Detection with Applications in Graph Data Mining
(2018-04-24)Outlier detection is an important data mining task due to its applicability in many contemporary applications such as fraud detection and anomaly detection in networks, etc. It assumes significance due to the general ... -
Improving Last-Level Cache Performance in Single and Multi-Core Processsors
(2018-04-23)With off-chip memory access taking 100's of processor cycles, getting data to the processor in a timely fashion remains one of the key performance bottlenecks in current systems. With increasing core counts, this problem ... -
Model-Checking in Presburger Counter Systems using Accelerations
(2018-04-18)Model checking is a powerful technique for analyzing reach ability and temporal properties of finite state systems. Model-checking finite state systems has been well-studied and there are well known efficient algorithms ... -
Identification and Quantification of Important Voids and Pockets in Proteins
(2018-04-05)Many methods of analyzing both the physical and chemical behavior of proteins require information about its structure and stability. Also various other parameters such as energy function, solvation, hydrophobic/hydrophilic ... -
Transducer-based Algorithmic Verification of Retransmission Protocols over Noisy Channels
(2018-04-05)Unreliable communication channels are a practical reality. They add to the complexity of protocol design and verification. In this work, we consider noisy channels which can corrupt messages. We present an approach to model ... -
Rainbow Colouring and Some Dimensional Problems in Graph Theory
(2018-04-05)This thesis touches three different topics in graph theory, namely, rainbow colouring, product dimension and boxicity. Rainbow colouring An edge colouring of a graph is called a rainbow colouring, if every pair of vertices ... -
Constructing Provably Secure Identity-Based Signature Schemes
(2018-04-03)An identity-based cryptosystem (IBC) is a public-key system where the public key can be represented by any arbitrary string such as an e-mail address. The notion was introduced by Shamir with the primary goal of simplifying ... -
A Theoretical Study of the Synergy and Lazy Annotation Algorithms
(2018-04-03)Given a program with assertions, the assertion checking problem is to tell whether there is an execution of the program that violates one of the assertions. One approach to this problem is to explore different paths towards ... -
Investigations on CPI Centric Worst Case Execution Time Analysis
(2018-03-19)Estimating program worst case execution time (WCET) is an important problem in the domain of real-time systems and embedded systems that are deadline-centric. If WCET of a program is found to exceed the deadline, it is ... -
Improving the Precision of a Scalable Demand-Driven Null- Dereference Verification for Java
(2018-03-19)The problem addressed in this thesis is sound, scalable, demand-driven null-dereference verification for Java programs via over-approximated weakest preconditions analysis. The base version of this analysis having been ... -
Reconstruction of 3D Neuronal Structures
(2018-03-17)Microscopic analysis of biological structures can be significantly enhanced by representing the object of study as a three-dimensional entity. To assist neurobiologists investigate the molecular mechanisms involved in ... -
Construction of Secure and Efficient Private Set Intersection Protocol
(2018-03-17)Private set intersection(PSI) is a two party protocol where both parties possess a private set and at the end of the protocol, one party (client) learns the intersection while other party (server) learns nothing. Motivated ... -
Parameterized Complexity of Maximum Edge Coloring in Graphs
(2018-03-09)The classical graph edge coloring problem deals in coloring the edges of a given graph with minimum number of colors such that no two adjacent edges in the graph, get the same color in the proposed coloring. In the following ... -
An Optimizing Code Generator for a Class of Lattice-Boltzmann Computations
(2018-03-09)Lattice-Boltzmann method(LBM), a promising new particle-based simulation technique for complex and multiscale fluid flows, has seen tremendous adoption in recent years in computational fluid dynamics. Even with a ... -
A Systems Perspective of Software Runtime Bloat - Origin, Mitigation and Power-Performance Implications
(2018-03-08)Large flexible software systems tend to incur “bloat”, here defined as the runtime overhead induced by the accumulation of excess functionality and objects. Removing bloat is hard as these overheads are a side-effect of ... -
Online Learning and Simulation Based Algorithms for Stochastic Optimization
(2018-03-07)In many optimization problems, the relationship between the objective and parameters is not known. The objective function itself may be stochastic such as a long-run average over some random cost samples. In such cases ... -
Automatic Storage Optimization of Arrays Affine Loop Nests
(2018-03-01)Efficient memory usage is crucial for data-intensive applications as a smaller memory footprint ensures better cache performance and allows one to run a larger problem size given a axed amount of main memory. The solutions ...