Jun Lin

Applied Filters

Jun Lin
AuthorRemove filter

Clear all

People

Colleagues

Jun Lin (32)
Zhiyuan Yan (12)
Zhongfeng Wang (11)
Jin Sha (9)
Li Li (6)
Chenrong Xiong (5)
Zhongfeng Wang (5)
Hongmei Xie (3)
Minglun Gao (3)
Chao Fang (2)
Fangxuan Sun (2)
Jing Tian (2)
Bruce W Suter (1)
Johann Großschädl (1)
Xiaohu You (1)
Xuebin Wu (1)
Xuehai Qian (1)
Yufei Ma (1)
Zaichen Zhang (1)
Zhe Liu (1)

Publication

Journal/Magazine Names

IEEE Transactions on Very Large Scale Integration (VLSI) Systems (10)
IEEE Transactions on Circuits and Systems II: Express Briefs (3)
IEEE Transactions on Signal Processing (3)
IEEE Transactions on Circuits and Systems Part I: Regular Papers (2)
IEEE Transactions on Computers (2)
Journal of Signal Processing Systems (2)
IEEE Transactions on Consumer Electronics (1)

Proceedings/Book Names

2016 IEEE International Symposium on Circuits and Systems (ISCAS) (2)
2018 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) (2)
2016 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) (1)
ASPDAC '24: Proceedings of the 29th Asia and South Pacific Design Automation Conference (1)
GLSVLSI '20: Proceedings of the 2020 on Great Lakes Symposium on VLSI (1)
ISCA '19: Proceedings of the 46th International Symposium on Computer Architecture (1)
SIPS '12: Proceedings of the 2012 IEEE Workshop on Signal Processing Systems (1)

Publisher

IEEE Press (15)
IEEE Educational Activities Department (10)
IEEE Computer Society (3)
Association for Computing Machinery (2)
Kluwer Academic Publishers (2)

Publication Date

Upon changing this filter the page will automatically refresh

Past 5 years
Past 2 years
Past year

Export Citations

Select Citation format

Please download or close your previous search result export first before starting a new bulk export.
Preview is not available.
By clicking download,a status dialog will open to start the export process. The process may takea few minutes but once it finishes a file will be downloadable from your browser. You may continue to browse the DL while the export process is in progress.
Download
- Download citation
- Copy citation

Publications

32 Results for: Author: Jun LinEdit SearchSave SearchFailed to save your search, try again laterSearch has been saved (My Saved Searches)

Save this search

Please login to be able to save your searches and receive alerts for new content matching your search criteria.

Searched The ACM Guide to Computing Literature (3,766,035 records)|Limit your search to The ACM Full-Text Collection (758,849 records)

Results

Showing 1 - 20of32 Results

Filters

Select All

Export Citations Save to Binder

Save to Binder

Create a New Binder

Name

per page:

Sort by: Latest

Recency
Earliest
Most Downloaded
Most Cited

research-article
Amoeba: An Efficient and Flexible FPGA-Based Accelerator for Arbitrary-Kernel CNNs
- Xiao Wu
  School of Electronic Science and Engineering, Nanjing University, Nanjing, China
  ,
- Miaoxin Wang
  School of Electronic Science and Engineering, Nanjing University, Nanjing, China
  ,
- Jun Lin
  School of Electronic Science and Engineering and the Interdisciplinary Research Center for Future Intelligent Chips (Chip-X), Nanjing University, Nanjing, China
  ,
- Zhongfeng Wang
  School of Electronic Science and Engineering, Nanjing University, Nanjing, China
IEEE Transactions on Very Large Scale Integration (VLSI) Systems, Volume 32, Issue 6•June 2024, pp 1086-1099 • https://doi.org/10.1109/TVLSI.2024.3383871
Inspired by the key operation of vision transformers (ViTs), convolutional neural networks (CNNs) have widely adopted arbitrary-kernel convolutions to achieve high performance in diverse vision-based tasks. However, existing hardware efforts primarily ...
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
research-article
A Precision-Scalable RISC-V DNN Processor with On-Device Learning Capability at the Extreme Edge
- Longwei Huang
  School of Electronic Science and Engineering, Nanjing University, China
  ,
