Integrated modelling approaches to analysis of climate change impacts on forests and forest management

This paper reviews integrated economic and ecological models that address impacts and adaptation to climate change in the forest sector. Early economic model studies considered forests as one out of many possible impacts of climate change, while ecological model studies tended to limit the economic impacts to fixed price-assumptions. More recent studies include broader representations of both systems, but there are still few studies which can be regarded fully integrated. Full integration of ecological and economic models is needed to address forest management under climate change appropriately. The conclusion so far is that there are vast uncertainties about how climate change affects forests. This is partly due to the limited knowledge about the global implications of the social and economical adaptation to the effects of climate change on forests.

A Passive Hopper With Lossless Collisions

A passive vertical hopping robot is here highly idealised as two vertically arranged masses acted on by gravity and coupled by a linear spring. The lower mass makes dead (e = 0) collisions with the rigid ground. The equations of motion can be reduced to a one dimensional map. Fixed points of the map are found in which case the robot hops incessantly. For these conservative solutions the lower mass collides with the ground with zero impact velocity. The interval of attraction for these conservative fixed points depends on system parameters.

A Fast Linear Separability Test by Projection of Positive Points on Subspaces

A geometric and non parametric procedure for testing if two finite set of points are linearly separable is proposed. The Linear Separability Test is equivalent to a test that determines if a strictly positive point h > 0 exists in the range of a matrix A (related to the points in the two finite sets). The algorithm proposed in the paper iteratively checks if a strictly positive point exists in a subspace by projecting a strictly positive vector with equal co-ordinates (p), on the subspace. At the end of each iteration, the subspace is reduced to a lower dimensional subspace. The test is completed within r ≤ min(n, d + 1) steps, for both linearly separable and non separable problems (r is the rank of A, n is the number of points and d is the dimension of the space containing the points). The worst case time complexity of the algorithm is O(nr3) and space complexity of the algorithm is O(nd). A small review of some of the prominent algorithms and their time complexities is included. The worst case computational complexity of our algorithm is lower than the worst case computational complexity of Simplex, Perceptron, Support Vector Machine and Convex Hull Algorithms, if d

Renormalization of noncommutative quantum field theories

We report on a comprehensive analysis of the renormalization of noncommutative phi(4) scalar field theories on the Groenewold-Moyal plane. These scalar field theories are twisted Poincare invariant. Our main results are that these scalar field theories are renormalizable, free of UV/IR mixing, possess the same fixed points and beta-functions for the couplings as their commutative counterparts. We also argue that similar results hold true for any generic noncommutative field theory with polynomial interactions and involving only pure matter fields. A secondary aim of this work is to provide a comprehensive review of different approaches for the computation of the noncommutative S-matrix: noncommutative interaction picture and noncommutative Lehmann-Symanzik-Zimmermann formalism. DOI: 10.1103/PhysRevD.87.064014

Attractive holographic c-functions

Using the attractor mechanism for extremal solutions in N = 2 gauged supergravity, we construct a c-function that interpolates between the central charges of theories at ultraviolet and infrared conformal fixed points corresponding to anti-de Sitter geometries. The c-function we obtain is couched purely in terms of bulk quantities and connects two different dimensional CFTs at the stable conformal fixed points under the RG flow.

