Wenfei Wu
Applied Filters
- Wenfei Wu
- AuthorRemove filter
People
Colleagues
- Wenfei Wu (16)
- Bohan Zhao (3)
- Qingsong Liu (3)
- Shuo Liu (3)
- Hongyi Huang (2)
- Longbo Huang (2)
- Qiaoling Wang (2)
- Yongchao He (2)
- Zhixuan Fang (2)
- Bin Liu (1)
- Fengyuan Xu (1)
- Guyue Liu (1)
- Haoyu Song (1)
- Jiao Zhang (1)
- Linhai Song (1)
- Marco Canini (1)
- Tao Huang (1)
- Tong Yang (1)
- Xu Chen (1)
- Yanfang Le (1)
Publication
Proceedings/Book Names
- NOMS 2022-2022 IEEE/IFIP Network Operations and Management Symposium (2)
- 2021 IEEE Global Communications Conference (GLOBECOM) (1)
- ACM SIGCOMM '23: Proceedings of the ACM SIGCOMM 2023 Conference (1)
- APNet '24: Proceedings of the 8th Asia-Pacific Workshop on Networking (1)
- ASPLOS '24: Proceedings of the 29th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 1 (1)
- ASPLOS 2023: Proceedings of the 28th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 2 (1)
- ASPLOS 2023: Proceedings of the 28th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 3 (1)
- FEAST'19: Proceedings of the 3rd ACM Workshop on Forming an Ecosystem Around Software Transformation (1)
- ICPP Workshops '24: Workshop Proceedings of the 53rd International Conference on Parallel Processing (1)
- KDD '21: Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining (1)
- KDD '23: Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (1)
- SIGCOMM Posters and Demos '19: Proceedings of the ACM SIGCOMM 2019 Conference Posters and Demos (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-articlePublished By ACMPublished By ACM
RECC: Joint Congestion Control Based on RTT and ECN for High-speed RDMA Networks
- Zirui Wan
Beijing University of Posts and Telecommunications, Beijing, China
, - Jiao Zhang
Beijing University of Posts and Telecommunications, Beijing, China
, - Haoran Wei
ByteDance China, Beijing, China
, - Zhuo Jiang
ByteDance China, Beijing, China
, - Xiaolong Zhong
ByteDance China, Beijing, China
, - Wenfei Wu
Peking University, Beijing, China
, - Huaping Zhou
ByteDance China, Beijing, China
, - Tian Pan
Beijing University of Posts and Telecommunications, Beijing, China
, - Tao Huang
Beijing University of Posts and Telecommunications, Beijing, China
Proceedings of the ACM on Networking, Volume 2, Issue CoNEXT4•December 2024, Article No.: 31, pp 1-18 • https://doi.org/10.1145/3696402Together with the construction of RDMA networks for data center applications, the RDMA-coupled DCQCN dominates the RDMA Congestion Control (CC). However, DCQCN suffers severe performance problems in high-speed RDMA networks with modern high-performance ...
- 0Citation
- 63
- Downloads
MetricsTotal Citations0Total Downloads63Last 12 Months63Last 6 weeks63
- Zirui Wan
- extended-abstractOpen AccessPublished By ACMPublished By ACM
Alleviating All-to-All Communication for Deep Learning Recommendation Model Inference
- Songjun Huang
Sun Yat-sen University, China
, - Yihong Li
Sun Yat-sen University, China
, - Liangkun Chen
Sun Yat-sen University, China
, - Xiaoxi Zhang
Sun Yat-sen University, China
, - Shuo Liu
Huawei, China
, - Jingpu Duan
Peng Cheng Laboratory, China
, - Wenfei Wu
Peking University, China
, - Xu Chen
Sun Yat-sen University, China
ICPP Workshops '24: Workshop Proceedings of the 53rd International Conference on Parallel Processing•August 2024, pp 104-105• https://doi.org/10.1145/3677333.3678267Massive DLRMs require large-scale multi-node systems for distributed training and inference, thus suffering from the all-to-all communication bottleneck. We propose an architecture, EmbedSwitch, that offloads the cache function of the embedding table ...
- 0Citation
- 245
- Downloads
MetricsTotal Citations0Total Downloads245Last 12 Months245Last 6 weeks73
- Songjun Huang
- posterPublished By ACMPublished By ACM
WeMu: A design of wireless network emulator
- Mingtai Lv
Academy of Military Science, China
, - Xiangrui Yang
National University of Defense Technology, China
, - Huan Zhou
National University of Defense Technology, China
, - Wenfei Wu
Peking University, China
, - Yusheng Xia
Academy of Military Science, China
, - Jinshu Su
Academy of Military Science, China and National University of Defense Technology, China
APNet '24: Proceedings of the 8th Asia-Pacific Workshop on Networking•August 2024, pp 211-212• https://doi.org/10.1145/3663408.3665905- 0Citation
- 20
- Downloads
MetricsTotal Citations0Total Downloads20Last 12 Months20Last 6 weeks7
- Mingtai Lv
- research-articleOpen AccessPublished By ACMPublished By ACM
Training Job Placement in Clusters with Statistical In-Network Aggregation
- Bohan Zhao
Tsinghua University, Beijing, Beijing, China
, - Wei Xu
Tsinghua University, Beijing, Beijing, China
, - Shuo Liu
Huawei Technologies Co., Ltd., Beijing, Beijing, China
, - Yang Tian
Huawei Technologies Co., Ltd., Beijing, Beijing, China
, - Qiaoling Wang
Huawei Technologies Co., Ltd., Beijing, Beijing, China
, - Wenfei Wu
Peking University, Beijing, Beijing, China
ASPLOS '24: Proceedings of the 29th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 1•April 2024, pp 420-434• https://doi.org/10.1145/3617232.3624863In-Network Aggregation (INA) offloads the gradient aggregation in distributed training (DT) onto programmable switches, where the switch memory could be allocated to jobs in either synchronous or statistical multiplexing mode. Statistical INA has ...
- 0Citation
- 838
- Downloads
MetricsTotal Citations0Total Downloads838Last 12 Months838Last 6 weeks109
- Bohan Zhao
- research-articleOpen AccessPublished By ACMPublished By ACM
ClickINC: In-network Computing as a Service in Heterogeneous Programmable Data-center Networks
- Wenquan Xu
Tsinghua University, Beijing, China
, - Zijian Zhang
Tsinghua University, Beijing, China
, - Yong Feng
Tsinghua University, Beijing, China
, - Haoyu Song
Futurewei Technologies, Santa Clara, United States of America
, - Zhikang Chen
Tsinghua University, Beijing, China
, - Wenfei Wu
Peking University, Beijing, China
, - Guyue Liu
New York University Shanghai, Shanghai, China
, - Yinchao Zhang
Tsinghua University, Beijing, China
, - Shuxin Liu
Tsinghua University, Beijing, China
, - Zerui Tian
Tsinghua University, Beijing, China
, - Bin Liu
Tsinghua University, Beijing, China
ACM SIGCOMM '23: Proceedings of the ACM SIGCOMM 2023 Conference•September 2023, pp 798-815• https://doi.org/10.1145/3603269.3604835In-Network Computing (INC) has found many applications for performance boosts or cost reduction. However, given heterogeneous devices, diverse applications, and multi-path network typologies, it is cumbersome and error-prone for application developers to ...
- 9Citation
- 2,008
- Downloads
MetricsTotal Citations9Total Downloads2,008Last 12 Months1,376Last 6 weeks122
- Wenquan Xu
- research-articlefreePublished By ACMPublished By ACM
MimoSketch: A Framework to Mine Item Frequency on Multiple Nodes with Sketches
- Yuchen Xu
Peking University, Beijing, China
, - Wenfei Wu
Peking University, Beijing, China
, - Bohan Zhao
Tsinghua University, Beijing, China
, - Tong Yang
Peking University, Beijing, China
, - Yikai Zhao
Peking University, Beijing, China
KDD '23: Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining•August 2023, pp 2838-2849• https://doi.org/10.1145/3580305.3599433We abstract a MIMO scenario in distributed data stream mining, where a stream of multiple items is mined by multiple nodes. We design a framework named MimoSketch for the MIMO-specific scenario, which improves the fundamental mining task of item ...
- 0Citation
- 272
- Downloads
MetricsTotal Citations0Total Downloads272Last 12 Months161Last 6 weeks12- 1
Supplementary Materialrtfp1460-2min-promo.mp4
- Yuchen Xu
- research-articlePublished By ACMPublished By ACM
In-Network Aggregation with Transport Transparency for Distributed Training
- Shuo Liu
Huawei Technologies, China
, - Qiaoling Wang
Huawei Technologies, China
, - Junyi Zhang
Huawei Technologies, China
, - Wenfei Wu
Peking University, China
, - Qinliang Lin
Huawei Technologies, China
, - Yao Liu
Sun Yat-sen University, China
, - Meng Xu
Huawei Technologies, China
, - Marco Canini
King Abdullah University of Science and Technology, Saudi Arabia
, - Ray C. C. Cheung
City University of Hong Kong, China
, - Jianfei He
City University of Hong Kong, China
ASPLOS 2023: Proceedings of the 28th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 3•March 2023, pp 376-391• https://doi.org/10.1145/3582016.3582037Recent In-Network Aggregation (INA) solutions offload the all-reduce operation onto network switches to accelerate and scale distributed training (DT). On end hosts, these solutions build custom network stacks to replace the transport layer. The INA-...
- 11Citation
- 991
- Downloads
MetricsTotal Citations11Total Downloads991Last 12 Months473Last 6 weeks56
- Shuo Liu
- research-articlePublished By ACMPublished By ACM
A Generic Service to Provide In-Network Aggregation for Key-Value Streams
- Yongchao He
Tsinghua University, China
, - Wenfei Wu
Peking University, China
, - Yanfang Le
Intel, USA
, - Ming Liu
University of Wisconsin-Madison, USA
, - ChonLam Lao
Harvard University, USA
ASPLOS 2023: Proceedings of the 28th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 2•January 2023, pp 33-47• https://doi.org/10.1145/3575693.3575708Key-value stream aggregation is a common operation in distributed systems, which requires intensive computation and network resources. We propose a generic in-network aggregation service for key-value streams, ASK, to accelerate the aggregation ...
- 5Citation
- 1,011
- Downloads
MetricsTotal Citations5Total Downloads1,011Last 12 Months271Last 6 weeks20
- Yongchao He
- research-article
WRS: Workflow Retrieval System for Cloud Automatic Remediation
- Hongyi Huang
Tsinghua University
, - Wenfei Wu
Peking University
, - Shimin Tao
Huawei
NOMS 2022-2022 IEEE/IFIP Network Operations and Management Symposium•April 2022, pp 1-10• https://doi.org/10.1109/NOMS54207.2022.9789843Remediation systems in modern information infrastructure gradually take over the increasing workload of unexpected events from operators. The core logic in such systems — remediation rule <symptom, workflow> — still needs ...
- 0Citation
MetricsTotal Citations0
- Hongyi Huang
- research-article
HyperSFP: Fault-Tolerant Service Function Chain Provision on Programmable Switches in Data Centers
- Hongyi Huang
Tsinghua University
, - Wenfei Wu
Peking University
NOMS 2022-2022 IEEE/IFIP Network Operations and Management Symposium•April 2022, pp 1-9• https://doi.org/10.1109/NOMS54207.2022.9789756With the cloud networks being equipped with programmable switch, Service Function Chain (SFC) provision has started to be migrated to the switches for better performance and manageability. In this paper, we design HyperSFP which places multiple SFCs to a ...
- 0Citation
MetricsTotal Citations0
- Hongyi Huang
- articlePublished By ACMPublished By ACM
Simultaneously Achieving Sublinear Regret and Constraint Violations for Online Convex Optimization with Time-varying Constraints
- Qingsong Liu
IIIS, Tsinghua University, China
, - Wenfei Wu
Peking University, China
, - Longbo Huang
IIIS, Tsinghua University, China
, - Zhixuan Fang
IIIS, Tsinghua University, China
ACM SIGMETRICS Performance Evaluation Review, Volume 49, Issue 3•December 2021, pp 4-5 • https://doi.org/10.1145/3529113.3529114In this paper, we develop a novel virtual-queue-based online algorithm for online convex optimization (OCO) problems with long-term and time-varying constraints and conduct a performance analysis with respect to the dynamic regret and constraint ...
- 4Citation
- 113
- Downloads
MetricsTotal Citations4Total Downloads113Last 12 Months38Last 6 weeks7
- Qingsong Liu
- research-article
HyperNAT: Scaling Up Network Address Translation with SmartNICs for Clouds
- Shaoke Fang
Tsinghua University
, - Qingsong Liu
Tsinghua University
, - Wenfei Wu
Tsinghua University
2021 IEEE Global Communications Conference (GLOBECOM)•December 2021, pp 1-6• https://doi.org/10.1109/GLOBECOM46510.2021.9685551Network address translation (NAT) is a basic functionality in cloud gateways. With the increasing traffic volume and number of flows introduced by the cloud tenants, the NAT gateway needs to be implemented on a cluster of servers. We propose to scale up ...
- 1Citation
MetricsTotal Citations1
- Shaoke Fang
- research-article
Simultaneously achieving sublinear regret and constraint violations for online convex optimization with time-varying constraints
- Qingsong Liu
Institute for Interdisciplinary Information Sciences, Tsinghua University, China
, - Wenfei Wu
School of Electronics Engineering and Computer Science, Peking University, China
, - Longbo Huang
Institute for Interdisciplinary Information Sciences, Tsinghua University, China
, - Zhixuan Fang
Institute for Interdisciplinary Information Sciences, Tsinghua University, China
Shanghai Qi Zhi Institute, Shanghai, China
AbstractIn this paper, we develop a novel virtual-queue-based online algorithm for online convex optimization (OCO) problems with long-term and time-varying constraints and conduct a performance analysis with respect to the dynamic regret and ...
- 4Citation
MetricsTotal Citations4
- Qingsong Liu
- research-articlePublished By ACMPublished By ACM
DHS: Adaptive Memory Layout Organization of Sketch Slots for Fast and Accurate Data Stream Processing
- Bohan Zhao
Tsinghua University, Beijing, China
, - Xiang Li
Tsinghua University, Beijing, China
, - Boyu Tian
Tsinghua University, Beijing, China
, - Zhiyu Mei
Tsinghua University, Beijing, China
, - Wenfei Wu
Tsinghua University, Beijing, China
KDD '21: Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining•August 2021, pp 2285-2293• https://doi.org/10.1145/3447548.3467353Data stream processing is a crucial computation task in data mining applications. The rigid and fixed data structures in existing solutions limit their accuracy, throughput, and generality in measurement tasks. We propose Dynamic Hierarchical Sketch (DHS)...
- 23Citation
- 498
- Downloads
MetricsTotal Citations23Total Downloads498Last 12 Months114Last 6 weeks15- 1
Supplementary MaterialKDD21-rst2580.mp4
- Bohan Zhao
- research-articlePublished By ACMPublished By ACM
Automated Finite State Machine Extraction
- Yongheng Chen
NJU, Pennsylvania State University, State College, PA, USA
, - Linhai Song
Pennsylvania State University, State College, PA, USA
, - Xinyu Xing
Pennsylvania State University, State College, PA, USA
, - Fengyuan Xu
Nanjing University, Nanjing, China
, - Wenfei Wu
Tsinghua University, Beijing, China
FEAST'19: Proceedings of the 3rd ACM Workshop on Forming an Ecosystem Around Software Transformation•November 2019, pp 9-15• https://doi.org/10.1145/3338502.3359760Finite state machine (FSM) is a type of computation models widely used in various software programs. Extracting implemented FSMs has many important applications in the networking, software engineering and security domains. In this paper, we first ...
- 3Citation
- 319
- Downloads
MetricsTotal Citations3Total Downloads319Last 12 Months49Last 6 weeks2
- Yongheng Chen
- short-paperPublished By ACMPublished By ACM
Fully Functional Rate Limiter Design on Programmable Hardware Switches
- Yongchao He
Tsinghua University
, - Wenfei Wu
Tsinghua University
SIGCOMM Posters and Demos '19: Proceedings of the ACM SIGCOMM 2019 Conference Posters and Demos•August 2019, pp 159-160• https://doi.org/10.1145/3342280.3342344- 6Citation
- 320
- Downloads
MetricsTotal Citations6Total Downloads320Last 12 Months20Last 6 weeks2
- Yongchao He
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