Atlas über alle Theile der Erde in 27 Blättern : für Schulen und zum Selbstunterricht ; nach Schacht's, Pistor's und Zachariä's Lehrbüchern und den neuesten Karten

bearb. von Eduard Wagner

Joannis Oosterdyk Schacht ... Institutiones medicinae practicae ad auditorum potissimum vsus in epitomen redactae et evulgatae.

Mode of access: Internet.

Jo. Oosterdyk Schacht ... Institutiones medicinae practicae ad auditorum potissimum vsus in epitomen redactae et evulgatae.

Mode of access: Internet.

Emerging markets and the international financial architecture: a blueprint for reform

If emerging markets are to achieve their objective of joining the ranks of industrialized, developed countries, they must use their economic and political influence to support radical change in the international financial system. This working paper recommends John Maynard Keynes's "clearing union" as a blueprint for reform of the international financial architecture that could address emerging market grievances more effectively than current approaches. Keynes's proposal for the postwar international system sought to remedy some of the same problems currently facing emerging market economies. It was based on the idea that financial stability was predicated on a balance between imports and exports over time, with any divergence from balance providing automatic financing of the debit countries by the creditor countries via a global clearinghouse or settlement system for trade and payments on current account. This eliminated national currency payments for imports and exports; countries received credits or debits in a notional unit of account fixed to national currency. Since the unit of account could not be traded, bought, or sold, it would not be an international reserve currency. The credits with the clearinghouse could only be used to offset debits by buying imports, and if not used for this purpose they would eventually be extinguished; hence the burden of adjustment would be shared equally - credit generated by surpluses would have to be used to buy imports from the countries with debit balances. Emerging market economies could improve upon current schemes for regionally governed financial institutions by using this proposal as a template for the creation of regional clearing unions using a notional unit of account.

Weak hypergraph regularity and linear hypergraphs

We consider conditions which allow the embedding of linear hypergraphs of fixed size. In particular, we prove that any k-uniform hypergraph H of positive uniform density contains all linear k-uniform hypergraphs of a given size. More precisely, we show that for all integers l >= k >= 2 and every d > 0 there exists Q > 0 for which the following holds: if His a sufficiently large k-uniform hypergraph with the property that the density of H induced on every vertex subset of size on is at least d, then H contains every linear k-uniform hypergraph F with l vertices. The main ingredient in the proof of this result is a counting lemma for linear hypergraphs, which establishes that the straightforward extension of graph epsilon-regularity to hypergraphs suffices for counting linear hypergraphs. We also consider some related problems. (C) 2009 Elsevier Inc. All rights reserved.

Sparse partition universal graphs for graphs of bounded degree

In 1983, Chvatal, Trotter and the two senior authors proved that for any Delta there exists a constant B such that, for any n, any 2-colouring of the edges of the complete graph K(N) with N >= Bn vertices yields a monochromatic copy of any graph H that has n vertices and maximum degree Delta. We prove that the complete graph may be replaced by a sparser graph G that has N vertices and O(N(2-1/Delta)log(1/Delta)N) edges, with N = [B`n] for some constant B` that depends only on Delta. Consequently, the so-called size-Ramsey number of any H with n vertices and maximum degree Delta is O(n(2-1/Delta)log(1/Delta)n) Our approach is based on random graphs; in fact, we show that the classical Erdos-Renyi random graph with the numerical parameters above satisfies a stronger partition property with high probability, namely, that any 2-colouring of its edges contains a monochromatic universal graph for the class of graphs on n vertices and maximum degree Delta. The main tool in our proof is the regularity method, adapted to a suitable sparse setting. The novel ingredient developed here is an embedding strategy that allows one to embed bounded degree graphs of linear order in certain pseudorandom graphs. Crucial to our proof is the fact that regularity is typically inherited at a scale that is much finer than the scale at which it is assumed. (C) 2011 Elsevier Inc. All rights reserved.

Biogeografia de formações vegetais: classificação de um encrave vegetacional : Parque Estadual do Rio Turvo, Barra do Turvo, SP

Pós-graduação em Geografia - IGCE

Comparison of Botanical Composition, Soil Carbon Content, and Root Distribution of Subirrigated Meadows in The Nebraska Sandhills

Characterizing vegetation composition, carbon/nitrogen (C/N) content of soils, and root-mass distribution is critical to understanding carbon sequestration potential of subirrigated meadows in the Nebraska Sandhills. Five subirrigated meadows dominated by cool-season (C3) graminoids and five meadows dominated by warm-season (C4) grasses were selected throughout the Nebraska Sandhills. Vegetation, soil carbon and nitrogen, and root-mass density distribution were sampled in each meadow. Meadows dominated by C3 vegetation had 12% greater (P < 0.1) yields than meadows dominated by C4 vegetation. Total root-mass density was 30% greater (P < 0.1) in C4-dominated meadows than C3-dominated meadows. Total carbon and nitrogen content was 65% and 53% greater (P < 0.1), respectively, in the A horizon of C3-dominated meadows, but was 43% and 52% greater (P < 0.1), respectively, in the C horizon of C4-dominated meadows. Although meadows dominated by C3 vegetation had more carbon in the soil profile, much of the carbon in C3-dominated meadows appeared to be recalcitrant C4 carbon from historic vegetation.

Weak quasi-randomness for uniform hypergraphs

We study quasi-random properties of k-uniform hypergraphs. Our central notion is uniform edge distribution with respect to large vertex sets. We will find several equivalent characterisations of this property and our work can be viewed as an extension of the well known Chung-Graham-Wilson theorem for quasi-random graphs. Moreover, let K(k) be the complete graph on k vertices and M(k) the line graph of the graph of the k-dimensional hypercube. We will show that the pair of graphs (K(k),M(k)) has the property that if the number of copies of both K(k) and M(k) in another graph G are as expected in the random graph of density d, then G is quasi-random (in the sense of the Chung-Graham-Wilson theorem) with density close to d. (C) 2011 Wiley Periodicals, Inc. Random Struct. Alg., 40, 1-38, 2012

Differential 3-year effects of first- versus second-generation antipsychotics on subjective well-being in schizophrenia using marginal structural models

This study examined the differential effects of first- (FGAs) versus second-generation antipsychotics (SGAs) on subjective well-being in patients with schizophrenia.