Charles A Sutton
Applied Filters
- Charles A Sutton
- AuthorRemove filter
People
Colleagues
- Andrew Kachites McCallum (13)
- Miltiadis Allamanis (9)
- David Bieber (4)
- Earl Barr (4)
- Jaroslav M. Fowkes (4)
- Andrew D Gordon (3)
- David Aspinall (3)
- Igor Muttik (3)
- Khashayar Rohanimanesh (3)
- M. I. Jordan (3)
- Mingjun Zhong (3)
- Nigel H Goddard (3)
- Pankajan Chanthirasegaran (3)
- Rafael Michael Karampatsis (3)
- Wei Chen (3)
- Yanlei Diao (3)
- Yichuan Zhang (3)
- Andrea A Janes (2)
- Andrew D Gordon (2)
Roles
Publication
Journal/Magazine Names
- The Journal of Machine Learning Research (3)
- Proceedings of the VLDB Endowment (2)
- ACM Computing Surveys (1)
- ACM Transactions on Modeling and Computer Simulation (1)
- ACM Transactions on Programming Languages and Systems (1)
- Foundations and Trends® in Machine Learning (1)
- IEEE Transactions on Software Engineering (1)
- Machine Language (1)
- Proceedings of the ACM on Programming Languages (1)
Proceedings/Book Names
- FSE 2014: Proceedings of the 22nd ACM SIGSOFT International Symposium on Foundations of Software Engineering (2)
- MSR '13: Proceedings of the 10th Working Conference on Mining Software Repositories (2)
- NIPS '20: Proceedings of the 34th International Conference on Neural Information Processing Systems (2)
- NIPS '21: Proceedings of the 35th International Conference on Neural Information Processing Systems (2)
- NIPS '23: Proceedings of the 37th International Conference on Neural Information Processing Systems (2)
- ACDC '09: Proceedings of the 1st workshop on Automated control for datacenters and clouds (1)
- ASONAM '19: Proceedings of the 2019 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (1)
- ESEC/FSE 2015: Proceedings of the 2015 10th Joint Meeting on Foundations of Software Engineering (1)
- EuroSec '16: Proceedings of the 9th European Workshop on System Security (1)
- FSE 2016: Proceedings of the 2016 24th ACM SIGSOFT International Symposium on Foundations of Software Engineering (1)
- ICML '04: Proceedings of the twenty-first international conference on Machine learning (1)
- ICML '07: Proceedings of the 24th international conference on Machine learning (1)
- ICSE '16: Proceedings of the 38th International Conference on Software Engineering Companion (1)
- ICSE '20: Proceedings of the ACM/IEEE 42nd International Conference on Software Engineering (1)
- JCDL '16: Proceedings of the 16th ACM/IEEE-CS on Joint Conference on Digital Libraries (1)
- KDD '08: Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining (1)
- KDD '16: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (1)
- KDD '18: Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining (1)
- WiSec '16: Proceedings of the 9th ACM Conference on Security & Privacy in Wireless and Mobile Networks (1)
- WWW '14: Proceedings of the 23rd international conference on World wide web (1)
Publisher
- Association for Computing Machinery (25)
- Curran Associates Inc. (10)
- JMLR.org (7)
- USENIX Association (4)
- AAAI Press (3)
- Association for Computational Linguistics (3)
- IEEE Press (3)
- MIT Press (3)
- AUAI Press (2)
- IEEE Computer Society (2)
- Springer-Verlag (2)
- VLDB Endowment (2)
- Kluwer Academic Publishers (1)
- Now Publishers Inc. (1)
- University of Massachusetts Amherst (1)
Publication Date
Export Citations
Publications
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-article
Learning semantic representations to verify hardware designs
- Shobha Vasudevan
Google Research, Brain Team
, - Wenjie Jiang
Google Research, Brain Team
, - David Bieber
Google Research, Brain Team
, - Rishabh Singh
Google X
, - Hamid Shojaei
Google
, - Richard Ho
Google
, - Charles Sutton
Google Research, Brain Team
NIPS '21: Proceedings of the 35th International Conference on Neural Information Processing Systems•December 2021, Article No.: 1799, pp 23491-23504Verification is a serious bottleneck in the industrial hardware design cycle, routinely requiring person-years of effort. Practical verification relies on a "best effort" process that simulates the design on test inputs. This suggests a new research ...
- 0Citation
MetricsTotal Citations0- 1
Supplementary Material3540261.3542060_supp.pdf
- Shobha Vasudevan
- research-article
A Bayesian-symbolic approach to reasoning and learning in intuitive physics
- Kai Xu
University of Edinburgh
, - Akash Srivastava
MIT-IBM Watson AI Lab
, - Dan Gutfreund
MIT-IBM Watson AI Lab
, - Felix A. Sosa
Harvard University
, - Tomer Ullman
Harvard University
, - Joshua B. Tenenbaum
Massachusetts Institute of Technology
, - Charles Sutton
University of Edinburgh & Google AI
NIPS '21: Proceedings of the 35th International Conference on Neural Information Processing Systems•December 2021, Article No.: 190, pp 2478-2490Humans can reason about intuitive physics in fully or partially observed environments even after being exposed to a very limited set of observations. This sample-efficient intuitive physical reasoning is considered a core domain of human common sense ...
- 0Citation
MetricsTotal Citations0- 1
Supplementary Material3540261.3540451_supp.pdf
- Kai Xu
- research-article
Training chain-of-thought via latent-variable inference
- Du Phan
Google
, - Matthew D. Hoffman
Google
, - David Dohan
Google
, - Sholto Douglas
Google
, - Tuan Anh Le
Google
, - Aaron Parisi
Google
, - Pavel Sountsov
Google
, - Charles Sutton
Google
, - Sharad Vikram
Google
, - Rif A. Saurous
Google
NIPS '23: Proceedings of the 37th International Conference on Neural Information Processing Systems•December 2023, Article No.: 3184, pp 72819-72841Large language models (LLMs) solve problems more accurately and interpretably when instructed to work out the answer step by step using a "chain-of-thought" (CoT) prompt. One can also improve LLMs' performance on a specific task by supervised fine-tuning,...
- 0Citation
MetricsTotal Citations0
- Du Phan
- research-article
LAMBDABEAM: neural program search with higher-order functions and lambdas
- Kensen Shi
Google DeepMind
, - Hanjun Dai
Google DeepMind
, - Wen-Ding Li
Cornell University
, - Kevin Ellis
Cornell University
, - Charles Sutton
Google DeepMind
NIPS '23: Proceedings of the 37th International Conference on Neural Information Processing Systems•December 2023, Article No.: 2234, pp 51327-51346Search is an important technique in program synthesis that allows for adaptive strategies such as focusing on particular search directions based on execution results. Several prior works have demonstrated that neural models are effective at guiding ...
- 0Citation
MetricsTotal Citations0
- Kensen Shi
- research-articlefree
PaLM: scaling language modeling with pathways
- Aakanksha Chowdhery
Google
, - Sharan Narang
Google
, - Jacob Devlin
Google
, - Maarten Bosma
Google
, - Gaurav Mishra
Google
, - Adam Roberts
Google
, - Paul Barham
Google
, - Hyung Won Chung
Google
, - Charles Sutton
Google
, - Sebastian Gehrmann
Google
, - Parker Schuh
Google
, - Kensen Shi
Google
, - Sashank Tsvyashchenko
Google
, - Joshua Maynez
Google
, - Abhishek Rao
Google
, - Parker Barnes
Google
, - Yi Tay
Google
, - Noam Shazeer
Google
, - Vinodkumar Prabhakaran
Google
, - Emily Reif
Google
, - Nan Du
Google
, - Ben Hutchinson
Google
, - Reiner Pope
Google
, - James Bradbury
Google
, - Jacob Austin
Google
, - Michael Isard
Google
, - Guy Gur-Ari
Google
, - Pengcheng Yin
Google
, - Toju Duke
Google
, - Anselm Levskaya
Google
, - Sanjay Ghemawat
Google
, - Sunipa Dev
Google
, - Henryk Michalewski
Google
, - Xavier Garcia
Google
, - Vedant Misra
Google
, - Kevin Robinson
Google
, - Liam Fedus
Google
, - Denny Zhou
Google
, - Daphne Ippolito
Google
, - David Luan
Google
, - Hyeontaek Lim
Google
, - Barret Zoph
Google
, - Alexander Spiridonov
Google
, - Ryan Sepassi
Google
, - David Dohan
Google
, - Shivani Agrawal
Google
, - Mark Omernick
Google
, - Andrew M. Dai
Google
, - Thanumalayan Sankaranarayana Pillai
Google
, - Marie Pellat
Google
, - Aitor Lewkowycz
Google
, - Erica Moreira
Google
, - Rewon Child
Google
, - Oleksandr Polozov
Google
, - Katherine Lee
Google
, - Zongwei Zhou
Google
, - Xuezhi Wang
Google
, - Brennan Saeta
Google
, - Mark Diaz
Google
, - Orhan Firat
Google
, - Michele Catasta
Google
, - Jason Wei
Google
, - Kathy Meier-Hellstern
Google
, - Douglas Eck
Google
, - Jeff Dean
Google
, - Slav Petrov
Google
, - Noah Fiedel
Google
Large language models have been shown to achieve remarkable performance across a variety of natural language tasks using few-shot learning, which drastically reduces the number of task-specific training examples needed to adapt the model to a particular ...
- 0Citation
- 263
- Downloads
MetricsTotal Citations0Total Downloads263Last 12 Months263Last 6 weeks74
- Aakanksha Chowdhery
- research-article
Can large language models reason about program invariants?
- Kexin Pei
Columbia University and Google Research, Brain Team
, - David Bieber
Google Research, Brain Team
, - Kensen Shi
Google Research, Brain Team
, - Charles Sutton
Google Research, Brain Team
, - Pengcheng Yin
Google Research, Brain Team
ICML'23: Proceedings of the 40th International Conference on Machine Learning•July 2023, Article No.: 1144, pp 27496-27520Identifying invariants is an important program analysis task with applications towards program understanding, bug finding, vulnerability analysis, and formal verification. Existing tools for identifying program invariants rely on dynamic analysis, ...
- 1Citation
MetricsTotal Citations1
- Kexin Pei
- research-articleOpen AccessPublished By ACMPublished By ACM
Conditional Independence by Typing
- Maria I. Gorinova
University of Edinburgh, Edinburgh, United Kingdom
, - Andrew D. Gordon
Microsoft Research and University of Edinburgh, Cambridge, United Kingdom
, - Charles Sutton
University of Edinburgh, Edinburgh, United Kingdom
, - Matthijs Vákár
Utrecht University, Utrecht, Netherlands
ACM Transactions on Programming Languages and Systems, Volume 44, Issue 1•March 2022, Article No.: 4, pp 1-54 • https://doi.org/10.1145/3490421A central goal of probabilistic programming languages (PPLs) is to separate modelling from inference. However, this goal is hard to achieve in practice. Users are often forced to re-write their models to improve efficiency of inference or meet ...
- 5Citation
- 1,732
- Downloads
MetricsTotal Citations5Total Downloads1,732Last 12 Months737Last 6 weeks50
- Maria I. Gorinova
- research-articlefree
Learning discrete energy-based models via auxiliary-variable local exploration
- Hanjun Dai
Google Research, Brain Team
, - Rishabh Singh
Google Research, Brain Team
, - Bo Dai
Google Research, Brain Team
, - Charles Sutton
Google Research, Brain Team
, - Dale Schuurmans
Google Research, Brain Team
NIPS '20: Proceedings of the 34th International Conference on Neural Information Processing Systems•December 2020, Article No.: 876, pp 10443-10455Discrete structures play an important role in applications like program language modeling and software engineering. Current approaches to predicting complex structures typically consider autoregressive models for their tractability, with some sacrifice ...
- 0Citation
- 35
- Downloads
MetricsTotal Citations0Total Downloads35Last 12 Months21Last 6 weeks3- 1
Supplementary Material3495724.3496600_supp.pdf
- Hanjun Dai
- research-articlefree
Learning to execute programs with instruction pointer attention graph neural networks
- David Bieber
Google
, - Charles Sutton
Google
, - Hugo Larochelle
Google
, - Daniel Tarlow
Google
NIPS '20: Proceedings of the 34th International Conference on Neural Information Processing Systems•December 2020, Article No.: 723, pp 8626-8637Graph neural networks (GNNs) have emerged as a powerful tool for learning software engineering tasks including code completion, bug finding, and program repair. They benefit from leveraging program structure like control flow graphs, but they are not ...
- 1Citation
- 31
- Downloads
MetricsTotal Citations1Total Downloads31Last 12 Months22Last 6 weeks8- 1
Supplementary Material3495724.3496447_supp.pdf
- David Bieber
- posterPublished By ACMPublished By ACM
Open-vocabulary models for source code
- Rafael-Michael Karampatsis
University of Edinburgh, Edinburgh, United Kingdom
, - Hlib Babii
Free University of Bozen-Bolzano, Bozen-Bolzano, Italy
, - Romain Robbes
Free University of Bozen-Bolzano, Bozen-Bolzano, Italy
, - Charles Sutton
University of Edinburgh
, - Andrea Janes
Free University of Bozen-Bolzano, Bozen-Bolzano, Italy
ICSE '20: Proceedings of the ACM/IEEE 42nd International Conference on Software Engineering: Companion Proceedings•June 2020, pp 294-295• https://doi.org/10.1145/3377812.3390806Statistical language modeling techniques have successfully been applied to large source code corpora, yielding a variety of new software development tools, such as tools for code suggestion, improving readability, and API migration. A major issue with ...
- 3Citation
- 96
- Downloads
MetricsTotal Citations3Total Downloads96Last 12 Months8
- Rafael-Michael Karampatsis
- research-articleOpen AccessPublished By ACMPublished By ACM
Big code != big vocabulary: open-vocabulary models for source code
- Rafael-Michael Karampatsis
University of Edinburgh, Edinburgh, United Kingdom
, - Hlib Babii
Free University of Bozen-Bolzano, Bozen-Bolzano, Italy
, - Romain Robbes
Free University of Bozen-Bolzano, Bozen-Bolzano, Italy
, - Charles Sutton
Google Research and University of Edinburgh
, - Andrea Janes
Free University of Bozen-Bolzano, Bozen-Bolzano, Italy
ICSE '20: Proceedings of the ACM/IEEE 42nd International Conference on Software Engineering•June 2020, pp 1073-1085• https://doi.org/10.1145/3377811.3380342Statistical language modeling techniques have successfully been applied to large source code corpora, yielding a variety of new software development tools, such as tools for code suggestion, improving readability, and API migration. A major issue with ...
- 119Citation
- 2,109
- Downloads
MetricsTotal Citations119Total Downloads2,109Last 12 Months533Last 6 weeks51
- Rafael-Michael Karampatsis
- short-paperOpen AccessPublished By ACMPublished By ACM
Learning to Fix Build Errors with Graph2Diff Neural Networks
- Daniel Tarlow
Google
, - Subhodeep Moitra
Google
, - Andrew Rice
University of Cambridge & Google
, - Zimin Chen
KTH Royal Institute of Technology and Google
, - Pierre-Antoine Manzagol
Google
, - Charles Sutton
Google
, - Edward Aftandilian
Google
ICSEW'20: Proceedings of the IEEE/ACM 42nd International Conference on Software Engineering Workshops•June 2020, pp 19-20• https://doi.org/10.1145/3387940.3392181- 23Citation
- 1,353
- Downloads
MetricsTotal Citations23Total Downloads1,353Last 12 Months344Last 6 weeks26
- Daniel Tarlow
- short-paperOpen AccessPublished By ACMPublished By ACM
How Often Do Single-Statement Bugs Occur?: The ManySStuBs4J Dataset
- Rafael-Michael Karampatsis
University of Edinburgh, Edinburgh, United Kingdom
, - Charles Sutton
Google Research, University of Edinburgh and The Alan, Turing Institute, Mountain View, CA, United States
MSR '20: Proceedings of the 17th International Conference on Mining Software Repositories•June 2020, pp 573-577• https://doi.org/10.1145/3379597.3387491Program repair is an important but difficult software engineering problem. One way to achieve acceptable performance is to focus on classes of simple bugs, such as bugs with single statement fixes, or that match a small set of bug templates. However, it ...
- 69Citation
- 1,295
- Downloads
MetricsTotal Citations69Total Downloads1,295Last 12 Months394Last 6 weeks31
- Rafael-Michael Karampatsis
- short-paperOpen AccessPublished By ACMPublished By ACM
Where should I comment my code?: a dataset and model for predicting locations that need comments
- Annie Louis
University of Edinburgh
, - Santanu Kumar Dash
University of Surrey
, - Earl T. Barr
University College London
, - Michael D. Ernst
University of Washington
, - Charles Sutton
Google Research
ICSE-NIER '20: Proceedings of the ACM/IEEE 42nd International Conference on Software Engineering: New Ideas and Emerging Results•June 2020, pp 21-24• https://doi.org/10.1145/3377816.3381736Programmers should write code comments, but not on every line of code. We have created a machine learning model that suggests locations where a programmer should write a code comment. We trained it on existing commented code to learn locations that are ...
- 3Citation
- 656
- Downloads
MetricsTotal Citations3Total Downloads656Last 12 Months127Last 6 weeks17
- Annie Louis
- research-articlefree
Incremental sampling without replacement for sequence models
- Kensen Shi
Google
, - David Bieber
Google
, - Charles Sutton
Google
ICML'20: Proceedings of the 37th International Conference on Machine Learning•July 2020, Article No.: 815, pp 8785-8795Sampling is a fundamental technique, and sampling without replacement is often desirable when duplicate samples are not beneficial. Within machine learning, sampling is useful for generating diverse outputs from a trained model. We present an elegant ...
- 0Citation
- 25
- Downloads
MetricsTotal Citations0Total Downloads25Last 12 Months18Last 6 weeks7- 1
Supplementary Material3524938.3525753_supp.pdf
- Kensen Shi
- research-articlePublished By ACMPublished By ACM
GEMSEC: graph embedding with self clustering
- Benedek Rozemberczki
The University of Edinburgh
, - Ryan Davies
The University of Edinburgh
, - Rik Sarkar
The University of Edinburgh
, - Charles Sutton
The University of Edinburgh
ASONAM '19: Proceedings of the 2019 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining•August 2019, pp 65-72• https://doi.org/10.1145/3341161.3342890Modern graph embedding procedures can efficiently process graphs with millions of nodes. In this paper, we propose GEMSEC - a graph embedding algorithm which learns a clustering of the nodes simultaneously with computing their embedding. GEMSEC is a ...
- 175Citation
- 1,279
- Downloads
MetricsTotal Citations175Total Downloads1,279Last 12 Months160Last 6 weeks9
- Benedek Rozemberczki
- Article
Learning semantic annotations for tabular data
- Jiaoyan Chen
Department of Computer Science, University of Oxford, UK
, - Ernesto Jiménez-Ruiz
The Alan Turing Institute, London, UK and Department of Informatics, University of Oslo, Norway
, - Ian Horrocks
Department of Computer Science, University of Oxford, UK and The Alan Turing Institute, London, UK
, - Charles Sutton
The Alan Turing Institute, London, UK and School of Informatics, The University of Edinburgh, UK
IJCAI'19: Proceedings of the 28th International Joint Conference on Artificial Intelligence•August 2019, pp 2088-2094The usefulness of tabular data such as web tables critically depends on understanding their semantics. This study focuses on column type prediction for tables without any meta data. Unlike traditional lexical matching-based methods, we propose a deep ...
- 3Citation
MetricsTotal Citations3
- Jiaoyan Chen
- research-articlefree
ColNet: embedding the semantics of web tables for column type prediction
- Jiaoyan Chen
Department of Computer Science, University of Oxford, UK
, - Ernesto Jiménez-Ruiz
The Alan Turing Institute, London, UK and Department of Informatics, University of Oslo, Norway
, - Ian Horrocks
Department of Computer Science, University of Oxford, UK and The Alan Turing Institute, London, UK
, - Charles Sutton
The Alan Turing Institute, London, UK and School of Informatics, The University of Edinburgh, UK
AAAI'19/IAAI'19/EAAI'19: Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence and Thirty-First Innovative Applications of Artificial Intelligence Conference and Ninth AAAI Symposium on Educational Advances in Artificial Intelligence•January 2019, Article No.: 4, pp 29-36• https://doi.org/10.1609/aaai.v33i01.330129Automatically annotating column types with knowledge base (KB) concepts is a critical task to gain a basic understanding of web tables. Current methods rely on either table metadata like column name or entity correspondences of cells in the KB, and may ...
- 16Citation
- 59
- Downloads
MetricsTotal Citations16Total Downloads59Last 12 Months45Last 6 weeks13
- Jiaoyan Chen
- research-articleOpen AccessPublished By ACMPublished By ACM
Probabilistic programming with densities in SlicStan: efficient, flexible, and deterministic
- Maria I. Gorinova
University of Edinburgh, UK
, - Andrew D. Gordon
Microsoft Research, UK / University of Edinburgh, UK
, - Charles Sutton
Google Brain, USA / University of Edinburgh, UK
Proceedings of the ACM on Programming Languages, Volume 3, Issue POPL•January 2019, Article No.: 35, pp 1-30 • https://doi.org/10.1145/3290348Stan is a probabilistic programming language that has been increasingly used for real-world scalable projects. However, to make practical inference possible, the language sacrifices some of its usability by adopting a block syntax, which lacks ...
- 8Citation
- 1,151
- Downloads
MetricsTotal Citations8Total Downloads1,151Last 12 Months96Last 6 weeks9- 1
Supplementary Materiala35-gorinova.webm
- Maria I. Gorinova
- Articlefree
HOUDINI: lifelong learning as program synthesis
- Lazar Valkov
University of Edinburgh
, - Dipak Chaudhari
Rice University
, - Akash Srivastava
University of Edinburgh
, - Charles Sutton
University of Edinburgh, The Alan Turing Institute, and Google Brain
, - Swarat Chaudhuri
Rice University
NIPS'18: Proceedings of the 32nd International Conference on Neural Information Processing Systems•December 2018, pp 8701-8712We present a neurosymbolic framework for the lifelong learning of algorithmic tasks that mix perception and procedural reasoning. Reusing high-level concepts across domains and learning complex procedures are key challenges in lifelong learning. We show ...
- 1Citation
- 165
- Downloads
MetricsTotal Citations1Total Downloads165Last 12 Months54Last 6 weeks14
- Lazar Valkov
Author Profile Pages
- Description: The Author Profile Page initially collects all the professional information known about authors from the publications record as known by the ACM bibliographic database, the Guide. Coverage of ACM publications is comprehensive from the 1950's. Coverage of other publishers generally starts in the mid 1980's. The Author Profile Page supplies a quick snapshot of an author's contribution to the field and some rudimentary measures of influence upon it. Over time, the contents of the Author Profile page may expand at the direction of the community.
Please see the following 2007 Turing Award winners' profiles as examples: - History: Disambiguation of author names is of course required for precise identification of all the works, and only those works, by a unique individual. Of equal importance to ACM, author name normalization is also one critical prerequisite to building accurate citation and download statistics. For the past several years, ACM has worked to normalize author names, expand reference capture, and gather detailed usage statistics, all intended to provide the community with a robust set of publication metrics. The Author Profile Pages reveal the first result of these efforts.
- Normalization: ACM uses normalization algorithms to weigh several types of evidence for merging and splitting names.
These include:- co-authors: if we have two names and cannot disambiguate them based on name alone, then we see if they have a co-author in common. If so, this weighs towards the two names being the same person.
- affiliations: names in common with same affiliation weighs toward the two names being the same person.
- publication title: names in common whose works are published in same journal weighs toward the two names being the same person.
- keywords: names in common whose works address the same subject matter as determined from title and keywords, weigh toward being the same person.
The more conservative the merging algorithms, the more bits of evidence are required before a merge is made, resulting in greater precision but lower recall of works for a given Author Profile. Many bibliographic records have only author initials. Many names lack affiliations. With very common family names, typical in Asia, more liberal algorithms result in mistaken merges.
Automatic normalization of author names is not exact. Hence it is clear that manual intervention based on human knowledge is required to perfect algorithmic results. ACM is meeting this challenge, continuing to work to improve the automated merges by tweaking the weighting of the evidence in light of experience.
- Bibliometrics: In 1926, Alfred Lotka formulated his power law (known as Lotka's Law) describing the frequency of publication by authors in a given field. According to this bibliometric law of scientific productivity, only a very small percentage (~6%) of authors in a field will produce more than 10 articles while the majority (perhaps 60%) will have but a single article published. With ACM's first cut at author name normalization in place, the distribution of our authors with 1, 2, 3..n publications does not match Lotka's Law precisely, but neither is the distribution curve far off. For a definition of ACM's first set of publication statistics, see Bibliometrics
- Future Direction:
The initial release of the Author Edit Screen is open to anyone in the community with an ACM account, but it is limited to personal information. An author's photograph, a Home Page URL, and an email may be added, deleted or edited. Changes are reviewed before they are made available on the live site.
ACM will expand this edit facility to accommodate more types of data and facilitate ease of community participation with appropriate safeguards. In particular, authors or members of the community will be able to indicate works in their profile that do not belong there and merge others that do belong but are currently missing.
A direct search interface for Author Profiles will be built.
An institutional view of works emerging from their faculty and researchers will be provided along with a relevant set of metrics.
It is possible, too, that the Author Profile page may evolve to allow interested authors to upload unpublished professional materials to an area available for search and free educational use, but distinct from the ACM Digital Library proper. It is hard to predict what shape such an area for user-generated content may take, but it carries interesting potential for input from the community.
Bibliometrics
The ACM DL is a comprehensive repository of publications from the entire field of computing.
It is ACM's intention to make the derivation of any publication statistics it generates clear to the user.
- Average citations per article = The total Citation Count divided by the total Publication Count.
- Citation Count = cumulative total number of times all authored works by this author were cited by other works within ACM's bibliographic database. Almost all reference lists in articles published by ACM have been captured. References lists from other publishers are less well-represented in the database. Unresolved references are not included in the Citation Count. The Citation Count is citations TO any type of work, but the references counted are only FROM journal and proceedings articles. Reference lists from books, dissertations, and technical reports have not generally been captured in the database. (Citation Counts for individual works are displayed with the individual record listed on the Author Page.)
- Publication Count = all works of any genre within the universe of ACM's bibliographic database of computing literature of which this person was an author. Works where the person has role as editor, advisor, chair, etc. are listed on the page but are not part of the Publication Count.
- Publication Years = the span from the earliest year of publication on a work by this author to the most recent year of publication of a work by this author captured within the ACM bibliographic database of computing literature (The ACM Guide to Computing Literature, also known as "the Guide".
- Available for download = the total number of works by this author whose full texts may be downloaded from an ACM full-text article server. Downloads from external full-text sources linked to from within the ACM bibliographic space are not counted as 'available for download'.
- Average downloads per article = The total number of cumulative downloads divided by the number of articles (including multimedia objects) available for download from ACM's servers.
- Downloads (cumulative) = The cumulative number of times all works by this author have been downloaded from an ACM full-text article server since the downloads were first counted in May 2003. The counts displayed are updated monthly and are therefore 0-31 days behind the current date. Robotic activity is scrubbed from the download statistics.
- Downloads (12 months) = The cumulative number of times all works by this author have been downloaded from an ACM full-text article server over the last 12-month period for which statistics are available. The counts displayed are usually 1-2 weeks behind the current date. (12-month download counts for individual works are displayed with the individual record.)
- Downloads (6 weeks) = The cumulative number of times all works by this author have been downloaded from an ACM full-text article server over the last 6-week period for which statistics are available. The counts displayed are usually 1-2 weeks behind the current date. (6-week download counts for individual works are displayed with the individual record.)
ACM Author-Izer Service
Summary Description
ACM Author-Izer is a unique service that enables ACM authors to generate and post links on both their homepage and institutional repository for visitors to download the definitive version of their articles from the ACM Digital Library at no charge.
Downloads from these sites are captured in official ACM statistics, improving the accuracy of usage and impact measurements. Consistently linking to definitive version of ACM articles should reduce user confusion over article versioning.
ACM Author-Izer also extends ACM’s reputation as an innovative “Green Path” publisher, making ACM one of the first publishers of scholarly works to offer this model to its authors.
To access ACM Author-Izer, authors need to establish a free ACM web account. Should authors change institutions or sites, they can utilize the new ACM service to disable old links and re-authorize new links for free downloads from a different site.
How ACM Author-Izer Works
Authors may post ACM Author-Izer links in their own bibliographies maintained on their website and their own institution’s repository. The links take visitors to your page directly to the definitive version of individual articles inside the ACM Digital Library to download these articles for free.
The Service can be applied to all the articles you have ever published with ACM.
Depending on your previous activities within the ACM DL, you may need to take up to three steps to use ACM Author-Izer.
For authors who do not have a free ACM Web Account:
- Go to the ACM DL http://dl.acm.org/ and click SIGN UP. Once your account is established, proceed to next step.
For authors who have an ACM web account, but have not edited their ACM Author Profile page:
- Sign in to your ACM web account and go to your Author Profile page. Click "Add personal information" and add photograph, homepage address, etc. Click ADD AUTHOR INFORMATION to submit change. Once you receive email notification that your changes were accepted, you may utilize ACM Author-izer.
For authors who have an account and have already edited their Profile Page:
- Sign in to your ACM web account, go to your Author Profile page in the Digital Library, look for the ACM Author-izer link below each ACM published article, and begin the authorization process. If you have published many ACM articles, you may find a batch Authorization process useful. It is labeled: "Export as: ACM Author-Izer Service"
ACM Author-Izer also provides code snippets for authors to display download and citation statistics for each “authorized” article on their personal pages. Downloads from these pages are captured in official ACM statistics, improving the accuracy of usage and impact measurements. Consistently linking to the definitive version of ACM articles should reduce user confusion over article versioning.
Note: You still retain the right to post your author-prepared preprint versions on your home pages and in your institutional repositories with DOI pointers to the definitive version permanently maintained in the ACM Digital Library. But any download of your preprint versions will not be counted in ACM usage statistics. If you use these AUTHOR-IZER links instead, usage by visitors to your page will be recorded in the ACM Digital Library and displayed on your page.
FAQ
- Q. What is ACM Author-Izer?
A. ACM Author-Izer is a unique, link-based, self-archiving service that enables ACM authors to generate and post links on either their home page or institutional repository for visitors to download the definitive version of their articles for free.
- Q. What articles are eligible for ACM Author-Izer?
- A. ACM Author-Izer can be applied to all the articles authors have ever published with ACM. It is also available to authors who will have articles published in ACM publications in the future.
- Q. Are there any restrictions on authors to use this service?
- A. No. An author does not need to subscribe to the ACM Digital Library nor even be a member of ACM.
- Q. What are the requirements to use this service?
- A. To access ACM Author-Izer, authors need to have a free ACM web account, must have an ACM Author Profile page in the Digital Library, and must take ownership of their Author Profile page.
- Q. What is an ACM Author Profile Page?
- A. The Author Profile Page initially collects all the professional information known about authors from the publications record as known by the ACM Digital Library. The Author Profile Page supplies a quick snapshot of an author's contribution to the field and some rudimentary measures of influence upon it. Over time, the contents of the Author Profile page may expand at the direction of the community. Please visit the ACM Author Profile documentation page for more background information on these pages.
- Q. How do I find my Author Profile page and take ownership?
- A. You will need to take the following steps:
- Create a free ACM Web Account
- Sign-In to the ACM Digital Library
- Find your Author Profile Page by searching the ACM Digital Library for your name
- Find the result you authored (where your author name is a clickable link)
- Click on your name to go to the Author Profile Page
- Click the "Add Personal Information" link on the Author Profile Page
- Wait for ACM review and approval; generally less than 24 hours
- Q. Why does my photo not appear?
- A. Make sure that the image you submit is in .jpg or .gif format and that the file name does not contain special characters
- Q. What if I cannot find the Add Personal Information function on my author page?
- A. The ACM account linked to your profile page is different than the one you are logged into. Please logout and login to the account associated with your Author Profile Page.
- Q. What happens if an author changes the location of his bibliography or moves to a new institution?
- A. Should authors change institutions or sites, they can utilize ACM Author-Izer to disable old links and re-authorize new links for free downloads from a new location.
- Q. What happens if an author provides a URL that redirects to the author’s personal bibliography page?
- A. The service will not provide a free download from the ACM Digital Library. Instead the person who uses that link will simply go to the Citation Page for that article in the ACM Digital Library where the article may be accessed under the usual subscription rules.
However, if the author provides the target page URL, any link that redirects to that target page will enable a free download from the Service.
- Q. What happens if the author’s bibliography lives on a page with several aliases?
- A. Only one alias will work, whichever one is registered as the page containing the author’s bibliography. ACM has no technical solution to this problem at this time.
- Q. Why should authors use ACM Author-Izer?
- A. ACM Author-Izer lets visitors to authors’ personal home pages download articles for no charge from the ACM Digital Library. It allows authors to dynamically display real-time download and citation statistics for each “authorized” article on their personal site.
- Q. Does ACM Author-Izer provide benefits for authors?
- A. Downloads of definitive articles via Author-Izer links on the authors’ personal web page are captured in official ACM statistics to more accurately reflect usage and impact measurements.
Authors who do not use ACM Author-Izer links will not have downloads from their local, personal bibliographies counted. They do, however, retain the existing right to post author-prepared preprint versions on their home pages or institutional repositories with DOI pointers to the definitive version permanently maintained in the ACM Digital Library.
- Q. How does ACM Author-Izer benefit the computing community?
- A. ACM Author-Izer expands the visibility and dissemination of the definitive version of ACM articles. It is based on ACM’s strong belief that the computing community should have the widest possible access to the definitive versions of scholarly literature. By linking authors’ personal bibliography with the ACM Digital Library, user confusion over article versioning should be reduced over time.
In making ACM Author-Izer a free service to both authors and visitors to their websites, ACM is emphasizing its continuing commitment to the interests of its authors and to the computing community in ways that are consistent with its existing subscription-based access model.
- Q. Why can’t I find my most recent publication in my ACM Author Profile Page?
- A. There is a time delay between publication and the process which associates that publication with an Author Profile Page. Right now, that process usually takes 4-8 weeks.
- Q. How does ACM Author-Izer expand ACM’s “Green Path” Access Policies?
- A. ACM Author-Izer extends the rights and permissions that authors retain even after copyright transfer to ACM, which has been among the “greenest” publishers. ACM enables its author community to retain a wide range of rights related to copyright and reuse of materials. They include:
- Posting rights that ensure free access to their work outside the ACM Digital Library and print publications
- Rights to reuse any portion of their work in new works that they may create
- Copyright to artistic images in ACM’s graphics-oriented publications that authors may want to exploit in commercial contexts
- All patent rights, which remain with the original owner