Database Manipulation Research Articles

Entropy-based associative classification algorithm for mining manufacturing data

This paper presents a new associative classification algorithm for data mining. The algorithm uses elementary set concepts, information entropy and database manipulation techniques to develop useful relationships between input and output attributes of large databases. These relationships (knowledge) are represented using IF–THEN association rules, where the IF portion of the rule includes a set of input attributes features and THEN portion of the rule includes a set of output attributes that represent decision outcome. Application of the algorithm is presented with a thermal spray process control case study. Thermal spray is a process of forming a desired shape of material by spraying melted metal on a ceramic mould. The goal of the study is to identify spray process input parameters that can be used to effectively control the process with the purpose of obtaining better characteristics for the sprayed material. Detailed discussion on the source and characteristics of the data sets is also presented.

CALMsystem: A Conversational Agent for Learner Modelling

This paper describes a system which incorporates natural language technologies, database manipulation and educational theories in order to offer learners a Negotiated Learner Model, for integration into an Intelligent Tutoring System. The system presents the learner with their learner model, offering them the opportunity to compare their own beliefs regarding their capabilities with those inferred by the system. A conversational agent, or “chatbot” has been developed to allow the learner to negotiate over the representations held about them using natural language. The system aims to support the metacognitive goals of self-assessment and reflection, which are increasingly seen as key to learning and are being incorporated into UK educational policy. The paper describes the design of the system, and reports a user trial, in which the chatbot was found to support users in increasing the accuracy of their self-assessments, and in reducing the number of discrepancies between system and user beliefs in the learner model. Some lessons learned in the development have been highlighted and future research and experimentation directions are outlined.

The Pathway Editor: A tool for managing complex biological networks

Biological networks are systems of biochemical processes inside a cell that involve cellular constituents such as DNA, RNA, proteins, and various small molecules. Pathway maps are often used to represent the structure of such networks with associated biological information. Several pathway editors exist, and they vary according to specific domains of knowledge. This paper presents a review of existing pathway editors, along with an introduction to the Edinburgh Pathway Editor (EPE). EPE was designed for the annotation, visualization, and presentation of a wide variety of biological networks that include metabolic, genetic, and signal transduction pathways. EPE is based on a metadata-driven architecture. The editor supports the presentation and annotation of maps, in addition to the storage and retrieval of reaction kinetics information in relational databases that are either local or remote. EPE also has facilities for linking graphical objects to external databases and Web resources, and is capable of reproducing most existing graphical notations and visual representations of pathway maps. In summary, EPE provides a highly flexible tool for combining visualization, editing, and database manipulation of information relating to biological networks. EPE is open-source software, distributed under the Eclipse open-source application platform license.

Financial econometric analysis at ultra-high frequency: Data handling concerns

Data collection at ultra high-frequency on financial markets requires the manipulation of complex databases, and possibly the correction of errors present in the data. The New York Stock Exchange is chosen to provide evidence of problems affecting ultra high-frequency data sets. Standard filters can be applied to remove bad records from the trades and quotes data. A method for outlier detection is proposed to remove data which do not correspond to plausible market activity. Several methods of aggregation of the data are suggested, according to which corresponding time series of interest for econometric analysis can be constructed. As an example of the relevance of the procedure, the autoregressive conditional duration model is estimated on price durations. Failure to purge the data from “wrong” ticks is likely to shorten the financial durations between substantial price movements and to alter the autocorrelation profile of the series. The estimated coefficients and overall model diagnostics are considerably altered in the absence of appropriate steps in data cleaning. Overall the difference in the coefficients is bigger between the dirty series and the clean series than among series filtered with different algorithms.

Association rule-generation algorithm for mining automotive warranty data

A new association rule-generation algorithm is presented for mining automotive warranty data. The algorithm uses elementary set concept and database manipulation techniques to develop useful relationships between product attributes and causes of failure. These relationships (knowledge) are represented using IF–THEN association rules, where the IF portion of the rule includes set of attributes representing product features (e.g. production date, repair date, mileage-at-repair, transmission, engine type, etc.) and the THEN portion of the rule includes set of attributes that represent decision outcome (e.g. problem-related labor code). Once association rules are developed, the algorithm applies a statistical analysis technique to evaluate the significance of each rule. The rules that pass the significance test are reported in a solution. Application of the association rule-generation algorithm is presented with a data-mining case study from the automotive industry. The knowledge (rules) extracted from the automotive warranty data are used to identify root causes of a particular warranty problem or to develop useful conclusions. Detailed discussion on the source and characteristics of warranty data is also presented.

