Incidence, characteristics, and predictive factors for dysphagia after pediatric traumatic brain injury

Objective: (1) To establish an incidence figure for dysphagia in a population of pediatric traumatic brain injury (TBI) cases; (2) to provide descriptive data on the admitting characteristics, patterns of resolution, and outcomes of children with and without dysphagia after TBI; and (3) to identify any factors present at admission that may predict dysphagia. Participants: A total of 1, 145 children consecutively admitted to an acute care setting for traumatic brain injury between July 1995 and July 2000. Main outcome measure: Medical parameters relating to dysphagia based on medical chart review. Results: (1) Dysphagia incidence figure of 5.3% across all pediatric head injury admissions. Incidence figures of 68% for severe TBI, 15% for moderate TBI, and only 1% for mild brain injury. (2) Statistically significant differences were found between the dysphagic and nondysphagic subgroups on the variables of length of stay, length of ventilation, Glasgow Coma Scale (GCS), computed tomography classification, duration of speech pathology intervention, supplemental feeding duration, duration until initiation of oral intake (DIOF), duration to total oral intake (DTOF), and period of time from the initiation of intake until achievement of total oral intake (DI-TOF). (3) Significant predictive factors for dysphagia included GCS < 8.5 and a ventilation period in excess of 1.5 days. Conclusion: The provision of incidence data and predictive factors for dysphagia will enable clinicians in acute care settings to allocate resources necessary to deal with the predicted number of dysphagia cases in a pediatric population, and assist in predicting patients who are at risk for dysphagia following TBI. Early detection of patients with swallowing dysfunction will be aided by these data, in turn helping to facilitate effective medical and speech pathology intervention via assisting the reduction of medical complications such as aspiration pneumonia.

An augmented Lanczos algorithm for the efficient computation of a dot-product of a function of a large sparse symmetric matrix

The Lanczos algorithm is appreciated in many situations due to its speed. and economy of storage. However, the advantage that the Lanczos basis vectors need not be kept is lost when the algorithm is used to compute the action of a matrix function on a vector. Either the basis vectors need to be kept, or the Lanczos process needs to be applied twice. In this study we describe an augmented Lanczos algorithm to compute a dot product relative to a function of a large sparse symmetric matrix, without keeping the basis vectors.

The tree cut and merge algorithm for estimation of network reliability

This article presents Monte Carlo techniques for estimating network reliability. For highly reliable networks, techniques based on graph evolution models provide very good performance. However, they are known to have significant simulation cost. An existing hybrid scheme (based on partitioning the time space) is available to speed up the simulations; however, there are difficulties with optimizing the important parameter associated with this scheme. To overcome these difficulties, a new hybrid scheme (based on partitioning the edge set) is proposed in this article. The proposed scheme shows orders of magnitude improvement of performance over the existing techniques in certain classes of network. It also provides reliability bounds with little overhead.

A genetic algorithm/method of moments approach to the optimization of an RF coil for MRI applications - Theoretical considerations - Abstract

A Combined Genetic Algorithm and Method of Moments design methods is presented for the design of unusual near-field antennas for use in Magnetic Resonance Imaging systems. The method is successfully applied to the design of an asymmetric coil structure for use at 190MHz and demonstrates excellent radiofrequency field homogeneity.

Proposta de um algoritmo GPC adaptativo com baixo custo computacional

Esta dissertação propõe um algoritmo do Controlador Preditivo Generalizado (GPC) com horizonte de controle igual a um para ser aplicado em plantas industriais com modelos variantes no tempo, simples o su ficiente para ser implementado em Controlador Lógico Programável (PLC). A solução explícita do controlador é obtida em função dos parâmetros do modelo e dos parâmetros de sintonia do GPC (horizonte nal de predição hp e o fator de supressão do sinal de controle ), além das entradas e saídas presentes e passadas. A sintonia do fator de supressão e do horizonte de previsão GPC é feita através do lugar das raízes da equação característica do sistema em malha fechada, sempre que os parâmetros do modelo da planta industrial (estável ou instável em malha aberta) forem modificados.

