3,081 research outputs found

    Improved Algorithms for Decremental Single-Source Reachability on Directed Graphs

    Full text link
    Recently we presented the first algorithm for maintaining the set of nodes reachable from a source node in a directed graph that is modified by edge deletions with o(mn)o(mn) total update time, where mm is the number of edges and nn is the number of nodes in the graph [Henzinger et al. STOC 2014]. The algorithm is a combination of several different algorithms, each for a different mm vs. nn trade-off. For the case of m=Θ(n1.5)m = \Theta(n^{1.5}) the running time is O(n2.47)O(n^{2.47}), just barely below mn=Θ(n2.5)mn = \Theta(n^{2.5}). In this paper we simplify the previous algorithm using new algorithmic ideas and achieve an improved running time of O~(min⁥(m7/6n2/3,m3/4n5/4+o(1),m2/3n4/3+o(1)+m3/7n12/7+o(1)))\tilde O(\min(m^{7/6} n^{2/3}, m^{3/4} n^{5/4 + o(1)}, m^{2/3} n^{4/3+o(1)} + m^{3/7} n^{12/7+o(1)})). This gives, e.g., O(n2.36)O(n^{2.36}) for the notorious case m=Θ(n1.5)m = \Theta(n^{1.5}). We obtain the same upper bounds for the problem of maintaining the strongly connected components of a directed graph undergoing edge deletions. Our algorithms are correct with high probabililty against an oblivious adversary.Comment: This paper was presented at the International Colloquium on Automata, Languages and Programming (ICALP) 2015. A full version combining the findings of this paper and its predecessor [Henzinger et al. STOC 2014] is available at arXiv:1504.0795

    Private Multiplicative Weights Beyond Linear Queries

    Full text link
    A wide variety of fundamental data analyses in machine learning, such as linear and logistic regression, require minimizing a convex function defined by the data. Since the data may contain sensitive information about individuals, and these analyses can leak that sensitive information, it is important to be able to solve convex minimization in a privacy-preserving way. A series of recent results show how to accurately solve a single convex minimization problem in a differentially private manner. However, the same data is often analyzed repeatedly, and little is known about solving multiple convex minimization problems with differential privacy. For simpler data analyses, such as linear queries, there are remarkable differentially private algorithms such as the private multiplicative weights mechanism (Hardt and Rothblum, FOCS 2010) that accurately answer exponentially many distinct queries. In this work, we extend these results to the case of convex minimization and show how to give accurate and differentially private solutions to *exponentially many* convex minimization problems on a sensitive dataset

    Network-wide Configuration Synthesis

    Full text link
    Computer networks are hard to manage. Given a set of high-level requirements (e.g., reachability, security), operators have to manually figure out the individual configuration of potentially hundreds of devices running complex distributed protocols so that they, collectively, compute a compatible forwarding state. Not surprisingly, operators often make mistakes which lead to downtimes. To address this problem, we present a novel synthesis approach that automatically computes correct network configurations that comply with the operator's requirements. We capture the behavior of existing routers along with the distributed protocols they run in stratified Datalog. Our key insight is to reduce the problem of finding correct input configurations to the task of synthesizing inputs for a stratified Datalog program. To solve this synthesis task, we introduce a new algorithm that synthesizes inputs for stratified Datalog programs. This algorithm is applicable beyond the domain of networks. We leverage our synthesis algorithm to construct the first network-wide configuration synthesis system, called SyNET, that support multiple interacting routing protocols (OSPF and BGP) and static routes. We show that our system is practical and can infer correct input configurations, in a reasonable amount time, for networks of realistic size (> 50 routers) that forward packets for multiple traffic classes.Comment: 24 Pages, short version published in CAV 201

    The impact of sound field systems on learning and attention in elementary school classrooms

    Get PDF
    Purpose: An evaluation of the installation and use of sound field systems (SFS) was carried out to investigate their impact on teaching and learning in elementary school classrooms. Methods: The evaluation included acoustic surveys of classrooms, questionnaire surveys of students and teachers and experimental testing of students with and without the use of SFS. Students ’ perceptions of classroom environments and objective data evaluating change in performance on cognitive and academic assessments with amplification over a six month period are reported. Results: Teachers were positive about the use of SFS in improving children’s listening and attention to verbal instructions. Over time students in amplified classrooms did not differ from those in nonamplified classrooms in their reports of listening conditions, nor did their performance differ in measures of numeracy, reading or spelling. Use of SFS in the classrooms resulted in significantly larger gains in performance in the number of correct items on the nonverbal measure of speed of processing and the measure of listening comprehension. Analysis controlling for classroom acoustics indicated that students ’ listening comprehension score

    Laboratory Determination of the Infrared Band Strengths of Pyrene Frozen in Water Ice: Implications for the Composition of Interstellar Ices

    Get PDF
    Broad infrared emission features (e.g., at 3.3, 6.2, 7.7, 8.6, and 11.3 microns) from the gas phase interstellar medium have long been attributed to polycyclic aromatic hydrocarbons (PAHs). A significant portion (10%-20%) of the Milky Way's carbon reservoir is locked in PAH molecules, which makes their characterization integral to our understanding of astrochemistry. In molecular clouds and the dense envelopes and disks of young stellar objects (YSOs), PAHs are expected to be frozen in the icy mantles of dust grains where they should reveal themselves through infrared absorption. To facilitate the search for frozen interstellar PAHs, laboratory experiments were conducted to determine the positions and strengths of the bands of pyrene mixed with H2O and D2O ices. The D2O mixtures are used to measure pyrene bands that are masked by the strong bands of H2O, leading to the first laboratory determination of the band strength for the CH stretching mode of pyrene in water ice near 3.25 microns. Our infrared band strengths were normalized to experimentally determined ultraviolet band strengths, and we find that they are generally ~50% larger than those reported by Bouwman et al. based on theoretical strengths. These improved band strengths were used to reexamine YSO spectra published by Boogert et al. to estimate the contribution of frozen PAHs to absorption in the 5-8 micron spectral region, taking into account the strength of the 3.25 micron CH stretching mode. It is found that frozen neutral PAHs contain 5%-9% of the cosmic carbon budget, and account for 2%-9% of the unidentified absorption in the 5-8 micron region.Comment: Accepted for publication in ApJ on 14 Feb 201

    Observed Variability at 1um and 4um in the Y0 Brown Dwarf WISEP J173835.52+273258.9

    Get PDF
    We have monitored photometrically the Y0 brown dwarf WISEP J173835.52+273258.9 (W1738) at both near- and mid-infrared wavelengths. This ~1 Gyr-old 400K dwarf is at a distance of 8pc and has a mass around 5 M_Jupiter. We observed W1738 using two near-infrared filters at lambda~1um, Y and J, on Gemini observatory, and two mid-infrared filters at lambda~4um, [3.6] and [4.5], on the Spitzer observatory. Twenty-four hours were spent on the source by Spitzer on each of June 30 and October 30 2013 UT. Between these observations, around 5 hours were spent on the source by Gemini on each of July 17 and August 23 2013 UT. The mid-infrared light curves show significant evolution between the two observations separated by four months. We find that a double sinusoid can be fit to the [4.5] data, where one sinusoid has a period of 6.0 +/- 0.1 hours and the other a period of 3.0 +/- 0.1 hours. The near-infrared observations suggest variability with a ~3.0 hour period, although only at a <~2 sigma confidence level. We interpret our results as showing that the Y dwarf has a 6.0 +/- 0.1 hour rotation period, with one or more large-scale surface features being the source of variability. The peak-to-peak amplitude of the light curve at [4.5] is 3%. The amplitude of the near-infrared variability, if real, may be as high as 5 to 30%. Intriguingly, this size of variability and the wavelength dependence can be reproduced by atmospheric models that include patchy KCl and Na_2S clouds and associated small changes in surface temperature. The small number of large features, and the timescale for evolution of the features, is very similar to what is seen in the atmospheres of the solar system gas giants.Comment: Accepted by ApJ July 26 2016. Twenty-six pages include 8 Figures and 5 Table

    The COPI Complex Functions in Nuclear Envelope Breakdown and Is Recruited by the Nucleoporin Nup153

    Get PDF
    AbstractNuclear envelope breakdown is a critical step in the cell cycle of higher eukaryotes. Although integral membrane proteins associated with the nuclear membrane have been observed to disperse into the endoplasmic reticulum at mitosis, the mechanisms involved in this reorganization remain to be fully elucidated. Here, using Xenopus extracts, we report a role for the COPI coatomer complex in nuclear envelope breakdown, implicating vesiculation as an important step. We have found that a nuclear pore protein, Nup153, plays a critical role in directing COPI to the nuclear membrane at mitosis and that this event provides feedback to other aspects of nuclear disassembly. These results provide insight into how key steps in nuclear division are orchestrated

    Spectral absorption of biomass burning aerosol determined from retrieved single scattering albedo during ARCTAS

    Get PDF
    Actinic flux, as well as aerosol chemical and optical properties, were measured aboard the NASA DC-8 aircraft during the ARCTAS (Arctic Research of the Composition of the Troposphere from Aircraft and Satellites) mission in Spring and Summer 2008. These measurements were used in a radiative transfer code to retrieve spectral (350-550 nm) aerosol single scattering albedo (SSA) for biomass burning plumes encountered on 17 April and 29 June. Retrieved SSA values were subsequently used to calculate the absorption Angstrom exponent (AAE) over the 350-500 nm range. Both plumes exhibited enhanced spectral absorption with AAE values that exceeded 1 (6.78 ± 0.38 for 17 April and 3.34 ± 0.11 for 29 June). This enhanced absorption was primarily due to organic aerosol (OA) which contributed significantly to total absorption at all wavelengths for both 17 April (57.7%) and 29 June (56.2%). OA contributions to absorption were greater at UV wavelengths than at visible wavelengths for both cases. Differences in AAE values between the two cases were attributed to differences in plume age and thus to differences in the ratio of OA and black carbon (BC) concentrations. However, notable differences between AAE values calculated for the OA (AAEOA) for 17 April (11.15 ± 0.59) and 29 June (4.94 ± 0.19) suggested differences in the plume AAE values might also be due to differences in organic aerosol composition. The 17 April OA was much more oxidized than the 29 June OA as denoted by a higher oxidation state value for 17 April (+0.16 vs. -0.32). Differences in the AAEOA, as well as the overall AAE, were thus also possibly due to oxidation of biomass burning primary organic aerosol in the 17 April plume that resulted in the formation of OA with a greater spectral-dependence of absorption. © Author(s) 2012. CC Attribution 3.0 License

    Precedence-constrained scheduling problems parameterized by partial order width

    Full text link
    Negatively answering a question posed by Mnich and Wiese (Math. Program. 154(1-2):533-562), we show that P2|prec,pj∈{1,2}p_j{\in}\{1,2\}|Cmax⁥C_{\max}, the problem of finding a non-preemptive minimum-makespan schedule for precedence-constrained jobs of lengths 1 and 2 on two parallel identical machines, is W[2]-hard parameterized by the width of the partial order giving the precedence constraints. To this end, we show that Shuffle Product, the problem of deciding whether a given word can be obtained by interleaving the letters of kk other given words, is W[2]-hard parameterized by kk, thus additionally answering a question posed by Rizzi and Vialette (CSR 2013). Finally, refining a geometric algorithm due to Servakh (Diskretn. Anal. Issled. Oper. 7(1):75-82), we show that the more general Resource-Constrained Project Scheduling problem is fixed-parameter tractable parameterized by the partial order width combined with the maximum allowed difference between the earliest possible and factual starting time of a job.Comment: 14 pages plus appendi
    • 

    corecore