Predictions of the optimum ternary alkali-carbonate electrolyte composition for MCFC by computational calculation

Various kinds of phase diagrams for Li–Na–K ternary carbonate systems were plotted and the vapor pressures of chemical species such as alkali cations and oxygen molecule at various compositions and various temperatures were calculated by computational manipulation of thermodynamic databases. The liquidus temperature of (Li 0.52Na 0.48) 2CO 3–(Li 0.62K 0.32) 2CO 3, (Li 0.62K 0.32) 2CO 3–(Li 0.44Na 0.30K 0.26) 2CO 3, and (Li 0.44Na 0.30K 0.26) 2CO 3–(Li 0.52Na 0.48) 2CO 3 binary systems decrease with the increase of Li 2CO 3 content without any ternary intermediate compound. Total vapor pressure of alkali metal species governed by the summation of the vapor pressure of free Na and K and the vapor pressure of alkali metal species starts to decrease abruptly when the content of (Li 0.52Na 0.48) 2CO 3 is over 70 mol% in (Li 0.52Na 0.48) 2CO 3–(Li 0.62K 0.32) 2CO 3 system while over 50 mol% in (Li 0.44Na 0.30K 0.26) 2CO 3–(Li 0.52Na 0.48) 2CO 3 system. On the contrary, the equilibrium vapor pressure of oxygen molecule abruptly increases at the same composition range.

Multicriteria Dynamic Segmentation: Geographic Information System Application for Managing Retroreflectivity of Pavement Marking

For many geographic information system applications, such as pavement management and traffic inventories, sections of highway routes may be broken into predefined segments of fixed or variable lengths. The use of fixed-length segments or variable-length segments can present problems in data redundancy or require cumbersome spatial edits when attributes change. Dynamic segmentation was developed to address these problems. Used in conjunction with a milepoint linear-referencing scheme, dynamic segmentation can provide an efficient means for storing varying highway data. However, when dealing with very small segments and constantly changing attributes, the number of segments can make the use of dynamic segmentation slow and cumbersome. Introduced is a multicriteria dynamic segmentation approach that allows on-the-fly segmentlength specification before a linear referenced table is attached to a route. Once the segment length is specified, the attribute data are binned by using database manipulation and aggregation operations based on a user-defined set of criteria. By using binned data, dynamic segmentation speed is enhanced considerably. Small-scale thematic maps of binned data are much more readable, and data spikes can be removed in the binning process. The underlying reference database containing the original small segment attribute data is never compromised in the binning process. The approach was developed specifically to accommodate managing pavement retroreflectivity data in a geographic information system. The system architecture is described, and other types of spatial data that may benefit from this approach are identified.

Integrating data from legacy systems using object linking and embedding technology: development of a reporting system for heavy metal poisoning results.

Integrating data that reside in different systems remains an often laborious process, requiring either manual steps or complicated programming. This paper describes a method for state-mandated reporting of childhood blood lead testing results that makes use of object linking and embedding technology and readily available software products to pull together information from different legacy systems. A terminal session emulator employs object linking and embedding automation to extract host data, and Visual Basic routines specify the user interface and database manipulation. This system has significantly increased the efficiency and accuracy with which blood lead testing reports are provided to the local state health department. The system provides a model for a relatively easy solution for laboratories and other groups that need a way to integrate standard data sets that are distributed across legacy systems.

4526 The digitally correlated anatomy database as a tool for teaching endosonography of the thorax.

