3,857 research outputs found
Electron-phonon coupling in semimetals in a high magnetic field
We consider the effect of electron-phonon coupling in semimetals in high
magnetic fields, with regard to elastic modes that can lead to a redistribution
of carriers between pockets. We show that in a clean three dimensional system,
at each Landau level crossing, this leads to a discontinuity in the
magnetostriction, and a divergent contribution to the elastic modulus. We
estimate the magnitude of this effect in the group V semimetal Bismuth.Comment: 2 figure
Dose escalation of desmoteplase for acute ischemic stroke (DEDAS): evidence of safety and efficacy 3 to 9 hours after stroke onset
<p><b>Background and Purpose:</b> Desmoteplase is a novel plasminogen activator with favorable features in vitro compared with available agents. This study evaluated safety and efficacy of intravenous (IV) desmoteplase in patients with perfusion/diffusion mismatch on MRI 3 to 9 hours after onset of acute ischemic stroke.</p>
<p><b>Methods:</b> DEDAS was a placebo-controlled, double-blind, randomized, dose-escalation study investigating doses of 90 μg/kg and 125 μg/kg desmoteplase. Eligibility criteria included baseline National Institute of Health Stroke Scale (NIHSS) scores of 4 to 20 and MRI evidence of perfusion/diffusion mismatch. The safety end point was the rate of symptomatic intracranial hemorrhage. Primary efficacy co-end points were MRI reperfusion 4 to 8 hours after treatment and good clinical outcome at 90 days. The primary analyses were intent-to-treat. Before unblinding, a target population, excluding patients violating specific MRI criteria, was defined.</p>
<p><b>Results:</b> Thirty-seven patients were randomized and received treatment (intent-to-treat; placebo: n=8; 90 μg/kg: n=14; 125 μg/kg: n=15). No symptomatic intracranial hemorrhage occurred. Reperfusion was achieved in 37.5% (95% CI [8.5; 75.5]) of placebo patients, 18.2% (2.3; 51.8) of patients treated with 90 μg/kg desmoteplase, and 53.3% (26.6; 78.7) of patients treated with 125 μg/kg desmoteplase. Good clinical outcome at 90 days occurred in 25.0% (3.2; 65.1) treated with placebo, 28.6% (8.4; 58.1) treated with 90 μg/kg desmoteplase and 60.0% (32.3; 83.7) treated with 125 μg/kg desmoteplase. In the target population (n=25), the difference compared with placebo increased and was statistically significant for good clinical outcome with 125 μg/kg desmoteplase (P=0.022).</p>
<p><b>Conclusions:</b> Treatment with IV desmoteplase 3 to 9 hours after ischemic stroke onset appears safe. At a dose of 125 μg/kg desmoteplase appeared to improve clinical outcome, especially in patients fulfilling all MRI criteria. The results of DEDAS generally support the results of its predecessor study, Desmoteplase in Acute Ischemic Stroke (DIAS).</p>
Reversal of spin polarization in Fe/GaAs (001) driven by resonant surface states: First-principles calculations
A minority-spin resonant state at the Fe/GaAs(001) interface is predicted to
reverse the spin polarization with voltage bias of electrons transmitted across
this interface. Using a Green's function approach within the local spin density
approximation we calculate spin-dependent current in a Fe/GaAs/Cu tunnel
junction as a function of applied bias voltage. We find a change in sign of the
spin polarization of tunneling electrons with bias voltage due to the interface
minority-spin resonance. This result explains recent experimental data on spin
injection in Fe/GaAs contacts and on tunneling magnetoresistance in Fe/GaAs/Fe
magnetic tunnel junctions
Throughput Maximization in Multiprocessor Speed-Scaling
We are given a set of jobs that have to be executed on a set of
speed-scalable machines that can vary their speeds dynamically using the energy
model introduced in [Yao et al., FOCS'95]. Every job is characterized by
its release date , its deadline , its processing volume if
is executed on machine and its weight . We are also given a budget
of energy and our objective is to maximize the weighted throughput, i.e.
the total weight of jobs that are completed between their respective release
dates and deadlines. We propose a polynomial-time approximation algorithm where
the preemption of the jobs is allowed but not their migration. Our algorithm
uses a primal-dual approach on a linearized version of a convex program with
linear constraints. Furthermore, we present two optimal algorithms for the
non-preemptive case where the number of machines is bounded by a fixed
constant. More specifically, we consider: {\em (a)} the case of identical
processing volumes, i.e. for every and , for which we
present a polynomial-time algorithm for the unweighted version, which becomes a
pseudopolynomial-time algorithm for the weighted throughput version, and {\em
(b)} the case of agreeable instances, i.e. for which if and only
if , for which we present a pseudopolynomial-time algorithm. Both
algorithms are based on a discretization of the problem and the use of dynamic
programming
- …