An automaton model used for validation and type checking with languages defined using R2G2 [1] is presented. First, tree-shaped data is considered to be handled by the automaton model, then the approach is extended to graph shaped data. The presented approach is based on specialized non-deterministic finite state automata. The specialisation copes with unranked tree shaped data. Graph shaped da...

Acacia constricta, "WHITETHORN ACACIA" Drought tolerant, deciduous, Southwest native small tree or large shrub w/ spiny branches & tiny, feathery leaves; flowers are fragrant, yellow bottlebrushes produced summer. [7] (H*W*S*) Acacia greggii, "CATCLAW ACACIA" Drought tolerant, deciduous small tree/large shrub w/ spiny branches & tiny, ferny leaves; flowers are fragrant, creamy yellow bottle-bru...

The KEGG RPAIR database is a collection of biochemical structure transformation patterns, called RDM patterns, and chemical structure alignments of substrate-product pairs (reactant pairs) in all known enzyme-catalyzed reactions taken from the Enzyme Nomenclature and the KEGG PATHWAY database. Here, we present PathPred (http://www.genome.jp/tools/pathpred/), a web-based server to predict plausi...

We study the computational complexity of finding the next most preferred solution in some common formalisms for representing constraints and preferences. The problem is computationally intractable for CSPs, but is polynomial for tree-shaped CSPs and tree-shaped fuzzy CSPs. On the other hand, it is intractable for weighted CSPs, even under restrictions on the constraint graph. For CP-nets, the p...

Abstract. In this paper, we introduce the Tree of Hubs Location Problem with Upgrading, a mixture of the Tree of Hubs Location Problem, presented in [15], and the Minimum Cost Spanning Tree Problem with Upgraded nodes, studied for the first time in [19]. In addition to locate the hubs, to determine the tree that connects the hubs and to allocate non-hub nodes to hubs, a decision has to be made ...

Controlled languages (CLs) are ambiguity-free subsets of natural languages such as English offering a good trade-off between the formal rigor of ontology and query languages and the intuitive appeal of natural language. They compositionally map (modulo a compositional translation τ(·)) into (or express) formal query languages and ontology languages. Modulo compositionality, they inherit the com...

Directed acyclic graphs are commonly used to model scientific workflows, by expressing dependencies between tasks, as well the resource requirements of workflow. As a special case, rooted directed trees occur in several applications. Since typical workflows modeled huge trees, it is crucial schedule them efficiently. We investigate partitioning and mapping tree-shaped on target architectures wh...

Highly efficient tree branch-shaped CuO photocathodes are fabricated using the hybrid microwave annealing process with a silicon susceptor within 10 minutes. The unique hierarchical, one-dimensional structure provides more facile charge transport, larger surface areas, and increased crystallinity and crystal ordering with less defects compared to irregular-shaped CuO prepared by conventional th...