DOCSLIB.ORG

ACM Digital Library LEIDINIŲ SĄRAŠAS

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
ACM Digital Library LEIDINIŲ SĄRAŠAS ACM Digital Library https://dl.acm.org/ LEIDINIŲ SĄRAŠAS 1.1. ACM Digital Library – Journals Elektroninio PAVADINIMAS leidinio ISSN Pradžios metai Kategorija WoS DB 1. ACM Computing Surveys 1557-7341 Tomas 1 Nr. 1 (1969 m. kovas) COMPUTER SCIENCE, THEORY & METHODS Q1 ACM Journal of Computer 2. 1557-9441 Tomas 24 Nr. 1 (2000 m. vasaris) Documentation 3. ACM Journal on Emerging COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Q3 Technologies in Computing 1550-4840 Tomas 1 Nr. 1 (2005 m. balandis) ENGINEERING, ELECTRICAL & ELECTRONIC Q3 Systems NANOSCIENCE & NANOTECHNOLOGY Q4 Journal of Data and Information 4. 1936-1963 Tomas 1 Nr. 1 (2009 m. birželis) Quality Journal on Educational 5. 1531-4278 Tomas 1Nr.1es (2001 m. kovas) Resources in Computing Journal of Experimental Tomas 1 6. 1084-6654 Algorithmics (1996 m.) 7. COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS Q3 Journal of the ACM 1557-735X Tomas 1Nr. 1 (1954 m. sausis) COMPUTER SCIENCE, SOFTWARE ENGINEERING Q2 COMPUTER SCIENCE, THEORY & METHODS Q2 Journal on Computing and 8. 1556-4711 Tomas 1 Nr. 1 (2008 m. birželis) Cultural Heritage ACM Letters on Programming Tomas 1 Nr. 1 9. 1557-7384 Languages and Systems (1992 m. kovas) ACM Transactions on Accessible Yra. Neturi rodiklių 10. 1936-7236 Tomas 1 Nr. 1 (2008 m. gegužė) Computing ACM Transactions on COMPUTER SCIENCE, THEORY & METHODS Q2 11. 1549-6333 Tomas 1 Nr. 1 (2005 m. liepa) Algorithms MATHEMATICS, APPLIED Q1 ACM Transactions on Applied Tomas 1 Nr. 1 COMPUTER SCIENCE, SOFTWARE ENGINEERING Q3 12. 1544-3965 Perception (2004 m. liepa) 13. ACM Transactions on COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Q2 Architecture and Code 1544-3973 Tomas 1 Nr. 1 (2004 m. kovas) COMPUTER SCIENCE, THEORY & METHODS Q2 Optimization ACM Transactions on Asian 14. Tomas 1 Nr. 1 Language Information 1558-3430 (2002 m. kovas) Processing Elektroninio PAVADINIMAS leidinio ISSN Pradžios metai Kategorija WoS DB 15. ACM Transactions on Asian and COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Q4 Low-Resource Language 2375-4702 Tomas 1 Nr. 1 (2002 m. kovas) Information Processing ACM Transactions on COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Q2 16. Tomas 1 Nr. 1 (2006 m. Autonomous and Adaptive 1556-4703 COMPUTER SCIENCE, INFORMATION SYSTEMS Q2 rugsėjis) Systems COMPUTER SCIENCE, THEORY & METHODS Q2 ACM Transactions on Tomas 1 Nr. 1 Yra. Neturi rodiklių 17. 1942-3462 Computation Theory (2009 m. vasaris) ACM Transactions on COMPUTER SCIENCE, THEORY & METHODS Q3 18. 1557-945X Tomas 1Nr. 1 (2000 m. liepa) Computational Logic LOGIC Q1 ACM Transactions on Computer COMPUTER SCIENCE, THEORY & METHODS Q3 19. 1557-7333 Tomas 1Nr. 1 (1983 m. vasaris) Systems LOGIC Q1 20. ACM Transactions on COMPUTER SCIENCE, CYBERNETICS Q2 Computer-Human 1557-7325 Tomas 1 Nr. 1 (1994 m. kovas) COMPUTER SCIENCE, INFORMATION SYSTEMS Q2 Interaction ACM Transactions on Tomas 1 Nr. 1es (2001 m. EDUCATION, SCIENTIFIC DISCIPLINES Q2 21. 1946-6226 Computing Education kovas) ACM Transactions on Database COMPUTER SCIENCE, INFORMATION SYSTEMS Q3 22. 1557-4644 Tomas 1 Nr. 1 (1976 m. kovas) Systems COMPUTER SCIENCE, SOFTWARE ENGINEERING Q2 23. ACM Transactions on Design COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Q4 Automation of Electronic 1557-7309 Tomas 1 Nr. 1 (1996 m. sausis) COMPUTER SCIENCE, SOFTWARE ENGINEERING Q3 Systems ACM Transactions on Economics Yra. Neturi rodiklių 24. 2167-8383 Tomas 1 Nr. 1 (2013 m. sausis) and Computation ACM Transactions on Embedded COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Q3 25. 1558-3465 Tomas 1 Nr. 1 (2002 m. lapkritis) Computing Systems COMPUTER SCIENCE, SOFTWARE ENGINEERING Q3 ACM Transactions on COMPUTER SCIENCE, SOFTWARE ENGINEERING Q1 26. 1557-7368 Tomas 1 Nr. 1 (1982 m. sausis) Graphics ACM Transactions on COMPUTER SCIENCE, INFORMATION SYSTEMS Q2 27. 1558-2868 Tomas 1 Nr. 1 (1983 m. sausis) Information Systems ACM Transactions on COMPUTER SCIENCE, INFORMATION SYSTEMS Q2 28. Tomas 1Nr. 1 (1998 m. Information and System 1557-7406 lapkritis) Security 29. ACM Transactions on Tomas 1Nr. 1 (2010 m. spalis) COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Q1 Intelligent Systems and 2157-6912 COMPUTER SCIENCE, INFORMATION SYSTEMS Q1 Technology ACM Transactions on Interactive Yra. Neturi rodiklių 30. 2160-6463 Tomas 1 Nr. 1 (2011 m. spalis) Intelligent Systems ACM Transactions on Internet OMPUTER SCIENCE, INFORMATION SYSTEMS Q3 31. 1557-6051 Tomas 1 Nr. 1 (2001 m. rugpjūtis) Technology COMPUTER SCIENCE, SOFTWARE ENGINEERING Q2 Elektroninio PAVADINIMAS leidinio ISSN Pradžios metai Kategorija WoS DB 32. ACM Transactions on COMPUTER SCIENCE, INFORMATION SYSTEMS Q2 Knowledge Discovery from 1556-472X Tomas 1 Nr. 1 (2007 m. kovas) COMPUTER SCIENCE, SOFTWARE ENGINEERING Q2 Data 33. ACM Transactions on Yra. Neturi rodiklių Management Information 2158-6578 Tomas 1 Nr. 1 (2010 m. gruodis) Systems ACM Transactions on COMPUTER SCIENCE, SOFTWARE ENGINEERING Q1 34. 1557-7295 Tomas 1 Nr. 1 (1975 m. kovas) Mathematical Software MATHEMATICS, APPLIED Q1 ACM Transactions on Modeling COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Q4 35. 1558-1195 Tomas 1 Nr. 1 (1991 m. sausis) and Computer Simulation MATHEMATICS, APPLIED Q2 36. ACM Transactions on Modeling Yra. Neturi rodiklių and Performance Evaluation of 2376-3647 Tomas 1Nr. 1 (2016 m. kov as) Computing Systems 37. ACM Transactions on COMPUTER SCIENCE, INFORMATION SYSTEMS Q2 Multimedia Computing, Tomas 1 Nr. 1 (2005 m. COMPUTER SCIENCE, SOFTWARE ENGINEERING Q1 1551-6865 Communications, and vasaris) COMPUTER SCIENCE, THEORY & METHODS Q1 Applications ACM Transactions on Parallel Yra. Neturi rodiklių 38. 2329-4957 Tomas 1 Nr. 1 (2014 m. rugsėjis) Computing ACM Transactions on Privacy Yra. Neturi rodiklių 39. 2471-2574 Tomas 1 Nr. 1 (1998 m. lapkritis) and Security 40. ACM Transactions on COMPUTER SCIENCE, SOFTWARE ENGINEERING Q1 Programming Languages 1558-4593 Tomas 1 Nr. 1 (1979 m. liepa) and Systems 41. ACM Transactions on COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Q3 Reconfigurable Technology and 1936-7414 Tomas 1 Nr. 1 (2008 m. kovas) Systems ACM Transactions on Sensor Tomas 1 Nr. 1 (2005 m. COMPUTER SCIENCE, INFORMATION SYSTEMS Q2 42. 1550-4867 Networks rugpjūtis) TELECOMMUNICATIONS Q2 43. ACM Transactions on COMPUTER SCIENCE, SOFTWARE ENGINEERING Q1 Software Engineering and 1557-7392 Tomas 1Nr. 1 (1992 m. sausis) Methodology ACM Transactions on Spatial Yra. Neturi rodiklių 44. 2374-0361 Tomas 1 Nr. 1 (2015 m. rugpjūtis) Algorithms and Systems ACM Transactions on Speech 45. 1550-4883 Tomas 1 (2004 m. lapkritis) and Language Processing ACM Transactions on COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Q2 46. 1553-3093 Tomas 1Nr. 1 (2005 m. vasaris) Storage COMPUTER SCIENCE, SOFTWARE ENGINEERING Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS Q3 47. ACM Transactions on the Web 1559-114X Tomas 1Nr. 1 (2007 m. gegužė) COMPUTER SCIENCE, SOFTWARE ENGINEERING Q2 Elektroninio PAVADINIMAS leidinio ISSN Pradžios metai Kategorija WoS DB IEEE/ACM Transactions on ACOUSTICS Q1 48. Tomas 22 Nr. 1 Audio, Speech and Language 2329-9304 ENGINEERING, ELECTRICAL & ELECTRONIC Q2 (2014 m. sausis) Processing 49. BIOCHEMICAL RESEARCH METHODS Q3 IEEE/ACM Transactions on COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Computational Biology and Netaikytina Tomas 1Nr. 1 (2004 m. sausis) Q2 Bioinformatics MATHEMATICS, INTERDISCIPLINARY APPLICATIONS Q2 STATISTICS & PROBABILITY Q1 50. COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Q1 IEEE/ACM Transactions on COMPUTER SCIENCE, THEORY & METHODS Q1 Netaikytina Tomas 1Nr. 1 (1993 m. vasaris) Networking ENGINEERING, ELECTRICAL & ELECTRONIC Q1 TELECOMMUNICATIONS Q1 1.2. ACM Digital Library – Magazines Elektroninio leidinio PAVADINIMAS ISSN Pradžios metai Prieiga iki 1 ACM Inroads 2153-2192 Tomas 1 Nr. 1 (2010 m. kovas) COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Q1 Communications of the COMPUTER SCIENCE, SOFTWARE ENGINEERING Q1 2 ACM 1557-7317 Tomas 1 Nr. 1 (1958 m. sausis) COMPUTER SCIENCE, THEORY & METHODS Q1 Computers in Yra. Neturi rodiklių 3 Entertainment 1544-3574 Tomas 1 Nr. 1 (2003 m. spalis) 4 Crossroads 1528-4980 Tomas 1 Nr. 1 (1994 m. rugsėjis) 5 Queue 1542-7749 Tomas 1 Nr. 1 (2003 m. kovas) 6 StandardView 1557-7376 Tomas 1 Nr. 1 (1993 m. rugsėjis) Tomas 2000, vasario Nr. (2000 m. vasario 7 Ubiquity 1530-2180 1 – 28 d.) XRDS: Crossroads, The ACM Magazine for 8 Students 1528-4980 Tomas 1 Nr. 1 (1994 m. rugsėjis) 9 eLearn 1535-394X Tomas 2001 Nr. 5 (2001 m. gegužė) 10 intelligence 1557-9425 Nr. 24 (1970 m. spalis) PSYCHOLOGY, MULTIDISCIPLINARY Q1 11 interactions 1558-3449 Tomas 1Nr. 1 (1994 m. sausis) 12 netWorker 1558-3473 Tomas 1Nr. 1 (1997 m. kovas/balandis) ACM Digital Library – Hosted Content Elektroninio leidinio Pavadinimas ISSN Pradžios metai Prieiga iki Nr. 1 (kovas 1959 1 ALGOL Bulletin Netaikytina m.) COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Q2 Tomas 6 Nr. 1 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Q2 Computational (sausis-kovas LINGUISTICS 2 Linguistics Netaikytina 1980 m.) Q1 Tomas 1Nr. 1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Q1 Evolutionary (1993 m. COMPUTER SCIENCE, THEORY & METHODS Q1 3 Computation 1530-9304 pavasaris) Journal of Computing Tomas 6 Nr. 5 4 Sciences in Colleges 1937-4763 (gegužė 1991 m.) Journal of Usability Tomas 1Nr. 1 Yra. Neturi rodiklių 5 Studies Netaikytina (lapkritis 2005 m.) Tomas 1994 Nr. 1es (kovas 1994 6 Linux Journal Netaikytina m.) Tomas 4Nr. 4 COMPUTER SCIENCE, INFORMATION SYSTEMS Q2 Personal and (rugpjūtis 2000 TELECOMMUNICATIONS Q2 7 Ubiquitous Computing Netaikytina m.) Tomas 1Nr. 1 Yra. Neturi rodiklių Proceedings of the VLDB (rugpjūtis
Load more

