Zhengya Zhang

Applied Filters

Zhengya Zhang
AuthorRemove filter

Clear all

People

Colleagues

Zhengya Zhang (14)
Borivoje Nikolić (5)
Lara Dolecek (4)
Martin J Wainwright (4)
Venkat Anantharam (4)
Jiefang Zhang (2)
Pamela Lee (2)
Wei Tang (2)
Yaoyu Tao (2)
Anthony Chun (1)
Borislav Alexandrov (1)
Brian C Richards (1)
Chiahsiang Chen (1)
Farhana Sheikh (1)
Haoran Li (1)
Hossein Alavi (1)
Keith A Bowman (1)
Phil Knag (1)
Shiming Song (1)
Youn Sung Park (1)

Publication

Journal/Magazine Names

IEEE Journal on Selected Areas in Communications (1)
IEEE Transactions on Communications (1)
IEEE Transactions on Computers (1)
IEEE Transactions on Information Theory (1)
IEEE Transactions on Nanotechnology (1)
Journal of Signal Processing Systems (1)

Proceedings/Book Names

MICRO '21: MICRO-54: 54th Annual IEEE/ACM International Symposium on Microarchitecture (2)
2021 IEEE Global Communications Conference (GLOBECOM) (1)
Asilomar'09: Proceedings of the 43rd Asilomar conference on Signals, systems and computers (1)
FPGA '12: Proceedings of the ACM/SIGDA international symposium on Field Programmable Gate Arrays (1)
FPGA '13: Proceedings of the ACM/SIGDA international symposium on Field programmable gate arrays (1)
ISLPED '24: Proceedings of the 29th ACM/IEEE International Symposium on Low Power Electronics and Design (1)
MICRO '52: Proceedings of the 52nd Annual IEEE/ACM International Symposium on Microarchitecture (1)

Publisher

Association for Computing Machinery (6)
IEEE Press (6)
IEEE Computer Society (1)
Kluwer Academic Publishers (1)

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

14 Results for: Author: Zhengya ZhangEdit 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,836,941 records)|Limit your search to The ACM Full-Text Collection (774,364 records)

Results

Showing 1 - 14of14 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
Published By ACM
Published By ACM
Design Approach for Die-to-Die Interfaces to Enable Energy-Efficient Chiplet Systems
- Vikram Jain
  University of California, Berkeley, Berkeley, CA, United States
  ,
- Wei Tang
  University of Michigan, Ann Arbor, MI, United States
  ,
- Zuoguo Wu
  Intel Corporation, Santa Clara, CA, United States
  ,
- Viansa Schmulbach
  University of California, Berkeley, Berkeley, CA, United States
  ,
- Sophia Shao
  University of California, Berkeley, Berkeley, CA, United States
  ,
- Zhengya Zhang
  University of Michigan, Ann Arbor, MI, United States
  ,
- Borivoje Nikolic
  University of California, Berkeley, Berkeley, CA, United States
ISLPED '24: Proceedings of the 29th ACM/IEEE International Symposium on Low Power Electronics and Design•August 2024, pp 1-6• https://doi.org/10.1145/3665314.3680473

Heterogeneous chiplet integration and advanced packaging have given a new lease to scaling of compute in a post-Moore era. A critical aspect of designing chiplet systems is die-to-die interfaces for aggregation of smaller disaggregated chiplets. In ...
0Citation
301
Downloads
Metrics
Total Citations0
Total Downloads301
Last 12 Months301
Last 6 weeks73
Export Citations
Save to Binder
Get Access
research-article
TetriX: Flexible Architecture and Optimal Mapping for Tensorized Neural Network Processing
- Jie-Fang Zhang
  Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, MI, USA
  ,
- Cheng-Hsun Lu
  Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, MI, USA
  ,
- Zhengya Zhang
  Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, MI, USA
IEEE Transactions on Computers, Volume 73, Issue 5•May 2024, pp 1219-1232 • https://doi.org/10.1109/TC.2024.3365936
The continuous growth of deep neural network model size and complexity hinders the adoption of large models in resource-constrained platforms. Tensor decomposition has been shown effective in reducing the model size by large compression ratios, but the ...
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
research-article
DNC-Aided SCL-Flip Decoding of Polar Codes
- Yaoyu Tao
  University of Michigan,Department of Electrical Engineering and Computer Science,Ann Arbor,MI,USA,48109
  ,
