A variety of different techniques for executing logic programs in parallel have been proposed. One common approach is to provide new language constructs for explicitly controlling the order in which goals execute. Languages containing such constructs include Concurrent Prolog[Shapiro 86], Parlog[Clark 86], and Epilog[Wise 82, Wise 86]. An alternative approach is to have the implementation sched...

Medial Axis Transform (MAT) is one of the promising tools used for the shape recognition and it poses the advantages like space and complexity reduction, ease of processing for shape recognition. MAT representation of shapes uses object centred co-ordinate system that represents bending, elongation and thickness. But MAT of the objects is very much sensitive to small perturbations of its bounda...

Compiling solver-independent constraint models to solver input typically involves flattening, the decomposition of complex expressions into simpler expressions, introducing additional variables and constraints. In previous work [8], we have informally proposed extending flattening problem instances with common subexpression elimination(CSE), a widespread optimisation technique that has not yet ...

With the high requirements of gene sequencing in the field of scientific research, it is essential to make faster sequencing process. The one of the main sequencing operation is done using Smith Waterman algorithm. This algorithm is used in two conventional ways to evaluate the matrix elements. They are i. Sequential processes ii. Conventional parallel processes. Since the work is to consider t...

We prove a version of the Ray-Chaudhuri–Wilson and Frankl–Wilson theorems for k-wise intersections and also generalize a classical code-theoretic result of Delsarte for k-wise Hamming distances. A set of code-words a; a; . . . ; ak of length n have k-wise Hamming-distance ‘; if there are exactly ‘ such coordinates, where not all of their coordinates coincide (alternatively, exactly n ‘ of their...

We prove a version of the Ray-Chaudhuri{Wilson and Frankl-Wilson theorems for kwise intersections and also generalize a classical code-theoretic result of Delsarte for k-wise Hamming distances. A set of code-words a1; a2; : : : ; ak of length n have k-wise Hamming-distance `, if there are exactly ` such coordinates, where not all of their coordinates coincide (alternatively, exactly n ` of thei...

In this paper two external schema generation algorithms are presented. These algorithms are defined in the framework of the new external schema definition methodology for OODBs put forward in (Samos, 1995); they generate an external schema from a set of classes selected from those existing in an external schema definition repository. Their main characteristic is that they avoid the generation o...