Applied Filters
- Assaf Schuster
- AuthorRemove filter
People
Colleagues
- Assaf Schuster (184)
- Daniel Keren (18)
- Ran Wolff (16)
- Yosi Ben-Asher (16)
- Izchak Sharfman (15)
- Dan Tsafrir (13)
- Ayal Itzkovitz (12)
- Orna Grumberg (12)
- Orna Agmon Ben-Yehuda (12)
- Muli Ben-Yehuda (11)
- Michael Factor (10)
- Nadav Amit (9)
- Tamir Heyman (9)
- Gala Yadgar (8)
- Ilya Kolchinsky (8)
- Moshe (Mickey) Gabel (8)
- Mark Silberstein (7)
- David Peleg (6)
- Ilan Newman (5)
- Valentin Kravtsov (5)
Roles
Publication
Journal/Magazine Names
- Journal of Parallel and Distributed Computing (11)
- ACM SIGPLAN Notices (5)
- Proceedings of the VLDB Endowment (5)
- ACM SIGARCH Computer Architecture News (4)
- ACM Transactions on Database Systems (3)
- Formal Methods in System Design (3)
- Journal of Algorithms (3)
- Software (3)
- ACM Transactions on Computer Systems (2)
- Communications of the ACM (2)
- IEEE Transactions on Knowledge and Data Engineering (2)
- IEEE Transactions on Parallel and Distributed Systems (2)
- International Journal of Parallel Programming (2)
- Journal of Systems and Software (2)
- Concurrency and Computation: Practice & Experience (1)
- Discrete Applied Mathematics (1)
Proceedings/Book Names
- SIGMOD '22: Proceedings of the 2022 International Conference on Management of Data (3)
- ICDM '03: Proceedings of the Third IEEE International Conference on Data Mining (2)
- IPPS '92: Proceedings of the 6th International Parallel Processing Symposium (2)
- Ubiquitous knowledge discovery (2)
- Ubiquitous knowledge discovery (2)
- Automated Technology for Verification and Analysis (1)
- Economics of Grids, Clouds, Systems, and Services (1)
- ICS '04: Proceedings of the 18th annual international conference on Supercomputing (1)
- ICS '08: Proceedings of the 22nd annual international conference on Supercomputing (1)
- KDD '04: Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining (1)
- KDD '06: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining (1)
- Machine Learning and Knowledge Discovery in Databases (1)
- Machine Learning and Knowledge Discovery in Databases (1)
- Machine Learning and Knowledge Discovery in Databases (1)
- OOPSLA '04: Proceedings of the 19th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications (1)
- PODC '06: Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing (1)
- PODS '08: Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (1)
- PPoPP '05: Proceedings of the tenth ACM SIGPLAN symposium on Principles and practice of parallel programming (1)
- PPoPP '07: Proceedings of the 12th ACM SIGPLAN symposium on Principles and practice of parallel programming (1)
- SIGMOD '06: Proceedings of the 2006 ACM SIGMOD international conference on Management of data (1)
Publisher
- Association for Computing Machinery (63)
- Springer-Verlag (46)
- IEEE Computer Society (21)
- Academic Press, Inc. (15)
- USENIX Association (10)
- Kluwer Academic Publishers (7)
- VLDB Endowment (5)
- IEEE Educational Activities Department (3)
- IEEE Press (3)
- John Wiley & Sons, Inc. (3)
- Elsevier Science Inc. (2)
- Curran Associates Inc. (1)
- Elsevier Science Publishers B. V. (1)
- Elsevier Science Publishers Ltd. (1)
- IEEE Computer Society Press (1)
- JMLR.org (1)
- John Wiley and Sons Ltd. (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
Probabilistic invariant learning with randomized linear classifiers
- Leonardo Cotta
Vector Institute
, - Gal Yehuda
Technion, Haifa, Israel
, - Assaf Schuster
Technion, Haifa, Israel
, - Chris J. Maddison
University of Toronto and Vector Institute
NIPS '23: Proceedings of the 37th International Conference on Neural Information Processing Systems•December 2023, Article No.: 3266, pp 74736-74752Designing models that are both expressive and preserve known invariances of tasks is an increasingly hard problem. Existing solutions tradeoff invariance for computational or memory resources. In this work, we show how to leverage randomness and design ...
- 0Citation
MetricsTotal Citations0- 1
Supplementary Material3666122.3669388_supp.pdf
- Leonardo Cotta
- extended-abstractPublished By ACMPublished By ACM
CCO - Cloud Cost Optimizer
- Adi Yehoshua
Red Hat, Tel Aviv, Israel, Israel
Ben Gurion University of the negev, Tel Aviv, Israel, Israel
, - Ilya Kolchinsky
Red Hat, Ramat Gan, Israel, Israel
, - Assaf Schuster
Technion, Haifa, Israel, Israel
SYSTOR '23: Proceedings of the 16th ACM International Conference on Systems and Storage•June 2023, pp 137-137• https://doi.org/10.1145/3579370.3594746Cloud computing can be complex, but optimal management of it doesn't have to be. In this paper, we present the design and implementation of a scalable multi-Cloud Cost Optimizer (CCO) that calculates the optimal deployment scheme for a given workload ...
- 0Citation
- 59
- Downloads
MetricsTotal Citations0Total Downloads59Last 12 Months28Last 6 weeks8
- Adi Yehoshua
- Article
3-Valued Circuit SAT for STE with Automatic Refinement
- Orna Grumberg
Computer Science Department, Technion, Haifa, Israel
, - Assaf Schuster
Computer Science Department, Technion, Haifa, Israel
, - Avi Yadgar
Computer Science Department, Technion, Haifa, Israel
Automated Technology for Verification and Analysis•October 2007, pp 457-473• https://doi.org/10.1007/978-3-540-75596-8_32AbstractSymbolic Trajectory Evaluation (STE) is a powerful technique for hardware model checking. It is based on a 3-valued symbolic simulation, using 0,1 and X (”unknown”), where the X is used to abstract away values of the circuit nodes.
Most STE tools ...
- 0Citation
MetricsTotal Citations0
- Orna Grumberg
- research-articlePublished By ACMPublished By ACM
SMEGA2: Distributed Asynchronous Deep Neural Network Training With a Single Momentum Buffer
- Refael Cohen
Department of Computer Science, Technion - Israel Institute of Technology, Israel
, - Ido Hakimi
Department of Computer Science, Technion - Israel Institute of Technology, Israel
, - Assaf Schuster
Department of Computer Science, Technion - Israel Institute of Technology, Israel
ICPP '22: Proceedings of the 51st International Conference on Parallel Processing•August 2022, Article No.: 3, pp 1-10• https://doi.org/10.1145/3545008.3545010As the field of deep learning progresses, and neural networks become larger, training them has become a demanding and time consuming task. To tackle this problem, distributed deep learning must be used to scale the training of deep neural networks to ...
- 0Citation
- 143
- Downloads
MetricsTotal Citations0Total Downloads143Last 12 Months38Last 6 weeks2
- Refael Cohen
- research-articlePublished By ACMPublished By ACM
DLACEP: A Deep-Learning Based Framework for Approximate Complex Event Processing
- Adar Amir
Technion, Israel Institute of Technology, Haiufa, Israel
, - Ilya Kolchinsky
Technion, Israel Institute of Technology, Haifa, Israel
, - Assaf Schuster
Technion, Israel Institute of Technology, Haifa, Israel
SIGMOD '22: Proceedings of the 2022 International Conference on Management of Data•June 2022, pp 340-354• https://doi.org/10.1145/3514221.3526136Complex event processing (CEP) is employed to detect user-specified patterns of events in data streams. CEP mechanisms operate by maintaining all sets of events that can potentially be composed into a pattern match. This approach can be wasteful when ...
- 2Citation
- 296
- Downloads
MetricsTotal Citations2Total Downloads296Last 12 Months57Last 6 weeks6
- Adar Amir
- research-articlePublished By ACMPublished By ACM
AutoMon: Automatic Distributed Monitoring for Arbitrary Multivariate Functions
- Hadar Sivan
Technion - Israel Institute of Technology, Haifa, Israel
, - Moshe Gabel
University of Toronto, Toronto, ON, Canada
, - Assaf Schuster
Technion - Israel Institute of Technology, Haifa, Israel
SIGMOD '22: Proceedings of the 2022 International Conference on Management of Data•June 2022, pp 310-324• https://doi.org/10.1145/3514221.3517866Approaches for evaluating functions over distributed data streams are increasingly important as data sources become more geographically distributed. However, existing methodologies are limited to small classes of functions, requiring non-trivial effort ...
- 0Citation
- 260
- Downloads
MetricsTotal Citations0Total Downloads260Last 12 Months35Last 6 weeks11- 3
- Hadar Sivan
- research-articlePublished By ACMPublished By ACM
HYPERSONIC: A Hybrid Parallelization Approach for Scalable Complex Event Processing
- Maor Yankovitch
Technion, Israel Institute of Technology, Haifa, Israel
, - Ilya Kolchinsky
Technion, Israel Institute of Technology, Haifa, Israel
, - Assaf Schuster
Technion, Israel Institute of Technology, Haifa, Israel
SIGMOD '22: Proceedings of the 2022 International Conference on Management of Data•June 2022, pp 1093-1107• https://doi.org/10.1145/3514221.3517829The ability to promptly and efficiently detect arbitrarily complex patterns in massive real-time data streams is a crucial requirement in many modern applications. The ever-growing scale of these applications and the sophistication of the patterns ...
- 3Citation
- 372
- Downloads
MetricsTotal Citations3Total Downloads372Last 12 Months67Last 6 weeks8
- Maor Yankovitch
- Article
Communication-Efficient Distributed Online Prediction by Dynamic Model Synchronization
- Michael Kamp
Fraunhofer IAIS & University Bonn, Germany
, - Mario Boley
Fraunhofer IAIS & University Bonn, Germany
, - Daniel Keren
Haifa University, Israel
, - Assaf Schuster
Technion, Israel Institute of Technology, Israel
, - Izchak Sharfman
Technion, Israel Institute of Technology, Israel
Machine Learning and Knowledge Discovery in Databases, pp 623-639• https://doi.org/10.1007/978-3-662-44848-9_40AbstractWe present the first protocol for distributed online prediction that aims to minimize online prediction loss and network communication at the same time. This protocol can be applied wherever a prediction-based service must be provided timely for ...
- 3Citation
MetricsTotal Citations3
- Michael Kamp
- research-article
DARLING: data-aware load shedding in complex event processing systems
- Koral Chapnik
Technion, Haifa, Israel
, - Ilya Kolchinsky
Technion, Haifa, Israel
, - Assaf Schuster
Technion, Haifa, Israel
Proceedings of the VLDB Endowment, Volume 15, Issue 3•November 2021, pp 541-554 • https://doi.org/10.14778/3494124.3494137Complex event processing (CEP) is widely employed to detect user-defined combinations, or patterns, of events in massive streams of incoming data. Numerous applications such as healthcare, fraud detection, and more, use CEP technologies to capture ...
- 6Citation
- 138
- Downloads
MetricsTotal Citations6Total Downloads138Last 12 Months36Last 6 weeks2
- Koral Chapnik
- Article
Incremental Sensitivity Analysis for Kernelized Models
- Hadar Sivan
Technion - Israel Institute of Technology, 3200, Haifa, Israel
, - Moshe Gabel
University of Toronto, Toronto, Canada
, - Assaf Schuster
Technion - Israel Institute of Technology, 3200, Haifa, Israel
Machine Learning and Knowledge Discovery in Databases•September 2020, pp 383-398• https://doi.org/10.1007/978-3-030-67661-2_23AbstractDespite their superior accuracy to simpler linear models, kernelized models can be prohibitively expensive in applications where the training set changes frequently, since training them is computationally intensive. We provide bounds for the ...
- 0Citation
MetricsTotal Citations0
- Hadar Sivan
- research-articlefree
It's not what machines can learn, it's whatwe cannot teach
- Gal Yehuda
Department of Computer Science, Technion, Israel Institute of Technology, Israel
, - Moshe Gabel
Department of Computer Science, University of Toronto, Canada
, - Assaf Schuster
Department of Computer Science, Technion, Israel Institute of Technology, Israel
ICML'20: Proceedings of the 37th International Conference on Machine Learning•July 2020, Article No.: 1004, pp 10831-10841Can deep neural networks learn to solve any task, and in particular problems of high complexity? This question attracts a lot of interest, with recent works tackling computationally hard tasks such as the traveling salesman problem and satisfiability. In ...
- 0Citation
- 48
- Downloads
MetricsTotal Citations0Total Downloads48Last 12 Months32Last 6 weeks3- 1
Supplementary Material3524938.3525942_supp.pdf
- Gal Yehuda
- research-articlePublished By ACMPublished By ACM
Memory Elasticity Benchmark
- Liran Funaro
Technion---Israel Institute of Technology, Haifa, Israel
, - Orna Agmon Ben-Yehuda
Technion---Israel Institute of Technology, Haifa, Israel
, - Assaf Schuster
Technion---Israel Institute of Technology, Haifa, Israel
SYSTOR '20: Proceedings of the 13th ACM International Systems and Storage Conference•May 2020, pp 1-12• https://doi.org/10.1145/3383669.3398277Cloud computing handles a vast share of the world's computing, but it is not as efficient as it could be due to its lack of support for memory elasticity. An environment that supports memory elasticity can dynamically change the size of the application'...
- 0Citation
- 234
- Downloads
MetricsTotal Citations0Total Downloads234Last 12 Months19Last 6 weeks1
- Liran Funaro
- Article
Online Linear Models for Edge Computing
- Hadar Sivan
Technion - Israel Institute of Technology, 3200, Haifa, Israel
, - Moshe Gabel
University of Toronto, Toronto, Canada
, - Assaf Schuster
Technion - Israel Institute of Technology, 3200, Haifa, Israel
Machine Learning and Knowledge Discovery in Databases•September 2019, pp 645-661• https://doi.org/10.1007/978-3-030-46150-8_38AbstractMaintaining an accurate trained model on an infinite data stream is challenging due to concept drifts that render a learned model inaccurate. Updating the model periodically can be expensive, and so traditional approaches for computationally ...
- 0Citation
MetricsTotal Citations0
- Hadar Sivan
- research-articlePublished By ACMPublished By ACM
Real-Time Multi-Pattern Detection over Event Streams
- Ilya Kolchinsky
Technion, Israel Institute of Technology, Haifa, Israel
, - Assaf Schuster
Technion, Israel Institute of Technology, Haifa, Israel
SIGMOD '19: Proceedings of the 2019 International Conference on Management of Data•June 2019, pp 589-606• https://doi.org/10.1145/3299869.3319869Rapid advances in data-driven applications over recent years have intensified the need for efficient mechanisms capable of monitoring and detecting arbitrarily complex patterns in massive data streams. This task is usually performed by complex event ...
- 20Citation
- 634
- Downloads
MetricsTotal Citations20Total Downloads634Last 12 Months37Last 6 weeks3
- Ilya Kolchinsky
- research-articlePublished By ACMPublished By ACM
Stochastic resource allocation
- Liran Funaro
Technion, Israel
, - Orna Agmon Ben-Yehuda
Technion, Israel
, - Assaf Schuster
Technion, Israel
VEE 2019: Proceedings of the 15th ACM SIGPLAN/SIGOPS International Conference on Virtual Execution Environments•April 2019, pp 122-136• https://doi.org/10.1145/3313808.3313815Suboptimal resource utilization among public and private cloud providers prevents them from maximizing their economic potential. Long-term allocated resources are often idle when they might have been subleased for a short period. Alternatively, ...
- 6Citation
- 361
- Downloads
MetricsTotal Citations6Total Downloads361Last 12 Months21Last 6 weeks4
- Liran Funaro
- Article
Preventing Collusion in Cloud Computing Auctions
- Shunit Agmon
Technion—Israel Institute of Technology, 3200003, Haifa, Israel
, - Orna Agmon Ben-Yehuda
Technion—Israel Institute of Technology, 3200003, Haifa, Israel
Caesarea Rothschild Institute for Interdisciplinary Applications of Computer Science, University of Haifa, Haifa, Israel
, - Assaf Schuster
Technion—Israel Institute of Technology, 3200003, Haifa, Israel
Economics of Grids, Clouds, Systems, and Services•September 2018, pp 24-38• https://doi.org/10.1007/978-3-030-13342-9_3AbstractCloud providers are moving towards auctioning cloud resources rather than renting them using fixed prices. Vickrey-Clarke-Groves (VCG) auctions are likely to be used for that purpose, since they maximize social welfare—the participants’ aggregate ...
- 0Citation
MetricsTotal Citations0
- Shunit Agmon
- research-articlePublished By ACMPublished By ACM
Lightweight Monitoring of Distributed Streams
- Arnon Lazerson
Technion – Israel Institute of Technology, Haifa, Israel
, - Daniel Keren
University of Haifa, Israel, Haifa, Israel
, - Assaf Schuster
Technion – Israel Institute of Technology, Haifa, Israel
ACM Transactions on Database Systems, Volume 43, Issue 2•June 2018, Article No.: 9, pp 1-37 • https://doi.org/10.1145/3226113As data becomes dynamic, large, and distributed, there is increasing demand for what have become known as distributed stream algorithms. Since continuously collecting the data to a central server and processing it there is infeasible, a common approach ...
- 6Citation
- 338
- Downloads
MetricsTotal Citations6Total Downloads338Last 12 Months12Last 6 weeks7
- Arnon Lazerson
- research-article
Efficient adaptive detection of complex event patterns
- Ilya Kolchinsky
Israel Institute of Technology, Haifa Israel
, - Assaf Schuster
Israel Institute of Technology, Haifa Israel
Proceedings of the VLDB Endowment, Volume 11, Issue 11•July 2018, pp 1346-1359 • https://doi.org/10.14778/3236187.3236190Complex event processing (CEP) is widely employed to detect occurrences of predefined combinations (patterns) of events in massive data streams. As new events are accepted, they are matched using some type of evaluation structure, commonly optimized ...
- 11Citation
- 79
- Downloads
MetricsTotal Citations11Total Downloads79Last 12 Months2
- Ilya Kolchinsky
- research-article
Join query optimization techniques for complex event processing applications
- Ilya Kolchinsky
Israel Institute of Technology, Haifa Israel
, - Assaf Schuster
Israel Institute of Technology, Haifa Israel
Proceedings of the VLDB Endowment, Volume 11, Issue 11•July 2018, pp 1332-1345 • https://doi.org/10.14778/3236187.3236189Complex event processing (CEP) is a prominent technology used in many modern applications for monitoring and tracking events of interest in massive data streams. CEP engines inspect real-time information flows and attempt to detect combinations of ...
- 14Citation
- 133
- Downloads
MetricsTotal Citations14Total Downloads133Last 12 Months5Last 6 weeks1
- Ilya Kolchinsky
- short-paperPublished By ACMPublished By ACM
Collusion in Cloud Computing Auctions
- Shunit Agmon
Technion---Israel Institute of Technology, Haifa, Israel
, - Orna Agmon Ben-Yehuda
Technion---Israel Institute of Technology, Haifa, Israel
, - Assaf Schuster
Technion---Israel Institute of Technology, Haifa, Israel
SYSTOR '18: Proceedings of the 11th ACM International Systems and Storage Conference•June 2018, pp 113-113• https://doi.org/10.1145/3211890.3211911- 1Citation
- 78
- Downloads
MetricsTotal Citations1Total Downloads78Last 12 Months2
- Shunit Agmon
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