SearcharxivSearch

arXiv subjects

M. Olsen

Publications and source records attributed to M. Olsen.

4 recordsLinked to original sources

Splitting one ventilator for multiple patients -- a technical assessment

Due to the recent coronavirus outbreak, many efforts and innovative solutions have surfaced to deal with the possible shortage of ventilators upon catastrophic surges of patients. One solution involves splitting one ventilator to treat multiple patients and is in principle easy to implement, but there are obvious risks, and little is known on how the technique would work on patients with ARDS from Covid-19. Previous studies have shown that multiple test lungs of equal characteristics can be successfully ventilated from one machine, but that large variations in tidal volume delivery occurs when lungs with different compliance are connected. In contribution to the discussion of the feasibility of the technique, a technical assessment was done including experiments expanding on the previous studies using two types of test lungs, different ventilator settings and test lung characteristics. Using two test lungs connected to a ventilator, the tidal volumes and pressures into both lungs were measured for different combinations of lung compliance, airway resistances, modes of ventilation, inspiratory and end-expiratory pressure levels. We found discrepancies in delivered tidal volumes for paired test lungs proportional with compliance differences, little influence from differences in airway resistances, and that changes in compliance of only one test lung would also change the tidal volume delivered to the other test lung when in volume controlled mode. For one of the test lung types, we also found that higher PEEP settings could strongly influence the tidal volume balance between the test lungs. From this study and from a technical point of view, we were not able to identify reliable settings, adjustments or any simple measures to overcome the hazards of this simple technique, and a more advanced solution is indicated for mitigating risks.

physics.med-ph

Decomposition of balanced multipartite tournaments into strongly connected tournaments

Decomposing a digraph into subdigraphs with a fixed structure or property is a classical problem in graph theory and a useful tool in a number of applications of networks and communication. A digraph is strongly connected if it contains a directed path from each vertex to all others. In this paper we consider multipartite tournaments, and we study the existence of a partition of a multipartite tournament with $c$ partite sets into strongly connected $c$-tournaments. This is a continuation of the study started in 1999 by Volkmann of the existence of strongly connected subtournaments in multipartite tournaments.

math.CO

Solving the kernel perfect problem by (simple) forbidden subdigraphs for digraphs in some families of generalized tournaments and generalized bipartite tournaments

A digraph such that every proper induced subdigraph has a kernel is said to be \emph{kernel perfect} (KP for short) (\emph{critical kernel imperfect} (CKI for short) resp.) if the digraph has a kernel (does not have a kernel resp.). The unique CKI-tournament is $\overrightarrow{C}_3$ and the unique KP-tournaments are the transitive tournaments, however bipartite tournaments are KP. In this paper we characterize the CKI- and KP-digraphs for the following families of digraphs: locally in-/out-semicomplete, asymmetric arc-locally in-/out-semicomplete, asymmetric $3$-quasi-transitive and asymmetric $3$-anti-quasi-transitive $TT_3$-free and we state that the problem of determining whether a digraph of one of these families is CKI is polynomial, giving a solution to a problem closely related to the following conjecture posted by Bang-Jensen in 1998: the kernel problem is polynomially solvable for locally in-semicomplete digraphs.

math.CO

On the Complexity of Exchanging

We analyze the computational complexity of the problem of deciding whether, for a given simple game, there exists the possibility of rearranging the participants in a set of $j$ given losing coalitions into a set of $j$ winning coalitions. We also look at the problem of turning winning coalitions into losing coalitions. We analyze the problem when the simple game is represented by a list of wining, losing, minimal winning or maximal loosing coalitions.

cs.GT