546 research outputs found

    Welfare and Homelessness in Indianapolis: Populations at Risk and Barriers to Self-Sufficiency, Indianapolis

    Get PDF
    Who are the homeless in Indianapolis? How has welfare reform affected Indianapolis families who rely on public support? What barriers are preventing these populations from becoming self-sufficient? Two recent studies help answer these questions for policymakers and service providers. This issue brief summarizes the studies’ demographic findings, and the problems that erect barriers to self-sufficiency among the poor in Indianapolis

    From Low-Distortion Norm Embeddings to Explicit Uncertainty Relations and Efficient Information Locking

    Full text link
    The existence of quantum uncertainty relations is the essential reason that some classically impossible cryptographic primitives become possible when quantum communication is allowed. One direct operational manifestation of these uncertainty relations is a purely quantum effect referred to as information locking. A locking scheme can be viewed as a cryptographic protocol in which a uniformly random n-bit message is encoded in a quantum system using a classical key of size much smaller than n. Without the key, no measurement of this quantum state can extract more than a negligible amount of information about the message, in which case the message is said to be "locked". Furthermore, knowing the key, it is possible to recover, that is "unlock", the message. In this paper, we make the following contributions by exploiting a connection between uncertainty relations and low-distortion embeddings of L2 into L1. We introduce the notion of metric uncertainty relations and connect it to low-distortion embeddings of L2 into L1. A metric uncertainty relation also implies an entropic uncertainty relation. We prove that random bases satisfy uncertainty relations with a stronger definition and better parameters than previously known. Our proof is also considerably simpler than earlier proofs. We apply this result to show the existence of locking schemes with key size independent of the message length. We give efficient constructions of metric uncertainty relations. The bases defining these metric uncertainty relations are computable by quantum circuits of almost linear size. This leads to the first explicit construction of a strong information locking scheme. Moreover, we present a locking scheme that is close to being implementable with current technology. We apply our metric uncertainty relations to exhibit communication protocols that perform quantum equality testing.Comment: 60 pages, 5 figures. v4: published versio

    Development of the (d,n) proton-transfer reaction in inverse kinematics for structure studies

    Get PDF
    Transfer reactions have provided exciting opportunities to study the structure of exotic nuclei and are often used to inform studies relating to nucleosynthesis and applications. In order to benefit from these reactions and their application to rare ion beams (RIBs) it is necessary to develop the tools and techniques to perform and analyze the data from reactions performed in inverse kinematics, that is with targets of light nuclei and heavier beams. We are continuing to expand the transfer reaction toolbox in preparation for the next generation of facilities, such as the Facility for Rare Ion Beams (FRIB), which is scheduled for completion in 2022. An important step in this process is to perform the (d,n) reaction in inverse kinematics, with analyses that include Q-value spectra and differential cross sections. In this way, proton-transfer reactions can be placed on the same level as the more commonly used neutron-transfer reactions, such as (d,p), (9Be,8Be), and (13C,12C). Here we present an overview of the techniques used in (d,p) and (d,n), and some recent data from (d,n) reactions in inverse kinematics using stable beams of 12C and 16O.Comment: 9 pages, 4 figures, presented at the XXXV Mazurian Lakes Conference on Physics, Piaski, Polan

    Drawing Trees with Perfect Angular Resolution and Polynomial Area

    Full text link
    We study methods for drawing trees with perfect angular resolution, i.e., with angles at each node v equal to 2{\pi}/d(v). We show: 1. Any unordered tree has a crossing-free straight-line drawing with perfect angular resolution and polynomial area. 2. There are ordered trees that require exponential area for any crossing-free straight-line drawing having perfect angular resolution. 3. Any ordered tree has a crossing-free Lombardi-style drawing (where each edge is represented by a circular arc) with perfect angular resolution and polynomial area. Thus, our results explore what is achievable with straight-line drawings and what more is achievable with Lombardi-style drawings, with respect to drawings of trees with perfect angular resolution.Comment: 30 pages, 17 figure

    Active bacterial core surveillance of the emerging infections program network.

    Get PDF
    Active Bacterial Core surveillance (ABCs) is a collaboration between the Centers for Disease Control and Prevention and several state health departments and universities participating in the Emerging Infections Program Network. ABCs conducts population-based active surveillance, collects isolates, and performs studies of invasive disease caused by Streptococcus pneumoniae, group A and group B Streptococcus, Neisseria meningitidis, and Haemophilus influenzae for a population of 17 to 30 million. These pathogens caused an estimated 97,000 invasive cases, resulting in 10,000 deaths in the United States in 1998. Incidence rates of these pathogens are described. During 1998, 25% of invasive pneumococcal infections in ABCs areas were not susceptible to penicillin, and 13.3% were not susceptible to three classes of antibiotics. In 1998, early-onset group B streptococcal disease had declined by 65% over the previous 6 years. More information on ABCs is available at www.cdc.gov/ncidod/dbmd/abcs. ABCs specimens will soon be available to researchers through an archive

    Nonlinear spectral calculus and super-expanders

    Get PDF
    Nonlinear spectral gaps with respect to uniformly convex normed spaces are shown to satisfy a spectral calculus inequality that establishes their decay along Cesaro averages. Nonlinear spectral gaps of graphs are also shown to behave sub-multiplicatively under zigzag products. These results yield a combinatorial construction of super-expanders, i.e., a sequence of 3-regular graphs that does not admit a coarse embedding into any uniformly convex normed space.Comment: Typos fixed based on referee comments. Some of the results of this paper were announced in arXiv:0910.2041. The corresponding parts of arXiv:0910.2041 are subsumed by the current pape

    Development of intuitive rules: Evaluating the application of the dual-system framework to understanding children's intuitive reasoning

    Get PDF
    This is an author-created version of this article. The original source of publication is Psychon Bull Rev. 2006 Dec;13(6):935-53 The final publication is available at www.springerlink.com Published version: http://dx.doi.org/10.3758/BF0321390
    • 

    corecore