- Chao Fang
  School of Electronic Science and Engineering, Nanjing University, China
  ,
- Qiong Li
  School of Electronic Science and Engineering, Nanjing University, China
  ,
- Jun Lin
  School of Electronic Science and Engineering, Nanjing University, China
  ,
- Zhongfeng Wang
  School of Electronic Science and Engineering, Nanjing University, China
ASPDAC '24: Proceedings of the 29th Asia and South Pacific Design Automation Conference•January 2024, pp 927-932• https://doi.org/10.1109/ASP-DAC58780.2024.10473817

Extreme edge platforms, such as in-vehicle smart devices, require efficient deployment of quantized deep neural networks (DNNs) to enable intelligent applications with limited amounts of energy, memory, and computing resources. However, many edge devices ...
0Citation
21
Downloads
Metrics
Total Citations0
Total Downloads21
Last 12 Months21
Last 6 weeks4
Export Citations
Save to Binder
Get Access
research-article
An Efficient Massive MIMO Detector Based on Approximate Expectation Propagation
- Yangyang Chen
  School of Electronic Science and Engineering, Nanjing University, Nanjing, China
  ,
- Suwen Song
  School of Electronic Science and Engineering, Nanjing University, Nanjing, China
  ,
- Zhongfeng Wang
  School of Electronic Science and Engineering, Nanjing University, Nanjing, China
  ,
- Jun Lin
  School of Electronic Science and Engineering, Nanjing University, Nanjing, China
IEEE Transactions on Very Large Scale Integration (VLSI) Systems, Volume 31, Issue 5•May 2023, pp 696-700 • https://doi.org/10.1109/TVLSI.2023.3255234
Among expectation propagation (EP)-based massive multiple-input–multiple-output (MIMO) detection algorithms, EP with weighted Neumann-series approximation (EPA-wNSA) has the lowest computational complexity while requiring many iterations to ...
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
research-article
Efficient Software Implementation of the SIKE Protocol Using a New Data Representation
- Jing Tian
  School of Electronic Science and Engineering, Nanjing University, Nanjing, China
  ,
- Piaoyang Wang
  School of Electronic Science and Engineering, Nanjing University, Nanjing, China
  ,
- Zhe Liu
  College of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing, China
  ,
- Jun Lin
  School of Electronic Science and Engineering, Nanjing University, Nanjing, China
  ,
- Zhongfeng Wang
  School of Electronic Science and Engineering, Nanjing University, Nanjing, China
  ,
- Johann Großschädl
  University of Luxembourg, Esch-sur-Alzette, Luxembourg
IEEE Transactions on Computers, Volume 71, Issue 3•March 2022, pp 670-683 • https://doi.org/10.1109/TC.2021.3057331
Thanks to relatively small public and secret keys, the Supersingular Isogeny Key Encapsulation (SIKE) protocol made it into the third evaluation round of the post-quantum standardization project of the National Institute of Standards and Technology (NIST)...
2Citation
Metrics
Total Citations2
Export Citations
Save to Binder
research-article
Fast Modular Multipliers for Supersingular Isogeny-Based Post-Quantum Cryptography
- Jing Tian
  School of Electronic Science and Engineering, Nanjing University, Nanjing, China
  ,
- Jun Lin
  School of Electronic Science and Engineering, Nanjing University, Nanjing, China
  ,
- Zhongfeng Wang
  School of Electronic Science and Engineering, Nanjing University, Nanjing, China
