The Next Digital Decade Essays on the Future of the Internet
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
The Senate of York University Notice of the 604Th Meeting of Senate To
The Senate of York University Notice of the 604th Meeting of Senate to be held at 3:00 pm. on Thursday, May 22, 2014 in the Senate Chamber, N940 Ross Building. AGENDA Page 1. Chair's Remarks (R. Mykitiuk) 2. Minutes of the Meeting of April 24, 2014 .................................................................................... i 3. Business Arising from the Minutes 4. Inquiries and Communications 4.1 Senators on the Board of Governors re: Board Meeting of April 28 (A. Belcastro / M. Lockshin – Synopsis attached) .................................................................................................................. 1 5. President’s Items (M. Shoukri) 6. Committee Reports 6.1 Executive (A. Asif) ............................................................................................................ 3 6.1.1 Nominees for Election to Senate Committees 6.2 Academic Standards, Curriculum and Pedagogy (L. Sanders) .............................................. 5 6.3 Academic Policy, Planning and Research (Acting Chair) ................................................... 38 6.3 Awards (D. Leyton Brown) ................................................................................................ 127 Note: APPRC items include a report on academic planning discussions with the Deans, Principal and University Librarian concluded in April. 7. Other Business Harriet Lewis, Secretary Consent Agenda 6.2.1 Addition of a Full-Time Option for the Tax Law Specialization within the Professional LLM Program , Graduate Studies 6.2.2 Changes to Admission and Program Requirements for the MSc and PhD Programs in Chemistry, Graduate Studies 6.2.3 Addition of a New Test to Satisfy Language Proficiency Admission Requirements, Glendon 6.2.4 Change to the Requirements of the JD Program, Osgoode Hall Law School 6.2.5 Changes to Requirements for the PhD Program in Social & Political Thought, Faculty of Graduate Studies The Senate of York University Minutes of the meeting held at 3:00 pm on Thursday, April 24, 2014 in the Senate Chamber, N940 Ross Building. -
APPLICATION for GRANTS UNDER the Centers for International Business Education
U.S. Department of Education Washington, D.C. 20202-5335 APPLICATION FOR GRANTS UNDER THE Centers for International Business Education CFDA # 84.220A PR/Award # P220A180013 Gramts.gov Tracking#: GRANT12650309 OMB No. , Expiration Date: Closing Date: Jun 13, 2018 PR/Award # P220A180013 **Table of Contents** Form Page 1. Application for Federal Assistance SF-424 e3 Attachment - 1 (Areas Affected by Project_1) e6 2. Standard Budget Sheet (ED 524) e7 3. Assurances Non-Construction Programs (SF 424B) e9 4. Disclosure Of Lobbying Activities (SF-LLL) e11 5. ED GEPA427 Form e12 Attachment - 1 (Certification Forms) e13 6. Grants.gov Lobbying Form e18 7. Dept of Education Supplemental Information for SF-424 e19 8. ED Abstract Narrative Form e20 Attachment - 1 (ED Abstract Narrative) e21 9. Project Narrative Form e22 Attachment - 1 (Project Narrative Attachment) e23 10. Other Narrative Form e80 Attachment - 1 (Other Narrative Attachment) e81 11. Budget Narrative Form e180 Attachment - 1 (Budget Narrative Attachment) e181 This application was generated using the PDF functionality. The PDF functionality automatically numbers the pages in this application. Some pages/sections of this application may contain 2 sets of page numbers, one set created by the applicant and the other set created by e-Application's PDF functionality. Page numbers created by the e-Application PDF functionality will be preceded by the letter e (for example, e1, e2, e3, etc.). Page e2 OMB Number: 4040-0004 Expiration Date: 12/31/2019 Application for Federal Assistance SF-424 * 1. Type of Submission: * 2. Type of Application: * If Revision, select appropriate letter(s): Preapplication New Application Continuation * Other (Specify): Changed/Corrected Application Revision * 3. -
The Flajolet-Martin Sketch Itself Preserves Differential Privacy: Private Counting with Minimal Space
The Flajolet-Martin Sketch Itself Preserves Differential Privacy: Private Counting with Minimal Space Adam Smith Shuang Song Abhradeep Thakurta Boston University Google Research, Brain Team Google Research, Brain Team [email protected] [email protected] [email protected] Abstract We revisit the problem of counting the number of distinct elements F0(D) in a data stream D, over a domain [u]. We propose an ("; δ)-differentially private algorithm that approximates F0(D) within a factor of (1 ± γ), and with additive error of p O( ln(1/δ)="), using space O(ln(ln(u)/γ)/γ2). We improve on the prior work at least quadratically and up to exponentially, in terms of both space and additive p error. Our additive error guarantee is optimal up to a factor of O( ln(1/δ)), n ln(u) 1 o and the space bound is optimal up to a factor of O min ln γ ; γ2 . We assume the existence of an ideal uniform random hash function, and ignore the space required to store it. We later relax this requirement by assuming pseudo- random functions and appealing to a computational variant of differential privacy, SIM-CDP. Our algorithm is built on top of the celebrated Flajolet-Martin (FM) sketch. We show that FM-sketch is differentially private as is, as long as there are p ≈ ln(1/δ)=(εγ) distinct elements in the data set. Along the way, we prove a structural result showing that the maximum of k i.i.d. random variables is statisti- cally close (in the sense of "-differential privacy) to the maximum of (k + 1) i.i.d. -
1986 ACL Membership List
1986 ACL MEMBERSHIPLIST Following is a listing of the 1986 Raja Noor Ainon Art Altman Peter Anick members of the Association for 230 Persiaran Zaaba Computer Science Digital Equipment Corporation Computational Linguistics as of the Taman Tun Dr. Ismalil Hylan Hall 77 Reed Road, HL02-3/E9 end of the year. The 1949 personal 60000 Kuala Lurnpur University of Rochester Hudson, MA 01749 members are listed first, ordered MALAYSIA Rochester, NY 14627 Evan Antworth alphabetically by last name. The 419 Teruaki Aizawa Rosemary Altoft Summer Inst. of Linguistics institutional members follow, begin- ATR International Academic Press Box 2270 ning with those from the United Twin 21 MID Tower 24-28 Oval Road Manila 2801, PHILIPPINES States, ordered by ZIP-code, and 2-1-61 Shiromi, Higashi-ku London NW1 7DX, ENGLAND Paul K, Aoki then the rest ordered alphabetically Osaka 540 JAPAN Sergio J. Alvarado 2305 Broadway East by country, province (for Canada), J. C. Akbari 16820 Chatsworth St. No.102 Seattle, WA 98102 city, and then institutional name. 380 Riverside Drive, No.7D Granada Hills, CA 91344 Wanted: Addresses for the Chinatsu Aone New York, NY 10025 members whose names appear Shin-ya Amano 3115 Torn Green, No.405 below. Information should be Glenn Akers Information Systems Lab. Austin, TX 78705 forwarded to the ACL Secretary- 211 Washington Street Toshiba R&D Center Lisette Appelo Treasurer. Belmont, MA 02178 1, Komukai-Toshiba-cho Philips Research Laboratories Saiwai-ku, Kawasaki 210 JAPAN PO Box 80000, WB3 Anannya Rhattacharjee Dorothea G. Akhand Kurt Ammon NL-5600 JA Eindhoven Luanne Burns 1696 Lynn Court Fibigerstr 163 NETHERLANDS Clinton Fein Merrick, NY 11566 D-2000 Hamburg 12 Heidi Johnson Yuiko Sasaki Alam Alena Appelova WEST GERMANY Brett Kessler 2504 Burly Oak Drive Slovenska technic, kniznica Randall Sharp Austin, TX 78745 Leland R. -
Hardness of Non-Interactive Differential Privacy from One-Way
Hardness of Non-Interactive Differential Privacy from One-Way Functions Lucas Kowalczyk* Tal Malkin† Jonathan Ullman‡ Daniel Wichs§ May 30, 2018 Abstract A central challenge in differential privacy is to design computationally efficient non-interactive algorithms that can answer large numbers of statistical queries on a sensitive dataset. That is, we would like to design a differentially private algorithm that takes a dataset D Xn consisting of 2 some small number of elements n from some large data universe X, and efficiently outputs a summary that allows a user to efficiently obtain an answer to any query in some large family Q. Ignoring computational constraints, this problem can be solved even when X and Q are exponentially large and n is just a small polynomial; however, all algorithms with remotely similar guarantees run in exponential time. There have been several results showing that, under the strong assumption of indistinguishability obfuscation (iO), no efficient differentially private algorithm exists when X and Q can be exponentially large. However, there are no strong separations between information-theoretic and computationally efficient differentially private algorithms under any standard complexity assumption. In this work we show that, if one-way functions exist, there is no general purpose differen- tially private algorithm that works when X and Q are exponentially large, and n is an arbitrary polynomial. In fact, we show that this result holds even if X is just subexponentially large (assuming only polynomially-hard one-way functions). This result solves an open problem posed by Vadhan in his recent survey [Vad16]. *Columbia University Department of Computer Science. -
Communication Complexity (For Algorithm Designers)
Full text available at: http://dx.doi.org/10.1561/0400000076 Communication Complexity (for Algorithm Designers) Tim Roughgarden Stanford University, USA [email protected] Boston — Delft Full text available at: http://dx.doi.org/10.1561/0400000076 Foundations and Trends R in Theoretical Computer Science Published, sold and distributed by: now Publishers Inc. PO Box 1024 Hanover, MA 02339 United States Tel. +1-781-985-4510 www.nowpublishers.com [email protected] Outside North America: now Publishers Inc. PO Box 179 2600 AD Delft The Netherlands Tel. +31-6-51115274 The preferred citation for this publication is T. Roughgarden. Communication Complexity (for Algorithm Designers). Foundations and Trends R in Theoretical Computer Science, vol. 11, nos. 3-4, pp. 217–404, 2015. R This Foundations and Trends issue was typeset in LATEX using a class file designed by Neal Parikh. Printed on acid-free paper. ISBN: 978-1-68083-115-3 c 2016 T. Roughgarden All rights reserved. No part of this publication may be reproduced, stored in a retrieval system, or transmitted in any form or by any means, mechanical, photocopying, recording or otherwise, without prior written permission of the publishers. Photocopying. In the USA: This journal is registered at the Copyright Clearance Cen- ter, Inc., 222 Rosewood Drive, Danvers, MA 01923. Authorization to photocopy items for internal or personal use, or the internal or personal use of specific clients, is granted by now Publishers Inc for users registered with the Copyright Clearance Center (CCC). The ‘services’ for users can be found on the internet at: www.copyright.com For those organizations that have been granted a photocopy license, a separate system of payment has been arranged. -
An Axiomatic Approach to Block Rewards
An Axiomatic Approach to Block Rewards Xi Chen Christos Papadimitriou Tim Roughgarden [email protected] [email protected] [email protected] Columbia University Columbia University Columbia University New York, NY 10027 New York, NY 10027 New York, NY 10027 ABSTRACT of view and the methodology of Economic Theory, the science of Proof-of-work blockchains reward each miner for one completed incentives. block by an amount that is, in expectation, proportional to the Flaws in the incentives of a blockchain protocol can manifest number of hashes the miner contributed to the mining of the block. themselves at multiple timescales. For longest-chain proof-of-work Is this proportional allocation rule optimal? And in what sense? And blockchains like Bitcoin, the most well-studied incentive-based what other rules are possible? In particular, what are the desirable attacks, such as selfish mining [4, 5, 10] and transaction sniping [3], properties that any łgoodž allocation rule should satisfy? To answer concern miners reasoning strategically over multiple block creation these questions, we embark on an axiomatic theory of incentives in epochs. For example, in selfish mining, a miner relinquishes revenue proof-of-work blockchains at the time scale of a single block. We in the short term to achieve greater revenue (in expectation) in the consider desirable properties of allocation rules including: symme- long run via a type of forking attack. try; budget balance (weak or strong); sybil-proofness; and various This paper studies incentive issues and potential deviations from grades of collusion-proofness. We show that Bitcoin’s proportional intended miner behavior at the most basic time scale, that of a allocation rule is the unique allocation rule satisfying a certain single block creation epoch. -
Trump, Biden Fight It out to The
P2JW308000-6-A00100-17FFFF5178F ****** TUESDAY,NOVEMBER 3, 2020 ~VOL. CCLXXVI NO.106 WSJ.com HHHH $4.00 DJIA 26925.05 À 423.45 1.6% NASDAQ 10957.61 À 0.4% STOXX 600 347.86 À 1.6% 10-YR. TREAS. À 3/32 , yield 0.848% OIL $36.81 À $1.02 GOLD $1,890.40 À $13.00 EURO $1.1641 YEN 104.75 What’s AP News PEREZ/ MICHAEL P; Business&Finance /A /PTR arket turbulence has DUNLAP Mdisrupted adriveby nonbank mortgagefirms to SHANE P; raise capital through public /A listings, with two major lend- ersrecently delaying IPOs. A1 HARNIK TwitterCEO Dorsey’s job appearssafeafter aboard ANDREW committeerecommended P; /A that the current management AR structureremain in place. B1 PUSK J. Chinese regulators met GENE with Jack Ma and topAnt : Group executives,days before LEFT the company’sstock is set P to begin trading publicly. B1 TO OM Walmart has ended its FR effort to use roving robots WISE in store aisles to keep OCK track of its inventory. B1 CL In Pennsylvania on Monday, President Trump spoke at a rally at the Wilkes-Barre/Scranton airport; Joe Biden attended a rally in Monaca; Vice President Factories across the Mike Pence, along with his wife, Karen, and daughter Charlotte were in Latrobe; and vice-presidential candidate Sen. Kamala Harris was in Pittston. globe bounced back strongly in October, as manufactur- ers hired more people and ramped up production. A2 Trump,Biden FightItOut to theEnd U.S. stocks rose, with the Dow, S&P 500 and against abackdrop of concerns states were steeling themselves Trump spent the closing days of astate,Ohio,that shifteddeci- Nasdaq gaining 1.6%, 1.2% Election officials steel over the vote-counting process foradrawn-out vote-counting the campaign questioning ex- sively behind Mr.Trump and and 0.4%, respectively. -
The Virtual Sphere 2.0: the Internet, the Public Sphere, and Beyond 230 Zizi Papacharissi
Routledge Handbook of Internet Politics Edited by Andrew Chadwick and Philip N. Howard t&f proofs First published 2009 by Routledge 2 Park Square, Milton Park, Abingdon, Oxon OX14 4RN Simultaneously published in the USA and Canada by Routledge 270 Madison Avenue, New York, NY 10016 Routledge is an imprint of the Taylor & Francis Group, an Informa business © 2009 Editorial selection and matter, Andrew Chadwick and Philip N. Howard; individual chapters the contributors Typeset in Times New Roman by Taylor & Francis Books Printed and bound in Great Britain by MPG Books Ltd, Bodmin All rights reserved. No part of this book may be reprinted or reproduced or utilized in any form or by any electronic, mechanical, or other means, now known or hereafter invented, including photocopying and recording, or in any information storage or retrieval system, without permission in writing from the publishers. British Library Cataloguing in Publication Data A catalogue record for this book is available from the British Library Library of Congress Cataloging in Publication Data Routledge handbook of Internet politicst&f / edited proofs by Andrew Chadwick and Philip N. Howard. p. cm. Includes bibliographical references and index. 1. Internet – Political aspects. 2. Political participation – computer network resources. 3. Communication in politics – computer network resources. I. Chadwick, Andrew. II. Howard, Philip N. III. Title: Handbook of Internet Politics. IV. Title: Internet Politics. HM851.R6795 2008 320.0285'4678 – dc22 2008003045 ISBN 978-0-415-42914-6 (hbk) ISBN 978-0-203-96254-1 (ebk) Contents List of figures ix List of tables x List of contributors xii Acknowledgments xvi 1 Introduction: new directions in internet politics research 1 Andrew Chadwick and Philip N. -
Budget Process Review Project
YORK UNIVERSITY BUDGET PROCESS REVIEW PROJECT FINAL REPORT Prepared by Office of the Vice-President Finance and Administration March 2007 York University Budget Process Review Final Report March 2007 York University Budget Process Review Project Report Table of Contents 1.0 Foreword.…………………………………………………………………………………... 3 2.0 Executive Summary……………………………………………………………………….. 4 3.0 Acknowledgements…………………………………………………………………………7 4.0 Overview…………………………………………………………………………………… 9 4.1 Context…………..………………………………………………………………………. 9 4.1.1 Higher Education Context………………………………………………………….. 9 4.1.2 York Context………………………………………………………………………..10 4.2 Initiating the Budget Process Review Project………………………………………….. 12 4.3 Budget Review Team………………………………………………………………….. .13 4.4 Principles………………………………………..…………………………………… …13 4.5 Objectives of the Review……………………………………………………………….. 14 4.6 Structure of Review…………………………………………………………………….. 15 5.0 Key Findings - Phase One: Self-Study …………………………………………………..19 5.1 Part A: Internal Consultations……………………………………………..……………. 19 5.2 Part B: Internal Data Analysis ……………………..…………………………………… 22 6.0 Key Findings - Phase Two: External Information Gathering and Analysis ………….32 6.1 External Institutions ……………………………………………………………………. 32 6.2 Literature Research ……………..………………………………………………………. 34 7.0 Conclusions……………………………………………………………………………….. 39 8.0 Recommendations: Phase Three………………………………………………………....42 9.0 Implementation: Phase Four …………………………………………………………….45 10.0 Appendices……………………………………………………………………………….. 47 Appendix A: Provincial Operating Grant per -
Defending an Open, Global, Secure, and Resilient Internet
Spine Should Adjust depending on page count Defending an Open,Defending Global, Secure, and Resilient Internet The Council on Foreign Relations sponsors Independent Task Forces to assess issues of current and critical importance to U.S. foreign policy and provide policymakers with concrete judgments and recommendations. Diverse in backgrounds and perspectives, Task Force members aim to reach a meaningful consensus on policy through private and nonpartisan deliberations. Once launched, Task Forces are independent of CFR and solely responsible for the content of their reports. Task Force members are asked to join a consensus signifying that they endorse “the general policy thrust and judgments reached by the group, though not necessarily every finding and recommendation.” Each Task Force member also has the option of putting forward an additional or a dissenting view. Members’ affiliations are listed for identification purposes only and do not imply institutional endorsement. Task Force observers participate in discussions, but are not asked to join the consensus. Task Force Members Elana Berkowitz Craig James Mundie McKinsey & Company, Inc. Microsoft Corporation Bob Boorstin John D. Negroponte Google, Inc. McLarty Associates Jeff A. Brueggeman Joseph S. Nye Jr. AT&T Harvard University Peter Matthews Cleveland Samuel J. Palmisano Intel Corporation IBM Corporation Esther Dyson Neal A. Pollard EDventure Holdings, Inc. PricewaterhouseCoopers LLP Martha Finnemore Elliot J. Schrage George Washington University Facebook Patrick Gorman Adam Segal Bank of America Council on Foreign Relations Independent Task Force Report No. 70 Michael V. Hayden Anne-Marie Slaughter Chertoff Group Princeton University Eugene J. Huang James B. Steinberg John D. Negroponte and Samuel J. -
A Long-Lasting Antitumor Vaccine Into Converting a B Cell Lymphoma
4-1BBL Cooperates with B7-1 and B7-2 in Converting a B Cell Lymphoma Cell Line into a Long-Lasting Antitumor Vaccine1 Barbara-ann Guinn,* Mark A. DeBenedette,* Tania H. Watts,* and Neil L. Berinstein2*†‡§¶ A20 is a B cell lymphoma that constitutively expresses the costimulatory molecule B7-2 yet grows readily as a tumor in syngeneic BALB/c mice. We have compared the tumorigenicity of A20 variants expressing either B7-1 (A20/B7-1) or B7-2 (A20/B7-2) with an A20 variant expressing B7-1 and B7-2 with 4-1BBL (A20/4-1BBL), a costimulatory member of the TNF family. Mice injected with tumors expressing the vector backbone (A20/CMV) or B7-1 developed tumors within 25 days of s.c. injection. In contrast, mice injected with A20/4-1BBL were tumor free for the 150-day follow-up period, while 25% of mice injected with A20/B7-2 developed tumors. Tumorigenicity experiments using nude mice indicated the requirement for T cells for variant rejection. Almost all mice that resisted the initial tumor challenge were resistant to further challenge with the parental tumor. Splenocytes from these mice showed high CTL lytic activity against the parental tumor, A20, as well as the syngeneic BALB/c lymphoma K46J, but showed background levels of lytic activity against the congenic SCID thymoma line ST-D2 or the allogeneic EL4 thymoma. In vitro blocking experiments with anti-B7-1 plus anti-B7-2 and/or soluble 4-1BB receptor showed B7-1, B7-2, and 4-1BBL all contributed to the CTL activity.