### Volume 1 – No. 3 Physical Data Warehouse Design Using Neural Network

"... Performance of the data warehouse depends on physical design. Index selection and storage of multidimensional data bases are important activities of physical designing process. Conventional indexing techniques such as bitmaps, B-trees and hash based indexing systems need large storage space for stor ..."

Abstract
- Add to MetaCart

(Show Context)
Performance of the data warehouse depends on physical design. Index selection and storage of multidimensional data bases are important activities of physical designing process. Conventional indexing techniques such as bitmaps, B-trees and hash based indexing systems need large storage space for storing indexes along with data itself. Spelling variants, misspellings and transliteration differences are source of uncertainty in data with in the databases. Misspelled and distorted key values are also hard to map in present indexing systems. In this paper neural network based physical design is suggested, a class of artificial neural network known as self-organizing net is used for indexing data warehouse at physical level. Indexes of active neurons will be used for generating indexes for the data values. In conventional indexing techniques every key value is mapped to a specific point in space, while in neural network based database indexing system, every key value is mapped to a region in space. This region is a class to which the key values of similar type belong. Indexes generated through this method used optimal space for storage, as only final weight matrices after training of neurons are stored. Self-organizing net based indexing is very robust as distorted key values get indexed to right classes. Accuracy of our selforganizing net based indexing system in mapping key values with distorted keys is found to be high.

### CONTENTS

"... This is a collection of algorithms for sorting and searching. Descriptions are brief and intuitive, with just enough theory thrown in to make you nervous. I assume you know a high-level language, such as C, and that you are familiar with programming concepts including arrays and pointers. The first ..."

Abstract
- Add to MetaCart

This is a collection of algorithms for sorting and searching. Descriptions are brief and intuitive, with just enough theory thrown in to make you nervous. I assume you know a high-level language, such as C, and that you are familiar with programming concepts including arrays and pointers. The first section introduces basic data structures and notation. The next section presents several sorting algorithms. This is followed by a section on dictionaries, structures that allow efficient insert, search, and delete operations. The last section describes algorithms that sort data and implement dictionaries for very large files. Source code for each algorithm, in ANSI C, is available at the site listed below. Most algorithms have also been translated to Visual Basic. If you are programming in Visual Basic, I recommend you read Visual Basic Collections and Hash Tables, for an explanation of hashing and node representation. Permission to reproduce this document, in whole or in part, is given provided the original web site listed below is referenced, and no additional restrictions apply. Source code, when part of a software project, may be used freely without reference to the author.

### An Efficient ROBDD Package

, 1996

"... Many interesting problems in computer science can be modelled using Boolean expressions. In formal verification for example, a common task is to determine whether a given model of a system satisfies some properties supposed to hold for the system. Such problems are often modelled as transition syste ..."

Abstract
- Add to MetaCart

Many interesting problems in computer science can be modelled using Boolean expressions. In formal verification for example, a common task is to determine whether a given model of a system satisfies some properties supposed to hold for the system. Such problems are often modelled as transition systems over Boolean variables, and thus a computer-aided solution requires some efficient techniques for manipulating Boolean expressions. Reduced

### ADistributed Typeserver and Protocol for a Linda Tuple Space

"... Linda is a parallel programming paradigm which involves controlling access to a distributed shared memory called a tuple space.The tuple space is comprised of a number of typed data object called tuples.Inour implementation of Linda we choose to partition the tuple space so that a set of data types ..."

Abstract
- Add to MetaCart

(Show Context)
Linda is a parallel programming paradigm which involves controlling access to a distributed shared memory called a tuple space.The tuple space is comprised of a number of typed data object called tuples.Inour implementation of Linda we choose to partition the tuple space so that a set of data types is managed by each host in a local area network. To access the tuple space it is necessary to determine which host is currently managing tuples of a particular type. To t his end we introduce the notion of a typeserver,aprocess which is executed by each host in alocal area network and is able to determine the location of tuples of a given type. If no host is managing a given tuple type then a host is able to create it locally.Each typeserver in the system executes a locking and agreement protocol which ensures that if many processes wish to simultaneously create a tuple type, only one succeeds and all contending hosts receive the same information of the tuple type'swhereabouts. This paper de...

### Production Rule Verification for Quasi-Delay-Insensitive Circuits

"... this document, we present an automated method for the verification of delayinsensitive circuits expressed as production rules. We begin with a description of Martin's design method and specification of the production rule notation. We precisely define stability and noninterference and relate th ..."

Abstract
- Add to MetaCart

(Show Context)
this document, we present an automated method for the verification of delayinsensitive circuits expressed as production rules. We begin with a description of Martin's design method and specification of the production rule notation. We precisely define stability and noninterference and relate them to delay-insensitivity. We give sequential and parallel algorithms for performing verification. We provide several examples of the verification method and describe our implementation of the algorithms. We conclude with a summary of this work. 2 Production Rules