Sökresultat

BACKGROUND: The transradial approach is associated with fewer bleeding complications during percutaneous coronary interventions (PCIs) but is more technically challenging and associated with prolonged times during intervention. The aim of this study is to retrospectively compare the results of radial vs. femoral approach in patients >or=80 years old undergoing primary or rescue PCI.METHODS: Betwee

The paper considers the solution of the boundary value problem (BVP) consisting of the Helmholtz equation in the region D with a rigid boundary condition on ∂D and its reformulation as a boundary integral equation (BIE), over an infinite cylindrical surface of arbitrary smooth cross-section. A boundary integral equation, which models three-dimensional acoustic scattering from an infinite rigid cyl

We investigate robustness properties of the Generalized Proportional Allocation (GPA) policy that has been recently proposed for traffic signal control in urban networks. The GPA policy is fully decentralized, relies only on local information on the current congestion state, and requires no knowledge of the routing, the exogenous inflows, or the network structure. In previous work, we proved throu

We study a robust control problem for dynamical flow networks. In the considered framework, traffic flows along the links of a transportation network —modeled as a capacited multigraph— and queues up at the nodes, whereby control policies determine which incoming queues are to be allocated service simultaneously, within some predetermined scheduling constraints. We first prov

We defne a weak compatibility condition for the Newest Vertex Bisection algorithm on simplex grids of any dimension and show that, using this condition, the iterative refnement algorithm terminates successfully. Additionally we provide an O(n) algorithm that renumbers any simplex grid to fulfll this condition. Furthermore we conduct experiments to estimate the distance to the standard compatibilit

In this paper, we perform a belief propagation (BP) decoding threshold analysis of spatially coupled (SC) turbo-like codes (TCs) (SC-TCs) on the additive white Gaussian noise (AWGN) channel. We review Monte-Carlo density evolution (MC-DE) and efficient prediction methods, which determine the BP thresholds of SC-TCs over the AWGN channel. We demonstrate that instead of performing time-consuming MC-

A disease risk index (DRI) that was developed for adults with hematologic malignancy who were undergoing hematopoietic cell transplantation is also being used to stratify children and adolescents by disease risk. Therefore, to develop and validate a DRI that can be used to stratify those with AML and ALL by their disease risk, we analyzed 2569 patients aged <18 years with acute myeloid (AML; n = 1

This paper reviews historical developments and recent challenges in full scale bridge testing and introduces results- and hypotheses related to an ongoing bridge testing research project. This research project encompasses full scale bridge testing in conjunction with bearing capacity analysis as well as related contact- and non-contact monitoring procedures combined with a decision analytical appr

Background: There is increasing interest in nonmorbid treatments for low- and intermediate-risk prostate cancer with fewer side effects than surgery or radiotherapy. Objective: To investigate the tolerability, safety, and antitumor effects of the intraprostatic NanoZolid depot formulation Liproca Depot (LIDDS AB, Uppsala, Sweden) with antiandrogen 2-hydroxyflutamide (2-HOF) in men with low- or int

This thesis investigates ‘the doing’ of the Swedish social insurance program Activity Compensation (AC). AC is an example of disability policies in Western welfare states. These policies have two goals: to ensure financial security and to promote social participation. In 2003 AC replaced Early Retirement Pension for persons aged 19 to 29 years and who, for medical reasons, have reduced work capaci

The problem of finding maximum (or minimum) witnesses of the Boolean product of two Boolean matrices (MW for short) has a number of important applications, in particular the all-pairs lowest common ancestor (LCA) problem in directed acyclic graphs (dags). The best known upper time-bound on the MW problem for n× n Boolean matrices of the form O(n2.575) has not been substantially improved since 2006