Results 31 to 40 of about 701,199 (295)

Almost Universally Optimal Distributed Laplacian Solvers via Low-Congestion Shortcuts

open access: yes, 2022
In this paper, we refine the (almost) existentially optimal distributed Laplacian solver recently developed by Forster, Goranci, Liu, Peng, Sun, and Ye (FOCS `21) into an (almost) universally optimal distributed Laplacian solver.
Themis Gouleakis (17434506)   +4 more
core   +2 more sources

Almost sure exponential stabilisation of stochastic systems by state-feedback control

open access: yes, 2008
So far, a major part of the literature on the stabilisation issues of stochastic systems has been dedicated to mean square stability. This paper develops a new class of criteria for designing a controller to stabilise a stochastic system almost surely ...
Hu, L.   +3 more
core   +1 more source

Almost Universally Optimal Distributed Laplacian Solvers via Low-Congestion Shortcuts

open access: yes, 2023
 In this paper, we refine the (almost) existentially optimal distributed Laplacian solver of Forster, Goranci, Liu, Peng, Sun, and Ye (FOCS ‘21) into an (almost) universally optimal distributed Laplacian solver.
Themis Gouleakis (17434506)   +4 more
core   +1 more source

Emapalumab for Immune Effector Cell‐Associated Hemophagocytic Lymphohistiocytosis‐Like Syndrome Following CD19‐Directed CAR‐T in Two Patients With B‐ALL: Clinical and Biomarker Correlates

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT Immune effector cell‐associated hemophagocytic lymphohistiocytosis‐like syndrome (IEC‐HS) is a life‐threatening hyperinflammatory toxicity distinct from cytokine release syndrome (CRS) and neurotoxicity following chimeric antigen receptor T‐cell (CAR‐T) therapy. In a single‐institution retrospective cohort of pediatric and young adult patients
Thomas J. Galletta   +6 more
wiley   +1 more source

Continuous approximations of capacities on metric compacta

open access: yesKarpatsʹkì Matematičnì Publìkacìï, 2016
A method of "almost optimal" continuous approximation of capacities on a metric compactum with possibility measures, necessity measures, or with capacities on a closed subspace, is presented.
I.D. Hlushak, O.R. Nykyforchyn
doaj   +1 more source

Principle of Optimal Voltage Regulation and Energy-Saving for Induction Motor With Unknown Constant-Torque Working Condition

open access: yesIEEE Access, 2020
To achieve optimal voltage regulation and energy savings of an AC induction motor operating under constant-torque and variable-working-load conditions, and consider a motor's T-type and Γ-type equivalent circuit, the copper and iron losses of the ...
Zhong Bin, Ma Lili, Dong Hao
doaj   +1 more source

The Role of Hematopoietic Cell Transplantation in Ataxia‐Telangiectasia

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT Background Ataxia‐telangiectasia (A‐T) is a DNA repair disorder characterized by neurodegeneration, immunodeficiency, and cancer predisposition. Hematopoietic cell transplantation (HCT) is an established therapy in related disorders such as Fanconi anemia (FA) and Nijmegen breakage syndrome (NBS), but its role in A‐T is unclear.
Laila Alkhouli   +3 more
wiley   +1 more source

Almost linear decoder for optimal geometrically local quantum codes

open access: yesPhysical Review Research
Geometrically local quantum codes, which are error-correction codes embedded in R^{D} with checks acting only on qubits within a fixed spatial distance, have garnered significant interest.
Quinten Eggerickx   +4 more
doaj   +1 more source

Almost optimal adaptive LQ control: SISO case [PDF]

open access: yes, 2002
In this paper an almost optimal indirect adaptive controller for input/output dynamical systems is proposed. The control part of the adaptive control scheme is based on a modified LQ control law: by adding a time-varying gain to the certainty equivalent ...
Daams, Jasper, Polderman, Jan Willem
core   +1 more source

Almost Optimal Cover-Free Families [PDF]

open access: yes, 2017
Roughly speaking, an $(n,(r,s))$-Cover Free Family (CFF) is a small set of $n$-bit strings such that: "in any $d:=r+s$ indices we see all patterns of weight $r$". CFFs have been of interest for a long time both in discrete mathematics as part of block design theory, and in theoretical computer science where they have found a variety of applications ...
Nader H. Bshouty, Ariel Gabizon
openaire   +2 more sources

Home - About - Disclaimer - Privacy