- Zhengya Zhang
  University of Michigan,Department of Electrical Engineering and Computer Science,Ann Arbor,MI,USA,48109
2021 IEEE Global Communications Conference (GLOBECOM)•December 2021, pp 01-06• https://doi.org/10.1109/GLOBECOM46510.2021.9685277
Successive-cancellation list (SCL) decoding of polar codes has been adopted for 5G wireless communications. How-ever, the performance of moderate code length is not satisfactory. Heuristic or deep-learning-aided (DL-aided) flip algorithms have been ...
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
research-article
Published By ACM
Published By ACM
Point-X: A Spatial-Locality-Aware Architecture for Energy-Efficient Graph-Based Point-Cloud Deep Learning
- Jie-Fang Zhang
  University of Michigan, Ann Arbor, United States of America
  ,
- Zhengya Zhang
  University of Michigan, Ann Arbor, United States of America
MICRO '21: MICRO-54: 54th Annual IEEE/ACM International Symposium on Microarchitecture•October 2021, pp 1078-1090• https://doi.org/10.1145/3466752.3480081

Deep learning on point clouds has attracted increasing attention in the fields of 3D computer vision and robotics. In particular, graph-based point-cloud deep neural networks (DNNs) have demonstrated promising performance in 3D object classification and ...
14Citation
1,178
Downloads
Metrics
Total Citations14
Total Downloads1,178
Last 12 Months151
Last 6 weeks9
Export Citations
Save to Binder
Get Access
research-article
Published By ACM
Published By ACM
HiMA: A Fast and Scalable History-based Memory Access Engine for Differentiable Neural Computer
- Yaoyu Tao
  University of Michigan, Ann Arbor, United States of America
  ,
- Zhengya Zhang
  University of Michigan, Ann Arbor, United States of America
MICRO '21: MICRO-54: 54th Annual IEEE/ACM International Symposium on Microarchitecture•October 2021, pp 845-856• https://doi.org/10.1145/3466752.3480052

Memory-augmented neural networks (MANNs) provide better inference performance in many tasks with the help of an external memory. The recently developed differentiable neural computer (DNC) is a MANN that has been shown to outperform in representing ...
4Citation
520
Downloads
Metrics
Total Citations4
Total Downloads520
Last 12 Months39
Last 6 weeks1
Export Citations
Save to Binder
Get Access
research-article
Public Access
Published By ACM
Published By ACM
CASCADE: Connecting RRAMs to Extend Analog Dataflow In An End-To-End In-Memory Processing Paradigm
- Teyuh Chou
  University of Michigan, Ann Arbor
  ,
- Wei Tang
  University of Michigan, Ann Arbor
  ,
- Jacob Botimer
  University of Michigan, Ann Arbor
  ,
- Zhengya Zhang
  University of Michigan, Ann Arbor
MICRO '52: Proceedings of the 52nd Annual IEEE/ACM International Symposium on Microarchitecture•October 2019, pp 114-125• https://doi.org/10.1145/3352460.3358328

Processing in memory (PIM) is a concept to enable massively parallel dot products while keeping one set of operands in memory. PIM is ideal for computationally demanding deep neural networks (DNNs) and recurrent neural networks (RNNs). Processing in ...
58Citation
2,367
Downloads
Metrics
Total Citations58
Total Downloads2,367
Last 12 Months410
Last 6 weeks44
Export Citations
Save to Binder
View online with eReader
PDF
article
3.2 Gbps Channel-Adaptive Configurable MIMO Detector for Multi-Mode Wireless Communication
- Farhana Sheikh
  Intel Labs, Intel Corporation, Hillsboro, USA 97124
  ,
- Chia-Hsiang Chen
  Intel Labs, Intel Corporation, Hillsboro, USA 97124
  ,
- Dongmin Yoon
  Intel Labs, Intel Corporation, Hillsboro, USA 97124
  ,
- Borislav Alexandrov
  Intel Labs, Intel Corporation, Hillsboro, USA 97124
  ,
- Keith Bowman
  Intel Labs, Intel Corporation, Hillsboro, USA 97124
  ,
- Anthony Chun
  Intel Labs, Intel Corporation, Santa Clara, USA 95054
  ,
- Hossein Alavi
  Intel Labs, Intel Corporation, Hillsboro, USA 97124
  ,
- Zhengya Zhang
  Department of EECS, University of Michigan, Ann Arbor, Ann Arbor, USA 48109-2122
