Displaying similar documents to “On information storage and retrieval systems”

Picture languages in automatic radiological palm interpretation

Ryszard Tadeusiewicz, Marek Ogiela (2005)

International Journal of Applied Mathematics and Computer Science

Similarity:

The paper presents a new technique for cognitive analysis and recognition of pathological wrist bone lesions. This method uses AI techniques and mathematical linguistics allowing us to automatically evaluate the structure of the said bones, based on palm radiological images. Possibilities of computer interpretation of selected images, based on the methodology of automatic medical image understanding, as introduced by the authors, were created owing to the introduction of an original...

Inferring graph grammars by detecting overlap in frequent subgraphs

Jacek P. Kukluk, Lawrence B. Holder, Diane J. Cook (2008)

International Journal of Applied Mathematics and Computer Science

Similarity:

In this paper we study the inference of node and edge replacement graph grammars. We search for frequent subgraphs and then check for an overlap among the instances of the subgraphs in the input graph. If the subgraphs overlap by one node, we propose a node replacement graph grammar production. If the subgraphs overlap by two nodes or two nodes and an edge, we propose an edge replacement graph grammar production. We can also infer a hierarchy of productions by compressing portions of...

Using a graph grammar system in the finite element method

Barbara Strug, Anna Paszyńska, Maciej Paszyński, Ewa Grabska (2013)

International Journal of Applied Mathematics and Computer Science

Similarity:

The paper presents a system of Composite Graph Grammars (CGGs) modelling adaptive two dimensional hp Finite Element Method (hp-FEM) algorithms with rectangular finite elements. A computational mesh is represented by a composite graph. The operations performed over the mesh are defined by the graph grammar rules. The CGG system contains different graph grammars defining different kinds of rules of mesh transformations. These grammars allow one to generate the initial mesh, assign values...

Stable graphs

Klaus-Peter Podewski, Martin Ziegler (1978)

Fundamenta Mathematicae

Similarity:

A graphical representation of relational formulae with complementation

Domenico Cantone, Andrea Formisano, Marianna Nicolosi Asmundo, Eugenio Giovanni Omodeo (2012)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity:

We study translations of dyadic first-order sentences into equalities between relational expressions. The proposed translation techniques (which work also in the converse direction) exploit a graphical representation of formulae in a hybrid of the two formalisms. A major enhancement relative to previous work is that we can cope with the relational complement construct and with the negation connective. Complementation is handled by adopting a Smullyan-like uniform notation to classify...