Falta de estructura genética en las poblaciones chipriotas de Alectoris chukar (Aves, Galliformes), deducida de los datos de secuenciación del ADNmt

The Chukar (Alectoris chukar cypriotes) is the most common game bird in Cyprus. Since 1990 the Cypriot Government has established a restocking program with captive–reared birds. However, this program has not been guaranteed by checking the genetic nature of wild and farmed samples, either in the areas controlled by the Cypriot Government or in northern Cyprus. The sequencing of both Cytochrome–b and Control Region of the mitochondrial DNA was carried out for 61 Cypriot representatives and 14 specimens of the same subspecies from Crete and Israel. Only the A. chukar maternal lineage was found. A partitioning of Cypriot specimens among different clades was not reliably supported, whereas robust bootstrap values weighted for an evolutionary divergence between Cypriot and Cretan Chukars. An overall genetic homogeny of the Cypriot populations was disclosed, whatever their status (captive vs. wild stocks) and origin (Government controlled vs. occupied areas) would be, a higher nucleotide diversity of the wild vs. captive representatives notwithstanding. Key words: Chukar, Control Region, Cytochrome–b, Genetic diversity, mtDNA, Partridges.Una subespecie de la perdiz chucar (Alectoris chukar cypriotes) es el ave de caza más común de Chipre. A partir de 1990 el gobierno chipriota estableció un programa de repoblación utilizando aves criadas en cautividad. No obstante, dicho programa no ha sido avalado mediante la comprobación de la naturaleza genética de muestras tanto de ejemplares salvajes como de granja, ni en las zonas controladas por el gobierno chipriota ni en el norte de Chipre. Se ha llevado a cabo la secuenciación del citocromo-b y de la región de control del ADN mitocondrial de 61 ejemplares chipriotas y de 14 especimenes de la misma subespecie de Creta y de Israel. Sólo se encontró el linaje materno de A. chukar. No se pudo demostrar con fiabilidad el reparto de los especimenes chipriotas en distintos clados, mientras que unos valores bootstrap muy consistentes sustentaban una divergencia evolutiva entre las perdices chucar chipriotas y cretenses. Se reveló la existencia de una homogeneidad genética en las poblaciones chipriotas, cualquiera que fuera su estatus (linajes cautivos frente a salvajes) o su origen (zonas controladas por el gobierno frente a zonas ocupadas), por más que se diera una mayor diversidad de nucleótidos de los ejemplares salvajes frente a los cautivos. Palabras clave: Perdiz chucar, Región de control, Citocromo-b, Diversidad genética, ADNmt, Perdices

Checklist of the Mammals of Iraq (Chordata: Mammalia)

A checklist of the mammals of Iraq including their current status and geographical distribution is provided. Data were collected from literature and combined with field observations obtained during 2013–2014. The checklist comprises 93 species of wild mammals occurring in Iraq and belonging to eight orders, 28 families, and 65 genera. The status and distribution of three Erinaceomorphs, three Soricomorphs, 20 Bats, 23 Carnivores, eight Artiodactyls, two Lagomorphs, 28 Rodents, and six Cetaceans are reported. The checklist includes 24 species evaluated by the International Union for the Conservation of Nature and Natural Resources: one was listed as Extinct, one as Critically Endangered, four as Endangered, eight as Vulnerable, seven as Near Threatened, and three as Data Deficient. One subspecies of carnivores (Smooth-coated Otter Lutrogale perspicillata maxwelli) and one rodent species (Long-tailed Nesokia Nesokia bunnii) endemic to Mesopotamian marshlands were highlighted as taxa with conservation priority to Iraq. We also focused on main threats to the most common wild mammals with special attention to impacts of illegal hunting and poaching

Coinductive subtyping for abstract compilation of object-oriented languages into Horn formulas

In recent work we have shown how it is possible to define very precise type systems for object-oriented languages by abstractly compiling a program into a Horn formula f. Then type inference amounts to resolving a certain goal w.r.t. the coinductive (that is, the greatest) Herbrand model of f. Type systems defined in this way are idealized, since in the most interesting instantiations both the terms of the coinductive Herbrand universe and goal derivations cannot be finitely represented. However, sound and quite expressive approximations can be implemented by considering only regular terms and derivations. In doing so, it is essential to introduce a proper subtyping relation formalizing the notion of approximation between types. In this paper we study a subtyping relation on coinductive terms built on union and object type constructors. We define an interpretation of types as set of values induced by a quite intuitive relation of membership of values to types, and prove that the definition of subtyping is sound w.r.t. subset inclusion between type interpretations. The proof of soundness has allowed us to simplify the notion of contractive derivation and to discover that the previously given definition of subtyping did not cover all possible representations of the empty type

