Of sets of offsets: Cumulative impacts and strategies for compensatory restoration

Biodiversity offsets are increasingly advocated as a flexible approach to managing the ecological costs of economic development. Arguably, however, this remains an area where policy-making has run ahead of science. A growing number of studies identify limitations of offsets in achieving ecologically sustainable outcomes, pointing to ethical and implementation issues that may undermine their effectiveness. We develop a novel system dynamic modelling framework to analyze the no net loss objective of development and biodiversity offsets. The modelling framework considers a marine-based example, where resource abundance depends on a habitat that is affected by a sequence of development projects, and biodiversity offsets are understood as habitat restoration actions. The model is used to explore the implications of four alternative offset management strategies for a regulator, which differ in how net loss is measured, and whether and how the cumulative impacts of development are considered. Our results confirm that, when it comes to offsets as a conservation tool, the devil lies in the details. Approaches to determining the magnitude of offsets required, as well as their timing and allocation among multiple developers, can result in potentially complex and undesired sets of economic incentives, with direct impacts on the ability to meet the overall objective of ecologically sustainable development. The approach and insights are of direct interest to conservation policy design in a broad range of marine and coastal contexts.

The Productive use of Failure to Generate Witnesses from Divergent Proof Attempts for Coinduction

Coinduction is a proof rule. It is the dual of induction. It allows reasoning about non--well--founded structures such as lazy lists or streams and is of particular use for reasoning about equivalences. A central difficulty in the automation of coinductive proof is the choice of a relation (called a bisimulation). We present an automation of coinductive theorem proving. This automation is based on the idea of proof planning. Proof planning constructs the higher level steps in a proof, using knowledge of the general structure of a family of proofs and exploiting this knowledge to control the proof search. Part of proof planning involves the use of failure information to modify the plan by the use of a proof critic which exploits the information gained from the failed proof attempt. Our approach to the problem was to develop a strategy that makes an initial simple guess at a bisimulation and then uses generalisation techniques, motivated by a critic, to refine this guess, so that a larger class of coinductive problems can be automatically verified. The implementation of this strategy has focused on the use of coinduction to prove the equivalence of programs in a small lazy functional language which is similar to Haskell. We have developed a proof plan for coinduction and a critic associated with this proof plan. These have been implemented in CoClam, an extended version of Clam with encouraging results. The planner has been successfully tested on a number of theorems.

Random Mating Between Two Widely Divergent Mitochondrial Lineages of Cryptolestes ferrugineus (Coleoptera: Laemophloeidae): A Test of Species Limits in a Phosphine-Resistant Stored Product Pest

Effective pest management relies on accurate delimitation of species and, beyond this, on accurate species identification. Mitochondrial COI sequences are useful for providing initial indications in delimiting species but, despite acknowledged limitations in the method, many studies involving COI sequences and species problems remain unresolved. Here we illustrate how such impasses can be resolved with microsatellite and nuclear sequence data, to assess more directly the amount of gene flow between divergent lineages. We use a population genetics approach to test for random mating between two 8 ± 2% divergent COI lineages of the rusty grain beetle, Cryptolestes ferrugineus (Stephens). This species has become strongly resistant to phosphine, a fumigant used worldwide for disinfesting grain. The possibility of cryptic species would have significant consequences for resistance management, especially if resistance was confined to one mitochondrial lineage. We find no evidence of restricted gene flow or nonrandom mating across the two COI lineages of these beetles, rather we hypothesize that historic population structure associated with early Pleistocene climate changes likely contributed to divergent lineages within this species.

Savani: A variable resolution whole-mantle model of anisotropic shear velocity variations based on multiple data sets

International audience

Regular homomorphisms of minimal sets

The classification of minimal sets is a central theme in abstract topological dynamics. Recently this work has been strengthened and extended by consideration of homomorphisms. Background material is presented in Chapter I. Given a flow on a compact Hausdorff space, the action extends naturally to the space of closed subsets, taken with the Hausdorff topology. These hyperspaces are discussed and used to give a new characterization of almost periodic homomorphisms. Regular minimal sets may be described as minimal subsets of enveloping semigroups. Regular homomorphisms are defined in Chapter II by extending this notion to homomorphisms with minimal range. Several characterizations are obtained. In Chapter III, some additional results on homomorphisms are obtained by relativizing enveloping semigroup notions. In Veech's paper on point distal flows, hyperspaces are used to associate an almost one-to-one homomorphism with a given homomorphism of metric minimal sets. In Chapter IV, a non-metric generalization of this construction is studied in detail using the new notion of a highly proximal homomorphism. An abstract characterization is obtained, involving only the abstract properties of homomorphisms. A strengthened version of the Veech Structure Theorem for point distal flows is proved. In Chapter V, the work in the earlier chapters is applied to the study of homomorphisms for which the almost periodic elements of the associated hyperspace are all finite. In the metric case, this is equivalent to having at least one fiber finite. Strong results are obtained by first assuming regularity, and then assuming that the relative proximal relation is closed as well.

