Computer Science and Automation (CSA): Recent submissions
Now showing items 61-80 of 531
-
New algorithm for linear tree pattern matching
Tree pattern matching is foundational to a wide variety of applications in Computer Science. We consider the problem of linear tree pattern matching and adopt a technique used for parsing context-free languages for this ... -
Deterministic parsing algorithm for classes beyond CFLs
Deterministic parsing strategies for subclasses of the so-called mildly context-sensitive languages are proposed. Mildly context-sensitive languages are generated by k-level grammars and have parsing algorithms of time ... -
Genetic algorithms: novel models and fitness -based adaptive disruption strategies
Genetic Algorithms are robust search and optimization methods that have emerged to be effective for a variety of real-world problems. They are stochastic, iterative techniques based on a population of evolving solutions, ... -
Supercombinator based implementation of lazy functional programming languages
Functional languages are becoming popular for the ease of programming that they facilitate. The implementation of a class of these languages is described. A method for compile-time detection of potential garbage in one ... -
Intelligent backtracking in logic programming.
Logic programming languages are being used extensively in the Fifth Generation Computer Project and in the areas of artificial intelligence, knowledge representation, expert systems and other reasoning systems. One very ... -
Integrated analytical models for parallel and distributed computing systems
Analytical modelling plays an important role in the design and development of parallel and distributed computing systems. In this context, Product Form Queueing Networks (PFQNs) and Generalized Stochastic Petri Nets (GSPNs) ... -
Automata constructions and decision procedures for metric temporal logic
Linear-Time Temporal Logic (LTL) [Pnu77] and its timed variant Metric Temporal Logic (MTL) [Koy90] are popular ways of specifying and reasoning about qualitative and quantitative behaviours of systems. In this thesis, we ... -
On the expressiveness of metric temporal logic
Temporal Logics are a popular formalism for specification of properties in the verification of reactive systems. They can be employed to reason about the behavior of systems with the evolution of time. For example, one can ... -
Predictive modelling for migration within a secondary storage level
Current high-end systems used in web and database servers utilize large storage capacities. Despite the annual decline in disk drive prices, the cost of the storage system now accounts for about 30% to 40% of the total ... -
Design of pattern classifiers using optimization techniques
Of the various approaches to the design of pattern classifiers, those that depend on a given finite set of patterns have received considerable attention in the literature. These approaches fall into two categories depending ... -
Studies in learning and representation in connectionist networks
This work deals with questions related to learning and representation in connectionist networks. The main issue taken up in learning is the convergence of local learning rules for feedforward networks. We ask the following ... -
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 ... -
Referral reward embedded bi-phase information diffusion technique for social networks
Social networks provide an effective marketing platform to enhance the visibility of a business by reaching out to a wide base of potential customers cutting across gaps of geographic locations, age groups, and socio-economic ... -
Hadwiger number and the cartesian product operation on graphs
Abstract page scanned and attached as separate attachment -
Towards complete automatic code generation
A compiler consists of two phases: source program analysis and object program synthesis. The problem of compilation has been tackled in depth, and many tools and techniques exist for building the analysis phase. Similar ... -
LiWA : a lightweight agent framework for distributed systems
In the world of mobile computing, agent-based systems present one of the most promising areas of research in distributed systems. Component-based architecture is a new paradigm that is ideal for developing agent frameworks, ... -
Formal tools for specification-driven protocol design of distributed computing systems
The widespread use of Distributed Computing Systems (DCSs) is due to the advantages of better performance, improved reliability, efficient resource sharing and easy upgradability. In order to realize the advantages of a ... -
Effective optimization techniques for a parallel file system
Effective Optimization Techniques for a Parallel File System by Raghvendran M Significant work has been done in evolving parallel I/O architectures, I/O interfaces, and other programming techniques. However, only a few ... -
Design and implementation of a multidimensional multilink multicomputer hardware and software
In this thesis, we propose and implement a multidimensional multilink system (MMS) architecture which uses message passing paradigm between computing elements (CEs). The merits of this architecture are its simplicity, regularity ... -
SAFIUS - A secure accountable filesystem over untrusted storage
With storage data requirements growing at around 40% every year, the entities that control the data are different from entities that consume the data. The drastic growth in storage requirements and the ubiquitous accessibility ...