IEEE Transactions on Very Large Scale Integration (VLSI) Systems, Volume 29, Issue 2•Feb. 2021, pp 359-371 • https://doi.org/10.1109/TVLSI.2020.3041786
As one of the postquantum protocol candidates, the supersingular isogeny key encapsulation (SIKE) protocol delivers promising public and secret key sizes over other candidates. Nevertheless, the considerable computations form the bottleneck and limit its ...
1Citation
Metrics
Total Citations1
Export Citations
Save to Binder
research-article
Evaluations on Deep Neural Networks Training Using Posit Number System
- Jinming Lu
  School of Electronic Science and Engineering, Nanjing University, Nanjing, China
  ,
- Chao Fang
  School of Electronic Science and Engineering, Nanjing University, Nanjing, China
  ,
- Mingyang Xu
  School of Electronic Science and Engineering, Nanjing University, Nanjing, China
  ,
- Jun Lin
  School of Electronic Science and Engineering, Nanjing University, Nanjing, China
  ,
- Zhongfeng Wang
  School of Electronic Science and Engineering, Nanjing University, Nanjing, China
IEEE Transactions on Computers, Volume 70, Issue 2•Feb. 2021, pp 174-187 • https://doi.org/10.1109/TC.2020.2985971
The training of Deep Neural Networks (DNNs) brings enormous memory requirements and computational complexity, which makes it a challenge to train DNN models on resource-constrained devices. Training DNNs with reduced-precision data representation is ...
9Citation
Metrics
Total Citations9
Export Citations
Save to Binder
short-paper
Published By ACM
Published By ACM
In-Memory Computing: The Next-Generation AI Computing Paradigm
- Yufei Ma
  Nanjing University, Nanjing, China
  ,
- Yuan Du
  Nanjing University, Nanjing, China
  ,
- Li Du
  Nanjing University, Nanjing, China
  ,
- Jun Lin
  Nanjing University, Nanjing, China
  ,
- Zhongfeng Wang
  Nanjing University, Nanjing , China
GLSVLSI '20: Proceedings of the 2020 on Great Lakes Symposium on VLSI•September 2020, pp 265-270• https://doi.org/10.1145/3386263.3407588

To overcome the memory bottleneck of von-Neuman architecture, various memory-centric computing techniques are emerging to reduce the latency and energy consumption caused by data communication. The great success of artificial intelligence (AI) ...
11Citation
871
Downloads
Metrics
Total Citations11
Total Downloads871
Last 12 Months176
Last 6 weeks11
1
Supplementary Material
3386263.3407588.mp4
Export Citations
Save to Binder
Get Access
research-article
Published By ACM
Published By ACM
TIE: energy-efficient tensor train-based inference engine for deep neural network
- Chunhua Deng
  Rutgers University
  ,
- Fangxuan Sun
  Nanjing University
  ,
- Xuehai Qian
  University of Southern California
  ,
- Jun Lin
  Nanjing University
  ,
- Zhongfeng Wang
  Nanjing University
  ,
- Bo Yuan
  Rutgers University
ISCA '19: Proceedings of the 46th International Symposium on Computer Architecture•June 2019, pp 264-278• https://doi.org/10.1145/3307650.3322258

In the era of artificial intelligence (AI), deep neural networks (DNNs) have emerged as the most important and powerful AI technique. However, large DNN models are both storage and computation intensive, posing significant challenges for adopting DNNs ...
40Citation
2,073
Downloads
Metrics
Total Citations40
Total Downloads2,073
Last 12 Months159
Last 6 weeks18
Export Citations
Save to Binder
Get Access
article
A Stage-Combined Belief Propagation Decoder for Polar Codes
- Jin Sha
  School of Electrical Science and Engineering, Nanjing University, Nanjing, China 210046
  ,
- Jingbo Liu
  School of Electrical Science and Engineering, Nanjing University, Nanjing, China 210046
  ,
- Jun Lin
  School of Electrical Science and Engineering, Nanjing University, Nanjing, China 210046
  ,
- Zhongfeng Wang
  School of Electrical Science and Engineering, Nanjing University, Nanjing, China 210046