Journal of Signal Processing Systems, Volume 84, Issue 3•September 2016, pp 295-307 • https://doi.org/10.1007/s11265-015-1093-2

A configurable, channel-adaptive K-best multiple-input, multiple-output (MIMO) detector for multi-mode wireless communications that adapts computation to varying channel conditions to achieve high energy-efficiency is presented. An 8-stage configurable ...
2Citation
Metrics
Total Citations2
Export Citations
Save to Binder
research-article
A Native Stochastic Computing Architecture Enabled by Memristors
- Phil Knag
  Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, MI, USA
  ,
- Wei Lu
  Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, MI, USA
  ,
- Zhengya Zhang
  Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, MI, USA
IEEE Transactions on Nanotechnology, Volume 13, Issue 2•March 2014, pp 283-293 • https://doi.org/10.1109/TNANO.2014.2300342

A two-terminal memristor device is a promising digital memory for its high integration density, substantially lower energy consumption compared to CMOS, and scalability below 10 nm. However, a nanoscale memristor is an inherently stochastic device, and ...
16Citation
Metrics
Total Citations16
Export Citations
Save to Binder
poster
Published By ACM
Published By ACM
An FPGA-based transient error simulator for evaluating resilient system designs (abstract only)
- Chia-Hsiang Chen
  University of Michigan, Ann Arbor, MI, USA
  ,
- Shiming Song
  University of Michigan, Ann Arbor, MI, USA
  ,
- Zhengya Zhang
  University of Michigan, Ann Arbor, MI, USA
FPGA '13: Proceedings of the ACM/SIGDA international symposium on Field programmable gate arrays•February 2013, pp 271-271• https://doi.org/10.1145/2435264.2435328

Error-resilient designs have become more important with the continued device scaling. One critical challenge of designing error-resilient systems is the lack of tools to quickly and accurately evaluate the effectiveness and performance of such systems. ...
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
Get Access
research-article
Published By ACM
Published By ACM
Reconfigurable architecture and automated design flow for rapid FPGA-based LDPC code emulation
- Haoran Li
  University of Michigan, Ann Arbor, MI, USA
  ,
- Youn Sung Park
  University of Michigan, Ann Arbor, MI, USA
  ,
- Zhengya Zhang
  University of Michigan, Ann Arbor, MI, USA
FPGA '12: Proceedings of the ACM/SIGDA international symposium on Field Programmable Gate Arrays•February 2012, pp 167-170• https://doi.org/10.1145/2145694.2145722

Multitude of design freedoms of LDPC codes and practical decoders require fast simulations. FPGA emulation is attractive but inaccessible due to its design complexity. We propose a library and script based approach to automate the construction of FPGA ...
7Citation
303
Downloads
Metrics
Total Citations7
Total Downloads303
Last 12 Months10
Export Citations
Save to Binder
Get Access
research-article
Analysis of absorbing sets and fully absorbing sets of array-based LDPC codes
- Lara Dolecek
  Electrical Engineering Department, University of California, Los Angeles, Los Angeles, CA and Electrical Engineering and Computer Science Department, Massachusetts Institute of Technology, Cambridge, MA
  ,
- Zhengya Zhang
  Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, MI and Department of Electrical Engineering and Computer Sciences, University of California, Berkeley
  ,
- Venkat Anantharam
  Electrical Engineering and Computer Science Department, University of California, Berkeley, Berkeley, CA
  ,
- Martin J. Wainwright
  Electrical Engineering and Computer Science Department, University of California, Berkeley, Berkeley, CA
  ,
- Borivoje Nikolić
  Electrical Engineering and Computer Science Department, University of California, Berkeley, Berkeley, CA
IEEE Transactions on Information Theory, Volume 56, Issue 1•January 2010, pp 181-201 • https://doi.org/10.1109/TIT.2009.2034781

The class of low-density parity-check (LDPC) codes is attractive, since such codes can be decoded using practical message-passing algorithms, and their performance is known to approach the Shannon limits for suitably large block lengths. For the ...
30Citation
Metrics
Total Citations30
Export Citations
Save to Binder
Article
Low error rate LDPC decoders
- Zhengya Zhang
  Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor
  ,
- Lara Dolecek
  Department of Electrical Engineering, University of California, Los Angeles
  ,
- Pamela Lee
  Department of Electrical Engineering and Computer Sciences, University of California, Berkeley
  ,
- Venkat Anantharam
  Department of Electrical Engineering and Computer Sciences, University of California, Berkeley
  ,
