Computer Science and Automation (CSA): Recent submissions
Now showing items 341-360 of 394
-
Using Explicit State Space Enumeration For Specification Based Regression Testing
(2010-07-08)Regression testing of an evolving software system may involve significant challenges. While, there would be a requirement of maximising the probability of finding out if the latest changes to the system has broken some ... -
Learning Algorithms Using Chance-Constrained Programs
(2010-07-08)This thesis explores Chance-Constrained Programming (CCP) in the context of learning. It is shown that chance-constraint approaches lead to improved algorithms for three important learning problems — classification with ... -
Compiler-Assisted Energy Optimization For Clustered VLIW Processors
(2010-04-13)Clustered architecture processors are preferred for embedded systems because centralized register file architectures scale poorly in terms of clock rate, chip area, and power consumption. Although clustering helps by ... -
Semi-Supervised Classification Using Gaussian Processes
(2010-03-26)Gaussian Processes (GPs) are promising Bayesian methods for classification and regression problems. They have also been used for semi-supervised classification tasks. In this thesis, we propose new algorithms for solving ... -
Time Management In Partitioned Systems
(2010-02-11)Time management is one of the critical modules of safety-critical systems. Applications need strong assurance from the operating system that their hard real-time requirements are met. Partitioned system has recently evolved ... -
Optimizations In Storage Area Networks And Direct Attached Storage
(2009-07-23)The thesis consists of three parts. In the first part, we introduce the notion of device-cache-aware schedulers. Modern disk subsystems have many megabytes of memory for various purposes such as prefetching and caching. ... -
A Mechanism Design Approach To Resource Procurement In Computational Grids With Rational Resource Providers
(2009-07-08)A computational grid is a hardware and software infrastructure that provides dependable, consistent, pervasive, and inexpensive access to high-end computational capabilities. In the presence of grid users who are autonomous, ... -
Superscalar Processor Models Using Statistical Learning
(2009-06-24)Processor architectures are becoming increasingly complex and hence architects have to evaluate a large design space consisting of several parameters, each with a number of potential settings. In order to assist in guiding ... -
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, ... -
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 ... -
Design Of Incentive Compatible Mechanisms For Ticket Allocation In Software Maintenance Services
(2009-05-28)Software Maintenance is becoming more and more challenging due to rapidly changing customer needs, technologies and need for highly skilled labor. Many problems that existed a decade ago continue to exist or have even ... -
Bounds On Augmented Automata And Quantum Adiabatic Optimization
(2009-05-25)Quantum computing has generated a lot of interested in the past two decades. Research into powerful models of quantum computation has yielded important and elegant results like an efficient algorithm for factoring and a ... -
Spill Code Minimization And Buffer And Code Size Aware Instruction Scheduling Techniques
(2009-05-19)Instruction scheduling and Software pipelining are important compilation techniques which reorder instructions in a program to exploit instruction level parallelism. They are essential for enhancing instruction level ... -
Computational Problems In Codes On Graphs
(2009-05-11)Two standard graph representations for linear codes are the Tanner graph and the tailbiting trellis. Such graph representations allow the decoding problem for a code to be phrased as a computational problem on the corresponding ... -
Hadwiger's Conjecture On Circular Arc Graphs
(2009-04-30)Conjectured in 1943, Hadwiger’s conjecture is one of the most challenging open problems in graph theory. Hadwiger’s conjecture states that if the chromatic number of a graph G is k, then G has a clique minor of size at ... -
Procurement Network Formation : A Cooperative Game Theoretic Approach
(2009-04-16)Complex economic activity often involves inter-relationships at several levels of production, often referred to as supply chains or procurement networks. In this thesis we address the problem of forming procurement networks ... -
Discovering Roles In The Evolution Of Collaboration Networks
(2009-04-02)Searching the Web involves more than sifting through a huge graph of pages and hyperlinks. Specific collaboration networks have emerged that serve domain-specific queries better by exploiting the principles and patterns ... -
Large Data Clustering And Classification Schemes For Data Mining
(2009-03-20)Data Mining deals with extracting valid, novel, easily understood by humans, potentially useful and general abstractions from large data. A data is large when number of patterns, number of features per pattern or both are ... -
Caching Techniques For Dynamic Web Servers
(2009-03-20)Websites are shifting from static model to dynamic model, in order to deliver their users with dynamic, interactive, and personalized experiences. However, dynamic content generation comes at a cost – each request ... -
Analysis And Design Of Image And Video Encryption Algorithms
(2009-03-19)The rapid growth in multimedia based Internet systems and applications like video telephony, video on demand, network based DVD recorders and IP television has created a substantial need for ...