Introduction: Proficiency in performing EUS is dependent upon accurate interpretation of structures seen during imaging. A lack of good anatomic correlates contributes to a long learning curve. Moreover, EUS is a dynamic imaging process where structures are sometimes identified by their changing relative orientations. Methods utilizing still images are unable to provide a spatial orientation in more than one plane.We describe a method of teaching EUS using the digitally correlated anatomy database (DCAD). This database has been created using images derived from the Visible Human Project (a comprehensive database of digital anatomy) and digitized EUS images. Methods: EUS images, both radial and linear, were captured to SVHS tapes during indicated procedures performed at the UCHSC, Denver. An image library was constructed by review of the tapes and digital capture of still EUS images as well as series of frames as videofiles (AVI format). The DCAD was constructed in a sequence of steps consisting of data manipulation, image correlation and digital animation. Initially, manipulation of the Visible Human database was performed on an advanced graphics workstation to obtain images corresponding to the selected EUS images. The thorax was divided into zones and correlated images were arranged in groups within each zone, focusing on structures of interest in different orientations. Each group contained both radial and linear correlated EUS and Visible Human images, video sequence of the EUS pull-through in that segment of thorax, animated sequences and the parent template (transverse and linear) from the Visible Human image pool. After organizing these data into anatomic segments, structures of interest were studied and identified by review of the still images, video sequences and animations within each group. Results: Study of the correlated still images suggested the identity of structures in question. The parent templates, animated anatomy along with the EUS video sequences from the DCAD confirmed the identity of structures seen in the still images. Future directions: Studies are being designed to objectively test whether the digitally correlated anatomy database shortens the learning curve when applied to prospective endosonographers in training. We plan to compile similar databases for the rectum, stomach and duodenum.

SISEQ: manipulation of multiple sequence and large database files for common platforms.

A multiple sequence file converter for common platforms, SISEQ,is described, which performs extraction of DNA sequences that correspond to CDS or RNA field of a large database file as well as subsequent multi-sequence conversions for phylogenetic or molecular biological analysis. Command-line interface as well as a GUI and a script-driven operation mode are provided. The program is freely available to academic users in the form of Macintosh FAT binary, DOS executable, or UNIX source code at http://www.molbiol.saitama-u.ac.jp/ñaoki/ Software.html. naokisat@molbiol.saitama-u.ac.jp

