Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 10 of 10

Full-Text Articles in Physical Sciences and Mathematics

Algorithms For Adapting Materialised Views In Data Warehouses, Mukesh Mohania, Guozhu Dong Dec 1996

Algorithms For Adapting Materialised Views In Data Warehouses, Mukesh Mohania, Guozhu Dong

Kno.e.sis Publications

In this paper we consider the problem of materialised view adaptation in data warehouses. Materialised views are important in data warehousing where they are used to speed up query processing on large amounts of data. User requirements change over time, which may change the definitions of views dynamically. For such situations, the question arises whether the materialised views should be recomputed from scratch for every change in the definition or they should be obtained by adapting old materialised views. Changes to a view definition may be expensive, if the view is recomputed from scratch. Therefore, it is worthwhile to examine …


Multimedia Applications Require Adaptive Cpu Scheduling, Veronica Baiceanu, Crispin Cowan, Dylan Mcnamee, Calton Pu, Jonathan Walpole Nov 1996

Multimedia Applications Require Adaptive Cpu Scheduling, Veronica Baiceanu, Crispin Cowan, Dylan Mcnamee, Calton Pu, Jonathan Walpole

Computer Science Faculty Publications and Presentations

CPU scheduling and admission testing for multimedia applications have been extensively studied, and various solutions have been proposed using assorted simplifying assumptions. However, we believe that the complexity and dynamic behavior of multimedia applications and systems make static solutions hard to apply in real-world situations. We are analyzing the difficulties that arise when applying the rate-monotonic (RM) scheduling algorithm and the corresponding admission tests for CPU management, in the context of real multimedia applications running on real systems. RM requires statically predictable, periodic workloads, and while multimedia applications appear to be periodic, in practice they exhibit numerous variabilities in workload. …


On The Portability Of Behavioral Vhdl-93, Krishnaprasad Thirunarayan, Robert Ewing Oct 1996

On The Portability Of Behavioral Vhdl-93, Krishnaprasad Thirunarayan, Robert Ewing

Kno.e.sis Publications

Goossens defined a structural operational semantics for a subset of VHDL-87 and proved that the parallelism present in VHDL is benign. We extend this work to include shared variables in VHDL-93 that changes the underlying semantic model. In the presence of shared variables, non-deterministic execution of VHDL-93 processes destroys the unique meaning property. We identify and characterize a class of portable VHDL-93 descriptions for which unique meaning property can be salvaged.


Managing Multiple Information Sources Through Ontologies: Relationship Between Vocabulary Heterogeneity And Loss Of Information, Eduardo Mena, Vipul Kashyap, Arantza Illarramendi, Amit P. Sheth Aug 1996

Managing Multiple Information Sources Through Ontologies: Relationship Between Vocabulary Heterogeneity And Loss Of Information, Eduardo Mena, Vipul Kashyap, Arantza Illarramendi, Amit P. Sheth

Kno.e.sis Publications

The ability to deal with a huge number of independent and heterogeneous repositories is the most critical problem in Global Information Systems. One approach to enable efficient query processing is by utilizing semantic descriptions (organized as ontologies) of such repositories whenever available.

In this context semantic relationships among ontologies can be used Query Processors. Three kind of relationships are considered: synonyms and hypernyms. Using synonyms the semantic of the query is preserved; however, when synonyms are not available and hypernyms or hyponyms are used there exists some loss of information that must be measured.


Concept Hierarchy Memory Model: A Neural Architecture For Conceptual Knowledge Representation, Learning, And Commonsense Reasoning, Ah-Hwee Tan, Hui-Shin Vivien Soon Jul 1996

Concept Hierarchy Memory Model: A Neural Architecture For Conceptual Knowledge Representation, Learning, And Commonsense Reasoning, Ah-Hwee Tan, Hui-Shin Vivien Soon

Research Collection School Of Computing and Information Systems

