Linköping University

About: Linköping University is a education organization based out in Linköping, Sweden. It is known for research contribution in the topics: Population & Health care. The organization has 15671 authors who have published 50013 publications receiving 1542189 citations.

Low-Molecular-Weight Heparin (Fragmin) During Instability in Coronary Artery Disease (FRISC)

Abstract: This study evaluated whether the low-molecular-weight (LMW) heparin dalteparin sodium (Fragmin) had protective effects against cardiac events in aspirin-treated patients with unstable coronary artery syndromes. Patients (n = 1,506) with unstable angina or non-Q-wave myocardial infarction were randomized to double-blind, placebo-controlled treatment with LMW heparin. The treatment was given as subcutaneous injections: 120 U/kg body weight/12 hours during the first 5-7 days and 7,500 U once daily during the following 35-45 days. The primary endpoint, death or myocardial infarction after 6 days, showed a 3% (4.7%-1.7%) absolute and a 65% relative reduction in the LMW heparin group. There was a 6.8% (15.5%-8.7%) absolute and a 47% relative reduction of urgent revascularization or need for heparin or nitroglycerin infusions in combination with the primary endpoint. After 40 days there was an absolute reduction of death or myocardial infarction of 2.8% (10.7%-7.9%) and its combination with incapacitating angina was reduced by 5.9% (30.7%-24.8%). The survival analysis indicated a reactivation of the instability soon after lowering the dose at 5-7 days. With long-term follow-up, 3-4 months after termination of LMW heparin, the differences between groups were no longer statistically significant. However, the cumulative reduction in death, myocardial infarction, and revascularization because of incapacitating angina of 5.1% (25.3%-20.4%) was maintained. No cerebral and few major bleeds occurred. Compliance was adequate. Thus, subcutaneous LMW heparin protects against cardiac events in the acute phase of unstable coronary artery disease. The subcutaneous regimen also allows prolongation of treatment in the outpatient setting, which might maintain the initial benefits over a longer period.

The Thylakoid FtsH Protease Plays a Role in the Light-Induced Turnover of the Photosystem II D1 Protein

Abstract: The photosystem II reaction center D1 protein is known to turn over frequently. This protein is prone to irreversible damage caused by reactive oxygen species that are formed in the light; the damaged, nonfunctional D1 protein is degraded and replaced by a new copy. However, the proteases responsible for D1 protein degradation remain unknown. In this study, we investigate the possible role of the FtsH protease, an ATP-dependent zinc metalloprotease, during this process. The primary light-induced cleavage product of the D1 protein, a 23-kD fragment, was found to be degraded in isolated thylakoids in the dark during a process dependent on ATP hydrolysis and divalent metal ions, suggesting the involvement of FtsH. Purified FtsH degraded the 23-kD D1 fragment present in isolated photosystem II core complexes, as well as that in thylakoid membranes depleted of endogenous FtsH. In this study, we definitively identify the chloroplast protease acting on the D1 protein during its light-induced turnover. Unlike previously identified membrane-bound substrates for FtsH in bacteria and mitochondria, the 23-kD D1 fragment represents a novel class of FtsH substrate— functionally assembled proteins that have undergone irreversible photooxidative damage and cleavage.

Per-Antenna Constant Envelope Precoding for Large Multi-User MIMO Systems

Abstract: We consider the multi-user MIMO broadcast channel with M single-antenna users and N transmit antennas under the constraint that each antenna emits signals having constant envelope (CE). The motivation for this is that CE signals facilitate the use of power-efficient RF power amplifiers. Analytical and numerical results show that, under certain mild conditions on the channel gains, for a fixed M, an array gain is achievable even under the stringent per-antenna CE constraint. Essentially, for a fixed M, at sufficiently large N the total transmitted power can be reduced with increasing N while maintaining a fixed information rate to each user. Simulations for the i.i.d. Rayleigh fading channel show that the total transmit power can be reduced linearly with increasing N (i.e., an O(N) array gain). We also propose a precoding scheme which finds near-optimal CE signals to be transmitted, and has O(MN) complexity. Also, in terms of the total transmit power required to achieve a fixed desired information sum-rate, despite the stringent per-antenna CE constraint, the proposed CE precoding scheme performs close to the sum-capacity achieving scheme for an average-only total transmit power constrained channel.

Admissible heuristics for optimal planning

Abstract: HSP and HSPr are two recent planners that search the state-space using an heuristic function extracted from Strips encodings. HSP does a forward search from the initial state recomputing the heuristic in every state, while HSPr does a regression search from the goal computing a suitable representation of the heuristic only once. Both planners have shown good performance, often producing solutions that are competitive in time and number of actions with the solutions found by Graphplan and SAT planners. HSP and HSPr. however, are not optimal planners. This is because the heuristic function is not admissible and the search algorithms are not optimal. In this paper we address this problem. We formulate a new admissible heuristic for planning, use it to guide an IDA* search, and empirically evaluate the resulting optimal planner over a number of domains. The main contribution is the idea underlying the heuristic that yields not one but a whole family of polynomial and admissible heuristics that trade accuracy for efficiency. The formulation is general and sheds some light on the heuristics used in HSP and Graphplan, and their relation. It exploits the factored (Strips) representation of planning problems, mapping shortest-path problems in state-space into suitably defined shortest-path problems in atom-space. The formulation applies with little variation to sequential and parallel planning, and problems with different action costs.