Semantic hierarchies and abstractions in conceptual schemata

A conceptual schema is a clear, easy to understand and exact representation of the semantics of an underlying universe of discourse. The role of such schemata in the specification and design of information bases is now widely recognized. However, in “real life” applications, it is often the case that the size of the conceptual schema exceeds the limit above which it is necessary to have an abstraction mechanism available, as otherwise it would become difficult to understand.In this paper, we present several concepts and heuristic procedures which allow for semantic modularization of a conceptual schema, thus providing a concise representation, using different degrees of abstraction and/or viewpoints, of a schema of any size.     

Verification of conceptual schemata based on hybrid object-oriented and logic paradigm

Contemporary conceptual modelling languages are concerned with the representational adequacy of knowledge about a universe of discourse and with the efficient organization of this knowledge in structures that help overcome the problems of size and complexity in the modelled reality. In the paper it is argued that a conceptual modelling language should also facilitate the verification of captured requirements by exercising the conceptual schemata derived from the use of such a language. A conceptual modelling language is presented that is based on a hybrid representation scheme that makes use of object-oriented and logic approaches, and it is shown how this language can be used to verify requirements during the development of information systems.     

A conceptual model for the logical design of temporal databases

Although widely advocated as a tool for the conceptual modelling of data, the Entity-Relationship (E-R) model [4] and its extensions are generally lacking in constructs to model the dynamic nature of the real world, making them inadequate for designing temporal databases. This research first extends the E-R model to a Temporal Event-Entity-Relationship Model (TEERM), by introducing events as an additional construct. Second, a method is proposed for mapping this conceptual model into a temporal relational model for the logical design of temporal relational databases with a corresponding set of integrity constraints. The model is illustrated with an example and evaluated using a set of criteria proposed by ^{Batini et al. [2]}. The model appears to be expressive, simple and easy to use, and should, therefore, aid the temporal database design process significantly.     

Design of statistical databases: A methodology for the conceptual step

The aim of the conceptual step in database design is to describe data involving in the application in a formal and abstract way, without any concern to the specific model and language chosen for the implementation. In statistical applications, data are described at different levels of aggregation, from elementary facts of the reality to complex aggregations such as classifications, time series, indexes. The paper describes a methodology for conceptual design of statistical databases that provides the designer suitable strategies for defining such different levels of aggregation starting from user requirements, and checking the completeness, coherence and minimality of the conceptual schema at the different levels. The methodology makes use of two data models for the representation of data: for elementary data the Entity-Relationship model, widely used in database applications, and for summary data a new model is proposed, designed to be an effective trade-off between expressive power and simplicity of use.     

From conceptual models to schemata: An object-process-based data warehouse construction method

Data warehouse modeling is a complex task, which involves knowledge of business processes of the domain of discourse, understanding the structural and behavioral system's conceptual model, and familiarity with data warehouse technologies. The suitability of current data warehouse modeling methods for large-scale systems is questionable, as they require multiple manual actions to discover measures and relevant dimensional entities and they tend to disregard the system's dynamic aspects. We present an Object-process-based Data Warehouse Construction (ODWC) method that overcomes these limitations of existing methods by utilizing the operational system conceptual model to construct a corresponding data warehouse schema. We specify the ODWC method, apply it on a case study, evaluate it, and compare it to existing methods.     

Linguistic decision schemata for intelligent robots

High-level decision making can be performed on a special purpose hierarchically structured computer with multiprocessing capabilities. The components of such a system, called decision schemata, utilize a concatenation of multielement strings of command with feedback information as an input and they map it into an output string that has the highest probability of minimizing an appropriate cost function. They are structured to process information in a decreasing order of intelligence and an increasing order of precision. Such schemata have application in intelligent control of intelligent systems and robots.     

Organizational schemata of e-portfolios for fostering higher-order thinking

The information technology of online e-portfolio systems have been widely used during the past several years along with the diffusion of electronic teaching-learning systems. However, for the time being e-portfolio is viewed more as an assessment tool or a showcase tool, but less as an active learning tool. The current generic e-portfolio systems store artifacts in the chronological order on the course basis, providing few facets for active thinking. The question of how we can make e-portfolio a useful learning tool to improve students’ learning outcomes is still open to research. Among various students’ learning outcomes, higher-order thinking has become an important outcome of education. One vision of education evolution is to change the modes of thinking of students. This study is to meet the challenge of e-portfolios by investigating a significant research question: how e-portfolios can be used as a learning tool for students to foster higher-order thinking. Specifically, this study proposes an ontological approach to organizational schema of e-portfolios so that e-portfolios can be logically and dynamically organized into thinking-driven networks. The ontological schemata can serve as visible maps for the virtual e-portfolios repository shared by all teachers and students to foster higher-order thinking. A case study that implements a prototype of organizational schemata of e-portfolios demonstrates the usefulness of the proposed approach for fostering higher-order thinking.     

Properties of stochastic syntax-directed translation schemata

Stochastic syntax-directed translation schemata describe both the syntactic structure and the probability distribution of stochastic mappings between contextfree languages. The relationship between stochastic syntax-directed translation schemata and stochastic grammars and automata are presented by proving that a stochastic pushdown transducer can be constructed to define the same translations as a simple schema, and that the simple schema are characterized by stochastic contextfree grammars. Asymptotic properties of linear schemata are established by the theory of Markov chains. Since stochastic translations contain both input and output strings, their information content can be described. Equations are developed for both the information content and the rate of stochastic translations.     

Simplified handling of iterated term schemata

We propose an extension of primal grammars (Hermann and Galbavý, Theor Comp Sci 176(1–2):111–158, 1997), called P-grammars. Primal grammars are term grammars with a high expressive power and good computational properties. P-grammars have exactly the same properties but are more modular, more concise, and easier to use, as shown by some examples. We prove that P-grammars are exponentially more concise than primal grammars. An algorithm, called p2primal, transforming any P-grammar into an equivalent primal grammar is provided, thus making the original formalism much easier to handle from a practical point of view.     

Implementation techniques for prolog databases

All clauses comprising a Prolog program are stored in a database from which they can be removed later. Other long-term data structures are represented as clauses and are also stored and removed from the same database. Implementation techniques for the manipulation of clauses are not well known, and a lack of information has led to incorrect and incomplete implementations. Further previously unresolved issues are apparent when considering the storage of compiled clauses. We describe the way database manipulations are performed in Prolog-X, a new compiler-based Prolog system. We also introduce a new technique for storing the source form of compiled clauses.     

An algebra for probabilistic databases

An algebra is presented for a simple probabilistic data model that may be regarded as an extension of the standard relational model. The probabilistic algebra is developed in such a way that (restricted to α-acyclic database schemes) the relational algebra is a homomorphic image of it. Strictly probabilistic results are emphasized. Variations on the basic probabilistic data model are discussed. The algebra is used to explicate a commonly used statistical smoothing procedure and is shown to be potentially very useful for decision support with uncertain information