Almost Disjoint Families of Representing Sets

The thesis is concerned with a number of problems in Combinatorial Set Theory. The Generalized Continuum Hypothesis is assumed. Suppose X and K are non-zero cardinals. By successively identifying K with airwise disjoint sets of power K, a function/: X-*•K can be viewed as a transversal of a pairwise disjoint (X, K)family A . Questions about families of functions in K can thus bethought of as referring to families of transversals of A. We wish to consider generalizations of such questions to almost disjoint families; in particular we are interested in extensions of the following two problems: (i) What is the 'maximum' cardinality of an almost disjoint family of functions each mapping X into K? (ii) Describe the cardinalities of maximal almost disjoint families of functions each mapping X into K. Article in Bulletin of the Australian Mathematical Society 27(03):477 - 479 · June 1983  

Evolutionarily conserved mechanisms of male germline development in flowering plants and animals

Sexual reproduction is the main reproductive strategy of the overwhelming majority of eukaryotes. This suggests that the last eukaryotic common ancestor was able to reproduce sexually. Sexual reproduction reflects the ability to perform meiosis, and ultimately generating gametes, which are cells that carry recombined half sets of the parental genome and are able to fertilize. These functions have been allocated to a highly specialized cell lineage: the germline. Given its significant evolutionary conservation, it is to be expected that the germline programme shares common molecular bases across extremely divergent eukaryotic species. In the present review, we aim to identify the unifying principles of male germline establishment and development by comparing two very disparate kingdoms: plants and animals. We argue that male meiosis defines two temporally regulated gene expression programmes: the first is required for meiotic commitment, and the second is required for the acquisition of fertilizing ability. Small RNA pathways are a further key communality, ultimately ensuring the epigenetic stability of the information conveyed by the male germline.

Teaching / learning process through the case method in the law degree

This project in teaching innovation and improvement aims to disseminate the case method as one of the most innovative educational instruments inteaching of Law in general, and specifically with regard to Family and Inheritance Law. The methodology used ensures learning through a legal conflict, which must be resolved by the students themselves from different viewpoints as legal agents. This is an activity in teaching innovation, in which students become the protagonists. Participation is voluntary, and the main aim is student motivation. The subject's aim is for students to learn public speaking skills fundamental to the profession while familiarising themselves with judicial practice. Theteacher sets up a legal conflict in order for students to resolve the dispute as legal agents with divergent viewpoints - in other words, as judges, attorneys, lawyers and so on. The project seeks alternatives to traditional teaching methods and is an innovative teaching method aimed at professionally training future lawyers as well as being a model that involves students more in their own learning.

Biological and molecular characterization of a highly divergent johnsongrass mosaic virus isolate from Pennisetum purpureum.

2016

On Ordinal VC-Dimension and Some Notions of Complexity

We generalize the classical notion of Vapnik–Chernovenkis (VC) dimension to ordinal VC-dimension, in the context of logical learning paradigms. Logical learning paradigms encompass the numerical learning paradigms commonly studied in Inductive Inference. A logical learning paradigm is defined as a set W of structures over some vocabulary, and a set D of first-order formulas that represent data. The sets of models of ϕ in W, where ϕ varies over D, generate a natural topology W over W. We show that if D is closed under boolean operators, then the notion of ordinal VC-dimension offers a perfect characterization for the problem of predicting the truth of the members of D in a member of W, with an ordinal bound on the number of mistakes. This shows that the notion of VC-dimension has a natural interpretation in Inductive Inference, when cast into a logical setting. We also study the relationships between predictive complexity, selective complexity—a variation on predictive complexity—and mind change complexity. The assumptions that D is closed under boolean operators and that W is compact often play a crucial role to establish connections between these concepts. We then consider a computable setting with effective versions of the complexity measures, and show that the equivalence between ordinal VC-dimension and predictive complexity fails. More precisely, we prove that the effective ordinal VC-dimension of a paradigm can be defined when all other effective notions of complexity are undefined. On a better note, when W is compact, all effective notions of complexity are defined, though they are not related as in the noncomputable version of the framework.