Automated traffic route identification through the shared nearest neighbour algorithm

Many organisations need to extract useful information from huge amounts of movement data. One example is found in maritime transportation, where the automated identification of a diverse range of traffic routes is a key management issue for improving the maintenance of ports and ocean routes, and accelerating ship traffic. This paper addresses, in a first stage, the research challenge of developing an approach for the automated identification of traffic routes based on clustering motion vectors rather than reconstructed trajectories. The immediate benefit of the proposed approach is to avoid the reconstruction of trajectories in terms of their geometric shape of the path, their position in space, their life span, and changes of speed, direction and other attributes over time. For clustering the moving objects, an adapted version of the Shared Nearest Neighbour algorithm is used. The motion vectors, with a position and a direction, are analysed in order to identify clusters of vectors that are moving towards the same direction. These clusters represent traffic routes and the preliminary results have shown to be promising for the automated identification of traffic routes with different shapes and densities, as well as for handling noise data.

Multi-centre validation of an automatic algorithm for fast 4D myocardial segmentation in cine CMR datasets

Quantitative analysis of cine cardiac magnetic resonance (CMR) images for the assessment of global left ventricular morphology and function remains a routine task in clinical cardiology practice. To date, this process requires user interaction and therefore prolongs the examination (i.e. cost) and introduces observer variability. In this study, we sought to validate the feasibility, accuracy, and time efficiency of a novel framework for automatic quantification of left ventricular global function in a clinical setting.

Predictive Optimal Matrix Converter Control for a Dynamic Voltage Restorer with Flywheel Energy Storage

This paper presents a predictive optimal matrix converter controller for a flywheel energy storage system used as Dynamic Voltage Restorer (DVR). The flywheel energy storage device is based on a steel seamless tube mounted as a vertical axis flywheel to store kinetic energy. The motor/generator is a Permanent Magnet Synchronous Machine driven by the AC-AC Matrix Converter. The matrix control method uses a discrete-time model of the converter system to predict the expected values of the input and output currents for all the 27 possible vectors generated by the matrix converter. An optimal controller minimizes control errors using a weighted cost functional. The flywheel and control process was tested as a DVR to mitigate voltage sags and swells. Simulation results show that the DVR is able to compensate the critical load voltage without delays, voltage undershoots or overshoots, overcoming the input/output coupling of matrix converters.

Occupational exposure to environmental tobacco smoke in hospitality venues: are genetic- or proteomics-based biomarkers predictive of respiratory diseases?

Environmental tobacco smoke (ETS) is recognized as an occupational hazard in the hospitality industry. Although Portuguese legislation banned smoking in most indoor public spaces, it is still allowed in some restaurants/bars, representing a potential risk to the workers’ health, particularly for chronic respiratory diseases. The aims of this work were to characterize biomarkers of early genetic effects and to disclose proteomic signatures associated to occupational exposure to ETS and with potential to predict respiratory diseases development. A detailed lifestyle survey and clinical evaluation (including spirometry) were performed in 81 workers from Lisbon restaurants. ETS exposure was assessed through the level of PM 2.5 in indoor air and the urinary level of cotinine. The plasma samples were immunodepleted and analysed by 2D-SDSPAGE followed by in-gel digestion and LC-MS/MS. DNA lesions and chromosome damage were analysed innlymphocytes and in exfoliated buccal cells from 19 cigarette smokers, 29 involuntary smokers, and 33 non-smokers not exposed to tobacco smoke. Also, the DNA repair capacity was evaluated using an ex vivo challenge comet assay with an alkylating agent (EMS). All workers were considered healthy and recorded normal lung function. Interestingly, following 2D-DIGE-MS (MALDI-TOF/TOF), 61 plasma proteins were found differentially expressed in ETS-exposed subjects, including 38 involved in metabolism, acute-phase respiratory inflammation, and immune or vascular functions. On the other hand, the involuntary smokers showed neither an increased level of DNA/chromosome damage on lymphocytes nor an increased number of micronuclei in buccal cells, when compared to non-exposed non-smokers. Noteworthy, lymphocytes challenge with EMS resulted in a significantly lower level of DNA breaks in ETS-exposed as compared to non-exposed workers (P<0.0001) suggestive of an adaptive response elicited by the previous exposure to low levels of ETS. Overall, changes in proteome may be promising early biomarkers of exposure to ETS. Likewise, alterations of the DNA repair competence observed upon ETS exposure deserves to be further understood. Work supported by Fundação Calouste Gulbenkian, ACSS and FCT/Polyannual Funding Program.

