Computer Science and Automation (CSA)
Recent Submissions
-
Concurrency control algorithms for database systems exploiting the semantics of read-only transactions.
This thesis proposes new locking-based concurrency control algorithms for both centralized and distributed databases. The concurrency control algorithms proposed exploit the semantics of read-only transactions to improve ... -
Pattern recognition via Fuzzy set methods
The main objective of this thesis is the development of a methodology based on fuzzy set theory for several practical pattern recognition problems. Pattern recognition (PR) encompasses a range of problems from feature ... -
Modelling program dynamics : A study on locality of reference
Locality of reference is a phenomenon exhibited by programs and computer systems in general, and refers to the tendency to localize operations to a small subset of the available resources. In the past, this phenomenon has ... -
Algorithms and characterizations for subclasses of planar perfect graphs
In this thesis, we consider two major subclasses of planar perfect graphs. We exploit certain decomposability and ordering properties to develop new characterizations and efficient algorithms. We study the Hamiltonian cycle ... -
Design of electronic exchanges through decomposition
Decomposition-Based Approaches for Clearing Electronic Exchanges Electronic marketplaces have emerged in recent times as the backbone of important e-commerce and e-business applications to create efficient markets for ... -
AMI-The language and its implementation
Automatic translation of sequential programs to parallel programs which can reasonably exploit distributed memory machines is very difficult and not well-understood. Programming with communication-based statements is very ... -
Nondeterminism and communication in functional progamming systems: a study in formal program development
In this thesis, a Relational Database Management System that supports a query/data manipulation language along with facilities like database creation is presented. A compiler model chosen for translating the input statements ... -
Monitoring program dynamics : Evaluation of software profiler effectiveness
Program monitoring tools are often used to verify program correctness, study program performance, and identify performance bottlenecks. Program profilers are a class of program monitoring tools which aid in tuning the ... -
Interaction paradigms for distributed object-oriented programming
Current trends in large-scale distributed programming on a network of workstations are experiencing a paradigm shift into object-orientation. This is primarily driven by the need for modular, compact, portable and reusable ... -
PEG: a programming environment generator
Integrated piogramming enviionments play an im portant role in making the software development process easier and more efficient. Since there exist a number of programming languages, it is necessary to provide programmers ... -
New techniques for the analysis of two and three dimensional objects
The results of an investigation carried out on certain pattern recognition aspects of a class of two-dimensional line drawings and three-dimensional objects are reported in this thesis. The motivation for the proposed ... -
Pattern classification using conjuctive conceptual clustering procedures
This thesis deals with the salient features of the conjunctive conceptual algorithm CLUSTER/2 and describes new algorithms based on conjunctive concepts to overcome some of the problems associated with CLUSTER/2. From a ... -
Secure ECom framework for small-communities
Universal reach of the web has made it possible for merchants to reach their customers, and vice versa, through what has now come to be referred as Electronic Commerce, or ecom in short. Despite admitting the new opportunities ... -
Learning subspace methods using weighted and multi-subspace representations
The learning subspace methods (LSMs) of classification are decision-theoretic pattern recognition methods where the primary model for a class is a linear subspace of the Euclidean pattern space. Classification is based on ... -
Techniques in The Markov Chain Monte Carlo Method
Consider the problem of sampling from a set of combinatorial objects according to a certain given distribution. The Markov chain Monte Carlo (MCMC) method is a possible solution for this problem. The method consists of ... -
Verification of information flow properties
Information flow properties are a way of specifying security properties of systems, that dates back to the work of Goguen and Meseguer [7] in the eighties. A system is viewed as generating traces containing “confidential” ... -
Approximation algorithms for the K- MST problem
Given a graph GGG on nnn vertices, the kkk-MST optimization problem is to find a tree spanning at least kkk vertices of GGG such that the cost of the tree is minimized over all such possible trees. The main contribution ... -
Sharable instructable agent for information filtering
This thesis presents a sharable instructable agent for information filtering. It also proposes the use of network-based collaboration in huge distributed communities of personalized agents. These agents carry out the tasks ... -
Computer generation and recognition of printed Telugu characters
The thesis is primarily concerned with two problems, namely, generation of Telugu characters and recognition of printed Telugu characters. In addition to the practical utility of generative schemes for pictorial patterns, ... -
Performance analysis of methods that overcome false sharing effects in software DSMs
Software Distributed Shared Memory (DSM) systems, which rely on virtual memory mechanisms to detect accesses to shared locations and maintain their consistency, support a sharing granularity of a page size, which is of the ...
RSS 1.0