PubMed Health⌕ Search

PubMed · 15362273

A dual closed-loop control system for mechanical ventilation.

Abstract

OBJECTIVE: Closed-loop mechanical ventilation has the potential to provide more effective ventilatory support to patients with less complexity than conventional ventilation. The purpose of this study was to investigate the effectiveness of an automatic technique for mechanical ventilation. METHODS: Two closed-loop control systems for mechanical ventilation are combined in this study. In one of the control systems several physiological data are used to automatically adjust the frequency and tidal volume of breaths of a patient. This method, which is patented under US Patent number 4986268, uses the criterion of minimal respiratory work rate to provide the patient with a natural pattern of breathing. The inputs to the system include data representing CO2 and O2 levels of the patient as well as respiratory compliance and airway resistance. The I:E ratio is adjusted on the basis of the respiratory time constant to allow for effective emptying of the lungs in expiration and to avoid intrinsic positive end expiratory pressure (PEEP). This system is combined with another closed-loop control system for automatic adjustment of the inspired fraction of oxygen of the patient. This controller uses the feedback of arterial oxygen saturation of the patient and combines a rapid stepwise control procedure with a proportional-integral-derivative (PID) control algorithm to automatically adjust the oxygen concentration in the patient's inspired gas. The dual closed-loop control system has been examined by using mechanical lung studies, computer simulations and animal experiments. RESULTS: In the mechanical lung studies, the ventilation controller adjusted the breathing frequency and tidal volume in a clinically appropriate manner in response to changes in respiratory mechanics. The results of computer simulations and animal studies under induced disturbances showed that blood gases were returned to the normal physiologic range in less than 25 s by the control system. In the animal experiments understeady-state conditions, the maximum standard deviations of arterial oxygen saturation and the end-tidal partial pressure of CO2 were +/- 1.76% and +/- 1.78 mmHg, respectively. CONCLUSION: The controller maintained the arterial blood gases within normal limits under steady-state conditions and the transient response of the system was robust under various disturbances. The results of the study have showed that the proposed dual closed-loop technique has effectively controlled mechanical ventilation under different test conditions.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Fleur Tehrani, Mark Rogers, Takkin Lo, Thomas Malinowski, Samuel Afuwape, Michael Lum, Brett Grundl, Michael Terry. 2004. A dual closed-loop control system for mechanical ventilation.. https://doi.org/10.1023/b%3Ajocm.0000032744.99885.38

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related citations

A note on a generalized single step theory for any number of hierarchical genomic matrices.

BACKGROUND: The Single Step algorithm allows combining information from genotyped and un-genotyped individuals, provided they are connected by a pedigree. However, current single step theory is limited to a single list of markers. RESULTS: We present a generalized single step (GSS) method that can accommodate any number of hierarchical molecular datasets (e.g. sequence, high and low density arrays) and pedigree, avoiding imputation. We prove that a similar efficient inversion algorithm exists. The method is recursive, starting with the highest marker density scenario. We illustrate the method with simulation and show that GSS can increase predictive accuracy compared to standard single step. R code is provided so that custom scenarios can be easily compared, either with simulated or real data. CONCLUSION: The method developed generalizes extant single step theory to any number of hierarchical molecular relationship matrices, broadening the scenarios where single step can be applied. A topic of particular interest can be ecology field data or human populations where pedigree is not available, but where samples sequenced and genotyped at different densities can exist. GSS can also be a useful tool to optimize allocation of genotyping and / or sequencing resources.

Algorithms↗

cgDist: Nucleotide-level distance calculation from cgMLST allelic profiles.

Bacterial genomic surveillance requires balancing computational efficiency with genetic resolution for effective cluster investigation. cgMLST distance calculations treat all allelic differences as equivalent units, obscuring nucleotide-level variation. Furthermore, single nucleotide polymorphism-based pipelines provide finer resolution at substantially higher computational cost, which limits their routine deployment in surveillance laboratories. We present cgDist, an algorithm that calculates nucleotide-level distances directly from cgMLST allelic profiles, providing finer resolution than allele-count distances by leveraging within-allele nucleotide variation. The cache architecture stores alignment statistics, enabling distance calculation modes without computation and supporting both dataset-specific and schema-complete cache generation. This design enables incremental surveillance analysis, with performance benefits as laboratories accumulate alignment data. cgDist functions as a precision 'zoom lens' for the investigation of clusters identified through initial cgMLST screening. Rather than restructuring population relationships, this targeted approach concentrates enhanced resolution where it is most informative. The algorithm ensures that cgDist distances are greater than or equal to corresponding cgMLST distances, preserving epidemiological interpretability while adding genetic discrimination. By increasing resolution within identified clusters, cgDist may also support outbreak investigation, a potential application that remains to be evaluated on outbreak-derived data.

Algorithms↗

Theseus: fast and optimal affine-gap sequence-to-graph alignment.

MOTIVATION: Sequence-to-graph alignment is a central problem in bioinformatics, with applications in multiple sequence alignment (MSA) and pangenome analysis, among others. However, current algorithms for optimal affine-gap alignment impose high memory and computational requirements, limiting their scalability to aligning long sequences to complex graphs. Practical solutions partially address this problem using heuristic strategies that ultimately trade off optimality for speed. RESULTS: This work presents Theseus, a novel, fast, and optimal affine-gap sequence-to-graph alignment algorithm. Theseus leverages similarities between genomic sequences to accelerate the alignment computation and reduces the overall memory requirements without compromising optimality. To that end, Theseus processes only a subset of the dynamic programming cells, using a sparse-data strategy that enables efficient sequence-to-graph alignment. Moreover, our algorithm supports optimal affine-gap alignment on arbitrary directed graphs, including those with cycles. We evaluate Theseus on two key problems: MSA and pangenome read mapping. For MSA, we compare it against SPOA, abPOA, and POASTA. Theseus is 1.6× to 17.6× faster than POASTA, and 7.3× faster, on average, than SPOA, both optimal aligners. Compared with abPOA, Theseus ensures optimality and scales to the largest problems. For pangenome read mapping, we benchmark Theseus against the alignment stage of the mapping tool vg map, along with the alignment kernels of SPOA, abPOA, and POASTA. Theseus outperforms the other methods, showing a 1.9× to 16.9× speedup on short reads. Moreover, Theseus is 1.5× to 36.3× faster than vg when aligning against synthetic cyclic graphs. AVAILABILITY AND IMPLEMENTATION: Theseus code and documentation are publicly available at https://github.com/albertjimenezbl/theseus-lib.

Algorithms↗