| 1. |
- Allerbo, Oskar, 1985, et al.
(författare)
-
Simulations of lipid vesicle rupture induced by an adjacent supported lipid bilayer patch
- 2011
-
Ingår i: Colloids and Surfaces B: Biointerfaces. - : Elsevier BV. - 0927-7765 .- 1873-4367. ; 82:2, s. 632-636
-
Tidskriftsartikel (refereegranskat)abstract
- Using a simple phenomenological model of a lipid bilayer and a surface, simulations were performed to study the bilayer-induced vesicle rupture probability as a vesicle adsorbs adjacently to a bilayer patch already adsorbed on the surface. The vesicle rupture probability was studied as a function of temperature, vesicle size, and surface-bilayer interaction strength. From the simulation data, estimates of the apparent activation energy for bilayer-induced vesicle rupture were calculated, both for different vesicle sizes and for different surface-bilayer interaction strengths.
|
|
| 2. |
- Allerbo, Oskar, et al.
(författare)
-
Simulations of Lipid Vesicle Rupture Induced by an Adjacent Supported Lipid Bilayer Patch
- 2011
-
Ingår i: Colloids and Surfaces B. - : Elsevier BV. - 0927-7765 .- 1873-4367. ; 82, s. 632-636
-
Tidskriftsartikel (refereegranskat)abstract
- Using a simple phenomenological model of a lipid bilayer and a surface, simulations were performed to study the bilayer-induced vesicle rupture probability as a vesicle adsorbs adjacently to a bilayer patch already adsorbed on the surface. The vesicle rupture probability was studied as a function of temperature, vesicle size, and surface-bilayer interaction strength. From the simulation data, estimates of the apparent activation energy for bilayer-induced vesicle rupture were calculated, both for different vesicle sizes and for different surface-bilayer interaction strengths.
|
|
| 3. |
- Bobjer, Johannes, et al.
(författare)
-
Location of retroperitoneal lymph node metastases in upper tract urothelial carcinoma : results from a prospective lymph node mapping study
- 2023
-
Ingår i: European Urology Open Science. - : Elsevier. - 2666-1691 .- 2666-1683. ; 57, s. 37-44
-
Tidskriftsartikel (refereegranskat)abstract
- Background: There is limited information on the distribution of retroperitoneal lymph node metastases (LNMs) in upper tract urothelial carcinoma (UTUC).Objective: To investigate the location of LNMs in UTUC of the renal pelvis or proximal ureter and short-term complications after radical nephroureterectomy (RNU) with lymph node dissection (LND).Design, setting, and participants: This was a prospective Nordic multicenter study (four university hospitals, two county hospitals). Patients with clinically suspected locally advanced UTUC (stage >T1) and/or clinical lymph node–positive (cN+) disease were invited to participate. Participants underwent RNU and fractionated retroperitoneal LND using predefined side-specific templates.Outcome measurements and statistical analysis: The location of LNMs in the LND specimen and retroperitoneal lymph node recurrences during follow-up was recorded. Postoperative complications within 90 d of surgery were ascertained from patient charts. Descriptive statistics were used.Results and limitations: LNMs were present in the LND specimen in 23/100 patients, and nine of 100 patients experienced a retroperitoneal recurrence. Distribution per side revealed LNMs in the LND specimen in 11/38 (29%) patients with right-sided tumors, for whom the anatomically larger, right-sided template was used, in comparison to 12/62 (19%) patients with left-sided tumors, for whom a more limited template was used. High-grade complications (Clavien grade ≥3) within 90 d of surgery were registered for 13/100 patients. The study is limited in size and not powered to assess survival estimates.Conclusions: The suggested templates that we prospectively applied for right-sided and left-sided LND in patients with advanced UTUC included the majority of LNMs. High-grade complications directly related to the LND part of the surgery were limited.Patient summary: This study describes the location of lymph node metastases in patients with cancer in the upper urinary tract who underwent surgery to remove the affected kidney and ureter. The results show that most metastases occur within the template maps for lymph node surgery that we investigated, and that this surgery can be performed with few severe complications.
|
|
| 4. |
- Georgiou, C., et al.
(författare)
-
Brief announcement: Self-stabilizing snapshot objects for asynchronous failure-prone networked systems
- 2019
-
Ingår i: Proceedings of the Annual ACM Symposium on Principles of Distributed Computing. - New York, NY, USA : ACM. ; , s. 209-211
-
Konferensbidrag (refereegranskat)abstract
- A snapshot object simulates the behavior of an array of single-writer/multi-reader shared registers that can be read atomically. Delporte-Gallet et al. proposed two fault-tolerant algorithms for snapshot objects in asynchronous crash-prone message-passing systems. Their first algorithm is non-blocking; it allows snapshot operations to terminate once all write operations had ceased. It uses O(n) messages of O(n v) bits, where n is the number of nodes and v is the number of bits it takes to represent the object. Their second algorithm allows snapshot operations to always terminate independently of write operations. It incurs O(n^2) messages. The fault model of Delporte-Gallet et al. considers node failures (crashes). We aim at the design of even more robust snapshot objects. We do so through the lenses of self-stabilization - -a very strong notion of fault-tolerance. In addition to Delporte-Gallet et al.'s fault model, a self-stabilizing algorithm can recover after the occurrence of transient faults; these faults represent arbitrary violations of the assumptions according to which the system was designed to operate (as long as the code stays intact). In particular, in this work, we propose self-stabilizing variations of Delporte-Gallet et al.'s non-blocking algorithm and always-terminating algorithm. Our algorithms have similar communication costs to the ones by Delporte-Gallet et al. and O(1) recovery time (in terms of asynchronous cycles) from transient faults. The main differences are that our proposal considers repeated gossiping of O(v) bits messages and deals with bounded space, which is a prerequisite for self-stabilization.
|
|
| 5. |
- Lundström, Lina, et al.
(författare)
-
Incompleteness as a clinical characteristic and predictor of treatment outcome in obsessive-compulsive disorder
- 2024
-
Ingår i: Journal of Obsessive-Compulsive and Related Disorders. - 2211-3649. ; 42
-
Tidskriftsartikel (refereegranskat)abstract
- Incompleteness, that is, a feeling that things are “not just right”, is an understudied symptom of obsessive-compulsive disorder (OCD). We used data from 167 adult individuals with OCD who received internet-delivered cognitive behaviour therapy (ICBT) to examine how incompleteness was associated with clinical characteristics and treatment outcomes. Incompleteness was assessed using the Obsessive-Compulsive Trait Core Dimensions Questionnaire (OCTCDQ). Results showed that the proposed two-factor structure of the OCTCDQ had adequate model/data fit in the present sample. Incompleteness was positively associated with baseline symmetry/ordering symptoms (β = 0.52, [95% CI 0.48 to 0.56], p < 0.001), psychiatric comorbidity (β = 0.23, [95% CI 0.21 to 0.25], p < 0.05) and self-reported symptom severity (Y-BOCS-SR β = 0.35, [95% CI 0.27 to 0.43], p < 0.001; OCI-R β = 0.46, [95% CI 0.34 to 0.59], p < 0.001). Results showed that higher degree of incompleteness predicted a worse treatment outcome on clinician-rated, but not self-rated, measures of symptom severity. Participants with a high (vs. low) degree of incompleteness were less likely to be classified as responders (39% vs. 52%) and remitters (10% vs. 34%) at post-treatment. The results suggest that incompleteness is a clinically relevant feature of OCD, which may require treatment adaptations for some patients but more research is needed to confirm that the findings are not entirely due to measurement error.
|
|
| 6. |
- Lundström, Oskar, et al.
(författare)
-
Brief Announcement: Self-stabilizing Total-Order Broadcast
- 2022
-
Ingår i: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). - Cham : Springer International Publishing. - 1611-3349 .- 0302-9743. ; 13751 LNCS, s. 358-363
-
Konferensbidrag (refereegranskat)abstract
- Our study aims at the design of an even more reliable solution. We do so through the lenses of self-stabilization—a very strong notion of fault-tolerance. In addition to node and communication failures, self-stabilizing algorithms can recover after the occurrence of arbitrary transient faults; these faults represent any violation of the assumptions according to which the system was designed to operate (as long as the algorithm code stays intact). This work proposes the first (to the best of our knowledge) self-stabilizing algorithm for total-order (uniform reliable) broadcast for asynchronous message-passing systems prone to process failures and transient faults. As we show, the proposed solution facilitates the elegant construction of self-stabilizing state-machine replication using bounded memory.
|
|
| 7. |
- Lundström, Oskar, et al.
(författare)
-
Self-Stabilizing Indulgent Zero-degrading Binary Consensus
- 2021
-
Ingår i: ACM International Conference Proceeding Series. - New York, NY, USA : ACM. ; , s. 106-115
-
Konferensbidrag (refereegranskat)abstract
- Guerraoui proposed an indulgent solution for the binary consensus problem. Namely, he showed that an arbitrary behavior of the failure detector never violates safety requirements even if it compromises liveness. Consensus implementations are often used in a repeated manner. Dutta and Guerraoui proposed a zero-degrading solution, i.e., during system runs in which the failure detector behaves perfectly, a node failure during one consensus instance has no impact on the performance of future instances. Our study, which focuses on indulgent zero-degrading binary consensus, aims at the design of an even more robust communication abstraction. We do so through the lenses of self-stabilization - a very strong notion of fault-tolerance. In addition to node and communication failures, self-stabilizing algorithms can recover after the occurrence of arbitrary transient faults; these faults represent any violation of the assumptions according to which the system was designed to operate (as long as the algorithm code stays intact). This work proposes the first, to the best of our knowledge, self-stabilizing algorithm for indulgent zero-degrading binary consensus for time-free message-passing systems prone to detectable process failures. The proposed algorithm has an stabilization time (in terms of asynchronous cycles) from arbitrary transient faults. Since the proposed solution uses an ω failure detector, we also present the first, to the best of our knowledge, self-stabilizing asynchronous ω failure detector, which is a variation on the one by Mostéfaoui, Mourgaya, and Raynal.
|
|
| 8. |
- Lundström, Oskar, et al.
(författare)
-
Self-stabilizing indulgent zero-degrading binary consensus
- 2024
-
Ingår i: Theoretical Computer Science. - 0304-3975. ; 989
-
Tidskriftsartikel (refereegranskat)abstract
- Guerraoui proposed an indulgent solution for the binary consensus problem. Namely, he showed that an arbitrary behavior of the failure detector never violates safety requirements even if it compromises liveness. Consensus implementations are often used in a repeated manner. Dutta and Guerraoui proposed a zero-degrading solution, i.e., during system runs in which the failure detector behaves perfectly, a node failure during one consensus instance has no impact on the performance of future instances. Our study, which focuses on indulgent zero-degrading binary consensus, aims at the design of an even more robust communication abstraction. We do so through the lenses of self-stabilization—a very strong notion of fault-tolerance. In addition to node and communication failures, self-stabilizing algorithms can recover after the occurrence of arbitrary transient faults; these faults represent any violation of the assumptions according to which the system was designed to operate (as long as the algorithm code stays intact). This work proposes the first, to the best of our knowledge, self-stabilizing algorithm for indulgent zero-degrading binary consensus for time-free message-passing systems prone to detectable process failures. The proposed algorithm recovers within a finite time after the occurrence of the last arbitrary transient fault. Since the proposed solution uses an Ω failure detector, we also present the first, to the best of our knowledge, self-stabilizing asynchronous Ω failure detector, which is a variation on the one by Mostéfaoui, Mourgaya, and Raynal.
|
|
| 9. |
- Lundström, Oskar, et al.
(författare)
-
Self-stabilizing Multivalued Consensus in Asynchronous Crash-prone Systems
- 2021
-
Ingår i: Proceedings - 2021 17th European Dependable Computing Conference, EDCC 2021. ; , s. 111-118
-
Konferensbidrag (refereegranskat)abstract
- The problem of multivalued consensus is fundamental in the area of fault-tolerant distributed computing since it abstracts a very broad set of agreement problems in which processes have to uniformly decide on a specific value v\in V, where V ≥ 2. Existing solutions (that tolerate process failures) reduce the multivalued consensus problem to the one of binary consensus, e.g., Mostéfaoui-Raynal-Tronel and Zhang-Chen. Our study aims at the design of an even more reliable solution. We do so through the lenses of self-stabilization-a very strong notion of fault-tolerance. In addition to node and communication failures, self-stabilizing algorithms can recover after the occurrence of (a finite number of) arbitrary transient-faults; these faults represent any violation of the assumptions according to which the system was designed to operate (as long as the algorithm code stays intact). This work proposes the first (to the best of our knowledge) self-stabilizing algorithm for multivalued consensus for asynchronous message-passing systems prone to process failures and arbitrary transient-faults. Our solution is also the first (to the best of our knowledge) to support wait-freedom. Moreover, using piggybacking techniques, our solution can invoke n binary consensus objects concurrently. Thus, the proposed self-stabilizing wait-free solution can terminate using fewer binary consensus objects than earlier non-self-stabilizing solutions by Mostéfaoui, Raynal, and Tronel, which uses an unbounded number of binary consensus objects, or Zhang and Chen, which is not wait-free.
|
|
| 10. |
- Lundström, Oskar, et al.
(författare)
-
Self-stabilizing SET-constrained delivery broadcast
- 2020
-
Ingår i: Proceedings - International Conference on Distributed Computing Systems. ; 2020-November, s. 617-627
-
Konferensbidrag (refereegranskat)abstract
- Fault-tolerant distributed applications require communication abstractions with provable guarantees on message deliveries. For example, Set-Constrained Delivery Broadcast (SCD-broadcast) is a communication abstraction for broadcasting messages in a manner that, if a process delivers a set of messages that includes m and later delivers a set of messages that includes m, no process delivers first a set of messages that includes m and later a set of messages that includes m. Imbs et al. proposed this communication abstraction and its first implementation. They have demonstrated that SCD-broadcast has the computational power of read/write registers and allows for an easy building of distributed objects such as snapshot objects and consistent counters. Imbs et al. focused on fault-tolerant implementations for asynchronous message-passing systems that are prone to process crashes. This paper aims to design an even more robust SCD-broadcast communication abstraction, namely a self-stabilizing SCD-broadcast. In addition to process and communication failures, self-stabilizing algorithms can recover after the occurrence of arbitrary transient faults; these faults represent any violation of the assumptions according to which the system was designed to operate (as long as the algorithm code stays intact). This work proposes the first self-stabilizing SCD-broadcast algorithm for asynchronous message-passing systems that are prone to process crash failures. The proposed self-stabilizing SCD-broadcast algorithm has an O(1) stabilization time (in terms of asynchronous cycles). The communication costs of our algorithm are similar to the ones of the non-self-stabilizing state-of-the-art. The main differences are that our proposal considers repeated gossiping of O(1) bits messages and deals with bounded space (which is a prerequisite for self-stabilization). We advance the state-of-the-art also by two new self-stabilizing applications: an atomic construction of snapshot objects and sequentially consistent counters.
|
|