This article introduces a neural network based cognitive architecture termed Concept Hierarchy Memory Model (CHMM) for conceptual knowledge representation and commonsense reasoning. CHMM is composed of two subnetworks: a Concept Formation Network (CFN), that acquires concepts based on their sensory representations; and a Concept Hierarchy Network (CHN), that encodes hierarchical relationships between concepts. Based on Adaptive Resonance Associative Map (ARAM), a supervised Adaptive Resonance Theory (ART) model, CHMM provides a systematic treatment for concept formation and organization of a concept hierarchy. Specifically, a concept can be learned by sampling activities across multiple sensory fields. By chunking relations between concepts as …


Observer: An Approach For Query Processing In Global Information Systems Based On Interoperation Across Pre-Existing Ontologies, Eduardo Mena, Vipul Kashyap, Amit P. Sheth, Arantza Illarramendi Jun 1996

Observer: An Approach For Query Processing In Global Information Systems Based On Interoperation Across Pre-Existing Ontologies, Eduardo Mena, Vipul Kashyap, Amit P. Sheth, Arantza Illarramendi

Kno.e.sis Publications

The huge number of autonomous and heterogeneous data repositories accessible on the “global information infrastructure” makes it impossible for users to be aware of the locations structure/organization, query languages and semantics of the data in various repositories. There is a critical need to complement current browsing, navigational and information retrieval techniques with a strategy that focuses on information content and semantics. In any strategy that focuses on information content, the most critical problem is that of different vocabularies used to describe similar information across domains. We discuss a scalable approach for vocabulary sharing. The objects in the repositories are represented …


On The Use Of The Complexity Index As A Measure Of Complexity In Activity Networks, Bert De Reyck, Willy Herroelen Jun 1996

On The Use Of The Complexity Index As A Measure Of Complexity In Activity Networks, Bert De Reyck, Willy Herroelen

Research Collection Lee Kong Chian School Of Business

A large number of optimal and suboptimal procedures have been developed for solving combinatorial problems modeled as activity networks. The need to differentiate between easy and hard problem instances and the interest in isolating the fundamental factors that determine the computing effort required by these procedures, inspired a number of researchers to develop various complexity measures. In this paper we investigate the relation between the hardness of a problem instance and the topological structure of its underlying network, as measured by the complexity index. We demonstrate through a series of experiments that the complexity index, defined as the minimum number …


Proof Strategies For Hardware Verification, Robert Eastham, Krishnaprasad Thirunarayan May 1996

Proof Strategies For Hardware Verification, Robert Eastham, Krishnaprasad Thirunarayan

Kno.e.sis Publications

Ascertaining correctness of digital hardware designs through simulation does not scale-up for large designs because of the sheer combinatorics of the problem. Formal verification of hardware designs holds promise because its computational complexity is of the order of number of different types of components (and not number of components in the design). This approach requires the specification of the behavior and the design in a formal language, and reason with them using a theorem prover. In this paper we attempt to develop a methodology for writing and using these specifications for some important classes of hardware circuits. We examine digital …


Spieltheorie, Alexander Chocholaty, Pascal Hitzler Jan 1996

Spieltheorie, Alexander Chocholaty, Pascal Hitzler

Computer Science and Engineering Faculty Publications

No abstract provided.


Semantic And Schematic Similarities Between Database Objects: A Context-Based Approach, Vipul Kashyap, Amit P. Sheth Jan 1996

Semantic And Schematic Similarities Between Database Objects: A Context-Based Approach, Vipul Kashyap, Amit P. Sheth

Kno.e.sis Publications

In a multidatabase system, schematic conflicts between two objects are usually of interest only when the objects have some semantic similarity. We use the concept of semantic proximity, which is essentially an abstraction/mapping between the domains of the two objects associated with the context of comparison. An explicit though partial context representation is proposed and the specificity relationship between contexts is defined. The contexts are organized as a meet semi-lattice and associated operations like the greatest lower bound are defined. The context of comparison and the type of abstractions used to relate the two objects form the basis of a …