Simulations of secondary Farley-Buneman instability driven by a kilometer-scale primary wave: anomalous transport and formation of flat-topped electric fields

Since the 1950s, high frequency and very high frequency radars near the magnetic equator have frequently detected strong echoes caused ultimately by the Farley‐Buneman instability (FBI) and the gradient drift instability (GDI). In the 1980s, coordinated rocket and radar campaigns made the astonishing observation of flat‐topped electric fields coincident with both meter‐scale irregularities and the passage of kilometer‐scale waves. The GDI in the daytime E region produces kilometer‐scale primary waves with polarization electric fields large enough to drive meter‐scale secondary FBI waves. The meter‐scale waves propagate nearly vertically along the large‐scale troughs and crests and act as VHF tracers for the large‐scale dynamics. This work presents a set of hybrid numerical simulations of secondary FBIs, driven by a primary kilometer‐scale GDI‐like wave. Meter‐scale density irregularities develop in the crest and trough of the kilometer‐scale wave, where the total electric field exceeds the FBI threshold, and propagate at an angle near the direction of total Hall drift determined by the combined electric fields. The meter‐scale irregularities transport plasma across the magnetic field, producing flat‐topped electric fields similar to those observed in rocket data and reducing the large‐scale wave electric field to just above the FBI threshold value. The self‐consistent reduction in driving electric field helps explain why echoes from the FBI propagate near the plasma acoustic speed.NSF grants PHY-1500439 and AGS-1755350 and NASA grant NNX14AI13G supported the research presented in this work. This work used TACC and XSEDE computational resources supported by the National Science Foundation grant ACI-1053575. This paper did not use any data; simulation runs are archived on the TACC Ranch system. The authors thank one anonymous reviewer for helpful comments. (PHY-1500439 - NSF; AGS-1755350 - NSF; NNX14AI13G - NASA; ACI-1053575 - National Science Foundation)Published version2019-07-0

Inflammasomes make the case for littermate-controlled experimental design in studying host-microbiota interactions

Several human diseases are thought to evolve due to a combination of host genetic mutations and environmental factors that include alterations in intestinal microbiota composition termed dysbiosis. Although in some cases, host genetics may shape the gut microbiota and enable it to provoke disease, experimentally disentangling cause and consequence in such host-microbe interactions requires strict control over non-genetic confounding factors. Mouse genetic studies previously proposed Nlrp6/ASC inflammasomes as innate immunity regulators of the intestinal ecosystem. In contrast, using littermate-controlled experimental setups, we recently showed that Nlrp6/ASC inflammasomes do not alter the gut microbiota composition. Our analyses indicated that maternal inheritance and long-term separate housing are non-genetic confounders that preclude the use of non-littermate mice when analyzing host genetic effects on intestinal ecology. Here, we summarize and discuss our gut microbiota analyses in inflammasome-deficient mice for illustrating the importance of littermate experimental design in studying host-microbiota interactions

Socio-demographic and clinical characterization of patients with obsessive-compulsive tic-related disorder (OCTD) : An Italian multicenter study

© Copyright by Pacini Editore SrlIn the DSM-5 a new "tic-related" specifier for obsessive compulsive disorder (OCD) has been introduced, highlighting the importance of an accurate characterization of patients suffering from obsessive-compulsive tic-related disorder ("OCTD"). In order to characterize OCTD from a socio-demographic and clinical perspective, the present multicenter study was carried out. The sample consists of 266 patients, divided in two groups with lifetime diagnoses of OCD and OCTD, respectively. OCTD vs OCD patients showed a significant male prevalence (68.5% vs 48.5%; p < .001), a higher rate of psychiatric comorbidities (69.4 vs 50%; p < .001) - mainly with neurodevelopmental disorders (24 vs 0%; p < .001), a lower education level and professional status (middle school diploma: 25 vs 7.6%; full-Time job 44.4 vs 58%; p < .001). Moreover, OCTD vs OCD patients showed significantly earlier age of OCD and psychiatric comorbidity onsets (16.1 ± 10.8 vs 22.1 ± 9.5 years; p < .001, and 18.3 ± 12.8 vs 25.6 ± 9.4: p < .001, respectively). Patients with OCTD patients were treated mainly with antipsychotic and with a low rate of benzodiazepine (74.2 vs 38.2% and 20.2 vs 31.3%, respectively; p < .001). Finally, OCTD vs OCD patients showed higher rates of partial treatment response (58.1 vs 38%; p < .001), lower rates of current remission (35.5 vs 54.8%; p < .001) and higher rates of suicidal ideation (63.2 vs 41.7%; p < .001) and attempts (28.9 vs 8.3%; p < .001). Patients with OCTD report several unfavorable socio-demographic and clinical characteristics compared to OCD patients without a history of tic. Additional studies on larger sample are needed to further characterize OCTD patients from clinical and therapeutic perspectives.Peer reviewedFinal Published versio

ASMs and Operational Algorithmic Completeness of Lambda Calculus

We show that lambda calculus is a computation model which can step by step simulate any sequential deterministic algorithm for any computable function over integers or words or any datatype. More formally, given an algorithm above a family of computable functions (taken as primitive tools, i.e., kind of oracle functions for the algorithm), for every constant K big enough, each computation step of the algorithm can be simulated by exactly K successive reductions in a natural extension of lambda calculus with constants for functions in the above considered family. The proof is based on a fixed point technique in lambda calculus and on Gurevich sequential Thesis which allows to identify sequential deterministic algorithms with Abstract State Machines. This extends to algorithms for partial computable functions in such a way that finite computations ending with exceptions are associated to finite reductions leading to terms with a particular very simple feature.Comment: 37 page

