4,574 research outputs found

    Joseph Coles, Kelly M. Smith, and Joseph E. Lowery, April 1981

    No full text
    From left to right: Bishop Joseph Coles, Dr. Kelly M. Smith, and Dr. Joseph E. Lowery lead a communion service to close a "National Gathering of Black Clergy" meeting in Atlanta, Georgia. More information about the meeting can be found on pages 50-53 of the June-July 1981 SCLC Magazine: http://hdl.handle.net/20.500.12322/auc.199:07018.The Atlanta University Center Robert W. Woodruff Library acknowledges the generous support of the Joseph & Evelyn Lowery Institute for Justice and Human Rights, the Joseph Echols Lowery Irrevocable Trust, and other donors in supporting the processing and digitization of Morehouse College's Joseph Echols and Evelyn Gibson Lowery Collection

    Joseph E. Lowery and Kelly M. Smith, April 1981

    No full text
    Reverend Joseph E. Lowery talking with Dr. Kelly M. Smith at a "National Gathering of Black Clergy" meeting in Atlanta, Georgia. More information about the meeting can be found on pages 50-53 of the June-July 1981 SCLC Magazine: http://hdl.handle.net/20.500.12322/auc.199:07018.The Atlanta University Center Robert W. Woodruff Library acknowledges the generous support of the Joseph & Evelyn Lowery Institute for Justice and Human Rights, the Joseph Echols Lowery Irrevocable Trust, and other donors in supporting the processing and digitization of Morehouse College's Joseph Echols and Evelyn Gibson Lowery Collection

    Supporting disabled children and their families in Scotland: A review of policy and research

    No full text
    The Joseph Rowntree Foundation has been supporting research about disabled children and their families for a number of years. An earlier Foundations covering the messages from these projects has already been published (1). This Foundations places the messages from that work into the Scottish context. It gives an overview of current policies affecting disabled children and their families in Scotland and draws on research carried out north of the border

    Quantum message-passing algorithm for optimal and efficient decoding

    Get PDF
    Recently, Renes proposed a quantum algorithm called belief propagation with quantum messages (BPQM) for decoding classical data encoded using a binary linear code with tree Tanner graph that is transmitted over a pure-state CQ channel [Renes, NJP 19 072001 (2017)]. The algorithm presents a genuine quantum counterpart to decoding based on the classical belief propagation algorithm, which has found wide success in classical coding theory when used in conjunction with LDPC or Turbo codes. More recently Rengaswamy et al. [npj Quantum Information 7 97 (2021)] observed that BPQM implements the optimal decoder on a small example code. Here we significantly expand the understanding, formalism, and applicability of the BPQM algorithm with the following contributions. First, we prove analytically that BPQM realizes optimal decoding for any binary linear code with tree Tanner graph. We also provide the first formal description of the BPQM algorithm in full detail and without any ambiguity. In so doing, we identify a key flaw overlooked in the original algorithm and subsequent works which implies quantum circuit realizations will be exponentially large in the code dimension. Although BPQM passes quantum messages, other information required by the algorithm is processed globally. We remedy this problem by formulating a truly message-passing algorithm which approximates BPQM and has quantum circuit complexity O(poly n,polylog 1ϵ)\mathcal{O}(\text{poly } n, \text{polylog } \frac{1}{\epsilon}), where nn is the code length and ϵ\epsilon is the approximation error. Finally, we also propose a novel method for extending BPQM to factor graphs containing cycles by making use of approximate cloning. We show some promising numerical results that indicate that BPQM on factor graphs with cycles can significantly outperform the best possible classical decoder.Comment: 56 pages, 22 figures, submitted to Quantu

    In Memoriam of Hon. Joseph M. McLaughlin

    Get PDF
        It is with great respect and appreciation that we dedicate this issue of the Fordham Law Review to the Honorable Joseph M. McLaughlin:  judge, dean, professor, author, and mentor

    In Memoriam: Joseph M. Williams

    Get PDF
    Professor Chris Rideout pays tribute to Joseph M. Williams, 1933-2008, Professor Emeritus, University of Chicago and author of Style: Ten Lessons in Clarity and Grace, among other highly influential works. Professor Rideout shows his appreciation for Williams\u27 generous support and many contributions to the world of writing instruction, especially legal writing

    La Festo Vierginenco d’Arles. Un discours en provençal de M. Joseph d’Arbaud.

    No full text
    Transcript of LA FESTO VIERGINENCO D'ARLES. UN DISCOURS EN PROVENÇAL DE M. JOSEPH D'ARBAUD by anonymous author, appearing in QUOTIDIEN DU MIDI, 17 juillet 1914, p. 1

    The Beat of the Economic Heart: Joseph Schumpeter and Arthur Spiethoff on Business Cycles

    Get PDF
    The paper discusses the relationship between Arthur Spiethoff and Joseph A. Schumpeter, the men and their works. Had it not been for Spiethoff Schumpeter would in all probability have forever been lost to scientific work. It was Spiethoff who brought the Austrian back to academia and research after a sequence of serious mishaps in politics and banking. Spiethoff's contribution to an analysis of business cycles is then summarized and important similarities and some differences between it and Schumpeter's are pointed out. The view of Spiethoff and Schumpeter that cycles are endogenous and cannot possibly be eliminated without at the same time eliminating the dynamism of the capitalist economy is then couterposed with views of some of their contemporaries and particularly modern mainstream macroeconomics that this is not so.Schumpeter; Spiethoff; business cycles; innovations; creative destruction

    Review: Joseph Urban: Unlocking an Art Deco Bedroom

    Get PDF
    Review of Joseph Urban: Unlocking an Art Deco Bedroom by Amy Miller Dehan. Cincinnati Art Museum in association with D Giles Limited, February 2022. 128 p. ill. ISBN 978-1-911282-56-3 (h/c), $49.95. Reviewed July 2022 by Sara Mautino, Librarian, Oklahoma State University School of Architecture - Cunningham Architecture Library, Oklahoma State University Libraries, [email protected]

    Polar codes for private and quantum communication over arbitrary channels

    Get PDF
    We construct new polar coding schemes for the transmission of quantum or private classical information over arbitrary quantum channels. In the former case, our coding scheme achieves the symmetric coherent information, and in the latter, the symmetric private information. Both schemes are built from a polar coding construction capable of transmitting classical information over a quantum channel. Appropriately merging two such classical-quantum schemes, one for transmitting amplitude information and the other for transmitting phase, leads to the new private and quantum coding schemes, similar to the construction for Pauli and erasure channels of Renes et al. The encoding is entirely similar to the classical case, and thus efficient. The decoding can also be performed by successive cancellation, as in the classical case, but no efficient successive cancellation scheme is yet known for arbitrary quantum channels. An efficient code construction is unfortunately still unknown. Generally, our two coding schemes require entanglement or secret-key assistance, respectively, but we extend two known conditions under which the needed assistance rate vanishes. Finally, although our results are formulated for qubit channels, we show how the scheme can be extended to multiple qubits. This then demonstrates a near-explicit coding method for realizing one of the most striking phenomena in quantum information theory: the superactivation effect, whereby two quantum channels, which individually have zero quantum capacity can have a nonzero quantum capacity when used together. © 1963-2012 IEEE
    corecore