Ecosystem maps are foundational tools that support multi-disciplinary study design and applications including wildlife habitat assessment, monitoring and Earth-system modeling. Here, we present continuous-field cover maps for tundra plant functional types (PFTs) across ~125,000 km2 of Alaska’s North Slope at 30-m resolution. To develop maps, we collected a field-based training dataset using a p...

The Papuk Mt. belongs to the Slavonian Mountains in Croatia. It is situated in the southernmost part of the Tisza Megaunit (Fig. 1). Comprehensive reviews of the geological setting of this area are given by JAMIČIĆ & BRKIĆ (1987), JAMIČIĆ (1989) and KOROLIJA & JAMIČIĆ (1989). VRAGOVIĆ (1965) gave a detailed petrographic description of the gneisses, granitoids and the pegmatites of this region. ...

how to cite this article: karimzadeh p, jafari n, nejad biglari hb, jabbehdari s, alizadeh m, alizadeh gh, nejad biglari hm, sanii s. the clinical features and diagnosis of adrenoleukodystrophy: a case series of iranian family. iran j child neurol. winter 2016; 10(1):61-64. abstract objective adrenoleukodystrophy disorder is one of the x-linked genetic disorders caused by the myelin sheath brea...

A subset S of vertices of a graph G is called a k-path vertex cover if every path of order k in G contains at least one vertex from S. Denote by ψk(G) the minimum cardinality of a k-path vertex cover in G. In this article a lower and an upper bound for ψk of the rooted product graphs are presented. Two characterizations are given when those bounds are attained. Moreover ψ2 and ψ3 are exactly de...

No part of this book may be reproduced, in any form or by any means, without permission in writing from the author. Cover picture: Three dimensional schematic representation of the steps that lead to controller design. The fish is cloned for scientific purposes only, without permission of the Dutch government.

We show that for each integer h ≥ 2, there exists a least positive integer ch so that if P is a poset having a planar cover graph and the height of P is h, then the dimension of P is at most ch. Trivially, c1 = 2. Also, Felsner, Li and Trotter showed that c2 exists and is 4, but their proof techniques do not seem to apply when h ≥ 3. We focus on establishing the existence of ch, although we sus...

We consider capacitated vertex cover with hard capacity constraints (VC-HC) on hypergraphs. In this problem we are given a hypergraph G = (V,E) with a maximum edge size f . Each edge is associated with a demand and each vertex is associated with a weight (cost), a capacity, and an available multiplicity. The objective is to find a minimum-weight vertex multiset such that the demands of the edge...

Let G = (X, Y; E) be a balanced bipartite graph of order 2n. The path-cover number pc(H) of a graph H is the minimum number of vertex-disjoint paths that use up all the vertices of H. S ⊆ V(G) is called a balanced set of G if |S ∩ X| = |S ∩ Y|. In this paper, we will give some sufficient conditions for a balanced bipartite graph G satisfying that for every balanced set S, there is a bi-cycle of...