2-Nested Simulation is not Finitely Equationally Axiomatizable

2-nested simulation was introduced by Groote and Vaandrager [10] as the coarsest equivalence included in completed trace equivalence for which the tyft/tyxt format is a congruence format. In the lineartime-branching time spectrum of van Glabbeek [8], 2-nested simulationis one of the few equivalences for which no finite equational axiomatization is presented. In this paper we prove that such an axiomatizationdoes not exist for 2-nested simulation.Keywords: Concurrency, process algebra, basic CCS, 2-nested simulation, equational logic, complete axiomatizations

Diagnosis of centrocestus formosanus infection in zebrafish (Danio rerio) in Italy: A window to a new globalization-derived invasive microorganism

Centrocestus formosanus is a digenetic trematode with a complex life cycle, involving invertebrate and vertebrate hosts, humans included. In particular, it causes gill lesions and mortality in freshwater fish species, and gastrointestinal symptoms in infected humans. Here, we describe the occurrence of C. formosanus infection in zebrafish imported in Italy and propose a newly designed species-specific primer pair to ameliorate the diagnostic investigations for C. formosanus. Gill arches of 30 zebrafish were examined for the presence of encysted metacercariae under a stereomicroscope and processed through molecular analyses targeting the ribosomal internal transcribed sequence 2 (ITS2). Although C. formosanus distribution was originally restricted to Asia, it has been subsequently reported in new countries, revealing itself as an invasive species and raising important concerns for biodiversity, economy, scientific research, as well as animal and public health. Given the crucial role played by the ornamental fish industry in spreading this parasite, there is an urgent need for control measures to prevent the introduction and establishment of C. formosanus in non-endemic areas, including Europe. We also suggest developing new strategies in microbiology and epidemiology to better explore this new globalization-derived invasive species

The Complexity of Codiagnosability for Discrete Event and Timed Systems

In this paper we study the fault codiagnosis problem for discrete event systems given by finite automata (FA) and timed systems given by timed automata (TA). We provide a uniform characterization of codiagnosability for FA and TA which extends the necessary and sufficient condition that characterizes diagnosability. We also settle the complexity of the codiagnosability problems both for FA and TA and show that codiagnosability is PSPACE-complete in both cases. For FA this improves on the previously known bound (EXPTIME) and for TA it is a new result. Finally we address the codiagnosis problem for TA under bounded resources and show it is 2EXPTIME-complete.Comment: 24 pages

When are prime formulae characteristic?

In the setting of the modal logic that characterizes modal refinement over modal transition systems, Boudol and Larsen showed that the formulae for which model checking can be reduced to preorder checking, that is, the characteristic formulae, are exactly the consistent and prime ones. This paper presents general, sufficient conditions guaranteeing that characteristic formulae are exactly the consistent and prime ones. It is shown that the given conditions apply to various behavioural relations in the literature. In particular, characteristic formulae are exactly the prime and consistent ones for all the semantics in van Glabbeek's linear time-branching time spectrum

Clinical Characteristics and Management of Children with Ureteropelvic Junction Obstruction and Severe Vesicoureteral Reflux: Preliminary Results

Objective: The aim of this study was to investigate the physiopathology of isolated or coexisting ureteropelvic junction obstruction (UPJ-O) and high-grade vesicoureteral reflux (VUR), including the clinical characteristics and management.Summary background data: The association between UPJ-O and VUR was reported more frequently in boys with high-grade VUR; however, the physiopathology of concomitant UPJ-O and VUR is still unknown. Primary pyeloplasty, followed by ureteral reimplantation, if needed, has been widely accepted, although VUR should be treated first (most often by endoscopic treatment) in the presence of a functional obstruction.Methods: We reviewed the charts of 78 children with isolated or coexisting high-grade VUR/UPJ-O. Among the children, 14 had isolated UPJ-O, 16 had high-grade VUR/ UPJ-O, and 48 had high-grade VUR. Children with other urological or extrarenal conditions were excluded.Results: Patients with isolated UPJ-O showed significantly different clinical characteristics compared with the other two groups of patients with high-grade VUR. Among the patients of group 2, 3/13 (23%) showed progression from functional to obstructive UPJ-O after endoscopic treatment. All of them underwent secondary pyeloplasty, which was complicated at follow-up by VUR recurrence needing further endoscopic injection.Conclusion: We suggest that UPJ-O in high-grade VUR patients is just a complication of severe VUR that produces structural changes in predisposed children. The treatment of children with associated high-grade VUR/UPJ-O may be complicated by the progression of urinary flow obstruction or VUR recurrence after pyeloplasty. Endoscopic treatment of high-grade VUR is associated with a high rate of VUR recurrence in children requiring subsequent pyeloplasty.Keywords: Children, Endoscopic Treatment, Ureteropelvic Junction Obstruction, Vesicoureteral Reflu

Concurrent constraint programming with process mobility

