81 research outputs found

    A Parallel-In-Time Gradient-Type Method For Optimal Control Problems

    Get PDF
    This thesis proposes and analyzes a new parallel-in-time gradient-type method for time-dependent optimal control problems. When the classical gradient method is applied to time-dependent optimal control problems, each iteration requires the forward solution of the state equations followed by the backward solution of the adjoint equations before the gradient can be computed and the controls can be updated. The solution of the state equations and the adjoint equations is computationally expensive, is carried out sequentially in the time dimension, and consumes most of the computation time. The proposed new parallel-in-time gradient-type method introduces parallelism by splitting the time domain into N subdomains and executes the forward and backward computation in each time subdomain in parallel using state and adjoint variables at time subdomain boundaries from the last optimization iteration as initial values. Ignoring communication cost and assuming computation load balance, N parallel-in-time gradient-type iterations can be executed in the computing time required by a single classical gradient iteration. The basic proposed parallel-in-time gradient-type method is also generalized to allow for different time domain partitions for forward and backward computations and overlapping time subdomains. Due to the time domain decomposition, the state and the adjoint equations are not satisfied, since states and adjoints exhibit jump discontinuities at the time subdomain boundaries. Therefore the control update direction in the parallel gradient-type method is not a negative gradient direction and existing convergence theories for the gradient method do not apply. I provide convergence analyses for the new parallel-in-time gradient-type method applied to discrete-time optimal control problems. For linear-quadratic discrete-time optimal control problems, I show that the new parallel-in-time gradient-type method can be interpreted as a multiple-part splitting iteration scheme where control update in one iteration is determined by control variable iterates from multiple previous iterations, and I prove convergence of the new method for sufficiently small fixed step size by showing that the spectral radius of a corresponding implicitly constructed iteration matrix is less than one. For general non-linear discrete-time optimal control problems the parallel-in-time gradient-type method is combined with metric projection onto a closed convex set to handle simple control constraints. Convergence is proved for sufficiently small step sizes. Convergence theorems are given with different assumptions on the problem, such as convex objective function or compact control constraints. For linear-quadratic optimal control problems, I also interpret the parallel-in-time gradient-type method using a multiple shooting reformulation of the optimization problem. The new method can be seen as using a gradient-type iteration to solve the optimality saddle point system in the multiple shooting formulation. An alternative convergence proof is given for linear-quadratic problems by the multiple shooting point of view. The new parallel-in-time gradient-type method is applied to linear-quadratic optimal control problems governed by linear advection-diffusion partial differential equations (PDEs), and to a well-rate optimization problem governed by a system of highly non-linear PDEs that models two-phase immiscible incompressible subsurface flow. For linear-quadratic optimal control problem, each iteration of the parallel gradient-type method with N time subdomains takes roughly 1/N-th of the time required for one iteration of the classical gradient method. For moderate N (up to N=50 in one example) time subdomains, the parallel gradient-type method converges in approximately the same number of iterations as the classical gradient method and thus exhibits excellent scaling. For larger N, the parallel gradient-type method may use significantly more iterations than the classical gradient method, which negatively impacts scaling for large N. The parallelization in time is on top of parallelization already used to solve the state and adjoint equations (e.g., through parallel linear solvers/preconditioners). This is exploited for the larger and more complex well-rate optimization problem. If existing parallelism in space scales well up to K processors, the addition of time domain decomposition scales well up to K * N processors for small to moderate number N of time subdomains

    Phloretin Attenuates Listeria monocytogenes Virulence Both In vitro and In vivo by Simultaneously Targeting Listeriolysin O and Sortase A

    Get PDF
    The critical roles of sortase A (SrtA) and listeriolysin O (LLO) in Listeria monocytogenes pathogenicity render these two virulence factors as ideal targets for the development of anti-virulence agents against L. monocytogenes infection. Additionally, the structures of SrtA and LLO are highly conserved among the members of sortase enzyme family and cholesterol dependent toxin family. Here, phloretin, a natural polyphenolic compound derived from apples and pears that has little anti-L. monocytogenes activity, was identified to simultaneously inhibit LLO expression and neutralize SrtA catalytic activity. Phloretin neutralized SrtA activity by causing a conformational change in the protein's active pocket, which prevented engagement with its substrate. Treatment with phloretin simultaneously reduced L. monocytogenes invasion into host cells and blocked the escape of vacuole-entrapped L. monocytogenes into cytoplasm. Further, L. monocytogenes-infected mice that received phloretin showed lower mortality, decreased bacterial burden and reduced pathological injury. Our results demonstrate that phloretin is a promising anti-infective therapeutic for infections caused by L. monocytogenes due to its simultaneous targeting of SrtA and LLO, which may result in fewer side effects than those caused by other antibiotics

    Germline-encoded neutralization of a Staphylococcus aureus virulence factor by the human antibody repertoire.

    Get PDF
    Staphylococcus aureus is both an important pathogen and a human commensal. To explore this ambivalent relationship between host and microbe, we analysed the memory humoral response against IsdB, a protein involved in iron acquisition, in four healthy donors. Here we show that in all donors a heavily biased use of two immunoglobulin heavy chain germlines generated high affinity (pM) antibodies that neutralize the two IsdB NEAT domains, IGHV4-39 for NEAT1 and IGHV1-69 for NEAT2. In contrast to the typical antibody/antigen interactions, the binding is primarily driven by the germline-encoded hydrophobic CDRH-2 motifs of IGHV1-69 and IGHV4-39, with a binding mechanism nearly identical for each antibody derived from different donors. Our results suggest that IGHV1-69 and IGHV4-39, while part of the adaptive immune system, may have evolved under selection pressure to encode a binding motif innately capable of recognizing and neutralizing a structurally conserved protein domain involved in pathogen iron acquisition

    Capsaicin Protects Mice from Community-Associated Methicillin-Resistant Staphylococcus aureus Pneumonia

    Get PDF
    BACKGROUND: α-toxin is one of the major virulence factors secreted by most Staphylococcus aureus strains, which played a central role in the pathogenesis of S. aureus pneumonia. The aim of this study was to investigate the impact of capsaicin on the production of α-toxin by community-associated methicillin-resistant Staphylococcus aureus (CA-MRSA) strain USA 300 and to further assess its performance in the treatment of CA-MRSA pneumonia in a mouse model. METHODOLOGY/PRINCIPAL FINDINGS: The in vitro effects of capsaicin on α-toxin production by S. aureus USA 300 were determined using hemolysis, western blot, and real-time RT-PCR assays. The influence of capsaicin on the α-toxin-mediated injury of human alveolar epithelial cells was determined using viability and cytotoxicity assays. Mice were infected intranasally with S. aureus USA300; the in vivo protective effects of capsaicin against S. aureus pneumonia were assessed by monitoring the mortality, histopathological changes and cytokine levels. Low concentrations of capsaicin substantially decreased the production of α-toxin by S. aureus USA 300 without affecting the bacterial viability. The addition of capsaicin prevented α-toxin-mediated human alveolar cell (A549) injury in co-culture with S. aureus. Furthermore, the in vivo experiments indicated that capsaicin protected mice from CA-MRSA pneumonia caused by strain USA 300. CONCLUSIONS/SIGNIFICANCE: Capsaicin inhibits the production of α-toxin by CA-MRSA strain USA 300 in vitro and protects mice from CA-MRSA pneumonia in vivo. However, the results need further confirmation with other CA-MRSA lineages. This study supports the views of anti-virulence as a new antibacterial approach for chemotherapy

    Finishing the euchromatic sequence of the human genome

    Get PDF
    The sequence of the human genome encodes the genetic instructions for human physiology, as well as rich information about human evolution. In 2001, the International Human Genome Sequencing Consortium reported a draft sequence of the euchromatic portion of the human genome. Since then, the international collaboration has worked to convert this draft into a genome sequence with high accuracy and nearly complete coverage. Here, we report the result of this finishing process. The current genome sequence (Build 35) contains 2.85 billion nucleotides interrupted by only 341 gaps. It covers ∼99% of the euchromatic genome and is accurate to an error rate of ∼1 event per 100,000 bases. Many of the remaining euchromatic gaps are associated with segmental duplications and will require focused work with new methods. The near-complete sequence, the first for a vertebrate, greatly improves the precision of biological analyses of the human genome including studies of gene number, birth and death. Notably, the human enome seems to encode only 20,000-25,000 protein-coding genes. The genome sequence reported here should serve as a firm foundation for biomedical research in the decades ahead

    Prevalence, associated factors and outcomes of pressure injuries in adult intensive care unit patients: the DecubICUs study

    Get PDF
    Funder: European Society of Intensive Care Medicine; doi: http://dx.doi.org/10.13039/501100013347Funder: Flemish Society for Critical Care NursesAbstract: Purpose: Intensive care unit (ICU) patients are particularly susceptible to developing pressure injuries. Epidemiologic data is however unavailable. We aimed to provide an international picture of the extent of pressure injuries and factors associated with ICU-acquired pressure injuries in adult ICU patients. Methods: International 1-day point-prevalence study; follow-up for outcome assessment until hospital discharge (maximum 12 weeks). Factors associated with ICU-acquired pressure injury and hospital mortality were assessed by generalised linear mixed-effects regression analysis. Results: Data from 13,254 patients in 1117 ICUs (90 countries) revealed 6747 pressure injuries; 3997 (59.2%) were ICU-acquired. Overall prevalence was 26.6% (95% confidence interval [CI] 25.9–27.3). ICU-acquired prevalence was 16.2% (95% CI 15.6–16.8). Sacrum (37%) and heels (19.5%) were most affected. Factors independently associated with ICU-acquired pressure injuries were older age, male sex, being underweight, emergency surgery, higher Simplified Acute Physiology Score II, Braden score 3 days, comorbidities (chronic obstructive pulmonary disease, immunodeficiency), organ support (renal replacement, mechanical ventilation on ICU admission), and being in a low or lower-middle income-economy. Gradually increasing associations with mortality were identified for increasing severity of pressure injury: stage I (odds ratio [OR] 1.5; 95% CI 1.2–1.8), stage II (OR 1.6; 95% CI 1.4–1.9), and stage III or worse (OR 2.8; 95% CI 2.3–3.3). Conclusion: Pressure injuries are common in adult ICU patients. ICU-acquired pressure injuries are associated with mainly intrinsic factors and mortality. Optimal care standards, increased awareness, appropriate resource allocation, and further research into optimal prevention are pivotal to tackle this important patient safety threat

    A Fast Preconditioner For Helmholtz Equation

    No full text
    This monograph implements a fast preconditioner of Helmholtz Equation and a related GMRES iterative algorithm. Numerical results are listed and several thoughts and considerations are included

    Automating NISQ Application Design with Meta Quantum Circuits with Constraints (MQCC)

    No full text
    Near-term intermediate scale quantum (NISQ) computers are likely to have very restricted hardware resources, where precisely controllable qubits are expensive, error-prone, and scarce. Programmers of such computers must therefore balance trade-offs among a large number of (potentially heterogeneous) factors specific to the targeted application and quantum hardware. To assist them, we propose Meta Quantum Circuits with Constraints (MQCC), a meta-programming framework for quantum programs. Programmers express their application as a succinct collection of normal quantum circuits stitched together by a set of (manually or automatically) added meta-level choice variables, whose values are constrained according to a programmable set of quantitative optimization criteria. MQCC’s compiler generates the appropriate constraints and solves them via an SMT solver, producing an optimized, runnable program. We showcase a few MQCC’s applications for its generality including an automatic generation of efficient error syndrome extraction schemes for fault-tolerant quantum error correction with heterogeneous qubits and an approach to writing approximate quantum Fourier transformation and quantum phase estimation that smoothly trades off accuracy and resource use. We also illustrate that MQCC can easily encode prior one-off NISQ application designs-–multi-programming (MP), crosstalk mitigation (CM)—as well as a combination of their optimization goals (i.e., a combined MP-CM).https://doi.org/10.1145/357936
    corecore