Michael Benisch
Applied Filters
- Michael Benisch
- AuthorRemove filter
People
Colleagues
- Michael Benisch (25)
- N. Sadeh (18)
- James Andrews (6)
- Alberto Sardinha (5)
- Patrick Gauge Kelley (5)
- Tuomas Sandholm (5)
- Ramprasad Ravichandran (4)
- Amy Rachel Greenwald (3)
- George Noel Davis (3)
- Lorrie Faith Cranor (3)
- Michael Carl Tschantz (3)
- Victor Naroditskiy (3)
- Ioanna Grypari (2)
- Jürgen Mellinger (2)
- Jialiu Lin (2)
- Martin Bogdan (2)
- Niels Birbaumer (2)
- Roger Lederman (2)
- Wolfgang Rosenstiel (2)
- Vassilis Kostakos (1)
Publication
Proceedings/Book Names
- ICEC '06: Proceedings of the 8th international conference on Electronic commerce: The new e-commerce: innovations for conquering current barriers, obstacles and limitations to conducting successful business on the internet (2)
- SOUPS '09: Proceedings of the 5th Symposium on Usable Privacy and Security (2)
- AAAI'06: Proceedings of the 21st national conference on Artificial intelligence - Volume 1 (1)
- AAAI'08: Proceedings of the 23rd national conference on Artificial intelligence - Volume 1 (1)
- AAMAS '04: Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 3 (1)
- AAMAS '06: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (1)
- AAMAS '07: Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems (1)
- AMEC'07/TADA'07: Proceedings of the 9th International Conference on Agent-Mediated Electronic Commerce and Trading Agent Design and Analysis (1)
- CHI '11: Proceedings of the SIGCHI Conference on Human Factors in Computing Systems (1)
- EC '04: Proceedings of the 5th ACM conference on Electronic commerce (1)
- IJCAI'09: Proceedings of the 21st International Joint Conference on Artificial Intelligence (1)
- INTERACT'11: Proceedings of the 13th IFIP TC 13 international conference on Human-computer interaction - Volume Part I (1)
- PETS '09: Proceedings of the 9th International Symposium on Privacy Enhancing Technologies (1)
- TADA/AMEC'06: Proceedings of the 2006 AAMAS workshop and TADA/AMEC 2006 conference on Agent-mediated electronic commerce: automated negotiation and strategy design for electronic markets (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.
- article
A comparative study of location-sharing privacy preferences in the United States and China
- Jialiu Lin
School of Computer Science, Carnegie Mellon University, Pittsburgh, USA
, - Michael Benisch
School of Computer Science, Carnegie Mellon University, Pittsburgh, USA
, - Norman Sadeh
School of Computer Science, Carnegie Mellon University, Pittsburgh, USA
, - Jianwei Niu
School of Computer Science and Engineering, Beihang University, Beihang, China
, - Jason Hong
School of Computer Science, Carnegie Mellon University, Pittsburgh, USA
, - Banghui Lu
School of Computer Science and Engineering, Beihang University, Beihang, China
, - Shaohui Guo
School of Computer Science, Carnegie Mellon University, Pittsburgh, USA
Personal and Ubiquitous Computing, Volume 17, Issue 4•April 2013, pp 697-711 • https://doi.org/10.1007/s00779-012-0610-6While prior studies have provided us with an initial understanding of people's location-sharing privacy preferences, they have been limited to Western countries and have not investigated the impact of the granularity of location disclosures on people's ...
- 9Citation
- 323
- Downloads
MetricsTotal Citations9Total Downloads323
- Jialiu Lin
- article
Capturing location-privacy preferences: quantifying accuracy and user-burden tradeoffs
- Michael Benisch
School of Computer Science, Carnegie Mellon University, Pittsburgh, USA 15213
, - Patrick Gage Kelley
School of Computer Science, Carnegie Mellon University, Pittsburgh, USA 15213
, - Norman Sadeh
School of Computer Science, Carnegie Mellon University, Pittsburgh, USA 15213
, - Lorrie Faith Cranor
School of Computer Science, Carnegie Mellon University, Pittsburgh, USA 15213
Personal and Ubiquitous Computing, Volume 15, Issue 7•October 2011, pp 679-694 • https://doi.org/10.1007/s00779-010-0346-0We present a 3-week user study in which we tracked the locations of 27 subjects and asked them to rate when, where, and with whom they would have been comfortable sharing their locations. The results of analysis conducted on over 7,500 h of data suggest ...
- 49Citation
- 296
- Downloads
MetricsTotal Citations49Total Downloads296
- Michael Benisch
- Article
Improving users' consistency when recalling location sharing preferences
- Jayant Venkatanathan
Madeira Interactive Technologies Institute, University of Madeira
, - Denzil Ferreira
Madeira Interactive Technologies Institute, University of Madeira
, - Michael Benisch
School of Computer Science, Carnegie Mellon University
, - Jialiu Lin
School of Computer Science, Carnegie Mellon University
, - Evangelos Karapanos
Madeira Interactive Technologies Institute, University of Madeira
, - Vassilis Kostakos
Madeira Interactive Technologies Institute, University of Madeira
, - Norman Sadeh
School of Computer Science, Carnegie Mellon University
, - Eran Toch
School of Computer Science, Carnegie Mellon University
INTERACT'11: Proceedings of the 13th IFIP TC 13 international conference on Human-computer interaction - Volume Part I•September 2011, pp 380-387This paper presents a study of the effect of one instance of contextual cues, trajectory reminders, on the recollection of location sharing preferences elicited using a retrospective protocol. Trajectory reminders are user interface elements that ...
- 3Citation
MetricsTotal Citations3
- Jayant Venkatanathan
- research-articlePublished By ACMPublished By ACM
When are users comfortable sharing locations with advertisers?
- Patrick Gage Kelley
Carnegie Mellon University, Pittsburgh, Pennsylvania, USA
, - Michael Benisch
Carnegie Mellon University, Pittsburgh, Pennsylvania, USA
, - Lorrie Faith Cranor
Carnegie Mellon University, Pittsburgh, Pennsylvania, USA
, - Norman Sadeh
Carnegie Mellon University, Pittsburgh, Pennsylvania, USA
CHI '11: Proceedings of the SIGCHI Conference on Human Factors in Computing Systems•May 2011, pp 2449-2452• https://doi.org/10.1145/1978942.1979299As smartphones and other mobile computing devices have increased in ubiquity, advertisers have begun to realize a more effective way of targeting users and a promising area for revenue growth: location-based advertising. This trend brings to bear new ...
- 29Citation
- 846
- Downloads
MetricsTotal Citations29Total Downloads846Last 12 Months12Last 6 weeks2
- Patrick Gage Kelley
- article
Algorithms for closed under rational behavior (CURB) sets
- Michael Benisch
School of Computer Science, Carnegie Mellon University, Pittsburgh, PA
, - George B. Davis
School of Computer Science, Carnegie Mellon University, Pittsburgh, PA
, - Tuomas Sandholm
School of Computer Science, Carnegie Mellon University, Pittsburgh, PA
We provide a series of algorithms demonstrating that solutions according to the fundamental game-theoretic solution concept of closed under rational behavior (CURB) sets in two-player, normal-form games can be computed in polynomial time (we also ...
- 3Citation
MetricsTotal Citations3
- Michael Benisch
- Article
Capturing Social Networking Privacy Preferences
- Ramprasad Ravichandran
School of Computer Science, Carnegie Mellon University, Pittsburgh, USA 15217
, - Michael Benisch
School of Computer Science, Carnegie Mellon University, Pittsburgh, USA 15217
, - Patrick Gage Kelley
School of Computer Science, Carnegie Mellon University, Pittsburgh, USA 15217
, - Norman M. Sadeh
School of Computer Science, Carnegie Mellon University, Pittsburgh, USA 15217
PETS '09: Proceedings of the 9th International Symposium on Privacy Enhancing Technologies•July 2009, pp 1-18• https://doi.org/10.1007/978-3-642-03168-7_1Social networking sites such as Facebook and MySpace thrive on the exchange of personal content such as pictures and activities. These sites are discovering that people's privacy preferences are very rich and diverse. In theory, providing users with ...
- 18Citation
MetricsTotal Citations18
- Ramprasad Ravichandran
- posterPublished By ACMPublished By ACM
Capturing social networking privacy preferences: can default policies help alleviate tradeoffs between expressiveness and user burden?
SOUPS '09: Proceedings of the 5th Symposium on Usable Privacy and Security•July 2009, Article No.: 47, pp 1-1• https://doi.org/10.1145/1572532.1572587- 19Citation
MetricsTotal Citations19
- posterPublished By ACMPublished By ACM
The impact of expressiveness on the effectiveness of privacy mechanisms for location-sharing
- Michael Benisch,
- Patrick Gage Kelley,
- Norman Sadeh,
- Tuomas Sandholm,
- Janice Tsai,
- Lorrie Faith Cranor,
- Paul Hankes Drielsma
SOUPS '09: Proceedings of the 5th Symposium on Usable Privacy and Security•July 2009, Article No.: 22, pp 1-1• https://doi.org/10.1145/1572532.1572561- 6Citation
MetricsTotal Citations6
- Article
Methodology for designing reasonably expressive mechanisms with application to ad auctions
- Michael Benisch
School of Computer Science, Carnegie Mellon University
, - Norman Sadeh
School of Computer Science, Carnegie Mellon University
, - Tuomas Sandholm
Computer Science Department, Carnegie Mellon University
IJCAI'09: Proceedings of the 21st International Joint Conference on Artificial Intelligence•July 2009, pp 46-52Mechanisms (especially on the Internet) have begun allowing people or organizations to express richer preferences in order to provide for greater levels of overall satisfaction. In this paper, we develop an operational methodology for quantifying the ...
- 2Citation
MetricsTotal Citations2
- Michael Benisch
- article
CMieux: Adaptive strategies for competitive supply chain trading
- Michael Benisch
School of Computer Science, Carnegie Mellon University, Pittsburgh, PA, United States
, - Alberto Sardinha
School of Computer Science, Carnegie Mellon University, Pittsburgh, PA, United States
, - James Andrews
School of Computer Science, Carnegie Mellon University, Pittsburgh, PA, United States
, - Ramprasad Ravichandran
School of Computer Science, Carnegie Mellon University, Pittsburgh, PA, United States
, - Norman Sadeh
School of Computer Science, Carnegie Mellon University, Pittsburgh, PA, United States
Electronic Commerce Research and Applications, Volume 8, Issue 2•March, 2009, pp 78-90 • https://doi.org/10.1016/j.elerap.2008.09.005Supply chains are a central element of today's global economy. Existing management practices consist primarily of static interactions between established partners. Global competition, shorter product life cycles and the emergence of Internet-mediated ...
- 3Citation
MetricsTotal Citations3
- Michael Benisch
- article
The 2007 procurement challenge: A competition to evaluate mixed procurement strategies
- Alberto Sardinha
School of Computer Science, Carnegie Mellon University, 5000 Forbes Avenue, Pittsburgh, PA 15213, United States
, - Michael Benisch
School of Computer Science, Carnegie Mellon University, 5000 Forbes Avenue, Pittsburgh, PA 15213, United States
, - Norman Sadeh
School of Computer Science, Carnegie Mellon University, 5000 Forbes Avenue, Pittsburgh, PA 15213, United States
, - Ramprasad Ravichandran
School of Computer Science, Carnegie Mellon University, 5000 Forbes Avenue, Pittsburgh, PA 15213, United States
, - Vedran Podobnik
Faculty of Electrical Engineering and Computing, University of Zagreb, Croatia
, - Mihai Stan
Department of Computer Science, University of "Politehnica" of Bucharest, Romania
Electronic Commerce Research and Applications, Volume 8, Issue 2•March, 2009, pp 106-114 • https://doi.org/10.1016/j.elerap.2008.09.002Global competition is putting a premium on the ability to manage risk through flexible and agile web-enabled procurement practices. This article discusses the design of the 2007 ''supply chain management - procurement challenge'' (SCM-PC), a competition ...
- 2Citation
MetricsTotal Citations2
- Alberto Sardinha
- Article
A theory of expressiveness in mechanisms
- Michael Benisch
School of Computer Science, Carnegie Mellon University
, - Norman Sadeh
School of Computer Science, Carnegie Mellon University
, - Tuomas Sandholm
Computer Science Department, Carnegie Mellon University
AAAI'08: Proceedings of the 23rd national conference on Artificial intelligence - Volume 1•July 2008, pp 17-23A key trend in (electronic) commerce is a demand for higher levels of expressiveness in the mechanisms that mediate interactions. We develop a theory that ties the expressiveness of mechanisms to their efficiency in a domain-independent manner. We ...
- 11Citation
- 214
- Downloads
MetricsTotal Citations11Total Downloads214
- Michael Benisch
- Article
Using information gain to analyze and fine tune the performance of supply chain trading agent
- James Andrews
School of Computer Science, Carnegie Mellon University
, - Michael Benisch
School of Computer Science, Carnegie Mellon University
, - Alberto Sardinha
School of Computer Science, Carnegie Mellon University
, - Norman Sadeh
School of Computer Science, Carnegie Mellon University
AMEC'07/TADA'07: Proceedings of the 9th International Conference on Agent-Mediated Electronic Commerce and Trading Agent Design and Analysis•May 2007, pp 180-197The Supply Chain Trading Agent Competition (TAC SCM) was designed to explore approaches to dynamic supply chain trading. During the course of each year's competition historical data is logged describing more than 800 games played by different agents ...
- 0Citation
MetricsTotal Citations0
- James Andrews
- research-articlePublished By ACMPublished By ACM
Factoring games to isolate strategic interactions
- George B. Davis
Carnegie Mellon University
, - Michael Benisch
Carnegie Mellon University
, - Kathleen M. Carley
Carnegie Mellon University
, - Norman M. Sadeh
Carnegie Mellon University
AAMAS '07: Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems•May 2007, Article No.: 68, pp 1-7• https://doi.org/10.1145/1329125.1329207Game theoretic reasoning about multi-agent systems has been made more tractable by algorithms that exploit various types of independence in agents' utilities. However, previous work has assumed that a game's precise independence structure is given in ...
- 2Citation
- 215
- Downloads
MetricsTotal Citations2Total Downloads215Last 12 Months5
- George B. Davis
- articlefree
Online artifact removal for brain-computer interfaces using support vector machines and blind source separation
- Sebastian Halder
Institute of Medical Psychology and Behavioral Neurobiology, University of Tübingen, Tübingen, Germany
, - Michael Bensch
Wilhelm-Schickard Institute for Computer Engineering, University of Tübingen, Tübingen, Germany
, - Jürgen Mellinger
Institute of Medical Psychology and Behavioral Neurobiology, University of Tübingen, Tübingen, Germany
, - Martin Bogdan
Wilhelm-Schickard Institute for Computer Engineering, University of Tübingen, Tübingen, Germany and Computer Engineering, Institute of Computer Science, Faculty of Mathematics and Computer Science, University of Leipzig, Leipzig, Germany
, - Andrea Kübler
Institute of Medical Psychology and Behavioral Neurobiology, University of Tübingen, Tübingen, Germany
, - Niels Birbaumer
Institute of Medical Psychology and Behavioral Neurobiology, University of Tübingen, Tübingen, Germany and National Institutes of Health, National Institute of Neurological Disorders and Stroke, Human Cortical Physiology Section, Bethesda, MD
, - Wolfgang Rosenstiel
Wilhelm-Schickard Institute for Computer Engineering, University of Tübingen, Tübingen, Germany
Computational Intelligence and Neuroscience, Volume 2007•April 2007, Article No.: 8, pp 1-9 • https://doi.org/10.1155/2007/82069We propose a combination of blind source separation (BSS) and independent component analysis (ICA) (signal decomposition into artifacts and nonartifacts) with support vector machines (SVMs) (automatic classification) that are designed for online usage. ...
- 4Citation
- 272
- Downloads
MetricsTotal Citations4Total Downloads272Last 12 Months30Last 6 weeks3
- Sebastian Halder
- articlefree
Nessi: an EEG-controlled web browser for severely paralyzed patients
- Michael Bensch
Department of Computer Engineering, University of Tübingen, Tübingen, Germany
, - Ahmed A. Karim
Inst. of Medical Psychology and Behavioral Neurobiology, Univ. of Tübingen and Grad. Sch. of Neural and Behavioral Sci., International Max Planck Res. Sch., Univ. of Tübingen, Tübingen, Germany
, - Jürgen Mellinger
Institute of Medical Psychology and Behavioral Neurobiology, University of Tübingen, Tübingen, Germany
, - Thilo Hinterberger
Institute of Medical Psychology and Behavioral Neurobiology, University of Tübingen, Tübingen, Germany
, - Michael Tangermann
Fraunhofer FIRST, Intelligent Data Analysis Group, Berlin, Germany
, - Martin Bogdan
Department of Computer Engineering, University of Tübingen, Tübingen, Germany and Department of Computer Engineering, University of Leipzig, Leipzig, Germany
, - Wolfgang Rosenstiel
Department of Computer Engineering, University of Tübingen, Tübingen, Germany
, - Niels Birbaumer
Inst. of Medical Psychology and Behavioral Neurobiology, Univ. of Tübingen, Tübingen, Germany and Human Cortical Physiology Unit, National Inst. of Neurological Disorders and Stroke, National Institutes of Health, Bethesda, MD
Computational Intelligence and Neuroscience, Volume 2007•April 2007, Article No.: 6, pp 1-10 • https://doi.org/10.1155/2007/71863We have previously demonstrated that an EEG-controlled web browser based on self-regulation of slow cortical potentials (SCPs) enables severely paralyzed patients to browse the internet independently of any voluntary muscle control. However, this system ...
- 8Citation
- 107
- Downloads
MetricsTotal Citations8Total Downloads107Last 12 Months20Last 6 weeks4
- Michael Bensch
- ArticlePublished By ACMPublished By ACM
CMieux: adaptive strategies for competitive supply chain trading
- Michael Benisch
Carnegie Mellon University
, - Alberto Sardinha
Carnegie Mellon University
, - James Andrews
Carnegie Mellon University
, - Norman Sadeh
Carnegie Mellon University
ICEC '06: Proceedings of the 8th international conference on Electronic commerce: The new e-commerce: innovations for conquering current barriers, obstacles and limitations to conducting successful business on the internet•August 2006, pp 47-58• https://doi.org/10.1145/1151454.1151476Supply chains are a central element of today's global economy. Existing management practices consist primarily of static interactions between established partners. Global competition, shorter product life cycles and the emergence of Internet-mediated ...
- 13Citation
- 380
- Downloads
MetricsTotal Citations13Total Downloads380Last 12 Months3
- Michael Benisch
- ArticlePublished By ACMPublished By ACM
Pricing for customers with probabilistic valuations as a continuous knapsack problem
- Michael Benisch
Carnegie Mellon University
, - James Andrews
Carnegie Mellon University
, - Norman Sadeh
Carnegie Mellon University
ICEC '06: Proceedings of the 8th international conference on Electronic commerce: The new e-commerce: innovations for conquering current barriers, obstacles and limitations to conducting successful business on the internet•August 2006, pp 38-46• https://doi.org/10.1145/1151454.1151475In this paper, we examine the problem of choosing discriminatory prices for customers with probabilistic valuations and a seller with indistinguishable copies of a good. We show that under certain assumptions this problem can be reduced to the ...
- 11Citation
- 291
- Downloads
MetricsTotal Citations11Total Downloads291Last 12 Months3
- Michael Benisch
- Article
Algorithms for rationalizability and CURB sets
- Michael Benisch
School of Computer Science, Carnegie Mellon University
, - George Davis
School of Computer Science, Carnegie Mellon University
, - Tuomas Sandholm
School of Computer Science, Carnegie Mellon University
AAAI'06: Proceedings of the 21st national conference on Artificial intelligence - Volume 1•July 2006, pp 598-604Significant work has been done on computational aspects of solving games under various solution concepts, such as Nash equilibrium, subgame perfect Nash equilibrium, correlated equilibrium, and (iterated) dominance. However, the fundamental concepts of ...
- 3Citation
MetricsTotal Citations3
- Michael Benisch
- articlePublished By ACMPublished By ACM
CMieux: adaptive strategies for competitive supply chain trading
- Michael Benisch
School of Computer Science, Carnegie Mellon University
, - Alberto Sardinha
School of Computer Science, Carnegie Mellon University
, - James Andrews
School of Computer Science, Carnegie Mellon University
, - Norman Sadeh
School of Computer Science, Carnegie Mellon University
ACM SIGecom Exchanges, Volume 6, Issue 1•June 2006, pp 1-10 • https://doi.org/10.1145/1150735.1150737Existing supply chain management practices consist primarily of static interactions between established partners. Global competition, shorter product life cycles and the emergence of Internet-mediated business solutions create an incentive for exploring ...
- 8Citation
- 180
- Downloads
MetricsTotal Citations8Total Downloads180
- Michael Benisch
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