Recommended publications
  • Daniel D. Garcia
    DANIEL D. GARCIA [email protected] http://www.cs.berkeley.edu/~ddgarcia/ 777 Soda Hall #1776 UC Berkeley Berkeley, CA 94720-1776 (510) 517-4041 ______________________________________________________ EDUCATION MASSACHUSETTS INSTITUTE OF TECHNOLOGY Cambridge, MA B.S. in Computer Science, 1990 B.S. in Electrical Engineering, 1990 UNIVERSITY OF CALIFORNIA, BERKELEY Berkeley, CA M.S. in Computer Science, 1995 Ph.D. in Computer Science, 2000. Area: computer graphics and scientific visualization. Brian Barsky, advisor. TEACHING AWARDS • Outstanding Graduate Student Instructor in Computer Science (1992) • Electrical Engineering and Computer Science Outstanding Graduate Student Instructor (1997) • Computer Science Division Diane S. McEntyre Award for Excellence in Teaching (2002) • Computer Science Division IT Faculty Award for Excellence in Undergraduate Teaching (2005) • UC Berkeley “Everyday Hero” Award (2005) • Highest “teaching effectiveness” rating for any EECS lower division instructor, ever (6.7, since tied) (2006) • CS10: The Beauty and Joy of Computing chosen as 1 of 5 national pilots for AP CS: Principles course (2010) • CS10: The Beauty and Joy of Computing chosen as a University of California Online Course Pilot (2011) • Association of Computing Machinery (ACM) Distinguished Educator (2012) • Top 5 Professors to Take Classes with at UC Berkeley, The Black Sheep Online (2013) • CS10 becomes first introductory computing class at UC Berkeley with > 50% women (2013,2014) • Ten Most Popular MOOCs Starting in September 2015 and January 2016, Class Central (2015, 2016) • LPFI's Lux Award for being “Tech Diversity Champion” (2015) • NCWIT’s Undergraduate Research Mentoring (URM) Award (2016) • NCWIT’s Extension Services Transformation Award, Honorable Mention (2016) • CS10 becomes first introductory computing class at UC Berkeley with > 60% women (2017) • SAP Visionary Member Award (2017) • Google CS4HS Ambassador (2017) • CS10 becomes first introductory computing class at UC Berkeley with > 65% women (2018) Updated through 2018-07-01 1 / 28 Daniel D.
    [Show full text]
  • The Abcs of Petri Net Reachability Relaxations
    The ABCs of Petri net reachability relaxations Michael Blondin, Universite´ de Sherbrooke, Canada Petri nets form a widespread model of concurrency well suited for the verification of systems with infinitely many configurations. Deciding configuration reachability in Petri nets, which plays a central role in their formal analysis, suffers from a nonelementary time complexity lower bound. We survey relaxations that alleviate this tremendous complexity, both for classical Petri nets and for extensions with affine transformations, branching rules and colored tokens. 1. INTRODUCTION Petri nets are a widespread formalism to model and analyze concurrent systems with possibly infinite configuration spaces over nonnegative counters, i.e. Nk. They offer a great tradeoff between graphical modeling and amenability to algorithmic analysis. In particular, they find applications ranging from program verification (e.g. [German and Sistla 1992; Kaiser et al. 2014; Atig et al. 2011; Delzanno et al. 2002]) to the for- mal analysis of chemical, biological and business processes (e.g. [Esparza et al. 2017; Heiner et al. 2008; van der Aalst 1998]). One of the central questions in Petri net the- ory consists in determining whether a given target configuration, typically an error of a system, is reachable from an initial configuration. This reachability problem, which we will shortly define formally, has been extensively studied over several decades. For a long time, the computational complexity of the problem lay between EXPSPACE- hardness [Lipton 1976] and decidability [Mayr 1981; Kosaraju 1982; Lambert 1992; Leroux 2012]. However, it was recently narrowed down between TOWER-hardness [Cz- erwinski´ et al. 2019], i.e. a tower of exponentials, and Ackermaniann time [Leroux and Schmitz 2019].
    [Show full text]
  • Adversarial Symbolic Execution for Detecting Concurrency-Related Cache Timing Leaks
    Adversarial Symbolic Execution for Detecting Concurrency-Related Cache Timing Leaks Shengjian Guo Meng Wu Chao Wang Virginia Tech Virginia Tech University of Southern California Blacksburg, VA, USA Blacksburg, VA, USA Los Angeles, CA, USA ABSTRACT The timing characteristics of cache, a high-speed storage between Program P Adversarial the fast CPU and the slow memory, may reveal sensitive information (Thread T1) Thread Schedule of a program, thus allowing an adversary to conduct side-channel attacks. Existing methods for detecting timing leaks either ignore Concurrent Pro- Symbolic Cache-timing ′′ SMT Solving cache all together or focus only on passive leaks generated by the gram P Execution Leakage program itself, without considering leaks that are made possible by concurrently running some other threads. In this work, we show Program P′ Adversarial Cache that timing-leak-freedom is not a compositional property: a program (Thread T2) Cache Modeling Configuration that is not leaky when running alone may become leaky when inter- leaved with other threads. Thus, we develop a new method, named Figure 1: Flow of our cache timing leak detector SymSC. adversarial symbolic execution, to detect such leaks. It systematically explores both the feasible program paths and their interleavings while modeling the cache, and leverages an SMT solver to decide if are caused by differences in the number and type of instructions there are timing leaks. We have implemented our method in LLVM executed along different paths: unless the differences are indepen- and evaluated it on a set of real-world ciphers with 14,455 lines of dent of the sensitive data, they may be exploited by an adversary.
    [Show full text]
  • SIGOPS Annual Report 2012
    SIGOPS Annual Report 2012 Fiscal Year July 2012-June 2013 Submitted by Jeanna Matthews, SIGOPS Chair Overview SIGOPS is a vibrant community of people with interests in “operatinG systems” in the broadest sense, includinG topics such as distributed computing, storaGe systems, security, concurrency, middleware, mobility, virtualization, networkinG, cloud computinG, datacenter software, and Internet services. We sponsor a number of top conferences, provide travel Grants to students, present yearly awards, disseminate information to members electronically, and collaborate with other SIGs on important programs for computing professionals. Officers It was the second year for officers: Jeanna Matthews (Clarkson University) as Chair, GeorGe Candea (EPFL) as Vice Chair, Dilma da Silva (Qualcomm) as Treasurer and Muli Ben-Yehuda (Technion) as Information Director. As has been typical, elected officers agreed to continue for a second and final two- year term beginning July 2013. Shan Lu (University of Wisconsin) will replace Muli Ben-Yehuda as Information Director as of AuGust 2013. Awards We have an excitinG new award to announce – the SIGOPS Dennis M. Ritchie Doctoral Dissertation Award. SIGOPS has lonG been lackinG a doctoral dissertation award, such as those offered by SIGCOMM, Eurosys, SIGPLAN, and SIGMOD. This new award fills this Gap and also honors the contributions to computer science that Dennis Ritchie made durinG his life. With this award, ACM SIGOPS will encouraGe the creativity that Ritchie embodied and provide a reminder of Ritchie's leGacy and what a difference a person can make in the field of software systems research. The award is funded by AT&T Research and Alcatel-Lucent Bell Labs, companies that both have a strong connection to AT&T Bell Laboratories where Dennis Ritchie did his seminal work.
    [Show full text]
  • 1 Employment 2 Education 3 Grants
    STEPHEN F. SIEGEL Curriculum Vitæ Department of Computer and Information Sciences email: [email protected] 101 Smith Hall web: http://vsl.cis.udel.edu/siegel.html University of Delaware tel: (302) 831{0083, fax: (302) 831{8458 Newark, DE 19716 skype: sfsiegel 1 Employment Associate Professor, Department of Computer and Information Sciences and Department of Math- ematical Sciences, University of Delaware, September 2012 to present Assistant Professor, Department of Computer and Information Sciences and Department of Math- ematical Sciences, University of Delaware, September 2006 to August 2012 Senior Research Scientist, Laboratory for Advanced Software Engineering Research, Department of Computer Science, University of Massachusetts Amherst, August 2001 to August 2006 Senior Software Engineer, Laboratory for Advanced Software Engineering Research, Department of Computer Science, University of Massachusetts Amherst, August 1998 to July 2001 Visiting Assistant Professor, Department of Mathematics, University of Massachusetts Amherst, September 1996 to August 1998 Visiting Assistant Professor, Department of Mathematics, Northwestern University, September 1993 to June 1996 2 Education Ph.D., Mathematics, University of Chicago, August 1993 (Advisor: Prof. Jonathan L. Alperin) M.Sc., Mathematics, Oxford University, June 1989 B.A., Mathematics, University of Chicago, June 1988 3 Grants Awarded • Principal Investigator, Subcontract 4000159498, Oak Ridge National Laboratory, Extend and Improve the CIVL Software Verification Platform. January 31, 2018 { September 30, 2020. Award amount: $245,963 (sole PI). Subcontract under Department of Energy award RAPIDS: A SciDAC Institute for Computer Science and Data. • Principal Investigator, Department of Energy Award DE-SC0012566, Program Verification for Extreme- Scale Applications, September 1, 2014 { August 31, 2018. Award amount: $510,000. (Sole PI) • Principal Investigator, National Science Foundation Award NSF CCF-1319571, SHF: Small: Con- tracts for Message-Passing Parallel Programs, September 1, 2013 { August 31, 2018.
    [Show full text]
  • ACM Education Board and Education Council FY2017-2018 Executive
    ACM Education Board and Education Council FY2017-2018 Executive Summary This report summarizes the activities of the ACM Education Board and the Education Council1 in FY 2017-18 and outlines priorities for the coming year. Major accomplishments for this past year include the following: Curricular Volumes: Joint Taskforce on Cybersecurity Education CC2020 Completed: Computer Engineering Curricular Guidelines 2016 (CE2016) Enterprise Information Technology Body of Knowledge (EITBOK) Information Technology 2017 (IT2017) Masters of Science in Information Systems 2016 (MSIS2016) International Efforts: Educational efforts in China Educational efforts in Europe/Informatics for All Taskforces and Other Projects: Retention taskforce Learning at Scale Informatics for All Committee International Education Taskforce Global Awareness Taskforce Data Science Taskforce Education Policy Committee NDC Study Activities and Engagements with ACM SIGs and Other Groups: CCECC Code.org CSTA 1 The ACM Education Council was re-named in fall 2018 to the ACM Education Advisory Committee. For historical accuracy, the EAC will be called the Education Council for this report. 1 SIGCAS SIGCHI SIGCSE SIGHPC SIGGRAPH SIGITE Other Items: Education Board Rotation Education Council Rotation Future Initiatives Global Awareness Taskforce International Education Framework Highlights This is a very short list of the many accomplishments of the year. For full view of the work to date, please see Section One: Summary of FY 2017-2018 Activities. Diversity Taskforce: The Taskforce expects to complete its work by early 2019. Their goals of Exploring the data challenges Identifying factors contributing to the leaky pipeline Recommending potential interventions to improve retention Learning at Scale: The Fifth Annual ACM Conference on Learning @ Scale (L@S) was held in London, UK on June 26-28, 2018.
    [Show full text]
  • Candidate for Chair Jeffrey K. Hollingsworth University Of
    Candidate for Chair Jeffrey K. Hollingsworth University of Maryland, College Park, MD, USA BIOGRAPHY Academic Background: Ph.D., University of Wisconsin, 1994, Computer Sciences. Professional Experience: Professor, University of Maryland, College Park, MD, 2006 – Present; Associate /Assistant Professor, University of Maryland, College Park, MD, 1994 – 2006; Visiting Scientist, IBM, TJ Watson Research Center, 2000 – 2001. Professional Interest: Parallel Computing; Performance Measurement Tools; Auto-tuning; Binary Instrumentation; Computer Security. ACM Activities: Vice Chair, SIGHPC, 2011 – Present; Member, ACM Committee on Future of SIGs, 2014 – 2015; General Chair, SC Conference, 2012; Steering Committee Member (and Chair '13), SC Conference, 2009 – 2014. Membership and Offices in Related Organizations: Editor in Chief, PARCO, 2009 – Present; Program Chair, IPDPS, 2016; Board Member, Computing Research Association (CRA), 2008 – 2010. Awards Received: IPDPS, Best Paper - Software, 2011; SC, Best Paper - Student lead Author, 2005; IPDPS, Best Paper - Software, 2000. STATEMENT There is a critical need for a strong SIGHPC. Until SIGHPC was founded five years ago, the members of the HPC community lacked a home within ACM. While the SC conference provides a nexus for HPC activity in the fall, we needed a full-time community. Now that the initial transition of the SC conference from SIGARCH to SIGHPC is nearly complete, the time is right to start considering what other meetings and activities SIGHPC should undertake. We need to carefully identify meetings to sponsor or co-sponsor. Also, SIGHPC needs to continue and expand its role as a voice for the HPC community. This includes mentoring young professionals, actively identifying and nominating members for society wide awards, and speaking for the HPC community within both the scientific community and society at large.
    [Show full text]
  • I. Personal Information (1/11/2021) I.A. UID, Last Name, First Name, Middle Name, Contact Information UID: 101001302 Last
    I. Personal Information (1/11/2021) I.A. UID, Last Name, First Name, Middle Name, Contact Information UID: 101001302 Last Name: Shneiderman First Name: Ben Mailing Address: Brendan Iribe Building, Dept. of Computer Science, University of Maryland, College Park, MD 20742 Email: [email protected] Personal URL: http://www.cs.umd.edu/~ben HCIL URL: http://www.cs.umd.edu/hcil Wikipedia: https://en.wikipedia.org/wiki/Ben_Shneiderman Google Scholar: https://scholar.google.com/citations?user=h4i4fh8AAAAJ&hl=en ORCID: orcid.org/0000-0002-8298-1097 I.B. Academic Appointments at UMD 2017- Emeritus Distinguished University Professor 2013- Distinguished University Professor 2013- Affiliate Professor, Glenn L. Martin Professor of Engineering 2005- Affiliate Professor, College of Information Studies 2005- Affiliate Professor, College of Engineering 1991- 2005 Member, Institute for Systems Research 1989- Professor, Department of Computer Science 1987- Member, Institute for Advanced Computer Studies 1980- 1989 Associate Professor, Department of Computer Science 1976- 1980 Assistant Professor, Department of Information Systems Management I.C. Administrative Appointments at UMD 1983- 2000 Founding Director, Human-Computer Interaction Lab, Institute for Advanced Computer Studies I.D. Other Employment 1973- 1976 Indiana University Assistant Professor, Department of Computer Science 1972- 1973 State University of NY Instructor, Department of Computer Science at Stony Brook 1968- 1972 State University of NY Instructor, Department of Data Processing at Farmingdale
    [Show full text]
  • SIGLOG: Special Interest Group on Logic and Computation a Proposal
    SIGLOG: Special Interest Group on Logic and Computation A Proposal Natarajan Shankar Computer Science Laboratory SRI International Menlo Park, CA Mar 21, 2014 SIGLOG: Executive Summary Logic is, and will continue to be, a central topic in computing. ACM has a core constituency with an interest in Logic and Computation (L&C), witnessed by 1 The many Turing Awards for work centrally in L&C 2 The ACM journal Transactions on Computational Logic 3 Several long-running conferences like LICS, CADE, CAV, ICLP, RTA, CSL, TACAS, and MFPS, and super-conferences like FLoC and ETAPS SIGLOG explores the connections between logic and computing covering theory, semantics, analysis, and synthesis. SIGLOG delivers value to its membership through the coordination of conferences, journals, newsletters, awards, and educational programs. SIGLOG enjoys significant synergies with several existing SIGs. Natarajan Shankar SIGLOG 2/9 Logic and Computation: Early Foundations Logicians like Alonzo Church, Kurt G¨odel, Alan Turing, John von Neumann, and Stephen Kleene have played a pioneering role in laying the foundation of computing. In the last 65 years, logic has become the calculus of computing underpinning the foundations of many diverse sub-fields. Natarajan Shankar SIGLOG 3/9 Logic and Computation: Turing Awardees Turing awardees for logic-related work include John McCarthy, Edsger Dijkstra, Dana Scott Michael Rabin, Tony Hoare Steve Cook, Robin Milner Amir Pnueli, Ed Clarke Allen Emerson Joseph Sifakis Leslie Lamport Natarajan Shankar SIGLOG 4/9 Interaction between SIGLOG and other SIGs Logic interacts in a significant way with AI (SIGAI), theory of computation (SIGACT), databases (SIGMOD) and knowledge bases (SIGKDD), programming languages (SIGPLAN), software engineering (SIGSOFT), computational biology (SIGBio), symbolic computing (SIGSAM), semantic web (SIGWEB), and hardware design (SIGDA and SIGARCH).
    [Show full text]
  • 2017 ALCF Operational Assessment Report
    ANL/ALCF-20/04 2017 Operational Assessment Report ARGONNE LEADERSHIP COMPUTING FACILITY On the cover: This visualization shows a small portion of a cosmology simulation tracing structure formation in the universe. The gold-colored clumps are high-density regions of dark matter that host galaxies in the real universe. This BorgCube simulation was carried out on Argonne National Laboratory’s Theta supercomputer as part of the Theta Early Science Program. Image: Joseph A. Insley, Silvio Rizzi, and the HACC team, Argonne National Laboratory Contents Executive Summary ................................................................................................ ES-1 Section 1. User Support Results .............................................................................. 1-1 ALCF Response ........................................................................................................................... 1-1 Survey Approach ................................................................................................................ 1-2 1.1 User Support Metrics .......................................................................................................... 1-3 1.2 Problem Resolution Metrics ............................................................................................... 1-4 1.3 User Support and Outreach ................................................................................................. 1-5 1.3.1 Tier 1 Support ........................................................................................................
    [Show full text]
  • Stephanie Weirich –
    Stephanie Weirich School of Engineering and Science, University of Pennsylvania Levine 510, 3330 Walnut St, Philadelphia, PA 19104 215-573-2821 • [email protected] July 13, 2021 Positions University of Pennsylvania Philadelphia, Pennsylvania ENIAC President’s Distinguished Professor September 2019-present Galois, Inc Portland, Oregon Visiting Scientist June 2018-August 2019 University of Pennsylvania Philadelphia, Pennsylvania Professor July 2015-August 2019 University of Pennsylvania Philadelphia, Pennsylvania Associate Professor July 2008-June 2015 University of Cambridge Cambridge, UK Visitor August 2009-July 2010 Microsoft Research Cambridge, UK Visiting Researcher September-November 2009 University of Pennsylvania Philadelphia, Pennsylvania Assistant Professor July 2002-July 2008 Cornell University Ithaca, New York Instructor, Research Assistant and Teaching AssistantAugust 1996-July 2002 Lucent Technologies Murray Hill, New Jersey Intern June-July 1999 Education Cornell University Ithaca, NY Ph.D., Computer Science 2002 Cornell University Ithaca, NY M.S., Computer Science 2000 Rice University Houston, TX B.A., Computer Science, magnum cum laude 1996 Honors ○␣ SIGPLAN Robin Milner Young Researcher award, 2016 ○␣ Most Influential ICFP 2006 Paper, awarded in 2016 ○␣ Microsoft Outstanding Collaborator, 2016 ○␣ Penn Engineering Fellow, University of Pennsylvania, 2014 ○␣ Institute for Defense Analyses Computer Science Study Panel, 2007 ○␣ National Science Foundation CAREER Award, 2003 ○␣ Intel Graduate Student Fellowship, 2000–2001
    [Show full text]
  • Shanlu › About › Cv › CV Shanlu.Pdf Shan Lu
    Shan Lu University of Chicago, Dept. of Computer Science Phone: +1-773-702-3184 5730 S. Ellis Ave., Rm 343 E-mail: [email protected] Chicago, IL 60637 USA Homepage: http://people.cs.uchicago.edu/~shanlu RESEARCH INTERESTS Tool support for improving the correctness and efficiency of large scale software systems EMPLOYMENT 2019 – present Professor, Dept. of Computer Science, University of Chicago 2014 – 2019 Associate Professor, Dept. of Computer Sciences, University of Chicago 2009 – 2014 Assistant Professor, Dept. of Computer Sciences, University of Wisconsin – Madison EDUCATION 2008 University of Illinois at Urbana-Champaign, Urbana, IL Ph.D. in Computer Science Thesis: Understanding, Detecting, and Exposing Concurrency Bugs (Advisor: Prof. Yuanyuan Zhou) 2003 University of Science & Technology of China, Hefei, China B.S. in Computer Science HONORS AND AWARDS 2019 ACM Distinguished Member Among 62 members world-wide recognized for outstanding contributions to the computing field 2015 Google Faculty Research Award 2014 Alfred P. Sloan Research Fellow Among 126 “early-career scholars (who) represent the most promising scientific researchers working today” 2013 Distinguished Alumni Educator Award Among 3 awardees selected by Department of Computer Science, University of Illinois 2010 NSF Career Award 2021 Honorable Mention Award @ CHI for paper [C71] (CHI 2021) 2019 Best Paper Award @ SOSP for paper [C62] (SOSP 2019) 2019 ACM SIGSOFT Distinguished Paper Award @ ICSE for paper [C58] (ICSE 2019) 2017 Google Scholar Classic Paper Award for
    [Show full text]