Browsing Computer Science and Automation (CSA) by Title
Now showing items 171-190 of 559
-
Efficient Online Path Profiling
(2009-06-05)Most dynamic program analysis techniques such as profile-driven compiler optimizations, software testing and runtime property checking infer program properties by profiling one or more executions of a program. Unfortunately, ... -
Efficient Schemes for Improving the Performance of Clock Synchronization Protocols in Wireless Sensor Networks Using TDMA- based MAC Protocols
(2018-05-16)Clock synchronization in a wireless sensor network (WSN) is essential as it provides a consistent and a coherent time frame for all the nodes across the network. Typically, clock synchronization is achieved by message ... -
Efficient Schemes for Partitioning Based Scheduling of Real-Time Tasks in Multicore Architecture
The correctness of hard real-time systems depends not only on its logical correctness but also, on its ability to meet all its deadline. Existing real-time systems use either a pure real-time scheduler or a real-time ... -
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 ... -
Enhancing Privacy and Efficiency of Distributed Encryption
The primary objective of a distributed system is to eliminate reliance on a central authority. In a distributed encryption scheme, users should be able to generate their key materials independently while securely sharing ... -
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 ... -
Escape mechanism in bistable systems driven by strongly correlated noise
This thesis focuses on the analysis of nonlinear dynamical systems influenced by colored noise, which appears in diverse fields such as physics, chemistry, natural sciences, and engineering. The core problem involves solving ... -
Essays in applied combinatorics
Combinatorial mathematics concerns itself with the study of discrete structures and relations. It plays a crucial role in computer science, since digital computers manipulate discrete, finite objects. The study of algorithms, ... -
Estimation of software release times based on a queueing model for software testing
The development o f large-scale software systems is a complex and expensive process. The key to successful software projects is planning and estimation o f time frames for each phase o f the lifecycle. Testing plays a ... -
Evaluating cache performance under multiprogrammed workloads
Computer system performance is critically dependent on cache performance. Cache effectiveness is determined by factors such as program locality of reference and cache organization. Different approaches to cache performance ... -
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 ... -
Evolutionary design of plan based pattern recognition systems in complex domains
Many real-life Pattern Recognition (PR) problems do not fit into the classical PR paradigms. Such systems are currently being implemented using knowledge-based approaches. Designing such systems is an involved, evolutionary ... -
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 ...