Cochlear Implant Outcomes and Genetic Mutations in Children with Ear and Brain Anomalies

Background. Specific clinical conditions could compromise cochlear implantation outcomes and drastically reduce the chance of an acceptable development of perceptual and linguistic capabilities. These conditions should certainly include the presence of inner ear malformations or brain abnormalities. The aims of this work were to study the diagnostic value of high resolution computed tomography (HRCT) and magnetic resonance imaging (MRI) in children with sensorineural hearing loss who were candidates for cochlear implants and to analyse the anatomic abnormalities of the ear and brain in patients who underwent cochlear implantation. We also analysed the effects of ear malformations and brain anomalies on the CI outcomes, speculating on their potential role in the management of language developmental disorders. Methods. The present study is a retrospective observational review of cochlear implant outcomes among hearing-impaired children who presented ear and/or brain anomalies at neuroimaging investigations with MRI and HRCT. Furthermore, genetic results from molecular genetic investigations (GJB2/GJB6 and, additionally, in selected cases, SLC26A4 or mitochondrial-DNA mutations) on this study group were herein described. Longitudinal and cross-sectional analysis was conducted using statistical tests. Results. Between January 1, 1996 and April 1, 2012, at the ENT-Audiology Department of the University Hospital of Ferrara, 620 cochlear implantations were performed. There were 426 implanted children at the time of the present study (who were <18 years). Among these, 143 patients (64 females and 79 males) presented ear and/or brain anomalies/lesions/malformations at neuroimaging investigations with MRI and HRCT. The age of the main study group (143 implanted children) ranged from 9 months and 16 years (average = 4.4; median = 3.0). Conclusions. Good outcomes with cochlear implants are possible in patients who present with inner ear or brain abnormalities, even if central nervous system anomalies represent a negative prognostic factor that is made worse by the concomitant presence of cochlear malformations. Common cavity and stenosis of the internal auditory canal (less than 2 mm) are negative prognostic factors even if brain lesions are absent

A Calculus for Orchestration of Web Services

We introduce COWS (Calculus for Orchestration of Web Services), a new foundational language for SOC whose design has been influenced by WS-BPEL, the de facto standard language for orchestration of web services. COWS combines in an original way a number of ingredients borrowed from well-known process calculi, e.g. asynchronous communication, polyadic synchronization, pattern matching, protection, delimited receiving and killing activities, while resulting different from any of them. Several examples illustrates COWS peculiarities and show its expressiveness both for modelling imperative and orchestration constructs, e.g. web services, flow graphs, fault and compensation handlers, and for encoding other process and orchestration languages

Orchestrating Tuple-based Languages

The World Wide Web can be thought of as a global computing architecture supporting the deployment of distributed networked applications. Currently, such applications can be programmed by resorting mainly to two distinct paradigms: one devised for orchestrating distributed services, and the other designed for coordinating distributed (possibly mobile) agents. In this paper, the issue of designing a pro- gramming language aiming at reconciling orchestration and coordination is investigated. Taking as starting point the orchestration calculus Orc and the tuple-based coordination language Klaim, a new formalism is introduced combining concepts and primitives of the original calculi. To demonstrate feasibility and effectiveness of the proposed approach, a prototype implementation of the new formalism is described and it is then used to tackle a case study dealing with a simplified but realistic electronic marketplace, where a number of on-line stores allow client applications to access information about their goods and to place orders

Reasoning About a Service-oriented Programming Paradigm

This paper is about a new way for programming distributed applications: the service-oriented one. It is a concept paper based upon our experience in developing a theory and a language for programming services. Both the theoretical formalization and the language interpreter showed us the evidence that a new programming paradigm exists. In this paper we illustrate the basic features it is characterized by

SCC: A Service Centered Calculus

We seek for a small set of primitives that might serve as a basis for formalising and programming service oriented applications over global computers. As an outcome of this study we introduce here SCC, a process calculus that features explicit notions of service definition, service invocation and session handling. Our proposal has been influenced by Orc, a programming model for structured orchestration of services, but the SCC’s session handling mechanism allows for the definition of structured interaction protocols, more complex than the basic request-response provided by Orc. We present syntax and operational semantics of SCC and a number of simple but nontrivial programming examples that demonstrate flexibility of the chosen set of primitives. A few encodings are also provided to relate our proposal with existing ones

Drip and Mate Operations Acting in Test Tube Systems and Tissue-like P systems

The operations drip and mate considered in (mem)brane computing resemble the operations cut and recombination well known from DNA computing. We here consider sets of vesicles with multisets of objects on their outside membrane interacting by drip and mate in two different setups: in test tube systems, the vesicles may pass from one tube to another one provided they fulfill specific constraints; in tissue-like P systems, the vesicles are immediately passed to specified cells after having undergone a drip or mate operation. In both variants, computational completeness can be obtained, yet with different constraints for the drip and mate operations

A Process Model of the U.S. Federal Perspective on STEM

Although advocacy for better science, technology, engineering, and mathematics (STEM) education has a long and distinguished history in the United States, the recent emphasis has included strong rhetoric and concomitant funding. Policy makers legislate as though STEM is clearly defined. Yet, the concept remains nebulous, which limits the nation’s capacity to act in a strong and uniformed manner to address societal challenges. In this study, the authors used grounded theory methods to synthesize and interpret the federal perspective that defines STEM in the United States. The resulting theory is a model that includes five core processes: recruitment, recapture, retention, quality assurance, and quality control. These processes interact to support the system in achieving its goal of producing a qualified future workforce. Such a model has implications for advancing the overall goals of STEM as well as further research and development on the components of the model itself

Regulating Data Exchange in Service Oriented Applications

We define a type system for COWS, a formalism for specifying and combining services, while modelling their dynamic behaviour. Our types permit to express policies constraining data exchanges in terms of sets of service partner names attachable to each single datum. Service programmers explicitly write only the annotations necessary to specify the wanted policies for communicable data, while a type inference system (statically) derives the minimal additional annotations that ensure consistency of services initial configuration. Then, the language dynamic semantics only performs very simple checks to authorize or block communication. We prove that the type system and the operational semantics are sound. As a consequence, we have the following data protection property: services always comply with the policies regulating the exchange of data among interacting services. We illustrate our approach through a simplified but realistic scenario for a service-based electronic marketplace

Transport Northbound Interface:The need for Specification and Standards coordination

Next generation optical transport networks have high benchmarks for flexibility, reliability, and operational simplicity. These requirements underline a common, technology-independent orchestration paradigm that can be extended to represent and configure specific optical technology attributes. Although, orchestration is an ongoing aspect of the current optical transport network evolution, the meaning and scope of orchestration is often only implied, and various Specification and Standards communities cannot always agree the requirements and objectives. This paper describes the high-level requirements facing optical transport networks to provide well-defined Transport Northbound Interface (T-NBI) for optical resource programmability, control, and management automation. It explores the overall functionality that must be provided, whether encompassed in a single large-scale orchestration wrapper or partitioned into several sub-functions, of which only one component is designated as a transport orchestrator. It highlights the early efforts for optical transport resource modeling across Specification and Standardisation organisations. The paper will report on recent Internet Engineering Task Force (IETF) Transport NBI Team Design Team efforts to collaborate across Standards Development Organisations (SDOs) to unify transport interface requirements and objectives. Finally, the paper will highlight use cases and applicability examples, and outline research gaps and challenges, opportunities for researchers, and areas for further collaboration between academia and industry