1,065 research outputs found
Better Sparsifiers for Directed Eulerian Graphs
No full textSpectral sparsification for directed Eulerian graphs is a key component in the design of fast algorithms for solving directed Laplacian linear systems. Directed Laplacian linear system solvers are crucial algorithmic primitives to fast computation of fundamental problems on random walks, such as computing stationary distributions, hitting and commute times, and personalized PageRank vectors. While spectral sparsification is well understood for undirected graphs and it is known that for every graph G, (1+ε)-sparsifiers with O(nε^{-2}) edges exist [Batson-Spielman-Srivastava, STOC '09] (which is optimal), the best known constructions of Eulerian sparsifiers require Ω(nε^{-2}log⁴ n) edges and are based on short-cycle decompositions [Chu et al., FOCS '18].
In this paper, we give improved constructions of Eulerian sparsifiers, specifically:
1) We show that for every directed Eulerian graph G→, there exists an Eulerian sparsifier with O(nε^{-2} log² n log²log n + nε^{-4/3}log^{8/3} n) edges. This result is based on combining short-cycle decompositions [Chu-Gao-Peng-Sachdeva-Sawlani-Wang, FOCS '18, SICOMP] and [Parter-Yogev, ICALP '19], with recent progress on the matrix Spencer conjecture [Bansal-Meka-Jiang, STOC '23].
2) We give an improved analysis of the constructions based on short-cycle decompositions, giving an m^{1+δ}-time algorithm for any constant δ > 0 for constructing Eulerian sparsifiers with O(nε^{-2}log³ n) edges
Biologic Treatment Outcomes in Refractory Eosinophilic Fasciitis: A Systematic Review of Published Reports
No full textEosinophilic fasciitis (EF) is a rare disorder characterized by soft tissue edema, skin erythema and induration, which may progress to fascial fibrosis, and predominantly affects the arms, legs and trunk. While oral corticosteroids are first line therapy, biologic therapies have been reported in refractory EF. This systematic review summarizes treatment outcomes of biologic therapies for EF
Development of Dermatomyositis in Patients on Biologic Therapy: A Systematic Review
No full textThe supplemental files provide information on the cases detailing the development of dermatomyositis in patients on biologic therapy
Biologic Treatment in Pediatric Stevens-Johnson Syndrome/Toxic Epidermal Necrolysis: A Systematic Review
No full textEMBASE and MEDLINE searches for e-published and in-print studies were conducted on June 16, 2020 using PRISMA guidelines with predetermined keywords (Supplemental File-1). Supplemental File 2 shows the raw data collected from each included study
Deep sequential modeling for recommendation
No full textWe propose a model which extends variational autoencoders by exploiting the rich information present in the past preference history. We introduce a recurrent version of the VAE, where instead of passing a subset of the whole history regardless of temporal dependencies, we rather pass the consumption sequence subset through a recurrent neural network. At each time-step of the RNN, the sequence is fed through a series of fully-connected layers, the output of which models the probability distribution of the most likely future preferences. We show that handling temporal information is crucial for improving the accuracy of recommendation
Nanosheets of Nonlayered Aluminum Metal-Organic Frameworks through a Surfactant-Assisted Method
No full textB.S. gratefully acknowledges the Netherlands National Science Foundation (NWO) for her personal VENI grant. J.G. gratefully acknowledges the ERC Grant Agreement no. 335746, CrystEng-MOF-MMM. The authors also thank Mr. Duco Bosma and Mr. Bart Boshuizen from TU Delft for technical and LABVIEW support and Dr. Dimitri Soccol and Prof. Dirk J. Gravesteijn for providing us with the transducer platforms. I.K.V. acknowledges the Netherlands Organisation for Scientific Research (NWO ECHO-STIP Grant 717.013.005, NWOVIDI Grant 723.014.006) and the Dutch Ministry of Education, Culture and Science (Gravity Program 024.001.035) for financial support.Pustovarenko, A., Goesten, M.G., Sachdeva, S., Shan, M., Amghouz, Z., Belmabkhout, Y., Dikhtiarenko, A., Rodenas, T., Keskin, D., Voets, I.K., Weckhuysen, B.M., Eddaoudi, M., de Smet, L.C.P.M., Sudhölter, E.J.R., Kapteijn, F., Seoane, B., Gascon, J
sj-pdf-1-nro-10.1177_10738584221145570 – Supplemental material for Mapping the Iceberg of Autonomic Recovery: Mechanistic Underpinnings of Neuromodulation following Spinal Cord Injury
No full textSupplemental material, sj-pdf-1-nro-10.1177_10738584221145570 for Mapping the Iceberg of Autonomic Recovery: Mechanistic Underpinnings of Neuromodulation following Spinal Cord Injury by Soshi Samejima, Claire Shackleton, Tiev Miller, Chet T. Moritz, Thomas M. Kessler, Klaus Krogh, Rahul Sachdeva and Andrei V. Krassioukov in The Neuroscientist</p
online supplementary file 1 - Supplemental material for The Rate of Infections With Janus Kinase Inhibitor Treatment for Atopic Dermatitis: A Systematic Review and Meta-Analysis
No full textSupplemental material, online supplementary file 1, for The Rate of Infections With Janus Kinase Inhibitor Treatment for Atopic Dermatitis: A Systematic Review and Meta-Analysis by Nawar Tarafdar, Muskaan Sachdeva, Natnaiel M. Dubale, Ciaran Smythe, Yuliya Lytvyn, Khalad Maliyar, Jorge R. Georgakopoulos, Asfandyar Mufti and Jensen Yeung in Journal of Cutaneous Medicine and Surgery</p
LIPIcs
No full textOblivious routing is a well-studied paradigm that uses static precomputed routing tables for selecting routing paths within a network. Existing oblivious routing schemes with polylogarithmic competitive ratio for general networks are tree-based, in the sense that routing is performed according to a convex combination of trees. However, this restriction to trees leads to a construction that has time quadratic in the size of the network and does not parallelize well.
In this paper we study oblivious routing schemes based on electrical routing. In particular, we show that general networks with n vertices and m edges admit a routing scheme that has competitive ratio O(log² n) and consists of a convex combination of only O(√m) electrical routings. This immediately leads to an improved construction algorithm with time Õ(m^{3/2}) that can also be implemented in parallel with Õ(√m) depth
- …
