Jean Yves Le-Boudec
Applied Filters
- Jean Yves Le-Boudec
- AuthorRemove filter
People
Colleagues
- Jean-Pierre Hubaux (9)
- Milan Vojnović; (7)
- George Theodorakopoulos (5)
- Nicolas Gast (5)
- Nikodin Ristanovic (5)
- Silvia Giordano (5)
- Jochen Mundinger (4)
- Joerg Widmer (4)
- Ljubica Blazevic (4)
- Miroslav V Popović (4)
- Patrick Thiran (4)
- Ramin Khalili (4)
- Reza Shokri (4)
- Ruben Merz (4)
- Wajeb Saab (4)
- Augustin Chaintreau (3)
- Božidar Radunović (3)
- Sonja Buchegger (3)
- Werner Almesberger (3)
Roles
Publication
Journal/Magazine Names
- IEEE/ACM Transactions on Networking (21)
- ACM SIGMETRICS Performance Evaluation Review (7)
- Performance Evaluation (7)
- ACM SIGCOMM Computer Communication Review (4)
- IEEE Transactions on Mobile Computing (4)
- Computer Networks and ISDN Systems (3)
- IEEE Transactions on Information Theory (2)
- Annals of Operations Research (1)
- Cluster Computing (1)
- Computer Communications (1)
- Computer Networks: The International Journal of Computer and Telecommunications Networking (1)
- IEEE Transactions on Information Forensics and Security (1)
- IEEE Transactions on Signal Processing (1)
- Journal of High Speed Networks (1)
- Proceedings of the ACM on Measurement and Analysis of Computing Systems (1)
- Queueing Systems: Theory and Applications (1)
Proceedings/Book Names
- 2017 22nd IEEE International Conference on Emerging Technologies and Factory Automation (ETFA) (2)
- INFOCOM'10: Proceedings of the 29th conference on Information communications (2)
- CCS '12: Proceedings of the 2012 ACM conference on Computer and communications security (1)
- CoNEXT '10 Student Workshop: Proceedings of the ACM CoNEXT Student Workshop (1)
- CoNEXT '12: Proceedings of the 8th international conference on Emerging networking experiments and technologies (1)
- e-Energy '11: Proceedings of the 2nd International Conference on Energy-Efficient Computing and Networking (1)
- e-Energy '13: Proceedings of the fourth international conference on Future energy systems (1)
- e-Energy '14: Proceedings of the 5th international conference on Future energy systems (1)
- Interperf '06: Proceedings from the 2006 workshop on Interdisciplinary systems approach in performance evaluation and design of computer & communications sytems (1)
- MobiCom '07: Proceedings of the 13th annual ACM international conference on Mobile computing and networking (1)
- MobiHoc S3 '09: Proceedings of the 2009 MobiHoc S3 workshop on MobiHoc S3 (1)
- PM2HW2N '11: Proceedings of the 6th ACM workshop on Performance monitoring and measurement of heterogeneous wireless and wired networks (1)
- Quantitative Evaluation of Systems (1)
- SAC '14: Proceedings of the 29th Annual ACM Symposium on Applied Computing (1)
- SIGCOMM '91: Proceedings of the conference on Communications architecture & protocols (1)
- SIGMETRICS '09: Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems (1)
- VANET '09: Proceedings of the sixth ACM international workshop on VehiculAr InterNETworking (1)
- WDTN '05: Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking (1)
- WiSec '10: Proceedings of the third ACM conference on Wireless network security (1)
- WPES '14: Proceedings of the 13th Workshop on Privacy in the Electronic Society (1)
Publisher
- Association for Computing Machinery (37)
- IEEE Press (35)
- Elsevier Science Publishers B. V. (11)
- IEEE Computer Society (10)
- Springer-Verlag (7)
- IEEE Educational Activities Department (4)
- IOS Press (2)
- J. C. Baltzer AG, Science Publishers (2)
- Elsevier North-Holland, Inc. (1)
- ICST (Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering) (1)
- John Wiley and Sons Ltd. (1)
- Kluwer Academic Publishers (1)
- Laboratoire de Reseaux de Communication Swiss Federal Institute of Technology (1)
- RFC Editor (1)
Publication Date
Export Citations
Publications
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-article
Worst-Case Delay Analysis of Time-Sensitive Networks With Deficit Round-Robin
- Seyed Mohammadhossein Tabatabaee
École Polytechnique Fédérale de Lausanne (EPFL), Lausanne, Switzerland
, - Anne Bouillard
Huawei Technologies France, Paris, France
, - Jean-Yves Le Boudec
École Polytechnique Fédérale de Lausanne (EPFL), Lausanne, Switzerland
IEEE/ACM Transactions on Networking, Volume 32, Issue 3•June 2024, pp 1967-1982 • https://doi.org/10.1109/TNET.2023.3332247In feed-forward time-sensitive networks with Deficit Round-Robin (DRR), worst-case delay bounds were obtained by combining Total Flow Analysis (TFA) with the strict service curve characterization of DRR by Tabatabaee et al. The latter is the best-known ...
- 0Citation
- 9
- Downloads
MetricsTotal Citations0Total Downloads9Last 12 Months9
- Seyed Mohammadhossein Tabatabaee
- research-article
A Palm Calculus Approach to the Distribution of the Age of Information
- Amr Rizk
Faculty of Computer Science, University of Duisburg-Essen, Essen, Germany
, - Jean-Yves Le Boudec
École Polytechnique Fédérale de Lausanne (EPFL), Lausanne, Switzerland
IEEE Transactions on Information Theory, Volume 69, Issue 12•Dec. 2023, pp 8097-8110 • https://doi.org/10.1109/TIT.2023.3326381A key metric to express the timeliness of status updates in latency-sensitive networked systems is the age of information (AoI), i.e., the time elapsed since the generation of the last received informative status message. This metric allows studying a ...
- 0Citation
MetricsTotal Citations0
- Amr Rizk
- Article
Quasi-Deterministic Burstiness Bound for Aggregate of Independent, Periodic Flows
- Seyed Mohammadhossein Tabatabaee
EPFL, Lausanne, Switzerland
, - Anne Bouillard
Huawei Technologies France, Paris, France
, - Jean-Yves Le Boudec
EPFL, Lausanne, Switzerland
Quantitative Evaluation of Systems•September 2023, pp 205-220• https://doi.org/10.1007/978-3-031-43835-6_15AbstractTime-sensitive networks require timely and accurate monitoring of the status of the network. To achieve this, many devices send packets periodically, which are then aggregated and forwarded to the controller. Bounding the aggregate burstiness of ...
- 0Citation
MetricsTotal Citations0
- Seyed Mohammadhossein Tabatabaee
- research-article
Configuration of Guard Band and Offsets in Cyclic Queuing and Forwarding
- Damien Guidolin--Pina
RealTime-at-Work, Nancy, France
, - Marc Boyer
ONERA/DTIS, Université de Toulouse, Toulouse, France
, - Jean-Yves Le Boudec
EPFL, Lausanne, Switzerland
IEEE/ACM Transactions on Networking, Volume 32, Issue 1•Feb. 2024, pp 598-612 • https://doi.org/10.1109/TNET.2023.3293050Cyclic Queuing and Forwarding (CQF) is a mechanism defined by IEEE TSN for providing low jitter in a deterministic network. CQF uses a common time cycle and two buffers per node output port: during one cycle incoming packets are stored in one buffer while ...
- 0Citation
- 17
- Downloads
MetricsTotal Citations0Total Downloads17Last 12 Months17Last 6 weeks2
- Damien Guidolin--Pina
- research-article
Improved Network-Calculus Nodal Delay-Bounds in Time-Sensitive Networks
- Ehsan Mohammadpour
Department of Computer and Communication Sciences, EPFL, Lausanne, Switzerland
, - Eleni Stai
Department of Information Technology and Electrical Engineering, ETHZ, Zürich, Switzerland
, - Jean-Yves Le Boudec
Department of Computer and Communication Sciences, EPFL, Lausanne, Switzerland
IEEE/ACM Transactions on Networking, Volume 31, Issue 6•Dec. 2023, pp 2902-2917 • https://doi.org/10.1109/TNET.2023.3275910In time-sensitive networks, bounds on worst-case delays are typically obtained by using network calculus and assuming that flows are constrained by bit-level arrival curves. However, in IEEE TSN or IETF DetNet, source flows are constrained on the number ...
- 0Citation
- 11
- Downloads
MetricsTotal Citations0Total Downloads11Last 12 Months11Last 6 weeks1
- Ehsan Mohammadpour
- RFCfree
RFC 9320: Deterministic Networking (DetNet) Bounded Latency
This document presents a timing model for sources, destinations, and Deterministic Networking (DetNet) transit nodes. Using the model, it provides a methodology to compute end-to-end latency and backlog bounds for various queuing methods. The ...
- 0Citation
- 52
- Downloads
MetricsTotal Citations0Total Downloads52Last 12 Months35Last 6 weeks7
- research-article
Worst-Case Delay Bounds in Time-Sensitive Networks With Packet Replication and Elimination
- Ludovic Thomas
Institut Supérieur de l’Aéronautique et de l’Espace (ISAE-SUPAERO), Université Fédérale de Toulouse, Toulouse, France
, - Ahlem Mifdaoui
Institut Supérieur de l’Aéronautique et de l’Espace (ISAE-SUPAERO), Université Fédérale de Toulouse, Toulouse, France
, - Jean-Yves Le Boudec
School of Computer and Communication Sciences, École Polytechnique Fédérale de Lausanne, Lausanne, Switzerland
IEEE/ACM Transactions on Networking, Volume 30, Issue 6•Dec. 2022, pp 2701-2715 • https://doi.org/10.1109/TNET.2022.3180763Packet replication and elimination functions are used by time-sensitive networks (as in the context of IEEE TSN and IETF DetNet) to increase the reliability of the network. Packets are replicated onto redundant paths by a replication function. Later the ...
- 0Citation
- 37
- Downloads
MetricsTotal Citations0Total Downloads37Last 12 Months19Last 6 weeks2
- Ludovic Thomas
- articlePublished By ACMPublished By ACM
Performance Evaluation: A Preparation for Statistics and Data Science ?
- Jean-Yves Le Boudec
EPFL, Lausanne, Switzerland
ACM SIGMETRICS Performance Evaluation Review, Volume 49, Issue 4•March 2022, pp 20-23 • https://doi.org/10.1145/3543146.3543151Lectures that use probability or statistics often appear complex to students, sometimes because the underlying stochastic models are not explicited. Writing a stochastic simulation program is a common exercise in a performance evaluation course, and we ...
- 1Citation
- 54
- Downloads
MetricsTotal Citations1Total Downloads54Last 12 Months8Last 6 weeks2
- Jean-Yves Le Boudec
- research-article
Deficit Round-Robin: A Second Network Calculus Analysis
- Seyed Mohammadhossein Tabatabaee
Department of Computer and Communication Sciences, École Polytechnique Fédérale de Lausanne (EPFL), Lausanne, Switzerland
, - Jean-Yves Le Boudec
Department of Computer and Communication Sciences, École Polytechnique Fédérale de Lausanne (EPFL), Lausanne, Switzerland
IEEE/ACM Transactions on Networking, Volume 30, Issue 5•Oct. 2022, pp 2216-2230 • https://doi.org/10.1109/TNET.2022.3164772Deficit Round-Robin (DRR) is a widespread scheduling algorithm that provides fair queueing with variable-length packets. Bounds on worst-case delays for DRR were found by Boyer et al., who used a rigorous network calculus approach and characterized the ...
- 0Citation
- 24
- Downloads
MetricsTotal Citations0Total Downloads24Last 12 Months6
- Seyed Mohammadhossein Tabatabaee
- research-article
Analysis of Dampers in Time-Sensitive Networks With Non-Ideal Clocks
- Ehsan Mohammadpour
School of I&C, École Polytechnique Fédérale de Lausanne (EPFL), Lausanne, Switzerland
, - Jean-Yves Le Boudec
School of I&C, École Polytechnique Fédérale de Lausanne (EPFL), Lausanne, Switzerland
IEEE/ACM Transactions on Networking, Volume 30, Issue 4•Aug. 2022, pp 1780-1794 • https://doi.org/10.1109/TNET.2022.3152178Dampers are devices that reduce delay jitter in the context of time-sensitive networks, by delaying packets for the amount written in packet headers. Jitter reduction is required by some real-time applications; beyond this, dampers have the potential to ...
- 1Citation
- 21
- Downloads
MetricsTotal Citations1Total Downloads21Last 12 Months12
- Ehsan Mohammadpour
- research-article
On Packet Reordering in Time-Sensitive Networks
- Ehsan Mohammadpour
School of I&C, École Polytechnique Fédérale de Lausanne (EPFL), Lausanne, Switzerland
, - Jean-Yves Le Boudec
School of I&C, École Polytechnique Fédérale de Lausanne (EPFL), Lausanne, Switzerland
IEEE/ACM Transactions on Networking, Volume 30, Issue 3•June 2022, pp 1045-1057 • https://doi.org/10.1109/TNET.2021.3129590Time-sensitive networks (IEEE TSN or IETF DetNet) may tolerate some packet reordering. Re-sequencing buffers are then used to provide in-order delivery, the parameters of which (timeout, buffer size) may affect worst-case delay and delay jitter. There is ...
- 2Citation
- 35
- Downloads
MetricsTotal Citations2Total Downloads35Last 12 Months18
- Ehsan Mohammadpour
- research-article
TDOA Source-Localization Technique Robust to Time-Synchronization Attacks
- Marguerite Delcourt
School of Computer and Communication Sciences, Swiss Federal Institute of Technology Lausanne (EPFL), Lausanne, Switzerland
, - Jean-Yves Le Boudec
School of Computer and Communication Sciences, Swiss Federal Institute of Technology Lausanne (EPFL), Lausanne, Switzerland
IEEE Transactions on Information Forensics and Security, Volume 16•2021, pp 4249-4264 • https://doi.org/10.1109/TIFS.2020.3001741In this paper, we focus on the localization of a passive source from time difference of arrival (TDOA) measurements. TDOA values are computed with respect to pairs of fixed sensors that are required to be accurately time-synchronized. This constitutes a ...
- 1Citation
MetricsTotal Citations1
- Marguerite Delcourt
- research-articlePublished By ACMPublished By ACM
On Time Synchronization Issues in Time-Sensitive Networks with Regulators and Nonideal Clocks
- Ludovic Thomas
I&C, EPFL, Lausanne, Switzerland
, - Jean-Yves Le Boudec
I&C, EPFL, Lausanne, Switzerland
ACM SIGMETRICS Performance Evaluation Review, Volume 48, Issue 1•June 2020, pp 51-52 • https://doi.org/10.1145/3410048.3410078Flow reshaping is used in time-sensitive networks (as in the context of IEEE TSN and IETF Detnet) in order to reduce burstiness inside the network and to support the computation of guaranteed latency bounds. This is performed using per-flow regulators (...
- 0Citation
- 53
- Downloads
MetricsTotal Citations0Total Downloads53Last 12 Months5Last 6 weeks1
- Ludovic Thomas
- research-articlePublished By ACMPublished By ACM
On Time Synchronization Issues in Time-Sensitive Networks with Regulators and Nonideal Clocks
- Ludovic Thomas
École Polytechnique Fédérale de Lausanne, Lausanne, Switzerland
, - Jean-Yves Le Boudec
École Polytechnique Fédérale de Lausanne, Lausanne, Switzerland
Proceedings of the ACM on Measurement and Analysis of Computing Systems, Volume 4, Issue 2•June 2020, Article No.: 27, pp 1-41 • https://doi.org/10.1145/3392145Flow reshaping is used in time-sensitive networks (as in the context of IEEE TSN and IETF Detnet) in order to reduce burstiness inside the network and to support the computation of guaranteed latency bounds. This is performed using per-flow regulators (...
- 4Citation
- 374
- Downloads
MetricsTotal Citations4Total Downloads374Last 12 Months77Last 6 weeks4
- Ludovic Thomas
- abstractPublished By ACMPublished By ACM
On Time Synchronization Issues in Time-Sensitive Networks with Regulators and Nonideal Clocks
- Ludovic Thomas
École Polytechnique Fédérale de Lausanne, Lausanne, Switzerland
, - Jean-Yves Le Boudec
École Polytechnique Fédérale de Lausanne, Lausanne, Switzerland
SIGMETRICS '20: Abstracts of the 2020 SIGMETRICS/Performance Joint International Conference on Measurement and Modeling of Computer Systems•June 2020, pp 51-52• https://doi.org/10.1145/3393691.3394206Flow reshaping is used in time-sensitive networks (as in the context of IEEE TSN and IETF Detnet) in order to reduce burstiness inside the network and to support the computation of guaranteed latency bounds. This is performed using per-flow regulators (...
- 4Citation
- 150
- Downloads
MetricsTotal Citations4Total Downloads150Last 12 Months12Last 6 weeks3- 1
Supplementary Material3393691.3394206.mp4
- Ludovic Thomas
- research-article
A Theory of Traffic Regulators for Deterministic Networks With Application to Interleaved Regulators
- Jean-Yves Le Boudec
School of I&C, EPFL, Lausanne, Switzerland
IEEE/ACM Transactions on Networking, Volume 26, Issue 6•December 2018, pp 2721-2733 • https://doi.org/10.1109/TNET.2018.2875191We introduce Pi-regulation, a new definition of traffic regulation which extends both the arrival curves of network calculus and Chang’s max-plus g-regulation, and also includes new types of regulation, such as packet rate limitations. We provide a new ...
- 7Citation
- 104
- Downloads
MetricsTotal Citations7Total Downloads104Last 12 Months5
- Jean-Yves Le Boudec
- research-articlePublished By ACMPublished By ACM
T-RECS: A Virtual Commissioning Tool for Software-Based Control of Electric Grids: Design, Validation, and Operation
- Jagdish Prasad Achara
EPFL, Switzerland
, - Maaz Mohiuddin
EPFL, Switzerland
, - Wajeb Saab
EPFL, Switzerland
, - Roman Rudnik
EPFL, Switzerland
, - Jean-Yves Le Boudec
EPFL, Switzerland
, - Lorenzo Reyes-Chamorro
EPFL, Switzerland
e-Energy '18: Proceedings of the Ninth International Conference on Future Energy Systems•June 2018, pp 303-313• https://doi.org/10.1145/3208903.3208928In real-time control of electric grids using multiple software agents, the control performance depends on (1) the proper functioning of the software agents, i.e., absence of software faults, and (2) the behavior of software agents in the presence of non-...
- 2Citation
- 70
- Downloads
MetricsTotal Citations2Total Downloads70Last 12 Months6
- Jagdish Prasad Achara
- research-article
Real-time control of an ensemble of heterogeneous resources
- Andrey Bernstein
National Renewable Energy Laboratory (NREL), Golden, CO, USA
, - Niek J. Bouman
Technische Universiteit Eindhoven, the Netherlands
, - Jean-Yves Le Boudec
Laboratory for Communications and Applications, EPFL, Switzerland
2017 IEEE 56th Annual Conference on Decision and Control (CDC)•December 2017, pp 1401-1406• https://doi.org/10.1109/CDC.2017.8263850This paper focuses on the problem of controlling an ensemble of heterogeneous resources connected to an electrical grid at the same point of common coupling (PCC). The controller receives an aggregate power setpoint for the ensemble in real time and ...
- 0Citation
MetricsTotal Citations0
- Andrey Bernstein
- research-article
T-RECS: A software testbed for multi-agent real-time control of electric grids
- Jagdish Achara
School of Computer Science and Communication Systems, École Polytechnique Federale de Lausanne, Switzerland
, - Maaz Mohiuddin
School of Computer Science and Communication Systems, École Polytechnique Federale de Lausanne, Switzerland
, - Wajeb Saab
School of Computer Science and Communication Systems, École Polytechnique Federale de Lausanne, Switzerland
, - Roman Rudnik
School of Computer Science and Communication Systems, École Polytechnique Federale de Lausanne, Switzerland
, - Jean-Yves Le Boudec
School of Computer Science and Communication Systems, École Polytechnique Federale de Lausanne, Switzerland
2017 22nd IEEE International Conference on Emerging Technologies and Factory Automation (ETFA)•September 2017, pp 1-4• https://doi.org/10.1109/ETFA.2017.8247706Multiple software agents can be used to perform the real-time control of electrical grids. The control performance of such solutions is influenced by software non-idealities such as crashes and delays of the software agents, and message losses and delays ...
- 0Citation
MetricsTotal Citations0
- Jagdish Achara
- research-article
Quarts: Quick agreement for real-time control systems
- Wajeb Saab
École Polytechnique Federale de Lausanne, Switzerland
, - Maaz Mohiuddin
École Polytechnique Federale de Lausanne, Switzerland
, - Simon Bliudze
École Polytechnique Federale de Lausanne, Switzerland
, - Jean-Yves Le Boudec
École Polytechnique Federale de Lausanne, Switzerland
2017 22nd IEEE International Conference on Emerging Technologies and Factory Automation (ETFA)•September 2017, pp 1-8• https://doi.org/10.1109/ETFA.2017.8247590Real-time control systems (RTCSs) tolerate delay and crash faults by replicating the controller. Each replica computes and issues setpoints to actuators over a network that might drop or delay messages. Hence, the actuators might receive an inconsistent ...
- 0Citation
MetricsTotal Citations0
- Wajeb Saab
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