Journal of Signal Processing Systems, Volume 90, Issue 5•May 2018, pp 687-694 • https://doi.org/10.1007/s11265-016-1181-y

Message-passing decoding algorithm based on belief propagation is a widely used decoding algorithm for error correction codes. For moderate length polar codes, it achieves the error correction performance similar to the successive cancellation algorithm ...
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
research-article
Approximate Belief Propagation Decoder for Polar Codes
- Menghui Xu
  Lab of Efficient Architectures for Digital-communication and Signal-processing (LEADS)
  ,
- Shusen Jing
  Lab of Efficient Architectures for Digital-communication and Signal-processing (LEADS)
  ,
- Jun Lin
  School of Electronic Science and Engineering, Nanjing University, Nanjing, China
  ,
- Weikang Qian
  University of Michigan-Shanghai Jiao Tong University Joint Institute, Shanghai, China
  ,
- Zaichen Zhang
  National Mobile Communications Research Laboratory, Southeast University
  ,
- Xiaohu You
  National Mobile Communications Research Laboratory, Southeast University
  ,
- Chuan Zhang
  Lab of Efficient Architectures for Digital-communication and Signal-processing (LEADS)
2018 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)•April 2018, pp 1169-1173• https://doi.org/10.1109/ICASSP.2018.8462478
Polar code is increasing its popularity recently for its capacity-achieving property for B-DMCs. However, when designing decoders for polar code, it has always been an inevitable concern for us to balance the decoding performance and the hardware ...
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
research-article
Eadnet: Efficient Architecture for Decomposed Convolutional Neural Networks
- Fangxuan Sun
  School of Electronic Science and Engineering, Nanjing University, P.R. China
  ,
- Jun Lin
  School of Electronic Science and Engineering, Nanjing University, P.R. China
  ,
- Zhongfeng Wang
  School of Electronic Science and Engineering, Nanjing University, P.R. China
2018 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)•April 2018, pp 1145-1149• https://doi.org/10.1109/ICASSP.2018.8461585
Convolutional neural networks (CNNs) are widely used in various intelligent tasks. However, the huge computational complexity of CNNs makes it hard to be implemented in many real-time embedded devices. Various methods have been employed to reduce the ...
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
research-article
An Energy-Efficient Architecture for Binary Weight Convolutional Neural Networks
- Yizhi Wang
  School of Electronic Science and Engineering, Nanjing University, Nanjing, China
  ,
- Jun Lin
  School of Electronic Science and Engineering, Nanjing University, Nanjing, China
  ,
- Zhongfeng Wang
  School of Electronic Science and Engineering, Nanjing University, Nanjing, China
IEEE Transactions on Very Large Scale Integration (VLSI) Systems, Volume 26, Issue 2•February 2018, pp 280-293 • https://doi.org/10.1109/TVLSI.2017.2767624

Binary weight convolutional neural networks (BCNNs) can achieve near state-of-the-art classification accuracy and have far less computation complexity compared with traditional CNNs using high-precision weights. Due to their binary weights, BCNNs are ...
11Citation
Metrics
Total Citations11
Export Citations
Save to Binder
research-article
Accelerating Recurrent Neural Networks: A Memory-Efficient Approach
- Zhisheng Wang
  School of Electronic Science and Engineering, Nanjing University, Nanjing, China
  ,
- Jun Lin
  School of Electronic Science and Engineering, Nanjing University, Nanjing, China
  ,
- Zhongfeng Wang
  School of Electronic Science and Engineering, Nanjing University, Nanjing, China
IEEE Transactions on Very Large Scale Integration (VLSI) Systems, Volume 25, Issue 10•Oct. 2017, pp 2763-2775 • https://doi.org/10.1109/TVLSI.2017.2717950
Recurrent neural networks (RNNs) have achieved the state-of-the-art performance on various sequence learning tasks due to their powerful sequence modeling capability. However, RNNs usually require a large number of parameters and high computational ...
11Citation
Metrics
Total Citations11
Export Citations
Save to Binder
research-article
Efficient Soft Cancelation Decoder Architectures for Polar Codes
- Jun Lin
  School of Electronic Science and Engineering, Nanjing University, Nanjing, China
  ,