We propose an extension of concurrent constraint programming with primitives for process migration within a hierarchical network, and we study its semantics. To this purpose, we first investigate a "pure " paradigm for process migration, namely a paradigm where the only actions are those dealing with transmissions of processes. Our goal is to give a structural definition of the semantics of migration; namely, we want to describe the behaviour of the system, during the transmission of a process, in terms of the behaviour of the components. We achieve this goal by using a labeled transition system where the effects of sending a process, and requesting a process, are modeled by symmetric rules (similar to handshaking-rules for synchronous communication) between the two partner nodes in the network. Next, we extend our paradigm with the primitives of concurrent constraint programming, and we show how to enrich the semantics to cope with the notions of environment and constraint store. Finally, we show how the operational semantics can be used to define an interpreter for the basic calculus.

Glycogen Synthase Kinase 3: Ion Channels, Plasticity, and Diseases

Glycogen synthase kinase 3β (GSK3) is a multifaceted serine/threonine (S/T) kinase expressed in all eukaryotic cells. GSK3β is highly enriched in neurons in the central nervous system where it acts as a central hub for intracellular signaling downstream of receptors critical for neuronal function. Unlike other kinases, GSK3β is constitutively active, and its modulation mainly involves inhibition via upstream regulatory pathways rather than increased activation. Through an intricate converging signaling system, a fine-tuned balance of active and inactive GSK3β acts as a central point for the phosphorylation of numerous primed and unprimed substrates. Although the full range of molecular targets is still unknown, recent results show that voltage-gated ion channels are among the downstream targets of GSK3β. Here, we discuss the direct and indirect mechanisms by which GSK3β phosphorylates voltage-gated Na+ channels (Nav 1.2 and Nav 1.6) and voltage-gated K+ channels (Kv 4 and Kv 7) and their physiological effects on intrinsic excitability, neuronal plasticity, and behavior. We also present evidence for how unbalanced GSK3β activity can lead to maladaptive plasticity that ultimately renders neuronal circuitry more vulnerable, increasing the risk for developing neuropsy-chiatric disorders. In conclusion, GSK3β-dependent modulation of voltage-gated ion channels may serve as an important pharmacological target for neurotherapeutic development

Enuresis subtypes based on nocturnal hypercalciuria: A multicenter study

Purpose: Desmopressin may not be effective for nocturnal enuresis associated with polyuria and hypercalciuria. Nighttime hypercalciuria in an enuretic population from 5 centers and its correlation with nighttime polyuria were verified. Materials and Methods: A total of 450 enuretic patients (278 males, 172 females, mean age 9.7 years) were evaluated with 72-hour micturition charts, urinalysis, serum creatinine and osmolarity, diurnal and nocturnal electrolytes with fractional Na+ and K+ urinary excretion, and nocturnal (4 a.m.) plasma vasopressin. Creatinine electrolytes and osmolarity were measured in daytime (8 a.m. to 8 p.m.) and nighttime (8 p.m. to 8 a.m.) urine volumes. Patients were divided into group 1 with nocturnal polyuria and group 2 without nocturnal polyuria. Hypercalciuria was defined as urinary calcium-to-urinary creatinine ratio greater than 0.21. Statistic evaluation was performed using chi-square, Pearson correlation and ANOVA tests. Results: Nighttime polyuria was demonstrated in 292 bedwetters (65% group 1). Nocturnal hypercalciuria was present in 179 of the 450 children (39.7%), including 125 in group 1 (42.8%) and 54 in group 2 (34.2%), which was statistically significant (chi-square p = 0.008, Pearson correlation test r = 0.157). Daytime calciuria was not statistically modified in either group (group 1 p = 0.054, group 2 p = 0.56). Adrenocorticotropic hormone (ADH) was normal in 18.5% and low in 81.5% of enuretics with nocturnal hypercalciuria. ADH levels and nocturnal hypercalciuria significantly correlated (p = 0.003, r = 0.148). Conversely, the group 2 patients had normal ADH levels. Conclusions: Nocturnal hypercalciuria has a pivotal role in nocturnal enuresis, as it is significantly associated with low ADH levels and nocturnal polyuria. A new classification of nocturnal enuresis subtypes based on nighttime calciuria levels is mandatory to address treatment properly

The Power of Proofs: New Algorithms for Timed Automata Model Checking (with Appendix)

This paper presents the first model-checking algorithm for an expressive modal mu-calculus over timed automata, $L^{\mathit{rel}, \mathit{af}}_{\nu,\mu}$, and reports performance results for an implementation. This mu-calculus contains extended time-modality operators and can express all of TCTL. Our algorithmic approach uses an "on-the-fly" strategy based on proof search as a means of ensuring high performance for both positive and negative answers to model-checking questions. In particular, a set of proof rules for solving model-checking problems are given and proved sound and complete; we encode our algorithm in these proof rules and model-check a property by constructing a proof (or showing none exists) using these rules. One noteworthy aspect of our technique is that we show that verification performance can be improved with \emph{derived rules}, whose correctness can be inferred from the more primitive rules on which they are based. In this paper, we give the basic proof rules underlying our method, describe derived proof rules to improve performance, and compare our implementation of this model checker to the UPPAAL tool.Comment: This is the preprint of the FORMATS 2014 paper, but this is the full version, containing the Appendix. The final publication is published from Springer, and is available at http://link.springer.com/chapter/10.1007%2F978-3-319-10512-3_9 on the Springer webpag