Home range and habitat use by Kemp's Ridley turtles in West-Central Florida

The Kemp's ridley turtle (Lepidochelys kempii) is an endangered species whose recovery depends in part on the identification and protection of required habitats. We used radio and sonic telemetry on subadult Kemp's ridley turtles to investigate home-range size and habitat use in the coastal waters of west-central Florida from 1994 to 1996. We tracked 9 turtles during May-August up to 70 days after release and fou.ld they occupied 5-30 km2 foraging ranges. Compositional analyses indicated that turtles used rock outcroppings in their foraging ranges at a significantly higher proportion than expected. based on availability within the study area. Additionally. turtles used live bottom (e.g .• sessile invertebrates) and green macroalgae habitats significantly more than seagrass habitat. Similar studies are needed through'mt the Kemp's ridley turtles' range to investigate regional and stage-specific differences in habitat use. which can then be used to conserve important foraging areas

How universal is the one-particle Green's function of a Luttinger liquid?

The one-particle Green's function of the Tomonaga-Luttinger model for one-dimensional interacting Fermions is discussed. Far away from the origin of the plane of space-time coordinates the function falls off like a power law. The exponent depends on the direction within the plane. For a certain form of the interaction potential or within an approximated cut-off procedure the different exponents only depend on the strength of the interaction at zero momentum and can be expressed in terms of the Luttinger liquid parameters $K_{\rho}$ and $K_{\sigma}$ of the model at hand. For a more general interaction and directions which are determined by the charge velocity $v_{\rho}$ and spin velocity $v_{\sigma}$ the exponents also depend on the smoothness of the interaction at zero momentum and the asymptotic behavior of the Green's function is not given by the Luttinger liquid parameters alone. This shows that the physics of large space-time distances in Luttinger liquids is less universal than is widely believed.Comment: 5 pages with 2 figure

Surface characterization and surface electronic structure of organic quasi-one-dimensional charge transfer salts

We have thoroughly characterized the surfaces of the organic charge-transfer salts TTF-TCNQ and (TMTSF)2PF6 which are generally acknowledged as prototypical examples of one-dimensional conductors. In particular x-ray induced photoemission spectroscopy turns out to be a valuable non-destructive diagnostic tool. We show that the observation of generic one-dimensional signatures in photoemission spectra of the valence band close to the Fermi level can be strongly affected by surface effects. Especially, great care must be exercised taking evidence for an unusual one-dimensional many-body state exclusively from the observation of a pseudogap.Comment: 11 pages, 12 figures, v2: minor changes in text and figure labellin

Electronic structure of the quasi-one-dimensional organic conductor TTF-TCNQ

We study the electronic structure of the quasi-one-dimensional organic conductor TTF-TCNQ by means of density-functional band theory, Hubbard model calculations, and angle-resolved photoelectron spectroscopy (ARPES). The experimental spectra reveal significant quantitative and qualitative discrepancies to band theory. We demonstrate that the dispersive behavior as well as the temperature-dependence of the spectra can be consistently explained by the finite-energy physics of the one-dimensional Hubbard model at metallic doping. The model description can even be made quantitative, if one accounts for an enhanced hopping integral at the surface, most likely caused by a relaxation of the topmost molecular layer. Within this interpretation the ARPES data provide spectroscopic evidence for the existence of spin-charge separation on an energy scale of the conduction band width. The failure of the one-dimensional Hubbard model for the {\it low-energy} spectral behavior is attributed to interchain coupling and the additional effect of electron-phonon interaction.Comment: 18 pages, 9 figure

50 Years of Test (Un)fairness: Lessons for Machine Learning

Quantitative definitions of what is unfair and what is fair have been introduced in multiple disciplines for well over 50 years, including in education, hiring, and machine learning. We trace how the notion of fairness has been defined within the testing communities of education and hiring over the past half century, exploring the cultural and social context in which different fairness definitions have emerged. In some cases, earlier definitions of fairness are similar or identical to definitions of fairness in current machine learning research, and foreshadow current formal work. In other cases, insights into what fairness means and how to measure it have largely gone overlooked. We compare past and current notions of fairness along several dimensions, including the fairness criteria, the focus of the criteria (e.g., a test, a model, or its use), the relationship of fairness to individuals, groups, and subgroups, and the mathematical method for measuring fairness (e.g., classification, regression). This work points the way towards future research and measurement of (un)fairness that builds from our modern understanding of fairness while incorporating insights from the past.Comment: FAT* '19: Conference on Fairness, Accountability, and Transparency (FAT* '19), January 29--31, 2019, Atlanta, GA, US

Tropically convex constraint satisfaction

A semilinear relation S is max-closed if it is preserved by taking the componentwise maximum. The constraint satisfaction problem for max-closed semilinear constraints is at least as hard as determining the winner in Mean Payoff Games, a notorious problem of open computational complexity. Mean Payoff Games are known to be in the intersection of NP and co-NP, which is not known for max-closed semilinear constraints. Semilinear relations that are max-closed and additionally closed under translations have been called tropically convex in the literature. One of our main results is a new duality for open tropically convex relations, which puts the CSP for tropically convex semilinaer constraints in general into NP intersected co-NP. This extends the corresponding complexity result for scheduling under and-or precedence constraints, or equivalently the max-atoms problem. To this end, we present a characterization of max-closed semilinear relations in terms of syntactically restricted first-order logic, and another characterization in terms of a finite set of relations L that allow primitive positive definitions of all other relations in the class. We also present a subclass of max-closed constraints where the CSP is in P; this class generalizes the class of max-closed constraints over finite domains, and the feasibility problem for max-closed linear inequalities. Finally, we show that the class of max-closed semilinear constraints is maximal in the sense that as soon as a single relation that is not max-closed is added to L, the CSP becomes NP-hard.Comment: 29 pages, 2 figure

Spectroscopic signatures of spin-charge separation in the quasi-one-dimensional organic conductor TTF-TCNQ

The electronic structure of the quasi-one-dimensional organic conductor TTF-TCNQ is studied by angle-resolved photoelectron spectroscopy (ARPES). The experimental spectra reveal significant discrepancies to band theory. We demonstrate that the measured dispersions can be consistently mapped onto the one-dimensional Hubbard model at finite doping. This interpretation is further supported by a remarkable transfer of spectral weight as function of temperature. The ARPES data thus show spectroscopic signatures of spin-charge separation on an energy scale of the conduction band width.Comment: 4 pages, 4 figures; to appear in PR

Deterministic Priority Mean-payoff Games as Limits of Discounted Games

International audienceInspired by the paper of de Alfaro, Henzinger and Majumdar about discounted $\mu$-calculus we show new surprising links between parity games and different classes of discounted games

Symmetric Strategy Improvement

Symmetry is inherent in the definition of most of the two-player zero-sum games, including parity, mean-payoff, and discounted-payoff games. It is therefore quite surprising that no symmetric analysis techniques for these games exist. We develop a novel symmetric strategy improvement algorithm where, in each iteration, the strategies of both players are improved simultaneously. We show that symmetric strategy improvement defies Friedmann's traps, which shook the belief in the potential of classic strategy improvement to be polynomial