Response to ``Comment on `Frequency-domain stimulated and spontaneous light emission signals at molecular junctions''' J. Chem. Phys. 142, 137101 (2015)]

In a recent work [U. Harbola, B. K. Agrawalla, and S. Mukamel, J. Chem. Phys. 141, 074107 (2014)], we have presented a superoperator (Liouville space) diagrammatic formulation of spontaneous and stimulated optical signals from current-carrying molecular junctions. We computed the diagrams that contribute to the spontaneous light emission SLE (fluorescence and Raman) signal using a diagrammatic method which clearly distinguishes between the Raman and the fluorescence contributions. We pointed out some discrepancies with the work of Galperin, Ratner and Nitzan (GRN) [M. Galperin, M. A. Ratner and, A. Nitzan, J. Chem. Phys. 130, 144109 (2009)]. In their response [M. Galperin, M. A. Ratner and A. Nitzan, “Comment on‘ Frequency-domain stimulated and spontaneous light emission signals at molecular junctions’” [J. Chem. Phys. 141, 074107 (2014)], J. Chem. Phys. 142, 137101 (2015)] to our work, GRN have argued that there are no differences in the choice of Raman diagrams in both works. Here we reply to their points and show where the differences exist.

On a Class of Self-Adjoint Compact Operators in Hilbert Spaces and Their Relations with Their Finite-Range Truncations

This paper investigates a class of self-adjoint compact operators in Hilbert spaces related to their truncated versions with finite-dimensional ranges. The comparisons are established in terms of worst-case norm errors of the composite operators generated from iterated computations. Some boundedness properties of the worst-case norms of the errors in their respective fixed points in which they exist are also given. The iterated sequences are expanded in separable Hilbert spaces through the use of numerable orthonormal bases.

Möbius-like groups of homeomorphisms of the circle

A group G → Homeo_+(S^1) is a Möbius-like group if every element of G is conjugate in Homeo(S^1) to a Mobius transformation. Our main result is: given a Mobus like like group G which has at least one global fixed point, G is conjugate in Homeo(S^1) to a Möbius group if and only if the limit set of G is all of S^1 . Moreover, we prove that if the limit set of G is not SI, then after identifying some closed subintervals of S^1 to points, the induced action of G is conjugate to an action of a Möbius group.

We also show that the above result does not hold in the case when G has no global fixed points. Namely, we construct examples of Möbius-like groups with limit set equal to S^1, but these groups cannot be conjugated to Möbius groups.

Branes and supersymmetric quantum field theories

Since the discovery of D-branes as non-perturbative, dynamic objects in string theory, various configurations of branes in type IIA/B string theory and M-theory have been considered to study their low-energy dynamics described by supersymmetric quantum field theories.

One example of such a construction is based on the description of Seiberg-Witten curves of four-dimensional N = 2 supersymmetric gauge theories as branes in type IIA string theory and M-theory. This enables us to study the gauge theories in strongly-coupled regimes. Spectral networks are another tool for utilizing branes to study non-perturbative regimes of two- and four-dimensional supersymmetric theories. Using spectral networks of a Seiberg-Witten theory we can find its BPS spectrum, which is protected from quantum corrections by supersymmetry, and also the BPS spectrum of a related two-dimensional N = (2,2) theory whose (twisted) superpotential is determined by the Seiberg-Witten curve. When we don’t know the perturbative description of such a theory, its spectrum obtained via spectral networks is a useful piece of information. In this thesis we illustrate these ideas with examples of the use of Seiberg-Witten curves and spectral networks to understand various two- and four-dimensional supersymmetric theories.

First, we examine how the geometry of a Seiberg-Witten curve serves as a useful tool for identifying various limits of the parameters of the Seiberg-Witten theory, including Argyres-Seiberg duality and Argyres-Douglas fixed points. Next, we consider the low-energy limit of a two-dimensional N = (2, 2) supersymmetric theory from an M-theory brane configuration whose (twisted) superpotential is determined by the geometry of the branes. We show that, when the two-dimensional theory flows to its infra-red fixed point, particular cases realize Kazama-Suzuki coset models. We also study the BPS spectrum of an Argyres-Douglas type superconformal field theory on the Coulomb branch by using its spectral networks. We provide strong evidence of the equivalence of superconformal field theories from different string-theoretic constructions by comparing their BPS spectra.

Effects of human activities on migratory waterbirds at Lashihai Lake, China

Surveys on migratory waterbirds and their habitats at Lashihai Lake, China, were conducted from October 1999 to April 2000. Five fixed points, representing different degrees of habitat disturbance and quality, were selected around the lake. We used counts (n = 30) to compare diversity and abundance of waterbirds at each point and evaluate the effects of habitat disturbance. The distribution of waterbirds was affected by disturbance, with snore than one-third of the total species and nearly half of the total individuals occurring at the least disturbed point. Species richness was weakly and abundance was strongly correlated to habitat disturbance, but not to habitat quality. Habitat destruction and use of canoes were prominent at the lake. Naxi ethnic fishermen (n = 37) were interviewed. They caught 570 waterbirds between October 1999 and March 2000 in fishing nets. An estimation of the total number of waterbirds been trapped on the lake is 6164. Diving species were most susceptible. Conservation measures that should implement immediately include the cessation of habitat destruction, better plan for the development of tourism, a reduction in the number of canoes and zoning of the non-fishing area. (C) 2002 Elsevier Science Ltd. All rights reserved.

The Category-Theoretic Solution of Recursive Domain Equations

Recursive specifications of domains plays a crucial role in denotational semantics as developed by Scott and Strachey and their followers. The purpose of the present paper is to set up a categorical framework in which the known techniques for solving these equations find a natural place. The idea is to follow the well-known analogy between partial orders and categories, generalizing from least fixed-points of continuous functions over cpos to initial ones of continuous functors over $\omega $-categories. To apply these general ideas we introduce Wand's ${\bf O}$-categories where the morphism-sets have a partial order structure and which include almost all the categories occurring in semantics. The idea is to find solutions in a derived category of embeddings and we give order-theoretic conditions which are easy to verify and which imply the needed categorical ones. The main tool is a very general form of the limit-colimit coincidence remarked by Scott. In the concluding section we outline how compatibility considerations are to be included in the framework. A future paper will show how Scott's universal domain method can be included too.

Microsatellite-centromere distances and microsatellite diversity in different ploidy classes of Chinese shrimp (Fenneropenaeus Chinensis)

This is the first report of microsatellite-centromere mapping in this commercial species Fenneropenaeus Chinensis, and will be important for providing fixed points in the linkage groups of genetic maps. Triploid Chinese shrimp was induced by heat shock. The fertilized eggs were treated either by retention of the first polar body or the second polar body to produce Meiosis I (MI) or Meiosis II (MII) triploid. The triploidy status in each Chinese shrimp could be confirmed by nine polymorphic microsatellite loci, in which the parents with different alleles and the female parents were each heterozygous. The nine loci were mapped in relation to their centromeres in three MII triploid families, which were induced by retention of the second polar bodies after fertilization with sperm. Microsatellite-centromere (M-C) distances ranged from 9.6 cM to 37 cM under the assumption of complete interference. Information on the positions of centromeres in relation to the microsatellite loci will represent a contribution towards assembly of genetic maps in F. chinensis. Twelve polymorphic microsatellites were used to assess the heterozygosity and allelic diversity in different ploidy classes. As expected, triploids were significantly more polymorphic than diploids. The diploids had an average heterozygosity and allelic diversity value of 0.86, whereas the triploids heterozygosity averaged 0.93 and had allelic diversity value of 1.29. However, MI triploids were not significantly more polymorphic than MII in the microsatellite loci.

Stable Mixing of Complete and Incomplete Information

An increasing number of parameter estimation tasks involve the use of at least two information sources, one complete but limited, the other abundant but incomplete. Standard algorithms such as EM (or em) used in this context are unfortunately not stable in the sense that they can lead to a dramatic loss of accuracy with the inclusion of incomplete observations. We provide a more controlled solution to this problem through differential equations that govern the evolution of locally optimal solutions (fixed points) as a function of the source weighting. This approach permits us to explicitly identify any critical (bifurcation) points leading to choices unsupported by the available complete data. The approach readily applies to any graphical model in O(n^3) time where n is the number of parameters. We use the naive Bayes model to illustrate these ideas and demonstrate the effectiveness of our approach in the context of text classification problems.

Foundations of Actor Semantics

The actor message-passing model of concurrent computation has inspired new ideas in the areas of knowledge-based systems, programming languages and their semantics, and computer systems architecture. The model itself grew out of computer languages such as Planner, Smalltalk, and Simula, and out of the use of continuations to interpret imperative constructs within A-calculus. The mathematical content of the model has been developed by Carl Hewitt, Irene Greif, Henry Baker, and Giuseppe Attardi. This thesis extends and unifies their work through the following observations. The ordering laws postulated by Hewitt and Baker can be proved using a notion of global time. The most general ordering laws are in fact equivalent to an axiom of realizability in global time. Independence results suggest that some notion of global time is essential to any model of concurrent computation. Since nondeterministic concurrency is more fundamental than deterministic sequential computation, there may be no need to take fixed points in the underlying domain of a power domain. Power domains built from incomplete domains can solve the problem of providing a fixed point semantics for a class of nondeterministic programming languages in which a fair merge can be written. The event diagrams of Greif's behavioral semantics, augmented by Baker's pending events, form an incomplete domain. Its power domain is the semantic domain in which programs written in actor-based languages are assigned meanings. This denotational semantics is compatible with behavioral semantics. The locality laws postulated by Hewitt and Baker may be proved for the semantics of an actor-based language. Altering the semantics slightly can falsify the locality laws. The locality laws thus constrain what counts as an actor semantics.

Collocation Games and Their Application to Distributed Resource Management

We introduce Collocation Games as the basis of a general framework for modeling, analyzing, and facilitating the interactions between the various stakeholders in distributed systems in general, and in cloud computing environments in particular. Cloud computing enables fixed-capacity (processing, communication, and storage) resources to be offered by infrastructure providers as commodities for sale at a fixed cost in an open marketplace to independent, rational parties (players) interested in setting up their own applications over the Internet. Virtualization technologies enable the partitioning of such fixed-capacity resources so as to allow each player to dynamically acquire appropriate fractions of the resources for unencumbered use. In such a paradigm, the resource management problem reduces to that of partitioning the entire set of applications (players) into subsets, each of which is assigned to fixed-capacity cloud resources. If the infrastructure and the various applications are under a single administrative domain, this partitioning reduces to an optimization problem whose objective is to minimize the overall deployment cost. In a marketplace, in which the infrastructure provider is interested in maximizing its own profit, and in which each player is interested in minimizing its own cost, it should be evident that a global optimization is precisely the wrong framework. Rather, in this paper we use a game-theoretic framework in which the assignment of players to fixed-capacity resources is the outcome of a strategic "Collocation Game". Although we show that determining the existence of an equilibrium for collocation games in general is NP-hard, we present a number of simplified, practically-motivated variants of the collocation game for which we establish convergence to a Nash Equilibrium, and for which we derive convergence and price of anarchy bounds. In addition to these analytical results, we present an experimental evaluation of implementations of some of these variants for cloud infrastructures consisting of a collection of multidimensional resources of homogeneous or heterogeneous capacities. Experimental results using trace-driven simulations and synthetically generated datasets corroborate our analytical results and also illustrate how collocation games offer a feasible distributed resource management alternative for autonomic/self-organizing systems, in which the adoption of a global optimization approach (centralized or distributed) would be neither practical nor justifiable.