Rakesh Nagi
Applied Filters
- Rakesh Nagi
- AuthorRemove filter
People
Colleagues
- Rakesh Nagi (43)
- Rajan Batta (7)
- Moises Sudit (5)
- Carol J Romanowski (4)
- Ketan Date (4)
- Geoff A Gross (3)
- Jinjun Xiong (3)
- Kedar Sambhoos (3)
- Mohammad Almasri (3)
- Wen Mei W Hwu (3)
- A. N. Tantawi (2)
- Alaa S Youssef (2)
- Alexander G Nikolaev (2)
- Ali Yekkehkhany (2)
- Chen Wang (2)
- Diana J Arroyo (2)
- Gregory William Tauer (2)
- Izzat El Hajj (2)
- Jungeun Shin (2)
- Michael C Fu (2)
Roles
Publication
Journal/Magazine Names
- Computers and Operations Research (12)
- Information Fusion (5)
- Operations Research (3)
- Journal of Parallel and Distributed Computing (2)
- Parallel Computing (2)
- Computers and Industrial Engineering (1)
- Decision Analysis (1)
- IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans (1)
- IEEE/ACM Transactions on Networking (1)
- INFORMS Journal on Computing (1)
- Management Science (1)
- Optimization Methods & Software (1)
Proceedings/Book Names
- Data mining for design and manufacturing (2)
- 2021 IEEE 17th International Conference on Automation Science and Engineering (CASE) (1)
- ASONAM '12: Proceedings of the 2012 International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2012) (1)
- ASONAM '19: Proceedings of the 2019 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (1)
- ASPDAC '20: Proceedings of the 25th Asia and South Pacific Design Automation Conference (1)
- ICPP '23: Proceedings of the 52nd International Conference on Parallel Processing (1)
- ICS '22: Proceedings of the 36th ACM International Conference on Supercomputing (1)
- PACT '23: Proceedings of the 32nd International Conference on Parallel Architectures and Compilation Techniques (1)
- SBP'13: Proceedings of the 6th international conference on Social Computing, Behavioral-Cultural Modeling and Prediction (1)
- SoCC '22: Proceedings of the 13th Symposium on Cloud Computing (1)
- SoCC '24: Proceedings of the 2024 ACM Symposium on Cloud Computing (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
Parallelizing Maximal Clique Enumeration on GPUs
- Mohammad Almasri
ECE, University of Illinois at Urbana-Champaign, Urbana, IL, USA
, - Yen-Hsiang Chang
ECE, University of Illinois at Urbana-Champaign, Urbana, IL, USA
, - Izzat El Hajj
Department of Computer Science, American University of Beirut, Beirut, Lebanon
, - Rakesh Nagi
ISE, University of Illinois at Urbana-Champaign, Urbana, IL, USA
, - Jinjun Xiong
Department of Computer Science and Engineering, University at Buffalo, Buffalo, NY, USA
, - Wen-mei Hwu
Nvidia Corporation, Santa Clara, CA, USA
PACT '23: Proceedings of the 32nd International Conference on Parallel Architectures and Compilation Techniques•October 2023, pp 162-175• https://doi.org/10.1109/PACT58117.2023.00022We present a GPU solution for exact maximal clique enumeration (MCE) that performs a search tree traversal following the Bron-Kerbosch algorithm. Prior works on parallelizing MCE on GPUs perform a breadth-first traversal of the tree, which has limited ...
- 0Citation
- 5
- Downloads
MetricsTotal Citations0Total Downloads5Last 12 Months5Last 6 weeks5
- Mohammad Almasri
- research-articleOpen AccessPublished By ACMPublished By ACM
Cloud-native Workflow Scheduling using a Hybrid Priority Rule, Dynamic Resource Allocation, and Dynamic Task Partition
- Jungeun Shin
University of Illinois at Urbana-Champaign, Urbana, IL, USA
, - Diana Arroyo
IBM Research, Almaden, CA, USA
, - Asser Tantawi
IBM Research, Yorktown, Heights, NY, USA
, - Chen Wang
IBM Research, Yorktown, Heights, NY, USA
, - Alaa Youssef
IBM Research, Yorktown, Heights, NY, USA
, - Rakesh Nagi
Singapore University of Technology and Design (SUTD), Singapore
SoCC '24: Proceedings of the 2024 ACM Symposium on Cloud Computing•November 2024, pp 830-846• https://doi.org/10.1145/3698038.3698551As cloud-native workflow orchestration tools become increasingly important for complex data science workloads, there is a growing need for more efficient scheduling. Existing cloud schedulers rely on basic heuristics and user choice for task partitioning ...
- 0Citation
- 100
- Downloads
MetricsTotal Citations0Total Downloads100Last 12 Months100Last 6 weeks100
- Jungeun Shin
- research-article
HyLAC: Hybrid linear assignment solver in CUDA
- Samiran Kawtikwar
Industrial and Enterprise Systems Engineering, University of Illinois Urbana Champaign, USA
, - Rakesh Nagi
Industrial and Enterprise Systems Engineering, University of Illinois Urbana Champaign, USA
Engineering Systems and Design, Singapore University of Technology and Design, Singapore
Journal of Parallel and Distributed Computing, Volume 187, Issue C•May 2024 • https://doi.org/10.1016/j.jpdc.2024.104838AbstractThe Linear Assignment Problem (LAP) is a fundamental combinatorial optimization problem with a wide range of applications. Over the years, significant progress has been made in developing efficient algorithms to solve the LAP, particularly in the ...
Highlights- The fastest Linear Assignment Problem (LAP) solver that uses GPUs.
- Improved implementation of classical and tree variants of Hungarian algorithm.
- Solves a stream of small LAPs 22.59× faster than the existing solution.
- 0Citation
MetricsTotal Citations0
- Samiran Kawtikwar
- research-article
GPU-accelerated transportation simplex algorithm
- Mohit Mahajan
Department of Industrial and Enterprise Systems Engineering, 117 Transportation Building, University of Illinois Urbana-Champaign, Urbana, IL 61801, USA
, - Rakesh Nagi
Department of Industrial and Enterprise Systems Engineering, 117 Transportation Building, University of Illinois Urbana-Champaign, Urbana, IL 61801, USA
Journal of Parallel and Distributed Computing, Volume 184, Issue C•Feb 2024 • https://doi.org/10.1016/j.jpdc.2023.104790AbstractTransportation Problem (TP) is a popular linear program for optimally matching several supply centers to several demand centers at the smallest transportation cost. Recent disruptions in the physical supply chains and the growth of internet ...
Highlights- Transportation Problem is a fundamental problem in operations research.
- Transportation Simplex Algorithm has been accelerated on a GPU.
- Creative parallelism in the iterative steps has been uncovered and exploited.
- Large ...
- 0Citation
MetricsTotal Citations0
- Mohit Mahajan
- research-articlePublished By ACMPublished By ACM
BEEP: Balanced Efficient subgraph Enumeration in Parallel
- Samiran Kawtikwar
University of Illinois at Urbana Champaign, United States of America
, - Mohammad Almasri
University of Illinois at Urbana Champaign, United States of America
, - Wen-Mei Hwu
University of Illinois at Urbana Champaign, United States of America
, - Rakesh Nagi
University of Illinois at Urbana Champaign, United States of America
, - Jinjun Xiong
University at Buffalo, United States of America
ICPP '23: Proceedings of the 52nd International Conference on Parallel Processing•August 2023, pp 142-152• https://doi.org/10.1145/3605573.3605653BEEP is a state-of-the-art subgraph enumerator that delivers high performance through a combination of balanced, parallel GPU processing and novel algorithmic improvements. With a rapidly increasing demand for fast tools on large graphs, GPU-based ...
- 0Citation
- 158
- Downloads
MetricsTotal Citations0Total Downloads158Last 12 Months120Last 6 weeks12
- Samiran Kawtikwar
- wipPublished By ACMPublished By ACM
Cloud-native workflow scheduling using a hybrid priority rule and dynamic task parallelism
- Jungeun Shin
University of Illinois at Urbana-Champaign
, - Diana Arroyo
IBM Thomas J. Watson Research Center
, - Asser Tantawi
IBM Thomas J. Watson Research Center
, - Chen Wang
IBM Thomas J. Watson Research Center
, - Alaa Youssef
IBM Thomas J. Watson Research Center
, - Rakesh Nagi
University of Illinois at Urbana-Champaign
SoCC '22: Proceedings of the 13th Symposium on Cloud Computing•November 2022, pp 72-77• https://doi.org/10.1145/3542929.3563495Demand for efficient cloud-native workflow scheduling is growing as many data science workloads are composed of several tasks with dependencies. As container technology becomes more prevalent in cloud communities, containerized workflow orchestration ...
- 1Citation
- 495
- Downloads
MetricsTotal Citations1Total Downloads495Last 12 Months121Last 6 weeks11
- Jungeun Shin
- research-articlePublished By ACMPublished By ACM
Parallel K-clique counting on GPUs
- Mohammad Almasri
University of Illinois at Urbana-Champaign
, - Izzat El Hajj
American University of Beirut
, - Rakesh Nagi
University of Illinois at Urbana-Champaign
, - Jinjun Xiong
University at Buffalo
, - Wen-mei Hwu
University of Illinois at Urbana-Champaign
ICS '22: Proceedings of the 36th ACM International Conference on Supercomputing•June 2022, Article No.: 21, pp 1-14• https://doi.org/10.1145/3524059.3532382Counting k-cliques in a graph is an important problem in graph analysis with many applications such as community detection and graph partitioning. Counting k-cliques is typically done by traversing search trees starting at each vertex in the graph. ...
- 12Citation
- 409
- Downloads
MetricsTotal Citations12Total Downloads409Last 12 Months147Last 6 weeks15
- Mohammad Almasri
- research-article
Decentralized Makespan Minimization for Uniformly Related Agents
- Raunak Sengupta
University of Illinois at Urbana-Champaign,Department of Industrial and Enterprise Systems Engineering,USA
, - Rakesh Nagi
University of Illinois at Urbana-Champaign,Department of Industrial and Enterprise Systems Engineering,USA
2021 IEEE 17th International Conference on Automation Science and Engineering (CASE)•August 2021, pp 2140-2145• https://doi.org/10.1109/CASE49439.2021.9551549We consider a set of indivisible operations and a set of uniformly related agents, i.e., agents with different speeds. Our aim is to develop a task allocation algorithm that minimizes the makespan in a decentralized manner. To achieve this, we first ...
- 0Citation
MetricsTotal Citations0
- Raunak Sengupta
- research-article
Stochastic Superiority Equilibrium in Game Theory
- Ali Yekkehkhany
Department of Electrical and Computer Engineering, University of Illinois at Urbana-Champaign, Urbana, Illinois 61801
, - Timothy Murray
Department of Industrial and Enterprise Systems Engineering, University of Illinois at Urbana-Champaign, Urbana, Illinois 61801
, - Rakesh Nagi
Department of Industrial and Enterprise Systems Engineering, University of Illinois at Urbana-Champaign, Urbana, Illinois 61801
Decision Analysis, Volume 18, Issue 2•June 2021, pp 153-168 • https://doi.org/10.1287/deca.2021.0429The definition of best response for a player in the Nash equilibrium is based on maximizing the expected utility given the strategy of the rest of the players in a game. In this work, we consider stochastic games, that is, games with random payoffs, in ...
- 0Citation
MetricsTotal Citations0
- Ali Yekkehkhany
- research-articleOpen Access
Blind GB-PANDAS: A Blind Throughput-Optimal Load Balancing Algorithm for Affinity Scheduling
- Ali Yekkehkhany
Department of Electrical and Computer Engineering, University of Illinois at Urbana–Champaign, Champaign, IL, USA
, - Rakesh Nagi
Department of Industrial and Enterprise Systems Engineering, University of Illinois at Urbana–Champaign, Champaign, IL, USA
IEEE/ACM Transactions on Networking, Volume 28, Issue 3•June 2020, pp 1199-1212 • https://doi.org/10.1109/TNET.2020.2978195Dynamic affinity load balancing of multi-type tasks on multi-skilled servers, when the service rate of each task type on each of the servers is known and can possibly be different from each other, is an open problem for over three decades. The goal is to ...
- 3Citation
- 48
- Downloads
MetricsTotal Citations3Total Downloads48Last 12 Months18Last 6 weeks1
- Ali Yekkehkhany
- short-paperPublished By ACMPublished By ACM
Seed investment bounds for viral marketing under generalized diffusion
- Arash Ghayoori
University of Illinois at Urbana-Champaign
, - Rakesh Nagi
University of Illinois at Urbana-Champaign
ASONAM '19: Proceedings of the 2019 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining•August 2019, pp 95-100• https://doi.org/10.1145/3341161.3342922This paper attempts to provide viral marketeers guidance in terms of an investment level that could help capture some desired γ percentage of the market-share by some target time t with a desired level of confidence. To do this, we first introduce a ...
- 1Citation
- 51
- Downloads
MetricsTotal Citations1Total Downloads51Last 12 Months1
- Arash Ghayoori
- research-article
Thanos: High-Performance CPU-GPU Based Balanced Graph Partitioning Using Cross-Decomposition
- Dae Hee Kim
University of Illinois at Urbana-Champaign
, - Rakesh Nagi
University of Illinois at Urbana-Champaign
, - Deming Chen
University of Illinois at Urbana-Champaign
ASPDAC '20: Proceedings of the 25th Asia and South Pacific Design Automation Conference•January 2020, pp 91-96• https://doi.org/10.1109/ASP-DAC47756.2020.9045588As graphs become larger and more complex, it is becoming nearly impossible to process them without graph partitioning. Graph partitioning creates many subgraphs which can be processed in parallel thus delivering high-speed computation results. However, ...
- 0Citation
- 4
- Downloads
MetricsTotal Citations0Total Downloads4Last 12 Months4
- Dae Hee Kim
- research-article
Level 2 Reformulation Linearization Technique–Based Parallel Algorithms for Solving Large Quadratic Assignment Problems on Graphics Processing Unit Clusters
- Ketan Date
Department of Industrial and Enterprise Systems Engineering, University of Illinois at Urbana–Champaign, Urbana, Illinois 61801
, - Rakesh Nagi
Department of Industrial and Enterprise Systems Engineering, University of Illinois at Urbana–Champaign, Urbana, Illinois 61801
INFORMS Journal on Computing, Volume 31, Issue 4•Fall 2019, pp 771-789 • https://doi.org/10.1287/ijoc.2018.0866This paper discusses efficient parallel algorithms for obtaining strong lower bounds and exact solutions for large instances of the quadratic assignment problem (QAP). Our parallel architecture is comprised of both multicore processors and compute unified ...
- 3Citation
MetricsTotal Citations3
- Ketan Date
- research-article
An incremental graph-partitioning algorithm for entity resolution
- Gregory Tauer
CUBRC, 4455 Genesee Street, Suite 106, Buffalo, NY 14225 USA
, - Ketan Date
Department of Industrial and Enterprise Systems Engineering, University of Illinois at Urbana-Champaign, 117 Transportation Building, Urbana, IL 61801, USA
, - Rakesh Nagi
Department of Industrial and Enterprise Systems Engineering, University of Illinois at Urbana-Champaign, 117 Transportation Building, Urbana, IL 61801, USA
, - Moises Sudit
Department of Industrial and Systems Engineering, State University of New York at Buffalo, 342 Bell Hall, Buffalo, NY 14260, USA
Information Fusion, Volume 46, Issue C•Mar 2019, pp 171-183 • https://doi.org/10.1016/j.inffus.2018.06.001Highlights- A novel incremental data association algorithm is proposed for entity resolution.
AbstractEntity resolution is an important data association task when fusing information from multiple sources. Oftentimes the information arrives continuously and the entity resolution algorithm needs to efficiently update its solution upon ...
- 1Citation
MetricsTotal Citations1
- Gregory Tauer
- article
Controlling a Fleet of Unmanned Aerial Vehicles to Collect Uncertain Information in a Threat Environment
- Yan Xia
Department of Industrial and Systems Engineering, University at Buffalo SUNY, Buffalo, New York 14260
, - Rajan Batta
Department of Industrial and Systems Engineering, University at Buffalo SUNY, Buffalo, New York 14260
, - Rakesh Nagi
Department of Industrial and Enterprise Systems Engineering, University of Illinois at Urbana-Champaign, Urbana, Illinois 61801
Operations Research, Volume 65, Issue 3•June 2017, pp 674-692 • https://doi.org/10.1287/opre.2017.1590Unmanned aerial vehicles UAVs have been proved to be successful and efficient for information collection in a modern battlefield, especially in areas that are considered to be dangerous for human pilots. Currently, a UAV is remotely controlled by a ...
- 4Citation
MetricsTotal Citations4
- Yan Xia
- article
The temporal aspects of the evidence-based influence maximization on social networks
- Mohammadreza Samadi
Department of Industrial and Systems Engineering, University at Buffalo SUNY, Buffalo, NY14260, USA
, - Alexander Nikolaev
Department of Industrial and Systems Engineering, University at Buffalo SUNY, Buffalo, NY14260, USA
, - Rakesh Nagi
Department of Industrial and Enterprise Systems Engineering, University of Illinois at Urbana-Champaign, Urbana, IL61801, USA
Optimization Methods & Software, Volume 32, Issue 2•April 2017, pp 290-311 • https://doi.org/10.1080/10556788.2016.1214957The influence maximization problem selects a set of seeds to initiate an optimal cascade of decisions. This paper uses parallel cascade evidence-based diffusion modelling, which views influence as a consequence of the evidence exchange between the ...
- 1Citation
MetricsTotal Citations1
- Mohammadreza Samadi
- research-article
GPU-accelerated Hungarian algorithms for the Linear Assignment Problem
- Ketan Date
Department of Industrial and Enterprise Systems Engineering, 117 Transportation Building, University of Illinois at Urbana-Champaign, Urbana, IL 61801, USA
, - Rakesh Nagi
Department of Industrial and Enterprise Systems Engineering, 117 Transportation Building, University of Illinois at Urbana-Champaign, Urbana, IL 61801, USA
Parallel Computing, Volume 57, Issue C•September 2016, pp 52-72 • https://doi.org/10.1016/j.parco.2016.05.012Linear Assignment is one of the most fundamental problems in operations research.A creative parallelization of a Hungarian-like algorithm on GPU cluster.Efficient parallelization of the augmenting path search step.Large problems with 1.6 billion ...
- 14Citation
MetricsTotal Citations14
- Ketan Date
- research-article
Precedence tree guided search for the efficient identification of multiple situations of interest - AND/OR graph matching
- Geoff A. Gross
Department of Industrial and Systems Engineering, University at Buffalo (SUNY), Buffalo, NY 14260, USA
, - Rakesh Nagi
Department of Industrial and Systems Engineering, University at Buffalo (SUNY), Buffalo, NY 14260, USA
Information Fusion, Volume 27, Issue C•January 2016, pp 240-254 • https://doi.org/10.1016/j.inffus.2015.02.001Presents method for modeling multiple situations of interest as single template graph.Enables precedence tree guidance of a graph matching (GM) search heuristic.Demonstrates significant speedup of the proposed AND/OR GM methodology.Performs numerous ...
- 0Citation
MetricsTotal Citations0
- Geoff A. Gross
- research-article
An integrated model for site selection and space determination of warehouses
- Simin Huang
Department of Industrial Engineering, Tsinghua University, Beijing 100084, PR China
, - Qian Wang
Management School, University of Chinese Academy of Sciences, Beijing 100190, PR China
, - Rajan Batta
Department of Industrial and Systems Engineering, University at Buffalo (SUNY), Buffalo, NY 14260, USA
, - Rakesh Nagi
Department of Industrial and Enterprise Systems Engineering, University of Illinois, Urbana, IL 61801, USA
Computers and Operations Research, Volume 62, Issue C•October 2015, pp 169-176 • https://doi.org/10.1016/j.cor.2014.10.015In this paper we present an integrated model for site selection and space determination for warehouses in a two-stage network in which products are shipped from part suppliers to warehouses, where they are stored for an uncertain length of time and then ...
- 2Citation
MetricsTotal Citations2
- Simin Huang
- article
Towards context aware data fusion: Modeling and integration of situationally qualified human observations to manage uncertainty in a hard+soft fusion process
Information Fusion, Volume 21•January, 2015, pp 130-144 • https://doi.org/10.1016/j.inffus.2013.04.011This paper presents a framework for characterizing errors associated with different categories of human observation combined with a method for integrating these into a hard+soft data fusion system. Error characteristics of human observers (often ...
- 5Citation
MetricsTotal Citations5
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