Alain Jean-Marie
Applied Filters
- Alain Jean-Marie
- AuthorRemove filter
People
Colleagues
- Alain Jean-Marie (27)
- Anne Elisabeth Baert (3)
- Bruno Gaujal (3)
- Vincent Boudet (3)
- Abdelghani Ben Tahar (2)
- Dorian Mazauric (2)
- Emmanuel Hyon (2)
- Fedor V. Fomin (2)
- Gaetan Bisson (2)
- Iñaki Esnaola (2)
- Samir M Perlaza (2)
- Stefano Rini (2)
- Tigist Alemu (2)
- Yvan Calas (2)
- E. W. Biersack (1)
- Günther Siegel (1)
- Isi Mitrani (1)
- Jörn Migge (1)
- Nicolas Navet (1)
- Philippe Nain (1)
Roles
Publication
Journal/Magazine Names
- Parallel Computing (2)
- Performance Evaluation (2)
- Queueing Systems: Theory and Applications (2)
- Discrete Event Dynamic Systems (1)
- IEEE Journal on Selected Areas in Communications (1)
- IEEE Transactions on Information Theory (1)
- International Journal of Grid and Utility Computing (1)
- Journal of Scheduling (1)
- Journal of the ACM (1)
- SIAM Journal on Computing (1)
- The Computer Journal (1)
- Theoretical Computer Science (1)
Proceedings/Book Names
- 2022 IEEE International Symposium on Information Theory (ISIT) (1)
- ASIAN '00: Proceedings of the 6th Asian Computing Science Conference on Advances in Computing Science (1)
- CISIS '08: Proceedings of the 2008 International Conference on Complex, Intelligent and Software Intensive Systems (1)
- CTRQ '10: Proceedings of the 2010 Third International Conference on Communication Theory, Reliability, and Quality of Service (1)
- FUN'12: Proceedings of the 6th international conference on Fun with Algorithms (1)
- ICPPW '08: Proceedings of the 2008 International Conference on Parallel Processing - Workshops (1)
- MASCOTS '14: Proceedings of the 2014 IEEE 22nd International Symposium on Modelling, Analysis & Simulation of Computer and Telecommunication Systems (1)
- NETWORKING'05: Proceedings of the 4th IFIP-TC6 international conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems (1)
- Performance '87: Proceedings of the 12th IFIP WG 7.3 International Symposium on Computer Performance Modelling, Measurement and Evaluation (1)
- Quantitative Methods in Parallel Systems (1)
- VALUETOOLS '09: Proceedings of the Fourth International ICST Conference on Performance Evaluation Methodologies and Tools (1)
- VALUETOOLS 2017: Proceedings of the 11th EAI International Conference on Performance Evaluation Methodologies and Tools (1)
Publisher
- Elsevier Science Publishers B. V. (4)
- IEEE Computer Society (4)
- IEEE Press (3)
- Springer-Verlag (3)
- Association for Computing Machinery (2)
- J. C. Baltzer AG, Science Publishers (2)
- Kluwer Academic Publishers (2)
- Elsevier Science Publishers Ltd. (1)
- ICST (Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering) (1)
- Inderscience Publishers (1)
- North-Holland Publishing Co. (1)
- Oxford University Press, Inc. (1)
- Society for Industrial and Applied Mathematics (1)
- Springer Publishing Company, Incorporated (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
Empirical Risk Minimization With Relative Entropy Regularization
- Samir M. Perlaza
INRIA, Centre Inria d’Université Côte d’Azur, Sophia Antipolis, France
, - Gaetan Bisson
GAATI Laboratory, Université de la Polynésie Française, Faaa, French Polynesia
, - Iñaki Esnaola
ECE Department, Princeton University, Princeton, NJ, USA
, - Alain Jean-Marie
INRIA, Centre Inria d’Université Côte d’Azur, Sophia Antipolis, France
, - Stefano Rini
ECE Department, National Yang Ming Chiao Tung University (NYCU), Hsinchu, Taiwan
IEEE Transactions on Information Theory, Volume 70, Issue 7•July 2024, pp 5122-5161 • https://doi.org/10.1109/TIT.2024.3365728The empirical risk minimization (ERM) problem with relative entropy regularization (ERM-RER) is investigated under the assumption that the reference measure is a <inline-formula> <tex-math notation="LaTeX">$\sigma $ </tex-math></inline-formula>-finite ...
- 0Citation
MetricsTotal Citations0
- Samir M. Perlaza
- research-article
Empirical Risk Minimization with Relative Entropy Regularization: Optimality and Sensitivity Analysis
- Samir M. Perlaza
INRIA,Sophia Antipolis,France,06902
, - Gaetan Bisson
Université de la Polynésie Française,Laboratoire de Mathématiques GAATI,Faaa,French Polynesia,98702
, - Iñaki Esnaola
University of Sheffield,Department of Automatic Control and Systems Engineering,Sheffield,United Kingdom
, - Alain Jean-Marie
National Chao Tung University,Department of Electrical and Computer Engineering,Hsinchu,Taiwan
, - Stefano Rini
Princeton University,Department of Electrical and Computer Engineering,Princeton,NJ,USA,08544
2022 IEEE International Symposium on Information Theory (ISIT)•June 2022, pp 684-689• https://doi.org/10.1109/ISIT50566.2022.9834273The optimality and sensitivity of the empirical risk minimization problem with relative entropy regularization (ERM-RER) are investigated for the case in which the reference is a σ-finite measure instead of a probability measure. This ...
- 0Citation
MetricsTotal Citations0
- Samir M. Perlaza
- demonstrationPublished By ACMPublished By ACM
marmoteCore: a Markov Modeling Platform
- Alain Jean-Marie
Université Côte d'Azur - Inria
VALUETOOLS 2017: Proceedings of the 11th EAI International Conference on Performance Evaluation Methodologies and Tools•December 2017, pp 60-65• https://doi.org/10.1145/3150928.3150960We present the marmoteCore software project, an open environment for modeling with Markov chains. This platform aims at providing the general scientific user with tools for creating Markov models and accessing the many solution algorithms available for ...
- 3Citation
- 32
- Downloads
MetricsTotal Citations3Total Downloads32
- Alain Jean-Marie
- Article
Prefetching Control for On-Demand Contents Distribution: A Markov Decision Process Model
MASCOTS '14: Proceedings of the 2014 IEEE 22nd International Symposium on Modelling, Analysis & Simulation of Computer and Telecommunication Systems•September 2014, pp 421-426• https://doi.org/10.1109/MASCOTS.2014.58Prefetching control is a vital operation for the On-demand interactive systems where the instantaneous response is the crucial factor for the system success. The controller in such type of interactive system operates in an uncertain environment and ...
- 1Citation
MetricsTotal Citations1
- article
To satisfy impatient Web surfers is hard
- Fedor V. Fomin
Department of Informatics, University of Bergen, Norway
, - Frédéric Giroire
COATI, INRIA, I3S (CNRS/Univ. Nice-Sophia Antipolis), France
, - Alain Jean-Marie
INRIA and LIRMM (CNRS/Univ. Montpellier 2), France
, - Dorian Mazauric
COATI, INRIA, I3S (CNRS/Univ. Nice-Sophia Antipolis), France
, - Nicolas Nisse
COATI, INRIA, I3S (CNRS/Univ. Nice-Sophia Antipolis), France
Theoretical Computer Science, Volume 526•March, 2014, pp 1-17 • https://doi.org/10.1016/j.tcs.2014.01.009Prefetching is a basic mechanism for faster data access and efficient computing. An important issue in prefetching is the trade-off between the amount of network's resources wasted by the prefetching and the gain of time. For instance, in the Web, ...
- 4Citation
MetricsTotal Citations4
- Fedor V. Fomin
- article
The fluid limit of the multiclass processor sharing queue
- Abdelghani Ben Tahar
FST-Settat, Univ. Hassan I, Settat, Morocco
, - Alain Jean-Marie
INRIA and LIRMM, UMR 5506 CNRS--Univ. Montpellier 2, Montpellier, France 34392
Queueing Systems: Theory and Applications, Volume 71, Issue 4•August 2012, pp 347-404 • https://doi.org/10.1007/s11134-012-9287-9Consider a single server queueing system with several classes of customers, each having its own renewal input process and its own general service times distribution. Upon completing service, customers may leave, or re-enter the queue, possibly as ...
- 0Citation
MetricsTotal Citations0
- Abdelghani Ben Tahar
Quantitative Methods in Parallel Systems
The Basic Research project QMIPS (Quantitative Methods In Parallel Systems) involves eight leading research groups from France, Germany, Italy, The Netherlands, Spain and the U.K. This book contains a selection of papers produced by the project during ...
- 0Citation
MetricsTotal Citations0
- Article
To satisfy impatient web surfers is hard
- Fedor V. Fomin
Department of Informatics, University of Bergen, Norway
, - Frédéric Giroire
MASCOTTE, INRIA, I3S(CNRS/Univ. Nice Sophia Antipolis), France
, - Alain Jean-Marie
MAESTRO, INRIA and LIRMM, Univ. Montpellier 2, France
, - Dorian Mazauric
MASCOTTE, INRIA, I3S(CNRS/Univ. Nice Sophia Antipolis), France
, - Nicolas Nisse
MASCOTTE, INRIA, I3S(CNRS/Univ. Nice Sophia Antipolis), France
FUN'12: Proceedings of the 6th international conference on Fun with Algorithms•June 2012, pp 166-176• https://doi.org/10.1007/978-3-642-30347-0_18Prefetching is a basic mechanism for faster data access and efficient computing. An important issue in prefetching is the tradeoff between the amount of network's resources wasted by the prefetching and the gain of time. For instance, in the Web, ...
- 2Citation
MetricsTotal Citations2
- Fedor V. Fomin
- research-article
Scheduling Services in a Queuing System with Impatience and Setup Costs
The Computer Journal, Volume 55, Issue 5•May 2012, pp 553-563 • https://doi.org/10.1093/comjnl/bxq096We consider a single-server queue in discrete time, in which customers must be served before some limit sojourn time of geometrical distribution. A customer who is not served before this limit leaves the system: it is impatient. The service of customers,...
- 3Citation
MetricsTotal Citations3
- Article
Flow-Level Modeling of Parallel Download in Distributed Systems
CTRQ '10: Proceedings of the 2010 Third International Conference on Communication Theory, Reliability, and Quality of Service•June 2010, pp 92-97• https://doi.org/10.1109/CTRQ.2010.23Response time is the primary Quality of Service metric for parallel download systems, where pieces of large files can be simultaneously downloaded from several servers. Determining response times in such systems is still a difficult issue, because the ...
- 3Citation
MetricsTotal Citations3
- research-article
Population effects in multiclass processor sharing queues
- Abdelghani Ben Tahar
Laboratoire de Mathématiques Raphaël Salem, Saint-Étienne-du-Rouvray
, - Alain Jean-Marie
INRIA/LIRMM, Montpellier
VALUETOOLS '09: Proceedings of the Fourth International ICST Conference on Performance Evaluation Methodologies and Tools•October 2009, Article No.: 33, pp 1-10• https://doi.org/10.4108/ICST.VALUETOOLS2009.7622Consider a single server queueing system with several classes of customers, each having its own renewal input process and its own general service times distribution. Upon completing service, customers may leave, or reenter the queue, possibly as ...
- 1Citation
- 71
- Downloads
MetricsTotal Citations1Total Downloads71
- Abdelghani Ben Tahar
- article
Data replication optimisation in grid delivery network
- Anne-Elisabeth Baert
LIRMM, CNRS, Universite de Montpellier 2, 161 rue ADA, 34392 Montpellier Cedex 5, France.
, - Vincent Boudet
LIRMM, CNRS, Universite de Montpellier 2, 161 rue ADA, 34392 Montpellier Cedex 5, France.
, - Alain Jean-Marie
LIRMM, CNRS, Universite de Montpellier 2, 161 rue ADA, 34392 Montpellier Cedex 5, France
International Journal of Grid and Utility Computing, Volume 1, Issue 4•August 2009, pp 287-295 • https://doi.org/10.1504/IJGUC.2009.027918In this paper, we examine the data replication problem in a particular Grid Delivery Network (GDN) which is a system that provides video services, among which is Video On Demand (VOD). In this system, the data are divided into fixed size blocks which ...
- 0Citation
MetricsTotal Citations0
- Anne-Elisabeth Baert
- Article
Optimization of Download Times in a Distributed VOD System
ICPPW '08: Proceedings of the 2008 International Conference on Parallel Processing - Workshops•September 2008, pp 173-180• https://doi.org/10.1109/ICPP-W.2008.27In this paper, we examine the problem of minimizing the variance of the download time in a particular Video on Demand System. This VOD system is based on a Grid Delivery Network which is an hybrid architecture based on P2P and Grid Computing concepts. ...
- 0Citation
MetricsTotal Citations0
- Article
Performance Analysis of Data Replication in Grid Delivery Networks
CISIS '08: Proceedings of the 2008 International Conference on Complex, Intelligent and Software Intensive Systems•March 2008, pp 369-374• https://doi.org/10.1109/CISIS.2008.25In this paper, we examine the data replication problem in a particular Grid Delivery Network (GDN). In this system, the data are divided into fixed size blocks which must be replicated on hosts to decrease the total download time. We propose a ...
- 0Citation
MetricsTotal Citations0
- research-article
Computational aspects of the workload distribution in the MMPP/GI/1 queue
- A. Jean-Marie
Inst. Nat. de Recherche en Inf. et Autom., Sophia Antipolis
, - Zhen Liu,
- P. Nain,
- D. Towsley
IEEE Journal on Selected Areas in Communications, Volume 16, Issue 5•September 2006, pp 640-652 • https://doi.org/10.1109/49.700902We show how the analysis of Markov modulated rate processes can be used to address the problem of computing the distribution of W, the stationary workload in the MMPP/GI/1 queue. Using the results of papers by Anick et al. (1982); Mitra (1988); and ...
- 1Citation
MetricsTotal Citations1
- A. Jean-Marie
- article
Optimal Routing in Two Parallel Queues with Exponential Service Times
- Bruno Gaujal
INRIA, ENS Lyon, Lyon, France F-69364
, - Emmanuel Hyon
LIP6, Paris, France 75252
, - Alain Jean-Marie
LIRMM, Université Sciences et Techniques du Languedoc, Montpellier, France F-34392
Discrete Event Dynamic Systems, Volume 16, Issue 1•January 2006, pp 71-107 • https://doi.org/10.1007/s10626-006-6179-3In this paper we investigate the problem of the effective computation of the optimal routing sequence in a queuing system made of two parallel queues with exponential service times. We first show that the optimal policy (minimizing the expected waiting ...
- 1Citation
MetricsTotal Citations1
- Bruno Gaujal
- article
On the compromise between burstiness and frequency of events
- Alain Jean-Marie
LIRMM, 161 Rue Ada, 34392 Montpellier Cedex 5, France
, - Yvan Calas
Information Technology Department, CERN, CH-1211 Geneva 23, Switzerland
, - Tigist Alemu
LIRMM, 161 Rue Ada, 34392 Montpellier Cedex 5, France
Performance Evaluation, Volume 62, Issue 1-4•October 2005, pp 382-399 • https://doi.org/10.1016/j.peva.2005.07.020Consider two situations where events occur randomly in a system with a common average rate, but with different distributions for the size of bursts of events. Assume that the performance measure of interest is the probability that less than h events ...
- 1Citation
MetricsTotal Citations1
- Alain Jean-Marie
- Article
The interaction of forward error correction and active queue management
- Tigist Alemu
LIRMM UMR 5506 CNRS and University of Montpellier II, Montpellier Cedex 5, France
, - Yvan Calas
LIRMM UMR 5506 CNRS and University of Montpellier II, Montpellier Cedex 5, France
, - Alain Jean-Marie
LIRMM UMR 5506 CNRS and University of Montpellier II, Montpellier Cedex 5, France
NETWORKING'05: Proceedings of the 4th IFIP-TC6 international conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems•May 2005, pp 1146-1155• https://doi.org/10.1007/11422778_92This paper studies the interaction of a forward error correction (FEC) code with queue management schemes like Drop Tail (DT) and RED. Since RED spreads randomly packet drops, it reduces consecutive losses. This property makes RED compatible a priori ...
- 1Citation
MetricsTotal Citations1
- Tigist Alemu
- article
Timing analysis of compound scheduling policies: application to posix1003.1b
- Jörn Migge
LORIA--CNRS UMR 7503, TRIO Team--ENSEM 2, Avenue de la forêt de Haye, F-54516 Vandoeuvre-lès-Nancy, France
, - Alain Jean-Marie
LIRMM, Département IFA, 161 Rue Ada, F-34392 Montpellier, Cedex 05, France
, - Nicolas Navet
LORIA--CNRS UMR 7503, TRIO Team--ENSEM 2, Avenue de la forêt de Haye, F-54516 Vandoeuvre-lès-Nancy, France
Journal of Scheduling, Volume 6, Issue 5•September/October 2003, pp 457-482 • https://doi.org/10.1023/A:1024806606443The analysis of fixed priority preemptive scheduling has been extended in various ways to improve its usefulness for the design of real-time systems. In this paper, we define the layered preemptive priority scheduling policy which generalizes fixed ...
- 1Citation
MetricsTotal Citations1
- Jörn Migge
- article
Open-loop video distribution with support of VCR Functionality
- Ernst W. Biersack
Institut Eurécom, BP 193, 06904 Sophia-Antipolis, France
, - Alain Jean-Marie
LIRMM, Université de Montpellier II, 161 Rue Ada, 34392 Montpellier Cedex 5, France
, - Philippe Nain
INRIA Sophia-Antipolis, 2004 Route des Lucioles, BP 93 06902 Sophia-Antipolis Cedex, France
Performance Evaluation, Volume 49, Issue 1-4•September 2002, pp 411-427 • https://doi.org/10.1016/S0166-5316(02)00134-7Scalable video distribution schemes have been studied for quite some time. For very popular videos, open-loop broadcast schemes have been devised that partition each video into segments and periodically broadcast each segment on a different channel. ...
- 1Citation
MetricsTotal Citations1
- Ernst W. Biersack
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