- Zhiyuan Yan
  Department of Electrical and Computer Engineering, Lehigh University, Bethlehem, PA, USA
  ,
- Zhongfeng Wang
  School of Electronic Science and Engineering, Nanjing University, Nanjing, China
IEEE Transactions on Very Large Scale Integration (VLSI) Systems, Volume 25, Issue 1•January 2017, pp 87-99 • https://doi.org/10.1109/TVLSI.2016.2577883

The flooding belief propagation (FO-BP) and the soft-cancelation (SCAN) algorithms are the two most popular soft-output BP algorithms for the decoding of capacity-achieving polar codes. The FO-BP algorithm has high throughput at the cost of performance ...
1Citation
Metrics
Total Citations1
Export Citations
Save to Binder
research-article
A Multimode Area-Efficient SCL Polar Decoder
- Chenrong Xiong
  Department of Electrical and Computer Engineering, Lehigh University, Bethlehem, PA, USA
  ,
- Jun Lin
  Lehigh University, Bethlehem, PA, USA
  ,
- Zhiyuan Yan
  Department of Electrical and Computer Engineering, Lehigh University, Bethlehem, PA, USA
IEEE Transactions on Very Large Scale Integration (VLSI) Systems, Volume 24, Issue 12•December 2016, pp 3499-3512 • https://doi.org/10.1109/TVLSI.2016.2557806

Polar codes are of great interest, since they are the first provably capacity-achieving forward error correction codes. To improve throughput and to reduce decoding latency of polar decoders, maximum likelihood (ML) decoding units are used by successive ...
6Citation
Metrics
Total Citations6
Export Citations
Save to Binder
research-article
A High Throughput List Decoder Architecture for Polar Codes
- Jun Lin
  Department of Electrical and Computer Engineering, Lehigh University, Bethlehem, PA, USA
  ,
- Chenrong Xiong
  Department of Electrical and Computer Engineering, Lehigh University, Bethlehem, PA, USA
  ,
- Zhiyuan Yan
  Department of Electrical and Computer Engineering, Lehigh University, Bethlehem, PA, USA
IEEE Transactions on Very Large Scale Integration (VLSI) Systems, Volume 24, Issue 6•June 2016, pp 2378-2391 • https://doi.org/10.1109/TVLSI.2015.2499777
While long polar codes can achieve the capacity of arbitrary binary-input discrete memoryless channels when decoded by a low complexity successive-cancellation (SC) algorithm, the error performance of the SC algorithm is inferior for polar codes with ...
4Citation
Metrics
Total Citations4
Export Citations
Save to Binder
research-article
Stage-combined belief propagation decoding of polar codes
- Jin Sha
  Nanjing University, Nanjing, China
  ,
- Jun Lin
  Nanjing University, Nanjing, China
  ,
- Zhongfeng Wang
  Broadcom Corp., Irvine, CA, USA
2016 IEEE International Symposium on Circuits and Systems (ISCAS), pp 421-424• https://doi.org/10.1109/ISCAS.2016.7527260
A novel modification is introduced in this paper for the belief propagation decoder of polar codes, wherein adjacent two processing stages are efficiently combined together to speed up decoding. Corresponding path based belief estimation method is ...
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
research-article
A high throughput belief propagation decoder architecture for polar codes
- Jun Lin
  School of Electronic Science and Engineering, Nanjing University, Jiangsu, China
  ,
- Jin Sha
  School of Electronic Science and Engineering, Nanjing University, Jiangsu, China
  ,
- Li Li
  School of Electronic Science and Engineering, Nanjing University, Jiangsu, China
  ,
