Serum and Dietary Vitamin D in Individuals with Class II and III Obesity: Prevalence and Association with Metabolic Syndrome

The association between vitamin D deficiency and metabolic syndrome (MS) in severe obesity is unclear and controversial. We analyzed serum and dietary vitamin D and their association with MS in 150 adults with class II and III obesity (BMI ≥ 35 kg/m2) from the DieTBra Trial (NCT02463435). MS parameters were high fasting blood glucose, low HDL cholesterol, high triglycerides, elevated waist circumference, and hypertension. Vitamin D deficiency was considered as a level &lt; 20 ng/mL. We performed multivariate Poisson regression adjusted for sociodemographic and lifestyle variables. The prevalence of serum vitamin D deficiency was 13.3% (mean 29.9 ± 9.4 ng/mL) and dietary vitamin D median was 51.3 IU/day. There were no significant associations between vitamin D, serum, and diet and sociodemographic variables, lifestyle, and class of obesity. Serum vitamin D deficiency was associated with age ≥ 50 years (p = 0.034). After a fully adjusted multivariate Poisson regression, MS and its parameters were not associated with serum or dietary vitamin D, except for lower HDL, which was associated with serum vitamin D deficiency (PR = 0.71, 95% CI 0.52–0.97; p = 0.029). Severe obese individuals had a low prevalence of vitamin D deficiency, which was not associated with MS.</jats:p

Realizing Omega-regular Hyperproperties