Lanczos algorithm on the grassmann manifold

5th. European Congress on Computational Methods in Applied Sciences and Engineering (ECCOMAS 2008) 8th. World Congress on Computational Mechanics (WCCM8)

Fast optimum-predictive control and capacitor voltage balancing strategy for bipolar back-to-back NPC converters in high-voltage direct current transmission systems

Multilevel power converters have been introduced as the solution for high-power high-voltage switching applications where they have well-known advantages. Recently, full back-to-back connected multilevel neutral point diode clamped converters (NPC converter) have been used inhigh-voltage direct current (HVDC) transmission systems. Bipolar-connected back-to-back NPC converters have advantages in long-distance HVDCtransmission systems over the full back-to-back connection, but greater difficulty to balance the dc capacitor voltage divider on both sending and receiving end NPC converters. This study shows that power flow control and dc capacitor voltage balancing are feasible using fast optimum-predictive-based controllers in HVDC systems using bipolar back-to-back-connected five-level NPC multilevel converters. For both converter sides, the control strategytakes in account active and reactive power, which establishes ac grid currents in both ends, and guarantees the balancing of dc bus capacitor voltages inboth NPC converters. Additionally, the semiconductor switching frequency is minimised to reduce switching losses. The performance and robustness of the new fast predictive control strategy, and its capability to solve the DC capacitor voltage balancing problem of bipolar-connected back-to-back NPCconverters are evaluated.

HVDC transmission systems: Bipolar back-to-back diode clamped multilevel converter with fastoptimum-predictive control and capacitor balancing strategy

Voltage source multilevel power converter structures are being considered for high power high voltage applications where they have well known advantages. Recently, full back-to-back connected multilevel neutral diode clamped converters (NPC) have been used in high voltage direct current (HVDC) transmission systems. Bipolar back-to-back connection of NPCs have advantages in long distance HVDC transmission systems, but highly increased difficulties to balance the dc capacitor voltage dividers on both sending and receiving end NPCs. This paper proposes a fast optimum-predictive controller to balance the dc capacitor voltages and to control the power flow in a long distance HVDCsystem using bipolar back-to-back connected NPCs. For both converter sides, the control strategy considers active and reactive power to establish ac grid currents on sending and receiving ends, while guaranteeing the balancing of both NPC dc bus capacitor voltages. Furthermore, the fast predictivecontroller minimizes the semiconductor switching frequency to reduce global switching losses. The performance and robustness of the new fast predictive control strategy and the associated dc capacitors voltage balancing are evaluated. (C) 2011 Elsevier B.V. All rights reserved.

IOPT Petri Net State Space Generation Algorithm with Maximal-Step Execution Semantics

This paper presents an algorithm to efficiently generate the state-space of systems specified using the IOPT Petri-net modeling formalism. IOPT nets are a non-autonomous Petri-net class, based on Place-Transition nets with an extended set of features designed to allow the rapid prototyping and synthesis of system controllers through an existing hardware-software co-design framework. To obtain coherent and deterministic operation, IOPT nets use a maximal-step execution semantics where, in a single execution step, all enabled transitions will fire simultaneously. This fact increases the resulting state-space complexity and can cause an arc "explosion" effect. Real-world applications, with several million states, will reach a higher order of magnitude number of arcs, leading to the need for high performance state-space generator algorithms. The proposed algorithm applies a compilation approach to read a PNML file containing one IOPT model and automatically generate an optimized C program to calculate the corresponding state-space.