- Chenrong Xiong
  Department of ECE, Lehigh University, PA, USA
  ,
- Zhiyuan Yan
  Department of ECE, Lehigh University, PA, USA
  ,
- Zhongfeng Wang
  Broadcom Corporation, CA, USA
2016 IEEE International Symposium on Circuits and Systems (ISCAS), pp 153-156• https://doi.org/10.1109/ISCAS.2016.7527193
The belief propagation (BP) decoding algorithm not only is an alternative to the successive cancelation (SC) decoders of polar codes, but also provides soft outputs that are necessary for joint detection and decoding. The BP decoders with the flooding ...
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
research-article
Error performance analysis of the symbol-decision SC polar decoder
- Chenrong Xiong
  Department of Electrical and Computer Engineering, Lehigh University, Pennsylvania, USA
  ,
- Jun Lin
  School of Electronic Science and Engineering, Nanjing University, Jiangsu, China
  ,
- Zhiyuan Yan
  Department of Electrical and Computer Engineering, Lehigh University, Pennsylvania, USA
2016 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp 961-965• https://doi.org/10.1109/ICASSP.2016.7471818
Polar codes are the first provably capacity-achieving forward error correction codes. To improve decoder throughput, the symbol-decision SC algorithm makes hard-decision for multiple bits at a time. In this paper, we prove that for polar codes, the symbol-...
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
research-article
Symbol-Decision Successive Cancellation List Decoder for Polar Codes
- Chenrong Xiong
  Department of Electrical and Computer Engineering, Lehigh University, PA, USA
  ,
- Jun Lin
  School of Electronic Science and Engineering of Nanjing University, China
  ,
- Zhiyuan Yan
  Department of Electrical and Computer Engineering, Lehigh University, PA, USA
IEEE Transactions on Signal Processing, Volume 64, Issue 3•Feb.1, 2016, pp 675-687 • https://doi.org/10.1109/TSP.2015.2486750
Polar codes are of great interests because they provably achieve the symmetric capacity of discrete memoryless channels with arbitrary input alphabet sizes while having an explicit construction. Most existing decoding algorithms of polar codes are based ...
10Citation
Metrics
Total Citations10
Export Citations
Save to Binder

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. How do authors access ACM Author-Izer?
A. See How to Use

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

Jun Lin

Jun Lin

Applied Filters

People

Colleagues

Publication

Journal/Magazine Names

Proceedings/Book Names

All Publications

Content Type

Media Formats

Publisher

Publication Date

Amoeba: An Efficient and Flexible FPGA-Based Accelerator for Arbitrary-Kernel CNNs

A Precision-Scalable RISC-V DNN Processor with On-Device Learning Capability at the Extreme Edge

An Efficient Massive MIMO Detector Based on Approximate Expectation Propagation

Efficient Software Implementation of the SIKE Protocol Using a New Data Representation

Fast Modular Multipliers for Supersingular Isogeny-Based Post-Quantum Cryptography

Evaluations on Deep Neural Networks Training Using Posit Number System

In-Memory Computing: The Next-Generation AI Computing Paradigm

TIE: energy-efficient tensor train-based inference engine for deep neural network

A Stage-Combined Belief Propagation Decoder for Polar Codes

Approximate Belief Propagation Decoder for Polar Codes

Eadnet: Efficient Architecture for Decomposed Convolutional Neural Networks

An Energy-Efficient Architecture for Binary Weight Convolutional Neural Networks

Accelerating Recurrent Neural Networks: A Memory-Efficient Approach

Efficient Soft Cancelation Decoder Architectures for Polar Codes

A Multimode Area-Efficient SCL Polar Decoder

A High Throughput List Decoder Architecture for Polar Codes

Stage-combined belief propagation decoding of polar codes

A high throughput belief propagation decoder architecture for polar codes

Error performance analysis of the symbol-decision SC polar decoder

Symbol-Decision Successive Cancellation List Decoder for Polar Codes