An XML enabled framework for representation of association rules in databases was first presented in [4]. In Frequent Structure Mining (FSM), one of the popular approaches is to use graph matching that use data structures such as the adjacency matrix [7] or adjacency list [8]. Another approach represents semistructured tree-like structures using a string representation, which is more space effi...

We agree with Ms Cameron that careful experimental design is required when doing clinical research on living subjects. In addition to being important to clinical research, it also is required when doing experimental pain research such as ours. We, like Ms Cameron, also look forward to seeing in the Journal a clinical study regarding the different effects of TENS applied to various sets of acupu...

Horizontal placement of nodes in tree layout or layered drawings of directed graphs can be modelled as a convex quadratic program. Thus, quadratic programming provides a declarative framework for specifying such layouts which can then be solved optimally with a standard quadratic programming solver. While slower than specialized algorithms, the quadratic programming approach is fast enough for ...

The research aimed to introduce newly designed features for speech signal. The newly developed features are designed to normalize the dynamic structure of best tree decomposition of wavelet packets. The 4 points encoded vector is a full of information just like the original best tree’s structure. It is a loss less encoding system that grantees 100% reconstruction of the original best tree. The ...

We present a tool suite for working with hierarchical bus schedule/arbitration descriptions for nodes sharing a bus in real-time applications. These schedules can be based on a variety of factors including time slicing and the characteristics of messages. These schedules are represented in a tree-like structure. Using this structure we can describe many popular arbitration schemes, and automati...

While it was defined long ago, the extension of CTL with quantification over atomic propositions has never been studied extensively. Considering two different semantics (depending whether propositional quantification refers to the Kripke structure or to its unwinding tree), we study its expressiveness (showing in particular that QCTL coincides with Monadic Second-Order Logic for both semantics)...

While it was defined long ago, the extension of CTL with quantification over atomic propositions has never been studied extensively. Considering two different semantics (depending whether propositional quantification refers to the Kripke structure or to its unwinding tree), we study its expressiveness (showing in particular that QCTL coincides with Monadic Second-Order Logic for both semantics)...

The goal of this study is to develop an automatic supervised classification strategy and to find the necessary data sources to perform automatic tree species classification on single tree level for a large area. The derived forest map is used in a virtual forest testbed to estimate additional forest parameters like diameter at breast height and volume at single tree and stand level. A virtual f...

In many applications, graphs are a natural representation for the structure of a problem domain. Since functional languages supports only (tree-structured) algebraic datatypes, there are various ways to represent graphs in declarative languages. In this paper we describe a representation of graphs in a functional logic language. Our representation is compositional as lists or tree structures ar...

BACKGROUND The enumeration of chemical graphs (molecular graphs) satisfying given constraints is one of the fundamental problems in chemoinformatics and bioinformatics because it leads to a variety of useful applications including structure determination and development of novel chemical compounds. RESULTS We consider the problem of enumerating chemical graphs with monocyclic structure (a gra...