Journal/ Conference	Pub Date	Title	Author(s)	Author Affiliation	Copyright Assertion	DOI	Author categories	Textual Evidence	Work of Gov't Disclaimer	Other Disclaimers	Preparers Comments
ACM Journal on Emerging Technologies in Computing Systems (JETC): Volume 8 Issue 4,	Oct-12	Implementing the data center energy productivity metric	1) Landon H. Sego, Andrés Márquez, Kevin Fox, William I. Gustafson, Jr., Christopher J. Mundy; 2) Andrew Rawson; 3)Tahir Cader	1) Pacific Northwest National Laboratory, Richland, WA; 2) Advanced Micro Devices, Inc.; 3) Hewlett-Packard Company	© 2012 Association for Computing Machinery. © 2012 ACM 1550-4832/2012/10-ART30 $15.00	10.1145/2367736.2367741	National Lab	1) Pacific Northwest National Laboratory, Richland, WA;	No	This work was supported in part by the U.S. department of Energy under DE-Award numbers 47128, 55430, and SC0005365. ACM acknowledges that this contribution was authored or coauthored by a contractor or affiliate of the U.S. Government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies show this notice on the first page or initial screen of a display along with the full citation. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works requires prior specific permission and/or a fee. Permissions may be requested from Publications Dept., ACM, Inc., 2 Penn Plaza, Suite 701, New York, NY 10121-0701 USA, fax +1 (212) 869-0481, or permissions@acm.org.
SC '15: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis	Nov-15	Practical scalable consensus for pseudo-synchronous distributed systems	1) Thomas Herault, Aurelien Bouteiller, George Bosilca, Jack Dongarra; 2) Marc Gamell, Manish Parashar; 3) Keita Teranishi	1) University of Tennessee; 2) Rutgers University; 3) Sandia National Laboratories	© 2015 ACM. ISBN 978-1-4503-3723-6/15/11. . . $15.00	10.1145/2807591.2807665	National Lab	3) Sandia National Laboratories	No	ACM acknowledges that this contribution was authored or co-authored by an employee, or contractor of the national government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only. Permission to make digital or hard copies for personal or classroom use is granted. Copies must bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. To copy otherwise, distribute, republish, or post, requires prior specific permission and/or a fee. Request permissions from permissions@acm.org.
WSC '97: Proceedings of the 29th conference on Winter simulation	Dec-97	Why we don't know how to simulate the Internet	1) Vern Paxson, Sally Floyd	1) Network Research Group, Lawrence Berkeley National Laboratory, University of California, Berkeley	N/A	10.1145/268437.268737	National Lab	1) Network Research Group, Lawrence Berkeley National Laboratory, University of California, Berkeley	No	This work was supported by the Director, Office of Energy Research, Scientific Computing Staff, of the U.S. Department of Energy under Contract No. DEAC03-76SF00098.
Communications of the ACM - Special issue on simulation modeling and statistical computing: Volume 24 Issue 4, April 1981	Apr-81	Regression-adjusted estimates for regenerative simulations, with graphics	1) P. Heidelberger; 2) P. A. W. Lewis	1) IBM Thomas J. Watson Research Center, Yorktown Heights, NY; 2) Naval Postgraduate School, Monterey, CA	© 1981 ACM 0001-0782/81/0400-0260 $00.75.	10.1145/358598.358641	Employee	2) Naval Postgraduate School, Monterey, CA	No	Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Association for Computing Machinery. To copy otherwise, or to republish, requires a fee and/or specific permission
WebSci '16: Proceedings of the 8th ACM Conference on Web Science	May-16	Teens are from mars, adults are from venus: analyzing and predicting age groups with behavioral characteristics in instagram	1) Kyungsik Han; 2) Sanghack Lee, Jin Yea Jang, Yong Jung, Dongwon Lee	1) Pacific Northwest National Laboratory; 2) The Pennsylvania State University	© 2016 ACM. ISBN 978-1-4503-4208-7/16/05…$15.00	10.1145/2908131.2908160	National Lab	1) Pacific Northwest National Laboratory	No	© 2016 Association for Computing Machinery. ACM acknowledges that this contribution was authored or co-authored by an employee, contractor or affiliate of the United States government. As such, the United States Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only.
ACM Transactions on Mathematical Software (TOMS): Volume 20 Issue 2	Jun-94	Implementing complex elementary functions using exception handling	1) T. E. Hull, Thomas F. Fairgrieve; 2) Ping-Tak Peter Tang	1) Univ. of Toronto, Toronto, Ont., Canada; 2) Argonne National Lab, Argonne, IL	©1994 ACM 0098-3500/94/0600-0215 $03.50	10.1145/178365.178404	National Lab	2) Argonne National Lab, Argonne, IL	No	This work was supported by the Natural Sciences and Engineering Research Council of Canada; by the Information Technology Research Centre of Ontario; by the Applied Mathematical Sciences subprogram of the Office of Energy Research, U.S. Department of Energy, under Contract W-31 -109-Eng-38, and by the STARS Program Office under AF Order RESD-632. Authors’ addresses: T. E. Hull and T. F. Fairgrieve, Department of Computer Science, University of Toronto, Toronto, Ontario, Canada M5S 1A4; P. T. P. Tang, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL 60439-4801. Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Association for Computing Machinery. To copy otherwise, or to republish, requires a fee and/or specific permission
HRI '12: Proceedings of the seventh annual ACM/IEEE international conference on Human-Robot Interaction	Mar-12	Control of human-machine interaction for wide area search munitions in the presence of target uncertainty	1) Pia E.K. Berg-Yuen, Eduardo L. Pasiliao, Robert A. Murphey; 2) Siddhartha S. Mehta	1) Air Force Research Laboratory, Eglin AFB, FL, USA; 2) University of Florida, Shalimar, FL, USA	Copyright is held by the author/owner(s).	10.1145/2157689.2157752	Employee	1) Air Force Research Laboratory, Eglin AFB, FL, USA;	No	This research is supported in part by a grant from the US Air Force, Eglin AFB, grant FA8651-08-D-0108/025.
Communications of the ACM: Volume 36 Issue 11, Nov. 1993	Nov-93	Software complexity and maintenance costs	1) Rajiv D. Banker; 2) Srikant M. Datar; 3) Chris F. Kemerer; 4) Dani Zweig	1) Univ. of Minnesota, Minneapolis; 2) Stanford Univ., Stanford, CA; 3) Massachusetts Institute of Technology, Cambridge; 4) Naval Postgraduate School, Monterey, CA	© ACM 0002-0782/93/1100-081 $1.50	10.1145/163359.163375	Employee	4) Naval Postgraduate School, Monterey, CA	No	Permissions to copy without fee all of part of this material is granted provided that the copies are not made or districuted for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given that copying by permission of the Association for Computing Machinery. To copy otherwise, or to republish, requires a fee and/or specific permission.
PODC '08: Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing	Aug-08	Sleeping on the job: energy-efficient and robust broadcast for radio networks	1) Valerie King; 2) Cynthia Phillips; 3) Jared Saia; 4) Maxwell Young	1) University of Victoria, Victoria, BC, Canada; 2) Sandia National Laboratories, New Mexico; 3) University of New Mexico, Albuquerque, NM, USA; 4) University of Waterloo, Waterloo, ON, Canada	Copyright 2008 ACM 978-1-59593-989-0/08/08 ...$5.00.	10.1145/1400751.1400784	National Lab	2) Sandia National Laboratories, New Mexico;	No	This research was supported by NSERC research grant 121617. Sandia is a multipurpose laboratory operated by Sandia Corporation, a Lockheed-Martin Company, for the United States Department of Energy’s National Nuclear Security Administration under contract DE-AC04-94AL85000. This research was partially supported by NSF CAREER Award 0644058, NSF CCR-0313160 and an AFO MURI award. This research was partially supported by a NSERC postgraduate scholarship, a David R. Cheriton graduate scholarship and a University of Waterloo President’s graduate scholarship. Part of this work was done while a student at the University of New Mexico. Copyright 2008 Association for Computing Machinery. ACM acknowledges that this contribution was authored or co-authored by an employee, contractor or affiliate of the U.S. Government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only
ACM Transactions on Mathematical Software (TOMS): Volume 10 Issue 3, Sept. 1984	Sep-84	Software for estimating sparse Jacobian matrices	1) Thomas F. Coleman; 2) Burton S. Garbow, Jorge J. More	1) Cornell University; 2) Argonne National Laboratory	© 1984 ACM 0730-0301/84/0300-0329 $00.75	10.1145/1271.1610	National Lab	2) Argonne National Laboratory	No	B. S. Garbow and J. J. More's work was supported in part by the Applied Mathematical Sciences Research Program (KC-04-02) of the Office of Energy Research of the U.S. Department of Energy under Contract W-31-109-Eng-38.
Communications of the ACM: Volume 53 Issue 12, December 2010	Dec-10	The long quest for universal information access	1) Peter J. Denning; 2) Robert E. Kahn	1) Naval Postgraduate School in Monterey, CA; 2) President and CEO of the Corporation for National Research	Copyright held by author.	10.1145/1859204.1859218	Employee	1) Naval Postgraduate School in Monterey, CA;	No	N/A
HRI '11: Proceedings of the 6th international conference on Human-robot interaction	Mar-11	Effects of unreliable automation and individual differences on supervisory control of multiple ground robots	1) Jessie Y.C. Chen; 2) Michael J. Barnes; 3) Caitlin Kenny	1) US Army Research Laboratory, Orlando, FL, USA; 2) US Army Research Laboratory, Ft. Huachuca, AZ, USA; 3) University of Central Florida, Orlando, FL, USA	Copyright 2011 ACM 978-1-4503-0561-7/11/03...$10.00.	10.1145/1957656.1957793	Employee	1) US Army Research Laboratory, Orlando, FL, USA; 2) US Army Research Laboratory, Ft. Huachuca, AZ, USA;	No	Copyright 2011 Association for Computing Machinery. ACM acknowledges that this contribution was authored or co-authored by an employee, contractor or affiliate of the U.S. Government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only
ACM Transactions on Sensor Networks (TOSN): Volume 6 Issue 2, February 2010	Feb-10	A computational geometry method for localization using differences of distances	1) Xiaochun Xu, Sartaj Sahni; 2) Nageswara S. V. Rao	1) University of Florida, Gainesville, FL; 2) Oak Ridge National Laboratory	© 2010 ACM 1550-4859/2010/02-ART10 $10.00	10.1145/1689239.1689240	National Lab	2) Oak Ridge National Laboratory	No	This work is funded by the SensorNet program of Oak Ridge National Laboratory (ORNL) through Office of Naval Research. ONRL is managed by UT-Battelle, LLC for U.S. Department of Energy under Contract No. DE-AC05-00OR22725. Authors’ addresses: X. Xu and S. Sahni, Computer and Information Science and Engineering Department, University of Florida, Gainesville, FL 32611; email: {xxu,sahni@cise.ufl.edu; N. S. V. Rao, Computer Science and Mathematics Division, Oak Ridge National Laboratory, Oak Ridge, TN 37831; email: raons@ornl.gov. c 2010 Association for Computing Machinery. ACM acknowledges that this contribution was authored or co-authored by a contractor or affiliate of the [U.S.] Government. As such the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies show this notice on the first page or initial screen of a display along with the full citation. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works requires prior specific permission and/or a fee. Permissions may be requested from Publications Dept., ACM, Inc., 2 Penn Plaza, Suite 701, New York, NY 10121-0701 USA, fax +1 (212) 869-0481, or permissions@acm.org.
ACM Transactions on Mathematical Software (TOMS): Volume 36 Issue 2, March 2009	Mar-09	KSSOLV—a MATLAB toolbox for solving the Kohn-Sham equations	1) Chao Yang, Juan C. Meza, Byounghak Lee, Lin-Wang Wang	1) Lawrence Berkeley National Laboratory, Berkeley, CA	© 2009 ACM 0098-3500/2009/03-ART10 $5.00	10.1145/1499096.1499099	National Lab	1) Lawrence Berkeley National Laboratory, Berkeley, CA	No	This work was supported by the Director, Office of Science, Division of Mathematical, Information, and Computational Sciences of the U.S. Department of Energy under contract number DE-AC03- 76SF00098. Authors’ addresses: Computational Research Division, Lawrence Berkeley National Laboratory, Berkeley , CA 94720; email: {CYang, JCMeza, LWWang}@lbl.gov;byounghak@txstate.edu. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies show this notice on the first page or initial screen of a display along with the full citation. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works requires prior specific permission and/or a fee. Permissions may be requested from Publications Dept., ACM, Inc., 2 Penn Plaza, Suite 701, New York, NY 10121-0701 USA, fax +1 (212) 869-0481, or permissions@acm.org.
SIGCSE '99: The proceedings of the thirtieth SIGCSE technical symposium on Computer science education	Mar-99	Digital video in education	1) Todd Smith, Anthony Ruocco, Bernard Jansen	1) US Military Academy	© 1999 ACM l-581 13-085-6/99/0003...$5.00	10.1145/299649.299715	Employee	1) US Military Academy	No	Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, reqwes prior specific permission and/or a fee.
SC '13: Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis	Nov-13	Distributed wait state tracking for runtime MPI deadlock detection	1) Tobias Hilbrich, Wolfgang E. Nagel, Christel Baier; 2) Bronis R. de Supinski; 3) Joachim Protze, Matthias S. Müller	1) Technische Universität, Dresden, Germany; 2) Lawrence Livermore National Laboratory, Livermore, CA; 3) RWTH Aachen University, Aachen, Germany	Copyright 2013 ACM 978-1-4503-2378-9/13/11 ...$15.00.	10.1145/2503210.2503237	National Lab	2) Lawrence Livermore National Laboratory, Livermore, CA	No	Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting withcredit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Permissions@acm.org.
ACM Transactions on Design Automation of Electronic Systems (TODAES): Volume 11 Issue 2, April 2006	Apr-06	A survey of fault tolerant methodologies for FPGAs	1) Jason A. Cheatham; 2) John M. Emmert; 3) Stan Baumgart	1) Sensors Directorate, Air Force Research Lab, Dayton, OH; 2) Department of Electrical Engineering, Wright State University, 3640 Colonel Glenn Highway, Dayton, OH; 3) University of North Carolina, Charlotte	© 2006 ACM 1084-4309/06/0400-0501 $5.00	10.1145/1142155.1142167	Employee	1) Sensors Directorate, Air Force Research Lab, Dayton, OH;	No	Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or direct commercial advantage and that copies show this notice on the first page or initial screen of a display along with the full citation. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works requires prior specific permission and/or a fee. Permissions may be requested from Publications Dept., ACM, Inc., 1515 Broadway, New York, NY 10036 USA, fax: +1 (212) 869-0481, or permissions@acm.org
Journal of the ACM (JACM): Volume 23 Issue 4, Oct. 1976	Oct-76	Boundary and Object Detection in Real World Images	Yoram Yakimovsky	1) Ph D-M D Program, University of Miami School of Medicine, Miami, FL and Jet Propulsion Laboratory, Pasadena, California	Copyright © 1976, Association for Computing Machinery, lnc	10.1145/321978.321981	Unsure	1) Ph D-M D Program, University of Miami School of Medicine, Miami, FL and Jet Propulsion Laboratory, Pasadena, California	No	General permission to republish, but not for profit, all or part of this material is granted provided that ACM's copyrnght notice is given and that reference is made to the publication, to its date of issue, and to the fact that reprinting privileges were granted by permission of the Association for Computing Machinery. This paper presents the results of one phase of research carried out at the Jet Propulsion Laboratory, California Institute of Technology, under Contract NAS7-100. sponsored by the National Aeronautics and Space Administration
ACM Transactions on Mathematical Software (TOMS): Volume 7 Issue 1, March 1981	Mar-81	Extended-Range Arithmetic and Normalized Legendre Polynomials	1) J. M. Smith, F. W. J. Olver, D. W. Lozier	1) National Bureau of Standards, Washington, DC	© 1981 ACM 0098-35000/81/0300-0093 $00 00	10.1145/355934.355940	Employee	1) National Bureau of Standards, Washington, DC	No	The research of F.W.J Olver was supported in part by the U.S. Army Research Office, Durham, under Grant DAAG-29-77-G-0003 and in part by the U.S. National Science Foundation under grant GP 32841X2
ICSE '97: Proceedings of the 19th international conference on Software engineering	May-97	Automated analysis of requirement specifications	1) William M. Wilson; 2) Linda H. Rosenberg; 3) Lawrence E. Hyatt	1) Software Assurance Technology, Center/GSFC, Bld 6 Code 300.1, Greenbelt, MD; 2) Unisys Federal Systems/GSFC, Bld 6 Code 300.1, Greenbelt, MD; 3) NASA Goddard Space Flight, Center, Bld 6 Code 302, Greenbelt, MD	0-89791-914-9/97/05	10.1145/253228.253258	Employee	3) NASA Goddard Space Flight, Center, Bld 6 Code 302, Greenbelt, MD	No	N/A
Communications of the ACM: Volume 58 Issue 4, April 2015	Apr-15	Future Tense: The Wealth of Planets	David Allen Batchelor	NASA Goddard Space Flight Center, Greenbelt, MD	© 2015 ACM 0001-0782/15/04 $15.00	10.1145/2737915	Employee	NASA Goddard Space Flight Center, Greenbelt, MD	No	David Allen Batchelor (batchelor@alum.mit.edu) is a computer engineer for data systems on the Earth Science Data and Information System (ESDIS) Project at NASA Goddard Space Flight Center, Greenbelt, MD. His first science fiction novel was The Metalmark Contract published in 2011 by Black Rose Writing, Castroville, TX.
ANCS '14: Proceedings of the tenth ACM/IEEE symposium on Architectures for networking and communications systems	Oct-14	Impact of the end-system and affinities on the throughput of high-speed flows	1) Nathan Hanford, Vishal Ahuja, Matthew K. Farrens, Dipak Ghosal; 2) Mehmet Balman, Eric Pouyoul, Brian Tierney	1) University of California Davis, Davis, CA, USA; 2) Esnet, Lawrence Berkeley Labs, Berkeley, CA	ACM 978-1-4503-2839-5/14/10.	10.1145/2658260.2661772	National Lab	2) Esnet, Lawrence Berkeley Labs, Berkeley, CA	No	Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage, and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the owner/author(s). Copyright is held by the author/owner(s)
ACM Transactions on Modeling and Computer Simulation (TOMACS): Volume 19 Issue 2, March 2009	Mar-09	Two-phase screening procedure for simulation experiments	1) Susan M. Sanchez, Thomas W. Lucas; 2) Hong Wan	1) Naval Postgraduate School, Monterey, CA; 2) Purdue University, West Lafayette, IN	© 2009 ACM 1049-3301/2009/03-ART7 $5.00	10.1145/1502787.1502790	Employee	1) Naval Postgraduate School, Monterey, CA;	No	Preliminary results of this article appeared in Sanchez et al. [2005a] and Bosche [2006]. ´ This work was supported in part by the U.S. Marine Corps’ Project Albert effort, the Modeling and Simulation Coordination Office for the Joint Test and Evaluation Methodology project, and by OASD-NII through the Center for Edge Power at the Naval Postgraduate School. Authors’ addresses: S. M. Sanchez, Naval Postgraduate School, 1 University Circle, Monterey, CA 93943; email: ssanchez@nps.edu; H. Wan, Department of Industrial Engineering, Purdue University, West Lafayette, IN 47907; T. W. Lucas, Naval Postgraduate School, 1 University Circle, Monterey, CA 93943. © 2009 Association for Computing Machinery. ACM acknowledges that this contribution was authored or co-authored by a contractor or affiliate of the [U.S.] Government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies show this notice on the first page or initial screen of a display along with the full citation. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works requires prior specific permission and/or a fee. Permissions may be requested from Publications Dept., ACM, Inc., 2 Penn Plaza, Suite 701, New York, NY 10121-0701 USA, fax +1 (212) 869-0481, or permissions@acm.org.
ACM Transactions on Modeling and Computer Simulation (TOMACS): Volume 22 Issue 1, December 2011	Dec-11	Reversible Parallel Discrete Event Formulation of a TLM-Based Radio Signal Propagation Model	1) Sudip K. Seal, Kalyan S. Perumalla	1) Oak Ridge National Laboratory	© 2011 ACM 1049-3301/2011/12-ART4 $10.00	10.1145/2043635.2043639	National Lab	1) Oak Ridge National Laboratory	No	This article has been authored by UT-Battelle, LLC, under contract DE-AC05-00OR22725 with the U.S. Department of Energy. This effort was partly supported by the Laboratory Directed Research and Development Program of Oak Ridge National Laboratory (ORNL), and in part by the DOE Office of Science, Advanced Scientific Computing Research, Career Research Program. This research used resources of the National Center for Computational Sciences (NCCS) at ORNL. Authors’ address: S. K. Seal and K. S. Perumalla, Oak Ridge National Laboratory, One Bethel Valley Road, P.O. Box 2008, MS 6085, Oak Ridge, TN 37831-6085; email: {sealsk, perumallaks}@ornl.gov. © 2011 Association for Computing Machinery. ACM acknowledges that this contribution was authored or co-authored by a contractor or affiliate of the [U.S.] Government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies show this notice on the first page or initial screen of a display along with the full citation. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works requires prior specific permission and/or a fee. Permission may be requested from Publications Dept., ACM, Inc., 2 Penn Plaza, Suite 701, New York, NY 10121-0701, USA, fax +1 (212) 869-0481, or permissions@acm.org.
SC '15: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis	Nov-15	HipMer: an extreme-scale de novo genome assembler	1) Aydın Buluç, Jarrod Chapman, Steven Hofmeyr, Chaitanya Aluru, Rob Egan, Leonid Oliker; 2) Daniel Rokhsar, Katherine Yelick, Evangelos Georganas,	1) Lawrence Berkeley National Laboratory; 2) Lawrence Berkeley National Laboratory and University of California, Berkeley	© 2015 ACM. ISBN 978-1-4503-3723-6/15/11. . . $15.00	10.1145/2807591.2807664	National Lab	1) Lawrence Berkeley National Laboratory; 2) Lawrence Berkeley National Laboratory and University of California, Berkeley	No	ACM acknowledges that this contribution was authored or co-authored by an employee, or contractor of the national government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only. Permission to make digital or hard copies for personal or classroom use is granted. Copies must bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. To copy otherwise, distribute, republish, or post, requires prior specific permission and/or a fee. Request permissions from permissions@acm.org.
ICFP '07: Proceedings of the 12th ACM SIGPLAN international conference on Functional programming	Sep-07	Type-safe higher-order channels in ML-like languages	Sungwoo Park	Pohang University of Science and Technology, Pohang, South Korea	N/A	10.1145/1291151.1291181	Not Govt	No government agencies appear in the author affiliations	No	N/A
Communications of the ACM: Volume 18 Issue 8, Aug. 1975	Aug-75	Remark on stably updating mean and standard deviation of data	Ira W. Cotton	National Bureau of Standards, Washington, DC	Copyright © 1975, Association for Computing Machinery, lnc.	10.1145/360933.360981	Employee	National Bureau of Standards, Washington, DC	No	General permission to republish, but not for profit, all or part of this material is granted provided that ACM's copyright notice is given and that reference is made to the publication, to its date of issue, and to the fact that reprinting privileges were granted by permission of the Association for Computing Machinery. Author's address: Computer Networking Section, Institute for Computer Science and Technology National Bureau of Standards, Washington, D.C. 20234.
SC '07: Proceedings of the 2007 ACM/IEEE conference on Supercomputing	Nov-07	Optimization of sparse matrix-vector multiplication on emerging multicore platforms	1) Leonid Oliker, Richard Vuduc, John Shalf; 2) Katherine Yelick, Samuel Williams; 3) James Demmel	1) Lawrence Berkeley National Laboratory, Berkeley, CA; 2) Lawrence Berkeley National Laboratory, Berkeley, CA and University of California at Berkeley, Berkeley, CA; 2) University of California at Berkeley, Berkeley, CA	(c) 2007 ACM 978-1-59593-764-3/07/0011 ...$5.00.	10.1145/1362622.1362674	National Lab	1) Lawrence Berkeley National Laboratory, Berkeley, CA; 2) Lawrence Berkeley National Laboratory, Berkeley, CA and University of California at Berkeley, Berkeley, CA	No	(c) 2007 Association for Computing Machinery. ACM acknowledges that this contribution was authored or co-authored by a contractor or affiliate of the [U.S.] Government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce tor to allow others to do so, for Government purposes only.
SC '15: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis	Nov-15	Local recovery and failure masking for stencil-based applications at extreme scales	1) Keita Teranishi, Michael A. Heroux, Jackson Mayo, Hemanth Kolla, Jacqueline Chen; 2) Manish Parashar, Marc Gamell	1) Sandia National Laboratories, Livermore, CA, Albuquerque, NM; 2) Rutgers University, Piscataway, NJ	© 2015 ACM. ISBN 978-1-4503-3723-6/15/11. . . $15.00	10.1145/2807591.2807672	National Lab	1) Sandia National Laboratories, Livermore, CA, Albuquerque, NM;	No	ACM acknowledges that this contribution was authored or co-authored by an employee, or contractor of the national government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only. Permission to make digital or hard copies for personal or classroom use is granted. Copies must bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. To copy otherwise, distribute, republish, or post, requires prior specific permission and/or a fee. Request permissions from permissions@acm.org
DAC '16: Proceedings of the 53rd Annual Design Automation Conference	Jun-16	A model-driven approach to warp/thread-block level GPU cache bypassing	1) Hongwen Dai, Chao Li, Huiyang Zhou; 2) Saurabh Gupta, Christos Kartsaklis; 3) Mike Mantor	1) North Carolina State University, Raleigh, NC; 2) Oak Ridge National Lab, Oak Ridge, TN; 3) Advanced Micro Devices, Orlando, FL	© 2016 ACM. ISBN 978-1-4503-4236-0/16/06, $15.00	10.1145/2897937.2897966	National Lab	2) Oak Ridge National Lab, Oak Ridge, TN;	No	© 2016 Association for Computing Machinery. ACM acknowledges that this contribution was authored or co-authored by an employee, contractor or affiliate of the United States government. As such, the United States Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only.
Communications of the ACM: Volume 32 Issue 12, Dec. 1989	Dec-89	Grand challenges to computation science	Eugene Levin	NASA Research Center, Moffett Field, CA	©1989 ACM 0001.0782/89/lZOO-1456 $1.50	10.1145/76380.76385	Employee	NASA Research Center, Moffett Field, CA	No	Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage. the ACM copyright notice and the title of the publication and its date appear. and notice is given that copying is by permission of the Association for Compuling Machinery. To copy otherwise. or to republish. requires a fee and/or specific permission.
ACM Transactions on Mathematical Software (TOMS): Volume 17 Issue 1, March 1991	Mar-91	The use of Taylor series to test accuracy of function programs	1) W. J. Cody, L. Stoltz	1) Argonne National Labs, Argonne, IL	© 1991 ACM 0098-3500/91/0300-0055 $01.50	10.1145/103147.103154	National Lab	1) Argonne National Labs, Argonne, IL	No	This work was supported by the Applied Mathematical Science subprogram of the Office of Energy Research, U.S. Dept. of Energy, under Contract W-31 -109-Eng-38. Authors’ addresses: W. J. Cody, Mathematics and Computer Science Division, Argonne National Laboratory, 9700 S. Cass Avenue, Argonne, IL 60439-4801. L. Stoltz, Computer Science Department, Washington State University, Pullman, WA 99164-1210. Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its data appear, and notice is given that copying is by permission of the Association for Camputing Machinery. TO copy otherwise, or to republish, requires a fee and/or specific permission.
SC '15: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis	Nov-15	The Spack package manager: bringing order to HPC software chaos	1) Todd Gamblin, Matthew LeGendre, Michael R. Collette, Gregory L. Lee, Adam Moody, Bronis R. de Supinski, Scott Futral	1) Lawrence Livermore National Laboratory	© 2015 ACM. ISBN 978-1-4503-3723-6/15/11. . . $15.00	10.1145/2807591.2807623	National Lab	1) Lawrence Livermore National Laboratory	No	This work was performed under the auspices of the U.S. Department of Energy by Lawrence Livermore National Laboratory, Contract DE-AC52-07NA27344. LLNL-CONF-675189. Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from permissions@acm.org.
ACM Transactions on Intelligent Systems and Technology (TIST): Volume 3 Issue 4, September 2012	Sep-12	Surface Sulfur Detection via Remote Sensing and Onboard Classification	1) Lukas Mandrake, Umaa Rebbapragada, Kiri L. Wagstaff, David Thompson, Steve Chien, Daniel Tran, Robert T. Pappalardo, Damhnait Gleeson, Rebecca Castaño	1) Jet Propulsion Laboratory, California Institute of Technology	© 2012 ACM 2157-6904/2012/09-ART77 $15.00	10.1145/2337542.2337562	Employee	1) Jet Propulsion Laboratory, California Institute of Technology	No	This work was carried out at the Jet Propulsion Laboratory, California Institute of Technology, under a contract with the National Aeronautics and Space Administration. Special thanks to the JPL Supercomputing and Visualization Facility for their support. Expert label generation and analysis was carried out by Damhnait Gleeson under the NASA Planetary Geology and Geophysics Program grant NNX07AR28G to Dr. Robert T. Pappalardo. Author’s address: L. Mandrake, Jet Propulsion Laboratory, 4800 Oak Grove Drive, Mail Stop 306-463, Pasadena, CA 91109; email: lukas.mandrake@jpl.nasa.gov. © 2012 Association for Computing Machinery. ACM acknowledges that this contribution was authored or co-authored by a contractor or affiliate of the [U.S.] Government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies show this notice on the first page or initial screen of a display along with the full citation. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works requires prior specific permission and/or a fee. Permission may be requested from Publications Dept., ACM, Inc., 2 Penn Plaza, Suite 701, New York, NY 10121-0701, USA, fax +1 (212) 869-0481, or permissions@acm.org.
Communications of the ACM: Volume 50 Issue 11, November 2007	Nov-07	The choice uncertainty principle	Peter J. Denning	Naval Postgraduate School, Monterey, CA	© 2007 ACM 0001-0782/07/1100 $5.00	10.1145/1297797.1297809	Employee	Peter J. Denning (pjd@nps.edu) is the director of the Cebrowski Institute for Information Innovation and Superiority at the Naval Postgraduate School in Monterey, CA, and a past president of ACM.	No	N/A
ACM Transactions on Reconfigurable Technology and Systems (TRETS): Volume 3 Issue 1, January 2010	Jan-10	Sparse Matrix-Vector Multiplication on a Reconfigurable Supercomputer with Application	1) David Dubois, Andrew Dubois, Thomas Boorman, Carolyn Connor; 2) Steve Poole	1) Los Alamos National Laboratory; 2) Oak Ridge National Laboratory	© 2010 ACM 1936-7406/2010/01-ART2 $10.00	10.1145/1661438.1661440	National Lab	1) Los Alamos National Laboratory; 2) Oak Ridge National Laboratory	No	This article is published under Los Alamos National Laboratory Grant LA-UR-09-04151. Authors’ addresses: D. DuBois, A. DuBois, T. Boorman, and C. Connor, Los Alamos National Laboratory, Mailstop: B272, PO Box 1663, Los Alamos, NM 87545; email: {dhd, ajd, tmb, connor}@ lanl.gov; S. Poole, Oak Ridge National Laboratory, Mailstop: 6173. PO Box 2008, Oak Ridge, TN 37831; email: spoole@ornl.gov. c 2010 Association for Computing Machinery. ACM acknowledges that this contribution was authored or co-authored by a contractor or affiliate of the [U.S.] Government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only. Permission to make digital or hard copies part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies show this notice on the first page or initial screen of a display along with the full citation. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works requires prior specific permission and/or a fee. Permissions may be requested from Publications Dept., ACM, Inc., 2 Penn Plaza, Suite 701, New York, NY 10121-0701 USA, fax +1 (212) 869-0481, or permissions@acm.org.
SC '15: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis	Nov-15	Understanding the propagation of transient errors in HPC applications	1) Rizwan A. Ashraf, Ronald F. DeMara; 2) Roberto Gioiosa, Gokcen Kestor; 3) Chen-Yong Cher, Pradip Bose	1) University of Central Florida, Orlando, FL; 2) Pacific Northwest National Lab, Richland, WA; 3) IBM T.J. Watson Research Center, Yorktown Heights, NY	© 2015 ACM. ISBN 978-1-4503-3723-6/15/11. . . $15.00	10.1145/2807591.2807670	National Lab	2) Pacific Northwest National Lab, Richland, WA;	No	ACM acknowledges that this contribution was authored or co-authored by an employee, or contractor of the national government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only. Permission to make digital or hard copies for personal or classroom use is granted. Copies must bear this notice and the full citationon the first page. Copyrights for components of this work owned by others thanACM must be honored. To copy otherwise, distribute, republish, or post, requires prior specific permission and/or a fee. Request permissions from permissions@acm.org.
PACT '14: Proceedings of the 23rd international conference on Parallel architectures and compilation	Aug-14	SM-centric transformation: circumventing hardware restrictions for flexible GPU scheduling	1) Bo Wu, Guoyang Chen, Xipeng Shen; 2) Dong Li, Jeffrey S. Vetter	1) The College of William and Mary; 2) Oak Ridge National Lab, Oak Ridge, TN, USA	Copyright is held by the author/owner(s).	10.1145/2628071.2628130	National Lab	2) Oak Ridge National Lab, Oak Ridge, TN, USA	No	Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage, and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the owner/author(s).
Journal of the ACM (JACM): Volume 21 Issue 2, April 1974	Apr-74	Synthesis of a Feedback Queueing Discipline for Computer Operation	1) J. A. Michel; 2) E. G. Coffman, Jr.	1) Mathematics Department, United States Air Force Academy, Colorado Springs, Colorado; 2) Computer Science Department, The Pennsylvania State University, University Park, Pennsylvania	Copyright © 1974, Association for Computing Machinery, Inc.	10.1145/321812.321828	Employee	1) Mathematics Department, United States Air Force Academy, Colorado Springs, Colorado;	No	General permission to republish, but not for profit, all or part of this material is granted provided that ACM's copyright notice is given and that reference is made to the publication, to its date of issue, and to the fact that reprinting privileges were granted by permission of the Association for Computing Machinery. Authors' addresses: J. A. Michel, Mathematics Department, United States Air Force Academy, Colorado Springs, CO 80840; E. G. Coffman Jr., Computer Science Dept., The Pennsylvania State University, University Park, PA 16802.
SC '03: Proceedings of the 2003 ACM/IEEE conference on Supercomputing	Nov-03	The Case of the Missing Supercomputer Performance: Achieving Optimal Performance on the 8,192 Processors of ASCI Q	1) Fabrizio Petrini, Darren J. Kerbyson, Scott Pakin	1) Los Alamos National Laboratory, New Mexico	1-58113-695-1/03 $ 17.00 © 2003 ACM	10.1145/1048935.1050204	National Lab	1) Los Alamos National Laboratory, New Mexico	No	© 2003 Association for Computing Machinery. ACM acknowledges that this contribution was authored or co-authored by a contractor or affiliate of the U.S. Government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only.
ACM Transactions on Mathematical Software (TOMS): Volume 33 Issue 2, June 2007	Jun-07	OPT++: An object-oriented toolkit for nonlinear optimization	1 J. C. Meza, R. A. Oliva; 2) P. D. Hough, P. J. Williams	1) Ernest Orlando Lawrence Berkeley National Laboratory; 2) Sandia National Laboratories	© 2007 ACM 0098-3500/2007/06-ART12 $5.00	10.1145/1236463.1236467	National Lab	1) Ernest Orlando Lawrence Berkeley National Laboratory; 2) Sandia National Laboratories	No	This work at Ernest Orlando Lawrence Berkeley National Laboratory was supported by the Director, Office of Science, of the U.S. Department of Energy under Contract No. DE-AC02-05CH11231. Sandia is a multiprogram laboratory operated by Sandia Corporation, a Lockheed Martin Company, for the United States Department of Energy’s National Nuclear Security Administration under Contract DE-AC04-94AL85000. Author’s address: J. C. Meza; email: JCMeza@lbl.gov. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or direct commercial advantage and that copies show this notice on the first page or initial screen of a display along with the full citation. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works requires prior specific permission and/or a fee. Permissions may be requested from the Publications Dept., ACM, Inc., 2 Penn Plaza, Suite 701, New York, NY 10121-0701 USA, fax +1 (212) 869-0481, or permissions@acm.org.
JCDL '05: Proceedings of the 5th ACM/IEEE-CS joint conference on Digital libraries	Jun-05	Using standards in digital library design & development	1) Jeroen Bekaert; 2) Xiaoming Liu, Herbert Van de Sompel	1) Ghent University; 2) Los Alamos National Laboratory	Copyright is held by the author/owner(s).	10.1145/1065385.1065528	National Lab	2) Los Alamos National Laboratory	No	N/A
SC '03: Proceedings of the 2003 ACM/IEEE conference on Supercomputing	Nov-03	The Space Simulator: Modeling the Universe from Supernovae to Cosmology	1) Michael S. Warren, Chris L. Fryer, M. Patrick Goda	1) Los Alamos National Laboratory, Los Alamos, New Mexico	Copyright 2003 ACM 1-58113-695-1/03/0011 ...$5.00.	10.1145/1048935.1050181	National Lab	1) Los Alamos National Laboratory, Los Alamos, New Mexico	No	Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee
ACM Transactions on Mathematical Software (TOMS): Volume 18 Issue 4, Dec. 1992	Dec-92	Algorithm 710: FORTRAN subroutines for computing the eigenvalues and eigenvectors of a general matrix by reduction to general tridiagonal form	1) J. J. Dongarra, G. A. Geist, C. H. Romine	1) Oak Ridge National Laboratory	© 1992 ACM 0098-3500/92/1200-0392 $000	10.1145/138351.138352	National Lab	1) Oak Ridge National Laboratory	No	This work was supported m part by the Apphed Mathematical Sciences Research Program, OffIce of Energy Research, U.S. Department of Energy, under contract DE-AC05-840R2 1400 with Martin Marietta Energy Systems, Inc. The work of C. H, Romme was also supported in part by U.S. Navy Space and Naval Warfare Systems (SPAWAR) contract NOO039-89-C-OO01. Authors’ address. Mathematical Sciences SectIon, Oak Ridge National Laboratory, Oak Ridge, TN 37831-8083. Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice m given that copying M by permission of the Association for Computing Machinery. To copy otherwise, or to republish, requires a fee and/or specific permmslon.
Supercomputing '91: Proceedings of the 1991 ACM/IEEE conference on Supercomputing	Aug-91	Retire Fortran? A debate rekindled	David Cann	Computing Research Group, L-306, Lawrence Livermore National Laboratory, P.O. Box 808, Livermore, CA	© 1991 ACM 0-89791-459-7/91/0264 $01.50	10.1145/125826.125976	National Lab	Computing Research Group, L-306, Lawrence Livermore National Laboratory, P.O. Box 808, Livermore, CA	No	This document was prepared as an account of work sponsored by an agency of the United States Government. Neither the United States Government nor the University of California nor any of their employees, makes any warranty, express or implied, or assumes any legal liability or responsibility for the accuracy, completeness, or usefulness of any information, apparatus, product, or process disclosed, or represents that its use would not infringe privately owned rights. Reference herein to any specific commercial products, process, or service by trade name, trademark, manufacturer, or otherwise, does not necessarily constitute or imply its endorsement, recommendation, or favoring by the United States Government or the University of California. The views and opinions of authors expressed herein do not necessarily state or reflect those of the United States Government or the University of California, and shall not be used for advertising or product endorsement purposes.
ACM Transactions on Applied Perception (TAP): Volume 8 Issue 2, January 2011	Jan-11	An other-race effect for face recognition algorithms	1) P. Jonathon Phillips; 2) Fang Jiang, Abhijit Narvekar, Julianne Ayyad, Alice J. O'Toole	1) National Institute of Standards and Technology, Gaithersburg MD; 2) The University of Texas at Dallas, TX	© 2011 ACM 1544-3558/2011/01-ART14 $10.00	10.1145/1870076.1870082	Employee	1) National Institute of Standards and Technology, Gaithersburg MD;	No	This work was supported by funding from the Technical Support Working Group of the Department of Defense and A. O’Toole from. P. J. Phillips was supported in part by funding from the Federal Bureau of Investigation. The identification of any commercial product or trade name does not imply endorsement or recommendation by NIST. Authors’ addresses: P. J. Phillips, National Institute of Standards and Technology, 100 Bureau Dr., MS 8940 Gaithersburg MD 20899; email: jonathon@nist.gov; F. Jiang, A. Narvekar, J. Ayyad and A. O’Toole, School of Behavioral and Brain Sciences, GR4.1 The University of Texas at Dallas Richardson, TX 75083-0688; email: otoole@utdallas.edu. © 2011 Association for Computing Machinery. ACM acknowledges that this contribution was authored or co-authored by a contractor or affiliate of the [U.S.] Government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies show this notice on the first page or initial screen of a display along with the full citation. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works requires prior specific permission and/or a fee. Permissions may be requested from Publications Dept., ACM, Inc., 2 Penn Plaza, Suite 701, New York, NY 10121-0701 USA, fax +1 (212) 869-0481, or permissions@acm.org.
ICS '14: Proceedings of the 28th ACM international conference on Supercomputing	Jun-14	Palm: easing the burden of analytical performance modeling	1) Nathan R. Tallent, Adolfy Hoisie	1) Pacific Northwest National Laboratory, Richland, WA, USA	Copyright 2014 ACM 978-1-4503-2642-1/14/06 ...$15.00.	10.1145/2597652.2597683	National Lab	1) Pacific Northwest National Laboratory, Richland, WA, USA	No	ACM acknowledges that this contribution was authored or co-authored by an employee, contractor or affiliate of the United States government. As such, the United States Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only
Communications of the ACM: Volume 17 Issue 5, May 1974	May-74	ACM forum	David J. Premer	Department of Defense, Mapping Agency, Aerospace Center, St. Louis Air Force Station, MO 63118	N/A	10.1145/360980.361010	Employee	Department of Defense, Mapping Agency, Aerospace Center, St. Louis Air Force Station, MO 63118	No	N/A	The article found with this DOI is a long list of short letters written in response to some other article. One of the authors of one of the letters was with the DoD, that author is the only one listed in this entry.
ACM Transactions on Graphics (TOG): Volume 32 Issue 2, April 2013	Apr-13	A benchmark for surface reconstruction	1) Matthew Berger; 2) Joshua A. Levine; 3) Luis Gustavo Nonato; 4) Gabriel Taubin; 5) Claudio T. Silva	1) Air Force Research Laboratory, Information Directorate; 2) Clemson University, Clemson, SC; 3) Universidade de São Paulo, São Paulo, Brazil; 4) Brown University, Providence, RI; 5) Polytechnic Institute of New York University, NY	© 2013 ACM 0730-0301/2013/04-ART20 $15.00	10.1145/2451236.2451246	Employee	1) Air Force Research Laboratory, Information Directorate;	no	This work was partially funded by the National Science Foundation and grants from Fapesp-Brazil and CNPq-NSF. Authors’ addresses: M. Berger (corresponding author), Air Force Research Laboratory, Information Directorate; email: bergerm@cs.utah.edu; J. A. Levine, Clemson University, Clemson, SC; L. G. Nonato, Universidade de Sao Paulo, Sao Paulo, Brazil; G. Taubin, Brown University, Providence, RI; and C. T. Silva, Polytechnic Institute of New York University, NY. © 2013 Association for Computing Machinery. ACM acknowledges that this contribution was authored or co-authored by a contractor or affiliate of the U.S. Government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies show this notice on the first page or initial screen of a display along with the full citation. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works requires prior specific permission and/or a fee. Permissions may be requested from Publications Dept., ACM, Inc., 2 Penn Plaza, Suite 701, New York, NY 10121-0701 USA, fax +1 (212) 869-0481, or permissions@acm.org.
Journal of the ACM (JACM): Volume 21 Issue 4, Oct. 1974	Oct-74	Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity	James R. Slagle	Code 5407, Naval Research Laboratory, SW, Washington, DC and National Institutes of Health, Department of Health, Education and Welfare, Bethesda, Maryland	Copyright © 1974, Association for Computing Machinery, Inc	10.1145/321850.321859	Employee	Code 5407, Naval Research Laboratory, SW, Washington, DC and National Institutes of Health, Department of Health, Education and Welfare, Bethesda, Maryland	No	General permission to republish, but not for profit, all or part of this material is granted provided that ACM's copyright notice is given and that reference is made to the publication, to its date of issue, and to the fact that reprinting privileges were granted by permission of the Association for Computing Machinery. Author's present address: Code 5407, Naval Research Laboratory SW, Washington, DC 20375.
PLAS '08: Proceedings of the third ACM SIGPLAN workshop on Programming languages and analysis for security	Jun-08	A security domain model to assess software for exploitable covert channels	1) Alan B. Shaffer, Mikhail Auguston, Cynthia E. Irvine, Timothy E. Levin	1) Naval Postgraduate School, Monterey, CA	Copyright © 2008 ACM 978-1-59593-936-4/08/06…$5.00.	10.1145/1375696.1375703	Employee	1) Naval Postgraduate School, Monterey, CA	No	ACM acknowledges that this contribution was authored or co-authored by an employee, contractor or affiliate of the U.S. Government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only. The authors are grateful for support from the Office of Naval Research and the National Science Foundation under grant CNS- 0430566. Any opinions, findings and conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect the views of the ONR or the NSF.
SC '97: Proceedings of the 1997 ACM/IEEE conference on Supercomputing	Nov-97	Wavelet-based image registration on parallel computers	1) Tarek A. El-Ghazawi; 2) Prachya Chalermwat, Jacqueline Le Moigne	1) The George Washington University, Washington, DC; 2) NASA GSFC, Greenbelt, MD	(c) 1997 ACM 0-89791-985-8/97/0011 $3.50	10.1145/509593.509613	Employee	2) NASA GSFC, Greenbelt, MD	No	Permission to make digital/hard copy of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage, the copyright notice, the title of the publication and its date appear, and notice is given that copying is by permission of ACM, Inc. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee.
PLDI '16: Proceedings of the 37th ACM SIGPLAN Conference on Programming Language Design and Implementation	Jun-16	Effective padding of multidimensional arrays to avoid cache conflict misses	1) Changwan Hong, Wenlei Bao, Louis-Noël Pouchet, P. Sadayappan 2) Albert Cohen; 3) Sriram Krishnamoorthy; 4) Fabrice Rastello; 5) J. Ramanujam	1) Ohio State University, USA; 2) Inria, France / ENS, France; 3) Pacific Northwest National Laboratory; 4) Inria, France; 5) Louisiana State University, USA	© 2016 ACM. 978-1-4503-4261-2/16/06...$15.00	10.1145/2908080.2908123	National Lab	3) Pacific Northwest National Laboratory;	No	Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Permissions@acm.org.
EuroMPI 2016: Proceedings of the 23rd European MPI Users' Group Meeting	Sep-16	Allowing MPI tools builders to forget about Fortran	1) Soren Rasmussen; 2) Martin Schulz, Kathryn Mohror	1) University of Oregon, Eugene, Oregon; 2) Lawrence Livermore National, Laboratory, Livermore, California	© 2016 ACM. ISBN 978-1-4503-4234-6/16/09. . . $15.00	10.1145/2966884.2966889	National Lab	2) Lawrence Livermore National, Laboratory, Livermore, California	No	Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from permissions@acm.org
Communications of the ACM - One Laptop Per Child: Vision vs. Reality: Volume 52 Issue 6, June 2009	Jun-09	The profession of IT: Beyond computational thinking	Peter J. Denning	Naval Postgraduate School in Monterey CA	Copyright held by author.	10.1145/1516046.1516054	Employee	Peter J. Denning (pjd@nps.edu) is the director of the Cebrowski Institute for Information Innovation and Superiority at the Naval Postgraduate School in Monterey, CA.	no	N/A
SC '15: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis	Nov-15	Clock delta compression for scalable order-replay of non-deterministic parallel applications	1) Kento Sato, Dong H. Ahn, Ignacio Laguna, Gregory L. Lee, Martin Schulz	1) Lawrence Livermore National Laboratory, Livermore, CA	© 2015 ACM. ISBN 978-1-4503-3723-6/15/11. . . $15.00	10.1145/2807591.2807642	National Lab	1) Lawrence Livermore National Laboratory, Livermore, CA	No	Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from permissions@acm.org.
SC '15: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis	Nov-15	Reliability lessons learned from GPU experience with the Titan supercomputer at Oak Ridge leadership computing facility	1) Devesh Tiwari, Saurabh Gupta, Jim Rogers, Don Maxwell; 2) George Gallarno	1) Oak Ridge National Laboratory; 2) Christian Brothers University	© 2015 ACM. ISBN 978-1-4503-3723-6/15/11. . . $15.00	10.1145/2807591.2807666	National Lab	1) Oak Ridge National Laboratory;	No	George Gallarno was supported by the U.S. Department of Energy, Office of Science, Office of Workforce Development for Teachers and Scientists (WDTS) under the SULI Program. This work was supported by the Oak Ridge Leadership Computing Facility at the Oak Ridge National Laboratory, which is managed by UT Battelle, LLC for the U.S. DOE (under the contract No. DE-AC05-00OR22725). ACM acknowledges that this contribution was authored or co-authored by an employee, or contractor of the national government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only. Permission to make digital or hard copies for personal or classroom use is granted. Copies must bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. To copy otherwise, distribute, republish, or post, requires prior specific permission and/or a fee. Request permissions from permissions@acm.org.
SC '01: Proceedings of the 2001 ACM/IEEE conference on Supercomputing	Nov-01	Global static indexing for real-time exploration of very large regular grids	1) Valerio Pascucci, Randall J. Frank	1) Lawrence Livermore National Laboratory	© 2001 ACM 1-58113-293-X/01/0011 $5.00	10.1145/582034.582036	National Lab	1) Lawrence Livermore National Laboratory	No	We would like to thank to a number of people who contributed to this project, including Mark Duchaineau and Sean Ahern at LLNL. The example dataset appears courtesy of Art Mirin of LLNL. This work was performed under the auspices of the U.S. Department of Energy by the University of California, Lawrence Livermore National Laboratory under contract No. W 7405- Eng-48 (UCRL-JC-144754). It was supported in part by the Accelerated Strategic Computing Initiative and the Visual Interactive Environment for Weapons Simulations (VIEWS) program. ACM acknowledges that this contribution was authored or co-authored by a contractor or affiliate of the U.S. Government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only.
ACM Transactions on Sensor Networks (TOSN): Volume 8 Issue 3, July 2012	Jul-12	Optimal multiobjective placement of distributed sensors against moving targets	1) Thomas A. Wettergren, Russell Costa	1) Naval Undersea Warfare Center, Newport, RI	© 2012 ACM 1550-4859/2012/07-ART21 $15.00	10.1145/2240092.2240095	Employee	1) Naval Undersea Warfare Center, Newport, RI	No	This work was supported by the Office of Naval Research Code 321MS and by the In-House Laboratory Independent Research Program of the Naval Undersea Warfare Center. © 2012 Association for Computing Machinery. ACM acknowledges that this contribution was authored or co-authored by a contractor or affiliate of the [U.S.] Government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only. Authors’ address: T. A. Wettergren and R. Costa, Naval Undersea Warfare Center, 1176 Howell Street, Newport, RI 02841; email: t.a.wettergren@ieee.org, russell.costa@navy.mil. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies show this notice on the first page or initial screen of a display along with the full citation. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works requires prior specific permission and/or a fee. Permissions may be requested from Publications Dept., ACM, Inc., 2 Penn Plaza, Suite 701, New York, NY 10121-0701 USA, fax +1 (212) 869-0481, or permissions@acm.org.
ACM Transactions on Mathematical Software (TOMS): Volume 9 Issue 4, Dec. 1983	Dec-83	NITPACK: An Interactive Tree Package	1) P. W. Gaffney, J. W. Wooter; 2) K. A. Kessel, W. R. McKinney	1) Computer Sciences, P.O. Box Y, Oak Ridge National Laboratory, Oak Ridge, TN; 2) University of Tennessee at Knoxville, Knoxville, TN	1983 ACM 0098-3500/83/1200-0395 $00.00	10.1145/356056.356058	National Lab	1) Computer Sciences, P.O. Box Y, Oak Ridge National Laboratory, Oak Ridge, TN;	No	Oak Ridge National Laboratory is operated by Union Carbide Corporation under Contract W-7405-eng-26 with the U.S. Department of Energy. Authors' addresses: P. W. Gaffney and J. W. Wooten, Computer Sciences, P.O. Box Y, Oak Ridge National Laboratory, Oak Ridge, TN 37830; K. A. Kessel and W. R. McKinney, University ofTennessee at Knoxville, Knoxville, TN 37916
ACM Transactions on Programming Languages and Systems (TOPLAS): Volume 18 Issue 4, July 1996	Jul-96	Compositional parallel programming languages	Ian Foster	Argonne National Lab, Argonne, IL	© 1996 ACM 0164-0925/96/0700–0454 $03.50	10.1145/233561.233565	National Lab	Argonne National Lab, Argonne, IL	No	This work was supported in part by the National Science Foundation’s Center for Research in Parallel Computation under contract NSF CCR-8809615 and by the Mathematical, Information, and Computational Sciences Division subprogram of the Office of Computational and Technology Research, U.S. Department of Energy, under contract W-31-109-Eng-38. Author’s address: Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL 60439; email: foster@mcs.anl.gov. Permission to make digital/hard copy of all or part of this material without fee is granted provided that the copies are not made or distributed for profit or commercial advantage, the ACM copyright/server notice, the title of the publication, and its date appear, and notice is given that copying is by permission of the Association for Computing Machinery, Inc. (ACM). To copy otherwise, to republish, to post on servers, or to redistribute to lists requires prior specific permission and/or a fee.
CC 2016: Proceedings of the 25th International Conference on Compiler Construction	Mar-16	On fusing recursive traversals of K-d trees	1) Samyam Rajbhandari, Jinsung Kim, Louis-Noël Pouchet, P. Sadayappan; 2) Sriram Krishnamoorthy; 3) Fabrice Rastello; 4) Robert J. Harrison	1) Ohio State University, USA; 2) Pacific Northwest National Laboratory, USA; 3) Inria, France; 4) Stony Brook University, USA	© 2016 ACM. 978-1-4503-4241-4/16/03...$15.00	10.1145/2892208.2892228	National Lab	2) Pacific Northwest National Laboratory, USA;	No	This work was supported in part by the U.S. National Science Foundation through award ACI-1440749, and the U.S. Department of Energy’s (DOE) Office of Science, Office of Advanced Scientific Computing Research, under award DE-SC0008844 and DOE Early Career awards 63823. Pacific Northwest National Laboratory is operatedby Battelle for DOE under Contract DE-AC05-76RL01830. Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Permissions@acm.org.
ACM Transactions on Mathematical Software (TOMS): Volume 8 Issue 3, Sept. 1982	Sep-82	Algorithm 587: Two Algorithms for the Linearly Constrained Least Squares Problem	1) Richard J. Hanson; 2) Karen H. Haskell	1) Numerical Mathematics Division 5642, Sandia National Laboratories, Albuquerque, NM; 2) Applied Mathematics Division 2646, Sandia National Laboratories, Albuquerque, NM	© 1982 ACM 0098-3500/82/0900-0323 $00 75	10.1145/356004.356010	National Lab	1) Numerical Mathematics Division 5642, Sandia National Laboratories, Albuquerque, NM; 2) Applied Mathematics Division 2646, Sandia National Laboratories, Albuquerque, NM	No	Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice Is given that copying is by permission of the Association for Computing Machinery. To copy otherwise, or to repubhsh, requires a fee and/or specific permission.
Journal of the ACM (JACM): Volume 26 Issue 2, April 1979	Apr-79	Regenerative Simulation with Internal Controls	1) Donald L. Iglehart; 2) Peter A. W. Lewis	1) Department of Operations Research, Stanford University, Stanford, CA; 2) Naval Postgraduate School, Monterey, CA	© 1979 ACM 0004-5411/79/0400-0271 $00 75	10.1145/322123.322132	Employee	2) Naval Postgraduate School, Monterey, CA	No	Permission to copy without fee all or part of this material granted provided that the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and as date appear, and notice is given that copyright is by permission of the Association for Computing Machinery To copy otherwise, or to republish, requires a fee and/or specific permission This work was supported by Office of Naval Research Contracts N00014-72-C-0086 (NR-047-106), N00014-76- C-0578 (NR-042-343), N00014-78-WR-80035 (NR-024-374), and National Science Foundation Grant MCS75-23607
ACM Transactions on Mathematical Software (TOMS): Volume 39 Issue 1, November 2012	Nov-12	Graph-Based Software Design for Managing Complexity and Enabling Concurrency in Multiphysics PDE Software	1) Patrick K. Notz, Roger P. Pawlowski; 2) James C. Sutherland	1) Sandia National Laboratories; 2) University of Utah	© 2012 ACM 0098-3500/2012/11-ART1 $15.00	10.1145/2382585.2382586	National Lab	1) Sandia National Laboratories;	No	P. K. Notz acknowledges support from the DOE NNSA ASC Integrated Codes effort at Sandia National Laboratories under contract DE-AC04-94AL85000. R. P. Pawlowski acknowledges support from the DOE NNSA ASC Algorithms effort and the DOE Office of Science AMR program at Sandia National Laboratories under contract DE-AC04-94AL85000. J. C. Sutherland acknowledges support form the National Nuclear Security Administration under the Advanced Simulation and Computing program through DOE Research Grant DE-NA0000740 and by the National Science Foundation through grant no. PetaApps-0904631. Sandia is a multiprogram laboratory operated by Sandia Corporation, a Lockheed Martin Company, for the United States Department of Energy’ s National Nuclear Security Administration under contract DE-AC04- 94AL85000. Authors’ addresses: P. K. Notz (corresponding author), Engineering Sciences Center, Sandia National Laboratories, PO Box 5800, MS 0836, Albuquerque, NM 87185-0836; email: pknotz@sandia.gov; R. P. Pawlowski, Computation, Computers and Math, Sandia National Laboratories, PO Box 5800, MS 0836, Albuquerque, NM 87185-0836; J. C. Sutherland, University of Utah, 50 South Central Campus Drive, Room 3290, Salt Lake City, UT 84112-1114. © 2012 Association for Computing Machinery. ACM acknowledges that this contribution was co-authored by a contractor or a affiliate of the U.S. Government. As much, the Government retains a nonexclusive, royaltyfree right to publish or reproduce this article, or to allow others to do so, for Government purposes only. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies show this notice on the first page or initial screen of a display along with the full citation. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works requires prior specific permission and/or a fee. Permission may be requested from Publications Dept., ACM, Inc., 2 Penn Plaza, Suite 701, New York, NY 10121-0701, USA, fax +1 (212) 869-0481, or permissions@acm.org.
ACM Transactions on Sensor Networks (TOSN): Volume 9 Issue 3, May 2013	May-13	Localization with sparse acoustic sensor network using UAVs as information-seeking data mules	1) Daniel J. Klein, Sriram Venkateswaran, João Hespanha, Upamanyu Madhow, Jason T. Isaacs; 2) Jerry Burman; 3) Tien Pham	1) University of California, Santa Barbara, CA; 2) Teledyne Scientific Company, Thousand Oaks, CA; 3) US Army Research Lab, Adelphi, MD	©2013 ACM 1550-4859/2013/05-ART30 $15.00	10.1145/2480730.2480733	Employee	3) US Army Research Lab, Adelphi, MD	No	The work was supported by the Institute for Collaborative Biotechnologies through grant W911NF-09-0001 from the U.S. Army Research Office. The content of the information does not necessarily reflect the position or the policy of the Government, and no official endorsement should be inferred. Authors’ addresses: D. J. Klein (corresponding author), S. Venkateswaran, and J. T. Isaacs, ECE Department, University of California, Santa Barbara, CA 93106-9560; email: djklein@gmail.com; J. Burman, Teledyne Scientific Company, Thousand Oaks, CA 91360; T. Pham, U.S. Army Research Laboratory, Adelphi, MD 20783; J. Hespanha and U. Madhow, ECE Department, University of California, Santa Barbara, CA 93106- 9560. © 2013 Association for Computing Machinery. ACM acknowledges that this contribution was authored or coauthored by a contractor or affiliate of the U.S. Government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies show this notice on the first page or initial screen of a display along with the full citation. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works requires prior specific permission and/or a fee. Permissions may be requested from Publications Dept., ACM, Inc., 2 Penn Plaza, Suite 701, New York, NY 10121-0701 USA, fax +1 (212) 869-0481, or permissions@acm.org.
ACM Transactions on Embedded Computing Systems (TECS): Volume 12 Issue 3, March 2013	Apr-13	Market-based resource allocation for distributed data processing in wireless sensor networks	1) Andrew T. Zimmerman, Jerome P. Lynch; 2) Frank T. Ferrese	1) University of Michigan, Ann Arbor, MI; 2) Naval Surface Warfare Center, Philadelphia, PA	© 2013 ACM 1539-9087/2013/03-ART84 $15.00	10.1145/2442116.2442134	Employee	2) Naval Surface Warfare Center, Philadelphia, PA	No	This work is supported by the U.S. Office of Naval Research (Contracts N00014-05-1-0596 and N00014-09- C0103 granted to J. P. Lynch). Additional support has been provided to A. T. Zimmerman by the National Defense Science and Engineering Graduate Fellowship Program. Authors’ addresses: A. T. Zimmerman and J. P. Lynch, Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, MI, 48109; emails: {atzimmer, jerlynch}@umich.edu; F. T. Ferrese, Naval Surface Warfare Center, Carderock Division, Philadelphia, PA, 19112. © 2013 Association for Computing Machinery. ACM acknowledges that this contribution was authored or coauthored by a contractor or affiliate of the U.S. Government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies show this notice on the first page or initial screen of a display along with the full citation. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works requires prior specific permission and/or a fee. Permissions may be requested from Publications Dept., ACM, Inc., 2 Penn Plaza, Suite 701, New York, NY 10121-0701 USA, fax +1 (212) 869-0481, or permissions@acm.org.
ACM Transactions on Embedded Computing Systems (TECS): Volume 14 Issue 4, December 2015	Dec-15	Safety and Progress for Distributed Cyber-Physical Systems with Unreliable Communication	1) Stanley Bak; 2) Zhenqi Huang, Fardin Abdi Taghi Abad, Marco Caccamo	1) United States Air Force Research Lab, Information Directorate; 2) University of Illinois at Urbana-Champaign	© 2015 ACM 1539-9087/2015/09-ART76 $15.00	10.1145/2739046	Employee	1) United States Air Force Research Lab, Information Directorate;	No	The material presented here is based on work partially supported by the National Science Foundation (NSF) under grant numbers CNS-1302563 and CNS-1219064. Authors’ addresses: S. Bak (corresponding author), 525 Brooks Road, Rome, NY 13440; email: stanleybak@gmail.com; Z. Huang, F. Abdi Taghi Abad, and M. Caccamo, Thomas M. Siebel Center for Computer Science, 201 N Goodwin Ave, Urbana, IL 61801; emails: {zhuang25, abditag2, mcaccamo}@illinois.edu. DISTRIBUTION A. Approved for public release; Distribution unlimited. (Approval AFRL PA #88ABW-2015- 1165, 18 MAR 2015). Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies show this notice on the first page or initial screen of a display along with the full citation. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works requires prior specific permission and/or a fee. Permissions may be requested from Publications Dept., ACM, Inc., 2 Penn Plaza, Suite 701, New York, NY 10121-0701 USA, fax +1 (212) 869-0481, or permissions@acm.org.
Communications of the ACM: Volume 42 Issue 8, Aug. 1999	Aug-99	Visually exploring gigabyte data sets in real time	1) Steve Bryson, David Kenwright, Michael Cox, David Ellsworth; 2) Robert Haimes	1) NASA Ames Research Center, Moffett Field, CA; 2) Massachusetts Institute of Techmology, Cambridge	© 1999 ACM 0002-0782/99/0800 $5.00	10.1145/310930.310977	Employee	1) NASA Ames Research Center, Moffett Field, CA;	No	Most of the work described here was done in the Data Analysis Group of the NASA Ames Research Center’s Numerical Aerospace Simulation (NAS) Division. Work on feature detection was partially sponsored by NAS and by the Army Research Labs. Additional support came from the IBM SUR project and the IBM UUP project. Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee.
ACM Transactions on Algorithms (TALG): Volume 7 Issue 1, November 2010	Nov-10	A faster algorithm for computing the girth of planar and bounded genus graphs	Hristo N. Djidjev	Los Alamos National Laboratory, Los Alamos, NM	© 2010 ACM 1549-6325/2010/11-ART3 $10.00	10.1145/1868237.1868240	National Lab	Los Alamos National Laboratory, Los Alamos, NM	No	This work has been supported by the Department of Energy under contract W-705-ENG-36, by the Los Alamos National Laboratory LDRD-DR Grant “Statistical Physics of Infrastructure Networks”, by the EPA grant R82-5207-01-0, by EPSRC grant GR/M60750, and by RTDF grant 98/99-0140. Author’s address: Los Alamos National Laboratory, Information Sciences, P.O. Box 1663, MS B256, Los Alamos, NM 87545, e-mail: djidjev@lanl.gov. c 2010 Association for computing Machinery. ACM acknowledges that this contribution was authored or co-authored by a contractor or affiliate of the [U.S.] Government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies show this notice on the first page or initial screen of a display along with the full citation. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works requires prior specific permission and/or a fee. Permissions may be requested from Publications Dept., ACM, Inc., 2 Penn Plaza, Suite 701, New York, NY 10121-0701 USA, fax +1 (212) 869-0481, or permissions@acm.org.
Communications of the ACM - Lecture notes in computer science Vol. 174: Volume 28 Issue 4, April 1985	Apr-85	Experimental mathematics: the role of computation in nonlinear science	1) David Campbell, Doyne Farmer; 2) Jim Crutchfield; 3) Erica Jen	1) Los Alamos National Laboratory; 2) Univ. of California, Berkeley; 3) Univ. of Southern California, Los Angeles	© 1985 ACM OOOl-0782/85/0400-0374 750	10.1145/3341.3345	National Lab	1) Los Alamos National Laboratory;	No	Work performed under the auspices of the Department of Energy. Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Association for Computing Machinery. To copy otherwise, or to republish, requires a fee and/or specific permission.
DAC '16: Proceedings of the 53rd Annual Design Automation Conference	Jun-16	A new learning method for inference accuracy, core occupation, and performance co-optimization on TrueNorth chip	1) Wei Wen, Chunpeng Wu, Yandan Wang, Mark Barnell, Hai Li, Yiran Chen; 2) Kent Nixon, Qing Wu,	1) University of Pittsburgh, Pittsburgh, PA; 2) Air Force Research Laboratory Information Directorate	© 2016 ACM. ISBN 978-1-4503-4236-0/16/06…$15.00	10.1145/2897937.2897968	Employee	2) Air Force Research Laboratory Information Directorate	no	Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Permissions@acm.org This work was supported in part by AFRL FA8750-15-1-0176, NSF 1337198 and NSF 1253424. Any opinions, findings and conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect the views of AFRL, DARPA, NSF, or their contractors.
Communications of the ACM: Volume 54 Issue 3, March 2011	Mar-11	Managing time	Peter J. Denning	Distinguished Professor of Computer Science and Director of the Cebrowski Institute for innovation and information superiority at the Naval Postgraduate School in Monterey, CA and is a past president of ACM.	Copyright held by author	10.1145/1897852.1897865	Employee	Distinguished Professor of Computer Science and Director of the Cebrowski Institute for innovation and information superiority at the Naval Postgraduate School in Monterey, CA	No	N/A
Communications of the ACM: Volume 40 Issue 9, Sept. 1997	Sep-97	Medical applications of virtual reality	1) Russ Zajtchuk; 2) Richard M. Satava	1) US Army Medical Research and Material Command, Fort Detrick, Frederick, MD; 2) Yale Univ., New Haven, CT; and Defense Advanced Research Projects Agency, Arlington, VA	© ACM 0002-0782/97/0900 $3.50	10.1145/260750.260768	Employee	1) US Army Medical Research and Material Command, Fort Detrick, Frederick, MD;	No	Permission to make digital/hard copy of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage, the copyright notice, the title of the publication and its date appear, and notice is given that copying is by permission of ACM, Inc. To copy otherwise, to republish, to post on servers, or to redistribute to lists requires prior specific permission and/or a fee.
WSC '97: Proceedings of the 29th conference on Winter simulation	Dec-97	A simulation-based production testbed	1) Albert Jones, Michael Iuliano	1) National Institute of Standards and Technology, Building 220 Room A127, Gaithersburg, MD	N/A	10.1145/268437.268775	Employee	1) National Institute of Standards and Technology, Building 220 Room A127, Gaithersburg, MD	No	Work described in this paper was sponsored by the US Navy Manufacturing Technology program and the NIST Systems Integration of Manufacturing Applications program. Certain commercial software and hardware products are identified in this paper. This does not imply approval or endorsement by NET, nor does it imply that the identified products are necessarily the best available for the purpose.
Communications of the ACM: Volume 60 Issue 1, January 2017	Jan-17	Exponential laws of computing growth	1) Peter J. Denning, Ted G. Lewis	1) Naval Postgraduate School, Monterey, CA	© 2017 ACM 0001-0782/17/01 $15.00	10.1145/2976758	Employee	1) Naval Postgraduate School, Monterey, CA	No	Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and full citation on the first page. Copyright for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or fee. Request permission to publish from permissions@acm.org or fax (212) 869-0481. The Digital Library is published by the Association for Computing Machinery. Copyright © 2017 ACM, Inc.
SAC '15: Proceedings of the 30th Annual ACM Symposium on Applied Computing	Apr-15	Solar irradiance forecasting using multi-layer cloud tracking and numerical weather prediction	1) Jin Xu; 2) Shinjae Yoo, Dantong Yu, Dong Huang, John Heiser, Paul Kalb	1) Stony Brook University; 2) Brookhaven National Lab	Copyright 2015 ACM 978-1-4503-3196-8/15/04	10.1145/2695664.2695812	National Lab	2) Brookhaven National Lab	No	(c) 2014 Association for Computing Machinery. ACM acknowledges that this contribution was authored or co-authored by an employee, contractor or affiliate of the United States government. As such, the United States Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only.
ACM Transactions on Mathematical Software (TOMS): Volume 9 Issue 4, Dec. 1983	Dec-83	Algorithm 610: A Portable FORTRAN Subroutine for Derivatives of the Psi Function	D. E. Amos	Sandia National Laboratories, Albuquerque, NM	1983 ACM 0098-3500/83/1200-0494 $00.00	10.1145/356056.356065	National Lab	Sandia National Laboratories, Albuquerque, NM	No	This work, performed at Sandia National Laboratories, was supported by the U.S. Department of Energy under Contract DE-AC04-76DP00789.
Communications of the ACM: Volume 15 Issue 1, Jan. 1972	Jan-72	Quadratic programming for nonlinear regression	Richard I. Shrager	National Institutes of Health, Bethesda, MD	Copyright © 1972, Association for Computing Machinery, Inc.	10.1145/361237.361248	Employee	National Institutes of Health, Bethesda, MD	No	General permission to republish, but not for profit, all or part of this material is granted, provided that reference is made to this publication, to its date of issue, and to the fact that reprinting privileges were granted by permission of the Association for Computing Machinery
Communications of the ACM: Volume 17 Issue 1, Jan. 1974	Jan-74	A numbering system for combinations	Gary D. Knott	National Institutes of Health, Bethseda, MD	N/A	10.1145/360767.360811	Employee	National Institutes of Health, Bethseda, MD	No	N/A
Communications of the ACM: Volume 30 Issue 1, Jan. 1987	Jan-87	A relational information resource dictionary system	1) Daniel R Dolk; 2) Robert A. Kirsch, II	1) Naval Postgraduate School, Monterey, CA; 2) US Military Academy, West Point, NY	© 1987 ACM OOOl-0782/87/0100-0048 750	10.1145/7885.7888	Employee	1) Naval Postgraduate School, Monterey, CA; 2) US Military Academy, West Point, NY	No	This research was supported by grants from the U.S. Army Military Personnel Center and the Naval Ocean Systems Center. Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Association for Computing Machinery. To copy otherwise, or to republish. requires a fee and/or specific permission.
ICS '14: Proceedings of the 28th ACM international conference on Supercomputing	Jun-14	The future of supercomputing	Marc Snir	Argonne National Laboratory, Argonne, IL, USA	ACM 978-1-4503-2642-1/14/06.	10.1145/2597652.2616585	National Lab	Argonne National Laboratory, Argonne, IL, USA	No	Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage, and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the owner/author(s). Copyright is held by the author/owner(s). This work was supported by the U.S. Department of Energy, Office of Science, Advanced Scientific Computing Research, under Contract DE-AC02- 06CH11357.
JCDL '06: Proceedings of the 6th ACM/IEEE-CS joint conference on Digital libraries	Jun-06	Looking back, looking forward: a metadata standard for LANL's aDORe repository	1) Beth Goldsmith, Frances Knudson	1) Los Alamos National Lab, Los Alamos, NM	Copyright 2006 ACM 1-59593-354-9/06/0006...$5.00.	10.1145/1141753.1141814	National Lab	1) Los Alamos National Lab, Los Alamos, NM	No	Copyright 2006 Association for Computing Machinery. ACM acknowledges that this contribution was authored or co-authored by an employee, contractor or affiliate of the U.S. Government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only.
SC '07: Proceedings of the 2007 ACM/IEEE conference on Supercomputing	Nov-07	A genetic algorithms approach to modeling the performance of memory-bound computations	1) Mustafa M Tikir, Laura Carrington, Allan Snavely; 2) Erich Strohmaier	1) San Diego Supercomputer Center, La Jolla, CA; 2) Lawrence Berkeley National Laboratory, One Cyclotron Road, CA	(c) 2007 ACM 978-1-59593-764-3/07/0011…$5.00	10.1145/1362622.1362686	National Lab	2) Lawrence Berkeley National Laboratory, One Cyclotron Road, CA	No	(c) 2007 Association for Computing Machinery. ACM acknowledges that this contribution was authored or coauthored by a contractor or affiliate of the [U.S.] Government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only. This work was supported in part by the DOE Office of Science through the SciDAC2 award entitled Performance Engineering Research Institute, in part by NSF NGS Award #0406312 entitled Performance Measurement & Modeling of Deep Hierarchy Systems, in part by NSF SCI Award #0516162 entitled The NSF Cyberinfrastructure Evaluation Center, and in part by the DOD High Performance Computing Modernization Program.
CGO '16: Proceedings of the 2016 International Symposium on Code Generation and Optimization	Feb-16	IPAS: intelligent protection against silent output corruption in scientific applications	1) Ignacio Laguna, Martin Schulz, David F. Richards; 2) Jon Calhoun, Luke Olson	1) Lawrence Livermore National Laboratory, USA; 2) University of Illinois at Urbana-Champaign, USA	© 2016 ACM. 978-1-4503-3778-6/16/03...$15.00	10.1145/2854038.2854059	National Lab	1) Lawrence Livermore National Laboratory, USA;	No	Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Permissions@acm.org. This work was performed under the auspices of the U.S. Department of Energy by Lawrence Livermore National Laboratory under contract DEAC52-07NA27344 and supported by Office of Science, Office of Advanced Scientific Computing Research (LLNL-CONF-669696)
Communications of the ACM: Volume 41 Issue 1, Jan. 1998	Jan-98	The case for desktops	1) Samuel L. Grier, Larry W. Bryant	1) United States Air Force Academy, Colorado Springs, CO	© ACM 0002-0782/98/0100 $3.50	10.1145/268092.268120	Employee	United States Air Force Academy, Colorado Springs, CO	no	Col. Samuel L. Grier (griersl.dfcs@usafa.af.mil) is Professor and Head of the Computer Science department at Department of United States Air Force Academy in Colorado Springs, CO. Lt. Col. (retired) Larry W. Bryant (bryantlw.df@usafa.af.mil) is Director of Academic Computing at United States Air Force Academy Colorado Springs, CO.
Communications of the ACM: Volume 58 Issue 6, June 2015	Jun-15	Emergent innovation	Peter J. Denning	Distinguished Professor of Computer Science and Director of the Cebrowski Institute for information innovation at the Naval Postgraduate School in Monterey, CA	Copyright held by author.	10.1145/2753147	Employee	Distinguished Professor of Computer Science and Director of the Cebrowski Institute for information innovation at the Naval Postgraduate School in Monterey, CA	No	The author's views expressed here are not necessarily those of his employer or the U.S. federal government.
Journal of the ACM (JACM): Volume 42 Issue 1, Jan. 1995	Jan-95	Bisimulation can't be traced	1) Bard Bloom; 2) Sorin Istrail; 3) Albert R. Meyer	1) Cornell Univ., Ithaca, NY; 2) Sandia National Labs., Albuquerque, NM; 3) Massachusetts Institute of Technology, Cambridge, MA	© 1995 ACM 0004-541 1/95/0100-0232 $03.50	10.1145/200836.200876	National Lab	2) Sandia National Labs., Albuquerque, NM;	No	The work of B. Bloom was supported by a National Science Foundation (NSF) Fellowship, also NSF Grant No. 85-1 1190-DCR and Office of Naval Research (ONR) grant no. NOO014-83-K-0125. The work of S. Istrail was supported by NSF Grant CCR 88-1174. This work performed at Sandia National Laboratories supported by the U.S. Department of Energy under contract DE-AC04- 76DPO0789. The work of A. R. Meyer was supported by NSF Grant No. 85- 1190-DCR and by ONR grant no. NOO014-83-K-0125. Authors’ addresses: B. Bloom, Cornell University, Department of Computer Science, Upson Hall, Ithaca, NY 14853; email: bardfj?cs.cornell.edu; S. Istrail, Sandia National Laboratories, email: scistra@cs.sandia. gov: and A. R. Meyer, Massachusetts Institute of Technology, Laboratory for Computer Science, Cambridge, MA 02139, email: meyer@theory.lc. mit.edu Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Association for Computing Machinery. To copy otherwise, or to republish, requires a fee and/or specific permission.
ACM Transactions on Mathematical Software (TOMS): Volume 9 Issue 1, March 1983	Mar-83	Algorithm 594: Software for Relative Error Analysis	1) John L. Larson; 2) Mary E. Pasternak; 3) John A. Wisniewski	1) Cray Research, Inc., 1100 Lowater Road, Chippewa Falls, WI; 2) Bell Laboratories, Naperville, IL; 3) Sandia National Laboratories, Division 2113, Albuquerque, NM	1983 ACM 0098-3500/83/0300-0125 $00.00	10.1145/356022.356029	National Lab	3) Sandia National Laboratories, Division 2113, Albuquerque, NM	No	This work was supported by the U.S. Department of Energy and in part by the National Science Foundation Grant US NSF MCS 79-18394.
ROSS '14: Proceedings of the 4th International Workshop on Runtime and Operating Systems for Supercomputers	Jun-14	An evaluation of BitTorrent's performance in HPC environments	1) Matthew G. F. Dosanjh, Patrick G. Bridges; 2) Suzanne M. Kelly, James H. Laros, III, Courtenay T. Vaughan	1) The University of New Mexico, Albuquerque, NM; 2) Sandia National Laboratories, Albuquerque, NM	Copyright 2014 ACM 978-1-4503-2950-7/14/06 ...$15.00.	10.1145/2612262.2612269	National Lab	2) Sandia National Laboratories, Albuquerque, NM	No	This work was supported in part by a contract from Sandia National Laboratories. This work was funded by NNSA’s Advanced Simulation and Computing (ASC) Program. Sandia is a multiprogram laboratory operated by Sandia Corporation, a Lockheed Martin Company, for the United States Department of Energy’s National Nuclear Security Administration under contract DEAC04-94AL85000 © 2014 Association for Computing Machinery. ACM acknowledges that this contribution was authored or co-authored by an employee, contractor or affiliate of the national government of United States. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only.
Communications of the ACM: Volume 41 Issue 3, March 1998	Mar-98	Marketing information on the I-Way: data junkyard or information gold mine?	1) P. K. Kannan; 2) Ai-Mei Chang; 3) Andrew B. Whinston	1) Marketing, University of Maryland; 2) Management at National Defense University, Washington, DC; 3) Management Sciences and Information Systems, University of Texas, Austin	© ACM 0002-0782/98/0300 $3.50	10.1145/272287.272295	Employee	2) Management at National Defense University, Washington, DC;	No	N/A
ICTD '16: Proceedings of the Eighth International Conference on Information and Communication Technologies and Development	Jun-16	C4G BLIS: Health Care Delivery via Iterative Collaborative Design in Resource-constrained Settings	1) Santosh Vempala, Naomi Chopra, Aishwarya Rajagopal; 2) John Nkengasong; 3) Sidney Akuro	1) Georgia Institute of Technology, Atlanta, GA USA; 2) Centers for Disease Control, Atlanta, GA USA; 3) Global Health Sys. Solutions, Limbe, Cameroon	© 2016 ACM. ISBN 978-1-4503-4306-0/16/06. . . $15.00	10.1145/2909609.2909657	Employee	2) Centers for Disease Control, Atlanta, GA USA;	No	ACM acknowledges that this contribution was authored or co-authored by an employee, or contractor of the national government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only. Permission to make digital or hard copies for personal or classroom use is granted. Copies must bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. To copy otherwise, distribute, republish, or post, requires prior specific permission and/or a fee. Request permissions from permissions@acm.org.
CODES '99: Proceedings of the seventh international workshop on Hardware/software codesign	Mar-99	Overhead effects in real-time preemptive schedules	1) David L. Rhodes; 2) Wayne Wolf	1) US Army CECOM/RDEC; 2) Princeton Univ., Princeton, NJ	Copyright ACM 1999 1-58113-132-1/99/05…$5.00	10.1145/301177.301529	Employee	1) US Army CECOM/RDEC;	No	Permission to make digital or hard copues of all or part of this work for personal or classroom use in granted without fee provided that copies are not made or distributed for profit or commercial advantage and that the copies bear this notive and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to list, requires prior specific permission and/or a fee.
SC '03: Proceedings of the 2003 ACM/IEEE conference on Supercomputing	Nov-03	BCS-MPI: A New Approach in the System Software Design for Large-Scale Parallel Computers	1) Juan Fernandez; 2) Eitan Frachtenberg, Fabrizio Petrini	1) Los Alamos National Laboratory, NM, Universidad de Murcia, Spain; 2) Los Alamos National Laboratory, NM	1-58113-695-1/03 $ 17.00 © 2003 ACM	10.1145/1048935.1050207	National Lab	1) Los Alamos National Laboratory, NM, Universidad de Murcia, Spain; 2) Los Alamos National Laboratory, NM	No	© 2003 Association for Computing Machinery. ACM acknowledges that this contribution was authored or co-authored by a contractor or affiliate of the U.S. Government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only. This work was supported by the U.S. Department of Energy through the project LDRD-ER 2001034ER ”Resource Utilization and Parallel Program Development with Buffered Coscheduling” and Los Alamos National Laboratory contract W-7405-ENG-36.
ACM Transactions on Knowledge Discovery from Data (TKDD) - TKDD Special Issue (SIGKDD'13): Volume 9 Issue 3, April 2015	Apr-15	A Space-Efficient Streaming Algorithm for Estimating Transitivity and Triangle Counts Using the Birthday Paradox	1) Madhav Jha, C. Seshadhri, Ali Pinar	1) Sandia National Laboratories	© 2015 ACM 1556-4681/2015/02-ART15 $15.00	10.1145/2700395	National Lab	1) Sandia National Laboratories	No	This work was funded by the GRAPHS program under DARPA, the U.S. Department of Energy’s Mathematics for Complex, Distributed, Interconnected Systems Project, and Sandia’s Laboratory Directed Research and Development (LDRD) program. Sandia National Laboratories is a multiprogram laboratory managed and operated by Sandia Corporation, a wholly owned subsidiary of Lockheed Martin Corporation, for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-AC04-94AL85000. Authors’ addresses: emails: {mjha, scomand, apinar}@sandia.gov. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies show this notice on the first page or initial screen of a display along with the full citation. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works requires prior specific permission and/or a fee. Permissions may be requested from Publications Dept., ACM, Inc., 2 Penn Plaza, Suite 701, New York, NY 10121-0701 USA, fax +1 (212) 869-0481, or permissions@acm.org.
Communications of the ACM - The disappearing computer: Volume 48 Issue 3, March 2005	Mar-05	Why computer scientists should attend hacker conferences	Gregory Conti	The United States Military Academy, West Point, NY and the Georgia Institute of Technology	©2005 ACM 0001-0782/05/0300 $5.00	10.1145/1047671.1047694	Unsure	The United States Military Academy, West Point, NY and the Georgia Institute of Technology	No	The views expressed here are those of the author and do not reflect the official policy or position of the United States Military Academy, the Department of the Army, the Department of Defense, or the U.S. Government. Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. The Digital Library is published by the Association for Computing Machinery. Copyright © 2005 ACM, Inc.
AVI '00: Proceedings of the working conference on Advanced visual interfaces	May-00	Guidelines for using multiple views in information visualization	1) Michelle Q. Wang Baldonado, Allison Woodruff; 2) Allan Kuchinsky	1) Xerox Pale Alto Research Center, 3333 Coyote Hill Road, Pale Alto, CA; 2) Hewlett Packard Laboratories, 1501 Page Mill Road, Pale Alto, CA	N/A	10.1145/345513.345271	Not Govt	No government agencies appear in the author affiliations	No	N/A
ACM Transactions on Mathematical Software (TOMS): Volume 23 Issue 1, March 1997	Mar-97	Algorithm 765: STENMIN—a software package for large, sparse unconstrained optimization using tensor methods	Ali Bouaricha	Argonne National Lab, Argonne, IL	© 1997 ACM 0098-3500/97/0300–0081 $03.50	10.1145/244768.244788	National Lab	Argonne National Lab, Argonne, IL	No	This work was supported in part by the Office of Scientific Computing, U.S. Department of Energy, under contract W-31-109-Eng-38. Part of this work was performed while the author was a research associate at CERFACS (Centre Europe´en de Recherche et de Formation Avance´e en Calcul Scientifique, Toulouse, France). Author’s address: SILVACO International, 4701 Patrick Henry Drive, Building 2, Santa Clara, CA 95054; email: ali@silvaco.com. Permission to make digital/hard copy of part or all of this work for personal or classroom use is granted without fee provided that the copies are not made or distributed for profit or commercial advantage, the copyright notice, the title of the publication, and its date appear, and notice is given that copying is by permission of the ACM, Inc. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee
Communications of the ACM: Volume 41 Issue 6, June 1998	Jun-88	The virtual reality modeling language and Java	Don Brutzman	Naval Postgraduate School, Monterey, CA; and VRML Consortium	© 1998 ACM 0002-0782/98/0600 $5.00	10.1145/276609.276620	Unsure	Naval Postgraduate School, Monterey, CA; and VRML Consortium (Don Brutzman (brutzman@nps.navy.mil) is an assistant professor at the Naval Postgraduate School in Monterey, Calif., and the technology vice president for the VRML Consortium.)	No	Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee.
Communications of the ACM - Wireless sensor networks: Volume 47 Issue 6, June 2004	Jun-04	A paradigm shift in computing and IT education	1) Hal Berghel; 2) David L. Sallach	1) University of Nevada, Las Vegas; 2) Argonne National Laboratory in Argonne, IL	©2004 ACM 0002-0782/04/0600 $5.00	10.1145/990680.990685	National Lab	2) Argonne National Laboratory in Argonne, IL	No	Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. The Digital Library is published by the Association for Computing Machinery. Copyright © 2004 ACM, Inc.
SC '07: Proceedings of the 2007 ACM/IEEE conference on Supercomputing	Nov-07	Investigation of leading HPC I/O performance using a scientific-application derived benchmark	1) Julian Borrill, Leonid Oliker, John Shalf, Hongzhang Shan	1) Lawrence Berkeley National Laboratory, Berkeley, CA	(c) 2007 ACM 978-1-59593-764-3/07/0011 ...$5.00.	10.1145/1362622.1362636	National Lab	1) Lawrence Berkeley National Laboratory, Berkeley, CA	No	(c) 2007 Association for Computing Machinery. ACM acknowledges that this contribution was authored or co-authored by a contractor or affiliate of the [U.S.] Government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce tor to allow others to do so, for Government purposes only. All authors from LBNL were supported by the Office of Advanced Scientific Computing Research in the Department of Energy Office of Science under contract number DE-AC02-05CH11231.
SC '03: Proceedings of the 2003 ACM/IEEE conference on Supercomputing	Nov-03	Parallel Particle-In-Cell Simulation of Colliding Beams in High Energy Accelerators	1) Ji Qiang, Miguel A. Furman, Robert D. Ryne	1) Lawrence Berkeley National Laboratory, Berkeley, CA	1-58113-695-1/03 $ 17.00 © 2003 ACM	10.1145/1048935.1050180	National Lab	1) Lawrence Berkeley National Laboratory, Berkeley, CA	No	Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage, and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. This research used resources of the National Energy Research Scientific Computing Center, which is supported by the Office of Science of the U.S. Department of Energy (US DOE/SC) under Contract No. DE-AC03-76SF00098, and the resources of the Center for Computational Sciences at Oak Ridge National Laboratory. Some of the computational work for this project was done on the LBL/NERSC Alvarez Cluster, an 80 node Pentium III Myrinet cluster. This work was performed under the auspices of a Scientific Discovery through Advanced Computing project, “Advanced Computing for 21st Century Accelerator Science and Technology,” which is supported by the US DOE/SC Office of High Energy and Nuclear Physics and the Office of Advanced Scientific Computing Research.
Communications of the ACM: Volume 39 Issue 11, Nov. 1996	Nov-96	The KDD process for extracting useful knowledge from volumes of data	1) Usama Fayyad; 2) Gregory Piatetsky-Shapiro; 3) Padhraic Smyth	1) Jet Propulsion Laboratory, California Institute of Technology; 2) GTE Laboratories; 3) University of California, Irvine and Jet Propulsion Laboratory, California Institute of Technology	© ACM 0002-0782/96/1100 $3.50	10.1145/240455.240464	Employee	1) Jet Propulsion Laboratory, California Institute of Technology;	no	Permission to make digital/hard copy of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage, the copyright notice, the title of the publication and its date appear, and notice is given that copying is by permission of ACM, Inc. To copy otherwise, to republish, to post on servers, or to redistribute to lists requires prior specific permission and/or a fee.
JCDL '04: Proceedings of the 4th ACM/IEEE-CS joint conference on Digital libraries	Jun-04	Toolkits for visualizing co-authorship graph	1) Xiaoming Liu, Herbert Van de Sompel, Jeremy Hussell, Rick Luce, Linn Marks; 2) Johan Bollen, Michael L. Nelson,	1) Los Alamos National Laboratory, Los Alamos, NM; 2) Old Dominion University, Norfolk, VA	Copyright is held by the author/owner.	10.1145/996350.996470	National Lab	1) Los Alamos National Laboratory, Los Alamos, NM	No	N/A
ACM Transactions on Mathematical Software (TOMS): Volume 30 Issue 4, December 2004	Dec-04	Computation of complex Airy functions and their zeros using asymptotics and the differential equation	1) B. R. Fabijonas; 2) D. W. Lozier; 3) F. W. J. Olver	1) Southern Methodist University, Dallas, TX; 2) National Institute of Standards and Technology, Gaithersburg, MD; 3) University of Maryland, College Park, MD	© 2004 ACM 0098-3500/04/1200-0471 $5.00	10.1145/1039813.1039818	Employee	2) National Institute of Standards and Technology, Gaithersburg, MD	No	This work began while the first author was a National Research Council Postdoctoral Fellow in the Information Technology Laboratory at NIST and was funded accordingly. This research is based in part upon activities supported by the National Science Foundation under Agreement No. 9980036. Any opinions, findings, and conclusions or recommendations are those of the authors and do not necessarily reflect the views of the National Science Foundation. Certain commercial equipment and software are identified in this article to foster understanding. Such identification does not imply recommendation or endorsement by the National Institute of Standards and Technology, nor does it imply that the equipment or software identified are necessarily the best available for the purpose. Authors’ addresses: B. R. Fabijonas, Department of Mathematics, Southern Methodist University, Dallas, TX 75275-0156; email: bfabi@smu.edu; D.W. Lozier, Mathematical and Computational Sciences Division, National Institute of Science and Technology, 100 Bureau Drive Mailstop 8910, Gaithersburg, MD 20899-8910; email: daniel.lozier@nist.gov; F. W. J. Olver, Institute for Physical Science and Technology, University of Maryland, College Park, MD 20742-2431. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or direct commercial advantage and that copies show this notice on the first page or initial screen of a display along with the full citation. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works requires prior specific permission and/or a fee. Permissions may be requested from Publications Dept., ACM, Inc., 1515 Broadway, New York, NY 10036 USA, fax: +1 (212) 869-0481, or permissions@acm.org
Communications of the ACM: Volume 44 Issue 5, May 2001	May-01	Principles for digital library development	1) Alexa T. McCray, Marie E. Gallagher	1) National Library of Medicine, Bethesda, MD	©2001 ACM 0002-0782/01/0500 $5.00	10.1145/374308.374339	Employee	1) National Library of Medicine, Bethesda, MD; Alexa T. McCray (mccray@nlm.nih.gov) is the director of the Lister Hill National Center for Biomedical Communications, National Library of Medicine, Bethesda, MD. Marie E. Gallagher (gallagher@nlm.nih.gov) is a computer scientist at the Lister Hill National Center for Biomedical Communications, National Library of Medicine, Bethesda, MD.	No	Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. The Digital Library is published by the Association for Computing Machinery. Copyright © 2001 ACM, Inc.
HRI '08: Proceedings of the 3rd ACM/IEEE international conference on Human robot interaction	Mar-08	How training and experience affect the benefits of autonomy in a dirty-bomb experiment	1) David J. Bruemmer, Curtis W. Nielsen, David I. Gertman	1) Idaho National Laboratory, Idaho Falls, ID, USA	Copyright 2008 ACM 978-1-60558-017-3/08/03...$5.00.	10.1145/1349822.1349844	National Lab	1) Idaho National Laboratory, Idaho Falls, ID, USA	No	Copyright 2008 Association for Computing Machinery. ACM acknowledges that this contribution was authored or co-authored by an employee, contractor or affiliate of the U.S. Government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only.
Communications of the ACM: Volume 37 Issue 8, Aug. 1994	Aug-94	Internet technology	Barry M. Leiner	Advanced Research Projects Agency, Arlington, VA and Universities Space Research Association	N/A	10.1145/179606.179611	Unsure	Barry M. Leiner is program manager at the Advanced Research Projects Agency in Arlington, Virginia and senior scientist with the Universities Space Research Association.	No	N/A
Communications of the ACM: Volume 21 Issue 10, Oct. 1978	Oct-78	Packed scatter tables	Gordon Lyon	National Bureau of Standards, Washington, DC	© 1978 ACM 0001-0782/78/1000-0857 $00.75	10.1145/359619.359633	Employee	National Bureau of Standards, Washington, DC; Author's address: U.S. Department of Commerce, National Bureau of Standards, Computer Science Section, A367-Tech, Washington, D.C. 20234.	No	Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Association for Computing Machinery. To copy otherwise, or to republish, requires a fee and/or specific permission.
ACM Transactions on Mathematical Software (TOMS): Volume 19 Issue 3, Sept. 1993	Sep-93	Algorithm 719: Multiprecision translation and execution of FORTRAN programs	David H. Bailey	NASA Ames Research Center	© 1993 ACM 0098 -3500/93/0900–0288 $0150	10.1145/155743.155767	Employee	Author’s address: NASA Applied Research Branch, NASA Ames Research Center, Moffett Field, CA 94035 email:dbailey@nas.nasa.gov.	No	Permission to copy without fee all or part of this material is granted provided that the copies are not made or dmtributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given that copying is by permmsion of the Association for Computing Machinery. To copy otherwise, or to republish, requires a fee and/or specific permission.
Communications of the ACM: Volume 59 Issue 5, May 2016	May-16	The challenges of partially automated driving	1) Stephen M. Casner; 2) Edwin L. Hutchins, Don Norman	1) NASA Ames Research Center, Moffett Field, CA; 2) University of California, San Diego	Copyright held by the authors. Publication rights licensed to ACM.	10.1145/2830565	Employee	Stephen M. Casner (stephen.casner@nasa.gov) is a research psychologist in the Human Systems Integration Division at NASA Ames Research Center, Moffett Field, CA.	No	The Digital Library is published by the Association for Computing Machinery. Copyright © 2016 ACM, Inc.
Communications of the ACM: Volume 56 Issue 2, February 2013	Feb-13	The value of microprocessor designs	1) Ana Aizcorbe; 2) Samuel Kortum; 3) Unni Pillai	1) Bureau of Economic Analysis, Washington, D.C.; 2) Yale University in New Haven, CT; 3) State University of New York at Albany	Copyright held by author.	10.1145/2408776.2408788	Employee	Ana Aizcorbe (ana.aizcorbe@bea.gov) is Chief Economist, Bureau of Economic Analysis, U.S. Department of Commerce in Washington, D.C.	No	The opinions expressed in this column are those of the authors and do not represent those of the U.S. Bureau of Economic Analysis.
Communications of the ACM: Volume 56 Issue 3, March 2013	Mar-13	Moods, wicked problems, and learning	Peter J. Denning	Distinguished Professor of Computer Science and Director of the Cebrowski Institute for information innovation at the Naval Postgraduate School in Monterey, CA	Copyright held by author.	10.1145/2428556.2428566	Employee	Distinguished Professor of Computer Science and Director of the Cebrowski Institute for information innovation at the Naval Postgraduate School in Monterey, CA	No	The Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Communications of the ACM - Personal information management: Volume 49 Issue 1, January 2006	Jan-06	How to think about security failures	Scott Campbell	Lawrence Berkeley National Laboratory, Berkeley, CA	©2006 ACM 0001-0782/06/0100 $5.00	10.1145/1107458.1107482	National Lab	Scott Campbell (scampbell@lbl.gov) is a computer security analyst at the National Energy Research Scientific Computing Center at Lawrence Berkeley National Laboratory, Berkeley, CA.	No	Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. The Digital Library is published by the Association for Computing Machinery. Copyright © 2006 ACM, Inc.
Communications of the ACM: Volume 32 Issue 8, Aug. 1989	Aug-89	ACM forum	Robert L. Ashenhurst	N/A	N/A	10.1145/65971.315981	Not Govt	No government agencies appear in the author affiliations. The author attributed is merely the editor of this section and did not contribute to the authoring of any of the sections	No	N/A
Communications of the ACM: Volume 35 Issue 8, Aug. 1992	Aug-92	A performance comparison of four supercomputers	1) Margaret L. Simmons, Harvey J. Wasserman, Olaf M. Lubeck; 2) Christopher Eoyang; 3) Raul Mendez; 4) Hiroo Harada, Misako Ishiguro	1) Los Alamos National Lab, Los Alamos, NM; 2) INSEAD, Paris, France; 3) Institute for Supercomputing Research, Tokyo, Japan; 4) Japan Atomic Energy Research Institute, Ibaraki, Japan	©ACM0002-0782/92/0800-116 $1.50	10.1145/135226.135234	National Lab	1) Los Alamos National Lab, Los Alamos, NM;	No	Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Association for Computing Machinery. To copy otherwise, or to republish, requires a fee and/or specific permission.
Communications of the ACM: Volume 30 Issue 5, May 1987	May-87	Distribution of mathematical software via electronic mail	1) Jack J Dongarra; 2) Eric Grosse	1) Argonne National Laboratory, Argonne, IL; 2) AT&T Bell Laboratories, Murray Hill, NJ	© 1987 ACM 0001-07&l2/87/0500-0403 750	10.1145/22899.22904	National Lab	1) Argonne National Laboratory, Argonne, IL;	No	This work was supported in part by the National Science Foundation under Agreement DCR-8419437. Any opinions. findings. conclusions. and recommendations expressed in this publication are those of the authors and do not necessarily reflect the views of the National Science Foundation. Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Association for Computing Machinery. To copy otherwise, or to republish, requires a fee and/or specific permission.
ACM Transactions on Computer Systems (TOCS): Volume 7 Issue 1, Feb. 1989	Feb-89	Efficient (stack) algorithms for analysis of write-back and sector memories	1) James G. Thompson; 2) Alan Jay Smith	1) U.S. Air Force, Washington, DC; 2) Univ. of California, Berkeley	© 1989 ACM 0734-2071/89/0200-0078 $01.50	10.1145/58564.59296	Employee	Authors’ current addresses: Lt. Col. J. G. Thompson, Joint Data Systems Support Center (JDSSC/CBlO), The Pentagon, Washington, DC 20301-7010;	No	The material presented here is based on research supported in part by the National Science Foundation under grants CCR-8202591 and MIP-8713274, by NASA under consortium agreement NCA2-128, by the State of California under the MICRO program, and by the International Business Machines Corporation, Digital Equipment Corporation, Hewlett-Packard, and Signetics. Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Association for Computing Machinery. To copy otherwise, or to republish, requires a fee and/or specific permission.
ACM Transactions on Mathematical Software (TOMS): Volume 30 Issue 1, March 2004	Mar-04	Vector reduction/transformation operators	1) Roscoe A. Bartlett, Bart G. Van Bloemen Waanders, Michael A. Heroux	1) Sandia National Laboratories, Albuquerque, NM	© 2004 ACM 0098-3500/04/0300-0062 $5.00	10.1145/974781.974785	National Lab	Authors’ address: Sandia National Laboratories, Albuquerque, NM 87185; email: {rabart;bartv}@sandia.gov; mheroux@cs.sandia.gov	No	Sandia is a multiprogram laboratory operated by Sandia Corporation, a Lockheed-Martin Company, for the United States Department of Energy under Contract DE-AC04-94AL85000. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or direct commercial advantage and that copies show this notice on the first page or initial screen of a display along with the full citation. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works requires prior specific permission and/or a fee. Permissions may be requested from Publications Dept., ACM, Inc., 1515 Broadway, New York, NY 10036 USA, fax: +1 (212) 869-0481, or permissions@acm.org.
Communications of the ACM: Volume 35 Issue 11, Nov. 1992	Nov-92	Ada 9X project management	Chris Anderson	Ada 9X project manager, chief of software technology at the Airforce Phillips Laboratory in Albuquerque, N.M., and a vice president of the American Institute of Aeronautics and Astronautics.	N/A	10.1145/138844.138851	Employee	CHRIS ANDERSON is the Ada 9X project manager, chief of software technology at the Airforce Phillips Laboratory in Albuquerque, N.M., and a vice president of the American Institute of Aeronautics and Astronautics. Author's Present Address: PL/VTET; Kirtland Air Force Base, NM 87117-6008; Ada9X@plk.af.rail	No	N/A
ACM Transactions on Mathematical Software (TOMS): Volume 34 Issue 1, January 2008	Jan-08	A grid-free abstraction of the Navier-Stokes equations in Fortran 95/2003	1) Damian W. I. Rouson, Robert Rosenberg; 2) Xiaofeng Xu; 3) Irene Moulitsas, Stavros C. Kassinos	1) U.S. Naval Research Laboratory, Washington, DC; 2) University of Maryland, College Park, Nova, MI; 3) University of Cyprus, Nicosia, Cyprus	© 2008 ACM 0098-3500/2008/01-ART2 $5.00	10.1145/1322436.1322438	Employee	Authors’ addresses: D. Rouson, R. Rosenberg, U.S. Naval Research Laboratory, 4555 Overlook Av. SW, Washington, DC 20375; email: damian@rouson.net;	No	D. Rouson acknowledges support from the Office of Naval Research (Contract 61-8804065). X. Xu acknowledges support from the U.S. Naval Research Laboratory (Grant N00173-05-G020) under the direction of Prof. Andre Marshall at the University of Maryland, College Park. I. Moulitsas and S. Kasinos acknowledge support from the European Commission Marie Curie ToK-DEV grant (Contract MTKD-CT-2004-014199) c 2008 Association for Computing Machinery. ACM acknowledges that this contribution was authored or coauthored by a contractor or affiliate of the U.S. Goverment. As such, the Goverment retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Goverment purposes only. Permission to make digital or hard copies part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or direct commercial advantage and that copies show this notice on the first page or initial screen of a display along with the full citation. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works requires prior specific permission and/or a fee. Permissions may be requested from the Publications Dept., ACM, Inc., 2 Penn Plaza, Suite 701, New York, NY 10121-0701 USA, fax +1 (212) 869-0481, or permissions@acm.org.
ACM Transactions on Sensor Networks (TOSN): Volume 10 Issue 3, April 2014	Apr-04	Efficient Solutions Framework for Optimal Multitask Resource Assignments for Data Fusion in Wireless Sensor Networks	1) Srikanth Hariharanl; 2) Chatschik Bisdikian; 3) Lance M. Kaplan, Tien Pham	1) AT&T Labs; 2) IBM T.J. Watson Research; 3) Army Research Laboratory	© 2014 ACM 1550-4859/2014/04-ART48 $15.00	10.1145/2594768	Employee	3) Army Research Laboratory	No	This research was sponsored by U.S. Army Research Laboratory and was accomplished under agreement no. W911NF-06-3-0002-P00013, and ARO MURI award no. W911NF-07-10376. The views and conclusions contained in this document are those of the authors and should not be interpreted as representing the official policies, either expressed or implied, of the U.S. Army Research Laboratory, or the U.S. Government. The U.S. Government is authorized to reproduce and distribute reprints for Government purposes notwithstanding any copyright notation hereon. c 2014 Association for Computing Machinery. ACM acknowledges that this contribution was authored or coauthoredby a contractor or affiliate of the U.S. Government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only. Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from permissions@acm.org.
ACM Transactions on Mathematical Software (TOMS): Volume 18 Issue 3, Sept. 1992	Sep-92	Algorithm 708: Significant digit computation of the incomplete beta function ratios	1) Armido R. Didonato, Alfred H. Morris, Jr.	1) U.S. Naval Surface Warfare Center	© 1992 ACM 0098-3500/92/0900-0360 $01.50	10.1145/131766.131776	Employee	Authors’ address: U.S. Naval Surface Warfare Center, Dahlgren, VA 22448	No	Permission to copy without fee all or part of this material is granted provided that the copies arenot made or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Association for Computing Machinery. To copy otherwise, or to republish, requires a fee and/or specific permission
VEE '12: Proceedings of the 8th ACM SIGPLAN/SIGOPS conference on Virtual Execution Environments	Mar-12	V2E: combining hardware virtualization and softwareemulation for transparent and extensible malware analysis	1) Lok-Kwong Yan; 2) Manjukumar Jayachandra, Mu Zhang, Heng Yin	1) Syracuse University & Air Force Research Laboratory, Syracuse, NY, USA; 2) Syracuse University, Syracuse, NY, USA	Copyright © 2012 ACM 978-1-4503-1175-5/12/03. . . $10.00	10.1145/2365864.2151053	Unsure	1) Syracuse University & Air Force Research Laboratory, Syracuse, NY, USA;	No	Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. This work is supported in part by the US National Science Foundation NSF under Grants #1018217 and #1054605. Any opinions, findings, and conclusions made in this material are those of the authors and do not necessarily reflect the views of the NSF or the Air Force Research Laboratory.
ACM Transactions on Mathematical Software (TOMS): Volume 9 Issue 4, Dec. 1983	Dec-83	Uniform Asymptotic Expansions for Exponential Integrals E_n(x) and Bickley Functions Kin (x)	D. E. Amos	Sandia National Laboratories, Albuquerque, NM	1983 ACM 0098-3500/83/1200-0467 $00.00	10.1145/356056.356063	National Lab	Author's address: Sandia National Laboratories, Albuquerque, NM 87185.	No	This work, performed at Sandia National Laboratories (a U.S. Department of Energy facility), was supported by the U.S. Department of Energy under Contract DE-AC04-76DP00789.
DAC '15: Proceedings of the 52nd Annual Design Automation Conference	Jun-15	Cloning your mind: security challenges in cognitive system designs and their solutions	1) Beiye Liu, Chunpeng Wu, Hai Li, Yiran Chen; 2) Qing Wu, Mark Barnell; 3) Qinru Qiu	1) University of Pittsburgh, Pittsburgh, PA; 2) Air Force Research Laboratory, Rome, NY; 3) Syracuse University, Syracuse, NY	Copyright is held by the owner/author(s). Publication rights licensed to ACM.	10.1145/2744769.2747915	Employee	2) Air Force Research Laboratory, Rome, NY;	No	Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Permissions@acm.org. This work was supported in part by AFRL FA8750-15-2-0048, NSF CNS-1116171, NSF CNS-1342566, NSF CNS-1253424 and HP Lab Innovation Research Program. Any opinions, findings and conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect the views of grant agencies or their contractors.
Communications of the ACM: Volume 40 Issue 2, Feb. 1997	Feb-97	Globalizing business, education, culture through the Internet	1) Nabil Adam; 2) Baruch Awerbuch; 3) Jacob Slonim; 4) Peter Wegner; 5) Yelena Yesha	1) professor of computer information systems and Director of The Center for Information Management, Integration, and Connectivity in Rutgers University; 2) professor of computer science in Johns Hopkins University; 3) adjunct professor on the faculty of mathematics in the Department of Computer Science in the University of Waterloo, Ontario, Canada; 4) professor of computer science in Brown University; 5) professor of computer science in the University of Maryland, Baltimore County, and Director of NASA’s Center of Excellence in Space Data and Information Sciences.	Copyright held by the authors	10.1145/253671.253748	Unsure	5) professor of computer science in the University of Maryland, Baltimore County, and Director of NASA’s Center of Excellence in Space Data and Information Sciences.	No	N/A
ACM Transactions on Mathematical Software (TOMS): Volume 21 Issue 1, March 1995	Mar-95	Algorithm 740: Fortran subroutines to compute improved incomplete Cholesky factorizations	1) Mark T. Jones, Paul E. Plassmann	1) Argonne National Laboratory	© 1995 ACM 0098-3500/95/0300-0018 $03.50	10.1145/200979.200986	National Lab	Authors’ address: Math and Computer Science Division, Argonne National Lab. 9700 South Cass Avenue, Argonne, IL 60439-4801; email: pIassman@mcs,anl. gov; jones@cs.utk.edu,	No	This work was supported by the Applied Mathematical Sciences subprogram of the Office of Energy Research, U.S. Department of Energy, under contract W-3 l-109 -Eng-38. Permssion to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Association for Computing Machinery To copy otherwise, or to republish, requires a fee and/or specific permission.
SC '13: Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis	Nov-13	2HOT: an improved parallel hashed oct-tree n-body algorithm for cosmological simulation	Michael S. Warren	Los Alamos National Laboratory	Copyright is held by the owner/author(s).	10.1145/2503210.2503220	National Lab	Theoretical Division, Los Alamos National Laboratory	No	Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for thirdparty components of this work must be honored. For all other uses, contact the Owner/Author
ACM Transactions on Programming Languages and Systems (TOPLAS): Volume 29 Issue 2, April 2007	Apr-07	METRIC: Memory tracing via dynamic binary rewriting to identify cache inefficiencies	1) Jaydeep Marathe, Frank Mueller; 2) Tushar Mohan; 3) Sally A. Mckee; 4) Bronis R. De Supinski, Andy Yoo	1) North Carolina State University, Raleigh, NC; 2) IBM India Research Lab, Hauz Khas, New Delhi; 3) Cornell University, Ithaca, NY; 4) Lawrence Livermore National Laboratory, Livermore, CA	© 2007 ACM 0164-0925/2007/04-ART12 $5.00.	10.1145/1216374.1216380	National Lab	Author Addresses: B. R. de Supinski, A. Yoo, Lawrence Livermore National Laboratory, Center for Applied Scientific Computing, L-557, Livermore, CA 94551.	No	A preliminary version of this article appeared in the International Symposium on Code Generation and Optimization, 2003 [Marathe et al. 2003]. F. Mueller was supported in part by the U.S. Department of Energy by the University of California, Lawrence Livermore National Laboratory under subcontracts Nos. B518219 and B540203, NFS CAREER CCR-0237570, CNS-0406305, CCF- 0429653; S. A. McKee was supported in part by LLNL LDRD 01-ERD-043, NSF CCR-0073532; B.R. de Supinkski and A Yoo were supported in part to perform this research under the auspices of the U.S. Department of Energy by University of California Lawrence Livermore National Laboratory under Contract W-7405-Eng-48, UCRL-JRNL-22545. This research was supported in part by the National Science Foundation through the San Diego Supercomputer Center under Grant CCR- 0237570 using the DataStar computing system. T. Mohan’s contribution was in the course of his thesis at the University of Utah. This article does not necessarily reflect or represent the views of IBM, Inc. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or direct commercial advantage and that copies show this notice on the first page or initial screen of a display along with the full citation. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works requires prior specific permission and/or a fee. Permissions may be requested from Publications Dept., ACM, Inc., 2 Penn Plaza, Suite 701, New York, NY 10121-0701 USA, fax +1 (212) 869-0481, or permissions@acm.org.
ACM Computing Surveys (CSUR): Volume 26 Issue 3, Sept. 1994	Sep-94	A taxonomy of computer program security flaws	1) Carl E. Landwehr, Alan R. Bull, John P. McDermott, William S. Choi	1) Naval Research Lab, Washington, DC	N/A	10.1145/185403.185412	National Lab	Naval Research Lab, Washington, DC	No	N/A
OOPSLA '96: Proceedings of the 11th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications	Oct-96	A situated evaluation of the Object Management Group's (OMG) Object Management Architecture (OMA)	1) Evan Wallace; 2) Kurt C. Wallnau	1) National Institute of Standards and Technology, Manufacturing Engineering Laboratory, Gaithersburg, MD; 2) Software Engineering Institute, Carnegie Mellon University, Pittsburgh, PA	© 1996 ACM 0-89791-788-x/96/001 0...$3.50	10.1145/236338.236353	Employee	1) National Institute of Standards and Technology, Manufacturing Engineering Laboratory, Gaithersburg, MD;	No	permission to make digital/hard copy of part or all of this work for Personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage, the copyright notice the title of the publication and its date appear, and notice is given thatcopying is by permission of ACM, Inc. To COPY othewise, to republish to post on severs, or to redistribute to lists, requires prior specific Permission and/or a fee.
Communications of the ACM - Two decades of the language-action perspective: Volume 49 Issue 5, May 2006	May-06	Innovation as language action	1) Peter J. Denning; 2) Robert Dunham	1) Naval Postgraduate School in Monterey, CA; 2) Enterprise Performance, Inc.	©2006 ACM 0001-0782/06/0500 $5.00	10.1145/1125944.1125974	Employee	Peter J. Denning (pjd@nps.edu) is the director of the Cebrowski Institute for information and innovation and superiority at the Naval Postgraduate School in Monterey, CA, and is a past president of ACM.	No	Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. The Digital Library is published by the Association for Computing Machinery. Copyright © 2006 ACM, Inc.
MEMSYS '16: Proceedings of the Second International Symposium on Memory Systems	Oct-16	Multi-Level Memory Policies: What You Add Is More Important Than What You Take Out	1) Simon D. Hammond, Arun F. Rodrigues, Gwendolyn R. Voskuilen	1) Center for Computing Research, Sandia National Laboratories, Albuquerque, NM, USA	© 2016 Copyright held by the owner/author(s). Publication rights licensed to ACM	10.1145/2989081.2989117	National Lab	Center for Computing Research, Sandia National Laboratories, Albuquerque, NM, USA	No	Sandia is a multiprogram laboratory operated by Sandia Corporation, a Lockheed Martin Company, for the United States Department of Energy’s National Nuclear Security Administration under contract DE-AC04-94AL85000. Publication rights licensed to ACM. ACM acknowledges that this contribution was authored or co-authored by an employee, contractor or affiliate o f t he U nited States government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only.
ASPLOS '15: Proceedings of the Twentieth International Conference on Architectural Support for Programming Languages and Operating Systems	Mar-15	Memory Errors in Modern Systems: The Good, The Bad, and The Ugly	1) Vilas Sridharan; 2) Nathan DeBardeleben, Sean Blanchard; 3) Kurt B. Ferreira, Jon Stearley; 4) John Shalf; 5) Sudhanva Gurumurthi	1) AMD, Inc., Boxborough, MA, USA; 2) Los Alamos National Laboratory, Los Alamos, NM, USA; 3) Sandia National Laboratories, Albuquerque, NM, USA; 4) Lawrence Berkeley National Laboratory, Berkeley, CA, USA; 5) Advanced Micro Devices, Inc., Boxborough, MA, USA	Copyright © 2015 ACM 978-1-4503-2835-7/15/03. . . $15.00.	10.1145/2694344.2694348	National Lab	2) Los Alamos National Laboratory, Los Alamos, NM, USA; 3) Sandia National Laboratories, Albuquerque, NM, USA; 4) Lawrence Berkeley National Laboratory, Berkeley, CA, USA;	No	A portion of this work was performed at the Ultrascale Systems Research Center (USRC) at Los Alamos National Laboratory, supported by the U.S. Department of Energy contract DE-FC02-06ER25750. The publication has been assigned the LANL identifier LA-UR-14-26219. Sandia is a multiprogram laboratory operated by Sandia Corporation, a Lockheed Martin Company, for the United States Department of Energy under Contract DE-AC04-94AL85000. The publication has been assigned the Sandia identifier SAND2014-16515J A portion of this work used resources of the National Energy Research Scientific Computing Center supported by the Office of Science of the U.S. Department of Energy under Contract No. DE-AC02-05CH11231. Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from permissions@acm.org.
Communications of the ACM: Volume 55 Issue 5, May 2012	May-12	A massively parallel adaptive fast multipole method on heterogeneous architectures	1) Ilya Lashuk; 2) Aparna Chandramowlishwaran, Harper Langston, Tuan-Anh Nguyen, Richard Vuduc; 3) Rahul Sampath; 4) Denis Zorin; 5) George Biros, Lexing Ying; 6) Aashay Shringarpure	1) Lawrence Livermore National Laboratory, Livermore, CA; 2) College of Computing, Atlanta, GA; 3) Oak Ridge National Laboratory, Oak Ridge, TN; 4) New York University, New York, NY; 5) The University of Texas at Austin, TX; 6) Unlisted	©2012 ACM 0001-0782/12/0500 $10.00	10.1145/2160718.2160740	National Lab	Ilya Lashuk (lashuk2@llnl.gov), research scientist, Institute for Scientific Computing Research, Lawrence Livermore National Laboratory, Livermore, CA. Rahul Sampath (rahul.sampath@gmail.com), postdoctoral associate, Oak Ridge National Laboratory, Oak Ridge, TN.	No	Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and full citation on the first page. Copyright for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or fee. Request permission to publish from permissions@acm.org or fax (212) 869-0481. The Digital Library is published by the Association for Computing Machinery. Copyright © 2012 ACM, Inc.
ACM Transactions on Mathematical Software (TOMS): Volume 41 Issue 3, June 2015	Jun-15	Replicated Computational Results (RCR) Report for “BLIS: A Framework for Rapidly Instantiating BLAS Functionality”	James M. Willenbring	Sandia National Laboratories, Albuquerque, NM	2015 Copyright is held by the owner/author(s). Publication rights licensed to ACM.	10.1145/2738033	National Lab	Author’s address: Center for Computing Research, Sandia National Laboratories, Albuquerque, NM 87123; email: jmwille@sandia.gov	No	Publication rights licensed to ACM. ACM acknowledges that this contribution was authored by an employee, contractor or affiliate of the United States government. As such, the United States government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for government purposes only.
ACM Transactions on Mathematical Software (TOMS): Volume 33 Issue 2, June 2007	Jun-07	Using the GA and TAO toolkits for solving large-scale optimization problems on parallel computers	1) Steven Benson, Lois Mcinnes, Jason Sarich; 2) Manojkumar Krishnan, Jarek Nieplocha	1) Argonne National Laboratory; 2) Pacific Northwest National Laboratory	© 2007 ACM 0098-3500/2007/06-ART11 $5.00	10.1145/1236463.1236466	National Lab	Authors’ addresses: S. Benson; email: benson@mcs.anl.gov; M. Krishnan; email: manoj@pnl.gov; L. Mclnnes; email: mcinnes@mcl.anl.gov; J. Nieplocha; email: Jarek.Nieplocha@pnl.gov; J. Sarich; email: sarich@mcs.anl.gov.	No	The work at ANL was supported by the Mathematical, Information, and Computational Sciences Division subprogram of the Office of Advanced Scientific Computing, Office of Science, SciDAC Program, U.S. Department of Energy under Contract W 31 109 ENG 38. The work at PNNL was supported by the DoE 2000 ACTS toolkit project and DoE SciDAC Center for Component Technology for Terascale Simulation Software. c 2007 Association for Computing Machinery. ACM acknowledges that this contribution was authored or co-authored by a contractor or affiliate of the [U.S.] Government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or direct commercial advantage and that copies show this notice on the first page or initial screen of a display along with the full citation. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works requires prior specific permission and/or a fee. Permissions may be requested from the Publications Dept., ACM, Inc., 2 Penn Plaza, Suite 701, New York, NY 10121-0701 USA, fax +1 (212) 869-0481, or permissions@acm.org.
ACM Transactions on Computer Systems (TOCS): Volume 1 Issue 4, Nov. 1983	Nov-83	Mechanisms that enforce bounds on packet lifetimes	Lansing Sloan	L-60, Lawrence Livermore National Laboratory, P.O. Box 808, Livermore, CA	© 1983 ACM 0734-2071/83/) 100-0311 $00.75	10.1145/357377.357382	National Lab	Author's address: L-60, Lawrence Livermore National Laboratory, P.O. Box 808, Livermore, CA 94550.	No	This work was performed under the auspices of the U.S. Department of Energy by the Lawrence Livermore National Laboratory under contract W-7405-ENG-48. Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Association for Computing Machinery. To copy otherwise, or to republish, requires a fee and/or specific permission
MTD '16: Proceedings of the 2016 ACM Workshop on Moving Target Defense	Oct-16	Demo: A Symbolic N-Variant System	1) Jun Xu, Pinyao Guo, Ping Chen, Peng Liu; 2) Bo Chen; 3) Robert F. Erbacher	1) The Pennsylvania State University, University Park, PA, USA; 2) University of Memphis, Memphis, TN, USA; 3) Army Research Laboratory, Adelphi, MD, USA	Copyright is held by the owner/author(s).	10.1145/2995272.2995284	Employee	Army Research Laboratory; robert.f.erbacher.civ@mail.mil	No	ACM acknowledges that this contribution was authored or co-authored by an employee, contractor or affiliate of the United States government. As such, the United States Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only.
ACM Transactions on Mathematical Software (TOMS): Volume 16 Issue 4, Dec. 1990	Dec-90	Algorithm 686: FORTRAN subroutines for updating the QR decomposition	1) L. Reichel; 2) W. B. Gragg	1) Univ. of Kentucky, Lexington; 2) Naval Postgraduate School, Monterey, CA	© 1990 ACM 0098-3500/90/1200-0369 $01.50	10.1145/98267.98291	Employee	Authors' Addresses: W. B. Gragg, Department of Mathematics, Naval Postgraduate School, Monterey, CA 93943.	No	This research was supported by NSF grant DMS-8704196 and by the Foundation Research Program of the Naval Postgraduate School. Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Association for Computing Machinery. To copy otherwise, or to republish, requires a fee and/or specific permission.
XSEDE16: Proceedings of the XSEDE16 Conference on Diversity, Big Data, and Science at Scale	Jul-16	Time Propagation of Partial Differential Equations Using the Short Iterative Lanczos Method and Finite-Element Discrete Variable Representation: An Experiment Using the Intel Phi Coprocessors: Extended Abstract	1) Barry I. Schneider; 2) Klaus Bartschat; 3) Xiaoxu Guan	1) Applied and Computational, Mathematics Division, Information Technology Laboratory, National Institute of Standards and Technology, Gaithersburg, MD; 2) Department of Physics and Astronomy, Drake University, Des Moines, Iowa; 3) High Performance Computing, Louisiana State University, Baton Rouge, Louisiana	© 2016 Copyright held by the owner/author(s).	10.1145/2949550.2949565	Employee	1) Applied and Computational, Mathematics Division, Information Technology Laboratory, National Institute of Standards and Technology, Gaithersburg, MD;	No	The identification of any commercial product or trade name does not imply endorsement or recommendation by either the National Institute of Standards and Technology or the institutions of the authors of this paper. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the owner/author(s).
SC '13: Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis	Nov-13	Predicting application performance using supervised learning on communication features	1) Nikhil Jain, Michael P. Robson, Laxmikant V. Kale; 2) Abhinav Bhatele, Todd Gamblin,	1) University of Illinois at Urbana-Champaign, Urbana, IL; 2) Lawrence Livermore National Laboratory, Livermore, CA	Copyright 2013 ACM 978-1-4503-2378-9/13/11 ...$15.00	10.1145/2503210.2503263	National Lab	2) Lawrence Livermore National Laboratory, Livermore, CA	No	Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear\ this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Permissions@acm.org. This work was performed under the auspices of the U.S. Department of Energy by Lawrence Livermore National Laboratory under Contract DE-AC52-07NA27344. This work was funded by the Laboratory Directed Research and Development Program at LLNL under project tracking code 13-ERD-055 (LLNL-CONF-635857). This research used computer time on Livermore Computing’s high performance computing resources, provided under the Laboratory Directed Research and Development Program. This research also used resources of the Argonne Leadership Computing Facility at Argonne National Laboratory, which is supported by the Oce of Science of the U.S. Department of Energy under contract DE-AC02-06CH11357
Communications of the ACM: Volume 25 Issue 10, Oct 1982	Oct-82	A Fortran programming methodology based on data abstraction	John F. Isner	National Geodetic Survey, Rockville, MD	© 1982 ACM 0001--0782/82/1000-0686 75¢.	10.1145/358656.358659	Employee	Author's present address: J.F. Isner, National Geodetic Survey C 16, National Ocean Survey, NOAA, 6001 Executive Boulevard, Rockville, MD 20852.	No	Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Association for Computing Machinery. To copy otherwise, or to republish, requires a fee and/or specific permission.
Journal of the ACM (JACM): Volume 41 Issue 4, July 1994	Jul-94	On solving equations and disequations	1) Wray L. Buntine; 2) Hans-Jürgen Bürckert	1) NASA Ames Research Center, Moffett Field, CA; 2) German Research Center for Artificial Intelligence (DFKI), Saarbru¨cken, Germany	©1994 ACM 0004-5411/94/0700-0591 $03.50	10.1145/179812.179813	Employee	Authors’ addresses: W. L. Buntine, NASA Ames Research Center, Mail Stop 244-17, Moffett Field, CA 94035, e-mail: wrayt@ptolemy.arc.nasa.gov.	No	Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its ddte appear, and notice is given that copying 1s by permission of the Association for Computing Machinery. To copy otherwise, or to republish, requires a fee and/or specific permission. W. L. Buntine’s research was supported by an Australian Commonwealth Postgraduate Research Award. H.-J. Burckert’s research was supported by the German Bundesministerium fiir Forschung und Technologies and the Nixdorf Computer AG under contract of the Joint Research Project ITR8501A.
Communications of the ACM: Volume 31 Issue 5, May 1988	May-88	Reevaluating Amdahl's law	John L. Gustafson	Sandia National Laboratory, Albuquerque, NM	© 1988 ACM OOOI-0782/88/0500-0532 $1.50	10.1145/42411.42415	National Lab	Author’s Present Address: John L. Gustafson. Sandia National Laboratories. Albuquerque. NM 87185.	No	Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear. and notice is given that copying is by permission of the Association for Computing Machinery. To copy otherwise. or to republish. requires a fee and/or specific permission.
WWW '15 Companion: Proceedings of the 24th International Conference on World Wide Web	May-15	Disentangling the Lexicons of Disaster Response in Twitter	1) Nathan O. Hodas, Joshua Harrison, Satish Chikkagoudar, Eric Bell, Courtney D. Corley; 2) Greg Ver Steeg,	1) Pacific Northwest National Laboratory, Richland, WA, USA; 2) Information Sciences Institute - University of Southern California, Marina Del Rey, CA, USA	Copyright is held by the International World Wide Web Conference Committee (IW3C2). IW3C2 reserves the right to provide a hyperlink to the author’s site if the Material is used in electronic media.	10.1145/2740908.2741728	National Lab	1) Pacific Northwest National Laboratory, Richland, WA, USA;	No	The research at Pacific Northwest National Laboratory was supported through a contract with the U.S. Department of Homeland Security’s Science and Technology Directorate First Responders Group. Pacific Northwest National Laboratory is operated for the U.S. Department of Energy by Battelle under contract DE-AC05-76RLO 1830.
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMM): Volume 3 Issue 4, December 2007	Dec-07	Using geometric properties of topographic manifold to detect and track eyes for human-computer interaction	1) Jun Wang; 2) Lijun Yin; 3) Jason Moore	1) Columbia University, New York, NY; 2) State University of New York at Binghamton, Binghamton, NY; 3) Air Force Research Laboratory at Rome, Rome, NY	© 2007 ACM 1551-6857/2007/12-ART21 $5.00	10.1145/1314303.1314306	Employee	Authors' Addresses: J. Moore, Information Systems Research Branch, Air Force Research Laboratory, 26 Electronic Parkway, Rome, NY 13441-4514; email: Jason.Moore@rl.af.mil.	No	The majority of this work was done while J. Wang was a graduate at the Department of Computer Science, State University of New York at Binghamton, and while L. Yin was at AFRL at Rome, NY as a summer visiting faculty member. This work was supported in part by the Air Force Research Lab summer visiting faculty program, the National Science Foundation under grants IIS-0414029 and IIS-0541044, and the NYSTAR’s James D. Watson program. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or direct commercial advantage and that copies show this notice on the first page or initial screen of a display along with the full citation. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works requires prior specific permission and/or a fee. Permissions may be requested from Publications Dept., ACM, Inc., 2 Penn Plaza, Suite 701, New York, NY 10121-0701 USA, fax +1 (212) 869-0481, or permissions@acm.org.
PPoPP 2015: Proceedings of the 20th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming	Jan-15	Towards batched linear solvers on accelerated hardware platforms	1) Azzam Haidar, Tingxing Dong, Piotr Luszczek, Stanimire Tomov; 2) Jack Dongarra	1) University of Tennessee, USA; 2) University of Tennessee, USA / Oak Ridge National Laboratory, USA / University of Manchester, UK	Copyright held by author(s)/Owner(s)	10.1145/2688500.2688534	Unsure	2) University of Tennessee, USA / Oak Ridge National Laboratory, USA / University of Manchester, UK	No	Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted.
SC '11: Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis	Nov-11	Extracting ultra-scale Lattice Boltzmann performance via hierarchical and distributed auto-tuning	1) Samuel Williams, Leonid Oliker, Jonathan Carter, John Shalf	1) Lawrence Berkeley National Laboratory	Copyright 2011 ACM 978-1-4503-0771-0/11/11 ...$10.00.	10.1145/2063384.2063458	National Lab	1) Lawrence Berkeley National Laboratory	No	Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. All authors from Lawrence Berkeley National Laboratory were supported by the DOE Office of Advanced Scientific Computing Research under contract number DE-AC02-05- CH11231. This research used resources of the Argonne Leadership Computing Facility at Argonne National Laboratory, which is supported by the Office of Science of the U.S. Department of Energy under contract DE-AC02-06CH11357.
Communications of the ACM: Volume 12 Issue 2, Feb. 1969	Feb-69	The logarithmic error and Newton's method for the square root	1) Richard F. King, David L. Phillips	1) Argonne National Lab., Argonne, IL	N/A	10.1145/362848.362861	National Lab	1) Argonne National Lab., Argonne, IL	No	This work was performed under the auspices of the US Atomic Energy Commission.
Communications of the ACM - Creating a science of games: Volume 50 Issue 7, July 2007	Jul-07	Computing is a natural science	Peter J. Denning	Director of the Cebrowski Institute for information and innovation and superiority at the Naval Postgraduate School in Monterey, CA, and is a past president of ACM.	©2007 ACM 0001-0782/07/0700 $5.00	10.1145/1272516.1272529	Employee	Director of the Cebrowski Institute for information and innovation and superiority at the Naval Postgraduate School in Monterey, CA, and is a past president of ACM.	No	Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. The Digital Library is published by the Association for Computing Machinery. Copyright © 2007 ACM, Inc.
Supercomputing '89: Proceedings of the 1989 ACM/IEEE conference on Supercomputing	Aug-89	Vector performance analysis of three supercomputers: Cray 2, Cray Y-MP, and ETA 10-Q	R. A. Fatoohi	Sterling Software, NASA Ames Research Center, Moffett Field, California	© 1989 ACM 08791-341-8/89/0011.0779 $1.50	10.1145/76263.76352	Employee	Sterling Software, NASA Ames Research Center, Moffett Field, California	No	Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Association for Computing Machinery. To copy otherwise, or to republish, requires a fee and/or specific permission.
SC '15: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis	Nov-15	Large-scale compute-intensive analysis via a combined in-situ and co-scheduling workflow approach	1) Christopher Sewell, Patricia K. Fasel, Li-ta Lo, James Ahrens; 2) Katrin Heitmann, Hal Finkel, Adrian Pope, Salman Habib; 3) George Zagaris; 4) Suzanne T. Parete-Koon, Bronson Messer; 5) Nicholas Frontiere	1) Los Alamos National Lab, Los Alamos, NM; 2) Argonne National Lab, Lemont, IL; 3) Lawrence Livermore Nat. Lab, Livermore, CA; 4) OLCF Oak Ridge National Lab, Oak Ridge, TN; 5) University of Chicago and Argonne National Laboratory	© 2015 Copyright held by the owner/author(s). Publication rights licensed to ACM.	10.1145/2807591.2807663	National Lab	1) Los Alamos National Lab, Los Alamos, NM; 2) Argonne National Lab, Lemont, IL; 3) Lawrence Livermore Nat. Lab, Livermore, CA; 4) OLCF Oak Ridge National Lab, Oak Ridge, TN;	No	Publication rights licensed to ACM. ACM acknowledges that this contribution was authored or co-authored by an employee, contractor or affiliate of the United States government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only. The work performed by CS, LL, PF, and JA was supported by the Scientific Discovery through Advanced Computing (SciDAC) program funded by U.S. Department of Energy, Office of Science, Advanced Scientific Computing Research under the Institute of Scalable Data Management, Analysis and Visualization (SDAV). An award of computer time was provided by the Innovative and Novel Computational Impact on Theory and Experiment (INCITE) program. This research used resources of the OLCF, which is supported by DOE/SC under contract DE-AC05-00OR22725. HF, SH, KH, and AP were supported by the U.S. Department of Energy, Basic Energy Sciences, Office of Science, under contract No. DEAC02-06CH11357. We would like to thank Silvio Rizzi and Joe Insley of Argonne National Laboratory for the visualization shown in Figure 2.
Communications of the ACM - Special issue on object-oriented experiences and future trends: Volume 38 Issue 10, Oct. 1995	Oct-95	The promise and the cost of object technology: a five-year forecast	Cherri M. Pancake	Oregon State Univ., Corvallis	N/A	10.1145/226239.226247	Not Govt	No government agencies appear in the author affiliations	No	N/A
ACM Transactions on Mathematical Software (TOMS): Volume 7 Issue 4, Dec. 1981	Dec-81	Evaluation of a Test Set for Stiff ODE Solvers	Lawrence F. Shampine	Numerical Mathematics Division 5642, Sandia National Laboratories, Albuquerque, NM	1981 ACM 0098-3500/81/1200-0409 $00.00	10.1145/355972.355973	National Lab	Numerical Mathematics Division 5642, Sandia National Laboratories, Albuquerque, NM	No	This work was sponsored by the U.S. Department of Energy under Contract DE-AC04-76DP00789.
ASONAM '15: Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2015	Aug-15	Semantics-Based Cross-domain Collaboration Recommendation in the Life Sciences: Preliminary Results	1) Dimitar Hristovski; 2) Andrej Kastrin; 3) Thomas C. Rindflesch	1) Faculty of Medicine, University of Ljubljana, Ljubljana, Slovenia; 2) Faculty of Information Studies, Novo mesto, Slovenia; 3) National Library of Medicine, Bethesda, MD, USA	Copyright is held by the owner/author(s). Publication rights licensed to ACM	10.1145/2808797.2809300	Employee	3) National Library of Medicine, Bethesda, MD, USA	No	This work was supported by the Slovenian Research Agency and by the Intramural Research Program of the U.S. National Institutes of Health, National Library of Medicine.
SC '15: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis	Nov-15	GraphReduce: processing large-scale graphs on accelerator-based systems	1) Dipanjan Sengupta, Kapil Agarwal, Karsten Schwan; 2) Shuaiwen Leon Song,	1) Georgia Institute of Technology; 2) Pacific Northwest National Laboratory	© 2015 ACM. ISBN 978-1-4503-3723-6/15/11 ...$15.00.	10.1145/2807591.2807655	National Lab	2) Pacific Northwest National Laboratory	No	©2015 Association for Computing Machinery. ACM acknowledges that this contribution was authored or co-authored by an employee, contractor or affiliate of the United States government. As such, the United States Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only. This work was partially supported by DOE ASCR Beyond Standard Modeling (BSM) Project and a gift grant from Intel. The Pacific Northwest National Laboratory is operated by Battelle for the U.S. Department of Energy under contract DE-AC05- 76RL01830.
Communications of the ACM: Volume 54 Issue 4, April 2011	Apr-11	Reflecting on the DARPA Red Balloon Challenge	1) John C. Tang; 2) Manuel Cebrian; 3) Nicklaus A. Giacobe, Hyun-Woo Kim; 4) Taemie Kim; 5) Douglas "Beaker" Wickert	1) Microsoft Research, Mountain View, CA; 2) University of California at San Diego, La Jolla, CA; 3) Pennsylvania State University, University Park, PA; 4) Massachusetts Institute of Technology, Cambridge, MA; 5) Defense Advanced Research Projects Agency, Arlington, VA	©2011 ACM 0001-0782/11/0400 $10.00	10.1145/1924421.1924441	Employee	Douglas "Beaker" Wickert (douglas.wickert@us.af.mil) is a Major in the U.S. Air Force and a program fellow in the Transformational Convergence Technology Office of the Defense Advanced Research Projects Agency, Arlington, VA.	No	Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and full citation on the first page. Copyright for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or fee. Request permission to publish from permissions@acm.org or fax (212) 869-0481.
ACM Transactions on Mathematical Software (TOMS): Volume 19 Issue 3, Sept. 1993	Sep-93	On the numerical inversion of Laplace transforms: comparison of three new methods on characteristic problems from applications	Dean G. Duffy	Laboratory for Atmospheres, NASA/ Goddard Space Flight Center	©1993 ACM 0098-3500/93/0900-0333 $01.50	10.1145/155743.155788	Employee	Laboratory for Atmospheres, NASA/ Goddard Space Flight Center	No	Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Association for Computing Machinery. To copy otherwise, or to republish, requires a fee and/or specific permission.
ACM Transactions on Modeling and Computer Simulation (TOMACS): Volume 19 Issue 1, December 2008	Dec-08	On constructing optimistic simulation algorithms for the discrete event system specification	James Nutaro	Oak Ridge National Laboratory, Oak Ridge, TN	© 2008 ACM 1049-3301/2008/12-ART1 $5.00	10.1145/1456645.1456646	National Lab	Author’s address: J. Nutaro, Oak Ridge National Laboratory, PO Box 2008, MS6085, Oak Ridge, TN 37831-6085; email: nutarojj@ornl.gov.	No	Research sponsored by the Laboratory Directed Research and Development Program of Oak Ridge National Laboratory, managed by UT-Battelle, LLC for the U.S. Department of Energy under contract DE-AC05-00OR22725. c 2008 Association for Computing Machinery. ACM acknowledges that this contribution was authored or co-authored by a contractor or affiliate of the [U.S.] Government. As such, the Government retains a nonexclusive royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or direct commercial advantage and that copies show this notice on the first page or initial screen of a display along with the full citation. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works requires prior specific permission and/or a fee. Permissions may be requested from Publications Dept., ACM, Inc., 2 Penn Plaza, Suite 701, New York, NY 10121-0701 USA, fax +1 (212) 869-0481, or permissions@acm.org.
ACM Transactions on Mathematical Software (TOMS): Volume 6 Issue 3, Sept. 1980	Sep-80	Algorithm 556: Exponential Integrals [S13]	Donald E. Amos	Numerical Mathematics Division, Sandia Laboratories, Albuquerque, NM	© 1980 ACM 0098-3500/80/0900-0420 $00.00	10.1145/355900.355913	National Lab	Numerical Mathematics Division, Sandia Laboratories, Albuquerque, NM	No	This work was supported by the U.S. Department of Energy under Contract AT(29-1)-789. The U.S Government's right to retain a nonexcluswe royalty-free license to publish or reproduce the pubhshed form of this contribution, or allow others to do so, for U.S. Government purposes is acknowledged.
Communications of the ACM: Volume 42 Issue 7, July 1999	Jul-99	Testing and evaluating computer intrusion detection systems	1) Robert Durst; 2) Terrence Champion, Brian Witten, Eric Miller, Luigi Spagnuolo	1) SenCom Corp.; 2) US Air Force	©1999 ACM 0002-0782/99/0700 $5.00	10.1145/306549.306571	Employee	Terrence Champion (tgc@sappho.rl.af.mil) is a research scientist and program manager in the Air Force Research Laboratory's INFOSEC Technology Office at Hanscom Air Force Base. Brian Witten (witten@sappho.rl.af.mil) is a research scientist and program manager in the Air Force Research Laboratory's INFOSEC Technology Office at Hanscom Air Force Base. Eric Miller (ejm6@leland.stanford.edu), formerly a research scientist and program manager with the Air Force Research Laboratory's INFOSEC Technology Office at Hanscom Air Force Base, is a graduate student at Stanford University. Luigi Spagnuolo (spagl@sappho.rl.af.mil) is the chief of the Air Force Research Laboratory's INFOSEC Technology Office at Hanscom Air Force Base.	No	Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. The Digital Library is published by the Association for Computing Machinery. Copyright © 1999 ACM, Inc.
ACM Transactions on Mathematical Software (TOMS): Volume 23 Issue 3, Sept. 1997	Sep-97	Compiler blockability of dense matrix factorizations	1) Steve Carr; 2) R. B. Lehoucq	1) Michigan Technological Univ., Houghton; 2) Argonne National Lab, Argonne, IL	© 1997 ACM 0098-3500/97/0900 –0336 $5.00	10.1145/275323.275325	National Lab	Authors' Addresses: R. B. Lehoucq, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL 60439; email: lehoucq@mcs.anl.gov; http://www.mcs.anl.gov/home/lehoucq/index.html.	No	This research was supported by NSF grants CCR-9120008 and CCR-9409341. R. B. Lehoucq was also supported by the U.S. Department of Energy contracts DE-FG0f-91ER25103 and W-31–109 –Eng-38. Permission to make digital/ hard copy of part or all of this work for personal or classroom use is granted without fee provided that the copies are not made or distributed for profit or commercial advantage, the copyright notice, the title of the publication, and its date appear, and notice is given that copying is by permission of the ACM, Inc. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/ or a fee.
Communications of the ACM: Volume 55 Issue 12, December 2012	Dec-12	Moods	Peter J. Denning	Director of the Cebrowski Institute for Information Innovation and Superiority at the Naval Postgraduate School in Monterey, CA, and a past president of ACM.	Copyright held by author.	10.1145/2380656.2380668	Employee	Peter J. Denning (pjd@nps.edu) is Distinguished Professor of Computer Science and Director of the Cebrowski Institute for information innovation at the Naval Postgraduate School in Monterey, CA, is Editor of ACM Ubiquity, and is a past president of ACM.	No	The Digital Library is published by the Association for Computing Machinery. Copyright © 2012 ACM, Inc.
HSCC '16: Proceedings of the 19th International Conference on Hybrid Systems: Computation and Control	Apr-16	Scalable Static Hybridization Methods for Analysis of Nonlinear Systems	1) Stanley Bak; 2) Sergiy Bogomolov, Thomas A. Henzinger; 3) Taylor T. Johnson; 4) Pradyot Prakash	1) Air Force Reseach Lab, Dayton, OH, USA; 2) IST Austria, Vienna, Austria; 3) University of Texas at Arlington, Arlington, TX, USA; 4) IIT Bombay, Bombay, India	© 2016 Copyright held by the owner/author(s). Publication rights licensed to ACM.	10.1145/2883817.2883837	Employee	1) Air Force Reseach Lab, Dayton, OH, USA;	No	DISTRIBUTION A. Approved for public release; Distribution unlimited. (Approval AFRL PA #88ABW-2016-0181, 28 JAN 2016) Publication rights licensed to ACM. ACM acknowledges that this contribution was authored or co-authored by an employee, contractor or affiliate of the United States government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only. The material presented in this paper is based upon work supported by the Air Force Office of Scientific Research (AFOSR), in part under contract number FA9550-15-1-0258 and the Summer Faculty Fellowship Program (SFFP), by AFRL through contract number FA8750-15-1-0105, and bythe National Science Foundation (NSF) under grant numbers CNS 1464311 and CCF 1527398. Furthermore, this research was supported in part by the European Research Council (ERC) under grant 267989 (QUAREM) and by the Austrian Science Fund (FWF) under grant numbers S11402-N23 (RiSE) and Z211-N23 (Wittgenstein Award). Any opinions, findings, and conclusions or recommendations expressed in this publication are those of the authors and do not necessarily reflect the views of AFRL, AFOSR, or NSF.
SIGGRAPH '11: ACM SIGGRAPH 2011 papers	Jul-11	Efficient maximal poisson-disk sampling	1) Mohamed S. Ebeida, Patrick M. Knupp, Scott A. Mitchell; 2) Andrew A. Davidson, Anjul Patney, John D. Owens	1) Sandia National Laboratories; 2) University of California, Davis	© 2011 ACM 0730-0301/2011/07-ART49 $10.00	10.1145/1964921.1964944	National Lab	1) Sandia National Laboratories;	No	ACM acknowledges that this contribution was authored or co-authored by a contractor or affi liate of the [U.S.] Government. As such, the Government retains a nonexclusive, royalty free right to publish or reproduce this article, or to allow to do so, for Government purposes only. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profi t or direct commercial advantage and that copies show this notice on the fi rst page or initial screen of a display along with the full citation. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works requires prior specifi c permission and/or a fee. Permissions may be requested from Publications Dept., ACM, Inc., 2 Penn Plaza, Suite 701, New York, NY 10121 0701, fax +1 (212) 869-0481, or permissions@acm.org. Sandia National Laboratories is a multi-program laboratory managed and operated by Sandia Corporation, a wholly owned subsidiary of Lockheed Martin Corporation, for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-AC04-94AL85000.
ACM Transactions on Design Automation of Electronic Systems (TODAES) - Special Section on New Physical Design Techniques for the Next Generation Integration Technology and Regular Papers: Volume 21 Issue 3, July 2016	Jul-16	A Survey of Techniques for Cache Locking	Sparsh Mittal	Oak Ridge National Laboratory, Tennessee, USA	© 2016 ACM 1084-4309/2016/05-ART49 $15.00	10.1145/2858792	National Lab	Author’s address: 1 Bethel Valley Road, Oak Ridge National Laboratory, Building 5100, Tennessee, USA 37830; email: mittals@ornl.gov	No	Support for this work was provided by the U.S. Department of Energy, Office of Science, Advanced Scientific Computing Research. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies show this notice on the first page or initial screen of a display along with the full citation. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works requires prior specific permission and/or a fee. Permissions may be requested from Publications Dept., ACM, Inc., 2 Penn Plaza, Suite 701, New York, NY 10121-0701 USA, fax +1 (212) 869-0481, or permissions@acm.org.
ACM Transactions on Mathematical Software (TOMS): Volume 13 Issue 1, March 1987	Mar-87	Algorithm 649: A package for computing trigonometric Fourier coefficients based on Lyness's algorithm	1) G. Giunta; 2) A. Murli	1) Universitá di Napoli, Dipartimento di Matematica e Applicazioni, Via Mezzocannone 8, 80134 Napoli, Italy and Argonne National Laboratory; 2) Universitá di Napoli, Dipartimento di Matematica e Applicazioni, Via Mezzocannone 8, 80134 Napoli, Italy	© 1987 ACM 0098-3500/87/0300-0097 $00.75	10.1145/23002.214339	National Lab	1) Universitá di Napoli, Dipartimento di Matematica e Applicazioni, Via Mezzocannone 8, 80134 Napoli, Italy and Argonne National Laboratory;	No	This work was supported in part by the Applied Mathematical Sciences subprogram of the Office of Energy Research, U.S. Department of Energy, under contract W-31-109-Eng-38, and by the Italian National Research Council (C.N.R.). Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Association for Computing Machinery. To copy otherwise, or to republish, requires a fee and/or specific permission.
ACM Computing Surveys (CSUR): Volume 49 Issue 3, December 2016	Dec-16	Understanding GPU Power: A Survey of Profiling, Modeling, and Simulation Methods	1) Robert A. Bridges, Neena Imam, Tiffany M. Mintz	1) Oak Ridge National Laboratory, Oak Ridge, TN	© 2016 ACM 0360-0300/2016/09-ART41 $15.00	10.1145/2962131	National Lab	Authors’ addresses: R. A. Bridges, N. Imam, and T. M. Mintz, 1 Bethel Valley Road, Oak Ridge National Laboratory, Oak Ridge, TN 37831; emails: {bridgesra, imamn, mintztm}@ornl.gov.	No	This work was supported by the United States Department of Defense and used resources of the Computational Research and Development Programs at Oak Ridge National Laboratory. This manuscript has been authored by UT-Battelle, LLC under Contract No. DE-AC05-00OR22725 with the U.S. Department of Energy. The United States Government retains and the publisher, by accepting the article for publication, acknowledges that the United States Government retains a non-exclusive, paid-up, irrevocable, world-wide license to publish or reproduce the published form of this manuscript, or allow others to do so, for United States Government purposes. The Department of Energy will provide public access to these results of federally sponsored research in accordance with the DOE Public Access Plan http://energy.gov/downloads/doe-public-access-plan Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies show this notice on the first page or initial screen of a display along with the full citation. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works requires prior specific permission and/or a fee. Permissions may be requested from Publications Dept., ACM, Inc., 2 Penn Plaza, Suite 701, New York, NY 10121-0701 USA, fax +1 (212) 869-0481, or permissions@acm.org.
Communications of the ACM: Volume 24 Issue 7, July 1981	Jul-81	Representing super-sparse matrices with perturbed values	1) Harvey J. Greenberg; 2) Richard P. O'Neill	1) Office of Analysis Oversight and Access, Washington, DC; 2) Office of Energy Source Analysis, Washington, DC	© 1981 ACM 0001-0782/81/070(O0451 $00.75.	10.1145/358699.358712	Employee	Authors' Present Addresses: Harvey J. Greenberg, Energy Information Administration, Room 4530, 1200 Pennsylvania Ave., Washington D.C. 20461; Richard P. O'Neill, Office of Energy Source Analysis, Department of Energy, Washington, D.C. 20461.	No	Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Association for Computing Machinery. To copy otherwise, or to republish, requires a fee and/or specific permission.
LCTES'15: Proceedings of the 16th ACM SIGPLAN/SIGBED Conference on Languages, Compilers and Tools for Embedded Systems 2015 CD-ROM	Jun-15	Clover: Compiler Directed Lightweight Soft Error Resilience	1) Qingrui Liu, Changhee Jung, Dongyoon Lee; 2) Devesh Tiwari	1) Virginia Tech, USA; 2) Oak Ridge National Laboratory, USA	Copyright © 2015 ACM 978-1-4503-3257-6//. . . $15.00	10.1145/2670529.2754959	National Lab	2) Oak Ridge National Laboratory, USA	No	c 2015 Association for Computing Machinery. ACM acknowledges that this contribution was authored or co-authored by an employee, contractor or affiliate of the United States government. As such, the United States Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only. This work was in part supported by the Oak Ridge Leadership Computing Facility at the Oak Ridge National Laboratory, which is managed by UT Battelle, LLC for the U.S. DOE (under the contract No. DE-AC05-00OR22725).
ACM Transactions on Mathematical Software (TOMS): Volume 17 Issue 4, Dec. 1991	Dec-91	Algorithm 699: a new representation of Patterson's quadrature formulae	1) Fred T. Krogh, W. Van Snyder	1) Jet Propulsion Laboratory, California Institute of Technology, 4800 Oak Grove Drive, Mail Stop 600-116, Pasadena, CA	© 1991 ACM 0098-3500/91/1200-0457 $01.50	10.1145/210232.210235	Employee	Authors’ address: Jet Propulsion Laboratory, 4800 Oak Grove Drive, Mail Stop 600-116, Pasadena, CA 91109.	no	Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Association for Computing Machkery. To copy otherwise, or to republish, requires a fee and/or specific permission.
SC '13: Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis	Nov-13	Assessing the effects of data compression in simulations using physically motivated metrics	1) Daniel Laney, Steven Langer, Christopher Weber, Peter Lindstrom; 2) Al Wegener	1) Lawrence Livermore Lab; 2) Samplify	Copyright 2013 ACM 978-1-4503-2378-9/13/11 ...$15.00.	10.1145/2503210.2503283	National Lab	1) Lawrence Livermore Lab	No	Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Permissions@acm.org. This document was released as LLNL-CONF-642236. This work was performed under the auspices of the U.S. Department of Energy by Lawrence Livermore National Laboratory under Contract DE-AC52-07NA27344. Some of this material is based upon work supported by the Defense Advanced Research Projects Agency under its Agreement No. HR0011-07-9-0001.
EuroMPI 2016: Proceedings of the 23rd European MPI Users' Group Meeting	Sep-16	An Evaluation of the One-Sided Performance in Open MPI	Nathan Hjelm	Los Alamos National Lab, Los Alamos, NM	Copyright 2016 ACM 978-1-4503-4234-6/16/09 ...$15.00.	10.1145/2966884.2966890	National Lab	Los Alamos National Lab, Los Alamos, NM	No	Publication rights licensed to ACM. ACM acknowledges that this contribution was authored or co-authored by an employee, contractor or affiliate of the United States government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only. Work supported by the Advanced Simulation and Computing program of the U.S. Department of Energy’s NNSA. Los Alamos National Laboratory is operated by Los Alamos National Security, LLC for the NNSA. LA-UR-16-23940.
ACM Transactions on Information Systems (TOIS): Volume 16 Issue 4, Oct. 1998	Oct-98	A semidiscrete matrix decomposition for latent semantic indexing information retrieval	1) Tamara G. Kolda; 2) Dianne P. O'Leary	1) Oak Ridge National Lab, Oak Ridge, TN; 2) Univ. of Maryland, College Park	© 1998 ACM 1046-8188/98/1000–0322 $5.00	10.1145/291128.291131	National Lab	1) Oak Ridge National Lab, Oak Ridge, TN	No	Kolda’s work was supported through a fellowship from the National Physical Sciences Consortium, the National Security Agency, and the University of Maryland. Summer support was provided by the IDA Center for Computing Sciences. O’Leary’s work was supported by the National Science Foundation under Grant CCR-95-03126. Permission to make digital/hard copy of part or all of this work for personal or classroom use is granted without fee provided that the copies are not made or distributed for profit or commercial advantage, the copyright notice, the title of the publication, and its date appear, and notice is given that copying is by permission of the ACM, Inc. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee.
ACM Transactions on Knowledge Discovery from Data (TKDD): Volume 9 Issue 1, October 2014	Oct-14	A Framework for Exploiting Local Information to Enhance Density Estimation of Data Streams	1) Arnold P. Boedihardjo; 2) Chang-Tien Lu, Bingsheng Wang	1) U.S. Army Corps of Engineers, Alexandria, VA; 2) Virginia Tech, Falls Church, VA	© 2014 ACM 1556-4681/2014/08-ART2 $15.00	10.1145/2629618	Employee	Authors' Addresses: A. P. Boedihardjo, Geospatial Research Lab – Engineer Research and Development Center, U.S. Army Corps of Engineers, 7701 Telegraph Rd, Alexandria, VA 22315;	No	Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies show this notice on the first page or initial screen of a display along with the full citation. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works requires prior specific permission and/or a fee. Permissions may be requested from Publications Dept., ACM, Inc., 2 Penn Plaza, Suite 701, New York, NY 10121-0701 USA, fax +1 (212) 869-0481, or permissions@acm.org.
ACM Transactions on Mathematical Software (TOMS): Volume 7 Issue 1, March 1981	Mar-81	A Nested Partitioning Procedure for Numerical Multiple Integration	1) Jerome H. Friedman; 2) Margaret H. Wright	1) Stanford Linear Accelerator Center, Stanford, CA; 2) European Organization for Nuclear Research, CERN, Geneva, Switzerland	© 1981 ACM 0098-3500/81/0300--0076 $00 75	10.1145/355934.355939	National Lab	1) Stanford Linear Accelerator Center, Stanford, CA;	No	Permission to copy without fee all or part of this material is granted provided that the copras are not made or distributed for direct corsrserclal advantage, the ACM copyright notme and the title of the pubhcation and its date appear, and notice Is given that copyrsg is by permission of the Association for Computing Machinery. To copy otherwise, or to republish, requires a fee and/or specific permission. The work of J.H Freedman was partially supported by the U.S Department of Energy under Contract DE-AC03-76-SF00515 The work of M.H. Wright was supported m part by the U.S. Department of Energy under contract DE-AS03-76-SF00326, rs part by National Scmnce Foundation Grant MCS76- 20019-A01, and in part by the U.S. Army Research Office under Contract DAAG29-79-C-0110
Communications of the ACM: Volume 24 Issue 11, Nov. 1981	Nov-81	Documentation for a model: a hierarchical approach	1) Saul I. Gass; 2) Karla L. Hoffman, Richard H. F. Jackson, Lambert S. Joel, Patsy B. Saunders	1) National Bureau of Standards, Washington, DC, and the Univ. of Maryland, College Park, MD; 2) National Bureau of Standards, Washington, DC	©ACM 0001-0782/81/1100-0728 75¢.	10.1145/358790.358792	Employee	1) National Bureau of Standards, Washington, DC, and the Univ. of Maryland, College Park, MD; 2) National Bureau of Standards, Washington, DC	No	N/A
Journal of the ACM (JACM): Volume 21 Issue 4, Oct. 1974	Oct-74	Unit Refutations and Horn Sets	1) L. Henschen; 2) L. Wos	1) Computer Science Department, Northwestern University, Evanston, Illinois; 2) Argonne National Laboratory, Argonne, Illinois	Copyright © 1974, Association for Computing Machinery, Inc.	10.1145/321850.321857	National Lab	Authors' Addresses: L. Wos, Argonne National Laboratory, Argonne, IL 60439.	No	General permission to republish, butnot for profit, all or part of this material is granted provided that ACM's copyright notice is given and that reference is made to the publication, to its date of issue, and to the fact that reprinting privileges were granted by permission of the Association for Computing Machinery. This work was performed under the auspices of the US Atomic Energy Commission and supported in part under NSF Grants GJ32717 and GU-3851.
SC '13: Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis	Nov-13	HACC: extreme scaling and performance across diverse architectures	1) Salman Habib, Vitali Morozov, Nicholas Frontiere, Hal Finkel, Adrian Pope, Katrin Heitmann	1) Argonne National Laboratory	Copyright 2013 ACM 978-1-4503-2378-9/13/11...$15.00.	10.1145/2503210.2504566	National Lab	1) Argonne National Laboratory	No	Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. This research used resources of the ALCF, which is supported by DOE/SC under contract DE-AC02- 06CH11357 and resources of the OLCF, which is supported by DOE/SC under contract DE-AC05-00OR22725.
Communications of the ACM: Volume 58 Issue 7, July 2015	Jul-15	Exascale computing and big data	1) Daniel A. Reed; 2) Jack Dongarra	1) Vice President for Research and Economic Development, and Professor of Computer Science, Electrical, and Computer Engineering and Medicine, at the University of Iowa.; 2) holds an appointment at the University of Tennessee, Oak Ridge National Laboratory, and the University of Manchester.	©2015 ACM 0001-0782/15/07	10.1145/2699414	Unsure	Jack Dongarra (dongarra@icl.utk.edu) holds an appointment at the University of Tennessee, Oak Ridge National Laboratory, and the University of Manchester.	No	Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and full citation on the first page. Copyright for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or fee. Request permission to publish from permissions@acm.org or fax (212) 869-0481.
ACM Transactions on Sensor Networks (TOSN): Volume 8 Issue 3, July 2012	Jul-12	Sensor network data fault detection with maximum a posteriori selection and bayesian modeling	1) Kevin Ni; 2) Greg Pottie	1) Lawrence Livermore National Laboratory; 2) University of California, Los Angeles	© 2012 ACM 1550-4859/2012/07-ART23 $15.00	10.1145/2240092.2240097	National Lab	1) Lawrence Livermore National Laboratory;	No	This material is based upon work supported by the National Science Foundation under award CNS-0520006. Any opinions, findings, and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the NSF. This work was performed under the auspices of the U.S. Department of Energy by Lawrence Livermore National Laboratory under contract DE-AC52-07NA27344. (Document LLNL-JRNL-432606.) c 2012 Association for Computing Machinery. ACM acknowledges that this contribution was authored or co-authored by a contractor or affiliate of the [U.S.] Government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies show this notice on the first page or initial screen of a display along with the full citation. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works requires prior specific permission and/or a fee. Permissions may be requested from Publications Dept., ACM, Inc., 2 Penn Plaza, Suite 701, New York, NY 10121-0701 USA, fax +1 (212) 869-0481, or permissions@acm.org.
Communications of the ACM: Volume 17 Issue 1, Jan. 1974	Jan-74	Syntax-directed least-errors analysis for context-free languages: a practical approach	Gordon Lyon	National Bureau of Standards, U.S. Dept. of Commerce, Washington, DC	Copyright © 1974, Association for Computing Machinery, Inc.	10.1145/360767.360771	Employee	Institute for Computer Sciences and Technology, National Bureau of Standards, U.S. Department of Commerce	No	General permission to republish, but not for profit, all or part of this material is granted provided that ACM's copyright notice is given and that reference is made to the publication, to its date of issue, and to the fact that reprinting privileges were granted by permission of the Association for Computing Machinery. This work was supported in part by the Mental Health Research Institute, University of Michigan, Ann Arbor. Author's address: U.S. Department of Commerce, National Bureau of Standards, A265 Tech, Washington, DC 20234.
SIGSIM PADS '14: Proceedings of the 2nd ACM SIGSIM Conference on Principles of Advanced Discrete Simulation	May-14	The earth system modeling framework: interoperability infrastructure for high performance weather and climate models	Cecelia DeLuca	University of Colorado/NOAA Earth System Research Laboratory, Boulder, CO, USA	Copyright is held by the author/owner(s).	10.1145/2601381.2611130	Unsure	University of Colorado/NOAA Earth System Research Laboratory, Boulder, CO, USA	No	Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage, and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the owner/author(s).
ACM Transactions on Mathematical Software (TOMS): Volume 16 Issue 2, June 1990	Jun-90	Algorithms 683: a portable FORTRAN subroutine for exponential integrals of a complex argument	Donald E. Amos	Sandia National Labs, Albuquerque, NM	© 1990 ACM 009%3500/90/0600-0178 $01.50	10.1145/78928.78934	National Lab	Author’s address: Sandia National Laboratories, Albuquerque, NM 87185.	No	This work was performed at Samba National Laboratories and supported by the U.S. Department of Energy under contract DE-AC04-76DP00789. Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Association for Computing Machinery. To copy otherwise, or to republish, requires a fee and/or specific permission.
SC '11: Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis	Nov-11	Simplified parallel domain traversal	1) Wesley Kendall, Jingyuan Wang, Melissa Allen, Jian Huang; 2) Tom Peterka; 3) David Erickson	1) The University of Tennessee, Knoxville; 2) Argonne National Laboratory; 3) Oak Ridge National Laboratory	Copyright 2011 ACM 978-1-4503-0771-0/11/11 ...$10.00.	10.1145/2063384.2063397	National Lab	2) Argonne National Laboratory; 3) Oak Ridge National Laboratory	no	Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. This work is funded primarily through the Institute of Ultra-Scale Visualization (http://www.ultravis.org) under the auspices of the SciDAC program within the U.S. Department of Energy.
Communications of the ACM: Volume 57 Issue 12, December 2014	Nov-14	The whole professional	Peter J. Denning	Director of the Cebrowski Institute for Information Innovation and Superiority at the Naval Postgraduate School in Monterey, CA, and a past president of ACM.	Copyright held by author.	10.1145/2676859	Employee	Director of the Cebrowski Institute for Information Innovation and Superiority at the Naval Postgraduate School in Monterey, CA, and a past president of ACM.	No	The author's views expressed here are not necessarily those of his employer or the U.S. federal government.
Communications of the ACM: Volume 42 Issue 9, Sept. 1999	Sep-99	Image generation systems in virtual training platforms	1) Philipp W. Peppler, Steve Stephens	1) Air Force Research Lab, Mesa, AZ	©1999 ACM 0002-0782/99/0800 $5.00	10.1145/315762.315782	Employee	Philipp W. Peppler (phil.peppler@williams.af.mil) is in charge of Visual System Development at the Air Force Research Laboratory/Warfighter Training Research Division, Mesa, AZ. Steve Stephens (steve.stephens@williams.af.mil) is a visual systems engineer at the Air Force Research Laboratory/Warfighter Training Research Division, Mesa, AZ.	No	Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. The Digital Library is published by the Association for Computing Machinery. Copyright © 1999 ACM, Inc.
FSE 2016: Proceedings of the 2016 24th ACM SIGSOFT International Symposium on Foundations of Software Engineering	Nov-16	String analysis for side channels with segmented oracles	1) Lucas Bang, Abdulbaki Aydin, Tevfik Bultan; 2) Quoc-Sang Phan; 3) Corina S. Păsăreanu	1) University of California at Santa Barbara, USA; 2) Carnegie Mellon Silicon Valley, USA; 3) Carnegie Mellon Silicon Valley, USA / NASA Ames Research Center, USA	© 2016 ACM. 978-1-4503-4218-6/16/11...$15.00	10.1145/2950290.2950362	Unsure	3) Carnegie Mellon Silicon Valley, USA / NASA Ames Research Center, USA	No	Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Permissions@acm.org. This material is based on research sponsored by NSF under grants CCF-1548848 and CCF-1549161 and by DARPA under agreement number FA8750-15-2-0087. The U.S. Government is authorized to reproduce and distribute reprints for Governmental purposes notwithstanding any copyright notation thereon. The views and conclusions contained herein are those of the authors and should not be interpreted as necessarily representing the official policies or endorsements, either expressed or implied, of DARPA or the U.S. Government. The term “Segmented Oracle” was defined by DARPA in a white paper distributed to us.
Supercomputing '91: Proceedings of the 1991 ACM/IEEE conference on Supercomputing	Aug-91	Graphical development tools for network-based concurrent supercomputing	1) Adam Beguelin, Jack J. Dongarra; 2) G.A. Geist	1) Oak Ridge National Laboratory and University of Tennessee; 2) Oak Ridge National Laboratory	© 1991 ACM 0-89791-459-7/91/0435 $01.50	10.1145/125826.126059	National Lab	1) Oak Ridge National Laboratory	No	This work was supported in part by the Applied Mathematical Sciences subprogram of the Office of Energy Research, U.S. Department of Energy, under Contract DE-AC05-840R21400 and the National Science Foundation Science and Technology Center Cooperative Agreement No. CCR-8809615.
Communications of the ACM: Volume 32 Issue 11, Nov. 1989	Nov-89	CHOOSING A NAME FOR YOUR COMPUTER	Don Libes	National Institute of Standards and Technology, Gaithersburg, MD	© 1989 ACM OOOl-0782/89/1100-1289 $1.50	10.1145/68814.316006	Employee	Don Libes is a computer scientist at the National Institute of Standards and Technology (formerly NBS), Gaithersburg, MD.	No	N/A
Communications of the ACM - Special section on computer architecture: Volume 28 Issue 1, Jan. 1985	Jan-85	On Educational Issues	Ana Maria Elvira	Lawrence Livermore National Laboratory G.P.O. Box 808 L-73 Livermore, CA 94550	N/A	10.1145/2465.314908	Employee	Lawrence Livermore National Laboratory G.P.O. Box 808 L-73 Livermore, CA 94550	No	N/A
SafeConfig '16: Proceedings of the 2016 ACM Workshop on Automated Decision Making for Active Cyber Defense	Oct-16	SafeConfig'16: Testing and Evaluation for Active & Resilient Cyber Systems Panel Verification of Active and Resilient Systems: Practical or Utopian?	1) Nicholas J. Multari, David O. Manz, Christopher Oehmen; 2) Anoop Singhal; 3) Robert Cowles; 4) Jorge Cuellar; 5) Gregory Shannon	1) Pacific Northwest National Lab, Richland, WA, USA; 2) National Institute of Standards and Technolgoy, Gaithersburg, MD, USA; 3) BrightLite Information Security, Menlo Park, CA, USA; 4) Siemens Corporation, Munich, Germany; 5) Office of Science and Technology Policy, Washington DC, USA	Copyright is held by the owner/author(s).	10.1145/2994475.2994486	Employee; National Lab	1) Pacific Northwest National Lab, Richland, WA, USA; 2) National Institute of Standards and Technolgoy, Gaithersburg, MD, USA; 5) Office of Science and Technology Policy, Washington DC, USA	No	Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.
MEMSYS '16: Proceedings of the Second International Symposium on Memory Systems	Oct-16	Low Latency, High Bisection-Bandwidth Networks for Exascale Memory Systems	1) Shang Li, Po-Chun Huang, David Banks, Max DePalma, Ahmed Elshaarany, Emily Ruppel, Yitian Wang, Bruce Jacob 2) Scott Hemmert, Arun Rodrigues, Jim Ang	1) Electrical & Computer Engineering, University of Maryland, College Park, Maryland, USA; 2) Scalable Computer Architectures, Sandia National Laboratories, Albuquerque, New Mexico, USA	© 2016 Copyright held by the owner/author(s). Publication rights licensed to ACM.	10.1145/2989081.298913	National Lab	2) Scalable Computer Architectures, Sandia National Laboratories, Albuquerque, New Mexico, USA	No	Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from permissions@acm.org. This work was supported in part by the Department of Energy under the Data Movement Dominates project, and in part by Northrop Grumman under the NCTA Cold Logic program
SC '11: State of the Practice Reports	Nov-11	SPOTlight on testing: stability, performance and operational testing of LANL HPC clusters	1) Georgia Pedicini, Jennifer Green	1) Los Alamos National Laboratory, Los Alamos, NM	Copyright is held by the author/owner(s)	10.1145/2063348.2063382	National Lab	1) Los Alamos National Laboratory, Los Alamos, NM	No	Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Los Alamos National Laboratory, an affirmative action/equal opportunity employer, is operated by Los Alamos National Security, LLC, for the National Nuclear Security Administration of the U.S. Department of Energy, under contract DE-AC52- 06NA25396. LA-UR-11-1145, approved for public release, distribution is unlimited.
ACM Transactions on Mathematical Software (TOMS): Volume 9 Issue 3, Sept. 1983	Sep-83	Algorithm 602: HURRY: An Acceleration Algorithm for Scalar Sequences and Series	1) Theodore Fessler, William Ford; 2) David A. Smith	1) Computer Services Division, NASA Lewis Research Center, Cleveland, OH; 2) Duke University	© 1983 ACM	10.1145/356044.356052	Employee	1) Computer Services Division, NASA Lewis Research Center, Cleveland, OH;	No	Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Association for Computing Machinery. To copy otherwise, or to republish, requires a fee and/or specific permission
Communications of the ACM - Supporting exploratory search: Volume 49 Issue 4, April 2006	Apr-06	Hastily formed networks	Peter J. Denning	Director of the Cebrowski Institute for Information Innovation and Superiority at the Naval Postgraduate School in Monterey, CA, and a past president of ACM.	©2006 ACM 0001-0782/06/0400 $5.00	10.1145/1121949.1121966	Employee	Director of the Cebrowski Institute for Information Innovation and Superiority at the Naval Postgraduate School in Monterey, CA, and a past president of ACM.	No	Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. The Digital Library is published by the Association for Computing Machinery. Copyright © 2006 ACM, Inc.
ICS '14: Proceedings of the 28th ACM international conference on Supercomputing	Jun-14	MT-MPI: multithreaded MPI for many-core environments	1) Antonio J. Peña, Pavan Balaji; 2) Masamichi Takagi; 3) Yutaka Ishikawa, Min Si	1) Argonne National Laboratory, Argonne, IL, USA; 2) NEC Corporation, Kawasaki, Japan; 3) University of Tokyo, Tokyo, Japan	Copyright is held by the owner/author(s). Publication rights licensed to ACM.	10.1145/2597652.2597658	National Lab	1) Argonne National Laboratory, Argonne, IL, USA;	No	ACM acknowledges that this contribution was authored or co-authored by an employee, contractor or affiliate of the United States government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only. This work was financially supported by (1) the CREST project of the Japan Science and Technology Agency (JST) and the National Project of MEXT called Feasibility Study on Advanced and Efficient Latency Core Architecture and (2) the U.S. Department of Energy, Office of Science, Advanced Scientific Computing Research, under Contract DE AC02- 06CH11357.
ACM Transactions on Mathematical Software (TOMS): Volume 21 Issue 1, March 1995	Mar-95	An improved incomplete Cholesky factorization	1) Mark T. Jones, Paul E. Plassmann	1) Argonne National Laboratory, Argonne, IL	© 1995 ACM 0098-3500/95/0300-0005 $03.50	10.1145/200979.200981	National Lab	Authors’ address: Argonnne National Laboratory, 9700 South Cass Avenue, Argonne, IL 60439-4801; email: plassman@mcs.anl. gov; jones@cs.utk.edu.	No	This work was supported by the Applied Mathematical Sciences subprogram of the OffIce of Energy Research, U.S. Department of Energy, under Contract W-31-109-Eng-38. Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Association for Computing Machinery. To copy otherwise, or to republish, requires a fee and/or specific permission.
ACM Communications in Computer Algebra: Volume 50 Issue 3, September 2016	Sep-16	Sparse polynomials in FLINT	1) A. Whitman Groves, Daniel S. Roche	1) United States Naval Academy	N/A	10.1145/3015306.3015314	Employee	1) United States Naval Academy	No	N/A
Communications of the ACM - Special issue: computing in the frontiers of science and engineering: Volume 28 Issue 11, Nov. 1985	Nov-85	Modeling california earthquakes and earth structures	Michael R. Raugh	NASA Ames Research Center, Moffett Field, CA	ACM/IEEE-CS Joint Issue 1985 ACM 0001-0782/65/1100-1130 75￠	10.1145/4547.4548	Employee	Author’s Present Address: Michael R. Raugh, Research Institute for Advanced Computer Science, Mail Stop 230-5, NASA Ames Research Center. Moffett Field, CA 94035.	No	Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear. and notice is given that copying is by permission of the Association for Computing Machinery. To copy otherwise, or to republish, requires a fee and/or specific permission.
Communications of the ACM - Scratch Programming for All: Volume 52 Issue 11, November 2009	Nov-09	Why web sites are lost (and how they're sometimes found)	1) Frank McCown; 2) Catherine C. Marshall; 3) Michael L. Nelson	1) Harding University, Searcy, AR.; 2) Microsoft Research, Silicon Valley.; 3) Old Dominion University	N/A	10.1145/1592761.1592794	Not Govt	Michael L. Nelson (mln@cs.odu.edu) is an associate professor of computer science at Old Dominion University. Prior to joining ODU, he worked at NASA Langley Research Center.	No	N/A
ACM Transactions on Mathematical Software (TOMS): Volume 13 Issue 3, Sept. 1987	Sep-87	Algorithm 651: Algorithm HFFT–high-order fast-direct solution of the Helmholtz equation	Ronald F. Boisvert	National Bureau of Standards, Scientific Computing Division, Tech A151, Gaithersburg, MD	This paper is a contribution of the National Bureau of Standards and is not subject to copyright in the United States.	10.1145/29380.214342	Employee	Author’s address: R. F. Boisvert, National Bureau of Standards, Scientific Computing Division, Tech A151, Gaithersburg, MD, 20899.	Yes	Certain proprietary products have been referenced in this paper in order to fully describe the testing and implementation of HFFT software. Identification of such products does not imply recommendation or endorsement by the National Bureau of Standards.
ACM Transactions on Mathematical Software (TOMS): Volume 28 Issue 2, June 2002	Jun-02	An overview of the sparse basic linear algebra subprograms: The new standard from the BLAS technical forum	1) Iain S. Duff; 2) Michael A. Heroux; 3) Roldan Pozo	1) CERFACS and Rutherford Appleton Laboratory, Oxon, United Kingdom; 2) Sandia National Laboratories, Avon, MN; 3) National Institute of Standards and Technology, Gaithersburg, MD	© 2002 ACM 0098-3500/02/0600-0239 $5.00	10.1145/567806.567810	Employee; National Lab	2) Sandia National Laboratories, Avon, MN; 3) National Institute of Standards and Technology, Gaithersburg, MD	No	Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or direct commercial advantage and that copies show this notice on the first page or initial screen of a display along with the full citation. Copyrights for components of this worked owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works requires prior specific permission and/or a fee. Permissions may be requested from Publications Dept., ACM, Inc., 1515 Broadway, New York, NY 10036 USA, fax: +1 (212) 869-0481, or permissions@acm.org.
EuroMPI 2016: Proceedings of the 23rd European MPI Users' Group Meeting	Sep-16	How I Learned to Stop Worrying and Love In Situ Analytics: Leveraging Latent Synchronization in MPI Collective Algorithms	1) Scott Levy, Kurt B. Ferreira, Patrick Widener; 2) Patrick G. Bridges, Oscar H. Mondragon	1) Center for Computing Research, Sandia National Laboratories; 2) Department of Computer Science, University of New Mexico	© 2016 ACM. ISBN 978-1-4503-4234-6/16/06. . . $15.00	10.1145/2966884.2966920	National Lab	1) Center for Computing Research, Sandia National Laboratories;	No	ACM acknowledges that this contribution was authored or co-authored by an employee, or contractor of the national government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only. Permission to make digital or hard copies for personal or classroom use is granted. Copies must bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. To copy otherwise, distribute, republish, or post, requires prior specific permission and/or a fee. Request permissions from permissions@acm.org.
PPoPP 2015: Proceedings of the 20th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming	Jan-15	A framework for practical parallel fast matrix multiplication	1) Austin R. Benson; 2) Grey Ballard	1) Stanford University, USA; 2) Sandia National Laboratories, USA	Copyright 2015 ACM 978-1-4503-3205-7/15/02...$15.00	10.1145/2688500.2688513	National Lab	2) Sandia National Laboratories, USA	No	Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Permissions@acm.org This research was supported in part by an appointment to the Sandia National Laboratories Truman Fellowship in National Security Science and Engineering, sponsored by Sandia Corporation (a wholly owned subsidiary of Lockheed Martin Corporation) as Operator of Sandia National Laboratories under its U.S. Department of Energy Contract No. DE-AC04-94AL85000. Austin R. Benson is also supported by an Office of Technology Licensing Stanford Graduate Fellowship. This research used resources of the National Energy Research Scientific Computing Center, which is supported by the Office of Science of the U.S. Department of Energy under Contract No. DEAC02-05CH11231.
Communications of the ACM: Volume 56 Issue 5, May 2013	May-13	The science in computer science	Peter J. Denning	Director of the Cebrowski Institute for Information Innovation and Superiority at the Naval Postgraduate School in Monterey, CA, and a past president of ACM.	Copyright held by author.	10.1145/2447976.2447988	Employee	Director of the Cebrowski Institute for Information Innovation and Superiority at the Naval Postgraduate School in Monterey, CA, and a past president of ACM.	No	The Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
ACM Transactions on Mathematical Software (TOMS): Volume 35 Issue 3, October 2008	Oct-08	Algorithm 888: Spherical Harmonic Transform Algorithms	1) John B. Drake, Pat Worley, Eduardo D’Azevedo	1) Oak Ridge National Laboratory	© 2008 ACM 0098-3500/2008/10-ART23 $5.00	10.1145/1391989.1404581	National Lab	Authors’ address: J. B. Drake, P. Worley, and E. D’Azevedo, Computer Science and Mathematics Division, Oak Ridge National Laboratory, P.O. Box 2008, MS 6367, Oak Ridge, Tennessee, 37831- 6367; email: drakejb@ornl.gov.	No	This research at Oak Ridge National Laboratory was supported by the Climate Change Prediction Program, Office of Biological and Environmental Research, U.S. Department of Energy under contract DE-AC05-84OR21400 with UT-Battelle, Inc. This research is sponsored by the Office of Advanced Scientific Computing Research and the Office of Biological and Environmental Research, U.S. Department of Energy. The work was performed at the Oak Ridge National Laboratory, which is managed by UT-Battelle, LLC under Contract Number DE-AC0500OR22725. c 2008 Association for Computing Machinery. ACM acknowledges that this contribution was authored or co-authored by a contractor or affiliate of the [U.S.] Government. As such, the Government retains a nonexclusive royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or direct commercial advantage and that copies show this notice on the first page or initial screen of a display along with the full citation. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credits is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works requires prior specific permission and/or a fee. Permissions may be requested from the Publications Dept., ACM, Inc., 2 Penn Plaza, Suite 701, New York, NY 10121-0701 USA, fax +1 (212) 869-0481, or permission@acm.org.
ACM Transactions on Sensor Networks (TOSN): Volume 7 Issue 3, September 2010	Sep-10	Approximation algorithms for computing minimum exposure paths in a sensor field	Hristo N. Djidjev	Los Alamos National Laboratory, Los Alamos, NM	© 2010 ACM 1550-4859/2010/09-ART23 $10.00	10.1145/1807048.1807052	National Lab	Author’s address: Hristo Djidjev, Los Alamos National Laboratory, Los Alamos, NM 87545; email: djidjev@lanl.gov	No	This work has been supported by the Department of Energy under contract W-705-ENG-36. c 2010 Association for Computing Machinery. ACM acknowledges that this contribution was authored or co-authored by a contractor or affiliate or the U.S. Government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies show this notice on the first page or initial screen of a display along with the full citation. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works requires prior specific permission and/or a fee. Permissions may be requested from Publications Dept., ACM, Inc., 2 Penn Plaza, Suite 701, New York, NY 10121-0701 USA, fax +1 (212) 869-0481, or permissions@acm.org.
Communications of the ACM: Volume 16 Issue 2, Feb. 1973	Feb-73	Solution of the transcendental equation wew = x	1) F. N. Fritsch, R. E. Shafer, W. P. Crowley	1) University of California, Lawrence Livermore Laboratory, Livermore, CA 94550	Copyright © 1973, Association for Computing Machinery, Inc.	10.1145/361952.361970	National Lab	1) University of California, Lawrence Livermore Laboratory, Livermore, CA 94550	No	General permission to republish, but not for profit, an algorithm is granted, provided that reference is made to this publication, to its date of issue, and to the fact that reprinting privileges were granted by permission of the Association for Computing Machinery. Work performed under the auspices of the U.S. Atomic Energy Commission.
SC '15: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis	Nov-15	High-performance algebraic multigrid solver optimized for multi-core based distributed parallel systems	1) Jongsoo Park, Mikhail Smelyanskiy, Dheevatsa Mudigere, Pradeep Dubey; 2) Ulrike Meier Yang	1) Intel Corporation; 2) Lawrence Livermore National Laboratory	© 2015 ACM. ISBN 978-1-4503-3723-6/15/11. . . $15.00	10.1145/2807591.2807603	National Lab	2) Lawrence Livermore National Laboratory	No	Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from permissions@acm.org.
Communications of the ACM: Volume 42 Issue 9, Sept. 1999	Sep-99	Distributed mission training: teams, virtual reality, and real-time networking	1) R. Ramesh; 2) Dee H. Andrews	1) SUNY, Buffalo, NY; 2) Air Force Research Lab., Mesa, AZ	©1999 ACM 0002-0782/99/0800 $5.00	10.1145/315762.315775	Employee	Dee H. Andrews (Dee.Andrews@williams.af.mil) is the technical advisor of the Warfighter Training Research Division, Air Force Research Laboratory, Mesa, AZ.	No	Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. The Digital Library is published by the Association for Computing Machinery. Copyright © 1999 ACM, Inc.
ACM Transactions on Mathematical Software (TOMS): Volume 23 Issue 2, June 1997	Jun-97	Algorithm 768: TENSOLVE: a software package for solving systems of nonlinear equations and nonlinear least-squares problems using tensor methods	1) Ali Bouaricha; 2) Robert B. Schnabel	1) Argonne National Lab, Argonne, IL; 2) Univ. of Colorado at Boulder, Boulder	© 1997 ACM 0098-3500/97/0600 –0174 $3.50	10.1145/264029.264032	National Lab	Authors’ addresses: A. Bouaricha, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL 60439	No	Permission to make digital/ hard copy of part or all of this work for personal or classroom use is granted without fee provided that the copies are not made or distributed for profit or commercial advantage, the copyright notice, the title of the publication, and its date appear, and notice is given that copying is by permission of the ACM, Inc. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/ or a fee
Supercomputing '89: Proceedings of the 1989 ACM/IEEE conference on Supercomputing	Aug-89	Parallel language constructs for tensor product computations on loosely coupled architectures	1) P. Mehrotra, J. van Rosendale	1) Institute for Computer Applications in Science and Engineering, NASA Langley Research Center, Hampton, VA	© 1989 ACM 089791-341-8/89/0011/0616$1.50	10.1145/76263.76333	Employee	1) Institute for Computer Applications in Science and Engineering, NASA Langley Research Center, Hampton, VA	No	Research supported by the Institute for Defense Analysis undcr contract IDA 10-00008, by the Office of Naval Research under contract ONR N00014-88-M-0108, and by the National Acronautics and Space Administration under NASA contract NASl-18605 while the authors were in residence at ICASE, Mail Stop 132C, NASA Langley Research Center, Hampton, VA 23665. Permission to copy withou\ fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Association for Computing Machinery. To copy otherwise, or to republish, requires a fee and/or specific permission
ACM Transactions on Architecture and Code Optimization (TACO): Volume 13 Issue 4, December 2016	Dec-16	User-Assisted Store Recycling for Dynamic Task Graph Schedulers	1) Mehmet Can Kurt; 2) Sriram Krishnamoorthy; 3) Gagan Agrawal; 4) Bin Ren	1) Quantcast Corporation, San Francisco, CA; 2) Pacific Northwest National Laboratory, Richland, WA; 3) The Ohio State University, Neil Avenue Columbus, OH; 4) The College of William and Mary, Williamsburg, VA	© 2016 ACM 1544-3566/2016/12-ART55 $15.00	10.1145/3018111	National Lab	Authors' Addresses: S. Krishnamoorthy, Pacific Northwest National Laboratory, 902 Battelle Blvd, Richland, WA 99354; email: sriram@pnnl.gov;	No	This work was supported in part by the U.S. Department of Energy’s (DOE) Office of Science, Office of Advanced Scientific Computing Research, under award 63823. Pacific Northwest National Laboratory is operated by Battelle for DOE under Contract DE-AC05-76RL01830. This work was also partially supported by NSF awards CCF-1319420 and CCF-1629392 and the Department of Energy (DOE) award DE-SC0014135 to The Ohio State University. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies show this notice on the first page or initial screen of a display along with the full citation. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works requires prior specific permission and/or a fee. Permissions may be requested from Publications Dept., ACM, Inc., 2 Penn Plaza, Suite 701, New York, NY 10121-0701 USA, fax +1 (212) 869-0481, or permissions@acm.org.
Communications of the ACM: Volume 59 Issue 2, February 2016	Feb-16	YFCC100M: the new data in multimedia research	1) Bart Thomee, David A. Shamma; 2) Gerald Friedland, Damian Borth, Benjamin Elizalde; 3) Karl Ni, Douglas Poland; 4) Li-Jia Li	1) Yahoo Labs and Flickr in San Francisco, CA; 2) International Computer Science Institute in Berkeley, CA; 3) Lawrence Livermore National Laboratory in Livermore, CA; 4) Yahoo Labs, San Francisco, CA	Copyright held by authors. Publication rights licensed to ACM.	10.1145/2812802	National Lab	Karl Ni (kni@iqt.org) is a program lead and senior data scientist at In-Q-Tel's Lab41 in Menlo Park, CA; this work was done while he was at Lawrence Livermore National Laboratory in Livermore, CA. Douglas Poland (poland1@llnl.gov) is a principal investigator at the Lawrence Livermore National Laboratory in Livermore, CA.	No	The Digital Library is published by the Association for Computing Machinery. Copyright © 2016 ACM, Inc
Communications of the ACM: Volume 38 Issue 7, July 1995	Jul-95	The assessment of end-user training needs	1) R. Ryan Nelson, Ellen M. Whitener; 2) Henry H. Philcox	1) McIntire School of Commerce, University of Virginia, Charlottesville, VA; 2) Internal Revenue Service, Department of the Treasury, Washington, D.C.	© ACM 0002-0782/95/0700 $3.50	10.1145/213859.214793	Employee	HANK PHILCOX has been the Chief Information Officer of the Internal Revenue Service since 1990. As CIO, he is responsible for the design, development, implementation and operation of nationwide computer and telecommunications systems in the IRS. He is the chief architect of the Service’s tax systems modernization (TSM) technology plan, a 10-year multibillion-dollar project to reinvent the IRS with more modern information systems. Author’s Present Address: Internal Revenue Service, Department of the Treasury, Washington, D. C. 20224	No	Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Association for Computing Machinery. To copy otherwise, or to republish, requires a fee and/or specific permission.
Communications of the ACM: Volume 58 Issue 7, July 2015	Jul-15	The future of computer science and engineering is in your hands	1) Vijay Kumar; 2) Thomas A. Kalil	1) University of Pennsylvania; 2) White House Office of Science and Technology Policy	Copyright held by authors.	10.1145/2668022	Employee	Thomas A. Kalil (Thomas_A._Kalil@ostp.eop.gov) is Deputy Director for Technology and Innovation at the White House Office of Science and Technology Policy.	No	The Digital Library is published by the Association for Computing Machinery. Copyright © 2015 ACM, Inc.
Supercomputing '91: Proceedings of the 1991 ACM/IEEE conference on Supercomputing	Aug-91	Measurement of memory access contentions in multiple vector processor systems	1) Ingrid Y. Bucher, Margaret L. Simmons	1) Computer Research Group, Los Alamos National Laboratory, Los Alamos, NM	© 1991ACM 0-89791-459-7/91/0806 $01.50	10.1145/125826.126197	National Lab	Computer Research Group, Los Alamos National Laboratory, Los Alamos, NM	No	Work was performed under the auspices of the U.S. Department of Energy under contract W-7405-ENG-36.
SC '01: Proceedings of the 2001 ACM/IEEE conference on Supercomputing	Nov-01	The design of I/O-efficient sparse direct solvers	1) Florin Dobrian; 2) Alex Pothen	1) Old Dominion University, Norfolk, VA; 2) ICASE, NASA Langley Research Center, Hampton VA	(c) 2001 ACM 1-58113-293-X/01/0011 $5.00	10.1145/582034.582073	Unsure	2) ICASE, NASA Langley Research Center, Hampton VA	No	Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage, and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee.
Journal of the ACM (JACM): Volume 31 Issue 1, Jan. 1984	Jan-84	Random Trees and the Analysis of Branch and Bound Procedures	Douglas R. Smith	Office of Naval Research, Code 433, Information Sciences Division, Room 631, 800 N. Quincy Street, Arlington, VA	© 1984 ACM 0004-5411/84/0100-0163 $00.75	10.1145/2422.322422	Employee	Office of Naval Research, Code 433, Information Sciences Division, Room 631, 800 N. Quincy Street, Arlington, VA	No	This work was supported m part by NSF grant MC74-14445-AO 1. Permission to copy without fee all or part of th~s material is granted provided that the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the pubhcation and its date appear, and noUce is gwen that copying is by permission of the Association for Computing Machinery. To copy otherwise, or to republish, requires a fee and/or specific permission.
SA '11: Proceedings of the 2011 SIGGRAPH Asia Conference	Dec-11	A rendering framework for multiscale views of 3D models	1) Wei-Hsien Hsu, Kwan-Liu Ma; 2) Carlos Correa	1) University of California at Davis; 2) Lawrence Livermore National Laboratory	© 2011 ACM 0730-0301/2011/12-ART131 $10.00	10.1145/2024156.2024165	National Lab	2) Lawrence Livermore National Laboratory	No	Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profi t or direct commercial advantage and that copies show this notice on the first page or initial screen of a display along with the full citation. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works requires prior specifi c permission and/or a fee. Permissions may be requested from Publications Dept., ACM, Inc., 2 Penn Plaza, Suite 701, New York, NY 10121-0701, fax +1 (212) 869-0481, or permissions@acm.org.
ACM Transactions on Mathematical Software (TOMS): Volume 22 Issue 4, Dec. 1996	Dec-96	The computation of elementary unitary matrices	R. B. Lehoucq	Argonne National Lab., Argonne, IL	© 1996 ACM 0098-3500/96/1200 –0393 $03.50	10.1145/235815.235817	National Lab	Author’s address: Mathematics and Computer Science Division, Building 221, Argonne National Laboratory, 9700 South Cass Avenue, Argonne, IL 60439-4841; email: lehoucq@mcs.anl.gov; http://www.mcs.anl.gov/home/LEHOUCQ/index.html.	No	This work was supported in part by ARPA (U.S. Army ORA4466.01), by the U.S. Department of Energy (contracts DE-FG0f-91ER25103 and W-31-109-Eng-38), and by the National Science Foundation (cooperative agreement CCR-9120008). Permission to make digital/ hard copy of part or all of this work for personal or classroom use is granted without fee provided that the copies are not made or distributed for profit or commercial advantage, the copyright notice, the title of the publication, and its date appear, and notice is given that copying is by permission of the ACM, Inc. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/ or a fee
SC '09: Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis	Nov-09	Scalable temporal order analysis for large scale debugging	1) Dong H. Ahn, Bronis R. de Supinski, Gregory L. Lee, Martin Schulz; 2) Ignacio Laguna; 3) Ben Liblit, Barton P. Miller,	1) Lawrence Livermore National Laboratory, Livermore, CA; 2) Purdue University, West Lafayette, IN; 3) University of Wisconsin, Madison, WI	Copyright 2009 ACM 978-1-60558-744-8/09/11 ...$10.00.	10.1145/1654059.1654104	National Lab	1) Lawrence Livermore National Laboratory, Livermore, CA;	No	This work was performed under the auspices of the U.S. Department of Energy by Lawrence Livermore National Laboratory under contract DE-AC52-07NA27344 (LLNL-PROC-412227). It is supported in part by LLNL contracts B579934 and B580360; Department of Energy grants 93ER25176, 07ER25800, and 08ER25842; AFOSR grant FA9550-07-1-0210; and NSF grants CCF-0621487, CCF-0701957, and CNS-0720565. The U.S. Government is authorized to reproduce and distribute reprints for Governmental purposes notwithstanding any copyright notation thereon. Any opinions, findings, and conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect the views of NSF or other institutions. Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee.
Communications of the ACM: Volume 11 Issue 12, Dec. 1968	Dec-68	An algorithm for deriving the equations of mathematical physics by symbolic manipulation	1) James C. Howard, Howard Tashjian	1) NASA Ames Research Center, Moffett Field, CA	N/A	10.1145/364175.364194	Employee	1) NASA Ames Research Center, Moffett Field, CA	No	N/A
Communications of the ACM: Volume 17 Issue 3, March 1974	Mar-74	Efficient implementation of a variable projection algorithm for nonlinear least squares problems	Fred T. Krogh	Jet Propulsion Laboratory, California Institute of Technology	Copyright © 1974, Association for Computing Machinery, Inc.	10.1145/360860.360914	Employee	Jet Propulsion Laboratory, California Institute of Technology	No	General permission to republish, but not for profit, all or part of this material is granted provided that ACM's copyright notice is given and that reference is made to the publication, to its date of issue, and to the fact that reprinting privileges were granted by permission of the Association lbr Computing Machinery. This paper presents the results of one phase of research carried out at the Jet Propulsion Laboratory, California Institute of Technology, under Contract NAS7-100, sponsored by NASA. Author's address: Jet Propulsion Laboratory, California Institute of Technology, 4800 Oak Grove Drive, Pasadena, CA 91103.
ACM Transactions on Modeling and Computer Simulation (TOMACS): Volume 23 Issue 2, May 2013	May-13	Reversible simulations of elastic collisions	1) Kalyan S. Perumalla, Vladimir A. Protopopescu	1) Oak Ridge National Laboratory, Oak Ridge, TN	© 2013 ACM 1049-3301/2013/05-ART12 $15.00	10.1145/2457459.2457461	National Lab	Authors’ address: K. S. Perumalla and V. A. Protopopescu, Computational Sciences and Engineering Division, Oak Ridge National Laboratory, 1 Bethel Valley Road, Oak Ridge, TN 37831. Correspondence email: perumallaks@ornl.gov.	No	This article has been authored by UT-Battelle, LLC, under contract DE-AC05-00OR22725 with the U.S. Department of Energy. c 2013 Association for Computing Machinery. ACM acknowledges that this contribution was authored or co-authored by a contractor or affiliate of the U.S. Government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies show this notice on the first page or initial screen of a display along with the full citation. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works requires prior specific permission and/or a fee. Permissions may be requested from Publications Dept., ACM, Inc., 2 Penn Plaza, Suite 701, New York, NY 10121-0701 USA, fax +1 (212) 869-0481, or permissions@acm.org.
SC '07: Proceedings of the 2007 ACM/IEEE conference on Supercomputing	Nov-07	The ghost in the machine: observing the effects of kernel operation on parallel application performance	1) Aroon Nataraj, Alan Morris, Allen D. Malony; 2) Matthew Sottile; 3) Pete Beckman	1) University of Oregon, Eugene, OR; 2) Los Alamos National Lab; 3) Argonne National Laboratory	Copyright 2007 ACM 978-1-59593-764-3/07/0011 ...$5.00.	10.1145/1362622.1362662	National Lab	2) Los Alamos National Lab; 3) Argonne National Laboratory	No	(c) 2007 Association for Computing Machinery. ACM acknowledges that this contribution was authored or co-authored by a contractor or affiliate of the [U.S.] Government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only.
SC '11: Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis	Nov-11	Scalable stochastic optimization of complex energy systems	1) Miles Lubin, Cosmin G. Petra, Mihai Anitescu, Victor Zavala	1) Argonne National Laboratory, Argonne, IL	Copyright 2011 ACM 978-1-4503-0771-0/11/11 ...$10.00.	10.1145/2063384.2063470	National Lab	1) Argonne National Laboratory, Argonne, IL	No	Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. This work used resources of the Argonne Leadership Computing Facility, which is supported by the Office of Science of the U.S. Department of Energy under Contract DE-AC02-06CH11357. This work was supported by the U.S. Department of Energy under Contract DE-AC02-06CH11357.
XSEDE16: Proceedings of the XSEDE16 Conference on Diversity, Big Data, and Science at Scale	Jul-16	TopoLens: Building a CyberGIS Community Data Service for Enhancing the Usability of High-resolution National Topographic Datasets	1) Hao Hu, Shaowen Wang; 2) Xingchen Hong, Jeff Terstriep, Yan Y. Liu, Johnathan Rush; 3) Michael P. Finn, Jeffrey Wendel	1) Department of Geography and Geographic Information Science, University of Illinois at Urbana-Champaign, Champaign, IL; 2) National Center for Supercomputing Applications, University of Illinois at Urbana-Champaign, Urbana, IL; 3) U.S. Geological Survey, Center of Excellence for Geospatial Information Science, Denver, Colorado, USA	© 2016 ACM. ISBN 978-1-4503-4755-6/16/07. . . $15.00	10.1145/2949550.2949652	Employee	3) U.S. Geological Survey, Center of Excellence for Geospatial Information Science, Denver, Colorado, USA	No	ACM acknowledges that this contribution was authored or co-authored by an employee, or contractor of the national government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only. Permission to make digital or hard copies for personal or classroom use is granted. Copies must bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. To copy otherwise, distribute, republish, or post, requires prior specific permission and/or a fee. Request permissions from permissions@acm.org. Any use of trade, firm, or product names is for descriptive purposes only and does not imply endorsement by the U.S. Government.
Journal of the ACM (JACM): Volume 20 Issue 3, July 1973	Jul-73	Efficient Ordering of Set Expressions for Symbolic Expansion	1) R. B. Worrell, B. L. Hulme	1) Saftey Assurance Studies Division, Sandia Laboratories, Albuquerque, New Mexico	Copyright © 1973, Association for Computing Machinery, Inc	10.1145/321765.321779	National Lab	1) Saftey Assurance Studies Division, Sandia Laboratories, Albuquerque, New Mexico	No	General permission to republish, but not for profit, all or part of this material is granted provided that ACM's copyright notice is given and that references made to the publication, to its date of issue, and to the fact that reprinting privileges were granted by permission of the Association for Computing Machinery. This work was supported by the U.S. Atomic Energy Commission.
Communications of the ACM: Volume 60 Issue 3, March 2017	Mar-17	Making the field of computing more inclusive	1) Jonathan Lazar; 2) Elizabeth F. Churchill; 3) Tovi Grossman; 4) Gerrit van der Veer; 5) Philippe Palanque; 6) John "Scooter" Morris; 7) Jennifer Mankoff	1) Towson University, Towson, MD; 2) Google, San Francisco, CA; 3) Autodesk Research, Toronto, Canada; 4) Vrije Universiteit Amsterdam, the Netherlands and Twente University, Twente, the Netherlands and Dutch Open University, Heerlen, Netherlands and Dalian Maritime University, Dalian, China and Lushu ...; 5) Université Paul Sabatier Paul Sabatier -- Toulouse III, France and IRIT laboratory, Toulouse, France; 6) University of California San Francisco and University of California San Francisco; 7) Carnegie Mellon University, Pittsburgh, PA	©2017 ACM 0001-0782/17/03	10.1145/2993420	Not Govt	No government agencies appear in the author affiliations	No	N/A
ACM Transactions on Knowledge Discovery from Data (TKDD): Volume 10 Issue 3, February 2016	Feb-16	DeltaCon: Principled Massive-Graph Similarity Function with Attribution	1) Danai Koutra; 2) Neil Shah, Christos Faloutsos; 3) Joshua T. Vogelstein; 4) Brian Gallagher	1) Computer Science and Engineering, University of Michigan, Ann Arbor; 2) Computer Science Department, Carnegie Mellon University, Pittsburgh, PA; 3) Department of Biomedical Engineering & Institute of Computational Medicine, Johns Hopkins University Child Mind Institute; 4) Lawrence Livermore National Laboratory	© 2016 ACM 1556-4681/2016/02-ART28 $15.00	10.1145/2824443	National Lab	4) Lawrence Livermore National Laboratory	No	Funding was provided by the U.S. Army Research Office (ARO) and Defense Advanced Research Projects Agency (DARPA) under Contract Number W911NF-11-C-0088. This work was performed under the auspices of the U.S. Department of Energy by Lawrence Livermore National Laboratory under Contracts DE-AC52- 07NA27344, N66001-15-C-4041, DARPA (SIMPLEX) and DARPA (GRAPHS). Research was also sponsored by the Army Research Laboratory and was accomplished under Cooperative Agreement Number W911NF- 09-2-0053. It was also partially supported by an IBM Faculty Award, a Google Focused Research Award, and a Yahoo Research Alliance Gift. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies show this notice on the first page or initial screen of a display along with the full citation. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works requires prior specific permission and/or a fee. Permissions may be requested from Publications Dept., ACM, Inc., 2 Penn Plaza, Suite 701, New York, NY 10121-0701 USA, fax +1 (212) 869-0481, or permissions@acm.org.
ACM Transactions on Mathematical Software (TOMS): Volume 6 Issue 1, March 1980	Mar-80	A Comparative Study of Two Methods for Staircase Linear Programs	1) James K. Ho; 2) Etienne Loute	1) Applied Mathematics Department, Brookhaven National Laboratory, Upton, NY; 2) C.O.R.E., Université Catholique de Louvain, Louvain-la-Neuva, Belgium	©1980 ACM 0098-3500/80/0300-0017 $00.75	10.1145/355873.355875	National Lab	1) Applied Mathematics Department, Brookhaven National Laboratory, Upton, NY;	No	N/A
Communications of the ACM: Volume 58 Issue 9, September 2015	Sep-15	Trustworthy hardware from untrusted components	1) Simha Sethumadhavan, Yipeng Huang; 2) Adam Waksman; 3) Matthew Suozzo; 4) Julianna Eum	1) Columbia University, New York; 2) The D. E. Shaw Group, New York; 3) Chip Scan LLC, New York; 4) U.S. Military Academy at West Point, New York	©2015 ACM 0001-0782/15/09	10.1145/2699412	Not Govt	Julianna Eum (julianna.eum@usma.edu) is an instructor in the Department of Electrical Engineering and Computer Science of the U.S. Military Academy at West Point, New York; her work on this article was performed when she was a student at Columbia University, New York.	No	Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and full citation on the first page. Copyright for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or fee. Request permission to publish from permissions@acm.org or fax (212) 869-0481. The Digital Library is published by the Association for Computing Machinery. Copyright © 2015 ACM, Inc.
Communications of the ACM: Volume 59 Issue 5, May 2016	May-16	Future Tense: Becoming a Multi-Planet Species	Louis Friedman	co-founded The Planetary Society with Carl Sagan and Bruce Murray, serving as the organization's executive director for 30 years, worked on deep-space missions at the Jet Propulsion Laboratory in Pasadena, CA, and was co-leader of the Keck Institute for Space Studies Asteroid Retrieval Mission and Interstellar Medium Exploration Studies at Caltech.	©2016 ACM 0001-0782/16/05	10.1145/2904352	Not Govt	No government agencies appear in the author affiliations	No	N/A
ICSE '97: Proceedings of the 19th international conference on Software engineering	May-97	Measuring requirements testing:: experience report	1) Theodore Hammer, Lawrence Hyatt; 2) Linda Rosenberg; 3) Lenore Huffman,	1) NASA/GSFC, Code 303, Greenbelt, MD; 2) Unisys Federal Systems, Code 300.1, Greenbelt, MD; 3) SATC, Code 300.1, Greenbelt, MD	N/A	10.1145/253228.253358	Employee	1) NASA/GSFC, Code 303, Greenbelt, MD	No	N/A
ACM Transactions on Knowledge Discovery from Data (TKDD): Volume 9 Issue 2, November 2014	Nov-14	User Vulnerability and Its Reduction on a Social Networking Site	1) Geoffrey Barbier; 2) Jiliang Tang, Huan Liu, Pritam Gundecha	1) Air Force Research Laboratory, Wright-Patterson Air Force Base, OH; 2) Arizona State University, Tempe, AZ	© 2014 ACM 1556-4681/2014/09-ART12 $15.00	10.1145/2630421	Unsure	Authors' Addresses: G. Barbier, Air Force Research Laboratory (AFRL), Wright-Patterson Air Force Base, OH; email: Geoffrey. Barbier@wpafb.af.mil. The majority of this work was conducted when Geoffrey Barbier was affiliated with the Computer Science Department at Arizona Sate University.	No	This work is supported by grants of ARO (025071), ONR (N000141010091, N000141410095), and AFOSR (FA95500810132). This work was also funded, in part, by OSD-T&E (Office of Secretary Defense-Test and Evaluation), DefenseWide/PE0601120D8Z National Defense Education Program (NDEP)/BA-1, Basic Research; SMART Program Office, www.asee.org/fellowships/smart, Grant Number N00244-09-1-0081. The majority of this work was conducted when Geoffrey Barbier was affiliated with the Computer Science Department at Arizona Sate University. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies show this notice on the first page or initial screen of a display along with the full citation. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works requires prior specific permission and/or a fee. Permissions may be requested from Publications Dept., ACM, Inc., 2 Penn Plaza, Suite 701, New York, NY 10121-0701 USA, fax +1 (212) 869-0481, or permissions@acm.org.
ACM Transactions on Mathematical Software (TOMS): Volume 24 Issue 2, June 1998	Jun-98	Algorithm 782: codes for rank-revealing QR factorizations of dense matrices	1) C. H. Bischof; 2) G. Quintana-Ortí	1) Argonne National Lab, Argonne, IL; 2) Univ. Jaime I, Castellón, Spain	© 1998 ACM 0098-3500/98/0600–0254 $5.00	10.1145/290200.287638	National Lab	Authors’ addresses: C. H. Bischof, Mathematics and Computer Science Division, Argonne National Laboratory, Building 221, 9700 South Cass Avenue, Argonne, IL 60439; email: bischof@mcs.anl.gov.	No	This work was supported by the Applied and Computational Mathematics Program, Advanced Research Projects Agency, under contracts DM28E04120 and P-95006. Bischof was also supported by the Mathematical, Information, and Computational Sciences Division subprogram of the Office of Computational and Technology Research, U. S. Department of Energy, under Contract W-31-109-Eng-38. Quintana also received support through the Spanish Research Agency CICYT under grant TIC96-1062-C03-03. During part of this work, Quintana was a research fellow of the Spanish Ministry of Education and Science of the Valencian Government at the Universidad Politécnica de Valencia and while visiting the Mathematics and Computer Science Division at Argonne National Laboratory Permission to make digital/hard copy of part or all of this work for personal or classroom use is granted without fee provided that the copies are not made or distributed for profit or commercial advantage, the copyright notice, the title of the publication, and its date appear, and notice is given that copying is by permission of the ACM, Inc. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee
ACM Transactions on Mathematical Software (TOMS) - Special issue on the Advanced CompuTational Software (ACTS) Collection: Volume 31 Issue 3, September 2005	Sep-05	An overview of SuperLU: Algorithms, implementation, and user interface	Xiaoye S. Li	Lawrence Berkeley National Laboratory	© 2005 ACM 0098-3500/05/0900-0302 $5.00	10.1145/1089014.1089017	National Lab	Author’s address: Lawrence Berkeley National Laboratory, MS 50F 1650, One Cyclotron Road, Berkeley, CA 94720; email: xsli@lbl.gov.	No	This work was supported in part by the Director, Office of Advanced Scientific Computing Research, Division of Mathematical, Information, and Computational Sciences of the U.S. Department of Energy, under contract number DE-AC03-76SF00098, and in part by the National Science Foundation Cooperative Agreement No. ACI-9619020, NSF Grant No. ACI-9813362. c 2005 Association for Computing Machinery. ACM acknowledges that this contribution was authored or co-authored by a contractor or affiliate of the [U.S.] Government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or direct commercial advantage and that copies show this notice on the first page or initial screen of a display along with the full citation. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works requires prior specific permission and/or a fee. Permissions may be requested from Publications Dept., ACM, Inc., 1515 Broadway, New York, NY 10036 USA, fax: +1 (212) 869-0481, or permissions@acm.org.
ACM SIGPLAN Notices: Volume 32 Issue 1, Jan. 1997	Jan-97	Provably-secure programming languages for remote evaluation	Dennis Volpano	Naval Postgraduate School, Monterey	N/A	10.1145/251595.254091	Employee	Naval Postgraduate School, Monterey	No	N/A
Communications of the ACM: Volume 42 Issue 4, April 1999	Apr-99	Experiments on evolving software models of analog circuits	Jason D. Lohn	NASA Ames Research Center, Moffett Field, CA	©1999 ACM 0002-0782/99/0400 $5.00	10.1145/299157.299875	Unsure	Jason D. Lohn (jlohn@ptolemy.arc.nasa.gov) is a research scientist with the Caelum Research Corporation at NASA Ames Research Center in Moffett Field, CA.	No	Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. The Digital Library is published by the Association for Computing Machinery. Copyright © 1999 ACM, Inc.
ACM Transactions on Mathematical Software (TOMS): Volume 18 Issue 2, June 1992	Jun-92	A quadratic-tensor model algorithm for nonlinear least-squares problems with linear constraints	1) R. J. Hanson; 2) Fred T. Krogh	1) IMSL, Inc., Sugar Land, TX; 2) Jet Propulsion Lab, Pasadena, CA	© 1992 ACM 0099 -2!500/92/0600-0115 $01.50	10.1145/146847.146857	Employee	2) Jet Propulsion Lab, Pasadena, CA	No	The research of R. J. Hanson was carried out by U.S. Dept. of Energy at Sandia National Laboratories. Additional work done while at the Applied Dynamics International Corp., Ann Arbor, Michigan. The research of F. T. Krogh was carried out at the Jet Propulsion Laboratory, California Institute of Technology, under contract with the National Aeronautics and Space Administration.
Communications of the ACM - Blueprint for the future of high-performance networking: Volume 46 Issue 11, November 2003	Nov-03	Data integration in a bandwidth-rich world	1) Ian Foster; 2) Robert L. Grossman	1) Argonne National Laboratory, Argonne, IL & The University of Chicago; 2) University of Illinois at Chicago & Two Cultures Group, Chicago	©2003 ACM 0002-0782/03/1100 $5.00	10.1145/948383.948409	National Lab	Ian Foster (foster@mcs.anl.gov) is associate division director and senior scientist at Argonne National Laboratory, Argonne, IL, and a professor of computer science at The University of Chicago.	No	Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. The Digital Library is published by the Association for Computing Machinery. Copyright © 2003 ACM, Inc.
ACM Transactions on Storage (TOS): Volume 9 Issue 3, August 2013	Aug-13	A Prefetching Scheme Exploiting both Data Layout and Access History on Disk	1) Song Jiang, Yuehai Xu; 2) Xiaoning Ding; 3) Kei Davis	1) Wayne State University; 2) New Jersey Institute of Technology; 3) Los Alamos National Laboratory	© 2013 ACM 1553-3077/2013/08-ART10 $15.00	10.1145/2508010	National Lab	Authors' Addresses: K. Davis, CCS Division, Los Alamos National Laboratory, Los Alamos, NM 87545.	No	This research was supported in part by National Science Foundation grants CCF-0702500, CCF-0845711, CAREER CCF-0845711, CNS-1117772, and CNS-1217948. c 2013 Association for Computing Machinery. ACM acknowledges that this contribution was authored or co-authored by a contractor or affiliate of the U.S. Government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies show this notice on the first page or initial screen of a display along with the full citation. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works requires prior specific permission and/or a fee. Permissions may be requested from Publications Dept., ACM, Inc., 2 Penn Plaza, Suite 701, New York, NY 10121-0701 USA, fax +1 (212) 869-0481, or permissions@acm.org.
ACM Transactions on Graphics (TOG) - Proceedings of ACM SIGGRAPH 2006: Volume 25 Issue 3, July 2006	Jul-06	Spectral surface quadrangulation	1) Shen Dong, Peer-Timo Bremer, Michael Garland, John C. Hart; 2) Valerio Pascucci	1) University of Illinois at Urbana-Champaign; 2) Lawrence Livermore National Laboratory	© 2006 ACM 0730-0301/06/0700-1057 $5.00	10.1145/1141911.1141993	National Lab	2) Lawrence Livermore National Laboratory	No	Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Permissions Dept, ACM Inc., fax +1 (212) 869-0481 or e-mail permissions@acm.org. This work was funded in part by the National Science Foundation (grants SGER #0432257 and ITR #0121288), and was performed in part under the auspices of the U.S. Department of Energy by the University of California Lawrence Livermore National Laboratory under contract No. W-7405-Eng-48.
Communications of the ACM: Volume 55 Issue 2, February 2012	Feb-12	Software as a service for data scientists	1) Bryce Allen, Jack Kordas, Mike Link, Stuart Martin, Karl Pickett, Steven Tuecke; 2) John Bresnahan; 3) Lisa Childers, Ian Foster, Raj Kettimuthu; 4) Gopi Kandaswamy	1) University of Chicago and Argonne National Laboratory, Argonne, IL; 2) Argonne National Laboratory, Argonne, IL; 3) University of Chicago; 4) Information Sciences Institute, Los Angeles	©2012 ACM 0001-0782/12/02 $10.00	10.1145/2076450.2076468	National Lab	John Bresnahan (bresnaha@mcs.anl.gov) is a senior software developer in the Mathematics and Computer Science Division of Argonne National Laboratory, Argonne, IL.	No	Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and full citation on the first page. Copyright for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or fee. Request permission to publish from permissions@acm.org or fax (212) 869-0481. The Digital Library is published by the Association for Computing Machinery. Copyright © 2012 ACM, Inc.
ACM Transactions on Sensor Networks (TOSN): Volume 10 Issue 4, June 2014	Jun-14	Sensor Mission Assignment in Rechargeable Wireless Sensor Networks	1) Thomas La Porta; 2) Cynthia Phillips; 3) Dora Spenza, Chiara Petrioli	1) Pennsylvania State University; 2) Sandia National Laboratories, Albuquerque, NM; 3) Sapienza University of Rome	© 2014 ACM 1550-4859/2014/04-ART60 $15.00	10.1145/2594791	National Lab	C. Phillips, Sandia National Laboratories, Albuquerque, NM	No	D. Spenza is a recipient of the Google Europe Fellowship in Wireless Networking. This research is supported in part by this Google Fellowship. This work was also sponsored in part by the U.S. National Science Foundation under grant CNS-0916171 and by the FP7 project GENESI (GrEen sensor Networks for Structural monItoring). Sandia National Laboratories is a multi-program laboratory managed and operated by Sandia Corporation, a wholly owned subsidiary of Lockheed Martin Corporation, for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-AC04-94AL85000. c 2014 Association for Computing Machinery. ACM acknowledges that this contribution was authored or co-authored by a contractor or affiliate of the U.S. Government. As such, the Government of the United States retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow other to do so, for Goverment purposes only.
ACM Transactions on Reconfigurable Technology and Systems (TRETS): Volume 4 Issue 2, May 2011	May-11	Scientific Application Demands on a Reconfigurable Functional Unit Interface	1) Kyle Rupnow; 2) Keith D. Underwood; 3) Katherine Compton	1) University of Wisconsin-Madison and Sandia National Laboratories; 2) Intel Corporation; 3) University of Wisconsin-Madison	© 2011 ACM 1936-7406/2011/05-ART19 $10.00	10.1145/1968502.1968510	National Lab	1) University of Wisconsin-Madison and Sandia National Laboratories;	No	Sandia is a multi-program laboratory operated by Sandia Corporation, a Lockheed Martin Company, for the United States Department of Energy’s National Nuclear Security Administration under contract DEAC04- 94AL85000. ©2011 Association for Computing Machinery. ACM acknowledges that this contribution was authored or coauthored by a contractor or affiliate of the [US] Government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies show this notice on the first page or initial screen of a display along with the full citation. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works requires prior specific permission and/or a fee. Permissions may be requested from Publications Dept., ACM, Inc., 2 Penn Plaza, Suite 701, New York, NY 10121-0701 USA, fax +1 (212) 869-0481, or permissions@acm.org
Communications of the ACM: Volume 53 Issue 6, June 2010	Jun-10	Institutional review boards and your research	1) Simson L. Garfinkel; 2) Lorrie Faith Cranor	1) U.S. Naval Postgraduate School, Monterey, CA; 2) Carnegie Mellon University, Pittsburgh, PA	Copyright held by author.	10.1145/1743546.1743563	Employee	Simson L. Garfinkel (slgarfin@nps.edu) is an associate professor at the U.S. Naval Postgraduate School in Monterey, CA.	No	The Digital Library is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc.
SC '13: Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis	Nov-13	A framework for load balancing of tensor contraction expressions via dynamic task partitioning	1) Pai-Wei Lai, Kevin Stock, Samyam Rajbhandari, P. Sadayappan; 2) Sriram Krishnamoorthy	1) The Ohio State University, Columbus, OH; 2) Pacific Northwest National Laboratory	Copyright 2013 ACM 978-1-4503-2378-9/13/11 $15.00	10.1145/2503210.2503290	National Lab	2) Pacific Northwest National Laboratory	No	Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Permissions@acm.org. This work was supported in part by the U.S. Department of Energy’s (DOE) Office of Science, Office of Advanced Scientific Computing Research, under award number 59193 and by Pacific Northwest National Laboratory (PNNL) under the eXtreme Scale Computing Initiative. PNNL is operated by Battelle for the DOE under Contract DE-AC05-76RL01830
OOPSLA '98: Proceedings of the 13th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications	Oct-98	Object lessons learned from a distributed system for remote building monitoring and operation	1) Frank Olken, Hans-Arno Jacobsen, Chuck McParland, Mary Ann Piette, Mary F. Anderson	1) Lawrence Berkeley National Laboratory, Berkeley, CA	© 1998 ACM l-581 13.005.8/98/0010...$5.00	10.1145/286942.286968	National Lab	1) Lawrence Berkeley National Laboratory, Berkeley, CA	No	This work was supported by the Office of Energy Research, Office of Computational and Technology Sciences, Mathematical, Information, and Computational Sciences Division. of the U.S. Department of Energy under Contract DE-ACO3-76SF00098. Contact: Frank Olken, Lawrence Berkeley National Laboratory, Mailstop 50B-3238, I Cyclotron Road, Berkeley, CA 94720. Tel: (5 10) 486-5891, Fax: (5 10) 486-4004, Email: olken@Ibl.gov.
Communications of the ACM: Volume 55 Issue 6, June 2012	Jun-12	The myth of the elevator pitch	1) Peter J. Denning; 2) Nicholas Dew	1) director of the Cebrowski Institute for Information Innovation and Superiority at the Naval Postgraduate School in Monterey, CA, and a past president of ACM; 2) Associate Professor of Strategic Management at the Naval Postgraduate School in Monterey, CA.	Copyright held by author.	10.1145/2184319.2184333	Employee	Peter J. Denning (pjd@nps.edu) is Distinguished Professor of Computer Science and Director of the Cebrowski Institute for information innovation at the Naval Postgraduate School in Monterey, CA, is Editor of ACM Ubiquity, and is a past president of ACM. Nicholas Dew (ndew@nps.edu) is Associate Professor of Strategic Management at the Naval Postgraduate School in Monterey, CA. He researches entrepreneurship and is a co-author of the recently published textbook Effectual Entrepreneurship.	No	The Digital Library is published by the Association for Computing Machinery. Copyright © 2012 ACM, Inc.
DAC '13: Proceedings of the 50th Annual Design Automation Conference	May-13	Tessellation: refactoring the OS around explicit resource containers with continuous adaptation	1) Juan A. Colmenares, Gage Eads, Sarah Bird, Miquel Moretó, David Chou, Brian Gluzman, Eric Roman, Davide B. Bartolini, Nitesh Mor, Krste Asanović, John D. Kubiatowicz; 2) Steven Hofmeyr	1) The Parallel Computing Laboratory, UC Berkeley, Berkeley, CA; 2) Lawrence Berkeley National Laboratory, Berkeley, CA	Copyright 2013 ACM 978-1-4503-2071-9/13/05 ...$15.00.	10.1145/2463209.2488827	National Lab	2) Lawrence Berkeley National Laboratory, Berkeley, CA	No	Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee.
Communications of the ACM - Finding the Fun in Computer Science Education: Volume 52 Issue 12, December 2009	Dec-09	The profession of IT: Computing's paradigm	1) Peter J. Denning; 2) Peter A. Freeman	1) Director of the Cebrowski Institute for Information Innovation and Superiority at the Naval Postgraduate School in Monterey, CA, and a past president of ACM; 2)E meritus Founding Dean and Professor at Georgia Tech and Former Assistant Director of NSF for CISE.	Copyright held by author.	10.1145/1610252.1610265	Employee	Peter J. Denning (pjd@nps.edu) is the director of the Cebrowski Institute for Information Innovation and Superiority at the Naval Postgraduate School in Monterey, CA, and is a past president of ACM.	No	The Digital Library is published by the Association for Computing Machinery. Copyright © 2009 ACM, Inc.
PPoPP '01: Proceedings of the eighth ACM SIGPLAN symposium on Principles and practices of parallel programming	Jun-01	Statistical scalability analysis of communication operations in distributed applications	1) Jeffrey S. Vetter, Michael O. McCracken	1) Center for Applied Scientific Computing, Lawrence Livermore National Laboratory, Livermore, California	Copyright 2001 ACM 1-58113-346-4/01/0006…$5.00.	10.1145/568014.379590	National Lab	1) Center for Applied Scientific Computing, Lawrence Livermore National Laboratory, Livermore, California	No	Copyright 2001 Association for Computing Machinery. ACM acknowledges that this contribution was authored or co-authored by a contractor or affiliate of the U.S. Government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only. This work was performed under the auspices of the U.S. Dept. of Energy by University of California LLNL under contract W-7405-Eng-48. LLNL Document Number UCRL-JC-142611.
ACM Transactions on Mathematical Software (TOMS): Volume 21 Issue 4, Dec. 1995	Dec-95	A Fortran 90-based multiprecision system	David H. Bailey	NASA Ames Research Center, Moffett Field, CA	© 1995 ACM 0098-3500/95/1200-0379 $03.50	10.1145/212066.212075	Employee	Author’s address: NAS Scientific Computation Branch, NASA Ames Research Center, Mail Stop T27A-1, Moffett Field, CA 94035-1000; email: dbailey@nas.nasa.gov	No	Permission to make digital/hard copy of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage, the copyright notice, the title of the publication, and its date appear, and notice is given that copying is by permission of ACM, Inc. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee.
Supercomputing '91: Proceedings of the 1991 ACM/IEEE conference on Supercomputing	Aug-91	The NAS parallel benchmarks—summary and preliminary results	1) D. H. Bailey, E. Barszcz, J. T. Barton, D. S. Browning, R. L. Carter, L. Dagum, R. A. Fatoohi, P. O. Frederickson, T. A. Lasinski, R. S. Schreiber, H. D. Simon, V. Venkatakrishnan, S. K. Weeratunga	1) Numerical Aerodynamic Simulation (NAS) Systems Division, NASA Ames Research Center, Mail Stop T045-1, Moffett Field, CA	©1991 ACM 0-89791-459-7/91/0158 $01.50	10.1145/125826.125925	Employee	*) Bailey, Barszcz, Barton, Carter and Lasinski are employees of NASA. t) Browning, Dagum, Fatoohi, Simon, Venkatakrishnan, and Weeratunga are employees of Computer Sciences Corporation. Their work is supported through NASA Contract NAS 2-12961. $) Fredrickson and Schreiber are employees of the Research Institute for Advanced Computer Science (RIACS). Their work is supported by the NAS Systems Division via Cooperative Agreement NCC 2-387 between NASA and the Universities Space Research Association.	No	N/A
Communications of the ACM: Volume 17 Issue 4, April 1974	Apr-74	Scalar- and planar-valued curve fitting using splines under tension	A. K. Cline	NASA Langley Research Center, Hampton, CA	Copyright © 1974, Association for Computing Machinery, Inc	10.1145/360924.360971	Unsure	Authors name appears on paper as such: A.K. Cline - National Center for Atmospheric Research Author's present address: Institute for Computer Services and Applications, NASA Langley Research Center, Stop 132-C, Hampton, VA 23365.	No	General permission to republish, but not for profit, all or part of this material is granted provided that ACM's copyright notice is given and that reference is made to the publication, to its date of issue, and to the fact that reprinting privileges were granted by permission of the Association for Computing Machinery. The National Center for Atmospheric Research is sponsored by the National Science Foundation.
PPoPP '08: Proceedings of the 13th ACM SIGPLAN Symposium on Principles and practice of parallel programming	Feb-08	Semantics-based distributed I/O for mpiBLAST	1) Pavan Balaji, Rajkumar Kettimuthu, Rajeev Thakur; 2) Wu-chun Feng, Jeremy Archuleta; 3) Heshan Lin, Xiaosong Ma	1) Argonne National Laboratory, Argonne, IL, USA; 2) Virginia Tech, Blacksburg, VA, USA; 3) North Carolina State University, Raleigh, NC, USA	Copyright is held by the author/owner(s).	10.1145/1345206.1345262	National Lab	1) Argonne National Laboratory, Argonne, IL, USA;	No	This research is funded in part by the Mathematical, Information, and Computational Sciences Division subprogram of the Office of Advanced Scientific Computing Research, Office of Science, U.S. Department of Energy, under Contract DE-AC02-06CH11357 and the Computer Science Department at Virginia Tech.
ACM Transactions on Mathematical Software (TOMS): Volume 14 Issue 4, Dec. 1988	Dec-88	Algorithm 665: Machar: a subroutine to dynamically determined machine parameters	W. J. Cody	Argonne National Laboratory, Argonne, IL	© 1988 ACM 0098-3500/88/1200-0303 $01.50	10.1145/50063.51907	National Lab	Author’s address: W. J. Cody, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL 60439-4844.	No	This work was supported by the Applied Mathematical Sciences Subprogram of the Office of Energy Research, U.S. Department of Energy, under contract W-31-109-Eng-38. Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Association for Computing Machinery. To copy otherwise, or to republish, requires a fee and/or specific permission.
ACM Transactions on Mathematical Software (TOMS): Volume 18 Issue 2, June 1992	Jun-92	Table-driven implementation of the Expm1 function in IEEE floating-point arithmetic	PING TAK PETER TANG	Argonne National Laboratory	©1992 ACM 0098-3500/92/0600-0211 $01.50	10.1145/146847.146928	National Lab	Author’s address: Mathematics and Computer Science Division, Argonne National Laboratory, 9700 South Cass Avenue, Argonne, IL 60439-4801.	No	Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Association for Computing Machinery. To copy otherwise, or to republish, requires a fee and/or specific permission. This work was supported by the Applied Mathematical Sciences subprogram of the Office of Energy Research, U.S. Department of Energy, under contract W-31 -109-Eng-38.
ACM Transactions on Mathematical Software (TOMS): Volume 16 Issue 2, June 1990	Jun-90	Computation of exponential integrals of a complex argument	Donald E. Amos	Sandia National Labs, Albuquerque, NM	© 1990 ACM 0098-3500/90/0600-0169 $01.50	10.1145/78928.78933	National Lab	Author’s address: Sandia National Laboratories, Albuquerque, NM 87185.	No	This work was performed at Sandia National Laboratories and supported by the U.S. Department of Energy under contract DE-AC04-76DP 00789. Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Association for Computing Machinery. To copy otherwise, or to republish, requires a fee and/or specific permission.
ACM Transactions on Applied Perception (TAP): Volume 10 Issue 4, October 2013	Oct-13	Space perception in virtual environments: Displacement from the center of projection causes less distortion than predicted by cue-based models	1) Jonathan W. Kelly, Melissa Burton, Brice Pollock, Eduardo Rubio, Michael Curtis, Stephen Gilbert, Eliot Winer; 2) Julio De La Cruz	1) Iowa State University; 2) U.S. Army Research Laboratory's Human Research and Engineering Directorate, Simulation and Training Technology Center	© 2013 ACM 1544-3558/2013/10-ART18 $15.00	10.1145/2536764.2536765	Employee	2) U.S. Army Research Laboratory's Human Research and Engineering Directorate, Simulation and Training Technology Center	No	Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies show this notice on the first page or initial screen of a display along with the full citation. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works requires prior specific permission and/or a fee. Permissions may be requested from Publications Dept., ACM, Inc., 2 Penn Plaza, Suite 701, New York, NY 10121-0701 USA, fax: +1 (212) 869-0481 or permissions@acm.org. This work was supported by a grant from the United States Army Research Laboratory’s Human Research and Engineering Directorate, Simulation and Training Technology Center. Results from Experiment 1 were presented at the 2012 meeting of the SPIE.
ACM Transactions on Mathematical Software (TOMS): Volume 26 Issue 1, March 2000	Mar-00	NEOS and Condor: solving optimization problems over the Internet	1) Michael C. Ferris; 2) Michael P. Mesnier; 3) Jorge J. Moré	1) Univ. of Wisconsin—Madison; 2) Intel Corp.; 3) Argonne National Lab	© 2000 ACM 0098-3500/00/0300–0001 $5.00	10.1145/347837.347842	National Lab	J. J. Moré, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL 60439; email: more@mcs.anl.gov	No	Work supported by the Mathematical, Information, and Computational Sciences Division subprogram of the Office of Computational and Technology Research, U.S. Department of Energy, under Contract W-31-109-Eng-38, by the National Science Foundation under Grants CDA-9726385 and CCR-9619765, and by the National Science Foundation, through the Center for Research on Parallel Computation, under Cooperative Agreement No. CCR-9120008. Permission to make digital/hard copy of part or all of this work for personal or classroom use is granted without fee provided that the copies are not made or distributed for profit or commercial advantage, the copyright notice, the title of the publication, and its date appear, and notice is given that copying is by permission of the ACM, Inc. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee.
Communications of the ACM: Volume 57 Issue 3, March 2014	Mar-14	Surfing toward the future'	Peter J. Denning	Director of the Cebrowski Institute for Information Innovation and Superiority at the Naval Postgraduate School in Monterey, CA, and a past president of ACM	Copyright held by Owner/Author(s).	10.1145/2566967	Employee	Director of the Cebrowski Institute for Information Innovation and Superiority at the Naval Postgraduate School in Monterey, CA, and a past president of ACM	No	The Digital Library is published by the Association for Computing Machinery. Copyright © 2014 ACM, Inc.
SC '11: Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis	Nov-11	Performance of the community earth system model	1) Patrick H. Worley; 2) Arthur A. Mirin; 3) Mark A. Taylor; 4) John M. Dennis, Mariana Vertenstein, Anthony P. Craig	1) Oak Ridge National Laboratory, Oak Ridge, TN; 2) Lawrence Livermore National Laboratory, Livermore, CA; 3) Sandia National Laboratories, Albuquerque, NM; 4) National Center for Atmospheric Research, CO	Copyright 2011 ACM 978-1-4503-0771-0/11/11 ...$10.00	10.1145/2063384.2063457	National Lab	1) Oak Ridge National Laboratory, Oak Ridge, TN; 2) Lawrence Livermore National Laboratory, Livermore, CA; 3) Sandia National Laboratories, Albuquerque, NM;	No	Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. The work of A. Mirin and P. Worley was sponsored in part by the Climate and Environmental Sciences Division of the Office of Biological and Environmental Research and by the Office of Advanced Scientific Computing Research, both in the Office of Science, U.S. Department of Energy, under Contract No. DE-AC52-07NA27344 with Lawrence Livermore National Security, LLC. and Contract No. DEAC05-00OR22725 with UT-Battelle, LLC, respectively. The work of M. Taylor was supported by SciDAC grant 06-13194 from the Office of Biological and Environmental Research, U.S. Department of Energy. The work of A. Craig and M. Vertenstein was supported by the Office of Biological and Environmental Research, U.S. Department of Energy under contracts DE-FC02-97ER62402 and DE-FC02-07ER64340. Additional support for M. Vertenstein was provided by National Science Foundation grant AGS-0856145. This work used resources of the Oak Ridge Leadership Computing Facility, located in the National Center for Computational Sciences at Oak Ridge National Laboratory, which is supported by the Office of Science of the Department of Energy under Contract DE-AC05-00OR22725. It also used resources of the Argonne Leadership Computing Facility at Argonne National Laboratory, which is supported by the Office of Science of the U.S. Department of Energy under contract DE-AC02-06CH11357.
SC '07: Proceedings of the 2007 ACM/IEEE conference on Supercomputing	Nov-07	Using MPI file caching to improve parallel write performance for large-scale scientific applications	1) Wei-keng Liao, Avery Ching, Kenin Coloma, Arifa Nisar, Alok Choudhary 2) Jacqueline Chen; 3) Ramanan Sankaran, Scott Klasky	1) Northwestern University, Evanston, Illinois; 2) Sandia National Laboratories, Livermore, California; 3) Oak Ridge National Laboratory, Oak Ridge, Tennessee	Copyright 2007 ACM 978-1-59593-764-3/07/0011...$5.00	10.1145/1362622.1362634	National Lab	2) Sandia National Laboratories, Livermore, California; 3) Oak Ridge National Laboratory, Oak Ridge, Tennessee	No	Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage, and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. This work was supported in part DOE’s SCiDAC program (Scientific Data Management Center), award number DEFC02-07ER25808, NSF/DARPA ST-HEC program under grant CCF-0444405, NSF HECURA CCF-0621443 and NSF NGS program under grant CNS-0406341. We acknowledge the use of the Dell Xeon Cluster and IBM IA-64 Linux Cluster at the National Center for Supercomputing Applications under TeraGrid Project TG-CCR060017T.
EDBT/ICDT '09: Proceedings of the 2009 EDBT/ICDT Workshops	Mar-09	COP: privacy-preserving multidimensional partition in DAS paradigm	1) Jieping Wang, Xiaoyong Du, Haocong Wang, Pingping Yang	1) Key Laboratory of Data Engineering and Knowledge Engineering, MOE and Renmin University of China, Beijing, China	N/A	10.1145/1698790.1698813	Not Govt	No government agencies appear in the author affiliations	No	N/A
PPoPP '13: Proceedings of the 18th ACM SIGPLAN symposium on Principles and practice of parallel programming	Feb-13	Ownership passing: efficient distributed memory programming on multi-core systems	1) Andrew Friedley; 2) Torsten Hoefler; 3) Greg Bronevetsky; 4) Andrew Lumsdaine; 5) Ching-Chen Ma	1) Indiana University, Bloomington, IN, USA; 2) ETH Zurich, Zurich, Switzerland; 3) Lawrence Livermore National Laboratory, Livermore, CA, USA; 4) Indiana University, Bloomington, IN, USA; 5) Rose-Hulman Institute of Technology, Terre Haute, IN, USA	Copyright © 2013 ACM 978-1-4503-1922-5/13/02...$15.00.	10.1145/2517327.2442534	National Lab	3) Lawrence Livermore National Laboratory, Livermore, CA, USA;	No	Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. This work was supported in part by the Department of Energy XStack program and the Early Career award program. It was partially performed under the auspices of the U.S. Department of Energy by Lawrence Livermore National Laboratory under Contract DEAC52-07NA27344. (LLNL-CONF-609538)
Communications of the ACM - Bioinformatics: Volume 47 Issue 11, November 2004	Nov-04	Network laws	Peter J. Denning	Director of the Cebrowski Institute for information and innovation and superiority at the Naval Postgraduate School in Monterey, CA, and is a past president of ACM.	©2004 ACM 0001-0782/04/1100 $5.00	10.1145/1029496.1029510	Employee	Peter J. Denning (pjd@nps.edu) is Distinguished Professor of Computer Science and Director of the Cebrowski Institute for information innovation at the Naval Postgraduate School in Monterey, CA, is Editor of ACM Ubiquity, and is a past president of ACM.	No	Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. The Digital Library is published by the Association for Computing Machinery. Copyright © 2004 ACM, Inc.
Communications of the ACM - The psychology of security: why do good users make bad decisions?: Volume 51 Issue 4, April 2008	Apr-08	Getting to "we"	1) Peter J. Denning, 2) Peter Yaholkovsky	1) Director of the Cebrowski Institute for information and innovation and superiority at the Naval Postgraduate School in Monterey, CA, and is a past president of ACM; 2) executive consultant in Grass Valley, CA.	©2008 ACM 0001-0782/08/0400 $5.00	10.1145/1330311.1330316	Employee	Peter J. Denning (pjd@nps.edu) is Distinguished Professor of Computer Science and Director of the Cebrowski Institute for information innovation at the Naval Postgraduate School in Monterey, CA, is Editor of ACM Ubiquity, and is a past president of ACM.	No	Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. The Digital Library is published by the Association for Computing Machinery. Copyright © 2008 ACM, Inc.
Communications of the ACM: Volume 38 Issue 4, April 1995	Apr-95	The University of California CD-ROM Information System	1) Deane Merrill, Nathan Parker; 2) Fredric Gey; 3) Chris Stuber	1) Lawrence Berkeley Lab. (LBL) and Populations at Risk to Environmental Pollution (PAREP); 2) Univ. of California at Berkeley, Berkeley; 3) U. S. Bureau of the Census	© ACM 0002-0782/95/0400	10.1145/205323.205334	Employee; National Lab	Chris Stuber is an employee in the Telecommunications Division of the U.S. Bureau of the Census. Deane Merrill is a computer scientist at Lawrence Berkeley Laboratory (LBL) and coprincipal investigator of the Populations at Risk to Environmental Pollution (PAREP) project. Nathan Parker is a software designer at LBL.	No	This work was supported in part by the Director, Office of Epidemiology and Health Surveillance; Office of Health; Office of Environment, Safety and Health; U.S. Department of Energy under Contract No. DE-AC03-76-SF00098.
SC '11: Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis	Nov-11	Unitary qubit lattice simulations of multiscale phenomena in quantum turbulence	1) George Vahala, Bo Zhang; 2) Min Soe; 3) Jeffrey Yepez; 4) Linda Vahala; 5) Jonathan Carter; 6) Sean Ziegeler	1) William & Mary, Williamsburg, VA; 2) Rogers State University, Claremore, OK; 3) Air Force Research Laboratories, Hanscom AFB, MA; 4) Old Dominion University, Norfolk, VA; 5) Computing Sciences, Lawrence Berkeley National Laboratory MS, Berkeley, CA; 6) High Performance Technologies, Inc., Reston, VA	Copyright 2011 ACM 978-1-4503-0771-0/11/11....$10.00	10.1145/2063384.2063416	Employee; National Lab	3) Air Force Research Laboratories, Hanscom AFB, MA 5) Computing Sciences, Lawrence Berkeley National Laboratory MS, Berkeley, CA	No	Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. This work was supported by the AFOSR and DoE. The production runs were performed on various DoD supercomputers through their CAP program. The scaling runs were performed using Director Discretionary allocations on Jaguarpf and Intrepid. The timings on HopperII were performed under the Early Users period.
Communications of the ACM: Volume 23 Issue 1, Jan. 1980	Jan-80	Scan line methods for displaying parametrically defined surfaces	1) Jeffrey M. Lane; 2) Loren C. Carpenter; 3) Turner Whitted; 4) James F. Blinn	1) Boeing Commercial Airplane Company, Seattle, WA; 2) Boeing Computer Services, Seattle, WA; 3) Bell Labs., Holmdel, NJ; 4) Caltech/JPL, Pasadena, CA	© 1980 ACM 0001-0782/80/0100-0023 $00.75.	10.1145/358808.358815	Not Govt	Authors' present addresses: J.F. Blinn, Jet Propulsion Laboratory, 4800 Oak Grove Dr., 125-104, Pasadena, CA 91103;	No	N/A
ACM Journal on Emerging Technologies in Computing Systems (JETC): Volume 8 Issue 3, August 2012	Aug-12	CMOS LC voltage controlled oscillator design using multiwalled and single-walled carbon nanotube wire inductors	1) Ashok Srivastava, Yao Xu, Yang Liu; 2) Ashwani K. Sharma, Clay Mayberry	1) Louisiana State University, Baton Rouge, LA; 2) Air Force Research Laboratory, Kirtland AFB, NM	(c) 2012 ACM 1550-4832/2012/08-ART15 $15.00	10.1145/2287696.2287698	Employee	Authors’ addresses: A. K. Sharma, and C. Mayberry, Air Force Research Laboratory, Electronics Foundations Group, 3550 Aberdeen Avenue SE, Kirtland AFB, NM 87117.	No	Part of the work is supported by the United States Air Force Research Laboratory under agreement no. FA9453-10-1-0002. The U.S. Government is authorized to reproduce and distribute reprints for Government purposes notwithstanding any copyright notation thereon. (c) 2012 Association for Computing Machinery. ACM acknowledges that this contribution was authored or co-authored by a contractor or affiliate of the [U.S.] Government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies show this notice on the first page or initial screen of a display along with the full citation. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works requires prior specific permission and/or a fee. Permissions may be requested from Publications Dept., ACM, Inc., 2 Penn Plaza, Suite 701, New York, NY 10121-0701 USA, fax +1 (212) 869-0481, or permissions@acm.org.
SC '15: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis	Nov-15	Optimal scheduling of in-situ analysis for large-scale scientific simulations	1) Preeti Malakar, Venkatram Vishwanath, Todd Munson, Christopher Knight, Mark Hereld, Sven Leyffer; 2) Michael E. Papka	1) Argonne National Laboratory; 2) Argonne National Laboratory and Northern Illinois University	Copyright 2015 ACM 978-1-4503-3723-6/15/11 ...$15.00.	10.1145/2807591.2807656	National Lab	1) Argonne National Laboratory;	No	Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. This research has been funded in part and used resources of the Argonne Leadership Computing Facility at Argonne National Laboratory, which is supported by the Office of Science of the U.S. Department of Energy under contract DE-AC02-06CH11357. Thiswork was supported in part by the DOE Office of Science, Advanced Scientific Computing Research, under award number 57L38, 57L32, 57K07 and 57K50.
Communications of the ACM: Volume 53 Issue 3, March 2010	Mar-10	Orchestrating coordination in pluralistic networks	1) Peter J. Denning; 2) Fernando Flores; 3) Peter Luzmore	1) director of the Cebrowski Institute for Innovation and Information Superiority at the Naval Postgraduate School in Monterey, CA, and is a past president of ACM; 2) Senator of Chile; 3) consultant, entrepreneur, and a leadership development trainer.	Copyright held by author.	10.1145/1666420.1666434	Employee	Peter J. Denning (pjd@nps.edu) is Distinguished Professor of Computer Science and Director of the Cebrowski Institute for information innovation at the Naval Postgraduate School in Monterey, CA, is Editor of ACM Ubiquity, and is a past president of ACM.	No	The Digital Library is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc.
SC '15: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis	Nov-15	A practical approach to reconciling availability, performance, and capacity in provisioning extreme-scale storage systems	1) Lipeng Wan, Qing Cao; 2) Feiyi Wang, Sarp Oral, Devesh Tiwari, Sudharshan S. Vazhkudai	1) University of Tennessee, Knoxville; 2) Oak Ridge National Laboratory	© 2015 ACM. ISBN 978-1-4503-3723-6/15/11. . . $15.00	10.1145/2807591.2807615	National Lab	2) Oak Ridge National Laboratory	No	ACM acknowledges that this contribution was authored or co-authored by an employee, or contractor of the national government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only. Permission to make digital or hard copies for personal or classroom use is granted. Copies must bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. To copy otherwise, distribute, republish, or post, requires prior specific permission and/or a fee. Request permissions from permissions@acm.org.
ACM Transactions on Mathematical Software (TOMS): Volume 19 Issue 1, March 1993	Mar-93	Algorithm 714: CELEFUNT: a portable test package for complex elementary functions	W. J. Cody	Argonne National Lab.	©1993 ACM 0098-3500/93/0300-0001 $01.50	10.1145/151271.151272	National Lab	Author’s address: Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL 60439-4801	No	This work was supported by the Applied Mathematical Sciences subprogram of the (Office of Energy Research, U. S. Department of Energy, under contract W-31 -109-Eng-38. Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Association for Computing Machinery. To copy otherwise, or to repubhsh, requires a fee and/or specific permission.
MSR '16: Proceedings of the 13th International Conference on Mining Software Repositories	May-16	Topic modeling of NASA space system problem reports: research in practice	1) Lucas Layman, Joshua Meek; 2) Allen P. Nikora; 3) Tim Menzies	1) Fraunhofer CESE, College Park, MD; 2) Jet Propulsion Laboratory, California Institute of Technology, Pasadena, CA; 3) North Carolina State University, Raleigh, NC	(c) 2016 ACM. ISBN 978-1-4503-4186-8/16/05. . . $15.00	10.1145/2901739.2901760	Employee	2) Jet Propulsion Laboratory, California Institute of Technology, Pasadena, CA;	no	ACM acknowledges that this contribution was authored or co-authored by an employee, or contractor of the national government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only. Permission to make digital or hard copies for personal or classroom use is granted. Copies must bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. To copy otherwise, distribute, republish, or post, requires prior specific permission and/or a fee. Request permissions from permissions@acm.org. This work was supported by the NASA OSMA Software Assurance Research Program through grants NNX11AP93G and NNX15AC81G. Cross-project data analysis and undergraduate student support was partially supported by NSF grant 1302169. Part of this work was carried out at the Jet Propulsion Laboratory, California Institute of Technology, under a contract with the National Aeronautics and Space Administration and sponsored both by the National Aeronautics and Space Administration’s Office of Safety and Mission Assurance Software Assurance Research Program (SARP) and JPL’s Office of the Management System. The JPL effort funded by SARP is managed locally by JPL’s Assurance Technology Program Office.
SC '01: Proceedings of the 2001 ACM/IEEE conference on Supercomputing	Nov-01	A ghost cell expansion method for reducing communications in solving PDE problems	1) Chris Ding, Yun He	1) NERSC Division, Lawrence Berkeley National Laboratory, University of California, Berkeley, CA 94720	(c) 2001 ACM 1-58113-293-X/01/0011 $5.00\	10.1145/582034.582084	National Lab	1) NERSC Division, Lawrence Berkeley National Laboratory, University of California, Berkeley, CA 94720	No	(c) 2001 Association for Computing Machinery. ACM acknowledges that this contribution was authored or co-authored by a contractor or affiliate of the U.S. Government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only. This work is supported by the Office of Biological and Environmental Research, Climate Change Prediction Program, and by the Office of Computational and Technology Research, Division of Mathematical, Information, and Computational Sciences, of the U.S. Department of Energy under contract number DE-AC03-76SF00098.
Communications of the ACM: Volume 43 Issue 4, April 2000	Apr-00	Ocean and climate modeling	Albert Semtner	1) Professor of oceanography in the Naval Postgraduate School in Monterey, Calif., and an affiliate scientist in the National Center for Atmospheric Research in Boulder, Colo.	©2000 ACM 0002-0782/00/0400 $5.00	10.1145/332051.332077	Unsure	Albert Semtner (sbert@ucar.edu) is a professor of oceanography in the Naval Postgraduate School in Monterey, Calif., and an affiliate scientist in the National Center for Atmospheric Research in Boulder, Colo.	No	Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. The Digital Library is published by the Association for Computing Machinery. Copyright © 2000 ACM, Inc.
ACM Transactions on Computer Systems (TOCS): Volume 16 Issue 2, May 1998	May-98	The Totem multiple-ring ordering and topology maintenance protocol	1) D. A. Agarwal, L. E. Moser, P. M. Melliar-Smith, R. K. Budhia	1) Univ. of California, Santa Barbara	© 1998 ACM 0734-2071/98/0500–0093 $5.00	10.1145/279227.279228	Not Govt	No government agencies appear in the author affiliations.	No	N/A
MEMSYS '16: Proceedings of the Second International Symposium on Memory Systems	Oct-16	Improving DRAM Bandwidth Utilization with MLP-Aware OS Paging	1) Rishiraj A. Bheda, Thomas M. Conte; 2) Jeffrey S. Vetter	1) Georgia Institute of Technology, Ferst Dr. KACB, Atlanta GA; 2) Oak Ridge National Laboratory, One Bethel Valley, Oak Ridge TN	© 2016 ACM. ISBN 978-1-4503-4305-3/16/10…$15.00	10.1145/2989081.2989094	National Lab	2) Oak Ridge National Laboratory, One Bethel Valley, Oak Ridge TN	No	© 2016 Association for Computing Machinery. ACM acknowledges that this contribution was authored or co-authored by an employee, contractor or affiliate of the United States government. As such, the United States Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only.
SC '11: Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis	Nov-11	Optimized pre-copy live migration for memory intensive applications	1) Khaled Z. Ibrahim, Steven Hofmeyr, Costin Iancu, Eric Roman	1) Lawrence Berkeley National Laboratory, Berkeley	Copyright 2011 ACM 978-1-4503-0771-0/11/11 ...$10.00.	10.1145/2063384.2063437	National Lab	1) Lawrence Berkeley National Laboratory, Berkeley	No	Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. This work was supported by the Director, Office of Science, Office of Advanced Scientific Computing Research, of the U.S. Department of Energy under Contract No. DEAC02-05CH11231.
PACT '16: Proceedings of the 2016 International Conference on Parallel Architectures and Compilation	Sep-16	Combating the Reliability Challenge of GPU Register File at Low Supply Voltage	1) Jingweijia Tan, Kaige Yan, Xin Fu; 2) Shuaiwen Leon Song, Andres Marquez, Darren Kerbyson	1) University of Houston, Houston, TX, USA; 2) Pacific Northwest National Lab, Richland, WA, USA	© 2016 ACM. ISBN 978-1-4503-4121-9/16/09. . . $15.00	10.1145/2967938.2967951	National Lab	2) Pacific Northwest National Lab, Richland, WA, USA	No	ACM acknowledges that this contribution was authored or co-authored by an employee, or contractor of the national government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only. Permission to make digital or hard copies for personal or classroom use is granted. Copies must bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. To copy otherwise, distribute, republish, or post, requires prior specific permission and/or a fee. Request permissions from permissions@acm.org This research is supported by the U.S. Department of Energy’s (DOE) Office of Science, Office of Advanced Scientific Computing Research, under award 66150: “CENATE - Center for Advanced Architecture Evaluation”. PNNL is operated by Battelle for the U.S. Department of Energy under contract DE-AC05-76RL01830.
ACM Transactions on Computational Logic (TOCL): Volume 13 Issue 2, April 2012	Apr-12	Annotated Probabilistic Temporal Logic: Approximate Fixpoint Implementation	1) Paulo Shakarian\; 2) Gerardo I. Simari; 3) V. S. Subrahmanian	1) Department of Electrical Engineering and Computer Science, US Military Academy, Thayer Hall (Bldg. 601), West Point, NY 10996; 2) Department of Computer Science, University of Oxford, Oxford OXI 3QD, UK; 3) University of Maryland, College Park, MD	(c) 2012 ACM 1529-3785/2012/04-ART13 $10.00	10.1145/2159531.2159535	Employee	Authors’ addresses: P. Shakarian, Department of Electrical Engineering and Computer Science, US Military Academy, Thayer Hall (Bldg. 601), West Point, NY 10996; email: paulo@shakarian.net	No	P. Shakarian is funded under the US Army ACS/West Point Instructor (EECS) program. Some of the authors of this article were funded in part by AFOSR grant FA95500610405, ARO grant W911NF0910206, and ONR grant N000140910685. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies show this notice on the first page or initial screen of a display along with the full citation. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works requires prior specific permission and/or a fee. Permissions may be requested from the Publications Dept., ACM, Inc., 2 Penn Plaza, Suite 701, New York, NY 10121-0701, USA, fax +1 (212) 869-0481, or permissions@acm.org.
SC '09: Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis	Nov-09	Early performance evaluation of a "Nehalem" cluster using scientific and engineering applications	1) Subhash Saini, Rupak Biswas, Timothy Sandstrom; 2) Andrey Naraikin, David Barkai	1) NASA Ames Research, Moffett Field, CA; 2) Intel Corporation	Copyright 2009 ACM 978-1-60558-744-8/09/11 ...$10.00.	10.1145/1654059.1654084	Employee	1) NASA Ames Research, Moffett Field, CA;	No	Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies show this notice on the first page or initial screen of a display along with the full citation. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works requires prior specific permission and/or a fee.
ACM Transactions on Intelligent Systems and Technology (TIST): Volume 3 Issue 3, May 2012	May-12	Using Clustering and Metric Learning to Improve Science Return of Remote Sensed Imagery	1) David S. Hayden, Steve Chien, David R. Thompson, Rebecca Castaño	1) Jet Propulsion Laboratory, California Institute of Technology	© 2012 ACM 2157-6904/2012/05-ART51 $10.00	10.1145/2168752.2168765	Employee	1) Jet Propulsion Laboratory, California Institute of Technology	No	c 2012 Association for Computing Machinery. ACM acknowledges that this contribution was authored or co-authored by a contractor or affiliate of the [U.S.] Government. As such, the Government retains a nonexclusive,royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies show this notice on the first page or initial screen of a display along with the full citation. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works requires prior specific permission and/or a fee. Permissions may be requested from the Publications Dept., ACM, Inc., 2 Penn Plaza, Suite 701, New York, NY 10121-0701, USA, fax +1 (212) 869-0481, or permissions@acm.org.
PLDI '02: Proceedings of the ACM SIGPLAN 2002 conference on Programming language design and implementation	May-02	Space-time trade-off optimization for a class of electronic structure calculations	1) Daniel Cociorva, Gerald Baumgartner, Chi-Chung Lam, P. Sadayappan; 2) J. Ramanujam; 3) Marcel Nooijen; 4) David E. Bernholdt; 5) Robert Harrison	1) Ohio State University; 2) Louisiana State University; 3) Princeton University; 4) Oak Ridge National Laboratory; 5) Pacific Northwest National Laboratory	Copyright 2002 ACM 1-58113-463-0/02/0006 ...$5.00.	10.1145/543552.512551	National Lab	4) Oak Ridge National Laboratory; 5) Pacific Northwest National Laboratory	No	Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. We are grateful to the National Science Foundation for support of this work through the Information Technology Research Program (CHE-0121676).
ACM Transactions on Knowledge Discovery from Data (TKDD): Volume 9 Issue 4, June 2015	Jun-15	Density-Aware Clustering Based on Aggregated Heat Kernel and Its Transformation	1) Hao Huang, Hong Qin; 2) Shinjae Yoo, Dantong Yu	1) Computer Science Department, Stony Brook University, NY; 2) Computational Science Center, Brookhaven National Laboratory, NY	© 2015 ACM 1556-4681/2015/06-ART29 $15.00	10.1145/2700385	National Lab	Authors’ addresses: S. Yoo (corresponding author) and D. Yu, Computational Science Center, Brookhaven National Laboratory, Bldg.463, Upton, NY 11973; emails: shinjae@gmail.com, dtyu@bnl.gov.	No	This article is an extension of the work published in ICDM 2011 [Huang et al. 2011]. This research is supported in part by NSF grants IIS-0949467, IIS-1047715, and IIS-1049448. It is also supported by the U.S. Department of Energy Grant No. DE-SC0003361, funded through the American Recovery and Reinvestment Act of 2009. In addition, this project is also supported in part by DOE Systems Biology Knowledgebase (DE-AC02-98CH10886). Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies show this notice on the first page or initial screen of a display along with the full citation. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works requires prior specific permission and/or a fee. Permissions may be requested from Publications Dept., ACM, Inc., 2 Penn Plaza, Suite 701, New York, NY 10121-0701 USA, fax +1 (212) 869-0481, or permissions@acm.org.
ACM Transactions on Mathematical Software (TOMS): Volume 43 Issue 1, August 2016	Aug-16	A Nonlinear QR Algorithm for Banded Nonlinear Eigenvalue Problems	1) C. Kristopher Garrett; 2) Zhaojun Bai; 3) Ren-Cang Li	1) Computational Physics and Methods, Los Alamos National Laboratory, Los Alamos, NM; 2) Department of Computer Science and Department of Mathematics, University of California, Davis, CA; 3) Department of Mathematics, University of Texas at Arlington, Arlington, TX	(c) 2016 ACM 0098-3500/2016/08-ART4 $15.00	10.1145/2870628	National Lab	1) Computational Physics and Methods, Los Alamos National Laboratory, Los Alamos, NM;	No	C. K. Garrett was supported by the Laboratory Directed Research and Development Program of Oak Ridge National Laboratory (ORNL), managed by UT-Battelle, LLC for the U. S. Department of Energy under Contract No. De-AC05-00OR22725. Z. Bai was supported in part by NSF grant DMS-1115817. R.-C. Li was supported in part by NSF grants DMS-1115834 and DMS-1317330, and a Research Gift Grant from Intel Corporation. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies show this notice on the first page or initial screen of a display along with the full citation. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works requires prior specific permission and/or a fee. Permissions may be requested from Publications Dept., ACM, Inc., 2 Penn Plaza, Suite 701, New York, NY 10121-0701 USA, fax +1 (212) 869-0481, or permissions@acm.org
ACM Transactions on Information Systems (TOIS): Volume 14 Issue 2, April 1996	Apr-96	Using local optimality criteria for efficient information retrieval with redundant information filters	Neil C. Rowe	Naval Postgraduate School, Monterey, CA	© 1996ACM 1046-8188/96/0400-0138$03.50	10.1145/226163.226165	Employee	Author’s address: Code CS/Rp, Department of Computer Science, Naval Postgraduate School, Monterey, CA 93943; email: rowe@nps.navy.mil.	No	This work was sponsored by DARPA as part of the 13 Project under AO 8939, and by the U.S. Naval Postgraduate School under funds provided by the Chief of Naval Operations. Permission to make digital/hard copy of part or all of this work for personal or classroom use is granted without fee provided that the copies are not made or distributed for profit or commercial advantage, the copyright notice, the title of the publication, and its date appear, and notice is given that copying is by permission of the ACM, Inc. To copy otherwise, ta republish,to post on servers, or to redistribute to lists, requires prior specific permission andlor a fee.
Supercomputing '89: Proceedings of the 1989 ACM/IEEE conference on Supercomputing	Aug-89	A block QR factorization algorithm using restricted pivoting	J. R. Bischof	Mathematics and Computer Science Division, Argonne National Laboratory, 9700 S. Cass Avenue, Argonne, IL	© 1989 ACM 089791-341-S/89/001 l/O248 $1.50	10.1145/76263.76290	National Lab	Mathematics and Computer Science Division, Argonne National Laboratory, 9700 S. Cass Avenue, Argonne, IL	No	Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Association for Computing Machinery. To copy otherwise, or to republish, requires a fee and/or specific permission.
WSC '97: Proceedings of the 29th conference on Winter simulation	Dec-97	Applications of the universal joint task list to joint exercise results	1) Sam H. Parry, Michael C. McAneny, Richard J. Dromerhauser	1) Department of Operations Research, Naval Postgraduate School, Monterey, CA	N/A	10.1145/268437.268686	Employee	SAM H. PARRY is a Professor of Operations Research at the Naval Postgraduate School. He received his Ph.D. degree in Systems Engineering from The Ohio State University. LT MICHAEL C. MCANENY, JR is a Master’s student in the Operations Research Department at the Naval Postgraduate School. LT RICHARD J. DROMERHAUSER, JR is a Master’s student in the Operations Research Department at the Naval Postgraduate School. He received his B.S. from the U.S. Naval Academy in 1990	No	N/A
Communications of the ACM: Volume 59 Issue 12, December 2016	Dec-16	Learning to learn	1) Peter J. Denning; 2) Gloria Flores	1) Director of the Cebrowski Institute for information and innovation and superiority at the Naval Postgraduate School in Monterey, CA; 2) President of Pluralistic Networks	Copyright held by author.	10.1145/3012421	Employee	Peter J. Denning (pjd@nps.edu) is Distinguished Professor of Computer Science and Director of the Cebrowski Institute for information innovation at the Naval Postgraduate School in Monterey, CA, is Editor of ACM Ubiquity, and is a past president of ACM.	No	The Digital Library is published by the Association for Computing Machinery. Copyright © 2016 ACM, Inc.
XSEDE16: Proceedings of the XSEDE16 Conference on Diversity, Big Data, and Science at Scale	Jul-16	Introducing a New Client/Server Framework for Big Data Analytics with the R Language	1) Drew Schmidt; 2) Wei-Chen Chenl 3) George Ostrouchov	1) University of Tennessee, Knoxville, TN; 2) pbdR Core Team, Silver Spring, MD; 3) Oak Ridge National Lab, Oak Ridge, TN	© 2016 Copyright held by the owner/author(s). Publication rights licensed to ACM.	10.1145/2949550.2949651	National Lab	3) Oak Ridge National Lab, Oak Ridge, TN	No	Publication rights licensed to ACM. ACM acknowledges that this contribution was authored or co-authored by an employee, contractor or affiliate of the United States government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only. The submitted manuscript has been authored by a contractor of the U.S. Government under Contract No. DEAC05-00OR22725. Accordingly, the U.S. Government retains a non-exclusive, royalty-free license to publish or reproduce the published form of this contribution, or allow others to do so, for U.S. Government purposes.
VEE '11: Proceedings of the 7th ACM SIGPLAN/SIGOPS international conference on Virtual execution environments	Mar-11	Minimal-overhead virtualization of a large scale supercomputer	1) John R. Lange; 2) Kevin Pedretti; 3) Peter Dinda, Chang Bae; 4) Patrick G. Bridges, Philip Soltero; 5) Alexander Merritt	1) University of Pittsburgh, Pittsburgh, PA, USA; 2) Sandia National Laboratories, Albuquerque, NM, USA; 3) Northwestern University, Evanston, IL, USA; 4) University of New Mexico, Albuquerque, NM, USA; 5) Georgia Institute of Technology, Atlanta, GA, USA	Copyright (c) 2011 ACM 978-1-4503-0501-3/11/03. . . $10.00	10.1145/2007477.1952705	National Lab	2) Sandia National Laboratories, Albuquerque, NM, USA;	No	This project is made possible by support from the National Science Foundation (NSF) via grants CNS-0709168 and CNS-0707365, and the Department of Energy (DOE) via grant DE SC0005343. Patrick Bridges was partially supported by a faculty sabbatical appointment at Sandia National Labs. Alexander Merritt’s work on this project was conducted as part of a student internship at Sandia National Laboratories. Sandia is a multiprogram laboratory managed and operated by Sandia Corporation, a wholly owned subsidiary of Lockheed Martin Corporation, for the U.S. Department of Energy’s National Nuclear Security Administration under contract DEAC04-94AL85000. Copyright 2011 Association for Computing Machinery. ACM acknowledges that this contribution was authored or co-authored by a contractor or affiliate of the U.S. Government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only
ETRA '16: Proceedings of the Ninth Biennial ACM Symposium on Eye Tracking Research & Applications	Mar-16	A new method for categorizing scanpaths from eye tracking data	1) Michael J. Haass, Laura E. Matzen, Karin M. Butler, Mika Armenta	1) Sandia National Laboratories	© 2016 Copyright held by the owner/author(s). Publication rights licensed to ACM.	10.1145/2857491.2857503	National Lab	1) Sandia National Laboratories	No	Publication rights licensed to ACM. ACM acknowledges that this contribution was authored or co-authored by an employee, contractor or affiliate of the United States government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only. Sandia National Laboratories is a multi-program laboratory managed and operated by Sandia Corporation, a wholly owned subsidiary of Lockheed Martin Corporation, for the U.S. Department of Energys National Nuclear Security Administration under contract DE-AC04-94AL85000. SAND 2016 0144 C.
ACM Transactions on Mathematical Software (TOMS): Volume 39 Issue 2, February 2013	Feb-13	Accelerating Linear System Solutions Using Randomization Techniques	1) Marc Baboulin, Julien Herrmann; 2) Jack Dongarra; 3) Stanimire Tomov	1) Inria Saclay - Île-de-France and University Paris-Sud; 2) University of Tennessee and Oak Ridge National Laboratory, and University of Manchester; 3) University of Tennessee	(c) 2013 ACM 0098-3500/2013/02-ART8 $15.00	10.1145/2427023.2427025	Unsure	2) University of Tennessee and Oak Ridge National Laboratory, and University of Manchester;	No	(c) 2013 Association for Computing Machinery. ACM acknowledges that this contribution was authored or co-authored by a contractor or affiliate of the U.S. Government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies show this notice on the first page or initial screen of a display along with the full citation. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works requires prior specific permission and/or a fee. Permissions may be requested from Publications Dept., ACM, Inc., 2 Penn Plaza, Suite 701, New York, NY 10121-0701 USA, fax +1 (212) 869-0481, or permissions@acm.org.
ACM Transactions on Intelligent Systems and Technology (TIST) - Regular Papers and Special Section on Intelligent Healthcare Informatics: Volume 6 Issue 4, August 2015	Aug-15	Smart Colonography for Distributed Medical Databases with Group Kernel Feature Analysis	1) Yuichi Motai, Alen Docef; 2) Dingkun Ma; 3) Hiroyuki Yoshida	1) Virginia Commonwealth University, VA, USA; 2) Northwestern Polytechnic University; 3) Massachusetts General Hospital and Harvard Medical School, MA, USA	(c) 2015 ACM 2157-6904/2015/07-ART58 $15.00	10.1145/2668136	False Positive, Search Rerun	No government agencies appear in the author affiliations.	No	N/A
Communications of the ACM: Volume 16 Issue 4, April 1973	Apr-73	Algorithm: ten subroutines for the manipulation of Chebyshev series	R. Broucke	University of California, Los Angeles, CA 90024, and Jet Propulsion Laboratory, Pasadena, Calif.	Copyright © 1973, Association for Computing Machinery, Inc.	10.1145/362003.362037	Unsure	University of California, Los Angeles, CA 90024, and Jet Propulsion Laboratory, Pasadena, Calif.	No	General permission to republish, but not for profit, all or partof this material is granted provided that ACM's copyright notice is given and that reference is made to the publication, to its date of issue, and to the fact that reprinting privileges were granted by permission of the Association for Computing Machinery.
ICSE '11: Proceedings of the 33rd International Conference on Software Engineering	May-11	Fourth international workshop on software engineering for computational science and engineering (SE-CSE2011)	1) Jeffrey C. Carver; 2) Roscoe Bartlett; 3) Ian Gorton; 4) Lorin Hochstein; 5) Diane Kelly; 6) Judith Segal	1) University of Alabama, Tuscaloosa, AL, USA; 2) Sandia National Laboratories, Albuquerque, NM, USA; 3) Pacific Northwest National Laboratory, Richland, WA, USA; 4) University of Southern California - Information Sciences Institute, Arlington, VA, USA; 5) Royal Military College, Kingston, ON, Canada; 6) The Open University, Milton Keynes, United Kingdom	Copyright 2011 ACM 978-1-4503-0445-0/11/05 ...$10.00	10.1145/1985793.1986058	National Lab	2) Sandia National Laboratories, Albuquerque, NM, USA; 3) Pacific Northwest National Laboratory, Richland, WA, USA;	No	(c) 2011 Association for Computing Machinery. ACM acknowledges that this contribution was authored or co-authored by a contractor or affiliate of the Canadian Government. As such, the Governments of Canada and the U.S. retain a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only.
ACM Transactions on Mathematical Software (TOMS): Volume 15 Issue 4, Dec. 1989	Dec-89	Algorithm 676: ODRPACK: software for weighted orthogonal distance regression	1) Paul T. Boggs; 2) Janet R. Donaldson; 3) Richaard h. Byrd, Robert B. Schnabel	1) National Institute of Standards and Technology, Gaithersburg, MD; 2) National Institute of Standards and Technology, Boulder, CO; 3) Univ. of Colorado, Boulder	N/A	10.1145/76909.76913	Employee	Authors’ addresses: P. T. Boggs, Applied and Computational Mathematics Division, National Institute of Standards and Technology, Gaithersburg, MD 20899; J. R. Donaldson, Applied and Computational Mathematics Division, National Institute of Standards and Technology, Boulder, CO 80303-3328;	No	The research of R. H. Byrd and R. B. Schnabel was supported in part by National Science Foundation grants DCR-8403483 and CCR 870143, and by U.S. Army Research Office contracts DAAG 29-84-K-0140 and DAAL 03-88-0086.
ACM SIGPLAN Notices: Volume 37 Issue 6, June 2002	Jun-02	SXML specification	Oleg Kiselyov	Naval Postgraduate School, Monterey, CA	N/A	10.1145/571727.571736	Employee	Naval Postgraduate School, Monterey, CA	No	N/A
Communications of the ACM: Volume 39 Issue 4, April 1996	Apr-96	Totem: a fault-tolerant multicast group communication system	1) L. E. Moser; 2) P. M. Melliar-Smith; 3) D. A. Agarwal; 4) R. K. Budhia; 5) C. A. Lingley-Papadopoulos	1) Associate professor in the Department of Electrical and Computer Engineering, University of California, Santa Barbara; 2) Professor in the Department of Electrical and Computer Engineering, University of California, Santa Barbara; 3) Scientist at the Ernest Orlando Lawrence Berkeley National Laboratory; 4) Ph.D. candidate in the Department of Electrical and Computer Engineering, University of California, Santa Barbara; 5) Software engineer at Tandem Computers	© ACM 0002-0782/96/0400 $3.50	10.1145/227210.227226	National Lab	DEBORAH A. AGARWAL is a staff scientist at the Ernest Orlando Lawrence Berkeley National Laboratory. Author’s Present Address: Ernest Orlando Lawrence Berkeley National Laboratory, 1 Cyclotron Road, MS 50B-2239, Berkeley, CA 94720; email: daagarwal@lbl.gov	No	This work was supported by the National Science Foundation, Grant No. NCR-9016361, and by the Advanced Research Project Agency, Contract No. N00174-93-K-0097. Permission to make digital/hard copy of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage, the copyright notice, the title of the publication and its date appear, and notice is given that copying is by permission of ACM, Inc. To copy otherwise, to republish, to post on servers, or to redistribute to lists requires prior specific permission and/or a fee.
ACM Transactions on Design Automation of Electronic Systems (TODAES): Volume 13 Issue 3, July 2008	Jul-08	Designing secure systems on reconfigurable hardware	1) Ted Huffmire; 2) Brett Brotherton; 3) Nick Callegari, Jonathan Valamehr, Jeff White, Ryan Kastner, Tim Sherwood	1) Naval Postgraduate School, Monterey, CA; 2) Special Technologies Laboratory, Santa Barbara, CA; 3) University of California, Santa Barbara, CA	© 2008 ACM 1084-4309/2008/07-ART44 $5.00	10.1145/1367045.1367053	Employee	Authors’ addresses: T. Huffmire, Department of Computer Science, Naval Postgraduate School, Monterey, CA 93943; email: tdhuffmi@nps.edu;	No	This research was funded in part the National Science Foundation Grant CNS-0524771 and National Science Foundation Career Grant CCF-0448654. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or direct commercial advantage and that copies show this notice on the first page or initial screen of a display along with the full citation. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works requires prior specific permission and/or a fee. Permissions may be requested from Publications Dept., ACM, Inc., 2 Penn Plaza, Suite 701, New York, NY 10121-0701 USA, fax +1 (212) 869-0481, or permissions@acm.org.
Communications of the ACM: Volume 56 Issue 12, December 2013	Dec-13	Design thinking	Peter J. Denning	Director of the Cebrowski Institute for information and innovation and superiority at the Naval Postgraduate School in Monterey, CA, and is a past president of ACM.	Copyright held by Author/Owner(s).	10.1145/2535915	Employee	Peter J. Denning (pjd@nps.edu) is Distinguished Professor of Computer Science and Director of the Cebrowski Institute for information innovation at the Naval Postgraduate School in Monterey, CA, is Editor of ACM Ubiquity, and is a past president of ACM.	No	The Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
SC '13: Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis	Nov-13	Channel reservation protocol for over-subscribed channels and destinations	1) George Michelogiannakis; 2) Nan Jiang, Daniel Becker; 3) William J. Dally	1) Stanford University / Lawrence Berkeley National Laboratory; 2) Stanford University; 3) Stanford University/NVIDIA	Copyright 2013 ACM 978-1-4503-2378-9/13/11...$15.00	10.1145/2503210.2503213	Unsure	1) Stanford University / Lawrence Berkeley National Laboratory;	No	Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Permissions@acm.org. This work was supported in part by the National Science Foundation under Grant CCF-0702341, in part by the National Security Agency under Contract H98230-08-C-0272- P007 and in part by the Robert Bosch, Prof. Michael Farmwald and Prof. Michael J. Flynn Stanford Graduate Fellowships.
SC '13: Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis	Nov-13	Using simulation to explore distributed key-value stores for extreme-scale system services	1) Ke Wang; 2) Abhishek Kulkarni; 3) Michael Lang; 4) Dorian Arnold; 5) Ioan Raicu	1) Illinois Institute of Technology, Los Alamos National Laboratory; 2) Indiana University; 3) Los Alamos National Laboratory; 4) University of New Mexico; 5) Illinois Institute of Technology, Argonne National Laboratory	Copyright 2013 ACM 978-1-4503-2378-9/13/11 ...$15.00.	10.1145/2503210.2503239	National Lab	3) Los Alamos National Laboratory;	No	Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Permissions@acm.org. This work was supported by the U.S. Department of Energy under contract DE-FC02-06ER25750, and in part by the National Science Foundation under award CNS-1042543 (PRObE). This work was also in collaboration with the FusionFS project supported by the National Science Foundation grant NSF-1054974. This research also used resources of the Argonne Leadership Computing Facility at Argonne National Laboratory, which is supported by the Office of Science of the U.S. Department of Energy under contract DEAC02-06CH11357. The publication has been assigned the LANL identifier LA-UR-12-25175.
ACM Transactions on Algorithms (TALG): Volume 12 Issue 3, June 2016	Jun-16	Scale-Free Compact Routing Schemes in Networks of Low Doubling Dimension	1) Goran Konjevod; 2) Andréa W. Richa; 3) Donglin Xia	1) Lawrence Livermore National Laboratory, Livermore, CA; 2) Arizona State University, Tempe, AZ; 3) Google, Kirkland, WA	© 2016 ACM 1549-6325/2016/06-ART27 $15.00	10.1145/2876055	National Lab	Authors’ addresses: G. Konjevod, Lawrence Livermore National Laboratory, Livermore, CA 94550; email:konjevod1@llnl.gov;	No	Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies show this notice on the first page or initial screen of a display along with the full citation. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works requires prior specific permission and/or a fee. Permissions may be requested from Publications Dept., ACM, Inc., 2 Penn Plaza, Suite 701, New York, NY 10121-0701 USA, fax +1 (212) 869-0481, or permissions@acm.org.
SC '07: Proceedings of the 2007 ACM/IEEE conference on Supercomputing	Nov-07	Anomaly detection and diagnosis in grid environments	1) Lingyun Yang; 2) Chuang Liu; 3) Jennifer M. Schopf; 4) Ian Foster	1) University of Chicago, Chicago, IL; 2) Microsoft, Redmond, WA; 3) Argonne National Laboratory, Argonne, IL; 4) University of Chicago, Chicago, IL and Argonne National Laboratory, Argonne, IL	(c) 2007 ACM 978-1-59593-764-3/07/0011…$5.00	10.1145/1362622.1362667	National Lab	3) Argonne National Laboratory, Argonne, IL;	No	(c) 2007 Association for Computing Machinery. ACM acknowledges that this contribution was authored or co-authored by a contractor or affiliate of the [U.S.] Government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only. This work was supported in part by the U.S. Department of Energy under Contract DE-AC02-06CH11357.
SC '07: Proceedings of the 2007 ACM/IEEE conference on Supercomputing	Nov-07	Optimizing center performance through coordinated data staging, scheduling and recovery	1) Frank Mueller, Zhe Zhang, Chao Wang; 2) Sudharshan S. Vazhkudai, Gregory G. Pike, John W. Cobb; 3) Xiaosong Ma	1) North Carolina State University; 2) Oak Ridge National Laboratory; 3) North Carolina State University and Oak Ridge National Laboratory	Copyright 2007 ACM 978-1-59593-764-3/07/0011 ...$5.00.	10.1145/1362622.1362696	National Lab	2) Oak Ridge National Laboratory;	No	(c) 2007 Association for Computing Machinery. ACM acknowledges that this contribution was authored or co-authored by a contractor or affiliate of the [U.S.] Government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only. This research is sponsored in part by the Laboratory Directed Research and Development Program of Oak Ridge National Laboratory (ORNL), managed by UT-Battelle, LLC for the U. S. Department of Energy under Contract No. DE-AC05-00OR22725. It is also supported by an ECPI Award under contract No. DEFG02-05ER25685, a DOE grant DE-FG02-05ER25664, an NSF Grant CCF-0621470 and through Xiaosong Ma’s joint appointment between NCSU and ORNL.
ACM Transactions on Modeling and Computer Simulation (TOMACS) - Special Issue PADS: Volume 26 Issue 1, December 2015	Dec-15	Static Analysis Techniques for Semiautomatic Synthesis of Message Passing Software Skeletons	1) Matthew Sottile, Jason Dagit; 2) Deli Zhang; 3) Gilbert Hendry; 4) Damian Dechev	1) Research and Engineering, Galois, Inc., Portland, OR; 2) University of Central Florida, Orlando, FL; 3) Sandia National Laboratories, Livermore, CA; 4) Sandia National Laboratories, University of Central Florida, Orlando, FL	© 2015 ACM 1049-3301/2015/06-ART4 $15.00	10.1145/2778888	National Lab	3) Sandia National Laboratories, Livermore, CA;	No	Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies show this notice on the first page or initial screen of a display along with the full citation. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works requires prior specific permission and/or a fee. Permissions may be requested from Publications Dept., ACM, Inc., 2 Penn Plaza, Suite 701, New York, NY 10121-0701 USA, fax +1 (212) 869-0481, or permissions@acm.org. Sandia National Laboratories is a multiprogram laboratory operated by Sandia Corporation, a Lockheed Martin Company, for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-AC04- 94AL85000.
PPoPP '14: Proceedings of the 19th ACM SIGPLAN symposium on Principles and practice of parallel programming	Feb-14	Extracting logical structure and identifying stragglers in parallel execution traces	1) Katherine E. Isaacs, Bernd Hamann; 2) Todd Gamblin, Abhinav Bhatele, Peer-Timo Bremer, Martin Schulz	1) University of California, Davis, Davis, CA, USA; 2) Lawrence Livermore National Laboratory, Livermore, CA, USA	Copyright is held by the owner/author(s).	10.1145/2555243.2555288	National Lab	2) Lawrence Livermore National Laboratory, Livermore, CA, USA	No	Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the owner/author(s). This research is supported by the U.S. Department of Energy Office of Science Graduate Fellowship administered by ORISE-ORAU under contract DE-AC05-06OR23100 and by Lawrence Livermore National Laboratory under contract DE-AC52-07NA27344 (LLNL-ABS-647655).
Supercomputing '91: Proceedings of the 1991 ACM/IEEE conference on Supercomputing	Aug-91	Ocean modeling on the connection machine	1) R. D. Smith, J. K. Dukowicz, R. C. Malone	1) Los Alamos National Laboratory, Los Alamos NM	N/A	10.1145/125826.126153	National Lab	Los Alamos National Laboratory, Los Alamos NM	No	N/A
ACM Transactions on Mathematical Software (TOMS): Volume 37 Issue 3, September 2010	Sep-10	An Interoperable, Data-Structure-Neutral Component for Mesh Query and Manipulation	1) Carl Ollivier-Gooch; 2) Mark S. Shephard, Xiaojuan Luo; 3) Timothy Tautges; 4) Jason Kraftcheck; 5) Vitus Leung; 6) Mark Miller, Lori Diachin	1) University Of British Columbia; 2) Rensselaer Polytechnic Institute; 3) Argonne National Laboratory; 4) University Of Wisconsin; 5) Sandia National Laboratory; 6) Lawrence Livermore National Laboratory	(c) 2010 ACM 0098-3500/2010/09-ART29 $10.00	10.1145/1824801.1824807	National Lab	3) Argonne National Laboratory; 5) Sandia National Laboratory; 6) Lawrence Livermore National Laboratory	No	This work was funded by the U.S. Department of Energy under the Scientific Discovery through Advanced Computing (SciDAC) program and by the Canadian Natural Sciences and Engineering Research Council under a Special Research Opportunities grant. (c) 2010 Association for Computing Machinery. ACM acknowledges that this contribution was authored or co-authored by a contractor or affiliate of the [U.S.] Government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only. Permission to make digital or hard copies part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies show this notice on the first page or initial screen of a display along with the full citation. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works requires prior specific permission and/or a fee. Permissions may be requested from the Publications Dept., ACM, Inc., 2 Penn Plaza, Suite 701, New York, NY 10121-0701 USA, fax +1 (212) 869-0481, or permission@acm.org.
ACM Transactions on Mathematical Software (TOMS): Volume 14 Issue 2, June 1988	Jun-88	Algorithm 662: A Fortran software package for the numerical inversion of the Laplace transform based on Weeks' method	1) B. S. Garbow, G. Giunta, J. N. Lyness; 2) A. Murli	1) Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL; 2) Dipartimento di Matematica e Applicazioni, Universitá di Napoli, Via Mezzocannone 8, 80134 Napoli, Italy	© 1988 ACM 0098-3500/88/0600-0171$01.50	10.1145/45054.214375	National Lab	1) Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL;	No	This work was supported in part by the Applied Mathematical Sciences subprogram of the Office of Energy Research, U.S. Department of Energy, under contract W-31-109-Eng-38. Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Association for Computing Machinery. To copy otherwise, or to republish, requires a fee and/or specific permission.
ACM Transactions on Mathematical Software (TOMS): Volume 37 Issue 2, April 2010	Apr-10	Rectangular full packed format for cholesky's algorithm: factorization, solution, and inversion	1) Fred G. Gustavson; 2) Jerzy Waśniewski; 3) Jack J. Dongarra; 4) Julien Langou	1) Umeå University and IBM T.J. Watson Research Center (Emeritus), Yorktown Heights, NY; 2) Technical University of Denmark, Kongens Lyngby, Denmark; 3) University of Tennessee, Knoxville, TN Oak Ridge National Laboratory, and University of Manchester; 4) University of Colorado Denver, Denver, CO	© 2010 ACM 0098-3500/2010/04-ART18 $10.00	10.1145/1731022.1731028	Unsure	3) University of Tennessee, Knoxville, TN Oak Ridge National Laboratory, and University of Manchester;	No	J. Langou’s research was supported by the National Science Foundation grant no. NSF CCF-811520. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies show this notice on the first page or initial screen of a display along with the full citation. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works requires prior specific permission and/or a fee. Permissions may be requested from Publications Dept., ACM, Inc., 2 Penn Plaza, Suite 701, New York, NY 10121-0701 USA, fax +1 (212) 869-0481, or permissions@acm.org.
SC '01: Proceedings of the 2001 ACM/IEEE conference on Supercomputing	Nov-01	Parallel graphics and interactivity with the scaleable graphics engine	1) Kenneth A. Perrine, Donald R. Jones	1) William R. Wiley Environmental Molecular Sciences Laboratory, Pacific Northwest National Laboratory, Richland, WA	Copyright is held by the author / owner	10.1145/582034.582039	National Lab	1) William R. Wiley Environmental Molecular Sciences Laboratory, Pacific Northwest National Laboratory, Richland, WA	No	This research was performed in part using the Molecular Science Computing Facility (MSCF) in the William R. Wiley Environmental Molecular Sciences Laboratory at the Pacific Northwest National Laboratory. The MSCF is funded by the Office of Biological and Environmental Research in the U.S. Department of Energy. Pacific Northwest is operated by Battelle for the U.S. Department of Energy under Contract DE-AC06-76RLO 1830.
RACS '16: Proceedings of the International Conference on Research in Adaptive and Convergent Systems	Oct-16	Assessing Performance of Constrained Application Protocol (CoAP) in MANET Using Emulation	1) Weichao Gao, Wei Yu, Chao Lu; 2) Daniel Ku, James Nguyen,	1) Dept. of Computer and Information Sciences, Towson Univ., USA; 2) US Army CERDEC, USA	(c) 2016 ACM. ISBN 978-1-4503-4455-5/16/10. . . $15.00	10.1145/2987386.2987400	Employee	2) US Army CERDEC, USA	No	(c) 2016 Association for Computing Machinery. ACM acknowledges that this contribution was authored or co-authored by an employee, contractor or affiliate of the United States government. As such, the United States Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only.
Communications of the ACM - Transforming China: Volume 48 Issue 4, April 2005	Apr-05	Is computer science science?	Peter J. Denning	Director of the Cebrowski Institute for information and innovation and superiority at the Naval Postgraduate School in Monterey, CA, and is a past president of ACM.	©2005 ACM 0001-0782/05/0400 $5.00	10.1145/1053291.1053309	Employee	Peter J. Denning (pjd@nps.edu) is Distinguished Professor of Computer Science and Director of the Cebrowski Institute for information innovation at the Naval Postgraduate School in Monterey, CA, is Editor of ACM Ubiquity, and is a past president of ACM.	No	Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. The Digital Library is published by the Association for Computing Machinery. Copyright © 2005 ACM, Inc.
ACM Transactions on Mathematical Software (TOMS): Volume 41 Issue 1, October 2014	Oct-14	A Comparison of hp-Adaptive Strategies for Elliptic Partial Differential Equations	1) William F. Mitchell, Marjorie A. McClain	1) National Institute of Standards and Technology	© 2014 ACM 0098-3500/2014/10-ART2 $15.00	10.1145/2629459	Employee	Author’s address: W. F. Mitchell (corresponding author) and M. A. McClain, Applied and Computational Mathematics Division, National Institute of Standards and Technology; email: william.mitchell@nist.gov.	No	© 2014 Association for Computing Machinery. ACM acknowledges that this contribution was authored or coauthored by an employee, contractor or affiliate of the United States government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only. Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from permissions@acm.org.
SC '01: Proceedings of the 2001 ACM/IEEE conference on Supercomputing	Nov-01	Multi-teraflops spin dynamics studies of the magnetic structure of FeMn/Co interfaces	1) A. Canning; 2)  B. Ujfalussy; 3) T. C. Schulthess, X.-G. Zhang, W. A. Shelton, D. M. C. Nicholson, G. M. Stocks; 4) Yang Wang; 5) T. Dirks	1) NERSC, Lawrence Berkeley National Laboratory, Berkeley, CA; 2) University of Tennessee, Knoxville TN; 3) Oak Ridge National Laboratory, Oak Ridge, TN; 4) Pittsburgh Supercomputer Center, Pittsburgh, PA; 5) IBM, Bethesda, Maryland	(c) 2001 ACM 1-58113-293-X/01/0011 $5.00	10.1145/582034.582078	National Lab	1) NERSC, Lawrence Berkeley National Laboratory, Berkeley, CA; 3) Oak Ridge National Laboratory, Oak Ridge, TN;	No	Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage, and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. The calculations reported in this work were performed at CCS-ORNL and at NERSC which are supported by the Office of Science of the U.S. Department of Energy. This work was supported by the Division of Materials Sciences and Engineering, and by the Director, Office of Advanced Scientific Computing Research, Division of Mathematical Information and Computational Sciences Division, of the U.S. Department of Energy, under contract number DE-AC03-76SF00098 and subcontract DE-AC05-00OR22725 with UT-Battelle LLC.
Communications of the ACM: Volume 56 Issue 1, January 2013	Jan-13	Browser security: appearances can be deceiving	CACM Staff	ACM	©2013 ACM 0001-0782/13/01	10.1145/2398356.2398372	Not Govt	No government agencies appear in the author affiliations	No	N/A
Communications of the ACM: Volume 43 Issue 2, Feb. 2000	Feb-00	Measurements in support of research accomplishments	1) David S. Pallett, John S. Garofolo, Jonathan G. Fiscus	1) National Institute of Standards and Technology, Gaithessburg, MD	©2000 ACM 0002-0782/00/0200 $5.00	10.1145/328236.328151	Employee	David S. Pallett (dpallet@nist.gov) is the manager of the Spoken Natural Language Processing Group at the Information Technology Laboratory at the National Institute of Standards and Technology in Gaithersburg, MD. John S. Garofolo (jgarofolo@nist.gov) is a computer scientist with the Information Technology Laboratory at the National Institute of Standards and Technology in Gaithersburg, MD. Jonathan G. Fiscus (jfiscus@nist.gov) is a computer scientist with the Information Technology Laboratory at the National Institute of Standards and Technology in Gaithersburg, MD.	No	Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. The Digital Library is published by the Association for Computing Machinery. Copyright © 2000 ACM, Inc.
Supercomputing '91: Proceedings of the 1991 ACM/IEEE conference on Supercomputing	Aug-91	A high school supercomputing challenge	1) Marion Cohen, Marilyn Foster, David Kratzer, Patricia Malone, Ann Solem	1) Computing and Communications Division, Los Alamos National Laboratory, Los Alamos, NM	© 1991 ACM 0-89791-459-7/91/0068 $01.50	10.1145/125826.125878	National Lab	1) Computing and Communications Division, Los Alamos National Laboratory, Los Alamos, NM	No	N/A
L@S '16: Proceedings of the Third (2016) ACM Conference on Learning @ Scale	Apr-16	The Role of Social Media in MOOCs: How to Use Social Media to Enhance Student Retention	1) Saijing Zheng, Mary Beth Rosson, John M. Carroll; 2) Kyungsik Han	1) The Pennsylvania State University, State College, USA; 2) Pacific Northwest National Laboratory, Richland, USA	© 2016 ACM. ISBN 978-1-4503-3726-7/16/04…$15.00.	10.1145/2876034.2876047	National Lab	2) Pacific Northwest National Laboratory, Richland, USA	No	Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Permissions@acm.org.
Journal of the ACM (JACM): Volume 20 Issue 1, Jan. 1973	Jan-73	Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment	1) C. L. Liu; 2) James W. Layland	1) Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, IL and Project MAC, Massachusetts Institute of Technology; 2) Jet Propulsion Laboratory, California Institute of Technology, 4800 Oak Grove Drive, Pasadena, CA	Copyright © 1973, Association for Computing Machinery, Inc.	10.1145/321738.321743	Employee	Authors' present addresses: James W. Layland, Jet Propulsion Laboratory, California Institute of Technology, 4800 Oak Grove Drive, Pasadena, CA 91103.	No	General permission to republish, but not for profit, all or part of this material is granted, provided that reference is made to this publication, to its date of issue, and to the fact that reprinting privileges weregranted by permission of the Association for Computing Machinery. This paper presents the results of one phase of research carried out at the Jet Propulsion Laboratory, Califorma Institute of Technology, under Contract No. NAS-7-100, sponsored by the National Aeronautics and Space Administration.
ACM Computing Surveys (CSUR): Volume 48 Issue 2, November 2015	Nov-15	A Survey on Trust Modeling	1) Jin-Hee Cho, Kevin Chan; 2) Sibel Adali	1) US Army Research Laboratory, Adelphi, MD; 2) Rensselaer Polytechnic Institute, Troy, NY	© 2015 ACM 0360-0300/2015/10-ART28 $15.00	10.1145/2815595	Employee	Authors’ addresses: J.-H. Cho and K. S. Chan, 2800 Powder Mill Rd., Adelphi, MD 20783; emails: {jin-hee. cho.civ, kevin.s.chan.civ}@mail.mil;	No	Research was in part sponsored by the Army Research Laboratory and was accomplished under Cooperative Agreement Number W911NF-09-2-0053. The views and conclusions contained in this document are those of the authors and should not be interpreted as representing the official policies, either expressed or implied, of the Army Research Laboratory or the U.S. Government. The U.S. Government is authorized to reproduce and distribute reprints for Government purposes notwithstanding any copyright notation here on. This research was also partially supported by the Department of Defense (DoD) through the Office of the Assistant Secretary of Defense for Research and Engineering (ASD(R&E)). The views and opinions of the author(s) do not reflect those of the DoD nor ASD(R&E). Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies show this notice on the first page or initial screen of a display along with the full citation. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works requires prior specific permission and/or a fee. Permissions may be requested from Publications Dept., ACM, Inc., 2 Penn Plaza, Suite 701, New York, NY 10121-0701 USA, fax +1 (212) 869-0481, or permissions@acm.org.
ACM Transactions on Mathematical Software (TOMS): Volume 16 Issue 4, Dec. 1990	Dec-90	Remark on algorithm 662	1) B. S. Garbow, J. N. Lyness	1) Argonne National Lab, Argonne, IL	© 1990 ACM 0098-3500/90/1200-0405 $01.50	10.1145/98267.98302	National Lab	Authors’ address: Mathematics and Computer Science Division, Argonne National Laboratory, 9700 S. Cass Avenue, Argonne, IL 60439.	No	Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Association for Computing Machinery. To copy otherwise, or to republish, requires a fee and/or specific permission.
SIGIR '15: Proceedings of the 38th International ACM SIGIR Conference on Research and Development in Information Retrieval	Aug-15	Challenges of Mathematical Information Retrievalin the NTCIR-11 Math Wikipedia Task	1) Moritz Schubotz, Volker Markl; 2) Abdou Youssef; 3) Howard S. Cohl	1) Technische Universität Berlin, Berlin, Germany; 2) The George Washington University, Washington , DC, USA; 3) National Institute of Standards and Technology, Gaithersburg, MD, USA	Copyright is held by the owner/author(s). Publication rights licensed to ACM.	10.1145/2766462.2767787	Employee	3) National Institute of Standards and Technology, Gaithersburg, MD, USA	No	Publication rights licensed to ACM. ACM acknowledges that this contribution was authored or co-authored by an employee, contractor or affiliate of the US Government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only. This work has been supported through grants by the German Science Foundation (DFG) as FOR 1306 Stratosphere and by the German Ministry for Education and Research as Berlin Big Data Center BBDC (funding mark 01IS14013A).
AVI '12: Proceedings of the International Working Conference on Advanced Visual Interfaces	May-12	Usable advanced visual interfaces in aviation	Mark T. Maybury	Air Force, Pentagon, Washington, D. C.	Copyright 2012 ACM 978-1-4503-1287-5/12/05 …$10.00.	10.1145/2254556.2254558	Employee	Air Force, Pentagon, Washington, D. C.	No	Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee.
Supercomputing '89: Proceedings of the 1989 ACM/IEEE conference on Supercomputing	Aug-89	Parallel solution of pentadiagonal systems using generalized odd-even elimination	C. Levit	NASA Ames Research Center, Mail Stop T045-1, Moffett Field, CA	© 1989 ACM 089791-341-S/89/001 l/O333 $1.50	10.1145/76263.76299	Employee	NASA Ames Research Center, Mail Stop T045-1, Moffett Field, CA	No	Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Association for Computing Machinery. To copy otherwise, or to republish, requires a fee and/or specific permission.
UbiComp '15: Proceedings of the 2015 ACM International Joint Conference on Pervasive and Ubiquitous Computing	Sep-15	Visualization of time-series sensor data to inform the design of just-in-time adaptive stress interventions	1) Moushumi Sharmin, Santosh Kumar, J. Gayle Beck; 2) Andrew Raij; 3) David Epstien, Kenzie Preston; 4) Inbal Nahum-Shani; 5) Sudip Vhaduri	1) University of Memphis; 2) University of Central Florida; 3) NIDA IRP; 4) University of Michigan; 5) University of Notre Dame	Copyright is held by the owner/author(s). Publication rights licensed to ACM.	10.1145/2750858.2807537	Employee	3) NIDA IRP;	No	Publication rights licensed to ACM. ACM acknowledges that this contribution was authored or co-authored by an employee, contractor or affiliate of the United States government. As such, the United States Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only
Communications of the ACM: Volume 55 Issue 1, January 2012	Jan-12	The yin and yang of copyright and technology	Randal C. Picker	Paul and Theo Leffmann Professor of Commercial Law at The University of Chicago Law School and Senior Fellow at The Computation Institute of the University of Chicago and Argonne National Laboratory.	Copyright held by author.	10.1145/2063176.2063190	Unsure	Randal C. Picker (r-picker@uchicago.edu) is Paul and Theo Leffmann Professor of Commercial Law at The University of Chicago Law School and Senior Fellow at The Computation Institute of the University of Chicago and Argonne National Laboratory.	No	The Digital Library is published by the Association for Computing Machinery. Copyright © 2012 ACM, Inc.
ACM Transactions on Mathematical Software (TOMS) - Special issue on the Advanced CompuTational Software (ACTS) Collection: Volume 31 Issue 3, September 2005	Sep-05	SUNDIALS: Suite of nonlinear and differential/algebraic equation solvers	1) Alan C. Hindmarsh, Peter N. Brown, Keith E. Grant, Steven L. Lee, Radu Serban, Dan E. Shumaker, Carol S. Woodward	1) Lawrence Livermore National Laboratory, Livermore, CA	© 2005 ACM 0098-3500/05/0900-0363 $5.00	10.1145/1089014.1089020	National Lab	Authors’ addresses: Lawrence Livermore National Laboratory, P.O. Box 808, Livermore, CA 94551; email: {alanh,pnbrown,keg,slee,radu,shumaker,cswoodward}@llnl.gov.	No	This work was performed under the auspices of the U.S. Department of Energy by the University of California, Lawrence Livermore National Laboratory, under contract No. W-7405-Eng-48. (c) 2005 Association for Computing Machinery. ACM acknowledges that this contribution was authored or co-authored by a contractor or affiliate of the [U.S.] Government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or direct commercial advantage and that copies show this notice on the first page or initial screen of a display along with the full citation. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works requires prior specific permission and/or a fee. Permissions may be requested from Publications Dept., ACM, Inc., 1515 Broadway, New York, NY 10036 USA, fax: +1 (212) 869-0481, or permissions@acm.org
ACM SIGPLAN Notices - Special issue: HOPL-II. (See expanded book version): Volume 32 Issue 9, Sept. 1997	Sep-97	HOPL II—closing panel: The history of programming (panel): does our present past have a future?	1) Michael S. Mahoney, Tim Bergin	1) No affiliation given	N/A	10.1145/270507.270509	Not Govt	No government agencies appear in the author affiliations.	No	N/A
ACM Transactions on Applied Perception (TAP): Volume 7 Issue 2, February 2010	Feb-10	Impressionism, expressionism, surrealism: Automated recognition of painters and schools of art	1) Lior Shamir, Tomasz Macura, Nikita Orlov, D. Mark Eckley, Ilya G. Goldberg	1) Image Informatics Group/Laboratory of Genetics/NIA/NIH, Baltimore, MD	© 2010 ACM 1544-3558/2010/02-ART8 $10.00	10.1145/1670671.1670672	Employee	Author’s address: Lior Shamir, Laboratory of Genetics/NIA/NIH, 333 Cassell Dr., Baltimore, MD 21224; email: shamirl@mail.nih.gov.	No	This research was supported entirely by the Intramural Research Program of the NIH, National Institute on Aging. © 2010 Association for Computing Machinery. ACM acknowledges that this contribution was authored or co-authored by a contractor or affiliate of the [U.S.] Government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies show this notice on the first page or initial screen of a display along with the full citation. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works requires prior specific permission and/or a fee. Permissions may be requested from Publications Dept., ACM, Inc., 2 Penn Plaza, Suite 701, New York, NY 10121-0701 USA, fax +1 (212) 869-0481, or permissions@acm.org.
SC '11: Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis	Nov-11	Avoiding hot-spots on two-level direct networks	1) Abhinav Bhatele; 2) Nikhil Jain, William D. Gropp, Laxmikant V. Kale	1) Lawrence Livermore National Laboratory, Livermore, CA; 2) University of Illinois at Urbana-Champaign, Urbana, IL	Copyright 2011 ACM 978-1-4503-0771-0/11/11 ...$10.00.	10.1145/2063384.2063486	National Lab	1) Lawrence Livermore National Laboratory, Livermore, CA;	No	Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. This research was supported in part by the Blue Waters sustainedpetascale computing project (which is supported by the NSF grant OCI 07-25070 and the state of Illinois) and by a DOE Grant DESC0001845 for HPC Colony II. Runs for this paper were done on Blue Print and Ember, resources at NCSA. The authors would like to thank Ryan Mokos for building the Blue Waters network simulation model used in this paper. This document was released by Lawrence Livermore National Laboratory for an external audience as LLNL-CONF-491454.
ACM SIGPLAN Notices: Volume 36 Issue 8, Aug. 2001	Aug-01	Parametric Timing Analysis	1) Emilio Vivancos; 2) Christopher Healy; 3) Frank Mueller, David Whalley	1) Universidad Politecnica de Valencia, Spain; 2) Furman University, Greenville, SC, USA; 3) Lawrence Livermore National Laboratory, Livermore, CA, USA	© ACM 2001 1-58113-425-8/01/06…$5.00	10.1145/384196.384230	National Lab	3) Lawrence Livermore National Laboratory, Livermore, CA, USA	No	Permission to make digital or hard copies of part or all of this work or personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee.
EuroMPI 2016: Proceedings of the 23rd European MPI Users' Group Meeting	Sep-16	MPI Sessions: Leveraging Runtime Infrastructure to Increase Scalability of Applications at Exascale	1) Daniel Holmes; 2) Ryan E. Grant; 3) Anthony Skjellum; 4) Wesley Bland; 5) Jeffrey M. Squyres; 6) Kathryn Mohror, Martin Schulz	1) EPCC, University of Edinburgh; 2) Center for Computing Research, Sandia National Laboratories; 3) Auburn University; 4) Intel Corporation; 5) Cisco Systems, Inc.; 6) Lawrence Livermore National Laboratory	© 2016 Copyright held by the owner/author(s). Publication rights licensed to ACM	10.1145/2966884.2966915	National Lab	2) Center for Computing Research, Sandia National Laboratories; 6) Lawrence Livermore National Laboratory	No	Publication rights licensed to ACM. ACM acknowledges that this contribution was authored or co-authored by an employee, contractor or affiliate of the United States government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only. Part of this work was performed under the auspices of the U.S. Department of Energy by Lawrence Livermore National Laboratory under Contract DE-AC52-07NA27344. LLNLCONF-692709. Sandia National Laboratories is a multi-program laboratory managed and operated by Sandia Corporation, a whollyowned subsidiary of Lockheed Martin Corporation, for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-AC04-94AL85000. This work was part-funded by the European Union’s Horizon 2020 Research and Innovation programme under Grant Agreement 671602 (the INTERTWinE project). Intel and the Intel logo are trademarks of Intel Corporation in the U.S. and/or other countries. *Other names and brands may be claimed as the property of others. This material is based upon work supported by the National Science Foundation under Grants Nos. 1562659 and 1229282. Any opinions, findings, and conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect the views of the National Science Foundation.
DAC '08: Proceedings of the 45th annual Design Automation Conference	Jun-08	Design of a mask-programmable memory/multiplier array using G4-FET technology	1) Jay Brockman, Sheng Li, Peter Kogge; 2) Amit Kashyap; 3) Mohammad Mojarradi	1) University of Notre Dame, Notre Dame, IN; 2) Advanced Micro Devices, Austin, TX; 3) NASA Jet Propulsion, Laboratory, Pasadena, CA	Copyright 2008 ACM ACM 978-1-60558-115-6/08/0006 …5.00	10.1145/1391469.1391555	Employee	3) NASA Jet Propulsion, Laboratory, Pasadena, CA	No	Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. This work was supported by AFRL and DARPA under contract FA8601-04-D.
ACM Transactions on Programming Languages and Systems (TOPLAS): Volume 16 Issue 6, Nov. 1994	Nov-94	Software merge: semantics of combining changes to programs	Valdis Berzins	Naval Postgraduate School, Monterey, CA	© 1994 ACM 0164-0925/1100-1875 $03.50	10.1145/197320.197403	Employee	Author’s address: Computer Science Department, Naval Postgraduate School, Monterey. CA 93943; email: berzins@cs.nps.navy.mil.	No	This research was supported in part by the Army Research OffIce under grant ARO-145-91. Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given that copying m by permission of the Association for Computing Machinery To copy otherwise, or to republish. requires a fee and/or specific permission.
ACM Transactions on Database Systems (TODS): Volume 29 Issue 3, September 2004	Sep-04	Managing uncertainty in moving objects databases	1) Goce Trajcevski; 2) Ouri Wolfson; 3) Klaus Hinrichs; 4) Sam Chamberlain	1) Northwestern University, Evanston, IL; 2) University of Illinois at Chicago, Chicago, IL; 3) Westfälische Wilhelms-Universität Mänster, 48149 Mänster, Germany; 4) Army Research Laboratory, MD	© 2004 ACM 0362-5915/04/0900-0463 $5.00	10.1145/1016028.1016030	Employee	Authors' addresses: S. Chamberlain, Army Research Laboratory, Aberdeen Proving Ground, MD 21005-5067; email: wildman@arl.mil.	No	Permission to make digital/hard copy of part or all of this work for personal or classroom use is granted without fee provided that the copies are not made or distributed for profit or commercial advantage, the copyright notice, the title of the publication, and its date appear, and notice is given that copying is by permission of ACM, Inc. To copy otherwise, to republish, to post on servers, or to redistribute to lists requires prior specific permission and/or a fee.
MEMSYS '16: Proceedings of the Second International Symposium on Memory Systems	Oct-16	Evaluating the feasibility of storage class memory as main memory	1) Scott Lloyd, Maya Gokhale	1) Lawrence Livermore National Laboratory, Livermore, CA	© 2016 ACM. ISBN 978-1-4503-4305-3/16/10. . . $15.00	10.1145/2989081.2989118	National Lab	1) Lawrence Livermore National Laboratory, Livermore, CA	No	Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from permissions@acm.org.
Supercomputing '91: Proceedings of the 1991 ACM/IEEE conference on Supercomputing	Aug-91	Computing modeling in a MIMD environment	William Dannevik	Lawrence Livermore National Laboratory	N/A	10.1145/125826.126151	National Lab	Lawrence Livermore National Laboratory	No	N/A
ACM Transactions on Mathematical Software (TOMS): Volume 9 Issue 1, March 1983	Mar-83	Algorithm 592: A FORTRAN Subroutine for Computing the Optimal Estimate of f(x)	P. W. Gaffney	Computer Sciences, Oak Ridge National Laboratory, Building 9104-2, P.O. Box Y, Oak Ridge, TN	1983 ACM 0098-3500/83/0300-0098 $00.00	10.1145/356022.356027	National Lab	Author's address: Computer Sciences, Oak Ridge National Laboratory, Budding 9104-2, P.O. Box Y, Oak Ridge, TN 37830.	No	Oak Ridge National Laboratory is operated by Union Carbide Corporation under Contract W-7405-eng-26 with the U.S. Department of Energy.
IWCTS '16: Proceedings of the 9th ACM SIGSPATIAL International Workshop on Computational Transportation Science	Oct-16	Energy impact of different penetrations of connected and automated vehicles: a preliminary assessment	1) Jackeline Rios-Torres, Andreas A. Malikopoulos	1) Oak Ridge National Laboratory, Oak Ridge	© 2016 ACM	10.1145/3003965.3003969	National Lab	1) Oak Ridge National Laboratory, Oak Ridge	No	© 2016 Association for Computing Machinery. ACM acknowledges that this contribution was authored or co-authored by an employee, contractor or affiliate of the United States government. As such, the United States Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only. This research was supported by DOE’s SMART Mobility Initiative. This support is gratefully acknowledged.
ISLPED '06: Proceedings of the 2006 international symposium on Low power electronics and design	Oct-06	Lifetime aware resource management for sensor network using distributed genetic algorithm	1) Qinru Qiu, Qing Wu; 2) Daniel Burns, Douglas Holzhauer	1) Binghamton University, Binghamton, NY; 2) Air Force Research Laboratory, Rome, NY	Copyright 2006 ACM 1-59593-462-6/06/0010...$5.00.	10.1145/1165573.1165618	Employee	2) Air Force Research Laboratory, Rome, NY	No	Copyright 2006 Association for Computing Machinery. ACM acknowledges that this contribution was authored or co-authored by an employee, contractor or affiliate of the U.S. Government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only.
SC '09: Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis	Nov-09	I/O performance challenges at leadership scale	1) Samuel Lang, Philip Carns, Robert Latham, Robert Ross, Kevin Harms, William Allcock	1) Argonne National Laboratory, Argonne, IL	Copyright 2009 ACM 978-1-60558-744-8/09/11 ...$10.00	10.1145/1654059.1654100	National Lab	1) Argonne National Laboratory, Argonne, IL	No	Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. This research used resources of the Argonne Leadership Computing Facility at Argonne National Laboratory, which is supported by the Office of Science of the U.S. Department of Energy under contract DE-AC02-06CH11357.
CIKM '16: Proceedings of the 25th ACM International on Conference on Information and Knowledge Management	Oct-16	TEAMOPT: Interactive Team Optimization in Big Networks	1) Liangyue Li, Hanghang Tong; 2) Nan Cao; 3) Kate Ehrlich; 4) Yu-Ru Lin; 5) Norbou Buchler	1) Arizona State University, Tempe, AZ, USA; 2) NYU Shanghai, Shanghai, China; 3) IBM Research, Cambridage, MA, USA; 4) University of Pittsburgh, Pittsburgh, PA, USA; 5) US Army Research Laboratory, Aberdeen Proving Ground, MD, USA	(c) 2016 Copyright held by the owner/author(s).	10.1145/2983323.2983340	Employee	5) US Army Research Laboratory, Aberdeen Proving Ground, MD, USA	No	Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the owner/author(s). This work is partially supported by the National Science Foundation under Grant No. IIS1017415, by DTRA under the grant number HDTRA1-16-0017, by Army Research Office under the contract number W911NF-16-1-0168, by National Institutes of Health under the grant number R01LM011986, Region II University Transportation Center under the project number 49997-33 25 and a Baidu gift.
MEMSYS '16: Proceedings of the Second International Symposium on Memory Systems	Oct-16	Analyzing allocation behavior for multi-level memory	1) Gwendolyn Voskuilen, Arun F. Rodrigues, Simon D. Hammond	1) Center for Computing Research, Sandia National Laboratories, Albuquerque, NM, USA	(c) 2016 ACM. ISBN 978-1-4503-4305-3/16/10. . . $15.00	10.1145/2989081.2989116	National Lab	1) Center for Computing Research, Sandia National Laboratories, Albuquerque, NM, USA	No	Sandia is a multi-program laboratory operated by Sandia Corporation, a Lockheed Martin Company, for the United States Department of Energy’s National Nuclear Security Administration under contract DE-AC04-94AL85000. ACM acknowledges that this contribution was authored or co-authored by an employee, or contractor of the national government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only. Permission to make digital or hard copies for personal or classroom use is granted. Copies must bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. To copy otherwise, distribute, republish, or post, requires prior specific permission and/or a fee. Request permissions from permissions@acm.org.
WSC '97: Proceedings of the 29th conference on Winter simulation	Dec-97	Object-oriented simulation of paratrooper-vortex interactions	1) T. Glenn Bailey, Jose C. Belano, III, Philip S. Beran, Jack M. Kloeber, Jr., Hans J. Petry	1) Department of Operational Sciences, Air Force Institute of Technology, 2950 P Street, Bldg. 640 (AFIT/ENS), Wright-Patterson AFB, OH	N/A	10.1145/268437.268675	Employee	1) Department of Operational Sciences, Air Force Institute of Technology, 2950 P Street, Bldg. 640 (AFIT/ENS), Wright-Patterson AFB, OH	No	N/A
SC '11: Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis	Nov-11	End-to-end network QoS via scheduling of flexible resource reservation requests	1) Sushant Sharma, Dimitrios Katramatos, Dantong Yu	1) Computational Science Center, Brookhaven National Laboratory, Upton, NY	Copyright 2011 ACM 978-1-4503-0771-0/11/11 ...$10.00.	10.1145/2063384.2063475	National Lab	1) Computational Science Center, Brookhaven National Laboratory, Upton, NY	No	Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. This work is supported by the Director, Office of Science, Office of Advanced Scientific Computing Research, of the U.S. Department of Energy under Contract No. DE-AC02-98CH10886 (to BNL).
ICSE 2014: Proceedings of the 36th International Conference on Software Engineering	May-14	Property differencing for incremental checking	1) Guowei Yang; 2) Sarfraz Khurshid; 3) Suzette Person; 4) Neha Rungta	1) Texas State University, USA; 2) University of Texas at Austin, USA; 3) NASA Langley Research Center, USA; 4) NASA Ames Research Center, USA	Copyright 2014 ACM 978-1-4503-2756-5/14/05...$15.00	10.1145/2568225.2568319	Employee	3) NASA Langley Research Center, USA; 4) NASA Ames Research Center, USA	No	Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Permissions@acm.org This work was funded in part by the National Science Foundation (NSF Grant Nos. CCF-0845628, CCF-1319688, and CNS-1239498).
ACM Transactions on Intelligent Systems and Technology (TIST): Volume 3 Issue 3, May 2012	May-12	Dynamic Landmarking for Surface Feature Identification and Change Detection	1) Kiri L. Wagstaff, Julian Panetta, Adnan Ansar; 2) Ronald Greeley, Mary Pendleton Hoffer, Melissa Bunte; 3) Norbert Schörghofer	1) Jet Propulsion Laboratory, California Institute of Technology; 2) Arizona State University; 3) University of Hawaii	(c) 2012 ACM 2157-6904/2012/05-ART49 $10.00	10.1145/2168752.2168763	Employee	Author’s address: K. L. Wagstaff, Jet Propulsion Laboratory, 4800 Oak Grove Drive, Mail Stop 306-463, Pasadena, CA 91109; email: kiri.wagstaff@jpl.nasa.gov	No	This work was funded by a grant from NASA’s Applied Information Systems Research Program. It was carried out in part at the Jet Propulsion Laboratory, California Institute of Technology, under a contract with the National Aeronautics and Space Administration. (c) 2012 Association for Computing Machinery. ACM acknowledges that this contribution was authored or co-authored by a contractor or affiliate of the [U.S.] Government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies show this notice on the first page or initial screen of a display along with the full citation. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works requires prior specific permission and/or a fee. Permissions may be requested from the Publications Dept., ACM, Inc., 2 Penn Plaza, Suite 701, New York, NY 10121-0701, USA, fax +1 (212) 869-0481, or permissions@acm.org.
Communications of the ACM: Volume 53 Issue 6, June 2010	Jun-10	The resurgence of parallelism	1) Peter J. Denning; 2) Jack B. Dennis	1) director of the Cebrowski Institute for Innovation and Information Superiority at the Naval Postgraduate School in Monterey, CA, and is a past president of ACM; 2) Professor Emeritus of Computer Science and Engineering at MIT	Copyright held by author.	10.1145/1743546.1743560	Employee	Peter J. Denning (pjd@nps.edu) is Distinguished Professor of Computer Science and Director of the Cebrowski Institute for information innovation at the Naval Postgraduate School in Monterey, CA, is Editor of ACM Ubiquity, and is a past president of ACM.	No	The Digital Library is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc.
Journal of the ACM (JACM): Volume 25 Issue 3, July 1978	Jul-78	The Bottleneck Traveling Salesman Problem: Algorithms and Probabilistic Analysis	1) R. S. Garfinkel; 2) K. C. Gilbert	1) Management Science Program, College of Business Administration, University of Tennessee, Knoxville, TN; 2) Tennessee Valley Authority, Knoxville, TN	© 1978 ACM 0004-5411/78/0700-0435 $00 75	10.1145/322077.322086	Employee	Authors' addresses: K C Gilbert, Tennessee Valley Authority, Knoxville, TN 37902	No	General permission to make fair use In teaching or research of all or part of this material IS granted to individual readers and to nonprofit libraries acting for them provided that ACM's copyright notice is given and that reference is made to the pubhcatlon, to its date of issue, and to the fact that reprmtlng privileges were granted by permission of the Association for Computing Machinery To otherwise reprint a figure, table, other substantial excerpt, or the entire work requires specific permission as does repubhcatlon, or systematic or multiple reproduction
UbiComp '15: Proceedings of the 2015 ACM International Joint Conference on Pervasive and Ubiquitous Computing	Sep-15	PerCCS: person-count from carbon dioxide using sparse non-negative matrix factorization	1) Chandrayee Basu; 2) Christian Koehler, Anind K. Dey; 3) Kamalika Das,	1) University of California, Merced; 2) Carnegie Mellon University, Pittsburgh, PA; 3) UARC, NASA Ames Research Center	Copyright 2015 (c) ACM 978-1-4503-3574-4/15/09...$15.00.	10.1145/2750858.2807525	Unsure	3) UARC, NASA Ames Research Center	No	(c) 2015 Association for Computing Machinery. ACM acknowledges that this contribution was authored or co-authored by an employee, contractor or affiliate of the United States government. As such, the United States Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only. This research was supported by the National Aeronautics and Space Administration under Prime Contract Number NAS2-03144 awarded to the University of California, Santa Cruz, University Affiliated Research Center and NSF grants IIS-1227495 and IIS-1217929.
Communications of the ACM: Volume 57 Issue 7, July 2014	Jul-14	Future Tense: The Chatbot and the Drone	Geoffrey A. Landis	NASA's John Glenn Research Center in Cleveland, OH	©2014 ACM 0001-0782/14/07	10.1145/2631171	Unsure	Geoffrey A. Landis (geoffrey.landis@nasa.gov) is a researcher at NASA's John Glenn Research Center in Cleveland, OH, where he works on advanced power systems for space missions and is a member of the Mars Exploration Rovers science team. He has won the Hugo and Nebula awards for his science fiction, which includes the novel Mars Crossing (Tor Books, 2000) about an expedition to the red planet.	No	Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and full citation on the first page. Copyright for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or fee. Request permission to publish from permissions@acm.org or fax (212) 869-0481. The Digital Library is published by the Association for Computing Machinery. Copyright © 2014 ACM, Inc.
HT '16: Proceedings of the 27th ACM Conference on Hypertext and Social Media	Jul-16	Teens Engage More with Fewer Photos: Temporal and Comparative Analysis on Behaviors in Instagram	1) Jin Yea Jang,Dongwon Lee, Haiyan Jia; 2) Kyungsik Han; 3) Patrick C. Shih	1) Pennsylvania State University, State College, PA, USA; 2) Pacific Northwest National Laboratory, Richland, WA, USA; 3) Indiana University, Bloomington, IN, USA	© 2016 ACM. ISBN 978-1-4503-4247-6/16/07…$15.00	10.1145/2914586.2914602	National Lab	2) Pacific Northwest National Laboratory, Richland, WA, USA;	No	© 2016 Association for Computing Machinery. ACM acknowledges that this contribution was authored or co-authored by an employee, contractor or affiliate of the United States government. As such, the United States Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only. This research was in part supported by NSF CNS-1422215, NSF IUSE-1525601, and Samsung GRO 2015 awards.
SC '15: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis	Nov-15	Finding the limits of power-constrained application performance	1) Peter E. Bailey, Aniruddha Marathe, David K. Lowenthal; 2) Barry Rountree, Martin Schulz	1) The University of Arizona; 2) Lawrence Livermore National Laboratory	(c) 2015 ACM. ISBN 978-1-4503-3723-6/15/11. . . $15.00	10.1145/2807591.2807637	National Lab	2) Lawrence Livermore National Laboratory	No	ACM acknowledges that this contribution was authored or co-authored by an employee, or contractor of the national government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only. Permission to make digital or hard copies for personal or classroom use is granted. Copies must bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. To copy otherwise, distribute, republish, or post, requires prior specific permission and/or a fee. Request permissions from permissions@acm.org. This material is based upon work supported by the National Science Foundation under Grant No. 1216829, by the 2013 Exascale Operating and Runtime Systems Program under the Office of Advanced Scientific Computing Research in the DOE Office of Science, and by the U.S. Department of Energy’s Lawrence Livermore National Laboratory, Office of Science, under Award number DEAC52-07NA27344 and by Office of Science, Office of Advanced Scientific Computing Research (LLNL-CONF-675735).
ACM Transactions on Modeling and Computer Simulation (TOMACS) - Special issue on simulation in complex service systems: Volume 24 Issue 1, January 2014	Jan-14	Data-driven simulation of complex multidimensional time series	1) Lee W. Schruben; 2) Dashi I. Singham	1) University of California, Berkeley, CA; 2) Naval Postgraduate School, Monterey, CA	(c) 2014 ACM 1049-3301/2014/01-ART5 $15.00	10.1145/2553082	Employee	Authors’ addresses: D. I. Singham, 1411 Cunningham Road, Naval Postgraduate School, Monterey, CA 93940; email: dsingham@nps.edu.	No	Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies show this notice on the first page or initial screen of a display along with the full citation. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works requires prior specific permission and/or a fee. Permissions may be requested from Publications Dept., ACM, Inc., 2 Penn Plaza, Suite 701, New York, NY 10121-0701 USA, fax +1 (212) 869-0481, or permissions@acm.org.
SC '13: Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis	Nov-13	Kinetic turbulence simulations at extreme scale on leadership-class systems	1) Bei Wang; 2) Stephane Ethier; 3) William Tang; 4) Timothy Williams; 5) Kamesh Madduri; 6) Samuel Williams, Leonid Oliker, Khaled Z. Ibrahim	1) Princeton University, Princeton, NJ; 2) Princeton Plasma Physics Laboratory, Princeton, NJ; 3) Princeton University, Princeton, NJ and Princeton Plasma Physics Laboratory, Princeton, NJ; 4) Argonne National Laboratory, Argonne, IL; 5) The Pennsylvania State University, PA and Lawrence Berkeley National Laboratory, Berkeley, CA; 6) Lawrence Berkeley National Laboratory, Berkeley, CA	Copyright 2013 ACM 978-1-4503-2378-9/13/11 ...$15.00	10.1145/2503210.2503258	National Lab	6) Lawrence Berkeley National Laboratory, Berkeley, CA	No	(c) 2013 Association for Computing Machinery. ACM acknowledges that this contribution was authored or co-authored by an employee, contractor or affiliate of the United States government. As such, the United States Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only
ACM Transactions on Internet Technology (TOIT): Volume 10 Issue 4, March 2011	Mar-11	Load Balancing and Range Queries in P2P Systems Using P-Ring	1) Adina Crainiceanu; 2) Prakash Linga; 3) Ashwin Machanavajjhala; 4) Johannes Gehrke; 5) Jayavel Shanmugasundaram	1) United States Naval Academy; 2) Moka5; 3) Yahoo! Research; 4) Cornell University; 5) Google Inc.	(c) 2011 ACM 1533-5399/2011/03-ART16 $10.00	10.1145/1944339.1944343	Employee	Authors’ addresses: A. Crainiceanu, United States Naval Academy, 121 Blake Road, Annapolis, MD 21402-5000; email: adina@usna.edu	No	This material is based upon work supported by NSF Grant 0133481, by AFOSR under Grants F49620-02-1-0233 and FA9550-10-1-0202, by the Naval Academy Research Council and ONR under Grants N0001406WR20137 and N0001408WR40063, by the iAd Project funded by the Research Council of Norway, and by the New York State Foundation for Science, Technology, and Innovation under Agreement C050061. Any opinions, findings, and conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect the views of the sponsors. (c) 2011 Association for Computing Machinery. ACM acknowledges that this contribution was authored or co-authored by a contractor or affiliate of the [U.S.] Government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies show this notice on the first page or initial screen of a display along with the full citation. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works requires prior specific permission and/or a fee. Permissions may be requested from the Publications Dept., ACM, Inc., 2 Penn Plaza, Suite 701, New York, NY 10121-0701 USA, fax +1 (212)869-0481, or permissions@acm.org.
ACM Transactions on Mathematical Software (TOMS): Volume 21 Issue 4, Dec. 1995	Dec-95	A remark on Algorithm 644: “A portable package for Bessel functions of a complex argument and nonnegative order”	D. E. Amos	Sandia National Labs., Albuquerque, NM	(c) 1995 ACM 0098-3500/95/1200-0388 $03.50	10.1145/212066.212078	National Lab	Author’s address: Sandla National Laboratories, 7704 Plckard Avenue NE, Albuquerque, NM 87110.	No	This work was supported by the United States Department of Energy under contract DE-AC04-94AL85000. Permission to make digital/hard copy of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage, the copyright notice, the title of the publication, and Its date appear, and notice is given that copying is by permission of ACM, Inc. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee
ACM Transactions on Mathematical Software (TOMS): Volume 37 Issue 4, February 2011	Feb-11	SelInv---An Algorithm for Selected Inversion of a Sparse Symmetric Matrix	1) Lin Lin, Weinan E; 2) Chao Yang, Juan C. Meza; 3) Jianfeng Lu; 4) Lexing Ying,	1) Princeton University; 2) Lawrence Berkeley National Laboratory; 3) Courant Institute of Mathematical Sciences; 4) University of Texas at Austin	(c) 2011 ACM 0098-3500/2011/02-ART40 $10.00	10.1145/1916461.1916464	National Lab	2) Lawrence Berkeley National Laboratory;	No	This work was partially supported by NSF under Contract No. DMS-0708026 and No. DMS-0914336, by Doe under Contract No. DE-FG02-03ER25587, and by ONR under Contract No. N00014-01-1-0674 (L. Lin, J. Lu, and W. E); by an Alfred P. Sloan fellowship and a startup grant from the University of Texas at Austin (L. Ying); and by the Director, Office of Science, Division of Mathematical, Information, and Computational Sciences of the U.S. Department of Energy under Contract No. DE-AC02-05CH11231 (C. Yang and J. C. Meza). The computational results presented were obtained at the National Energy Research Scientific Computing Center (NERSC), which is supported by the Director, Office of Advanced Scientific Computing Research of the U.S. Department of Energy under contract number DE-AC02-05CH11232. c 2011 Association for Computer Machinery. ACM acknowledges that this contribution was authored or co-authored by a contractor or affiliate of the [U.S.] Government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only. Permission to make digital or hard copies part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies show this notice on the first page or initial screen of a display along with the full citation. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works requires prior specific permission and/or a fee. Permissions may be requested from the Publications Dept., ACM, Inc., 2 Penn Plaza, Suite 701, New York, NY 10121-0701 USA, fax +1 (212) 869-0481, or permission@acm.org.
ACM Transactions on Sensor Networks (TOSN): Volume 5 Issue 3, May 2009	May-09	Acoustic sensor network design for position estimation	1) Volkan Cevher; 2) Lance M. Kaplan	1) Rice University, Houston, TX; 2) U.S. Army Research Laboratory, Adelphi, MD	© 2009 ACM 1550-4859/2009/05-ART21 $10.00	10.1145/1525856.1525859	Employee	Authors’ addresses: L. Kaplan, Army Research Laboratory, 2800 Powder Mill Road, Adelphi, MD 20783.	No	c 2009 Association for Computing Machinery. ACM acknowledges that this contribution was authored or co-authored by a contractor or affiliate of the [U.S.] Goverment. As such, the Government retains a nonexclusive royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies show this notice on the first page or initial screen of a display along with the full citation. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works requires prior specific permission and/or a fee. Permissions may be requested from Publications Dept., ACM, Inc., 2 Penn Plaza, Suite 701, New York, NY 10121-0701 USA, fax +1 (212) 869-0481, or permissions@acm.org.
ACM Transactions on Graphics (TOG): Volume 24 Issue 1, January 2005	Jan-05	Perceptual photometric seamlessness in projection-based tiled displays	1) Aditi Majumder; 2) Rick Stevens	1) University of California, Irvine, CA; 2) University of Chicago, Argonne National Laboratory, Argonne, IL	(c) 2005 ACM 0730-0301/05/0100-0118 $5.00	10.1145/1037957.1037964	Unsure	2) University of Chicago, Argonne National Laboratory, Argonne, IL	No	Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or direct commercial advantage and that copies show this notice on the first page or initial screen of a display along with the full citation. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works requires prior specific permission and/or a fee. Permissions may be requested from Publications Dept., ACM, Inc., 1515 Broadway, New York, NY 10036 USA, fax: +1 (212) 869-0481, or permissions@acm.org
ACM Transactions on Mathematical Software (TOMS): Volume 27 Issue 3, September 2001	Sep-01	A case study in the performance and scalability of optimization algorithms	1) Steven J. Benson, Lois Curfman McInnes, Jorge J. Moré	1) Argonne National Laboratory, Argonne, IL	© 2001 ACM 0098-3500/01/0900-0361 $5.00	10.1145/502800.502805	National Lab	Authors’ address: Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL 60439-4844; email: more@mcs.anl.gov.	No	Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or direct commercial advantage and that copies show this notice on the first page or initial screen of a display along with the full citation. Copyrights for components of this worked owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works requires prior specific permission and/or a fee. Permissions may be requested from Publications Dept., ACM, Inc., 1515 Broadway, New York, NY 10036 USA, fax +1 (212) 869-0481, or permissions@acm.org.
Communications of the ACM: Volume 31 Issue 3, March 1988	Mar-88	On synchronization in hard-real-time systems	1) Stuart R. Faulk; 2) David L. Parnas	1) Naval Research Laboratory, Washington, DC; 2) Queen's Univ., Kingston, Ont., Canada	© 1988 ACM OOOI-07t32/88/0300-0274 $1.50	10.1145/42392.42397	Employee	1) Naval Research Laboratory, Washington, DC;	No	This work was supported in part by the U.S. Department of Defense Software Technology for Adaptable Reliable Systems (STARS) program and by the 1J.S. Navy Software Technology Project. Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Association for Computing Machinery. To copy otherwise, or to republish. requires a fee and/or specific permission.
ACM SIGPLAN Notices: Volume 32 Issue 4, April 1997	Apr-97	IEEE efforts towards standards in educational technology	1) Roy Rada; 2) James Schoening	1) Washington State University, Pullman, WA 99164-2752; 2) U.S. Army Communications Electronics Command at Ft. Monmouth, NJ 07703;	N/A	10.1145/254459.254462	Employee	James R. Schoening chairs several of the IEEE P1484 working and study groups and works for the U.S. Army Communications Electronics Command at Ft. Monmouth, NJ 07703; email schoenin@doim6.monmouth,army.mil.	No	N/A
Communications of the ACM: Volume 31 Issue 2, Feb. 1988	Feb-88	Editorial	Peter J. Denning	Director of the Cebrowski Institute for information and innovation and superiority at the Naval Postgraduate School in Monterey, CA, and is a past president of ACM.	N/A	10.1145/42372.315790	Employee	Peter J. Denning (pjd@nps.edu) is Distinguished Professor of Computer Science and Director of the Cebrowski Institute for information innovation at the Naval Postgraduate School in Monterey, CA, is Editor of ACM Ubiquity, and is a past president of ACM.	No	N/A
GECCO '14: Proceedings of the 2014 Annual Conference on Genetic and Evolutionary Computation	Jul-14	Hierarchical simulation for complex domains: air traffic flow management	1) William Curran, Kagan Tumer; 2) Adrian Agogino	1) Oregon State University, Corvallis, OR, USA; 2) NASA AMES Research Center, Moffet Field, CA, USA	Copyright 2014 ACM 978-1-4503-2662-9/14/07 ...$15.00	10.1145/2576768.2598385	Employee	2) NASA AMES Research Center, Moffet Field, CA, USA	No	Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from permissions@acm.org.
SC '09: Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis	Nov-09	Minimizing communication in sparse matrix solvers	1) Mark Hoemmen, James Demmel; 2) Katherine Yelick, Marghoob Mohiyuddin	1) University of California at Berkeley, CA; 2) University of California at Berkeley, CA and Lawrence Berkeley National Laboratory, Berkeley, CA	Copyright 2009 ACM 978-1-60558-744-8/09/11 ...$10.00	10.1145/1654059.1654096	Unsure	2) University of California at Berkeley, CA and Lawrence Berkeley National Laboratory, Berkeley, CA	No	Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee.
SC '97: Proceedings of the 1997 ACM/IEEE conference on Supercomputing	Nov-97	High-speed distributed data handling for on-line instrumentation systems	1) William E. Johnston, William Greiman, Gary Hoo, Jason Lee, Brian Tierney, Craig Tull, Douglas Olson	1) Ernest Orlando Lawrence Berkeley National Laboratory	N/A	10.1145/509593.509648	National Lab	W. E. Johnston: mail address: 50B-2239, Lawrence Berkeley National Laboratory, Berkeley, CA 94720. Tel: +1-510-486-5014, fax: +1-510-486-6363, wejohnston@lbl.gov, http://www.itg.lbl.gov/~johnston.	No	The work described in this paper is supported by the U. S. Dept. of Energy, Office of Energy Research, Office of Computational and Technology Research, Mathematical, Information, and Computational Sciences Division (http://www.er.doe.gov/production/octr/mics) under contract DE-AC03-76SF00098 with the University of California, and by DARPA, Information Systems Technology Office (http://www.ito.darpa.mil). Contact: wejohnston@lbl.gov, Lawrence Berkeley National Laboratory, mail stop: B50B-2239, Berkeley, CA, 94720, ph: 510-486 5014, fax: 510-486-6363, http://www-itg.lbl.gov). This is report no. LBNL-40697.
PACT '16: Proceedings of the 2016 International Conference on Parallel Architectures and Compilation	Sep-16	Power Tuning HPC Jobs on Power-Constrained Systems	1) Neha Gholkar, Frank Mueller; 2) Barry Rountree	1) North Carolina State University, Raleigh, NC, USA; 2) Lawrence Livermore National Laboratory, Livermore, NC, USA	(c) 2016 ACM. ISBN 978-1-4503-4121-9/16/09. . . $15.00	10.1145/2967938.2967961	National Lab	2) Lawrence Livermore National Laboratory, Livermore, NC, USA	No	ACM acknowledges that this contribution was authored or co-authored by an employee, or contractor of the national government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only. Permission to make digital or hard copies for personal or classroom use is granted. Copies must bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. To copy otherwise, distribute, republish, or post, requires prior specific permission and/or a fee. Request permissions from permissions@acm.org. This work was supported in part by NSF grants 1217748, 1058779, 0958311, and by Consortium for Advanced Simulation of Light Water Reactors (CASL). This material is also based upon work supported by the U.S. Department of Energy’s Lawrence Livermore National Laboratory. Office of Science, under Award number DE-AC52-07NA27344 and supported by Office of Science, Office of Advanced Scientific Computing Research (LLNL-CONF-656877, LLNL-CONF-698261).
Middleware '14: Proceedings of the 15th International Middleware Conference	Dec-14	Affinity-aware checkpoint restart	1) Ajay Saini, Arash Rezaei, Frank Mueller; 2) Paul Hargrove, Eric Roman	1) North Carolina State University, Raleigh, NC; 2) Lawrence Berkeley National Laboratory, Berkeley, CA	ACM 978-1-4503-2785-5/14/12 ...$15.00.	10.1145/2663165.2663325	National Lab	2) Lawrence Berkeley National Laboratory, Berkeley, CA	No	Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Permissions@acm.org. This work was supported in part by grants from Lawrence Berkeley National Laboratory and NSF grant 1058779.
ACM Transactions on Graphics (TOG): Volume 33 Issue 1, January 2014	Jan-14	k-d Darts: Sampling by k-dimensional flat searches	1) Mohamed S. Ebeida, Scott A. Mitchell, Keith R. Dalbey; 2) Anjul Patney, Andrew A. Davidson, John D. Owens	1) Sandia National Laboratories, Albuquerque, NM; 2) University of California, Davis, CA	(c) 2014 ACM 0730-0301/2014/01-ART3 $15.00	10.1145/2522528	National Lab	1) Sandia National Laboratories, Albuquerque, NM;	No	M. S. Ebeida, S. A. Mitchell, and K. R. Dalbey thank Sandia’s Validation and Verification program, and Computer Science Research Institute for supporting this work. A. Patney, A. A. Davidson, and J. D. Owens thank the National Science Foundation (grant no. CCF-1017399), Sandia LDRD award no. 13-0144, UC Lab Fees Research Program award no. 12-LR- 238449, NVIDIA and Intel Graduate Fellowships, and the Intel Science and Technology Center for Visual Computing for supporting this work. Sandia National Laboratories is a multi-program laboratory managed and operated by Sandia Corporation, a wholly owned subsidiary of Lockheed Martin Corporation, for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-AC04-94AL85000. (c) 2014 Association for Computing Machinery. ACM acknowledges that this contribution was authored or co-authored by a contractor or affiliate of the U.S. Government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies show this notice on the first page or initial screen of a display along with the full citation. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works requires prior specific permission and/or a fee. Permissions may be requested from Publications Dept., ACM, Inc., 2 Penn Plaza, Suite 701, New York, NY 10121-0701 USA, fax +1 (212) 869-0481, or permissions@acm.org.
PLDI '14: Proceedings of the 35th ACM SIGPLAN Conference on Programming Language Design and Implementation	Jun-14	Compiler-assisted detection of transient memory errors	1) Sanket Tavarageri, P. Sadayappan; 2) Sriram Krishnamoorthy	1) The Ohio State University; 2) Pacific Northwest National Lab	Copyright (c) 2014 ACM 978-1-4503-2784-8/14/06. . . $15.00.	10.1145/2594291.2594298	National Lab	2) Pacific Northwest National Lab	No	Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from permissions@acm.org. This work was supported, in part, by the U.S. Department of Energy’s (DOE) Office of Science, Office of Advanced Scientific Computing Research, under award number 63823, and by the U.S. Department of Defense under award number 63810.
ACM Transactions on Database Systems (TODS): Volume 32 Issue 1, March 2007	Mar-07	Efficient estimation of joint queries from multiple OLAP databases	1) Elaheh Pourabbas; 2) Arie Shoshani	1) National Research Council, Rome, Italy; 2) Lawrence Berkeley National Laboratory, Berkeley, CA	© 2007 ACM 0362-5915/2007/03-ART2 $5.00	10.1145/1206049.1206051	National Lab	2) Lawrence Berkeley National Laboratory, Berkeley, CA	No	Part of this work was done while E. Pourabbas was visiting Lawrence Berkeley National Laboratory and was supported by a Fulbright Fellowship. A. Shoshani was supported by the Office of Science of the U.S. Department of Energy under Contract No. DE-AC03-76SF00098. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or direct commercial advantage and that copies show this notice on the first page or initial screen of a display along with the full citation. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works requires prior specific permission and/or a fee. Permissions may be requested from Publications Dept., ACM, Inc., 2 Penn Plaza, Suite 701, New York, NY 10121-0701, fax +1 (212) 869-0481, or permissions@acm.org.
Communications of the ACM: Volume 20 Issue 11, Nov. 1977	Nov-77	Anomalous behavior of the fifty-percent rule in dynamic memory allocation	John E. Shore	Naval Research Lab, Washington, DC	Copyright © 1977 Association for Computing Machinery, Inc.	10.1145/359863.359880	Employee	Naval Research Lab, Washington, DC	No	N/A
Web3D '15: Proceedings of the 20th International Conference on 3D Web Technology	Jun-15	Dynamic 3D visualizations of complex function surfaces using X3DOM and WebGL	1) Bonita V. Saunders, Brian Antonishek, Qiming Wang, Bruce R. Miller	1) National Institute of Standards and Technology (NIST)	Copyright is held by the owner/author(s). Publication rights licensed to ACM.	10.1145/2775292.2777140	Employee	1) National Institute of Standards and Technology (NIST)	No	Publication rights licensed to ACM. ACM acknowledges that this contribution was authored or co-authored by an employee, contractor or affiliate of a national government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only. All references to commercial products are provided only for clarification of the results presented. Their identification does not imply recommendation or endorsement by NIST.
ACM Transactions on Mathematical Software (TOMS): Volume 37 Issue 3, September 2010	Sep-10	Adaptive Projection Subspace Dimension for the Thick-Restart Lanczos Method	1) Ichitaro Yamazaki, Zhaojun Bai; 2) Horst Simon, Lin-Wang Wang, Kesheng Wu	1) University of California, Davis; 2) Lawrence Berkeley National Laboratory	(c) 2010 ACM 0098-3500/2010/09-ART27 $10.00	10.1145/1824801.1824805	National Lab	2) Lawrence Berkeley National Laboratory	No	This work was supported in part by the Office of Science of the U.S. Department of Energy under Contract No. DE-AC02-05CH11231. Z. Bai was also supported in part by NSF grants DMS- 0611548 and OCI-0749217 and DOE grant DE-FC02-06ER25794. This research used resources from the National Energy Research Scientific Computing Center, which is supported by the Office of Energy Research of the U.S. Department of Energy. c 2010 Association for Computing Machinery. ACM acknowledges that this contribution was authored or co-authored by a contractor or affiliate of the [U.S.] Government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only. Permission to make digital or hard copies part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies show this notice on the first page or initial screen of a display along with the full citation. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works requires prior specific permission and/or a fee. Permissions may be requested from the Publications Dept., ACM, Inc., 2 Penn Plaza, Suite 701, New York, NY 10121-0701 USA, fax +1 (212) 869-0481, or permission@acm.org.
SC '09: Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis	Nov-09	Enabling high-fidelity neutron transport simulations on petascale architectures	1) Dinesh Kaushik, Micheal Smith, Allan Wollaber, Barry Smith, Andrew Siegel, Won Sik Yang	1) Argonne National Laboratory, Argonne, IL	Copyright 2009 ACM 978-1-60558-744-8/09/11 ...$10.00	10.1145/1654059.1654128	National Lab	1) Argonne National Laboratory, Argonne, IL	No	Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee.
ACM Transactions on Mathematical Software (TOMS): Volume 9 Issue 4, Dec. 1983	Dec-83	Algorithm 609: A Portable FORTRAN Subroutine for the Bickley Functions Kin (x)	D. E. Amos	Sandia National Laboratories, Albuquerque, NM	1983 ACM 0098-3500/83/1200-0480 $00.00	10.1145/356056.356064	National Lab	Author's address: Sandia National Laboratories, Albuquerque, NM 87185.	No	This work, performed at Sandia National Laboratories, was supported by the U.S. Department of Energy under Contract DE-AC04-76DP00789.
JCDL '16: Proceedings of the 16th ACM/IEEE-CS on Joint Conference on Digital Libraries	Jun-16	Routing Memento Requests Using Binary Classifiers	1) Nicolas J. Bornand, Lyudmila Balakireva, Herbert Van de Sompel	1) Los Alamos National Laboratory, Los Alamos, NM, USA	(c) 2016 Copyright held by the owner/author(s). Publication rights licensed to ACM.	10.1145/2910896.2910899	National Lab	1) Los Alamos National Laboratory, Los Alamos, NM, USA	No	Publication rights licensed to ACM. ACM acknowledges that this contribution was authored or co-authored by an employee, contractor or affiliate of the United States government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only. This work is supported in part by the International Internet Preservation Consortium (IIPC). Ilya Kreymer provided the oldweb.today dataset. Shawn Jones, Martin Klein, and Harihar Shankar provided comments to a draft paper.
RACS '14: Proceedings of the 2014 Conference on Research in Adaptive and Convergent Systems	Oct-14	On statistical modeling and forecasting of energy usage in smart grid	1) Wei Yu, Guobin Xu; 2) Dou An, Qingyu Yang; 3) David Griffith	1) Towson Univ., Towson, MD; 2) Xi'an Jiaotong Univ., Xi'an, Shaanxi, China; 3) National Institute of Standards and Technology, Gaithersburg, MD	Copyright 2014 ACM 978-1-4503-3060-2/14/10 ...$15.00	10.1145/2663761.2663768	Employee	3) National Institute of Standards and Technology, Gaithersburg, MD	No	Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee.
ACM Transactions on Modeling and Computer Simulation (TOMACS): Volume 19 Issue 3, June 2009	Jun-09	The optimizing-simulator: An illustration using the military airlift problem	1) Tongqiang Tony Wu, Warren B. Powell; 2) Alan Whisman	1) Princeton University, Princeton, NJ; 2) Air Mobility Command Retired, Scott Air Force Base, IL	© 2009 ACM 1049-3301/2009/06-ART14 $10.00	10.1145/1540530.1540535	Unsure	2) Air Mobility Command Retired, Scott Air Force Base, IL	No	This research was supported in part by grant AFOSR contract FA9550-08-1-0195. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies show this notice on the first page or initial screen of a display along with the full citation. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works requires prior specific permission and/or a fee. Permissions may be requested from Publications Dept., ACM, Inc., 2 Penn Plaza, Suite 701, New York, NY 10121-0701 USA, fax +1 (212) 869-0481, or permissions@acm.org
ESEC/FSE 2015: Proceedings of the 2015 10th Joint Meeting on Foundations of Software Engineering	Aug-15	Iterative distribution-aware sampling for probabilistic symbolic execution	1) Mateus Borges; 2) Antonio Filieri; 3) Marcelo D'Amorim; 4) Corina S. Păsăreanu	1) University of Stuttgart, Germany / Federal University of Pernambuco, Brazil; 2) University of Stuttgart, Germany; 3) Federal University of Pernambuco, Brazil; 4) Carnegie Mellon University, USA / NASA Ames Research Center, USA	Copyright is held by the owner/author(s). Publication rights licensed to ACM.	10.1145/2786805.2786832	Unsure	4) Carnegie Mellon University, USA / NASA Ames Research Center, USA	No	Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Permissions@acm.org. This work is supported by NSF Awards CCF-1329278 and CCF-1319858 (Pasareanu). Mateus Borges is supported by FACEPE ˘ fellowship number IBPG-0668-1.03/12.
ACM Transactions on Mathematical Software (TOMS): Volume 26 Issue 3, Sept. 2000	Sep-00	Algorithm 805: computation and uses of the semidiscrete matrix decomposition	1) Tamara G. Kolda; 2) Dianne P. O'Leary	1) Sandia National Laboratories, Livermore, CA; 2) Univ. of Maryland, College Park, MD	© 2001 ACM 0098-3500/00/0900–0415 $5.00	10.1145/358407.358424	National Lab	1) Sandia National Laboratories, Livermore, CA;	No	Kolda’s work was performed while she was a postdoctoral fellow at Oak Ridge National Laboratory and was supported through the Applied Mathematical Sciences Research Program, Office of Energy Research, U.S. Department of Energy, under contract DE-AC05-96OR22464 with Lockheed Martin Energy Research Corporation. O’Leary’s work was supported by the National Science Foundation under Grant CCR-97-32022 and by the Department Informatik, ETH Zürich, Switzerland. An earlier version of this paper appeared as University of Maryland Technical Report CS-TR-4012/UMIACS-TR-99-22 (April 1999) and Oak Ridge National Laboratory Technical Memorandum ORNL-13766 (April, 1999). Permission to make digital/hard copy of part or all of this work for personal or classroom use is granted without fee provided that the copies are not made or distributed for profit or commercial advantage, the copyright notice, the title of the publication, and its date appear, and notice is given that copying is by permission of the ACM, Inc. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee.
ASONAM '15: Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2015	Aug-15	Identification and characterization of cyberbullying dynamics in an online social network	1) A. Squicciarini; 2) S. Rajtmajer; 3) Y. Liu; 4) C. Griffin	1) College of Information Sciences and Technology, Pennsylvania State University, State College, PA 16802; 2) Department of Mathematics, Pennsylvania State University, State College, PA 16802; 3) College of Information Sciences and Technology, Pennsylvania State University, State College, PA 16802; 4) Department of Mathematics, United States Naval Academy, Annapolis, MD 21402	© 2015 ACM. ISBN 978-1-4503-3854-7/15/08 $15.00	10.1145/2808797.2809398	Employee	4) Department of Mathematics, United States Naval Academy, Annapolis, MD 21402	No	Portions of Dr. Griffin’s, Dr. Rajtmajer’s and Dr. Squicciarini’s work were supported by the Army Research Office grant W911NF-13-1-0271. Portions of Dr. Griffins work were additionally supported by the Army Research Office grant W911NF-11-1-0487.
ACM Transactions on Database Systems (TODS): Volume 10 Issue 1, March 1985	Mar-85	Analysis of dynamic hashing with deferred splitting	Eugene Veklerov	Real Time Systems Group, Lawrence Berkeley Laboratory, University of California, Berkeley, CA	© 1985 ACM 0730-0301/85/0300-0090 $00.75	10.1145/3148.318987	National Lab	Real Time Systems Group, Lawrence Berkeley Laboratory, University of California, Berkeley, CA	No	Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Association for Computing Machinery. To copy otherwise, or to republish, requires a fee and/or specific permission.
ICSE '11: Proceedings of the 33rd International Conference on Software Engineering	May-11	Interface decomposition for service compositions	1) Domenico Bianculli; 2) Dimitra Giannakopoulou, Corina S. Păsăreanu	1) University of Lugano, Lugano, Switzerland; 2) NASA Ames Research Center & Carnegie Mellon Silicon Valley, Moffett Field, CA, USA	Copyright 2011 ACM 978-1-4503-0445-0/11/05 ...$10.00.	10.1145/1985793.1985862	Unsure	2) NASA Ames Research Center & Carnegie Mellon Silicon Valley, Moffett Field, CA, USA	No	Copyright 2011 Association for Computing Machinery. ACM acknowledges that this contribution was authored or co-authored by a contractor or affiliate of the U.S. Government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only.
Communications of the ACM: Volume 11 Issue 5, May 1968	May-68	Considerations in the design of a multiple computer system with extended core storage	Kurt Fuchel	Brookhaven National Lab, Upton, NY	N/A	10.1145/363095.363142	National Lab	Brookhaven National Lab, Upton, NY	No	This work was performed under the auspices of the US Atomic Energy Commission.
Communications of the ACM: Volume 16 Issue 6, June 1973	Jun-73	Synchronizing processors with memory-content-generated interrupts	J. Carver Hill	Lawrence Livermore Laboratory/ University of California	Copyright © 1973, Association for Computing Machinery, Inc.	10.1145/362248.364641	National Lab	Lawrence Livermore Laboratory/ University of California	No	General permission to republish, but not for profit, all or part of this material is granted provided that ACM's copyright notice is given and that reference is made to the publication, to its date of issue, and to the fact that reprinting privileges were granted by permission of the Association for Computing Machinery. This work was performed under the auspices of the U.S. Atomic Energy Commission.
SC '11: State of the Practice Reports	Nov-11	Challenges of HPC monitoring	1) William (Bill) Allcock; 2) Evan Felix; 3) Mike Lowe; 4) Randal Rheinheimer; 5) Joshi Fullop	1) Argonne National Laboratory; 2) Pacific Northwest National Laboratory; 3) Indiana University; 4) Los Alamos National Laboratory; 5) National Center for Supercomputing Applications	Copyright is held by the author/owner(s)	10.1145/2063348.2063378	National Lab	1) Argonne National Laboratory; 2) Pacific Northwest National Laboratory; 4) Los Alamos National Laboratory;	No	N/A
ACM Transactions on Programming Languages and Systems (TOPLAS): Volume 37 Issue 1, January 2015	Jan-15	Interval Analysis and Machine Arithmetic: Why Signedness Ignorance Is Bliss	1) Jorge A. Navas; 2) Graeme Gange, Peter Schachte, Harald Søndergaard, Peter J. Stuckey	1) NASA Ames Research Center, Moffett Field, CA 94035; 2) The University of Melbourne, Australia	2015 Copyright is held by the owner/author(s). Publication rights licensed to ACM.	10.1145/2651360	Employee	Authors’ addresses: J. A. Navas, NASA Ames Research Center, Moffett Field, CA 94035; email: jorge.a.navaslaserna@nasa.gov;	No	This work is supported by the Australian Research Council, under ARC grant DP110102579. Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from permissions@acm.org.
GECCO '12: Proceedings of the 14th annual conference on Genetic and evolutionary computation	Jul-12	Accelerating human-computer collaborative search through learning comparative and predictive user models	1) Gregory S. Hornby; 2) Josh C. Bongard	1) University of California Santa Cruz/ NASA Ames Research Center, MS 269-3, Moffett Field, CA USA; 2) Department of Computer Science, University of Vermont, Burlington, VT USA	Copyright 2012 ACM 978-1-4503-1177-9/12/07 ...$10.00.	10.1145/2330163.2330196	Unsure	1) University of California Santa Cruz/ NASA Ames Research Center, MS 269-3, Moffett Field, CA USA;	No	Copyright 2012 Association for Computing Machinery. ACM acknowledges that this contribution was authored or co-authored by an employee, contractor or affiliate of the U.S. Government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only. This research was supported in part by the NSF Creative-IT grant 0757532 and DARPA M3 grant W911NF-1-11-0076. In addition, thanks to Grace Lin for her work on an early prototype.
SC '13: Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis	Nov-13	Radiative signatures of the relativistic Kelvin-Helmholtz instability	1) M. Bussmann, H. Burau, T. E. Cowan, A. Debus, A. Huebl, T. Kluge,  R. Pausch, U. Schramm, R. Widera; 2) G. Juckeland, W. E. Nagel, F. Schmitt; 3) J. Schuchart	1) Helmholtz-Zentrum Dresden -- Rossendorf, Dresden, Germany; 2) Technische Universität, Dresden, Germany; 3) Oak Ridge National Lab, Oak Ridge, TN	Copyright is held by the owner/author(s).	10.1145/2503210.2504564	National Lab	3) Oak Ridge National Lab, Oak Ridge, TN	No	Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full cit ation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author. This research used resources of the Oak Ridge Leadership Computing Facility at the Oak Ridge National Laboratory, which is supported by the Office of Science of the U.S. Department of Energy under Contract No. DE-AC05-00OR22725.
PPoPP 2015: Proceedings of the 20th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming	Jan-15	Combining phase identification and statistic modeling for automated parallel benchmark generation	1) Ye Jin, Mingliang Liu, Xiaosong Ma; 2) Qing Liu, Jeremy Logan, Norbert Podhorszki, Jong Youl Choi, Scott Klasky	1) North Carolina State University, USA / Qatar Computing Research Institute, Qatar; 2) Oak Ridge National Laboratory, USA	Copyright is held by the author/owner(s).	10.1145/2688500.2688541	National Lab	2) Oak Ridge National Laboratory, USA	No	Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee.
ACM Transactions on Architecture and Code Optimization (TACO): Volume 7 Issue 2, September 2010	Sep-10	Thread-management techniques to maximize efficiency in multicore and simultaneous multithreaded microprocessors	1) R. Rakvic; 2) Q. Cai, J. González, G. Magklis, P. Chaparro, A. González	1) United States Naval Academy, Annapolis, MD; 2) Intel Labs-UPC, Barcelona, Spain	© 2010 ACM 1544-3566/2010/04-ART9 $10.00	10.1145/1839667.1839671	Employee	1) United States Naval Academy, Annapolis, MD;	No	(c) 2010 Association for Computing Machinery. ACM acknowledges that this contribution was authored or co-authored by a contractor or affiliate of the [U.S.] Government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies show this notice on the first page or initial screen of a display along with the full citation. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works requires prior specific permission and/or a fee. Permissions may be requested from Publications Dept., ACM, Inc., 2 Penn Plaza, Suite 701, New York, NY 10121-0701 USA, fax +1 (212) 869-0481, or permissions@acm.org.
ACM Transactions on Intelligent Systems and Technology (TIST): Volume 3 Issue 2, February 2012	Feb-12	Adversarial Geospatial Abduction Problems	1) Paulo Shakarian; 2) John P. Dickerson, V. S. Subrahmanian	1) United States Military Academy; 2) University of Maryland	© 2012 ACM 2157-6904/2012/02-ART34 $10.00	10.1145/2089094.2089110	Employee	Authors’ addresses: P. Shakarian (corresponding author), United States Military Academy, West Point, NY 10996; email: Paulo@shakarian.net;	No	Some of the authors of this article were funded in part by AFOSR grant FA95500610405 and ARO grants W911NF0910206 and W911NF0910525. c 2012 Association for Computing Machinery. ACM acknowledges that this contribution was authored or co-authored by a contractor or affiliate of the [U.S.] Government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies show this notice on the first page or initial screen of a display along with the full citation. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works requires prior specific permission and/or a fee. Permissions may be requested from the Publications Dept., ACM, Inc., 2 Penn Plaza, Suite 701, New York, NY 10121-0701, USA, fax +1 (212) 869-0481, or permissions@acm.org.
HRI '08: Proceedings of the 3rd ACM/IEEE international conference on Human robot interaction	Mar-08	Robotics operator performance in a military multi-tasking environment	1) Jessie Y.C. Chen; 2) Michael J Barnes	1) US Army Research Laboratory, Orlando, FL, USA; 2) US Army Research Laboratory, Ft. Huachuca, AZ, USA	Copyright 2008 ACM 978-1-60558-017-3/08/03...$5.00.	10.1145/1349822.1349859	Employee	1) US Army Research Laboratory, Orlando, FL, USA; 2) US Army Research Laboratory, Ft. Huachuca, AZ, USA	No	Copyright 2008 Association for Computing Machinery. ACM acknowledges that this contribution was authored or co-authored by an employee, contractor or affiliate of the U.S. Government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only. This project was funded by the U.S. Army’s Robotics Collaboration Army Technology Objective.
PPoPP '16: Proceedings of the 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming	Feb-16	OPR: deterministic group replay for one-sided communication	1) Xuehai Qian; 2) Koushik Sen; 3) Paul Hargrove, Costin Iancu	1) University of Southern California; 2) University of California, Berkeley; 3) Lawrence Berkeley National Laboratory	© 2016 ACM. ISBN 978-1-4503-4092-2/16/03…$15.00	10.1145/2851141.2851179	National Lab	3) Lawrence Berkeley National Laboratory	No	© 2016 Association for Computing Machinery. ACM acknowledges that this contribution was authored or co-author ed by an employee, contractor or affiliate of the United States government. As such, the United States Government retains a nonexclusive, royalty-free right to publish or repr o d uce this article, or to allow others to do so, f o r Government purposes only.
ACM Transactions on Mathematical Software (TOMS): Volume 8 Issue 1, March 1982	Mar-82	An Evaluation of Mathematical Software That Solves Systems of Nonlinear Equations	K. L. Hiebert	Numerical Mathematics Division 5642, Sandia National Laboratories, Albuquerque, NM	1982 ACM 0098-3500/82/0300-0005 $00.00	10.1145/355984.355986	National Lab	Numerical Mathematics Division 5642, Sandia National Laboratories, Albuquerque, NM	No	N/A
ACM Computing Surveys (CSUR): Volume 28 Issue 2, June 1996	Jun-96	On the systematic design of Web languages	1) Dennis Volpano; 2) Geoffrey Smith	1) Naval Postgraduate School, Monterey; 2) Florida International Univ., Miami	© 1996 ACM 0360-0300/96/0600–0315 $03.50	10.1145/234528.234737	Employee	1) Naval Postgraduate School, Monterey;	No	Permission to make digital/ hard copy of part or all of this work for personal or classroom use is granted without fee provided that the copies are not made or distributed for profit or commercial advantage, the copyright notice, the title of the publication, and its date appear, and notice is given that copying is by permission of the ACM, Inc. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/ or a fee.
ACM Transactions on Information Systems (TOIS): Volume 4 Issue 2, April 1986	Apr-86	Communications design for Co-oP: a group decision support system	1) Tung X. Bui; 2) Matthias Jarke	1) Naval Postgraduate School, Monterey, CA; 2) New York Univ., New York, NY	© 1986 ACM 0734-2047/86/0400-0081 $00.75	10.1145/6168.6169	Employee	Authors’ present addresses: T. X. Bui, Department of Administrative Sciences, Naval Postgraduate School, Monterey, CA 93943	No	Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Association for Computing Machinery. To copy otherwise, or to republish, requires a fee and/or specific permission.
Communications of the ACM - A Direct Path to Dependable Software: Volume 52 Issue 4, April 2009	Apr-09	Roofline: an insightful visual performance model for multicore architectures	1) Samuel Williams; 2) Andrew Waterman, David Patterson	1) Lawrence Berkeley National Laboratory, Berkeley, CA; 2) University of California, Berkeley	©2009 ACM 0001-0782/09/0400 $5.00	10.1145/1498765.1498785	National Lab	Samuel Williams (SWWilliams@lbl.gov) is a research scientist at Lawrence Berkeley National Laboratory, Berkeley, CA.	No	Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. The Digital Library is published by the Association for Computing Machinery. Copyright © 2009 ACM, Inc.
SC '07: Proceedings of the 2007 ACM/IEEE conference on Supercomputing	Nov-07	WRF nature run	1) John Michalakes, Josh Hacker, Richard Loft; 2) Michael O. McCracken, Allan Snavely, Nicholas J. Wright; 3) Tom Spelce, Brent Gorda; 4) Robert Walkup	1) University Corporation for Atmospheric Research (UCAR), Boulder, CO; 2) PMaC Laboratory San Diego Supercomputer Center, La Jolla, CA; 3) Lawrence Livermore National Laboratory, Livermore, CA; 4) IBM Thomas J. Watson Research Center, Yorktown Heights, NY	(c) 2007 ACM 978-1-59593-764-3/07/0011…$5.00	10.1145/1362622.1362701	National Lab	3) Lawrence Livermore National Laboratory, Livermore, CA;	No	(c) 2007 Association for Computing Machinery. ACM acknowledges that this contribution was authored or coauthored by a contractor or affiliate of the [U.S.] Government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only. This work was sponsored in part by the National Science Foundation via GEO ATM SGER award #0637994 “Feasibility of Taking the Weather Research and Forecasting (WRF) Model to Petascale”. The development of the tools and methods used for performance modeling were sponsored in part by the DOE Office of Science under the SciDAC2 award entitled “The Performance Engineering Research Institute” (PERI).
Communications of the ACM: Volume 53 Issue 9, September 2010	Sep-10	Discussing cyber attack	1) Peter J. Denning; 2) Dorothy E. Denning	1) Director of the Cebrowski Institute for information and innovation and superiority at the Naval Postgraduate School in Monterey, CA; 2) Distinguished Professor of Defense Analysis at the Naval Postgraduate School in Monterey, CA	Copyright held by author.	10.1145/1810891.1810904	Employee	Peter J. Denning (pjd@nps.edu) is Distinguished Professor of Computer Science and Director of the Cebrowski Institute for Innovation and Information Superiority at the Naval Postgraduate School in Monterey, CA and is a past president of ACM. Dorothy E. Denning (dedennin@nps.edu) is Distinguished Professor of Defense Analysis at the Naval Postgraduate School in Monterey, CA, and author of Information Warfare and Security	No	The Digital Library is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc.
SC '13: Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis	Nov-13	Optimization of cloud task processing with checkpoint-restart mechanism	1) Sheng Di; 2) Yves Robert; 3) Frédéric Vivien; 4) Derrick Kondo; 5) Cho-Li Wang; 6) Franck Cappello	1) Argonne National Laboratory and INRIA, Saclay, France; 2) ENS Lyon and INRIA, France and University of Tennessee Knoxville; 3) ENS Lyon and INRIA, France; 4) INRIA, Grenoble, France; 5) The University of Hong Kong, Hong Kong; 6) Argonne National Laboratory	Copyright 2013 ACM 978-1-4503-2378-9/13/11...$15.00.	10.1145/2503210.2503217	National Lab	6) Argonne National Laboratory	No	Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Permissions@acm.org. This work is supported by the projects ANR RESCUE 5323, Illinois-INRIA-ANL Joint Laboratory on Petascale Computing, and also in part by a Hong Kong RGC Grant HKU-716712E.
ACM Computing Surveys (CSUR): Volume 48 Issue 4, May 2016	May-16	A Survey of Architectural Techniques for Managing Process Variation	Sparsh Mittal	Oak Ridge National Laboratory, Tennessee, USA	(c) 2016 ACM 0360-0300/2016/02-ART54 $15.00	10.1145/2871167	National Lab	Author’s address: S. Mittal, 1 Bethel Valley Road, Future Technologies Group, Oak Ridge National Laboratory, Building 5100, MS-6173, Tennessee, USA 37830; email: mittals@ornl.gov.	No	Support for this work was provided by the U.S. Department of Energy, Office of Science, Advanced Scientific Computing Research. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies show this notice on the first page or initial screen of a display along with the full citation. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works requires prior specific permission and/or a fee. Permissions may be requested from Publications Dept., ACM, Inc., 2 Penn Plaza, Suite 701, New York, NY 10121-0701 USA, fax +1 (212)869-0481, or permissions@acm.org.
ACM Transactions on Mathematical Software (TOMS): Volume 34 Issue 2, March 2008	Mar-08	PyTrilinos: High-performance distributed-memory solvers for Python	1) Marzio Sala; 2) W. F. Spotz, M. A. Heroux	1) ETH Zurich; 2) Sandia National Laboratories, Albuquerque, NM	© 2008 ACM 0098-3500/2008/03-ART7 $5.00	10.1145/1326548.1326549	National Lab	Author’s address: Sandia National Laboratory, PO Box 5800 MS 0370, Albuquerque, NM 87185-0370; email: maherou@sandia.gov.	No	ASCI program and the DOE Office of Science MICS program at Sandia National Laboratory. Sandia is a multiprogram laboratory operated by Sandia Corporation, a Lockheed Martin Company, for the United States Department of Energy’s National Nuclear Security Administration under contract DE-AC04-94AL85000. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or direct commercial advantage and that copies show this notice on the first page or initial screen of a display along with the full citation. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works requires prior specific permission and/or a fee. Permissions may be requested from Publications Dept., ACM, Inc., 2 Penn Plaza, Suite 701, New York, NY 10121-0701 USA, fax +1 (212) 869-0481, or permissions@acm.org
FTXS '16: Proceedings of the ACM Workshop on Fault-Tolerance for HPC at Extreme Scale	May-16	Adding Fault Tolerance to NPB Benchmarks Using ULFM	1) Zachary W. Parchman, Stephen L. Scott; 2) Geoffroy R. Vallee, Thomas Naughton, Christian Engelmann, David Bernholdt	1) Tennessee Technological University, Cookeville, TN, USA; 2) Oak Ridge National Laboratory, Oak Ridge, TN, USA	© 2016 Copyright held by the owner/author(s). Publication rights licensed to ACM.	10.1145/2909428.2909434	National Lab	2) Oak Ridge National Laboratory, Oak Ridge, TN, USA	No	Publication rights licensed to ACM. ACM acknowledges that this contribution was authored or co-authored by an employee, contractor or affiliate of the United States government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only.
Supercomputing '91: Proceedings of the 1991 ACM/IEEE conference on Supercomputing	Aug-91	A performance comparison of three supercomputers: Fujitsu VP-2600, NEC SX-3, and CRAY Y-MP	1) Margaret L. Simmons, Harvey J. Wasserman, Olaf M. Lubeck; 2) Christopher Eoyang Eoyang, Raul Mendez; 3) Hirro Harada, Misako Ishiguro	1) Computing and Communications Division, Los Alamos National Laboratory, Los Alamos, New Mexico; 2) Institute for Supercomputing Research, 1-13-1 Kachidoki, Chuo-ku, Tokyo 104, Japan; 3) Japan Atomic Energy Research Institute, Tokai-Mura, Maka-Gun, Ibaraki, 319-11, Japan	© 1991 ACM 0-89791-459-7/91/0150 $01.50	10.1145/125826.125924	National Lab	1) Computing and Communications Division, Los Alamos National Laboratory, Los Alamos, New Mexico;	No	N/A
SC '07: Proceedings of the 2007 ACM/IEEE conference on Supercomputing	Nov-07	Noncontiguous locking techniques for parallel file systems	1) Avery Ching, Wei-keng Liao, Alok Choudhary; 2) Robert Ross; 3) Lee Ward	1) Northwestern University, Evanston, Illinois; 2) Argonne National Laboratory, Argonne, IL; 3) Sandia National Laboratories, Albuquerque, NM	Copyright 2007 ACM 978-1-59593-764-3/07/0011 ...$5.00.	10.1145/1362622.1362658	National Lab	2) Argonne National Laboratory, Argonne, IL; 3) Sandia National Laboratories, Albuquerque, NM	No	(c) 2007 Association for Computing Machinery. ACM acknowledges that this contribution was authored or co-authored by a contractor or affiliate of the U.S. Government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only. This work was supported in part by DOE’s SCiDAC program (Scientific Data Management Center) under award number DE-FC02-07ER25808, the Mathematical, Information, and Computational Sciences Division subprogram of the Office of Advanced Scientific Computing Research, Office of Science, U.S. Dept. of Energy, under Contract DE-AC02-06CH11357, the NSF/DARPA ST-HEC program under grant CCF-0444405, NSF HECURA CCF-0621443, the NSF NGS program under grant CNS-0406341, and the DOE HPCSF program
Communications of the ACM: Volume 19 Issue 11, Nov. 1976	Nov-76	Cobol under control	1) Henry F. Ledgard; 2) William C. Cave	1) Univ. of Massachusetts, Amherst; 2) U.S. Army Electronics Command, Fort Monmouth, NJ	Copyright © 1976, Association for Computing Machinery, Inc.	10.1145/360363.360366	Employee	Authors' addresses: William C. Cave, Center for Tactical Computer Science, U.S. Army Electronics Command, Fort Monmouth, NJ 07703.	No	General permission to republish, but not for profit, all or part of this material is granted provided that ACM's copyright notice is given and that reference is made to the publication, to its date of issue, and to the fact that reprinting privileges were granted by permission of the Association for Computing Machinery. The work reported herein was in part sponsored by the U.S. Army Electronics Command, Fort Monmouth, New Jersey.
ACM Transactions on Software Engineering and Methodology (TOSEM): Volume 24 Issue 1, September 2014	Sep-14	Directed Incremental Symbolic Execution	1) Guowei Yang; 2) Suzette Person; 3) Neha Rungta; 4) Sarfraz Khurshid	1) Texas State University, San Marcos, TX; 2) NASA Langley Research Center, Hampton, VA; 3) NASA Ames Research Center, Moffett Field, CA; 4) University of Texas at Austin, Austin, TX	© 2014 ACM 1049-331X/2014/09-ART3 $15.00	10.1145/2629536	Employee	Authors’ addresses: S. Person, NASA Langley Research Center, Hampton, VA 23681; N. Rungta, NASA Ames Research Center, Moffett Field, CA 94035;	No	The work of G. Yang and S. Khurshid was supported in part by the NSF under Grant Nos. IIS-0438967, CCF-0845628, CCF-1319688, and CNS-0958231, and AFOSR grant FA9550-09-1-0351. (c) 2014 Association for Computing Machinery. ACM acknowledges that this contribution was authored or co-authored by an employee, contractor or affiliate of the national government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only.
Communications of the ACM: Volume 15 Issue 8, Aug. 1972	Aug-72	Compiling fixed-point multiplications	Herbert J. Bernstein	Brookhaven National Lab, Upton, NY	Copyright © 1972, Association for Computing Machinery, Inc.	10.1145/361532.361556	National Lab	Author's address: Brookhaven National Laboratory, Upton, N.Y. 11973.	No	General permission to republish, but not for profit, all or part of this material is granted, provided that reference is made to this publication, to its date of issue, and to the fact that reprinting privileges were granted by permissioa of the Association for Computing Machinery
ACM Transactions on Computer Systems (TOCS): Volume 7 Issue 1, Feb. 1989	Feb-89	Reliable scheduling in a TMR database system	1) Frank M. Pittelli; 2) Hector Garcia-Molina	1) U.S. Naval Academy, Annapolis, MD; 2) Princeton Univ., Princeton, NJ	© 1989 ACM 0734-2071/89/0200-0025 $01.50	10.1145/58564.59294	Employee	1) U.S. Naval Academy, Annapolis, MD;	No	Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Association for Computing Machinery. To copy otherwise, or to republish, requires a fee and/or specific permission.
MobiHoc '16: Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing	Jul-16	Understanding the Impact of Limited Channel State Information on Massive MIMO Network Performances∗	1) Jia Liu, Atilla Eryilmaz, Ness B. Shroff; 2) Elizabeth S. Bentley	1) The Ohio State University; 2) Air Force Research Laboratory, Information Directorate	© 2016 ACM. ISBN 978-1-4503-4184-4/16/07. . . $15.00	10.1145/2942358.2942392	Employee	2) Air Force Research Laboratory, Information Directorate	No	This work is supported by NSF grants CNS 1527078, 1446582,1314538, 1518829, 1421576, WiFiUS 1456806, CMMI 1562065, ECCS1444026; ONR grant N00014-15-1-2166; ARO grant W911NF-14-1-0368; DTRA grants HDTRA 1-14-1-0058, 1-15-1-0003, AFRL VFRP award; DARPA grant HROOll-15-C-0097, and QNRF grant NPRP 7- 923-2-344. DISTRIBUTION STATEMENT A: Approved for Public Release; distribution unlimited 88ABW-2016-0193 20 Jan. 2016. ACM acknowledges that this contribution was authored or co-authored by an employee, or contractor of the national government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only. Permission to make digital or hard copies for personal or classroom use is granted. Copies must bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. To copy otherwise, distribute, republish, or post, requires prior specific permission and/or a fee. Request permissions from permissions@acm.org.
ACM Transactions on Mathematical Software (TOMS): Volume 11 Issue 2, June 1985	Jun-85	Algorithm 633: An algorithm for linear dependency analysis of multivariate data	1) R. C. Ward; 2) G. J. Davis; 3) V. E. Kane	1) Mathematics and Statistics Research Section, Oak Ridge National Laboratory, P.O. Box Y, Building 9207A, Oak Ridge, Tennessee; 2) Department of Mathematics and Computer Science, Georgia State University, Atlanta, Georgia; 3) Ford Motor Company, P.O. Box 1517A, NAAO Building, Dearborn, Michigan	© 1985 ACM 009%3500/85/0600-0170 $00.75	10.1145/214392.214403	National Lab	1) Mathematics and Statistics Research Section, Oak Ridge National Laboratory, P.O. Box Y, Building 9207A, Oak Ridge, Tennessee;	No	This research was sponsored by the Applied Mathematical Sciences subprogram of the Office of Energy Research, U.S. Department of Energy under contract DE-AC05-840R21400 with Martin Marietta Energy Systems, Inc.
ACM Transactions on Graphics (TOG) - Proceedings of ACM SIGGRAPH Asia 2008: Volume 27 Issue 5, December 2008	Dec-08	Quadrilateral mesh simplification	1) Joel Daniels, Cláudio T. Silva, Elaine Cohen; 2) Jason Shepherd	1) University of Utah; 2) Sandia National Laboratories	© 2008 ACM 0730-0301/2008/05-ART148 $5.00	10.1145/1409060.1409101	National Lab	2) Sandia National Laboratories	No	Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profi t or direct commercial advantage and that copies show this notice on the fi rst page or initial screen of a display along with the full citation. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works requires prior specifi c permission and/or a fee. Permissions may be requested from Publications Dept., ACM, Inc., 2 Penn Plaza, Suite 701, New York, NY 10121-0701, fax +1 (212) 869-0481, or permissions@acm.org
SC '97: Proceedings of the 1997 ACM/IEEE conference on Supercomputing	Nov-97	Numerical Tokamak Turbulence calculations on the CRAY T3E	1) V. E. Lynch, J-N. Leboeuf, B. A. Carreras; 2) J. D. Alvarez, L. Garcia	1) Oak Ridge National Laboratory, Oak Ridge, TN; 2) Universidad Carlos III de Madrid, c/ Butarque, 15. Leganes, 28911 Madrid Spain	(c) 1997 ACM 0-89791-985-8/97/0011 $3.50	10.1145/509593.509635	National Lab	1) Oak Ridge National Laboratory, Oak Ridge, TN;	No	Permission to make digital/hard copy of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage, the copyright notice, the title of the publication and its date appear, and notice is given that copying is by permission of ACM, Inc. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee.
ETRA '16: Proceedings of the Ninth Biennial ACM Symposium on Eye Tracking Research & Applications	Mar-16	Design and validation of a simple eye-tracking system	1) Dorion B. Liston, Lily R. Wong; 2) Sol Simpson; 3) Mark Rich; 4) Leland S. Stone	1) NASA Ames Research Center and San José State University; 2) iSolverSolutions; 3) New York University; 4) NASA Ames Research Center	© 2016 ACM. ISBN 978-1-4503-4125-7/16/03…$15.00	10.1145/2857491.2857534	Employee	4) NASA Ames Research Center	No	© 2016 Association for Computing Machinery. ACM acknowledges that this contribution was authored or co-authored by an employee, contractor or affiliate of the United States government. As such, the United States Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only. We thank the Office of Naval Research Force Health Protection program (N0001415IP00028/30) for funding.
GECCO '16: Proceedings of the Genetic and Evolutionary Computation Conference 2016	Jul-16	Multiobjective Neuroevolutionary Control for a Fuel Cell Turbine Hybrid Energy System	1) Mitchell Colby, Kagan Tumer; 2) Logan Yliniemi; 3) David Tucker; 4) Kenneth "Mark" Bryden, Paolo Pezzini	1) Oregon State University, Corvallis, OR, USA; 2) University of Nevada, Reno, Reno, NV, USA; 3) National Energy Technology Laboratories, Morgantown, WV, USA; 4) Ames National Laboratory, Ames, IA, USA	(c) 2016 ACM. ISBN 978-1-4503-4206-3/16/07. . . $15.00	10.1145/2908812.2908924	National Lab	4) Ames National Laboratory, Ames, IA, USA	No	Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from permissions@acm.org. This research was supported in part by the US Department of Energy - Office of Fossil Energy under Contract No. DE-AC02-07CH11358 through the Ames Laboratory. It was also supported in part by the US Department of Energy National Energy Technology Laboratory under Contract No. DE-FE0012302.
Communications of the ACM: Volume 57 Issue 10, October 2014	Oct-14	Reading news with maps by exploiting spatial synonyms	1) Hanan Samet, Benjamin E. Teitler, Marco D. Adelfio, Jack M. Lotkowski; 2) Jagan Sankaranarayanan; 3) Michael D. Lieberman; 4) Brendan C. Fruin; 5) Daniele Panozzo; 6) Jon Sperling	1) University of Maryland, College Park, MD; 2) NEC Labs, Cupertino, CA; 3) Johns Hopkins University Applied Physics Laboratory, Laurel, MD; 4) Zillow, Seattle, WA; 5) ETH, Zürich, Switzerland; 6) U.S. Department of Housing and Urban Development, Washington, D.C.	©2014 ACM 0001-0782/14/10	10.1145/2629572	Employee	Jon Sperling (jonxsperling@gmail.com) is a senior researcher in the Office of Policy Development and Research of the U.S. Department of Housing and Urban Development, Washington, D.C	No	Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and full citation on the first page. Copyright for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or fee. Request permission to publish from permissions@acm.org or fax (212) 869-0481. The Digital Library is published by the Association for Computing Machinery. Copyright © 2014 ACM, Inc.
ACM Transactions on Mathematical Software (TOMS): Volume 15 Issue 3, Sept. 1989	Sep-89	Algorithm 675: Fortran subroutines for computing the square root covariance filter and square root information filter in dense or Hessenberg forms	1) M. Vanbegin; 2) M. Verhaegen	1) Philips Research Lab., Brussels, Belgium; 2) NASA Ames, Moffett Field, CA	© 1989 ACM 009%3500/89/0900-0243 $01.50	10.1145/66888.69647	Employee	Authors’ addresses: M. Verhaegen, NASA Ames, Moffett Field, CA 94035.	No	Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Association for Computing Machinery. To copy otherwise, or to republish, requires a fee and/or specific permission.
SC '01: Proceedings of the 2001 ACM/IEEE conference on Supercomputing	Nov-01	High-performance remote access to climate simulation data: a challenge problem for data grid technologies	1) Bill Allcock, Ian Foster, Veronika Nefedova; 2) Ann Chervenak, Ewa Deelman, Carl Kesselman; 3) Jason Lee, Alex Sim, Arie Shoshani; 4) Bob Drach, Dean Williams	1) Argonne National Laboratory; 2) University of Southern California; 3) Lawrence Berkeley National Laboratory; 4) Lawrence Livermore National Laboratory	(c) 2001 ACM 1-58113-293-X/01/0011 $5.00	10.1145/582034.582080	National Lab	1) Argonne National Laboratory; 3) Lawrence Berkeley National Laboratory; 4) Lawrence Livermore National Laboratory	No	Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage, and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. This research was supported by the Mathematical, Information, and Computational Sciences Division subprogram of the Office of Advanced Scientific Computing Research, U.S. Department of Energy, under Contract W-31-109-Eng-38. This work was also supported by the Director, Office of Laboratory Policy and Infrastructure Management of the U. S. Department of Energy under Contract No. DE-AC03- 76SF00098. This research used resources of the National Energy Research Scientific Computing (NERSC), which is supported by the Office of Science of the U. S. Department of Energy. This work was also performed under the auspices of the U.S. Department of Energy by the University of California at Lawrence Livermore National Laboratory under Contract No. W-7405-Eng-48.
Supercomputing '91: Proceedings of the 1991 ACM/IEEE conference on Supercomputing	Aug-91	The auditorialization of scientific information	1) Robert S. Hotchkiss; 2) Cheryl L. Wampler	1) Computational Physics, Los Alamos National Laboratory; 2) User Services, Los Alamos National Laboratory	© 1991 ACM 0-89791-459-7/91/0453$01.50	10.1145/125826.126064	National Lab	1) Computational Physics, Los Alamos National Laboratory; 2) User Services, Los Alamos National Laboratory	No	N/A
ACM Transactions on Autonomous and Adaptive Systems (TAAS): Volume 2 Issue 3, September 2007	Sep-07	Network intrusion detection through Adaptive Sub-Eigenspace Modeling in multiagent systems	1) Mei-Ling Shyu, Thiago Quirino, Zongxing Xie; 2) Shu-Ching Chen; 3) Liwu Chang	1) University of Miami, Coral Gables, FL; 2) Florida International University, Miami, FL; 3) Naval Research Laboratory, Washington, DC	© 2007 ACM 1556-4665/2007/09-ART9 $5.00	10.1145/1278460.1278463	Employee	3) Naval Research Laboratory, Washington, DC	No	This article is based on the paper “A Distributed Agent-Based Approach to Intrusion Detection Using the Lightweight PCC Anomaly Detection Classifier” by Zongxing Xie, Thiago Quirino, MeiLing Shyu, Shu-Ching Chen, and Liwu Chang, which appears in the Proceedings of the IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing, 446–453. (c) 2006 IEEE. For Mei-Ling Shyu, this research was supported in part by NSF ITR (Medium) IIS-0325260. For Shu-Ching Chen, this research was supported in part by NSF EIA-0220562 and NSF HRD-0317692. (c) 2005 Association for Computing Machinery. ACM acknowledges that this contribution was authored or co-authored by a contractor or affiliate of the [U.S.] Government. As such, the Government retains a non-exclusive royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or direct commercial advantage and that copies show this notice on the first page or initial screen of a display along with the full citation. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works requires prior specific permission and/or a fee. Permissions may be requested from Publications Dept., ACM, Inc., 2 Penn Plaza, Suite 701, New York, NY 10121-0701 USA, fax +1 (212) 869-0481, or permissions@acm.org.
SC '15: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis	Nov-15	Recovering logical structure from Charm++ event traces	1) Katherine E. Isaacs; 2) Jonathan Lifflander; 3) Abhinav Bhatele, David Böhme, Todd Gamblin, Peer-Timo Bremer Martin Schulz; 4) Bernd Hamann	1) University of California, Davis, CA and Lawrence Livermore National Laboratory, Livermore, CA; 2) University of Illinois at Urbana-Champaign, Urbana, IL; 3) Lawrence Livermore National Laboratory, Livermore, CA; 4) University of California, Davis, CA	© 2015 ACM. ISBN 978-1-4503-3723-6/15/11. . . $15.00	10.1145/2807591.2807634	National Lab	3) Lawrence Livermore National Laboratory, Livermore, CA;	No	Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from permissions@acm.org.
ACM Transactions on Database Systems (TODS): Volume 17 Issue 3, Sept. 1992	Sep-92	Representing extended entity-relationship structures in relational databases: a modular approach	1) Victor M. Markowitz, Arie Shoshani	1) Lawrence Berkeley Lab, Berkeley, CA	© 1992 ACM 0362-5915/92/0900-0423 $01.50	10.1145/132271.132273	National Lab	Authors’ address: Information and Computing Sciences Division, Lawrence Berkeley Laboratory, Berkeley, CA 94720.	No	This work was supported by the Applied Mathematical Sciences Research Program and the OffIce of Health and Environmental Research Program, of the OffIce of Energy Research, U.S. Department of Energy, under contract DE-AC03-76SFOO098. Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Association for Computing Machinery. To copy otherwise, or to republish, requires a fee and/or specific permission.
Communications of the ACM: Volume 58 Issue 9, September 2015	Sep-15	Automated education and the professional	Peter J. Denning	director of the Cebrowski Institute for information and innovation and superiority at the Naval Postgraduate School in Monterey, CA, and is a past president of ACM.	Copyright held by author.	10.1145/2804248	Employee	Peter J. Denning (pjd@nps.edu) is Distinguished Professor of Computer Science and Director of the Cebrowski Institute for information innovation at the Naval Postgraduate School in Monterey, CA, is Editor of ACM Ubiquity, and is a past president of ACM.	No	The Digital Library is published by the Association for Computing Machinery. Copyright © 2015 ACM, Inc.
WSC '97: Proceedings of the 29th conference on Winter simulation	Dec-97	How common random numbers affect multinomial selection	1) J. O. Miller, Kenneth W. Bauer, Jr.	1) Department of Operational Sciences, Air Force Institute of Technology, Wright-Patterson AFB, OH	N/A	10.1145/268437.268503	Employee	J.O. MILLER is a Lieutenant Colonel in the C’nited States Air Force and an Assistant Professor in the Department of Operational Sciences at the Air Force Institute of Technology. His research interests include simulation, nonparametric statistics, and ranking and selection. KENNETH W. BAUER. JR. is a retired United States Air Force Lieutenant Colonel and a Professor in the Department of Operational Sciences at the Air Force Institute of Technology. His research interests include the statistical aspects of neural networks and simulation modeling.	No	N/A
Communications of the ACM: Volume 26 Issue 5, May 1983	May-83	DOCUMENTS: an interactive online solution to four documentation problems	1) T. R. Girill, Clement H. Lulc	1) Lawrence Livermore National Lab, Livermore, CA	© 1983/ACM 0001-0782/83/0500-328 75¢.	10.1145/69586.358104	National Lab	Authors' Present Address: T. R. Girill and Clement H. Luk, National Magnetic Fusion Energy Computer Center, Lawrence Livermore National Laboratory, P.O. Box 5509, L-560, Livermore, CA 94550	No	This work was performed under the auspices of the U.S. Department of Energy by Lawrence Livermore National Laboratory under Contract No. W-7405-ENG-48. Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Association for Computing Machinery. To copy otherwise, or to republish, requires a fee and/or specific permission
ACM Transactions on Mathematical Software (TOMS): Volume 27 Issue 4, December 2001	Dec-01	Analysis and comparison of two general sparse solvers for distributed memory computers	1) Patrick R. Amestoy; 2) Iain S. Duff; 3) Jean-Yves L'excellent; 4) Xiaoye S. Li	1) ENSEEIHT-IRIT; 2) CERFACS and Rutherford Appleton Laboratoy; 3) ENSEEIHT-IRIT and LIP-ENS Lyon; 4) NERSC-Lawrence Berkeley National Laboratory	© 2001 ACM 0098-3500/01/1200–0388 $5.00	10.1145/504210.504212	National Lab	Authors' Addresses: X. S. Li, NERSC, Lawrence Berkeley National Lab, MS 50F, 1 Cyclotron Rd., Berkeley, CA 94720; email: xiaoye@nersc.gov.	No	This work was supported by the France-Berkeley Fund and the National Energy Research Scientific Computing Center (NERSC) which is supported by the Director, Office of Advanced Scientific Computing Research, Division of Mathematical, Information, and Computational Sciences of the U.S. Department of Energy under contract number DE-AC03-76SF00098. Most of this work was done while P. R. Amestoy was visiting NERSC. The work of I. S. Duff was supported in part by the EPSRC Grant GR/M78502. The research of X. S. Li was supported in part by the National Science Foundation Cooperative Agreement No. ACI-9619020 and NSF Grant No. ACI-9813362. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or direct commercial advantage and that copies show this notice on the first page or initial screen of a display along with the full citation. Copyrights for components of this worked owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works requires prior specific permission and/or a fee. Permissions may be requested from Publications Dept., ACM, Inc., 1515 Broadway, New York, NY 10036 USA, fax +1 (212) 869-0481, or permissions@acm.org
ACM Transactions on Graphics (TOG): Volume 31 Issue 2, April 2012	Apr-12	Bilinear spatiotemporal basis models	1) Ijaz Akhter; 2) Tomas Simon; 3) Sohaib Khan; 4) Iain Matthews; 5) Yaser Sheikh	1) LUMS School of Science and Engineering and Disney Research Pittsburgh, PA; 2) Carnegie Mellon University and Disney Research Pittsburgh, PA; 3) LUMS School of Science and Engineering, Lahore, Pakistan; 4) Disney Research Pittsburgh and Carnegie Mellon University, PA; 5) Carnegie Mellon University	(c) 2012 ACM 0730-0301/2012/04-ART17 $10.00	10.1145/2159516.2159523	Not Govt	No government agencies appear in the author affiliations	No	N/A
SC '09: Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis	Nov-09	Terascale data organization for discovering multivariate climatic trends	1) Wesley Kendall, Markus Glatter, Jian Huang; 2) Tom Peterka, Robert Latham, Robert Ross	1) The University of Tennessee, Knoxville, TN; 2) Argonne National Laboratory, Argonne, IL	Copyright 2009 ACM 978-1-60558-744-8/09/11 ...$10.00.	10.1145/1654059.1654075	National Lab	2) Argonne National Laboratory, Argonne, IL	No	Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Funding for this work is primarily through the Institute of Ultra-Scale Visualization (http://www.ultravis.org) under the auspices of the SciDAC program within the U.S. Department of Energy (DOE). Important components of the overall system were developed while supported in part by a DOE Early Career PI grant awarded to Jian Huang (No. DEFG02-04ER25610) and by NSF grants CNS-0437508 and ACI-0329323. The MODIS dataset was provided by NASA (http://modis.gsfc.nasa.gov). This research used resources of the National Center for Computational Science (NCCS) at Oak Ridge National Laboratory (ORNL), which is managed by UT-Battelle, LLC, for DOE under Contract No. DE-AC05-00OR22725.
Communications of the ACM: Volume 15 Issue 9, Sept. 1972	Sep-72	A comparison of floating point summation methods	James Gregory	Argonne National Lab, Argonne, IL	N/A	10.1145/361573.361584	National Lab	Argonne National Lab, Argonne, IL	No	N/A
SC '03: Proceedings of the 2003 ACM/IEEE conference on Supercomputing	Nov-03	Early Evaluation of the Cray X1	1) T. H. Dunigan, Jr., M. R. Fahey, J. B. White III, P. H. Worley	1) Oak Ridge National Laboratory, TN	1-58113-695-1/03 $ 17.00 © 2003 ACM	10.1145/1048935.1050169	National Lab	1) Oak Ridge National Laboratory, TN	No	This research was sponsored by the Office of Mathematical, Information, and Computational Sciences, Office of Science, U.S. Department of Energy under Contract No. DE-AC05-00OR22725 with UT-Batelle, LLC. Accordingly, the U.S. Government retains a nonexclusive, royalty-free license to publish or reproduce the published form of this contribution, or allow others to do so, for U.S. Government purposes.
ACM Transactions on Design Automation of Electronic Systems (TODAES): Volume 18 Issue 2, March 2013	Mar-13	Achieving autonomous power management using reinforcement learning	1) Hao Shen, Qinru Qiu; 2) Ying Tan, Jun Lu; 3) Qing Wu	1) Syracuse University; 2) Binghamton University; 3) Air Force Research Laboratory	© 2013 ACM 1084-4309/2013/03-ART24 $15.00	10.1145/2442087.2442095	Employee	3) Air Force Research Laboratory	No	This work is supported in part by NSF under grant CNS-0845947. © 2013 Association for Computing Machinery. ACM acknowledges that this contribution was authored or coauthored by a contractor or affiliate of the U.S. Government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies show this notice on the first page or initial screen of a display along with the full citation. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works requires prior specific permission and/or a fee. Permissions may be requested from Publications Dept., ACM, Inc., 2 Penn Plaza, Suite 701, New York, NY 10121-0701 USA, fax +1 (212)869-0481, or permissions@acm.org.
EuroMPI 2016: Proceedings of the 23rd European MPI Users' Group Meeting	Sep-16	Runtime Correctness Analysis of MPI-3 Nonblocking Collectives	1) Tobias Hilbrich, Matthias Weber, Wolfgang E. Nagel; 2) Joachim Protze; 3) Bronis R. de Supinski,	1) Technische Universität, Dresden, Dresden, Germany; 2) RWTH Aachen University, JARA--High-Performance, Computing, Aachen, Germany; 3) Lawrence Livermore National, Laboratory, Livermore, CA	© 2016 ACM. ISBN 978-1-4503-4234-6/16/09. . . $15.00	10.1145/2966884.2966906	National Lab	3) Lawrence Livermore National, Laboratory, Livermore, CA	No	Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from permissions@acm.org. We thank the ASC Tri-Labs and the Los Alamos National Laboratory for their friendly support. Part of this work was performed under the auspices of the U.S. Department of Energy by Lawrence Livermore National Laboratory under Contract DE-AC52-07NA27344. (LLNL-CONF-696677).
Journal of the ACM (JACM): Volume 60 Issue 5, October 2013	Oct-13	From sylvester-gallai configurations to rank bounds: Improved blackbox identity test for depth-3 circuits	1) Nitin Saxena; 2) C. Seshadhri	1) Hausdorff Center for Mathematics, Bonn, Germany; 2) IBM Research, Almaden	(c) 2013 ACM 0004-5411/2013/10-ART33 $15.00	10.1145/2528403	Not Govt	C. Seshadhri is currently with Sandia National Laboratories	No	N/A
SC '15: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis	Nov-15	CilkSpec: optimistic concurrency for Cilk	1) Shaizeen Aga, Satish Narayanasamy; 2) Sriram Krishnamoorthy	1) University of Michigan, Ann Arbor; 2) Pacific Northwest National Laboratory	(c) 2015 ACM. ISBN 978-1-4503-3723-6/15/11. . . $15.00	10.1145/2807591.2807597	National Lab	2) Pacific Northwest National Laboratory	No	ACM acknowledges that this contribution was authored or co-authored by an employee, or contractor of the national government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only. Permission to make digital or hard copies for personal or classroom use is granted. Copies must bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. To copy otherwise, distribute, republish, or post, requires prior specific permission and/or a fee. Request permissions from permissions@acm.org. This material is based on work supported by the U.S. Department of Energy (DOE), Office of Science, Office of Advanced Scientific Computing Research, under contract number 63823 and by the National Science Foundation under the CAREER-1149773 award.
SC '13: Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis	Nov-13	Hybrid MPI: efficient message passing for multi-core systems	1) Andrew Friedley, Andrew Lumsdaine; 2) Greg Bronevetsky; 3) Torsten Hoefler,	1) Indiana University; 2) Lawrence Livermore National Laboratory; 3) ETH Zurich	Copyright 2013 ACM 978-1-4503-2378-9/13/11...$15.00	10.1145/2503210.2503294	National Lab	2) Lawrence Livermore National Laboratory	No	Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Permissions@acm.org This work was supported in part by the Department of Energy X-Stack program and the Early Career award program. It was partially performed under the auspices of the U.S. Department of Energy by Lawrence Livermore National Laboratory under Contract DE-AC52-07NA27344. (LLNLCONF-618492)
ACM Transactions on Modeling and Computer Simulation (TOMACS): Volume 24 Issue 2, February 2014	Feb-14	A restricted multinomial hybrid selection procedure	1) Hélcio Vieira, Jr., Karl Heinz Kienitz, Mischel Carmen Neyra Belderrain; 2) Susan M. Sanchez, Paul J. Sanchez	1) Technological Institute of Aeronautics, SP, Brazil; 2) Naval Postgraduate School, CA, USA	(c) 2014 ACM 1049-3301/2014/02-ART10 $15.00	10.1145/2567891	Employee	Authors’ addresses: S. M. Sanchez and P. J. Sanchez, Department of Operations Research, Naval Postgraduate School, Monterey, CA, 93943, USA.	No	Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies show this notice on the first page or initial screen of a display along with the full citation. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works requires prior specific permission and/or a fee. Permissions may be requested from Publications Dept., ACM, Inc., 2 Penn Plaza, Suite 701, New York, NY 10121-0701 USA, fax +1 (212) 869-0481, or permissions@acm.org This work was supported in part by the Office of Naval Research, a grant of computer time from the DoD High Performance Computing Modernization Program at the Navy DSRC at the Stennis Space Center, and the Naval Postgraduate School’s High-Performance Computing Center
SC '13: Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis	Nov-13	An early performance evaluation of many integrated core architecture based SGI rackable computing system	1) Subhash Saini, Haoqiang Jin, Dennis Jespersen, Piyush Mehrotra, Rupak Biswas; 2) Huiyu Feng; 3) Jahed Djomehri, William Arasin, Robert Hood	1) NASA Ames Research Center, Moffett Field, CA; 2) SGI Fremont, CA; 3) Computer Sciences Corporation, Moffett Field, CA	Copyright 2013 ACM 978-1-4503-2378-9/13/11…$15.00.	10.1145/2503210.2503272	Employee	1) NASA Ames Research Center, Moffett Field, CA;	No	(c) 2013 Association for Computing Machinery. ACM acknowledges that this contribution was authored or co-authored by an employee, contractor or affiliate of the United States government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only. Work by Jahed Djomehri, William Arasin, and Robert Hood, employees of CSC, was supported by NASA Contract No. NNA07CA29C.
Communications of the ACM - Wireless sensor networks: Volume 47 Issue 6, June 2004	Jun-04	The Spinning Cube of Potential Doom	Stephen Lau	Lawrence Berkeley National Laboratories in Berkeley, CA	©2004 ACM 0002-0782/04/0600 $5.00	10.1145/990680.990699	National Lab	Stephen Lau (slau@lbl.gov) is a computer security analyst at the National Energy Research Scientific Computing Center at Lawrence Berkeley National Laboratories in Berkeley, CA.	No	Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. The Digital Library is published by the Association for Computing Machinery. Copyright © 2004 ACM, Inc.
ACM Transactions on Mathematical Software (TOMS): Volume 16 Issue 1, March 1990	Mar-90	Performance evaluation of programs for the error and complementary error functions	W. J. Cody	Argonne National Labs, Argonne, IL	© 1990 ACM 0098-3500/90/0300-0029 $01.50	10.1145/77626.77628	National Lab	Author’s address: Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL 60439-4801.	No	This work was supported by the Applied Mathematical Sciences subprogram of the Office of Energy Research, U.S. Department of Energy, under contract W-31-109-Eng-38. Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Association for Computing Machinery. To copy otherwise, or to republish, requires a fee and/or specific permission.
DIDC '16: Proceedings of the ACM International Workshop on Data-Intensive Distributed Computing	Jun-16	Persistent Data Staging Services for Data Intensive In-situ Scientific Workflows	1) Melissa Romanus, Fan Zhang, Tong Jin, Qian Sun, Hoang Bui, Manish Parashar, Ivan Rodero; 2) Jong Choi, Scott Klasky; 3) Saloman Janhunen, Robert Hager, Choong-Seock Chang	1) Rutgers University, Piscataway, NJ, USA; 2) Oak Ridge National Laboratory, Oak Ridge, TN, USA; 3) Princeton Plasma Physics Laboratory, Princeton, NJ, USA	© 2016 ACM. ISBN 978-1-4503-4352-7/16/06. . . $15.00	10.1145/2912152.2912157	National Lab	2) Oak Ridge National Laboratory, Oak Ridge, TN, USA; 3) Princeton Plasma Physics Laboratory, Princeton, NJ, USA	No	ACM acknowledges that this contribution was authored or co-authored by an employee, or contractor of the national government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only. The research presented in this work is supported in part by National Science Foundation (NSF) via grant numbers CNS 1305375, ACI 1339036, ACI 1310283, ACI 1441376, ACI 1464317 and IIS 1546145, and by the Director, Office of Advanced Scientific Computing Research, Office of Science, of the US Department of Energy Scientific Discovery through Advanced Computing (SciDAC) Institute for Scalable Data Management, Analysis and Visualization (SDAV) under award number DE-SC0007455, the DoE RSVP grant via subcontract number 4000126989 from UT Battelle, the Advanced Scientific Computing Research and Fusion Energy Sciences Partnership for Edge Physics Simulations (EPSI) under award number DE-FG02-06ER54857, the ExaCT Combustion Co-Design Center via subcontract number 4000110839 from UT Battelle, and via grant number DE-FOA-0001338, Storage Systems and Input/Output for Extreme Scale Science. The research at Rutgers was conducted as part of the Rutgers Discovery Informatics Institute (RDI2).
Communications of the ACM: Volume 29 Issue 7, July 1986	Jul-86	Operator work load: when is enough enough?	1) Moira LeMay; 2) Eric Hird	1) Montclair State College, Upper Montclair, NJ; 2) Jet Propulsion Laboratory. California institute of Technology.	© 1986 ACM 0001.0782/86/0700-0638 756	10.1145/6138.6147	Employee	2) Jet Propulsion Laboratory. California institute of Technology.	No	Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage. the ACM copyright notice and the title of the publication and its date appear. and notice is given that copying is by permission of the Association for Computing Machinery. To copy otherwise. or to republish. requires a fee and/or specific permission.
Communications of the ACM: Volume 17 Issue 3, March 1974	Mar-74	Some performance tests of “quicksort” and descendants	Rudolf Loeser	Smithsonian Insitution, Cambridge, MA	Copyright © 1974, Association for Computing Machinery, Inc	10.1145/360860.360870	Employee	Smithsonian Insitution, Cambridge, MA	No	General permission to republish, but not for profit, all or part of this material is granted provided that ACM's copyright notice is given and that reference is made to the publication, to its date of issue, and to the fact that reprinting privileges were granted by permission of the Association for Computing Machinery.
Supercomputing '91: Proceedings of the 1991 ACM/IEEE conference on Supercomputing	Aug-91	Programming costs of explicit memory localization on a large scale shared memory multiprocessor	1) Silvio Picano; 2) Eugene D. Brooks, III, Joseph E. Hoag	1) School of Electrical Engineering, Purdue University, West Lafayette, IN; 2) Massively Parallel Computing Initiative, Lawrence Livermore National Laboratory, Livermore, CA	©1991 ACM O-89791-459-7/’9l/CO36 $01.50	10.1145/125826.125864	National Lab	2) Massively Parallel Computing Initiative, Lawrence Livermore National Laboratory, Livermore, CA	No	Work performed under the auspices of the U.S. Department of Energy by the Lawrence Livermore National Laboratory under contract No. W-7405-ENG-48.
ACM Transactions on Sensor Networks (TOSN): Volume 9 Issue 4, July 2013	Jul-13	On the quality and value of information in sensor networks	1) Chatschik Bisdikian; 2) Lance M. Kaplan; 3) Mani B. Srivastava	1) IBM Research, NY; 2) U.S. Army Research Laboratory, Adelphi, MD; 3) University of California, Los Angeles, CA	© 2013 ACM 1550-4859/2013/07-ART48 $15.00	10.1145/2489253.2489265	Employee	2) U.S. Army Research Laboratory, Adelphi, MD;	No	Research was sponsored by the U.S. Army Research Laboratory and the U.K. Ministry of Defence under Agreement W911NF-06-3-0001. The views and conclusions contained in this document are those of the authors and should not be interpreted as representing the official policies, either expressed or implied, of the U.S. Army Research Laboratory, the U.S. Government, the U.K. Ministry of Defence or the U.K. Government. The U.S. and U.K. Governments are authorized to reproduce and distribute reprints for Government purposes not with standing any copyright notation herein. © 2013 Association for Computing Machinery. ACM acknowledges that this contribution was authored or coauthored by a contractor or affiliate of the U.S. Government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies show this notice on the first page or initial screen of a display along with the full citation. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works requires prior specific permission and/or a fee. Permissions may be requested from Publications Dept., ACM, Inc., 2 Penn Plaza, Suite 701, New York, NY 10121-0701 USA, fax +1 (212) 869-0481, or permissions@acm.org.
SC '13: Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis	Nov-13	Parallelizing the execution of sequential scripts	1) Zhao Zhang, Timothy G. Armstrong; 2) Daniel S. Katz, Ian Foster; 3) Justin M. Wozniak	1) University of Chicago; 2) University of Chicago & Argonne National Laboratory; 3) Argonne National Laboratory	Copyright is held by the owner/author(s). Publication rights licensed to ACM.	10.1145/2503210.2503222	National Lab	2) University of Chicago & Argonne National Laboratory; 3) Argonne National Laboratory	No	Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Permissions@acm.org. This work was supported in part by the U.S. Department of Energy under the ASCR X-Stack program (DE-SC0005380) and DE-AC02-06CH11357. Computing resources were provided by the Argonne Leadership Computing Facility. Work by Katz was supported by the National Science Foundation while working at the Foundation. Any opinion, finding, and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the National Science Foundation.
ACM Transactions on Sensor Networks (TOSN): Volume 7 Issue 3, September 2010	Sep-10	Identification of low-level point radioactive sources using a sensor network	1) Jren-Chit Chin, David K. Y. Yau; 2) Nageswara S. V. Rao, Mallikarjun Shankar; 3)Yong Yang, Jennifer C. Hou; 4) Srinivasagopalan Srivathsan, Sitharama Iyengar	1) Purdue University; 2) Oak Ridge National Laboratory; 3) University of Illinois at Urbana-Champaign; 4) Louisiana State University	© 2010 ACM 1550-4859/2010/09-ART21 $10.00	10.1145/1807048.1807050	National Lab	2) Oak Ridge National Laboratory	No	A preliminary version of this article was presented at 2008 ACM/IEEE International Conference on Information Processing in Sensor Networks (IPSN), and appears in the conference proceedings [Rao et al. 2008]. Research was supported in part by the U.S. Department of Energy under SensorNet grant no. AC05-OOOR22725 and Mathematics of Complex, Distributed, Interconnected Systems program, Office of Advanced Computing Research, and in part by the U.S. National Science Foundation under grant no. CNS-0964086; work was performed at Purdue University and Oak Ridge National Laboratory managed by UT-Battelle, LLC. c 2010 Association for Computing Machinery. ACM acknowledges that this contribution was authored or co-authored by a contractor or affiliate of the U.S. Government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies show this notice on the first page or initial screen of a display along with the full citation. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works requires prior specific permission and/or a fee. Permissions may be requested from Publications Dept., ACM, Inc., 2 Penn Plaza, Suite 701, New York, NY 10121-0701 USA, fax +1 (212) 869-0481, or permissions@acm.org.
DAC '15: Proceedings of the 52nd Annual Design Automation Conference	Jun-15	The SIMON and SPECK lightweight block ciphers	1) Ray Beaulieu, Douglas Shors, Jason Smith, Stefan Treatman-Clark, Bryan Weeks, Louis Wingers	1) National Security Agency, Fort Meade, MD	© 2015 Copyright held by the owner/author(s). Publication rights licensed to ACM.	10.1145/2744769.2747946	Employee	This paper is authored by an employee(s) of the United States Government	Yes	This paper is authored by an employee(s) of the United States Government and is in the public domain. Non-exclusive copying or redistribution is allowed, provided that the article citation is given and the authors and agency are clearly identified as its source.
ACM Transactions on Intelligent Systems and Technology (TIST) - Special Issue on Crowd in Intelligent Systems, Research Note/Short Paper and Regular Papers: Volume 7 Issue 4, July 2016	Jul-16	Designing Noise-Minimal Rotorcraft Approach Trajectories	1) Robert Morris; 2) Matthew Johnson, K. Brent Venable; 3) James Lindsey	1) NASA Ames Research Center, Mountain View, CA; 2) Florida Institute of Human and Machine Cognition, Pensacola, FL; 3) Monterey Technologies and NASA Ames Research Center, Mountain View, CA	(c) 2016 ACM 2157-6904/2016/04-ART58 $15.00	10.1145/2838738	Employee	Authors’ addresses: R. A. Morris, Ames Research Center, Moffett Field, Mountain View, CA 94035; email: robert.a.morris@nasa.gov	No	This work is supported by NASA. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies show this notice on the first page or initial screen of a display along with the full citation. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works requires prior specific permission and/or a fee. Permissions may be requested from Publications Dept., ACM, Inc., 2 Penn Plaza, Suite 701, New York, NY 10121-0701 USA, fax +1 (212) 869-0481, or permissions@acm.org
CCS '16: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security	Oct-16	MTD 2016: Third ACM Workshop on Moving Target Defense	1) Peng Liu; 2) Cliff Wang	1) Penn State University, State College, PA, USA; 2) U.S. Army Research Office, Raleigh, NC, USA	Copyright is held by the owner/author(s).	10.1145/2976749.2990483	Employee	2) U.S. Army Research Office, Raleigh, NC, USA	No	Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.
Journal of the ACM (JACM): Volume 36 Issue 1, Jan. 1989	Jan-89	Maintaining state constraints in relational databases: a proof theoretic basis	1) William W. McCune; 2) Lawrence J. Henschen	1) Argonne National Laboratory, Argonne, IL; 2) Northwestern Univ., Evanston, IL	© 1989 ACM 0004-541 l/89/0100-0046 $01.50	10.1145/58562.59302	National Lab	Authors’ addresses: W. W. McCune, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL 60439-4801;	No	This work was supported in part by the Applied Mathematical Sciences subprogram of the Office of Energy Research, U.S. Department of Energy, under contract W-31-109-Eng-38 and in part by the National Science Foundation under grant MCS 83-06637. Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Association for Computing Machinery. To copy otherwise, or to republish, requires a fee and/or specific permission.
HRI '15: Proceedings of the Tenth Annual ACM/IEEE International Conference on Human-Robot Interaction	Mar-15	Communicating Directionality in Flying Robots	1) Daniel Szafir, Bilge Mutlu; 2) Terry Fong	1) University of Wisconsin-Madison, Madison, WI, USA; 2) NASA Ames Research Center, Mountain View, CA, USA	Copyright is held by the owner/author(s). Publication rights licensed to ACM	10.1145/2696454.2696475	Employee	2) NASA Ames Research Center, Mountain View, CA, USA	No	Publication rights licensed to ACM. ACM acknowledges that this contribution was authored or co-authored by an employee, contractor or affiliate of the United States government. As such, the United States Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only. This research was supported by a NASA Space Technology Research Fellowship under award NNX12AN14H.
ACM Transactions on Mathematical Software (TOMS): Volume 10 Issue 1, March 1984	Mar-84	A Performance Evaluation of Some FORTRAN Subroutines for the Solution of Stiff Oscillatory Ordinary Differential Equations	Patrick W. Gaffney	Computer Sciences at Oak Ridge National Laboratory, P.O. Box X, Oak Ridge, TN	© 1984 ACM 0098-3500/84/0300-0058 $00.75	10.1145/356068.356073	National Lab	Author's address: Computer Sciences at Oak Ridge National Laboratory, P.O. Box X, Oak Ridge, TN 37830.	No	Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Association for Computing Machinery. To copy otherwise, or to republish, requires a fee and/or specific permission.
Supercomputing '91: Proceedings of the 1991 ACM/IEEE conference on Supercomputing	Aug-91	An evaluation of automatic and interactive parallel programming tools	1) Doreen Y. Cheng; 2) Douglas M. Pase	1) Computer Science Co., NASA Ames Research Center, MS 258-6, Moffett Field, CA; 2) Formerly at NASA (CSC), Cray Research, Inc., 655F Lone Oak Dr., Eagan, MN	© 1991 ACM 0-89791-459-7/91/0412 $01.50	10.1145/125826.126052	Contractor	1) Computer Science Co., NASA Ames Research Center, MS 258-6, Moffett Field, CA;	No	N/A
ICSE '11: Proceedings of the 33rd International Conference on Software Engineering	May-11	A case study of measuring process risk for early insights into software safety	1) Lucas Layman; 2) Victor R. Basili, Marvin V. Zelkowitz; 3) Karen L. Fisher	1) Fraunhofer CESE, College Park, MD, USA; 2) University of Maryland & Fraunhofer CESE, College Park, MD, USA; 3) NASA Goddard Spaceflight Center, Greenbelt, MD, USA	Copyright 2011 ACM 978-1-4503-0445-0/11/05 ...$10.00	10.1145/1985793.1985881	Employee	3) NASA Goddard Spaceflight Center, Greenbelt, MD, USA	No	© 2011 Association for Computing Machinery. ACM acknowledges that this contribution was authored or co-authored by a contractor or affiliate of the U.S. Government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only. This research was supported by NASA OSMA SARP grant NNX08AZ60G to the Fraunhofer CES
Communications of the ACM - Alternate reality gaming: Volume 51 Issue 2, February 2008	Feb-08	Sharing knowledge	1) Peter Marks; 2) Peter Polak; 3) Scott McCoy; 4) Dennis Galletta	1) Brooke Army Medical Center, San Antonio, TX; 2) University of Miami, Coral Gables, FL; 3) College of William and Mary, Williamsburg, VA; 4) University of Pittsburgh, Pittsburgh, PA	©2008 ACM 0001-0782/08/0200 $5.00	10.1145/1314215.1314226	Employee	Peter Marks (pete-marks@us.army.mil) is the Chief Information Officer at Brooke Army Medical Center in San Antonio, TX.	No	Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. The Digital Library is published by the Association for Computing Machinery. Copyright © 2008 ACM, Inc
Communications of the ACM: Volume 41 Issue 5, May 1998	May-98	Distributed dynamic systems	1) James Veitch; 2) Robert Laddaga	1) Franz, Inc., Berkeley, Ca; 2) DARPA-ITO, Arlington, VA	N/A	10.1145/274946.274953	Employee	Robert Laddaga (rladdaga@darpa.mil) is a program manager with the Defense Advanced Research Projects Agency Information Technology Office (DARPA-ITO) in Arlington, VA.	No	N/A
						10.1145/1734454.1734492					Unable to locate
ACM Transactions on Mathematical Software (TOMS): Volume 19 Issue 3, Sept. 1993	Sep-93	The computation of eigenvalues and solutions of Mathieu's differential equation for noninteger order	Randall B. Shirts	Idaho National Engineering Laboratory and Brigham Young University	© ACM 0098-3500/93/0900-0377 $01.50	10.1145/155743.155796	Unsure	Idaho National Engineering Laboratory and Brigham Young University	No	This work was support under Department of Energy contract DE-ACO07-762001570 under the Long Term Research Initiative in the Chemical Sciences.Machinery. Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Association for Computing Machinery. To copy otherwise, or to republish, requires a fee and/or specific permission.
Communications of the ACM: Volume 28 Issue 9, Sept. 1985	Sep-85	An expert system for a resource allocation problem	1) James R. Slagle; 2) Henry Hamburger	1) Univ. of Minnesota, Minneapolis; 2) Naval Research Laboratory, Washington, DC	© 1985 ACM 0001.0782/85/0900-0994 750	10.1145/4284.4291	Employee	2) Naval Research Laboratory, Washington, DC	No	This work was performed at the Navy Center for Applied Research in Artificial Intelligence, Naval Research Laboratory. This work was supported by the Office of Naval Rexarch. Office of Naval Technology, United States Marine Corps. and Naval Ocean Systems Center. Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Association for Computing Machinery. To copy otherwise, or to republish, requires a fee and/or specific permission.
ACM Transactions on Architecture and Code Optimization (TACO): Volume 13 Issue 4, December 2016	Dec-16	Static and Dynamic Frequency Scaling on Multicore CPUs	1) Wenlei Bao, Changwan Hong, P. Sadayappan; 2) Sudheer Chunduri; 3) Sriram Krishnamoorthy; 4) Louis-Noël Pouchet; 5) Fabrice Rastello,	1) The Ohio State University, Columbus, Ohio; 2) IBM Research India, S. Cass Avenue Lemont, IL; 3) Pacific Northwest National Laboratory, Richland, WA; 4) Colorado State University, Fort Collins, CO; 5) University Grenoble Alpes, Grenoble France	(c) 2016 ACM 1544-3566/2016/12-ART51 $15.00	10.1145/3011017	National Lab	3) Pacific Northwest National Laboratory, Richland, WA;	No	This work was supported in part by the U.S. National Science Foundation, award 1524127; by the U.S. Department of Energys (DOE) Office of Science, Office of Advanced Scientific Computing Research, under award 63823 and DE-SC0014135. Pacific Northwest National Laboratory is operated by Battelle for DOE under Contract DE-AC05-76RL01830. We would like to thank Charles Lefurgy for his guidance in using the AMESTER tool and power monitoring on POWER8 nodes. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies show this notice on the first page or initial screen of a display along with the full citation. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works requires prior specific permission and/or a fee. Permissions may be requested from Publications Dept., ACM, Inc., 2 Penn Plaza, Suite 701, New York, NY 10121-0701 USA, fax +1 (212) 869-0481, or permissions@acm.org
Supercomputing '89: Proceedings of the 1989 ACM/IEEE conference on Supercomputing	Aug-89	Effective use of Cray supercomputers	1) W. T. C. Kramer, J. M. Crawer	1) NAS Systems Division, NASA Ames Research Center, Moffett Field, CA	© 1989 ACM 089791-341-8/89/0011/0721 $1.50	10.1145/76263.76345	Employee	1) NAS Systems Division, NASA Ames Research Center, Moffett Field, CA	No	Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Association for Computing Machinery. To copy otherwise, or to republish, requires a fee and/or specific permission.
PPoPP '14: Proceedings of the 19th ACM SIGPLAN symposium on Principles and practice of parallel programming	Feb-14	Portable, MPI-interoperable coarray fortran	1) Chaoran Yang, John Mellor-Crummey; 2) Wesley Bland, Pavan Balaji	1) Rice University, Houston, TX, USA; 2) Argonne National Laboratory, Argonne, IL, USA	Copyright (c) 2014 ACM 978-1-4503-2656-8/14/02. . . $15.00.	10.1145/2555243.2555270	National Lab	2) Argonne National Laboratory, Argonne, IL, USA	No	Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from permissions@acm.org.
IPSN '07: Proceedings of the 6th international conference on Information processing in sensor networks	Apr-07	NIST smart data flow system II: speaker localization	1) Antoine Fillinger, Lukas Diduch, Imad Hamchi, Stephane Degre, Vincent Stanford	1) National Institute of Standards and Technology (NIST), Gaithersburg, MD	This paper is authored by an employee(s) of the United States Government and is in the public domain.	10.1145/1236360.1236434	Employee	1) National Institute of Standards and Technology (NIST), Gaithersburg, MD	Yes	The NIST Smart Data Flow System II software was developed at the National Institute of Standards and Technology (NIST) by employees of the Federal Government in the course of their official duties. Pursuant to title 17 Section 105 of the United States Code this software is not subject to copyright protection and is in the public domain.
Journal of the ACM (JACM): Volume 26 Issue 1, Jan. 1979	Jan-79	Odd-Even Reduction for Banded Linear Equations	1) Garry H. Rodrigue, Niel K. Madsen; 2) Jack I. Karush	1) Lawrence Livermore Laboratory, University of California, P O Box 808, Livermore, CA; 2)7515 Claremont Ave., Berkeley, CA and Lawrence Livermore Laboratory, University of California, P O Box 808, Livermore, CA	© 1979 ACM 0004-5411/79/0100-0072 $00 75	10.1145/322108.322116	National Lab	Authors' present addresses: G H Rodngue and N K Madsen, Lawrence Livermore Laboratory, University of California, P O Box 808, Llvermore, CA 94550, J I Karush, 7515 Claremont Ave, Berkeley, CA 94705	No	Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Association for Computing Machinery To copy otherwise, or to republish, requires a fee and/or specific permission This work was performed under the auspices of the US Energy Research & Development Admunistration under Contract No W-7405-Eng-48
DAC '12: Proceedings of the 49th Annual Design Automation Conference	Jun-12	Can EDA combat the rise of electronic counterfeiting?	1) Farinaz Koushanfar; 2) Saverio Fazzari; 3) Carl McCants; 4) William Bryson; 5) Matthew Sale; 6) Peilin Song; 7) Miodrag Potkonjak	1) Rice University, Houston, TX; 2) Booz Allen Hamilton, Inc., Arlington, VA; 3) Defense Advanced Research, Projects Agency, Arlington, VA; 4) Analytical Solutions, Inc., Albuquerque, NM; 5) U.S. Naval Surface Warfare Center, Crane, IN; 6) IBM Research, Yorktown Heights, NY; 7) University of California, Los Angeles, CA	Copyright 2012 ACM ACM 978-1-4503-1199-1/12/06 ...$10.00.	10.1145/2228360.2228386	Employee	3) Defense Advanced Research, Projects Agency, Arlington, VA; 5) U.S. Naval Surface Warfare Center, Crane, IN;	No	Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee.
MobiWac '14: Proceedings of the 12th ACM international symposium on Mobility management and wireless access	Sep-14	Building a secure and feature-rich mobile mapping service app using HTML5: challenges and best practices	1) Rajasekar Karthik, Dilip R. Patlolla, Alexandre Sorokine, Devin A. White, Aaron T. Myers	1) Oak Ridge National Laboratory, Oak Ridge, TN, USA	Copyright is held by the owner/author(s). Publication rights licensed to ACM.	10.1145/2642668.2642685	National Lab	1) Oak Ridge National Laboratory, Oak Ridge, TN, USA	No	Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from permissions@acm.org.
ACM Transactions on Mathematical Software (TOMS): Volume 10 Issue 1, March 1984	Mar-84	Randomly Generated Test Problems for Positive Definite Quadratic Programming	1) Melanie L. Lenard; 2) Michael Minkoff	1) School of Management, Boston Umversity, Boston, MA; 2) Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL	© 1984 ACM 0098-3500/84/0300-0086 $00.75	10.1145/356068.356075	National Lab	2) Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL	No	This work was supported by the Applied Mathematical Sciences Research Program (KC-04-02) of the Office of Energy Research of the U.S. Department of Energy under contract W-31-109-ENG-38. Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Association for Computing Machinery. To copy otherwise, or to republish, requires a fee and/or specific permission.
SAC '15: Proceedings of the 30th Annual ACM Symposium on Applied Computing	Apr-15	Compilation of synchronous observers as code contracts	1) Arnaud Dieumegard, Alice Taillar, Xavier Thirioux; 2) Pierre-Loïc Garoche; 3) Temesghen Kahsai,	1) INPT-ENSEEIHT; 2) ONERA; 3) NASA Ames / CMU	Copyright 2015 ACM 978-1-4503-3196-8/15/04 ...$15.00 .	10.1145/2695664.2695819	Unsure	3) NASA Ames / CMU	No	Publication rights licensed to ACM. ACM acknowledges that this contribution was authored or co-authored by an employee, contractor or affiliate of a national government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only. This material is based upon work funded and supported by NASA Contract No. NNX14AI09G, NSF CrAVES and ANR INS-2012-007 CAFEIN.
Journal of the ACM (JACM): Volume 60 Issue 2, April 2013	Apr-13	An in-depth analysis of stochastic Kronecker graphs	1) C. Seshadhri, Ali Pinar, Tamara G. Kolda	1) Sandia National Laboratories, Livermore, CA	(c) 2013 ACM 0004-5411/2013/04-ART13 $15.00	10.1145/2450142.2450149	National Lab	Authors’ address: Sandia National Laboratories, Livermore, CA 94551, Correspondence email: apinar@sandia.gov.	No	This work was funded by the applied mathematics program at the United States Department of Energy and performed at Sandia National Laboratories, a multiprogram laboratory operated by Sandia Corporation, a wholly owned subsidiary of Lockheed Martin Corporation, for the United States Department of Energy’s National Nuclear Security Administration under contract DE-AC04-94AL85000. c 2013 Association for Computing Machinery. ACM acknowledges that this contribution was authored or coauthored by a contractor or affiliate of the [U.S.] Government. As such the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies show this notice on the first page or initial screen of a display along with the full citation. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works requires prior specific permission and/or a fee. Permissions may be requested from Publications Dept., ACM, Inc., 2 Penn Plaza, Suite 701, New York, NY 10121-0701 USA, fax +1 (212) 869-0481, or permissions@acm.org.
SC '13: Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis	Nov-13	The Science DMZ: a network design pattern for data-intensive science	1) Eli Dart, Lauren Rotman, Brian Tierney, Mary Hester; 2) Jason Zurawski	1) Lawrence Berkeley National Laboratory, Berkeley, CA; 2) Internet2, Office of the CTO, Washington DC	Copyright is held by the owner/author(s). Publication rights licensed to ACM.	10.1145/2503210.2503245	National Lab	1) Lawrence Berkeley National Laboratory, Berkeley, CA;	No	This manuscript has been authored by an author at Lawrence Berkeley National Laboratory under Contract No. DE-AC02-05CH11231 with the U.S. Department of Energy. The U.S. Government retains, and the publisher, by accepting the article for publication, acknowledges, that the U.S. Government retains a non-exclusive, paid-up, irrevocable, world-wide license to publish or reproduce the published form of this manuscript, or allow others to do so, for U.S. Government purposes. ACM acknowledges that this contribution was authored or co-authored by an employee, contractor or affiliate of the United States government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only.
ACM Transactions on Computer Systems (TOCS): Volume 2 Issue 3, Aug. 1984	Aug-84	A security model for military message systems	1) Carl E. Landwehr, Constance L. Heitmeyer, John McLean	1) Naval Research Laboratory	1984 ACM 0734-2071/84/0198-0222 $00.00	10.1145/989.991	Employee	Authors' address: Computer Science and Systems Branch, Information Technology Division, Naval Research Laboratory, Washington, D.C. 20375	No	N/A
ICS '14: Proceedings of the 28th ACM international conference on Supercomputing	Jun-14	Collective memory transfers for multi-core chips	1) George Michelogiannakis, Alexander Williams, Samuel Williams, John Shalf	1) Lawrence Berkeley National Laboratory, Berkeley, CA, USA	(c) 2014 Association for Computing Machinery	10.1145/2597652.2597654	National Lab	1) Lawrence Berkeley National Laboratory, Berkeley, CA, USA	No	ACM acknowledges that this contribution was authored or co-authored by an employee, contractor or affiliate of the United States government. As such, the United States Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only. This work was supported by the Director, Office of Science, of the U.S. Department of Energy under Contract No. DEAC02-05CH11231.
CODASPY '16: Proceedings of the Sixth ACM Conference on Data and Application Security and Privacy	Mar-16	Decoding the Mystery of the Internet of Things	Jeffrey Voas	NIST, Gaithersburg, USA	Copyright is held by the owner/author(s).	10.1145/2857705.2857729	Employee	NIST, Gaithersburg, USA	No	Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.
PPoPP 2015: Proceedings of the 20th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming	Jan-15	Diagnosing the causes and severity of one-sided message contention	1) Nathan R. Tallent, Abhinav Vishnu, Hubertus Van Dam, Jeff Daily, Darren J. Kerbyson, Adolfy Hoisie	1) Pacific Northwest National Laboratory, USA	Copyright 2015 ACM 978-1-4503-3205-7/15/02...$15.00	10.1145/2688500.2688516	National Lab	1) Pacific Northwest National Laboratory, USA	No	Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Permissions@acm.org. This work was supported by the U.S. Department of Energy (DOE), Office of Science, Advanced Scientific Computing Research, under award numbers 62426 (Performance Insight for Programmers and Exascale), 62855 (Beyond the Standard Model), and 59542 (Performance Health Monitoring for Large-Scale Systems). We used resources of the Oak Ridge and Argonne Leadership Computing Facilities under INCITE (Innovative and Novel Computational Impact on Theory and Experiment) award Performance Evaluation and Analysis Consortium (PEAC) End Station. Pacific Northwest National Laboratory is operated by Battelle for the DOE under contract DE-AC05-76RL01830
Communications of the ACM: Volume 9 Issue 5, May 1966	May-66	Automatic analysis of electronic digital circuits using list processing	Leon Shalla	Argonne National Laboratory, Argonne, IL		10.1145/355592.365651					Unable to locate
ICPE '16: Proceedings of the 7th ACM/SPEC on International Conference on Performance Engineering	Mar-16	Communication Characterization and Optimization of Applications Using Topology-Aware Task Mapping on Large Supercomputers	1) Sarat Sreepathi, Ed D'Azevedo, Bobby Philip, Patrick Worley	1) Oak Ridge National Laboratory, Oak Ridge, TN, USA	(c) 2016 Copyright held by the owner/author(s). Publication rights licensed to ACM	10.1145/2851553.2851575	National Lab	1) Oak Ridge National Laboratory, Oak Ridge, TN, USA	No	Publication rights licensed to ACM. ACM acknowledges that this contribution was authored or co-authored by an employee, contractor or affiliate of the United States government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only.
Communications of the ACM - Enterprise information integration: and other tools for merging data: Volume 51 Issue 9, September 2008	Sep-08	How do I model state?: Let me count the ways	1) Ian Foster; 2) Savas Parastatidis; 3) Paul Watson; 4) Mark Mckeown	1) director of the Computation Institute at Argonne National Laboratory, where he is also an Argonne Distinguished Fellow, and the University of Chicago; 2) architect in Microsoft Research; 3) professor of Computer Science at Newcastle University; 4) grid architect at the University of Manchester	©2008 ACM 0001-0782/08/0900 $5.00	10.1145/1378727.1378739	Unsure	Ian Foster (foster@anl.gov) is the director of the Computation Institute at Argonne National Laboratory, where he is also an Argonne Distinguished Fellow, and the University of Chicago, where he is also the Arthur Holly Compton Distinguished Service Professor of Computer Science.	No	Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. The Digital Library is published by the Association for Computing Machinery. Copyright © 2008 ACM, Inc.
SC '07: Proceedings of the 2007 ACM/IEEE conference on Supercomputing	Nov-07	Falkon: a Fast and Light-weight tasK executiON framework	1) Ioan Raicu, Yong Zhao; 2) Catalin Dumitrescu, Ian Foster, Mike Wilde	1) University of Chicago, IL; 2) University of Chicago and Argonne National Laboratory, Argonne, IL	(c) 2007 ACM 978-1-59593-764-3/07/0011…$5.00	10.1145/1362622.1362680	Unsure	2) University of Chicago and Argonne National Laboratory, Argonne, IL	No	(c) 2007 Association for Computing Machinery. ACM acknowledges that this contribution was authored or co-authored by a contractor or affiliate of the [U.S.] Government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only. This work was supported in part by the NASA Ames Research Center GSRP Grant Number NNA06CB89H and by the Mathematical, Information, and Computational Sciences Division subprogram of the Office of Advanced Scientific Computing Research, Office of Science, U.S. Dept. of Energy, under Contract DE-AC02-06CH11357
Communications of the ACM: Volume 58 Issue 7, July 2015	Jul-15	The dangers of military robots, the risks of online voting	1) John Arquilla; 2) Duncan A. Buell	1) United States Naval Postgraduate School; 2) University of South Carolina	©2015 ACM 0001-0782/15/07	10.1145/2771281	Employee	John Arquilla is professor and chair of defense analysis at the United States Naval Postgraduate School.	No	Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and full citation on the first page. Copyright for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or fee. Request permission to publish from permissions@acm.org or fax (212) 869-0481. The Digital Library is published by the Association for Computing Machinery. Copyright © 2015 ACM, Inc.
Communications of the ACM - Designing for the mobile device: Volume 48 Issue 7, July 2005	Jul-05	The locality principle	Peter J. Denning	Director of the Cebrowski Institute for information and innovation and superiority at the Naval Postgraduate School in Monterey, CA, and is a past president of ACM.	©2005 ACM 0001-0782/05/0700 $5.00	10.1145/1070838.1070856	Employee	Peter J. Denning (pjd@nps.edu) is Distinguished Professor of Computer Science and Director of the Cebrowski Institute for information innovation at the Naval Postgraduate School in Monterey, CA, is Editor of ACM Ubiquity, and is a past president of ACM.	No	Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. The Digital Library is published by the Association for Computing Machinery. Copyright © 2005 ACM, Inc.
ICSE '10: Proceedings of the 32nd ACM/IEEE International Conference on Software Engineering - Volume 2	May-10	Slicing and dicing bugs in concurrent programs	1) Neha Rungta; 2) Eric Mercer	1) NASA Ames Research Center, Moffett Field, CA; 2) Brigham Young University, Provo, UT	Copyright 2010 ACM 978-1-60558-719-6/10/05 ...$10.00.	10.1145/1810295.1810328	Employee	1) NASA Ames Research Center, Moffett Field, CA;	No	Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee.
AOSD '04: Proceedings of the 3rd international conference on Aspect-oriented software development	Mar-04	A technique for constructing aspect weavers using a program transformation engine	1) Jeff Gray, Suman Roychoudhury	1) University of Alabama at Birmingham, Birmingham, AL	N/A	10.1145/976270.976277	Not Govt	No government agencies appear in the author affiliations	No	N/A
ROSS '14: Proceedings of the 4th International Workshop on Runtime and Operating Systems for Supercomputers	Jun-14	Hybrid MPI: a case study on the Xeon Phi platform	1) U. S. Wickramasinghe, Andrew Lumsdaine; 2) Greg Bronevetsky; 3) Andrew Friedley	1) Indiana University; 2) Lawrence Livermore National Laboratory; 3) Intel Corporation	Copyright 2014 ACM 978-1-4503-2950-7/14/06 ...$15.00.	10.1145/2612262.2612267	National Lab	2) Lawrence Livermore National Laboratory;	No	(c) 2014 Association for Computing Machinery. ACM acknowledges that this contribution was authored or co-authored by an employee, contractor or affiliate of the national government of United States. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only.
	# of papers authored by federal employees				195
	Works with "work of govt" disclaimer				3
	# of papers authored by National Lab Workers				255
	Works with no disclaimer				493
	# of false positives and not govt papers				16
	# of papers with unclear authorship				32
	# of papers with non-National Lab contractor employees				1
	# of papers preparer could not locate PDFs of				2