VRML possibilities: the evolution of the Glasgow model [virtual city

During the 1980s, ABACUS (Architecture and Building Aids Computer Unit, Strathclyde), in the Department of Architecture at the University of Strathclyde, researched issues surrounding the modelling and manipulation of large geometrical databases of urban topography. Initially, this interest lay solely in the ability to source, capture and store the relevant data. However, once constructed, these 3D data sets proved genuinely useful to a wide range of users. There ensued a demand from professionals for greater graphical functionality in the manipulation of these models and for the addition of contextual data. These demands often exposed deficiencies in the hardware and software systems then available. As a result, we focused development on research applications and deployment. The recent advent of the Virtual Reality Modelling Language (VRML) standards rekindled interest in this field, since VRML enables the addressing and solving of many of the issues that proved problematic in the past. The potential now exists to provide wide access to large-scale, multi-layered urban models.

Grammars++ for modelling information in text

Grammars provide a convenient means to describe the set of valid instances in a text database. Flexibility in choosing a grammar can be exploited to provide information modelling capability by designing productions in the grammar to represent entities and relationships of interest to database applications. Additional constraints can be specified by attaching predicates to selected nonterminals in the grammar. When used for database definition, grammars can provide the functionality that users have come to expect of database schemas. Extended grammars can also be used to specify database manipulation, including query, update, view definition, and index specification.

The multilevel relational (MLR) data model

Many multilevel relational models have been proposed; different models offer different advantages. In this paper, we adapt and refine several of the best ideas from previous models and add new ones to build the new Multilevel Relational (MLR) data model. MLR provides multilevel relations with element-level labeling as a natural extension of the traditional relational data model. MLR introduces several new concepts (notably, data-borrow integrity and the UPLEVEL statement) and significantly redefines existing concepts (polyinstantiation and referential integrity as well as data manipulation operations). A central contribution of this paper is proofs of soundness, completeness, and security of MLR. A new data-based semantics is given for the MLR data model by combining ideas from SeaView, belief-based semantics, and LDV. This new semantics has the advantages of both eliminating ambiguity and retaining upward information flow. MLR is secure, unambiguous, and powerful. It has five integrity properties and five operations for manipulating multilevel relations. Soundness, completeness, and security show that any of the five database manipulation operations will keep database states legal (i.e., satisfy all integrity properties), that every legal database state can be constructed, and that MLR is noninterfering. The expressive power of MLR also compares favorably with several other models.

A hierarchical decision support system for production planning (with case study)

We propose a Hierarchical Decision Support System (HDSS) for production planning which enables production planners to utilize complex and structured planning algorithms interactively with no difficulty. The suggested system represents a higher level planning tool than MRP: namely, it encompasses aggregate planning, family and end item planning levels. The HDSS is integrated with MRP through the Master Production Schedule (at the end item level) which is transferred to MRP. The feasibility at all planning levels is preserved through database manipulations which enable communication among different planning hierarchies. The key features of the proposed system are the ease of data manipulation and the highly interactive nature of the system provided by the user-interface. The dialogue management system hides the theoretical background of the model base consisting of multi-optional aggregate planning models and disaggregation algorithms used at the family and end item planning levels.

Scheme: A Interpreter for Extended Lambda Calculus

Inspired by ACTORS [7, 17], we have implemented an interpreter for a LISP-like language, SCHEME, based on the lambda calculus [2], but extended for side effects, multiprocessing, and process synchronization. The purpose of this implementation is tutorial. We wish to: 1.alleviate the confusion caused by Micro-PLANNER, CONNIVER, etc., by clarifying the embedding of non-recursive control structures in a recursive host language like LISP. 2.explain how to use these control structures, independent of such issues as pattern matching and data base manipulation. 3.have a simple concrete experimental domain for certain issues of programming semantics and style. This paper is organized into sections. The first section is a short “reference manual” containing specifications for all the unusual features of SCHEME. Next, we present a sequence of programming examples which illustrate various programming styles, and how to use them. This will raise certain issues of semantics which we will try to clarify with lambda calculus in the third section. In the fourth section we will give a general discussion of the issues facing an implementor of an interpreter for a language based on lambda calculus. Finally, we will present a completely annotated interpreter for SCHEME, written in MacLISP [13], to acquaint programmers with the tricks of the trade of implementing non-recursive control structures in a recursive language like LISP. This report describes research done at the Artificial Intelligence Laboratory of the Massachusetts Institute of Technology. Support for the laboratory‘s artificial intelligence research is provided in part by the Advanced Research Projects Agency of the Department of Defense under Office of Naval Research contract N00014-75-C-0643.

Map dynamics: integrating cellular automata and GIS through Geo-Algebra

In this paper the modelling formalism of cellular automata (CA) is generalized and extended within Geo-Algebra, a mathematical generalization of map algebra capable of expressing a variety of dynamic spatial models and spatial data manipulations within a common framework. Map dynamics, that is, the integration of the spatial dynamics reflected in CA and the spatial data handling capabilities of map algebra, constitutes a critical element within a wider project which sets out to formulate a general framework for simultaneously supporting spatial database manipulations and static and dynamic modelling within GIS. Map dynamics can also allow the modelling of additional dynamic behaviours and phenomena such as adaptation, design, learning and gaming not currently expressible as GIS models.

Logic programming and database schema in reverse engineering: Analysis and documentation for existing code in a multilanguage environment

This paper presents the experience that has been acquired over a period of three years during the Ph.D. dissertation of the first author. This experience has been characterised by three fundamental phases. The first of these produced an earlier paper [Eltantawi and Maresca, 1994] and dealt with the first experience of the application of logic programming (LP) to programming language analysis. This consisted of defining a methodology, and setting up a tool for the analysis of a few programming languages and for the representation of the main low-level design documents. The second phase stemmed from a second paper [Giannone and Maresca, 1995], which focused on the way in which useful documents were to be extracted during the System Comprehension activity, primarily in the reverse engineering phase. In this connection, applying LP techniques made it possible to define a methodology and set up a tool for generalising the extraction and abstraction of information to help in the building of the above documents, making them independent of the programming language. Phase three, this paper, represents the logical continuation of the first two, and tackles the application of LP techniques to RE activities and, in particular, the construction of low- and high-level design documents in a multilanguage environment. Specifically, this experience is concerned with the analysis of programming languages for reverse engineering (RE) topics using two approaches: a main approach based on logic, and a complementary approach based on database manipulation. The authors describe methodologies for the analysis of code belonging to a multilanguage environment, and discuss the motivations that made it possible to achieve the specific design and implementation of a software tool called “Multilanguage Analyser” (M-Lan-An). This tool can synthesise the candidate methodologies for the construction of low-level design documentation (such as the algebraic form), and high-level design documentation (such as the code structure-tree, the call-tree, the declaration-tree, and so forth). All the documents can be visualised and browsed using user-friendly interfaces, while the tool can determine some important objective metrics such as McCabe's number, Halstead's dimensional metrics, number of knots and their density, which are important indicators of the complexity of the analysed code. Currently, M-Lan-An can analyse several programming languages such as ANSI C/Turbo C, FORTRAN 77 and PL/1. The tool operates on PC (IBM-DOS) and is built in Turbo PROLOG V. 2.0 and CLIPPER V. 5.2.

Some First Steps in Teaching a Strategy for Fact Finding

Paper form can match electronic for simple quests With a minimum of class time, reporting students can learn to find answers to questions like these: What is the most popular color for sports cars? What do U.S. public school teachers perceive as the most serious problem in their schools? Of which companies is Jay Pritzker either a board member or officer? How many people play soccer and how does it rank in sports popularity? What is the current status of the Ethics in Government Reform Act? To whom does the director of the FBI report? None of the answers need be found through the wizardry of electronic technology. All six are found in basic print references-ones that take no more expertise than the ability to turn a page and no more memorization of format than ability to alphabetize. According to a survey taken of newspaper business editors, paper references are still the norm on smaller newspapers, where most journalism graduates will get their first jobs. The survey also provided evidence that many reporters on such newspapers make little use of any but the most basic reference works, yet who go beyond the minimum are sold on the results-as are reporters on larger newspapers. The literature in the field suggests a trend toward an all-or-nothing approach to the question of reporters as researchers. There are now a number of textbooks devoted to fact gathering (for example, Search Strategies in Mass Communication, The Reporter's Handbook, Investigative Reporting: Advanced Methods and Techniques), a great growth in the number of courses aimed at teaching computer-assisted reporting, and occasional reports of ambitious newsroom programs to educate reporters on computer-research skills (for example, a June 24, 1994, article in Editor Fr Publisher titled Five-Step Plan for Raising Reporters' Computer Literacy). The difficulties of setting up a course on computer-assisted reporting are well documented in the Autumn 1995 edition of Journalism & Mass Communication Educator (Problems of Introducing Courses in Computer-Assisted Reporting). All of this can be rather daunting, perhaps explaining why some have begun to argue that information gathering has become so complex that it is well to leave it to the specialists (as in a June 1993 Quill article, Need Leaders for News Technology? Look to Librarians and a Sept./Oct. edition of Online, in which the librarian writer extols the division of labor between reporters and researchers-a division that creates those moments of intense partnership when you're each doing what you know how to do best.). We suggest there may be a happy medium. Although the news-editorial department at the University of Nebraska-Lincoln is offering instruction in database manipulation in second-year reporting and will offer a course next fall devoted exclusively to fact gathering, we also have incorporated more fact gathering in beginning reporting classes-in bite-size pieces that don't require a redo of the course. The aim is to bridge the gap lying between the telephone-book/city directory format and the world of database searches. If students have knowledge of a small but well-chosen set of reference sourcesprincipally paper ones-they will find good use for their knowledge when they get their first jobs. The bite-size beginning also can be the base for building more fact finding into the second-year course. This article will outline what we have begun to offer in a beginning reporting class and what we perceive its future value will be. Together, we (a journalism professor and liaison librarian with a journalism specialty) talked over time limits, format and goals. We settled on three, one-hour library visits, to consist of 20 minutes of instruction and 40 minutes of practice. An overall test, containing questions much like that opened this article, also is given. …

Photobook: Content-based manipulation of image databases

We describe the Photobook system, which is a set of interactive tools for browsing and searching images and image sequences. These query tools differ from those used in standard image databases in that they make direct use of the image content rather than relying on text annotations. Direct search on image content is made possible by use of semantics-preserving image compression, which reduces images to a small set of perceptually-significant coefficients. We discuss three types of Photobook descriptions in detail: one that allows search based on appearance, one that uses 2-D shape, and a third that allows search based on textural properties. These image content descriptions can be combined with each other and with text-based descriptions to provide a sophisticated browsing and search capability. In this paper we demonstrate Photobook on databases containing images of people, video keyframes, hand tools, fish, texture swatches, and 3-D medical data.

Extending a multi-set relational algebra to a parallel environment

Parallel database systems will very probably be the future for high-performance data-intensive applications. In the past decade, many parallel database systems have been developed, together with many languages and approaches to specify operations in these systems. A common background is still missing, however. This paper proposes an extended relational algebra for this purpose, based on the well-known standard relational algebra. The extended algebra provides both complete database manipulation language features, and data distribution and process allocation primitives to describe parallelism. It is defined in terms of multi-sets of tuples to allow handling of duplicates and to obtain a close connection to the world of high-performance data processing. Due to its algebraic nature, the language is well suited for optimization and parallelization through expression rewriting. The proposed language can be used as a database manipulation language on its own, as has been done in the PRISMA parallel database project, or as a formal basis for other languages, like SQL.