DOCSLIB.ORG

Federated Computing Research Conference, FCRC’96, Which Is David Wise, Steering Being Held May 20 - 28, 1996 at the Philadelphia Downtown Marriott

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Federated Computing Research Conference, FCRC’96, Which Is David Wise, Steering Being Held May 20 - 28, 1996 at the Philadelphia Downtown Marriott CRA Workshop on Academic Careers Federated for Women in Computing Science 23rd Annual ACM/IEEE International Symposium on Computing Computer Architecture FCRC ‘96 ACM International Conference on Research Supercomputing ACM SIGMETRICS International Conference Conference on Measurement and Modeling of Computer Systems 28th Annual ACM Symposium on Theory of Computing 11th Annual IEEE Conference on Computational Complexity 15th Annual ACM Symposium on Principles of Distributed Computing 12th Annual ACM Symposium on Computational Geometry First ACM Workshop on Applied Computational Geometry ACM/UMIACS Workshop on Parallel Algorithms ACM SIGPLAN ‘96 Conference on Programming Language Design and Implementation ACM Workshop of Functional Languages in Introductory Computing Philadelphia Skyline SIGPLAN International Conference on Functional Programming 10th ACM Workshop on Parallel and Distributed Simulation Invited Speakers Wm. A. Wulf ACM SIGMETRICS Symposium on Burton Smith Parallel and Distributed Tools Cynthia Dwork 4th Annual ACM/IEEE Workshop on Robin Milner I/O in Parallel and Distributed Systems Randy Katz SIAM Symposium on Networks and Information Management Sponsors ACM CRA IEEE NSF May 20-28, 1996 SIAM Philadelphia, PA FCRC WELCOME Organizing Committee Mary Jane Irwin, Chair Penn State University Steve Mahaney, Vice Chair Rutgers University Alan Berenbaum, Treasurer AT&T Bell Laboratories Frank Friedman, Exhibits Temple University Sampath Kannan, Student Coordinator Univ. of Pennsylvania Welcome to the second Federated Computing Research Conference, FCRC’96, which is David Wise, Steering being held May 20 - 28, 1996 at the Philadelphia downtown Marriott. This second Indiana University FCRC follows the same model of the highly successful first conference, FCRC’93, in Janice Cuny, Careers which nine constituent conferences participated. FCRC’96 includes seventeen constit- University of Oregon uent conferences - almost twice the size of FCRC’93! The FCRC model is one that Allan Gottlieb, ISCA New York University assembles a number of existing, specialized, research conferences into a coordinated meeting held at a common time in a common place. This model retains the advantages Doug DeGroot, ICS Texas Instruments of the smaller conferences, while at the same time, facilitating communication among Daniel Reed, METRICS researchers in different subfields in computer science and engineering. We have University of Illinois arranged a number of venues for attendee interaction including common breakfasts David Johnson, STOC and coffee breaks throughout the week. And, of course, due to its size, FCRC’96 also AT&T Bell Laboratories provides great visibility for the field as a whole. Steven Homer, Complexity Boston University The technical program for each constituent conference is independently administered, Cynthia Dwork, PODC with each responsible for its own meeting’s structure, content, and proceedings. The IBM, Almaden constituent conference committees are to be commended for putting together excep- Michael Goodrich, SCG tionally strong, interlinking technical programs. To the extent facilities allow, attendees Johns Hopkins University are free to attend technical sessions of other constituent conferences being held at the Ming Lin, WACG same time as their “home” conference. Proceedings from other constituent conferences U.S. Army Research Office & Univ. of N. Carolina, Chapel Hill will be available for purchase on-site. Dinesh Manocha, WACG Univ. of N. Carolina, Chapel Hill Five mornings of FCRC’96 week will start with a plenary talk on a topic of broad appeal Uzi Vishkin, WOPA to the CS&E community. We think you will find the talks presented by our outstanding University of Maryland slate of plenary speakers both inspiring and thought-provoking. The plenaries are Charles Fischer, PLDI open to anyone registered for a constituent conference meeting that day. FCRC week University of Wisconsin also features two exciting evening excursions, one Wednesday and one Saturday Robert Harper, ICFP evening, and an informative Friday evening Panel organized by CRA. Almost all constit- Carnegie Mellon University uent conferences meeting on Wednesday or Saturday have included the excursion in Matthias Felleisen, FLIC their registration package. The CRA Panel is open to all registrants. Exhibits, consist- Rice University ing of books and educational software displays and demonstrations, will be open Mary Bailey, PADS Wednesday through Sunday of FCRC week. University of Arizona Barton Miller, SPDT University of Wisconsin You have probably noticed that FCRC week spans a U.S. holiday, Memorial Day. The David Kotz, IOPADS Organizing Committee encourages you to consider bringing your family along to Phila- Dartmouth College delphia. They can have fun (while you work!). Philadelphia boasts world famous art Sampath Kannan, NIM exhibits and museums, a lively and colorful historic district, exciting arts and enter- University of Pennsylvania tainment venues, and fantastic restaurants. Steering Committee David Wise, Chair In planning FCRC’96, the Organizing Committee is grateful for support and assistance Indiana University from the sponsoring organizations (ACM, CRA, The IEEE Computer Society, and SIAM) Mary Jane Irwin as well as the National Science Foundation. ACM, The Association for Computing, was Penn State University notably active in providing support and planning expertise. In particular, the Commit- Gwen Bell tee would like to extend a warm thanks to Debbie Hall of ACM SIG Services for her Boston Computer Museum help with budgets, schedules, printings and mailings, and for putting up with our Frank Friedman naiveté about society policies and procedures. Rod Abraham and the staff of R.E. Temple University Abraham Associates provided outstanding conference management services. Finally, David Johnson the Committee would like to thank James Haines of the Computer Science Depart- AT&T Bell Laboratories ment at Purdue University, who formatted this Advance Program with much patience, Dave Patterson professionalism, and humor. The computing resources provided by Purdue’s Com- University of California, Berkeley puter Science Department for its production are also gratefully acknowledged. Paul Young CISE, NSF 1 CONTENTS Highlights Committees......................................................................1 Invited Speakers ..............................................................3 FCRC Town Hall Meeting .................................................3 Overview Program at a Glance ............................................. 23 & 24 CRA Workshop on Academic Careers for Women in Computing Science (Careers) Sessions ..........................................................................4 23rd Annual ACM/IEEE International Symposium on Computer Architecture (ISCA) Tutorials/Sessions/Papers...............................................5 ACM International Conference on Supercomputing (ICS) Tutorial/Sessions/Papers ................................................7 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems (METRICS) Tutorials/Sessions/Papers.............................................10 28th Annual ACM Symposium on Theory of Computing (STOC) Sessions/Papers ............................................................13 11th Annual IEEE Conference on Computational Complexity (Complexity, formerly Structures) Sessions/Papers ............................................................17 15th Annual ACM Symposium on Principles of Distributed Computing (PODC) Sessions/Papers ............................................................19 12th Annual ACM Symposium on Computational Geometry (SCG) Sessions/Papers ............................................................22 First ACM Workshop on Applied Computational Geometry (WACG) Sessions/Papers ............................................................26 ACM/UMIACS Workshop on Parallel Algorithms (WOPA) Sessions/Papers ............................................................27 ACM SIGPLAN ‘96 Conference on Programming Language Design and Implementation (PLDI) Tutorials/Sessions/Papers.............................................28 ACM Workshop of Functional Languages in Introductory Computing (FLIC) Sessions ........................................................................31 SIGPLAN International Conference on Functional Programming (ICFP) Sessions/Papers ............................................................31 10th ACM Workshop on Parallel and Distributed Simulation (PADS) Tutorials/Sessions/Papers.............................................33 ACM SIGMETRICS Symposium on Parallel and Distributed Tools (SPDT) Sessions/Papers ............................................................35 4th Annual ACM/IEEE Workshop on I/O in Parallel and Distributed Systems (IOPADS) Sessions/Papers ............................................................36 SIAM Symposium on Networks and Information Management (NIM) Sessions ........................................................................37 Information & Forms Advance Conference Registration ...................................40 Multiple Conference Registration....................................40 Hotel & Area Information ...............................................38 Hotel Registration ..........................................................39 Cancellations .................................................................41 Excursions & Exhibits ...................................................42
Load more

