Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Lecture

Respiratory Analysis: Normal Breathing

In courses (2)

BIO-378: Physiology lab I

Le TP de physiologie introduit les approches expérimentales du domaine biomédical, avec les montages de mesure, les capteurs, le conditionnement des signaux, l'acquisition et traitement de données. Les résultats physiologiques finaux illustrent le contenu ...

BIO-379: Physiology lab II

Description

This lecture covers the analysis of normal breathing, focusing on respiratory parameters such as amplitude, time, CO2 levels, and respiratory flow. The instructor discusses graphs showing respiratory volume, frequency, and stroke volume.

Instructor

André Pexieder

Official source

Ontological neighbourhood

Health sciences

Intensive care medicine: Topics in intensive care medicine

Related concepts (23)

Acute respiratory distress syndrome

Acute respiratory distress syndrome (ARDS) is a type of respiratory failure characterized by rapid onset of widespread inflammation in the lungs. Symptoms include shortness of breath (dyspnea), rapid breathing (tachypnea), and bluish skin coloration (cyanosis). For those who survive, a decreased quality of life is common. Causes may include sepsis, pancreatitis, trauma, pneumonia, and aspiration.

Respiratory failure

Respiratory failure results from inadequate gas exchange by the respiratory system, meaning that the arterial oxygen, carbon dioxide, or both cannot be kept at normal levels. A drop in the oxygen carried in the blood is known as hypoxemia; a rise in arterial carbon dioxide levels is called hypercapnia. Respiratory failure is classified as either Type 1 or Type 2, based on whether there is a high carbon dioxide level, and can be acute or chronic.

Line graph

In the mathematical discipline of graph theory, the line graph of an undirected graph G is another graph L(G) that represents the adjacencies between edges of G. L(G) is constructed in the following way: for each edge in G, make a vertex in L(G); for every two edges in G that have a vertex in common, make an edge between their corresponding vertices in L(G). The name line graph comes from a paper by although both and used the construction before this.

Planar graph

In graph theory, a planar graph is a graph that can be embedded in the plane, i.e., it can be drawn on the plane in such a way that its edges intersect only at their endpoints. In other words, it can be drawn in such a way that no edges cross each other. Such a drawing is called a plane graph or planar embedding of the graph. A plane graph can be defined as a planar graph with a mapping from every node to a point on a plane, and from every edge to a plane curve on that plane, such that the extreme points of each curve are the points mapped from its end nodes, and all curves are disjoint except on their extreme points.

Infant respiratory distress syndrome

Infantile respiratory distress syndrome (IRDS), also called respiratory distress syndrome of newborn, or increasingly surfactant deficiency disorder (SDD), and previously called hyaline membrane disease (HMD), is a syndrome in premature infants caused by developmental insufficiency of pulmonary surfactant production and structural immaturity in the lungs. It can also be a consequence of neonatal infection and can result from a genetic problem with the production of surfactant-associated proteins.

Related lectures (34)

Automorphism groups: Trees and Graphs

Explores automorphism groups in trees and graphs, focusing on ends and types of automorphisms.

Automorphism Groups: Trees and Graphs III

Explores automorphism groups of trees and graphs, including actions on trees and group homomorphisms.

Automorphism groups of trees and graphs II

Explores the uniqueness of trees, automorphism groups, Cayley-Abels graphs, and constructing vertex-transitive subgroups with prescribed local actions.

Graphs: Properties and Representations

Covers graph properties, representations, and traversal algorithms using BFS and DFS.

Real Functions: Graphs and Properties