Applied Filters
- Klaus Schneider
- AuthorRemove filter
People
Colleagues
- Jens Brandt (21)
- Thomas Kropf (17)
- Ramayya Kumar (14)
- Tobias Schuele (10)
- Georgios Logothetis (9)
- Kerstin Bauer (6)
- Manuel Gesell (6)
- Mike Gemünde (6)
- Sandeep Kumar Shukla (6)
- Raffaella Gentilini (5)
- Yu Bai (5)
- Andreas Morgenstern (4)
- Jean-Pierre Talpin (4)
- Maximilian Senftleben (3)
- Michaela Huhn (3)
- Omair Rafique (3)
- Thomas Tuerk (3)
- C Metzler (2)
- Michael Baldamus (2)
Publication
Journal/Magazine Names
- ACM Transactions on Embedded Computing Systems (3)
- Electronic Notes in Theoretical Computer Science (ENTCS) (3)
- Formal Methods in System Design (3)
- ACM SIGPLAN Notices (1)
- Design Automation for Embedded Systems (1)
- Fundamenta Informaticae (1)
- IEEE Transactions on Software Engineering (1)
- Innovations in Systems and Software Engineering (1)
- International Journal of Parallel Programming (1)
- Science of Computer Programming (1)
Proceedings/Book Names
- HUG '93: Proceedings of the 6th International Workshop on Higher Order Logic Theorem Proving and its Applications (3)
- ACSD '01: Proceedings of the Second International Conference on Application of Concurrency to System Design (2)
- ACSD '10: Proceedings of the 2010 10th International Conference on Application of Concurrency to System Design (2)
- CHARME '99: Proceedings of the 10th IFIP WG 10.5 Advanced Research Working Conference on Correct Hardware Design and Verification Methods (2)
- HOL'92: Proceedings of the IFIP TC10/WG10.2 Workshop on Higher Order Logic Theorem Proving and its Applications (2)
- HVC'06: Proceedings of the 2nd international Haifa verification conference on Hardware and software, verification and testing (2)
- MEMOCODE '03: Proceedings of the First ACM and IEEE International Conference on Formal Methods and Models for Co-Design (2)
- CASES '04: Proceedings of the 2004 international conference on Compilers, architecture, and synthesis for embedded systems (1)
- DATE '99: Proceedings of the conference on Design, automation and test in Europe (1)
- GLSVLSI '07: Proceedings of the 17th ACM Great Lakes symposium on VLSI (1)
- HSCC '10: Proceedings of the 13th ACM international conference on Hybrid systems: computation and control (1)
- LCTES '10: Proceedings of the ACM SIGPLAN/SIGBED 2010 conference on Languages, compilers, and tools for embedded systems (1)
- M-SCOPES '13: Proceedings of the 16th International Workshop on Software and Compilers for Embedded Systems (1)
- PLPV '12: Proceedings of the sixth workshop on Programming languages meets program verification (1)
- SCOPES '09: Proceedings of th 12th International Workshop on Software and Compilers for Embedded Systems (1)
- SCOPES '11: Proceedings of the 14th International Workshop on Software and Compilers for Embedded Systems (1)
- SCOPES '16: Proceedings of the 19th International Workshop on Software and Compilers for Embedded Systems (1)
- SEAMS '06: Proceedings of the 2006 international workshop on Self-adaptation and self-managing systems (1)
- WESE '12: Proceedings of the Workshop on Embedded and Cyber-Physical Systems Education (1)
- WESE'14: Proceedings of the WESE'14: Workshop on Embedded and Cyber-Physical Systems Education (1)
Publisher
- Springer-Verlag (32)
- Association for Computing Machinery (24)
- IEEE Computer Society (23)
- Kluwer Academic Publishers (6)
- Elsevier Science Publishers B. V. (3)
- European Design and Automation Association (3)
- IEEE Press (2)
- North-Holland/Elsevier (2)
- Chapman & Hall, Ltd. (1)
- Elsevier North-Holland, Inc. (1)
- IOS Press (1)
- Kluwer, B.V. (1)
- North-Holland Publishing Co. (1)
- SCITEPRESS - Science and Technology Publications, Lda (1)
- Society for Computer Simulation International (1)
- Springer Publishing Company, Incorporated (1)
- SpringerVerlag (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-articleOpen AccessPublished By ACMPublished By ACM
Code generation criteria for buffered exposed datapath architectures from dataflow graphs
- Klaus Schneider
University of Kaiserslautern, Germany
, - Anoop Bhagyanath
University of Kaiserslautern, Germany
, - Julius Roob
University of Kaiserslautern, Germany
LCTES 2022: Proceedings of the 23rd ACM SIGPLAN/SIGBED International Conference on Languages, Compilers, and Tools for Embedded Systems•June 2022, pp 133-145• https://doi.org/10.1145/3519941.3535076Many novel processor architectures expose their processing units (PUs) and internal datapaths to the compiler. To avoid an unnecessary synchronization of PUs, the datapaths are often buffered which results in buffered exposed datapath (BED) ...
- 4Citation
- 242
- Downloads
MetricsTotal Citations4Total Downloads242Last 12 Months103Last 6 weeks19
- Klaus Schneider
- research-articlePublished By ACMPublished By ACM
Translating structured sequential programs to dataflow graphs
- Klaus Schneider
University of Kaiserslautern, Kaiserslautern, Germany
MEMOCODE '21: Proceedings of the 19th ACM-IEEE International Conference on Formal Methods and Models for System Design•November 2021, pp 66-77• https://doi.org/10.1145/3487212.3487343In this paper, a translation from structured sequential programs to equivalent dataflow process networks (DPNs) is presented that is based on a carefully chosen set of nodes including load/store operations to access a shared global memory. For every data ...
- 1Citation
- 111
- Downloads
MetricsTotal Citations1Total Downloads111Last 12 Months20Last 6 weeks2
- Klaus Schneider
- research-articlePublished By ACMPublished By ACM
Compiling synchronous languages to optimal move code for exposed datapath architectures
- Marc Dahlem
Insiders Technologies GmbH, Kaiserslautern, Germany
, - Klaus Schneider
University of Kaiserslautern, Kaiserslautern, Germany
SCOPES '20: Proceedings of the 23th International Workshop on Software and Compilers for Embedded Systems•May 2020, pp 19-25• https://doi.org/10.1145/3378678.3391877Conventional processor architectures are limited in exploiting instruction level parallelism (ILP). One of the reasons for this limitation is their relatively low number of registers. Thus, recent processor architectures expose their datapaths so that ...
- 0Citation
- 50
- Downloads
MetricsTotal Citations0Total Downloads50Last 12 Months2
- Marc Dahlem
- Article
Evaluating OpenCL as a Standard Hardware Abstraction for a Model-based Synthesis Framework: A Case Study
- Omair Rafique
Department of Computer Science, University of Kaiserslautern, Kaiserslautern, Germany
, - Klaus Schneider
Department of Computer Science, University of Kaiserslautern, Kaiserslautern, Germany
MODELSWARD 2019: Proceedings of the 7th International Conference on Model-Driven Engineering and Software Development•February 2019, pp 386-393• https://doi.org/10.5220/0007470503860393In general, model-based design flows start from hardware-agnostic models and finally generate code based on the used model of computation (MoC). The generated code is then manually mapped with an additional non-trivial deployment step onto the chosen ...
- 0Citation
MetricsTotal Citations0
- Omair Rafique
- research-articlePublished By ACMPublished By ACM
An Efficient Self-Routing and Non-Blocking Interconnection Network on Chip
- Tripti Jain
Department of Computer Science, University of Kaiserslautern, Germany
, - Klaus Schneider
Department of Computer Science, University of Kaiserslautern, Germany
, - Ankesh Jain
Institute of Microelectronics, University of Ulm, Germany
NoCArc '17: Proceedings of the 10th International Workshop on Network on Chip Architectures•October 2017, Article No.: 4, pp 1-6• https://doi.org/10.1145/3139540.3139546In this paper, we present a new self-routing and non-blocking uni-cast interconnection network based on binary radix sorting that is more efficient than comparable other interconnection networks. To substantiate this claim, we first derive the asymptotic ...
- 5Citation
- 133
- Downloads
MetricsTotal Citations5Total Downloads133Last 12 Months11
- Tripti Jain
- research-articlePublished By ACMPublished By ACM
Introducing MoC Drivers for the Integration of Sensor-Actuator Behaviors in Model-Based Design Flows of Embedded Systems
- Omair Rafique
Department of Computer Science, University of Kaiserslautern, Kaiserslautern, Germany
, - Klaus Schneider
Department of Computer Science, University of Kaiserslautern, Kaiserslautern, Germany
SCOPES '16: Proceedings of the 19th International Workshop on Software and Compilers for Embedded Systems•May 2016, pp 50-59• https://doi.org/10.1145/2906363.2906368Model-based design flows for embedded systems have been introduced to allow late design changes while still keeping tight time-to-market deadlines. In general, these design flows start with abstract models and refine these to a final implementation ...
- 1Citation
- 38
- Downloads
MetricsTotal Citations1Total Downloads38
- Omair Rafique
- article
Semantics in space systems architectures
- Alessandro Gerlinger Romero
Brazilian National Institute for Space Research, São José dos Campos, Brazil
, - Klaus Schneider
Department of Computer Science, University of Kaiserslautern, Kaiserslautern, Germany
, - Maurício Gonçalves Ferreira
Brazilian National Institute for Space Research, São José dos Campos, Brazil
Innovations in Systems and Software Engineering, Volume 12, Issue 1•March 2016, pp 27-40 • https://doi.org/10.1007/s11334-015-0267-1Costs, life cycles, technologies and agreements between stakeholders and organizations make space systems unique with respect to the complexity. A commonly accepted technique to address part of this complexity is to model and to maintain space systems ...
- 0Citation
MetricsTotal Citations0
- Alessandro Gerlinger Romero
- research-articlePublished By ACMPublished By ACM
Memory-Model-Aware Testing: A Unified Complexity Analysis
- Florian Furbach
TU Kaiserslautern
, - Roland Meyer
TU Kaiserslautern
, - Klaus Schneider
TU Kaiserslautern
, - Maximilian Senftleben
TU Kaiserslautern
ACM Transactions on Embedded Computing Systems, Volume 14, Issue 4•December 2015, Article No.: 63, pp 1-25 • https://doi.org/10.1145/2753761To improve the performance of the memory system, multiprocessors implement weak memory consistency models. Weak memory models admit different views of the processes on their load and store instructions, thus allowing for computations that are not ...
- 10Citation
- 229
- Downloads
MetricsTotal Citations10Total Downloads229Last 12 Months15Last 6 weeks1
- Florian Furbach
- article
Evaluation of Speculation in Out-of-Order Execution of Synchronous Dataflow Networks
- Daniel Baudisch
Embedded Systems Group, Department of Computer Science, University of Kaiserslautern, Kaiserslautern, Germany
, - Klaus Schneider
Embedded Systems Group, Department of Computer Science, University of Kaiserslautern, Kaiserslautern, Germany
International Journal of Parallel Programming, Volume 43, Issue 1•February 2015, pp 86-129 • https://doi.org/10.1007/s10766-013-0277-2Dataflow process networks are a convenient formalism for implementing robust concurrent systems that has been successfully used for hardware and software systems in the past. However, the strictly stream-based execution limits the performance of dataflow ...
- 0Citation
MetricsTotal Citations0
- Daniel Baudisch
- research-article
Constructive polychronous systems
- Jean-Pierre Talpin
INRIA Rennes-Bretagne-Atlantique, France
, - Jens Brandt
University of Kaiserslautern, Germany
, - Mike Gemünde
University of Kaiserslautern, Germany
, - Klaus Schneider
University of Kaiserslautern, Germany
, - Sandeep Shukla
Virginia Tech, USA
Science of Computer Programming, Volume 96, Issue P3•December 2014, pp 377-394 • https://doi.org/10.1016/j.scico.2014.04.009The synchronous paradigm provides a logical abstraction of time for reactive system design which allows automatic synthesis of embedded systems that behave in a predictable, timely, and reactive manner. According to the synchrony hypothesis, a ...
- 7Citation
MetricsTotal Citations7
- Jean-Pierre Talpin
- tutorialPublished By ACMPublished By ACM
Abacus: A Processor Family for Education
- Nikita Bhardwaj
Department of Computer Science, TU Kaiserslautern
, - Maximilian Senftleben
Department of Computer Science, TU Kaiserslautern
, - Klaus Schneider
Department of Computer Science, TU Kaiserslautern
WESE'14: Proceedings of the WESE'14: Workshop on Embedded and Cyber-Physical Systems Education•October 2014, Article No.: 2, pp 1-8• https://doi.org/10.1145/2829957.2829959We present the Abacus processor family and its compiler framework for the MiniC language that we have developed for teaching processor architectures. Besides typical RISC instructions, Abacus also offers instructions for vector processing and thread ...
- 1Citation
- 74
- Downloads
MetricsTotal Citations1Total Downloads74Last 12 Months6Last 6 weeks2
- Nikita Bhardwaj
- Article
Memory Model-Aware Testing - A Unified Complexity Analysis
ACSD '14: Proceedings of the 2014 14th International Conference on Application of Concurrency to System Design•June 2014, pp 92-101• https://doi.org/10.1109/ACSD.2014.27To improve performance, multiprocessor systems implement weak memory consistency models--and a number of models have been developed over the past years. Weak memory models, however, lead to unforeseen program behavior, and there is a current need for ...
- 4Citation
MetricsTotal Citations4
- research-article
High level modeling of elastic circuits in SystemC
- Mohamed Ammar Ben Khadra
University of Kaiserslautern, Kaiserslautern, Germany
, - Yu Bai
University of Kaiserslautern, Kaiserslautern, Germany
, - Klaus Schneider
University of Kaiserslautern, Kaiserslautern, Germany
DEVS '14: Proceedings of the Symposium on Theory of Modeling & Simulation - DEVS Integrative•April 2014, Article No.: 24, pp 1-8Synchronous design is currently by far the mainstream design paradigm of digital circuits. However, the move to modern nano-meter technologies has brought unprecedented delay variability issues. That makes maintaining clock synchronization challenging ...
- 0Citation
- 43
- Downloads
MetricsTotal Citations0Total Downloads43
- Mohamed Ammar Ben Khadra
- research-article
Isochronous networks by construction
- Yu Bai
University of Kaiserslautern, Germany
, - Klaus Schneider
University of Kaiserslautern, Germany
DATE '14: Proceedings of the conference on Design, Automation & Test in Europe•March 2014, Article No.: 155, pp 1-6While synchronous system models have many advantages over asynchronous models concerning verification and validation, many implementation platforms do not provide efficient means for synchronization. For this reason, we consider a design flow that starts ...
- 1Citation
- 39
- Downloads
MetricsTotal Citations1Total Downloads39Last 12 Months2Last 6 weeks1
- Yu Bai
- article
Representation of synchronous, asynchronous, and polychronous components by clocked guarded actions
- Jens Brandt
Department of Computer Science, University of Kaiserslautern, Kaiserslautern, Germany 67653
, - Mike Gemünde
Department of Computer Science, University of Kaiserslautern, Kaiserslautern, Germany 67653
, - Klaus Schneider
Department of Computer Science, University of Kaiserslautern, Kaiserslautern, Germany 67653
, - Sandeep K. Shukla
Electrical and Computer Engineering, Virginia Tech, Blacksburg, USA
, - Jean-Pierre Talpin
INRIA, Unité de Recherche Rennes-Bretagne-Atlantique, Rennes, France
Design Automation for Embedded Systems, Volume 18, Issue 1-2•March 2014, pp 63-97 • https://doi.org/10.1007/s10617-012-9087-9For the design of embedded systems, many languages are in use, which are based on different models of computation such as event-, data-, and clock-driven paradigms as well as paradigms without a clear notion of time. Systems composed of such ...
- 3Citation
MetricsTotal Citations3
- Jens Brandt
- research-articlePublished By ACMPublished By ACM
Passive code in synchronous programs
- Jens Brandt
University of Kaiserslautern, Kaiserslautern, Germany
, - Klaus Schneider
University of Kaiserslautern, Kaiserslautern, Germany
, - Yu Bai
University of Kaiserslautern, Kaiserslautern, Germany
ACM Transactions on Embedded Computing Systems, Volume 13, Issue 2s•January 2014, Article No.: 67, pp 1-25 • https://doi.org/10.1145/2544375.2544387The synchronous model of computation requires that in every step, inputs are read and outputs are synchronously computed as the reaction of the program. In addition, all internal variables are updated in parallel even though not all of these values might ...
- 1Citation
- 138
- Downloads
MetricsTotal Citations1Total Downloads138Last 12 Months2
- Jens Brandt
- Article
Lifting Verification Results for Preemption Statements
- Manuel Gesell
Embedded Systems Group, Department of Computer Science, University of Kaiserslautern, Germany
, - Andreas Morgenstern
Embedded Systems Group, Department of Computer Science, University of Kaiserslautern, Germany
, - Klaus Schneider
Embedded Systems Group, Department of Computer Science, University of Kaiserslautern, Germany
SEFM 2013: Proceedings of the 11th International Conference on Software Engineering and Formal Methods - Volume 8137•September 2013, pp 91-105• https://doi.org/10.1007/978-3-642-40561-7_7The normal operation of synchronous modules may be temporarily suspended or finally aborted due to requests of their environment. Hence, if a temporal logic specification has already been verified for a synchronous module, then the available verification ...
- 1Citation
MetricsTotal Citations1
- Manuel Gesell
- Article
Modular Verification of Synchronous Programs
ACSD '13: Proceedings of the 2013 13th International Conference on Application of Concurrency to System Design•July 2013, pp 70-79• https://doi.org/10.1109/ACSD.2013.10In this paper, we develop an approach to the modular verification of synchronous programs. To this end, we have to solve two major problems: First, if a synchronous module is verified without its later context, outputs may not be completely determined (...
- 4Citation
MetricsTotal Citations4
- research-article
Embedding Polychrony into Synchrony
- Jens Brandt
University of Kaiserslautern, Kaiserslautern
, - Mike Gemunde
University of Kaiserslautern, Kaiserslautern
, - Klaus Schneider
University of Kaiserslautern, Kaiserslautern
, - Sandeep K. Shukla
Virginia Polytechnic and State University, Blacksburg
, - Jean-Pierre Talpin
INRIA Rennes-Bretagne-Atlantique, Rennes
IEEE Transactions on Software Engineering, Volume 39, Issue 7•July 2013, pp 917-929 • https://doi.org/10.1109/TSE.2012.85This paper presents an embedding of polychronous programs into synchronous ones. Due to this embedding, it is not only possible to deepen the understanding of these different models of computation, but, more importantly, it is possible to transfer ...
- 4Citation
MetricsTotal Citations4
- Jens Brandt
- research-articlePublished By ACMPublished By ACM
Generating hardware specific code at different abstraction levels using Averest
- Omair Rafique
University of Kaiserslautern, Kaiserslautern, Germany
, - Manuel Gesell
University of Kaiserslautern, Kaiserslautern, Germany
, - Klaus Schneider
University of Kaiserslautern, Kaiserslautern, Germany
M-SCOPES '13: Proceedings of the 16th International Workshop on Software and Compilers for Embedded Systems•June 2013, pp 90-92• https://doi.org/10.1145/2463596.2486154In general, embedded systems can be designed at different levels of abstraction, e.g., as pure hardware circuit designs, as bare-iron level programs (without an operating system), as programs based on a real-time operating system, and as models of a ...
- 5Citation
- 67
- Downloads
MetricsTotal Citations5Total Downloads67Last 12 Months5Last 6 weeks1
- Omair Rafique
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