- Martin J. Wainwright
  Department of Electrical Engineering and Computer Sciences, University of California, Berkeley
  ,
- Brian Richards
  Department of Electrical Engineering and Computer Sciences, University of California, Berkeley
  ,
- Borivoje Nikolić
  Department of Electrical Engineering and Computer Sciences, University of California, Berkeley
Asilomar'09: Proceedings of the 43rd Asilomar conference on Signals, systems and computers•November 2009, pp 1278-1282

Low-density parity-check (LDPC) codes have been demonstrated to perform very close to the Shannon limit when decoded iteratively. However challenges persist in building practical high-throughput decoders due to the existence of error floors at low error ...
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
article
Design of LDPC decoders for improved low error rate performance: quantization and algorithm choices
- Zhengya Zhang
  Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, MI and Department of Electrical Engineering and Computer Sciences, University of California, Berkeley
  ,
- Lara Dolecek
  Department of Electrical Engineering, University of California, Los Angeles, Los Angeles, CA
  ,
- Borivoje Nikolic
  Department of Electrical Engineering and Computer Sciences, University of California, Berkeley, CA
  ,
- Venkat Anantharam
  Department of Electrical Engineering and Computer Sciences, University of California, Berkeley, CA
  ,
- Martin J. Wainwright
  Department of Electrical Engineering and Computer Sciences, University of California, Berkeley, CA
IEEE Transactions on Communications, Volume 57, Issue 11•November 2009, pp 3258-3268 • https://doi.org/10.1109/TCOMM.2009.11.080105

Many classes of high-performance low-density parity-check (LDPC) codes are based on parity check matrices composed of permutation submatrices. We describe the design of a parallel-serial decoder architecture that can be used to map any LDPC code with ...
12Citation
Metrics
Total Citations12
Export Citations
Save to Binder
research-article
Predicting error floors of structured LDPC codes: deterministic bounds and estimates
- Lara Dolecek
  EECS Department, Massachusetts Institute of Technology, Cambridge, MA
  ,
- Pamela Lee
  EECS Department, University of California, Berkeley, Berkeley, CA
  ,
- Zhengya Zhang
  EECS Department, University of California, Berkeley, Berkeley, CA
  ,
- Venkat Anantharam
  EECS Department, University of California, Berkeley, Berkeley, CA
  ,
- Borivoje Nikolic
  EECS Department, University of California, Berkeley, Berkeley, CA
  ,
- Martin Wainwright
  EECS Department, University of California, Berkeley, Berkeley, CA
IEEE Journal on Selected Areas in Communications, Volume 27, Issue 6•August 2009, pp 908-917 • https://doi.org/10.1109/JSAC.2009.090809

The error-correcting performance of low-density parity check (LDPC) codes, when decoded using practical iterative decoding algorithms, is known to be close to Shannon limits for codes with suitably large blocklengths. A substantial limitation to the use ...
11Citation
Metrics
Total Citations11
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

Zhengya Zhang

Zhengya Zhang

Applied Filters

People

Colleagues

Publication

Journal/Magazine Names

Proceedings/Book Names

All Publications

Content Type

Media Formats

Publisher

Publication Date

Results

Design Approach for Die-to-Die Interfaces to Enable Energy-Efficient Chiplet Systems

TetriX: Flexible Architecture and Optimal Mapping for Tensorized Neural Network Processing

DNC-Aided SCL-Flip Decoding of Polar Codes

Point-X: A Spatial-Locality-Aware Architecture for Energy-Efficient Graph-Based Point-Cloud Deep Learning

HiMA: A Fast and Scalable History-based Memory Access Engine for Differentiable Neural Computer

CASCADE: Connecting RRAMs to Extend Analog Dataflow In An End-To-End In-Memory Processing Paradigm

3.2 Gbps Channel-Adaptive Configurable MIMO Detector for Multi-Mode Wireless Communication

A Native Stochastic Computing Architecture Enabled by Memristors

An FPGA-based transient error simulator for evaluating resilient system designs (abstract only)

Reconfigurable architecture and automated design flow for rapid FPGA-based LDPC code emulation

Analysis of absorbing sets and fully absorbing sets of array-based LDPC codes

Low error rate LDPC decoders

Design of LDPC decoders for improved low error rate performance: quantization and algorithm choices

Predicting error floors of structured LDPC codes: deterministic bounds and estimates