Levantamento fitossociológico de plantas daninhas em cafezal orgânico.

A adequação de um cafezal para o sistema orgânico causa grande mudança no sistema de manejo de plantas daninhas, mas as informações sobre o comportamento da comunidade infestante em áreas de cultivo de café orgânico são escassas no Brasil. Objetivou-se com este trabalho realizar um levantamento fitossociológico da comunidade infestante em três cafezais (variedades Mundo Novo, Bourbon Vermelho e Obatã) desenvolvidos em sistema orgânico, no município de Garça (SP). Nas três áreas estudadas foram arremessados ao acaso cem quadrados metálicos com área vazada de 0,25 m2, nas entrelinhas da cultura. As espécies contidas no interior dos quadros foram identificadas segundo a espécie botânica, nome popular e família. A partir dos resultados, determinaram-se os parâmetros fitossociológicos: frequência, densidade, abundância, frequência relativa, densidade relativa, abundância relativa, índice de valor de importância e similaridade florísticas pelos métodos de Simple Matching de Sneath & Sokal e similaridade de Sorensen. As famílias que mais se destacaram, com maior número de espécies nas três áreas foram Poaceae e Asteraceae. Houve alta similaridade em todos os contrastes testados, já que pelo menos metade das espécies identificadas foi comum às duas áreas contrastadas

A Formalization of the Theorem of Existence of First-Order Most General Unifiers

This work presents a formalization of the theorem of existence of most general unifiers in first-order signatures in the higher-order proof assistant PVS. The distinguishing feature of this formalization is that it remains close to the textbook proofs that are based on proving the correctness of the well-known Robinson's first-order unification algorithm. The formalization was applied inside a PVS development for term rewriting systems that provides a complete formalization of the Knuth-Bendix Critical Pair theorem, among other relevant theorems of the theory of rewriting. In addition, the formalization methodology has been proved of practical use in order to verify the correctness of unification algorithms in the style of the original Robinson's unification algorithm.Comment: In Proceedings LSFA 2011, arXiv:1203.542

Fenologia da goiabeira 'Paluma' sob diferentes sistemas de cultivos, épocas e intensidades de poda de frutificação.

O trabalho teve como objetivo avaliar os efeitos de diferentes épocas e intensidades de poda de frutificação sobre a fenologia da goiabeira 'Paluma', em dois sistemas de cultivo, em Pedro Canário (ES). O delineamento experimental foi o de blocos ao acaso, em esquema de parcelas sub-subdivididas. As parcelas foram os sistemas de cultivo irrigado e sequeiro; as subparcelas foram as épocas de poda (10/11/2005, 9/12/2005, 13/1/2006 e 10/2/2006); e as sub-subparcelas foram as intensidades de poda (curta, média e longa). O ciclo da goiabeira 'Paluma', entre a poda até o início da colheita dos frutos, variou de 182 (poda em novembro e dezembro) a 203 dias (poda em fevereiro). A queda fisiológica dos frutos ocorreu até os 56 dias após o final do florescimento. A irrigação e a poda longa proporcionaram maior brotação e estabelecimento dos ramos. As plantas submetidas à poda longa em fevereiro produziram maior número de frutos por ramo. Independentemente da época de poda, as plantas submetidas à poda curta apresentaram menor número de frutos por ramo e menor índice de pegamento de frutos. A irrigação e as podas realizadas em dezembro e janeiro favoreceram a produção de frutos maiores

Iterative algorithms for total variation-like reconstructions in seismic tomography

A qualitative comparison of total variation like penalties (total variation, Huber variant of total variation, total generalized variation, ...) is made in the context of global seismic tomography. Both penalized and constrained formulations of seismic recovery problems are treated. A number of simple iterative recovery algorithms applicable to these problems are described. The convergence speed of these algorithms is compared numerically in this setting. For the constrained formulation a new algorithm is proposed and its convergence is proven.Comment: 28 pages, 8 figures. Corrected sign errors in formula (25

Plantas daninhas na pós-colheita de milho nas várzeas do rio São Francisco, em Minas Gerais.

Realizou-se um estudo na região do Alto São Francisco, Minas Gerais, no final da safra agrícola 1997/1998, visando identificar as plantas daninhas que permanecem nas áreas após a colheita do milho e sua distribuição ao longo da área estudada, destacando-se as mais importantes. As observações foram realizadas em 12 municípios. Em cada local foi lançado, por cem vezes, um quadrado de 0,50 x 0,50 m, a espaços de 10 m. Dentro do quadrado foram contadas as espécies e registrado o número de indivíduos de cada uma delas. Foram encontradas 151 espécies em 35 famílias, sendo Asteraceae a mais bem representada, com 25 espécies. As espécies com maior Índice de Valor de mportância (IVI) foram: Ageratum conyzoides, Sida glaziovii, Conyza bonariensis, Gaya sp., Sida rhombifolia e Blainvillea biaristata. As plantas daninhas remanescentes nas áreas recém-colhidas são fonte de alimento para insetos polinizadores e inimigos naturais das pragas; adequadamente manejadas, elas podem favorecer a manutenção do equilíbrio nos agroecossistemas