Existential witness extraction in classical realizability and via a negative translation

We show how to extract existential witnesses from classical proofs using Krivine's classical realizability---where classical proofs are interpreted as lambda-terms with the call/cc control operator. We first recall the basic framework of classical realizability (in classical second-order arithmetic) and show how to extend it with primitive numerals for faster computations. Then we show how to perform witness extraction in this framework, by discussing several techniques depending on the shape of the existential formula. In particular, we show that in the Sigma01-case, Krivine's witness extraction method reduces to Friedman's through a well-suited negative translation to intuitionistic second-order arithmetic. Finally we discuss the advantages of using call/cc rather than a negative translation, especially from the point of view of an implementation.Comment: 52 pages. Accepted in Logical Methods for Computer Science (LMCS), 201

Architecture and First Characterization of the Microstrip Silicon Detector Data Acquisition of the FOOT experiment

Oncological hadrontherapy is a novel technique for cancer treatment that improves over conventional radiotherapy by having higher effectiveness and spatial selectivity. The FOOT (FragmentatiOn Of Target) experiment studies the nuclear fragmentation caused by the interactions of charged particle beams with patient tissues in Charged Particle Therapy. Among the several FOOT detectors, the silicon Microstrip Detector is part of the charged-ions-tracking magnetic spectrometer. The detector consists of three x-y planes of two silicon microstrip detectors arranged orthogonally between each other to enable tracking capabilities. Ten analog buffer chips and fi ve ADCs read out each detector. A Field-Programmable Gate Array collects the output of the ADCs of an x-y plane, possibly processes the data, and forms a packet to be sent to the experiment central data acquisition. This data acquisition system shall withstand the trigger rate and detector’s throughput at any time. In this work, we discuss the architecture of the data acquisition system—in particular of the silicon microstrip detector one—and the fi rst results obtained from the x-y plane’s prototype

Progress on the development of the Stellar X-ray Polarimeter on board of the Spectrum-X-Gamma Satellite

We present the status of the Stellar X-ray Polarimeter at November’94 devoted to measure linear polarisation from cosmic X-ray sources between 2 keV and 15 keV which will be flown on the Spectrum-X-Gamma Satellite. In particular, we focus on the performances of the engineering model after the calibrations at Lawrence Livermore Laboratories and on the improvements which have been introduced on the four flight model imaging proportional counters which are key parts of the experiment

Realizability Interpretation and Normalization of Typed Call-by-Need λ\lambda-calculus With Control

We define a variant of realizability where realizers are pairs of a term and a substitution. This variant allows us to prove the normalization of a simply-typed call-by-need \lambda$-$calculus with control due to Ariola et al. Indeed, in such call-by-need calculus, substitutions have to be delayed until knowing if an argument is really needed. In a second step, we extend the proof to a call-by-need \lambda$$-calculus equipped with a type system equivalent to classical second-order predicate logic, representing one step towards proving the normalization of the call-by-need classical second-order arithmetic introduced by the second author to provide a proof-as-program interpretation of the axiom of dependent choice

Strong Pinning in High Temperature Superconductors

Detailed measurements of the critical current density jc of YBa2Cu3O7 films grown by pulsed laser deposition reveal the increase of jc as function of the filmthickness. Both this thickness dependence and the field dependence of the critical current are consistently described using a generalization of the theory of strong pinning of Ovchinnikov and Ivlev [Phys. Rev. B 43, 8024 (1991)]. From the model, we deduce values of the defect density (10^21 m^-3) and the elementary pinning force, which are in good agreement with the generally accepted values for Y2O3-inclusions. In the absence of clear evidence that the critical current is determined by linear defects or modulations of the film thickness, our model provides an alternative explanation for the rather universal field dependence of the critical current density found in YBa2Cu3O7 films deposited by different methods.Comment: 11 pages; 8 Figures; Published Phys. Rev. B 66, 024523 (2002

Composing Communicating Systems, Synchronously

Conference moved to 2021 due to covid-19International audienceCommunicating systems are nowadays part of everyday life, yet programming and analysing them is difficult. One of the many reasons for this difficulty is their size, hence compositional approaches are a need. We discuss how to ensure relevant communication properties such as deadlock freedom in a compositional way. The idea is that communicating systems can be composed by taking two of their participants and transforming them into coupled forwarders connecting the two systems. It has been shown that, for asynchronous communications, if the participants are "compatible" then composition satisfies relevant communication properties provided that the single systems satisfy them. We show that such a result changes considerably for synchronous communications. We also discuss a different form of composition, where a unique forwarder is used