Michel Lemaître
Applied Filters
- Michel Lemaître
- AuthorRemove filter
People
Colleagues
- Michel Lemaître (23)
- Gérard Verfaillie (7)
- Guy Durrieu (7)
- Sylvain Bouveret (7)
- Bernard Lecussan (4)
- Michel Castan (4)
- Alessandro Contessa (3)
- Cédric Pralet (2)
- Eric Cousin (2)
- Kamel Kessaci (2)
- M H Durand (2)
- Nicolas Bataille (2)
- Paulino Ng (2)
- C Carrière (1)
- Frédéric Rousseau (1)
- Judith Benzakki (1)
- M Belhadj (1)
- Michel Israël (1)
- Nicolas Maudet (1)
- Patrice Quinton (1)
Publication
Proceedings/Book Names
- AAAI '98/IAAI '98: Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence (1)
- AAAI'96: Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1 (1)
- AAMAS '05: Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems (1)
- AAMAS '14: Proceedings of the 2014 international conference on Autonomous agents and multi-agent systems (1)
- AAMAS '19: Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems (1)
- CODES '94: Proceedings of the 3rd international workshop on Hardware/software co-design (1)
- CP '01: Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming (1)
- ECAI'12: Proceedings of the 20th European Conference on Artificial Intelligence (1)
- IJCAI '99: Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence (1)
- IJCAI'07: Proceedings of the 20th international joint conference on Artifical intelligence (1)
- IJCAI'99: Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1 (1)
- LFP '86: Proceedings of the 1986 ACM conference on LISP and functional programming (1)
- PARLE '89: Proceedings of the Parallel Architectures and Languages Europe, Volume I: Parallel Architectures (1)
- Proc. of a workshop on Graph reduction (1)
- Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence (1)
- Proceedings of the international workshop on Algorithms and parallel VLSI architectures II (1)
- Proceedings of the Second IFIP WG10.2/WG10.5 Workshop on Designing Correct Circuits (1)
- Proceedings of the Workshop on Graph Reduction (1)
Publisher
- Springer-Verlag (4)
- Morgan Kaufmann Publishers Inc. (3)
- Association for Computing Machinery (2)
- International Foundation for Autonomous Agents and Multiagent Systems (2)
- IOS Press (2)
- Kluwer Academic Publishers (2)
- AAAI Press (1)
- American Association for Artificial Intelligence (1)
- Cambridge University Press (1)
- Elsevier North-Holland, Inc. (1)
- Elsevier Science Publishers B. V. (1)
- Elsevier Science Publishers Ltd. (1)
- IEEE Computer Society Press (1)
- North-Holland Publishing Co. (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
Efficiency, Sequenceability and Deal-Optimality in Fair Division of Indivisible Goods
- Aurélie Beynier
LIP6, Sorbonne Université, Paris, France
, - Sylvain Bouveret
Grenoble INP - Univ. Grenoble-Alpes LIG, Grenoble, France
, - Michel Lemaître
Formerly ONERA, Toulouse, France
, - Nicolas Maudet
LIP6, Sorbonne Université, Paris, France
, - Simon Rey
CNRS, ENS Paris-Saclay, Paris, Cachan, France
, - Parham Shams
LIP6, Sorbonne Université, Paris, France
AAMAS '19: Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems•May 2019, pp 900-908In fair division of indivisible goods, using sequences of sincere choices (or picking sequences) is a natural way to allocate the objects. The idea is as follows: at each stage, a designated agent picks one object among those that remain. Another ...
- 1Citation
- 47
- Downloads
MetricsTotal Citations1Total Downloads47Last 12 Months1
- Aurélie Beynier
- article
Characterizing conflicts in fair division of indivisible goods using a scale of criteria
- Sylvain Bouveret
LIG, Université Grenoble-Alpes, Saint-Martin-d'Hères, France 38402
, - Michel Lemaître
Onera Toulouse, Toulouse, France
Autonomous Agents and Multi-Agent Systems, Volume 30, Issue 2•March 2016, pp 259-290 • https://doi.org/10.1007/s10458-015-9287-3We investigate five different fairness criteria in a simple model of fair resource allocation of indivisible goods based on additive preferences. We show how these criteria are connected to each other, forming an ordered scale that can be used to ...
- 76Citation
MetricsTotal Citations76
- Sylvain Bouveret
- research-article
Characterizing conflicts in fair division of indivisible goods using a scale of criteria
- Sylvain Bouveret
LIG - Grenoble INP, Grenoble, France
, - Michel Lemaître
Formerly Onera, Toulouse, France
AAMAS '14: Proceedings of the 2014 international conference on Autonomous agents and multi-agent systems•May 2014, pp 1321-1328We investigate five different fairness criteria in a simple model of fair resource allocation of indivisible goods based on additive preferences. We show how these criteria are connected to each other, forming an ordered scale that can be used to ...
- 14Citation
- 105
- Downloads
MetricsTotal Citations14Total Downloads105
- Sylvain Bouveret
- Article
Fair division of indivisible goods under risk
- Charles Lumet
Onera Toulouse, France
, - Sylvain Bouveret
Grenoble INP - LIG, France
, - Michel Lemaître
Formerly Onera Toulouse
ECAI'12: Proceedings of the 20th European Conference on Artificial Intelligence•August 2012, pp 564-569We consider the problem of fairly allocating a set of m indivisible objects to n agents having additive preferences over them. In this paper we propose an extension of this classical problem, where each object can possibly be in bad condition (e.g ...
- 0Citation
MetricsTotal Citations0
- Charles Lumet
- article
Review:
- Gérard Verfaillie
Onera, 2 av. Édouard belin, bp 74025, f-31055 toulouse cedex 4, france
, - Cédric Pralet
Onera, 2 av. Édouard belin, bp 74025, f-31055 toulouse cedex 4, france
, - Michel Lemaître
Onera, 2 av. Édouard belin, bp 74025, f-31055 toulouse cedex 4, france
The Knowledge Engineering Review, Volume 25, Issue 3•September 2010, pp 319-336 • https://doi.org/10.1017/S0269888910000172The CNT framework (Constraint Network on Timelines) has been designed to model discrete event dynamic systems and the properties one knows, one wants to verify, or one wants to enforce on them. In this article, after a reminder about the CNT framework, ...
- 9Citation
MetricsTotal Citations9
- Gérard Verfaillie
- Article
Constraint-Based Controller Synthesis in Non-Deterministic and Partially Observable Domains
- Cédric Pralet
ONERA, Toulouse, France, email: [email protected]
, - Gérard Verfaillie
ONERA, Toulouse, France, email: [email protected]
, - Michel Lemaître
ONERA, Toulouse, France, email: [email protected]
, - Guillaume Infantes
ONERA, Toulouse, France, email: [email protected]
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence•August 2010, pp 681-686Controller synthesis consists in automatically building controllers taking as inputs observation data and returning outputs guaranteeing that the controlled system satisfies some desired properties. In system specification, these properties may be ...
- 1Citation
MetricsTotal Citations1
- Cédric Pralet
- article
Computing leximin-optimal solutions in constraint networks
- Sylvain Bouveret
ONERA -- Centre de Toulouse, 2, avenue Édouard Belin, BP74025, 31055 Toulouse Cedex 4, France
, - Michel Lemaître
ONERA -- Centre de Toulouse, 2, avenue Édouard Belin, BP74025, 31055 Toulouse Cedex 4, France
Artificial Intelligence, Volume 173, Issue 2•February, 2009, pp 343-364 • https://doi.org/10.1016/j.artint.2008.10.010In many real-world multiobjective optimization problems one needs to find solutions or alternatives that provide a fair compromise between different conflicting objective functions-which could be criteria in a multicriteria context, or agent utilities ...
- 16Citation
MetricsTotal Citations16
- Sylvain Bouveret
- Article
New constraint programming approaches for the computation of leximin-optimal solutions in constraint networks
- Sylvain Bouveret
Office National d'Études et de Recherches Aérospatiales
, - Michel Lemaître
Office National d'Études et de Recherches Aérospatiales
IJCAI'07: Proceedings of the 20th international joint conference on Artifical intelligence•January 2007, pp 62-67We study the problem of computing a leximin-optimal solution of a constraint network. This problem is highly motivated by fairness and efficiency requirements in many real-world applications implying human agents. We compare several generic algorithms ...
- 2Citation
MetricsTotal Citations2
- Sylvain Bouveret
- ArticlePublished By ACMPublished By ACM
Allocation of indivisible goods: a general model and some complexity results
- Sylvain Bouveret
ONERA, Centre de Toulouse
, - Michel Lemaître
ONERA, Centre de Toulouse
, - Hélène Fargier
IRIT-CNRS
, - Jérôme Lang
IRIT-CNRS
AAMAS '05: Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems•July 2005, pp 1309-1310• https://doi.org/10.1145/1082473.1082747Many industrial or research activities are so expensive that it is often benefitable for the involved agents to cofund the construction or the purchase of a common required resource. This resource will then be exploited in common, therefore in a shared ...
- 30Citation
- 324
- Downloads
MetricsTotal Citations30Total Downloads324Last 12 Months2Last 6 weeks1
- Sylvain Bouveret
- Article
Selecting and Scheduling Observations for Agile Satellites: Some Lessons from the Constraint Reasoning Community Point of View
CP '01: Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming•November 2001, pp 670-684This paper presents some lessons that can be drawn, from the point of view of the constraint reasoning and constraint programming community, from trying to model and to solve as best as possible the mission management problem for the new generation of ...
- 3Citation
MetricsTotal Citations3
- article
Earth Observation Satellite Management
- E. Bensana
ONERA, Centre de Toulouse, 12, avenue Idouard Belin, BP 4025, 31055 Toulouse cedex 4, France
, - M. Lemaitre
ONERA, Centre de Toulouse, 12, avenue Idouard Belin, BP 4025, 31055 Toulouse cedex 4, France
, - G. Verfaillie
ONERA, Centre de Toulouse, 12, avenue Idouard Belin, BP 4025, 31055 Toulouse cedex 4, France
The daily management of an earth observation satellite is a challenging combinatorial optimization problem. This problem can be roughly stated as follows: given (1) a set of candidate images for the next day, each one associated with a weight reflecting its ...
- 34Citation
MetricsTotal Citations34
- E. Bensana
- Article
Exploiting a common property resource under a fairness constraint: a case study
- Michel Lemaitre
ONERA, CERT, Toulouse Cedex, France
, - Gerard Verfaillie
ONERA, CERT, Toulouse Cedex, France
, - Nicolas Bataille
Centre National d'Etudes Spatiales, Toulouse Cedex, France
IJCAI'99: Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1•July 1999, pp 206-211Resources co-funded by several agents must be exploited in such a way that three kinds of constraints are met: (1) physical problem (hard) constraints; (2) efficiency constraints, aiming at maximizing the satisfaction of each agent; (3) a fairness ...
- 5Citation
MetricsTotal Citations5
- Michel Lemaitre
- Article
Branch and bound algorithm selection by performance prediction
AAAI '98/IAAI '98: Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence•July 1998, pp 353-358We propose a method called Selection by Performance Prediction (SPP) which allows one, when faced with a particular problem instance, to select a Branch and Bound algorithm from among several promising ones. This method is based on Knuth's sampling ...
- 17Citation
MetricsTotal Citations17
- Article
Russian doll search for solving constraint optimization problems
- Gérard Verfaillie
CERT, ONERA, Toulouse Cedex, France
, - Michel Lemaître
INRA, Castanet Tolosan Cedex, France
, - Thomas Schiex
INRA, Castanet Tolosan Cedex, France
AAAI'96: Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1•August 1996, pp 181-187If the Constraint Satisfaction framework has been extended to deal with Constraint Optimization problems, it appears that optimization is far more complex than satisfaction. One of the causes of the inefficiency of complete tree search methods, like ...
- 27Citation
MetricsTotal Citations27
- Gérard Verfaillie
- Articlefree
Towards a multi-formalism framework for architectural synthesis: the ASAR project
- M. Auguin
I3S
, - M. Belhadj
IRISA
, - J. benzakki
LIVE
, - C. Carrière
I3S
, - G. Durrieu
CERT-Onera
, - Th. Gautier
IRISA-INRIA
, - M. Israël
LIVE
, - P. Le Guernic
IRISA-INRIA
, - M. Lemaître
CERT-Onera
, - E. Martin
LISTI
, - P. Quinton
IRISA-CNRS
, - L. Rideau
INRIA-Sophia
, - F. Rousseau
LIVE
, - O. Sentieys
LASTI
CODES '94: Proceedings of the 3rd international workshop on Hardware/software co-design•September 1994, pp 25-32This paper describes a research project - named ASAR - grouping together six french research teams, oriented towards architectural and system synthesis. A main concern of this project is hardware/software codesign and user interface management.
- 3Citation
- 131
- Downloads
MetricsTotal Citations3Total Downloads131Last 12 Months14Last 6 weeks1
- M. Auguin
- Article
MaRS, a Combinator Graph Reduction Multiprocessor
- Alessandro Contessa,
- Eric Cousin,
- C. Coustet,
- M. Cubero-Castan,
- Guy Durrieu,
- Bernard Lecussan,
- Michel Lemaître,
- Paulino Ng
PARLE '89: Proceedings of the Parallel Architectures and Languages Europe, Volume I: Parallel Architectures•June 1989, pp 176-192- 0Citation
MetricsTotal Citations0
- Article
Toward the design of a parallel graph reduction machine: the MARS project
- Michel Castan
ONERA-CERT, Toulouse, France
, - Guy Durrieu
ONERA-CERT, Toulouse, France
, - Bernard Lecussan
ONERA-CERT, Toulouse, France
, - Michel Lemaître
ONERA-CERT, Toulouse, France
, - Alessandro Contessa
ONERA-CERT, Toulouse, France
- 1Citation
MetricsTotal Citations1
- Michel Castan
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