Graph-based Form Research Articles

From Clinical Information Systems to Personalized Health Knowledge Graphs.

This paper presents a versatile solution to formally represent the contents of electronic health records. It is based on the knowledge graph paradigm, and semantic web standards RDF and OWL. It employs the established semantic standards SNOMED CT and FHIR, which warrant international interoperability. A graph-based form is not only useful to feed different target visualizations, but it can also be subject to AI-powered services such as (fuzzy) retrieval and summarization.

Tree-Based Generation of Restricted Graph Languages

Order-preserving DAG grammars (OPDGs) is a formalism for representing languages of structurally restricted graphs. As demonstrated in [17], they are sufficiently expressive to model abstract meaning representations in natural language processing, a graph-based form of semantic representation in which nodes encode objects and edges relations. At the same time, they can be parsed in [Formula: see text], where [Formula: see text] and [Formula: see text] are the sizes of the grammar and the input graph, respectively. In this work, we provide an initial algebra semantic for OPDGs, which allows us to view them as regular tree grammars under an equivalence theory. This makes it possible to transfer results from the field of formal tree languages to the domain of OPDGs, both in the unweighted and the weighted case. In particular, we show that deterministic OPDGs can be minimised efficiently, and that they are learnable under the “minimal adequeate teacher” paradigm, that is, by querying an oracle for equivalence between languages, and membership of individual graphs. To conclude, we demonstrate that the languages generated by OPDGs are definable in monadic second-order logic.

GRAPH BASED ENRICHED KEYWORD EXTRACTION WITH NODE WEIGHT MECHANISM FOR CYBER CRIME JUDGEMENT DATABASE

In the past decade the keyword extraction phase is handled manually with the human resources. This procedure is time consuming and human error leads to uncertainty. On the other hand, Judgment cases the automatic keyword extraction leads to an extensive level of computational performance. This paper Graph based Enriched Keyword Extraction model, which undergoes three different process namely Pre-Processing, Representation of words in graph-based form and Keyword Extraction. Performance of this model evaluated using illustrative example. The result shows that the proposed model extracted keywords effectively and significantly compared with standard performance metrics and existing algorithms.

Distributed PLC Based on Multicore CPUs - Architecture and Programming

Abstract: The paper presents a complete approach to distributed control system design including architecture and programming. The system consists of distributed controllers connected with a network. A multiple core controller architecture is proposed utilizing independent bit and word units in MIMD structure. Calculation process is efficiently synchronized by original implementation of semaphored memory system. The program partitioning and distribution among processing units is made automatically by proposed compiler. For a purpose of program distribution and scheduling a graph based representation of the standard program is used. Developed conversion model enables compilation of selected standard languages into independent graph based form. The distributed controller architecture has been prototyped with use of PFGA devices that enables specific implementation and evaluation of performance. The data exchange was implemented with use of deterministic protocol based on token passing.

Relations as patterns: bridging the gap between OBO and OWL

BackgroundMost biomedical ontologies are represented in the OBO Flatfile Format, which is an easy-to-use graph-based ontology language. The semantics of the OBO Flatfile Format 1.2 enforces a strict predetermined interpretation of relationship statements between classes. It does not allow flexible specifications that provide better approximations of the intuitive understanding of the considered relations. If relations cannot be accurately expressed then ontologies built upon them may contain false assertions and hence lead to false inferences. Ontologies in the OBO Foundry must formalize the semantics of relations according to the OBO Relationship Ontology (RO). Therefore, being able to accurately express the intended meaning of relations is of crucial importance. Since the Web Ontology Language (OWL) is an expressive language with a formal semantics, it is suitable to de ne the meaning of relations accurately.ResultsWe developed a method to provide definition patterns for relations between classes using OWL and describe a novel implementation of the RO based on this method. We implemented our extension in software that converts ontologies in the OBO Flatfile Format to OWL, and also provide a prototype to extract relational patterns from OWL ontologies using automated reasoning. The conversion software is freely available at http://bioonto.de/obo2owl, and can be accessed via a web interface.ConclusionsExplicitly defining relations permits their use in reasoning software and leads to a more flexible and powerful way of representing biomedical ontologies. Using the extended langua0067e and semantics avoids several mistakes commonly made in formalizing biomedical ontologies, and can be used to automatically detect inconsistencies. The use of our method enables the use of graph-based ontologies in OWL, and makes complex OWL ontologies accessible in a graph-based form. Thereby, our method provides the means to gradually move the representation of biomedical ontologies into formal knowledge representation languages that incorporates an explicit semantics. Our method facilitates the use of OWL-based software in the back-end while ontology curators may continue to develop ontologies with an OBO-style front-end.

