Browsing Computer Science and Automation (CSA) by Title
Now showing items 128-147 of 394
-
Efficient Static Analyses for Concurrent Programs
(2018-06-29)Concurrent programs are pervasive owing to the increasing adoption of multi-core systems across the entire computing spectrum. However, the large set of possible program behaviors make it difficult to write correct and ... -
Efficient Usage Of Flash Memories In High Performance Scenarios
(2016-09-09)New PCI-e flash cards and SSDs supporting over 100,000 IOPs are now available, with several usecases in the design of a high performance storage system. By using an array of flash chips, arranged in multiple banks, large ... -
Efficient Whole Program Path Tracing
(2018-06-14)Obtaining an accurate whole program path (WPP) that captures a program’s runtime behaviour in terms of a control-flow trace has a number of well-known benefits, including opportunities for code optimization, bug detection, ... -
Embedding Networks: Node and Graph Level Representations
Graph neural networks gained significant attention for graph representation and classification in the machine learning community. For graph classification, different pooling techniques are introduced, but none of them has ... -
Enhancing Coverage and Robustness of Database Generators
Generating synthetic databases that capture essential data characteristics of client databases is a common requirement for enterprise database vendors. This need stems from a variety of use-cases, such as application testing ... -
An Environment for Automatic Generation of Code Optimizers
(Indian Institute of Science, 2005-03-11)Code optimization or code transformation is a complex function of a compiler involving analyses and modifications with the entire program as its scope. In spite of its complexity, hardly any tools exist to support this ... -
Equivalence test for the trace iterated matrix multiplication polynomial
An m-variate polynomial f is affine equivalent to an n-variate polynomial g if m > n and there is a full rank n * m matrix A and a n-dimensional vector b such that f(x) = g(Ax + b). Given blackbox access to f and g (i.e ... -
An Evaluation of Basic Protection Mechanisms in Financial Apps on Mobile Devices
This thesis concerns the robustness of security checks in financial mobile applications (or simply financial apps). The best practices recommended by OWASP for developing such apps demand that developers include several ... -
Expanders in Arithmetic Circuit Lower Bound : Towards a Separation Between ROABPs and Multilinear Depth 3 Circuits
Consider the problem of Polynomial Identity Testing(PIT): we are given an arithmetic circuit computing a multivariate polynomial over some eld and we have to determine whether that polynomial is identically zero or not. ... -
Experiences in using Reinforcement Learning for Directed Fuzzing
Directed testing is a technique to analyze user-specified target locations in the program. It reduces the time and effort of developers by excluding irrelevant parts of the program from testing and focusing on reaching ... -
Experimental Studies On A New Class Of Combinatorial LDPC Codes
(2009-06-05)We implement a package for the construction of a new class of Low Density Parity Check (LDPC) codes based on a new random high girth graph construction technique, and study the performance of the codes so constructed on ... -
Experiments with the pentium Performance monitoring counters
(Indian Institute of Science, 2005-02-11)Performance monitoring counters are implemented in most recent microprocessors. In this thesis, we describe various performance measurement experiments for a program and a system that we conducted on a Linux operating ... -
Experiments With Unix Process Schedulers
(2012-05-09) -
Explainable and Efficient Neural Models for Natural Language to Bash Command Translation
One of the key goals of Natural Language Processing is to make computers understand natural language. Semantic Parsing has been one of the driving tasks for Natural Language Understanding. It is formally defined as the ... -
An Explainable Hierarchical Class Attention Model for Legal Appeal Automation
Judicial systems worldwide are overburdened due to the limited number of legal professionals. The digitization of legal processes has resulted in abundant legal data, paving the way for the development of legal automation ... -
An Exploratory Framework for Cyclone Identification and Tracking
Analyzing depressions plays an important role in meteorology, especially in the study of cyclones. In particular, the study of the temporal evolution of cyclones requires a robust depression tracking framework. To cope ... -
Exploring Fairness and Causality in Online Decision-Making
Online decision-making under uncertainty is a fundamental aspect of numerous real-world problems across various domains, including online resource allocation, crowd-sourcing, and online advertising. Multi-Armed Bandits ... -
Exploring Welfare Maximization and Fairness in Participatory Budgeting
Participatory budgeting (PB) is a voting paradigm for distributing a divisible resource, usually called a budget, among a set of projects by aggregating the preferences of individuals over these projects. It is implemented ... -
Extending Program Analysis Techniques to Web Applications and Distributed Systems
Web-based applications and distributed systems are ubiquitous and indispensable today. These systems use multiple parallel machines for greater functionality, and efficient and reliable computation. At the same time they ... -
FA RCU: Fault Aware Read-Copy-Update
Deferred freeing is the fundamental technique used in Read-Copy-Update (RCU) synchronization technique where reclamation of resources is deferred until the completion of all active RCU read-side critical sections. We observe ...