We studied the hyperlogic HyperQPTL, which combines the concepts of trace relations and $\omega$-regularity. We showed that HyperQPTL is very expressive, it can express properties like promptness, bounded waiting for a grant, epistemic properties, and, in particular, any $\omega$-regular property. Those properties are not expressible in previously studied hyperlogics like HyperLTL. At the same time, we argued that the expressiveness of HyperQPTL is optimal in a sense that a more expressive logic for $\omega$-regular hyperproperties would have an undecidable model checking problem. We furthermore studied the realizability problem of HyperQPTL. We showed that realizability is decidable for HyperQPTL fragments that contain properties like promptness. But still, in contrast to the satisfiability problem, propositional quantification does make the realizability problem of hyperlogics harder. More specifically, the HyperQPTL fragment of formulas with a universal-existential propositional quantifier alternation followed by a single trace quantifier is undecidable in general, even though the projection of the fragment to HyperLTL has a decidable realizability problem. Lastly, we implemented the bounded synthesis problem for HyperQPTL in the prototype tool BoSy. Using BoSy with HyperQPTL specifications, we have been able to synthesize several resource arbiters. The synthesis problem of non-linear-time hyperlogics is still open. For example, it is not yet known how to synthesize systems from specifications given in branching-time hyperlogics like HyperCTL$^*$.Comment: International Conference on Computer Aided Verification (CAV 2020

A dysflagellar mutant of Leishmania (Viannia) braziliensis isolated from a cutaneous leishmaniasis patient

<p>Abstract</p> <p>Background</p> <p>Parasites of the <it>Leishmania </it>genus alternate between the flagellated extracellular promastigote stage and intracellular amastigotes. Here we report the characterization of a <it>Leishmania </it>isolate, obtained from a cutaneous leishmaniasis patient, which presents peculiar morphological features.</p> <p>Methods</p> <p>The parasite was cultured <it>in vitro </it>and characterized morphologically using optical and electron microscopy. Identification was performed based on monoclonal antibodies and internal ribosomal spacer typing. <it>In vitro </it>macrophage cultures, murine experimental models and sand fly infections were used to evaluate infectivity <it>in vitro </it>and <it>in vivo</it>.</p> <p>Results</p> <p>The isolate was identified as <it>Leishmania </it>(<it>Viannia</it>) <it>braziliensis</it>. In the atypical promastigotes grown in culture, a short flagellum surrounded or interrupted by a protuberance of disorganized material was observed. A normal axoneme was present close to the basal body but without elongation much further outside the flagellar pocket. A disorganized swelling at the precocious end of the axoneme coincided with the lack of a paraflagellar rod structure. The isolate was able to infect macrophages <it>in vitro</it>, induce lesions in BALB/c mice and infect <it>Lutzomyia longipalpis</it>.</p> <p>Conclusions</p> <p>Notwithstanding the lack of an extracellular flagellum, this isolate infects macrophages <it>in vitro </it>and produces lesions when inoculated into mice. Moreover, it is able to colonize phlebotomine sand flies. Considering the importance attributed to the flagellum in the successful infection and survival of <it>Leishmania </it>in the insect midgut and in the invasion of macrophages, these findings may bring new light into the infectious mechanisms of <it>L</it>. (<it>V</it>.) <it>braziliensis</it>.</p

The Temporal Pattern of Mating Behavior of the Fruit Fly, Anastrepha zenildae in the Laboratory

The state of Rio Grande do Norte is an important fruit-producing and exporting area in northeastern Brazil. The success of this industry depends on fruit fly population control, especially in fly-free exporting zones. However, many fruits are not exported because of quarantine restrictions imposed by importing countries. A survey in the state has detected a considerable increase of the fruit fly, Anastrepha zenildae Zucchi (Diptera: Tephritidae), probably a result of the introduction of irrigated guava orchards that make fruit available all year. Knowledge of the sexual behavior of Tephritidae has great importance to pest control programs, particularly those that employ the Sterile Insect Technique. In order to characterize the reproductive behavior of A. zenildae, 32 individuals (16 males; 16 females) in each of six generations were submitted to an artificial 12:12 L:D cycle (750: < 1 lux, lights on 07:00–19:00) and observed over their lifetimes. The courtship and copulation occurred in leks and the episodes varied with the time of day, courtship being most frequent between Zeitgeber time (ZT) 3 and ZT 7, peaking at ZT 5–6. Copulations occurred between ZT 2 and ZT 8, with a higher frequency between ZT 5–7 and a peak at ZT 6. Mean duration was 0.28 ± 0.03 min/male (range: 5–163 min). Males in the leks attempted to copulate mainly between ZT 3 and ZT 7 with a peak at ZT 6, and males outside leks peaked at ZT 7. The different timing of sexual behaviors among related sympatric species, including A. zenildae, may contribute to species isolation

Satisfiability Checking for Mission-Time LTL

Mission-time LTL (MLTL) is a bounded variant of MTL over naturals designed to generically specify requirements for mission-based system operation common to aircraft, spacecraft, vehicles, and robots. Despite the utility of MLTL as a specification logic, major gaps remain in analyzing MLTL, e.g., for specification debugging or model checking, centering on the absence of any complete MLTL satisfiability checker. We prove that the MLTL satisfiability checking problem is NEXPTIME-complete and that satisfiability checking MLTL0 , the variant of MLTL where all intervals start at 0, is PSPACE-complete. We introduce translations for MLTL-to-LTL, MLTL-to-LTLf , MLTL-to-SMV, and MLTL-to-SMT, creating four options for MLTL satisfiability checking. Our extensive experimental evaluation shows that the MLTL-to-SMT transition with the Z3 SMT solver offers the most scalable performance

Compositional Satisfiability Solving in Separation Logic

We introduce a novel decision procedure to the satisfiability problem in array separation logic combined with general inductively defined predicates and arithmetic. Our proposal differentiates itself from existing works by solving satisfiability through compositional reasoning. First, following Fermat’s method of infinite descent, it infers for every inductive definition a “base” that precisely characterises the satisfiability. It then utilises the base to derive such a base for any formula where these inductive predicates reside in. Especially, we identify an expressive decidable fragment for the compositionality. We have implemented the proposal in a tool and evaluated it over challenging problems. The experimental results show that the compositional satisfiability solving is efficient and our tool is effective and efficient when compared with existing solvers