Speech and language skills of Maltese children with bilateral cochlear implants : three case studies

The purpose of this study was to document the speech and language skills of three Maltese children with bilateral cochlear implants. One child was simultaneously implanted and had a hearing age (HA) of 2;10 years at the time of testing, another was sequentially implanted and had a HA of 3;06 years, while the third child was sequentially implanted and had a HA of 5;03 years. Maltese standardised speech and language assessments were used to gather information on the children’s speech and language skills, with data being collected during their speech and language therapy sessions. Following data transcription and analysis, the participants’ speech and language abilities were compared to those of their HA- and chronological age (CA)-matched peers using available norms for Maltese children. Additional information regarding the children’s speech and language history prior to and post-implantation was also collected, providing a holistic overview of the participants’ speech and language development. Results indicated that the children presented with speech and language delay when compared to their CA-matched peers. Variations across the participants were found in specific language skills. Similarities in language patterns were also noted, including expressive abilities in advance of receptive skills. These findings extend the limited data on the speech and language skills of Maltese children with cochlear implants, with comparison to norms for typically-developing children being a novel approach to research in this area.peer-reviewe

The Approximate Optimality of Simple Schedules for Half-Duplex Multi-Relay Networks

In ISIT'12 Brahma, \"{O}zg\"{u}r and Fragouli conjectured that in a half-duplex diamond relay network (a Gaussian noise network without a direct source-destination link and with $N$ non-interfering relays) an approximately optimal relay scheduling (achieving the cut-set upper bound to within a constant gap uniformly over all channel gains) exists with at most $N+1$ active states (only $N+1$ out of the $2^N$ possible relay listen-transmit configurations have a strictly positive probability). Such relay scheduling policies are said to be simple. In ITW'13 we conjectured that simple relay policies are optimal for any half-duplex Gaussian multi-relay network, that is, simple schedules are not a consequence of the diamond network's sparse topology. In this paper we formally prove the conjecture beyond Gaussian networks. In particular, for any memoryless half-duplex $N$-relay network with independent noises and for which independent inputs are approximately optimal in the cut-set upper bound, an optimal schedule exists with at most $N+1$ active states. The key step of our proof is to write the minimum of a submodular function by means of its Lov\'{a}sz extension and use the greedy algorithm for submodular polyhedra to highlight structural properties of the optimal solution. This, together with the saddle-point property of min-max problems and the existence of optimal basic feasible solutions in linear programs, proves the claim.Comment: Submitted to IEEE Information Theory Workshop (ITW) 201

Efficiently Finding Simple Schedules in Gaussian Half-Duplex Relay Line Networks

The problem of operating a Gaussian Half-Duplex (HD) relay network optimally is challenging due to the exponential number of listen/transmit network states that need to be considered. Recent results have shown that, for the class of Gaussian HD networks with N relays, there always exists a simple schedule, i.e., with at most N +1 active states, that is sufficient for approximate (i.e., up to a constant gap) capacity characterization. This paper investigates how to efficiently find such a simple schedule over line networks. Towards this end, a polynomial-time algorithm is designed and proved to output a simple schedule that achieves the approximate capacity. The key ingredient of the algorithm is to leverage similarities between network states in HD and edge coloring in a graph. It is also shown that the algorithm allows to derive a closed-form expression for the approximate capacity of the Gaussian line network that can be evaluated distributively and in linear time. Additionally, it is shown using this closed-form that the problem of Half-Duplex routing is NP-Hard.Comment: A short version of this paper was submitted to ISIT 201

Diabetic ketoacidosis and electrolyte disorders in patient with short bowel syndrome following acute mesenteric ischemia

Acute mesenteric ischemia (AMI) is defined as a sudden occurrence of insufficient blood supply to the intestine that can lead to necrosis (gangrene) of the intestine wall or its ischemia alone. It is therefore a life-threatening condition that requires rapid diagnosis and proper treatment. In presence of irreversible ischemic lesions the only treatment option is surgery. Short bowel syndrome commonly develops as a result of such treatment and can be a precipitating factor for the emergence of acid-base and electrolyte disorders

MASSIVE CODESIGN

This book focuses on “massive codesign”: the idea that multiple and/or numerous participants having different voices collaborate in a design pro- cess broken down into different steps and formats and resulting in a relevant and diversified amount of data. Services, strategies and scenarios are presented as the main field of ap- plication: these are complex items that demand complex processes be tac- kled, processes in which it is necessary to involve a variety of players who are largely interdependent and therefore who must collaborate in order to achieve any goal. The book essentially makes two main contributions: a “Collaborative De- sign Framework” to identify and structure codesign activities, methods and tools within massive creative processes; a “set of quick lessons learnt” to provide guidance to the conception and organisation of other massive crea- tive processes. The whole book is oriented at practice: it discusses codesign activities from the designer’s point of view, detailing issues such as process from beginning to end, activity flow, manipulability of tools, roles and rules for participants and many others. It is intended as a support for designers dealing in massive codesign processes and aims towards improved results

Ferric uptake regulator Fur is conditionally essential in Pseudomonas aeruginosa

In Pseudomonas aeruginosa, the ferric uptake regulator (Fur) protein controls both metabolism and virulence in response to iron availability. Differently from other bacteria, attempts to obtain fur deletion mutants of P. aeruginosa failed, leading to the assumption that Fur is an essential protein in this bacterium. By investigating a P. aeruginosa conditional fur mutant, we demonstrate that Fur is not essential for P. aeruginosa growth in liquid media, biofilm formation, and pathogenicity in an insect model of infection. Conversely, Fur is essential for growth on solid media since Fur-depleted cells are severely impaired in colony formation. Transposon-mediated random mutagenesis experiments identified pyochelin siderophore biosynthesis as a major cause of the colony growth defect of the conditional fur mutant, and deletion mutagenesis confirmed this evidence. Impaired colony growth of pyochelin-proficient Fur-depleted cells does not depend on oxidative stress, since Fur-depleted cells do not accumulate higher levels of reactive oxygen species (ROS) and are not rescued by antioxidant agents or overexpression of ROS-detoxifying enzymes. Ectopic expression of pch genes revealed that pyochelin production has no inhibitory effects on a fur deletion mutant of Pseudomonas syringae pv. tabaci, suggesting that the toxicity of the pch locus in Fur-depleted cells involves a P. aeruginosa-specific pathway(s)