Recommended publications
  • Interactive Proof Systems and Alternating Time-Space Complexity
    Theoretical Computer Science 113 (1993) 55-73 55 Elsevier Interactive proof systems and alternating time-space complexity Lance Fortnow” and Carsten Lund** Department of Computer Science, Unicersity of Chicago. 1100 E. 58th Street, Chicago, IL 40637, USA Abstract Fortnow, L. and C. Lund, Interactive proof systems and alternating time-space complexity, Theoretical Computer Science 113 (1993) 55-73. We show a rough equivalence between alternating time-space complexity and a public-coin interactive proof system with the verifier having a polynomial-related time-space complexity. Special cases include the following: . All of NC has interactive proofs, with a log-space polynomial-time public-coin verifier vastly improving the best previous lower bound of LOGCFL for this model (Fortnow and Sipser, 1988). All languages in P have interactive proofs with a polynomial-time public-coin verifier using o(log’ n) space. l All exponential-time languages have interactive proof systems with public-coin polynomial-space exponential-time verifiers. To achieve better bounds, we show how to reduce a k-tape alternating Turing machine to a l-tape alternating Turing machine with only a constant factor increase in time and space. 1. Introduction In 1981, Chandra et al. [4] introduced alternating Turing machines, an extension of nondeterministic computation where the Turing machine can make both existential and universal moves. In 1985, Goldwasser et al. [lo] and Babai [l] introduced interactive proof systems, an extension of nondeterministic computation consisting of two players, an infinitely powerful prover and a probabilistic polynomial-time verifier. The prover will try to convince the verifier of the validity of some statement.
    [Show full text]
  • ACM Honors Eminent Researchers for Technical Innovations That Have Improved How We Live and Work 2016 Recipients Made Contribu
    Contact: Jim Ormond 212-626-0505 [email protected] ACM Honors Eminent Researchers for Technical Innovations That Have Improved How We Live and Work 2016 Recipients Made Contributions in Areas Including Big Data Analysis, Computer Vision, and Encryption NEW YORK, NY, May 3, 2017 – ACM, the Association for Computing Machinery (www.acm.org), today announced the recipients of four prestigious technical awards. These leaders were selected by their peers for making significant contributions that have had far-reaching impact on how we live and work. The awards reflect achievements in file sharing, broadcast encryption, information visualization and computer vision. The 2016 recipients will be formally honored at the ACM Awards Banquet on June 24 in San Francisco. The 2016 Award Recipients include: • Mahadev Satyanarayanan, Michael L. Kazar, Robert N. Sidebotham, David A. Nichols, Michael J. West, John H. Howard, Alfred Z. Spector and Sherri M. Nichols, recipients of the ACM Software System Award for developing the Andrew File System (AFS). AFS was the first distributed file system designed for tens of thousands of machines, and pioneered the use of scalable, secure and ubiquitous access to shared file data. To achieve the goal of providing a common shared file system used by large networks of people, AFS introduced novel approaches to caching, security, management and administration. AFS is still in use today as both an open source system and as the file system in commercial applications. It has also inspired several cloud-based storage applications. The 2016 Software System Award recipients designed and built the Andrew File System in the 1980s while working as a team at the Information Technology Center (ITC), a partnership between Carnegie Mellon University and IBM.
    [Show full text]
  • Investigating Statistical Privacy Frameworks from the Perspective of Hypothesis Testing 234 Able Quantity
    Investigating Statistical Privacy Frameworks from the Perspective of Hypothesis Testing 234 able quantity. Only a limited number of previous works which can provide a natural and interpretable guide- [29, 34, 35] have investigated the question of how to line for selecting proper privacy parameters by system select a proper value of ǫ, but these approaches ei- designers and researchers. Furthermore, we extend our ther require complicated economic models or lack the analysis on unbounded DP to bounded DP and the ap- analysis of adversaries with arbitrary auxiliary informa- proximate (ǫ, δ)-DP. tion (see Section 2.3 for more details). Our work is in- Impact of Auxiliary Information. The conjecture spired by the interpretation of differential privacy via that auxiliary information can influence the design of hypothesis testing, initially introduced by Wasserman DP mechanisms has been made in prior work [8, 28, 32, and Zhou [27, 30, 60]. However, this interpretation has 33, 39, 65]. We therefore investigate the adversary’s ca- not been systematically investigated before in the con- pability based on hypothesis testing under three types text of our research objective, i.e., reasoning about the of auxiliary information: the prior distribution of the in- choice of the privacy parameter ǫ (see Section 2.4 for put record, the correlation across records, and the corre- more details). lation across time. Our analysis demonstrates that the We consider hypothesis testing [2, 45, 61] as the tool auxiliary information indeed influences the appropriate used by the adversary to infer sensitive information of selection of ǫ. The results suggest that, when possible an individual record (e.g., the presence or absence of and available, the practitioners of DP should explicitly a record in the database for unbounded DP) from the incorporate adversary’s auxiliary information into the outputs of privacy mechanisms.
    [Show full text]
  • Compact E-Cash and Simulatable Vrfs Revisited
    Compact E-Cash and Simulatable VRFs Revisited Mira Belenkiy1, Melissa Chase2, Markulf Kohlweiss3, and Anna Lysyanskaya4 1 Microsoft, [email protected] 2 Microsoft Research, [email protected] 3 KU Leuven, ESAT-COSIC / IBBT, [email protected] 4 Brown University, [email protected] Abstract. Efficient non-interactive zero-knowledge proofs are a powerful tool for solving many cryptographic problems. We apply the recent Groth-Sahai (GS) proof system for pairing product equations (Eurocrypt 2008) to two related cryptographic problems: compact e-cash (Eurocrypt 2005) and simulatable verifiable random functions (CRYPTO 2007). We present the first efficient compact e-cash scheme that does not rely on a ran- dom oracle. To this end we construct efficient GS proofs for signature possession, pseudo randomness and set membership. The GS proofs for pseudorandom functions give rise to a much cleaner and substantially faster construction of simulatable verifiable random functions (sVRF) under a weaker number theoretic assumption. We obtain the first efficient fully simulatable sVRF with a polynomial sized output domain (in the security parameter). 1 Introduction Since their invention [BFM88] non-interactive zero-knowledge proofs played an important role in ob- taining feasibility results for many interesting cryptographic primitives [BG90,GO92,Sah99], such as the first chosen ciphertext secure public key encryption scheme [BFM88,RS92,DDN91]. The inefficiency of these constructions often motivated independent practical instantiations that were arguably conceptually less elegant, but much more efficient ([CS98] for chosen ciphertext security). We revisit two important cryptographic results of pairing-based cryptography, compact e-cash [CHL05] and simulatable verifiable random functions [CL07], that have very elegant constructions based on non-interactive zero-knowledge proof systems, but less elegant practical instantiations.
    [Show full text]
  • Fast Distributed Algorithms for LP-Type Problems of Low Dimension
    Fast Distributed Algorithms for LP-Type Problems of Low Dimension Kristian Hinnenthal Paderborn University, Germany [email protected] Christian Scheideler Paderborn University, Germany [email protected] Martijn Struijs TU Eindhoven, The Netherlands [email protected] Abstract In this paper we present various distributed algorithms for LP-type problems in the well-known gossip model. LP-type problems include many important classes of problems such as (integer) linear programming, geometric problems like smallest enclosing ball and polytope distance, and set problems like hitting set and set cover. In the gossip model, a node can only push information to or pull information from nodes chosen uniformly at random. Protocols for the gossip model are usually very practical due to their fast convergence, their simplicity, and their stability under stress and disruptions. Our algorithms are very efficient (logarithmic rounds or better with just polylogarithmic communication work per node per round) whenever the combinatorial dimension of the given LP-type problem is constant, even if the size of the given LP-type problem is polynomially large in the number of nodes. 2012 ACM Subject Classification Theory of computation → Distributed algorithms; Theory of computation → Mathematical optimization Keywords and phrases LP-type problems, linear optimization, distributed algorithms, gossip al- gorithms Digital Object Identifier 10.4230/LIPIcs.DISC.2019.23 Funding K. Hinnenthal and C. Scheideler are supported by the DFG SFB 901 (On-The-Fly Com- puting). 1 Introduction 1.1 LP-type Problems LP-type problems were defined by Sharir and Welzl [18] as problems characterized by a tuple (H, f) where H is a finite set of constraints and f : 2H → T is a function that maps subsets from H to values in a totally ordered set (T, ≤) containing −∞.
    [Show full text]
  • Reducing Redundancy in Data Organization and Arithmetic Calculation for Stencil Computations
    Reducing Redundancy in Data Organization and Arithmetic Calculation for Stencil Computations Kun Li Liang Yuan Yunquan Zhang Institute of Computing Technology, Institute of Computing Technology, Institute of Computing Technology, Chinese Academy of Sciences Chinese Academy of Sciences Chinese Academy of Sciences University of Chinese Academy of Beijing, China Beijing, China Sciences [email protected] [email protected] Beijing, China [email protected] Yue Yue Hang Cao Pengqi Lu Institute of Computing Technology, Institute of Computing Technology, Institute of Computing Technology, Chinese Academy of Sciences Chinese Academy of Sciences Chinese Academy of Sciences University of Chinese Academy of University of Chinese Academy of University of Chinese Academy of Sciences Sciences Sciences Beijing, China Beijing, China Beijing, China [email protected] [email protected] [email protected] Abstract ACM Reference Format: Stencil computation is one of the most important kernels Kun Li, Liang Yuan, Yunquan Zhang, Yue Yue, Hang Cao, and Pengqi in various scientific and engineering applications. A variety Lu. 2021. Reducing Redundancy in Data Organization and Arith- metic Calculation for Stencil Computations. In Proceedings of ACM of work has focused on vectorization techniques, aiming at Conference (Conference’21). ACM, Seoul, South Korea, 12 pages. exploiting the in-core data parallelism. Briefly, they either https://doi.org/10.1145/nnnnnnn.nnnnnnn incur data alignment conflicts or hurt the data locality when integrated with tiling. In this paper, a novel transpose lay- out is devised to preserve the data locality for tiling in the 1 Introduction data space and reduce the data reorganization overhead for Stencil is one of the most important kernels widely used vectorization simultaneously.
    [Show full text]
  • 2008 Annual Report
    2008 Annual Report NATIONAL ACADEMY OF ENGINEERING ENGINEERING THE FUTURE 1 Letter from the President 3 In Service to the Nation 3 Mission Statement 4 Program Reports 4 Engineering Education 4 Center for the Advancement of Scholarship on Engineering Education 6 Technological Literacy 6 Public Understanding of Engineering Developing Effective Messages Media Relations Public Relations Grand Challenges for Engineering 8 Center for Engineering, Ethics, and Society 9 Diversity in the Engineering Workforce Engineer Girl! Website Engineer Your Life Project Engineering Equity Extension Service 10 Frontiers of Engineering Armstrong Endowment for Young Engineers-Gilbreth Lectures 12 Engineering and Health Care 14 Technology and Peace Building 14 Technology for a Quieter America 15 America’s Energy Future 16 Terrorism and the Electric Power-Delivery System 16 U.S.-China Cooperation on Electricity from Renewables 17 U.S.-China Symposium on Science and Technology Strategic Policy 17 Offshoring of Engineering 18 Gathering Storm Still Frames the Policy Debate 20 2008 NAE Awards Recipients 22 2008 New Members and Foreign Associates 24 2008 NAE Anniversary Members 28 2008 Private Contributions 28 Einstein Society 28 Heritage Society 29 Golden Bridge Society 29 Catalyst Society 30 Rosette Society 30 Challenge Society 30 Charter Society 31 Other Individual Donors 34 The Presidents’ Circle 34 Corporations, Foundations, and Other Organizations 35 National Academy of Engineering Fund Financial Report 37 Report of Independent Certified Public Accountants 41 Notes to Financial Statements 53 Officers 53 Councillors 54 Staff 54 NAE Publications Letter from the President Engineering is critical to meeting the fundamental challenges facing the U.S. economy in the 21st century.
    [Show full text]
  • Dear President Obama
    OPEN LETTER TO PRESIDENT OBAMA FROM U.S. ORGANIZATIONS Mr. President: It’s time to move from talk to action on nuclear disarmament. April 28, 2014 Dear President Obama, During the closing session of the Nuclear Security Summit in The Hague on March 25, 2014, you cited a number of concrete measures to secure highly-enriched uranium and plutonium and strengthen the nuclear nonproliferation regime that have been implemented as a result of the three Nuclear Security Summits, concluding: “So what’s been valuable about this summit is that it has not just been talk, it’s been action.” Would that you would apply the same standard to nuclear disarmament! On April 5, 2009 in Prague, you gave millions of people around the world new hope when you declared: “So today, I state clearly and with conviction America’s commitment to seek the peace and security of a world without nuclear weapons.” Bolstered by that hope, over the past three years, there has been a new round of nuclear disarmament initiatives by governments not possessing nuclear weapons, both within and outside the United Nations. Yet the United States has been notably “missing in action” at best, and dismissive or obstructive at worst. This conflict may come to a head at the 2015 Review of the Nuclear Nonproliferation Treaty (NPT). We write now, on the eve of the third Preparatory Committee (PrepCom) meeting for the 2015 Review Conference of the NPT, which will take place at UN headquarters in New York April 28 – May 9, 2014, to underscore our plea that your administration shed its negative attitude and participate constructively in deliberations and negotiations regarding the creation of a multilateral process to achieve a nuclear weapons free world.
    [Show full text]
  • Call for Papers RIMS Workshop on Computational Geometry and Discrete Mathematics October 16-18, 2008, Kyoto, Japan
    Call For Papers RIMS Workshop on Computational Geometry and Discrete Mathematics October 16-18, 2008, Kyoto, Japan RIMS Workshop on Computational Geometry and Workshop Organizers: Discrete Mathematics will be held at RIMS (Research Institute for Mathematical Sciences), Tetsuo Asano (JAIST, Japan) Kyoto, October 16-18, 2008. It is an event of RIMS Satoru Fujishige (Kyoto U., Japan) International Project Research 2008, Discrete Satoru Iwata (Kyoto U., Japan) Structures and Algorithms, and intended to provide a Naoki Katoh (Kyoto U., Japan) forum for researchers working in the field of Yoshio Okamoto (Tokyo Inst. Tech, Japan) computational geometry and related topics. Takeshi Tokuyama (Tohoku U., Japan, Chair) Scope: Invited Speakers: The workshop consists of invited talks and presentations on contributed papers. We call for Oswin Aichholzer (T. U. Graz, Austria) submissions of contributed papers on original Boris Aronov (Polytechnic U., USA) research on computational geometry and related Sergey Bereg (U. Texas, USA) topics. Also survey papers on recent results of the Siu Wing Cheng (HKUST, Hong Kong) authors are welcome. Otfried Cheong (KAIST, Korea) Danny Chen (U. Notre Dame, USA) Submissions: Jiri Matousek (Charles U., Czech Republic) Authors should submit short extended abstract in Kurt Mehlhorn (MPI, Germany) PDF format not exceeding 4 pages on A4 (or US Kokichi Sugihara (U. Tokyo, Japan) letter) paper, including author’s names, affiliations, Emo Welzl (ETH, Switzerland) references, and figures. One may use double-column format (we recommend the style of EuroCG). Workshop Web Page : Authors may replace the abstracts with longer ones (up to 10 pages) for the camera-ready version. http://www.dais.is.tohoku.ac.jp/~rimscg08 The submissions should be sent via email to [email protected] Symposium Site: together with your contact information.
    [Show full text]
  • 2007-2008, $40,000
    The Department of 2007-08 Annual Report 1 Cover image provided by Professor Xavier Tricoche. His visualization research investigates turbulent fl ows in aerodynamics applications using a state-of-the-art advancing front algorithm that produces smooth, high-quality stream surfaces for even the most complex fl ow features. His method uses a highly accurate integration scheme to properly handle high curvature and strong spatial variation of the vector fi eld. (Reprinted from AIAA Paper 2004-2153 by permission of the American Institute of Aeronautics and Astronautics, Inc.) 2 Students discuss career opportunities with corporate partners during the annual CS Career Fair. TABLE of CONTENTS William Gorman congratulates graduating students at the annual reception held in their honor. 2 Year in Review 4 Departmental Research Areas 24 Research Funding 36 Courtesy and Emeritus Faculty 37 Education CS honored outstanding alumni Mr. Eric Meyer, Dr. Chonchanok (Nok) 40 Visiting Faculty and Research Staff Viravan, and Ms. Anne Schowe. 41 Engagement 47 Diversity 48 Guest Speakers 50 Staff 51 Facilities SmartAn Inc. placed fi rst in the Gold Division of the 21st Annual Burton D. 52 Events Morgan Entrepreneurial Competition. Corporate partner representatives announce scholarships and awards at 1 the annual CS Awards Banquet. Year in Review Greetings from faculty, staff , and students of the Department of Computer Science! Th e 2007-08 year was one of change and growth—and that for the better. Th e fi rst change you might notice is in the format of this annual report. Th e report moves away from an alphabetic listing of faculty and now focuses on faculty by research areas.
    [Show full text]
  • The Bravo Test and the Death and Life of the Global Ecosystem in the Early Anthropocene
    Volume 13 | Issue 29 | Number 1 | Article ID 4343 | Jul 20, 2015 The Asia-Pacific Journal | Japan Focus The Bravo Test and the Death and Life of the Global Ecosystem in the Early Anthropocene Robert Jacobs Introduction contaminating fish, birds, animals and plants far from nuclear test sites. As many of these On March 1st 1954 the United States tested its radionuclides remain dangerous for hundreds first deliverable hydrogen bomb at Bikini Atoll of thousands of years, the dangers inherent in in the Marshall Islands. The weapon yielded a thermonuclear detonations would produce force three times as large as its designers had legacies still not well understood. planned or anticipated.1 The radioactive fallout cloud that resulted from the weapon would kill As radiation from Bravo the test spread around a fisherman located 100 km away, cause illness the Pacific Ocean, contaminating fish that in hundreds and perhaps thousands of people would be caught thousands of miles away, across hundreds of miles, and contaminate human conceptions of warfare and of nature entire atolls with high levels of radiation also began to mutate and change. displacing residents most of whom have never been able to return to their homes. Slowly it U.S. strategic nuclear planners quickly would become evident that, while this weapon recognized the radiological fallout as a had been tested in the Marshall Islands, its powerful tool of war, separate from the power detonation was a global event. of blast and heat that were fundamental to nuclear war fighting strategies. Over time both People around the world were shocked by the the United States and the former Soviet Union devastation wrought by the American nuclear would integrate the capacity of this weapon to attacks on Hiroshima and Nagasaki near the poison vast swaths of the Earth with lethal end of World War Two.
    [Show full text]
  • SIGOPS Annual Report 2012
    SIGOPS Annual Report 2012 Fiscal Year July 2012-June 2013 Submitted by Jeanna Matthews, SIGOPS Chair Overview SIGOPS is a vibrant community of people with interests in “operatinG systems” in the broadest sense, includinG topics such as distributed computing, storaGe systems, security, concurrency, middleware, mobility, virtualization, networkinG, cloud computinG, datacenter software, and Internet services. We sponsor a number of top conferences, provide travel Grants to students, present yearly awards, disseminate information to members electronically, and collaborate with other SIGs on important programs for computing professionals. Officers It was the second year for officers: Jeanna Matthews (Clarkson University) as Chair, GeorGe Candea (EPFL) as Vice Chair, Dilma da Silva (Qualcomm) as Treasurer and Muli Ben-Yehuda (Technion) as Information Director. As has been typical, elected officers agreed to continue for a second and final two- year term beginning July 2013. Shan Lu (University of Wisconsin) will replace Muli Ben-Yehuda as Information Director as of AuGust 2013. Awards We have an excitinG new award to announce – the SIGOPS Dennis M. Ritchie Doctoral Dissertation Award. SIGOPS has lonG been lackinG a doctoral dissertation award, such as those offered by SIGCOMM, Eurosys, SIGPLAN, and SIGMOD. This new award fills this Gap and also honors the contributions to computer science that Dennis Ritchie made durinG his life. With this award, ACM SIGOPS will encouraGe the creativity that Ritchie embodied and provide a reminder of Ritchie's leGacy and what a difference a person can make in the field of software systems research. The award is funded by AT&T Research and Alcatel-Lucent Bell Labs, companies that both have a strong connection to AT&T Bell Laboratories where Dennis Ritchie did his seminal work.
    [Show full text]