Symmetric Non-rigid Registration: A Geometric Theory and Some Numerical Techniques

This paper proposes ℒ2- and information-theory-based (IT) non-rigid registration algorithms that are exactly symmetric. Such algorithms pair the same points of two images after the images are swapped. Many commonly-used ℒ2 and IT non-rigid registration algorithms are only approximately symmetric. The asymmetry is due to the objective function as well as due to the numerical techniques used in discretizing and minimizing the objective function. This paper analyzes and provides techniques to eliminate both sources of asymmetry. This paper has five parts. The first part shows that objective function asymmetry is due to the use of standard differential volume forms on the domain of the images. The second part proposes alternate volume forms that completely eliminate objective function asymmetry. These forms, called graph-based volume forms, are naturally defined on the graph of the registration diffeomorphism f, rather than on the domain of f. When pulled back to the domain of f they involve the Jacobian J f and therefore appear “non-standard”. In the third part of the paper, graph-based volume forms are analyzed in terms of four key objective-function properties: symmetry, positive-definiteness, invariance, and lack of bias. Graph-based volume forms whose associated ℒ2 objective functions have the first three properties are completely classified. There is an infinite-dimensional space of such graph-based forms. But within this space, up to scalar multiple, there is a unique volume form whose associated ℒ2 objective function is unbiased. This volume form, which when pulled back to the domain of f is (1+det(J f )) times the standard volume form on Euclidean space, is exactly the differential-geometrically natural volume form on the graph of f. The fourth part of the paper shows how the same volume form also makes the IT objective functions symmetric, positive semi-definite, invariant, and unbiased. The fifth part of the paper introduces a method for removing asymmetry in numerical computations and presents results of numerical experiments. The new objective functions and numerical method are tested on a coronal slice of a 3-D MRI brain image. Numerical experiments show that, even in the presence of noise, the new volume form and numerical techniques reduces asymmetry practically down to machine precision without compromising registration accuracy.

A Graph-Based Unified Technique for Computing and Representing Coefficients over Finite Fields

This paper presents the generalized theory and an efficient graph-based technique for the calculation and representation of coefficients of multivariate canonic polynomials over arbitrary finite fields in any polarity. The technique presented for computing coefficients is unlike polynomial interpolation or matrix-based techniques and takes into consideration efficient graph-based forms which can be available as an existing resource during synthesis, verification, or simulation of digital systems. Techniques for optimization of the graph-based forms for representing the coefficients are also presented. The efficiency of the algorithm increases for larger fields. As a test case, the proposed technique has been applied to benchmark circuits over GF(2m). The experimental results show that the proposed technique can significantly speed up execution time.

Visual knowledge specification for conceptual design: Definition and tool support

Current CAD tools are not able to support the conceptual design phase, and none of them provides a consistency analysis for sketches produced by architects. This phase is fundamental and crucial for the whole design and construction process of a building. To give architects a better support, we developed a CAD tool for conceptual design and a knowledge specification tool. The knowledge is specific to one class of buildings and it can be reused. Based on a dynamic and domain-specific knowledge ontology, different types of design rules formalize this knowledge in a graph-based form. An expressive visual language provides a user-friendly, human readable representation. Finally, a consistency analysis tool enables conceptual designs to be checked against this formal conceptual knowledge. In this article, we concentrate on the knowledge specification part. For that, we introduce the concepts and usage of a novel visual language and describe its semantics. To demonstrate the usability of our approach, two graph-based visual tools for knowledge specification and conceptual design are explained.

Petri-net-based hypertext: document structure with browsing semantics

We present a formal definition of the Trellis model of hypertext and describe an authoring and browsing prototype called αTrellis that is based on the model. The Trellis model not only represents the relationships that tie individual pieces of information together into a document (i.e., the adjacencies), but specifies the browsing semantics to be associated with the hypertext as well (i.e., the manner in which the information is to be visited and presented). The model is based on Petri nets, and is a generalization of existing directed graph-based forms of hypertext. The Petri net basis permits more powerful specification of what is to be displayed when a hypertext is browsed and permits application of previously developed Petri net analysis techniques to verify properties of the hypertext. A number of useful hypertext constructs, easily described in the Trellis model, are presented. These include the synchronization of simultaneous traversals of separate paths through a hypertext, the incorporation of access controls into a hypertext (i.e., specifying nodes that can be proven to be accessible only to certain classes of browsers), and construction of multiple specialized (tailored) versions from a single hypertext.