Sanaz Mostaghim
Applied Filters
- Sanaz Mostaghim
- AuthorRemove filter
People
Colleagues
- Sanaz Mostaghim (94)
- Heiner Zille (13)
- Hartmut Schmeck (9)
- Jens Weise (8)
- Sebastian Mai (8)
- Christoph Steup (6)
- Jürgen Branke (5)
- Mahrokh Javadi (5)
- Palina Bartashevich (5)
- Tobias Benecke (5)
- Andrew D Lewis (4)
- Berend G M van Wachem (4)
- Bernd Scheuermann (4)
- Diego Pérez-Liébana (4)
- Julia H Reuter (4)
- Simon Anderer (4)
- Cristian Ramirez-Atencia (3)
- Dominik Fischer (3)
- Ruby L V Moritz (3)
- Thomas Seidelmann (3)
Publication
Proceedings/Book Names
- GECCO '19: Proceedings of the Genetic and Evolutionary Computation Conference Companion (5)
- GECCO '23 Companion: Proceedings of the Companion Conference on Genetic and Evolutionary Computation (5)
- 2016 IEEE Congress on Evolutionary Computation (CEC) (3)
- 2017 IEEE Congress on Evolutionary Computation (CEC) (3)
- 2020 IEEE Congress on Evolutionary Computation (CEC) (3)
- 2022 IEEE Congress on Evolutionary Computation (CEC) (3)
- 2019 IEEE Conference on Games (CoG) (2)
- 2021 IEEE Congress on Evolutionary Computation (CEC) (2)
- CEC'09: Proceedings of the Eleventh conference on Congress on Evolutionary Computation (2)
- EMO 2017: 9th International Conference on Evolutionary Multi-Criterion Optimization - Volume 10173 (2)
- EMO'03: Proceedings of the 2nd international conference on Evolutionary multi-criterion optimization (2)
- Evolutionary Multi-Criterion Optimization (2)
- Evolutionary Multi-Criterion Optimization (2)
- GECCO '18: Proceedings of the Genetic and Evolutionary Computation Conference (2)
- GECCO '22: Proceedings of the Genetic and Evolutionary Computation Conference Companion (2)
- Progress in Artificial Intelligence (2)
- Swarm Intelligence (2)
- Evolutionary Multi-Criterion Optimization (1)
- Parallel Problem Solving from Nature - PPSN IX (1)
- Progress in Artificial Intelligence (1)
Publisher
- Springer-Verlag (32)
- Association for Computing Machinery (28)
- IEEE Press (22)
- Kluwer Academic Publishers (3)
- Springer Publishing Company, Incorporated (3)
- IEEE Computer Society (2)
- AAAI Press (1)
- Elsevier Science Inc. (1)
- Elsevier Science Publishers B. V. (1)
- International Foundation for Autonomous Agents and Multiagent Systems (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.
- Article
Decentralized Conflict Resolution for Navigation in Swarm Robotics
- Sebastian Mai
Chair of Computational Intelligence, Faculty of Computer Science, Otto von Guericke University, Magdeburg, Germany
, - Sanaz Mostaghim
Chair of Computational Intelligence, Faculty of Computer Science, Otto von Guericke University, Magdeburg, Germany
https://ror.org/01nqmht92Fraunhofer Institute for Transportation and Infrastructure Systems IVI, Dresden, Germany
AbstractThe main challenge in multi-robot navigation is the resolution of navigation conflicts between agents caused by intersecting paths. The contributions of this paper are: The creation of a robot framework that allows us to study the emergent ...
- 0Citation
MetricsTotal Citations0
- Sebastian Mai
- Article
Innovization for Route Planning Applied to an Uber Movement Speeds Dataset for Berlin
- Eva Röper
https://ror.org/00ggpsq73Faculty of Computer Science, Otto-von-Guericke-University Magdeburg, Magdeburg, Germany
, - Jens Weise
Agentur für Innovation in der Cybersicherheit GmbH, Halle, Germany
, - Christoph Steup
https://ror.org/00ggpsq73Faculty of Computer Science, Otto-von-Guericke-University Magdeburg, Magdeburg, Germany
, - Sanaz Mostaghim
https://ror.org/00ggpsq73Faculty of Computer Science, Otto-von-Guericke-University Magdeburg, Magdeburg, Germany
https://ror.org/01nqmht92Fraunhofer Institute for Transportation and Infrastructure Systems IVI, Dresden, Germany
Parallel Problem Solving from Nature – PPSN XVIII•September 2024, pp 100-116• https://doi.org/10.1007/978-3-031-70085-9_7AbstractMulti-objective route planning is a prominent but computationally expensive optimisation problem of everyday life. Reusing knowledge from similar route planning problems could enhance the performance and the sustainability of routing algorithms. ...
- 0Citation
MetricsTotal Citations0
- Eva Röper
- Article
Unit-Aware Genetic Programming for the Development of Empirical Equations
- Julia Reuter
https://ror.org/00ggpsq73Faculty of Computer Science, Otto von Guericke University Magdeburg, Magdeburg, Germany
, - Viktor Martinek
https://ror.org/038t36y30Interdisciplinary Center for Scientific Computing, Universität Heidelberg, Heidelberg, Germany
, - Roland Herzog
https://ror.org/038t36y30Interdisciplinary Center for Scientific Computing, Universität Heidelberg, Heidelberg, Germany
, - Sanaz Mostaghim
https://ror.org/00ggpsq73Faculty of Computer Science, Otto von Guericke University Magdeburg, Magdeburg, Germany
https://ror.org/01nqmht92Fraunhofer Institute for Transportation and Infrastructure Systems IVI, Dresden, Germany
Parallel Problem Solving from Nature – PPSN XVIII•September 2024, pp 168-183• https://doi.org/10.1007/978-3-031-70055-2_11AbstractWhen developing empirical equations, domain experts require these to be accurate and adhere to physical laws. Often, constants with unknown units need to be discovered alongside the equations. Traditional unit-aware genetic programming (GP) ...
- 0Citation
MetricsTotal Citations0
- Julia Reuter
- posterPublished By ACMPublished By ACM
Survival Strategies for Evolutionary Role Mining Algorithms Using Expert Knowledge
- Simon Anderer
SIVIS GmbH, Karlsruhe, Germany
, - Nicolas Justen
SIVIS GmbH, Karlsruhe, Germany
, - Bernd Scheuermann
Karlsruhe University of applied Sciences, Karlsruhe, Germany
, - Sanaz Mostaghim
Otto von Guericke University Magdeburg, Magdeburg, Germany
GECCO '24 Companion: Proceedings of the Genetic and Evolutionary Computation Conference Companion•July 2024, pp 623-626• https://doi.org/10.1145/3638530.3654183To ensure the security of IT systems of companies and organizations, strong and reliable access control mechanisms must be implemented. A widely used approach in this context is Role Based Access Control, in which permissions are grouped into roles, that ...
- 0Citation
- 14
- Downloads
MetricsTotal Citations0Total Downloads14Last 12 Months14Last 6 weeks1
- Simon Anderer
- Article
Finding Sets of Solutions for Temporal Uncertain Problems
- Jens Weise
Faculty of Computer Science, Otto von Guericke University, Magdeburg, Germany
, - Sanaz Mostaghim
Faculty of Computer Science, Otto von Guericke University, Magdeburg, Germany
Applications of Evolutionary Computation•March 2024, pp 209-223• https://doi.org/10.1007/978-3-031-56852-7_14AbstractThe multi-objective pathfinding problem is a complex and NP-hard problem with numerous industrial applications. However, the number of non-dominated solutions can often exceed human comprehension capacity. This paper introduces a novel methodology ...
- 0Citation
MetricsTotal Citations0
- Jens Weise
- abstractPublished By ACMPublished By ACM
Towards Benchmarking of Pathfinding Algorithms in Path-Influenced Environments
- Julia Heise
Otto-von-Guericke University, Magdeburg, Germany
, - Jens Weise
Otto-von-Guericke University, Magdeburg, Germany
, - Sanaz Mostaghim
Otto-von-Guericke University, Magdeburg, Germany
GECCO '23 Companion: Proceedings of the Companion Conference on Genetic and Evolutionary Computation•July 2023, pp 69-70• https://doi.org/10.1145/3583133.3596434Pathfinding Algorithms are used in many research areas in different combinations and settings. In most cases, they are used for path planning, while another interesting problem class is path paving. This class represents road or railway construction, ...
- 0Citation
- 52
- Downloads
MetricsTotal Citations0Total Downloads52Last 12 Months32
- Julia Heise
- research-articleOpen AccessPublished By ACMPublished By ACM
Landscape Analysis of Multi-objective Control of Fluidized Beds
- Iffat Jamil
Otto-von-Guericke Universität Magdeburg, Magdeburg, Germany
, - Sanaz Mostaghim
Otto-von-Guericke Universität Magdeburg, Magdeburg, Germany
, - Berend Van Wachem
Otto-von-Guericke Universität Magdeburg, Magdeburg, Germany
, - Victor Chéron
Otto-von-Guericke Universität Magdeburg, Magdeburg, Germany
, - Max Hausmann
Otto-von-Guericke Universität Magdeburg, Magdeburg, Germany
GECCO '23 Companion: Proceedings of the Companion Conference on Genetic and Evolutionary Computation•July 2023, pp 1950-1955• https://doi.org/10.1145/3583133.3596384Fluidized beds are widely used in various industrial applications that require efficient mixing, heat and mass transfer between gas and solid particles. This paper explores the relationship between input parameters of inlet gas velocity into the ...
- 0Citation
- 157
- Downloads
MetricsTotal Citations0Total Downloads157Last 12 Months109Last 6 weeks9
- Iffat Jamil
- research-articleOpen AccessPublished By ACMPublished By ACM
Multi-objective Multiplexer Decision Making Benchmark Problem
- Boris Djartov
German Aerospace Center (DLR), Braunschweig, Germany
Otto-von-Guericke-University Magdeburg, Braunschweig, Germany
, - Sanaz Mostaghim
Otto-von-Guericke-University Magdeburg, Magdeburg, Germany
GECCO '23 Companion: Proceedings of the Companion Conference on Genetic and Evolutionary Computation•July 2023, pp 1676-1683• https://doi.org/10.1145/3583133.3596360This paper proposes a novel multi-objective decision making benchmark problem. The problem addresses the need in the multi-objective decision making realm for an easy to construct, scalable benchmark problem in the vain of the DTLZ, ZTD, and WFG ...
- 0Citation
- 132
- Downloads
MetricsTotal Citations0Total Downloads132Last 12 Months72Last 6 weeks12
- Boris Djartov
- posterPublished By ACMPublished By ACM
A Generalized Circular Supply Chain Problem for Multi-objective Evolutionary Algorithms
- Tobias Benecke
Otto von Guericke University, Magdeburg, Germany
, - Oliver Antons
Otto von Guericke University, Magdeburg, Germany
, - Sanaz Mostaghim
Otto von Guericke University, Magdeburg, Germany
, - Julia Arlinghaus
Otto von Guericke University, Magdeburg, Germany
GECCO '23 Companion: Proceedings of the Companion Conference on Genetic and Evolutionary Computation•July 2023, pp 355-358• https://doi.org/10.1145/3583133.3590742The idea of a circular economy proves promising with the evergrowing need for more sustainable production methods and resource utilization. However, this introduces new challenges compared to the traditional, mostly linear production processes and ...
- 1Citation
- 60
- Downloads
MetricsTotal Citations1Total Downloads60Last 12 Months32Last 6 weeks2
- Tobias Benecke
- posterPublished By ACMPublished By ACM
A Preference-based Activity Scheduling Algorithm Using Many-objective Optimization
- Markus Rothkötter
Otto-von-Guericke University, Magdeburg, Germany
, - Sanaz Mostaghim
Otto-von-Guericke University, Magdeburg, Germany
GECCO '23 Companion: Proceedings of the Companion Conference on Genetic and Evolutionary Computation•July 2023, pp 407-410• https://doi.org/10.1145/3583133.3590664Current business activity scheduling systems are designed to maximise efficiency in terms of business metrics, but rarely take personal preferences into account. The goal of this work is to provide a formalisation and an experimental test of a SCRUM-...
- 0Citation
- 50
- Downloads
MetricsTotal Citations0Total Downloads50Last 12 Months20
- Markus Rothkötter
- research-articleOpen AccessPublished By ACMPublished By ACM
Multi-Objective Seed Curve Optimization for Coverage Path Planning in Precision Farming
- Lukas Bostelmann-Arp
Otto-von-Guericke-University, Magdeburg, Germany
, - Christoph Steup
Otto-von-Guericke-University, Magdeburg, Germany
, - Sanaz Mostaghim
Otto-von-Guericke-University, Magdeburg, Germany
GECCO '23: Proceedings of the Genetic and Evolutionary Computation Conference•July 2023, pp 1312-1320• https://doi.org/10.1145/3583131.3590490Coverage path planning is one of the main challenges in precision farming. Here the goal is to compute a continuous optimal working path by combining individual tracks such that the entire field can be cultivated in the most efficient way. Various 2D ...
- 0Citation
- 349
- Downloads
MetricsTotal Citations0Total Downloads349Last 12 Months229Last 6 weeks15
- Lukas Bostelmann-Arp
- research-article
Dynamic Optimization of Role Concepts for Role-Based Access Control Using Evolutionary Algorithms
- Simon Anderer
Faculty of Management Science and Engineering, Hochschule Karlsruhe, Moltkestrasse 30, 76133, Karlsruhe, Germany
, - Tobias Kempter
Faculty of Management Science and Engineering, Hochschule Karlsruhe, Moltkestrasse 30, 76133, Karlsruhe, Germany
, - Bernd Scheuermann
Faculty of Management Science and Engineering, Hochschule Karlsruhe, Moltkestrasse 30, 76133, Karlsruhe, Germany
, - Sanaz Mostaghim
Institute for Intelligent Cooperating Systems, Otto-von-Guericke Universität, Universitätsplatz 2, 39106, Magdeburg, Germany
AbstractTo ensure the security of current information systems, role-based access control (RBAC) is a widely used concept. For this purpose, based on an initial assignment of permissions to users, permissions are grouped to roles, which are then assigned ...
- 0Citation
MetricsTotal Citations0
- Simon Anderer
- Article
Graph Networks as Inductive Bias for Genetic Programming: Symbolic Models for Particle-Laden Flows
- Julia Reuter
Institute for Intelligent Cooperating Systems, Otto-von-Guericke-University, Magdeburg, Germany
, - Hani Elmestikawy
Institute for Mechanical Process Engineering, Otto-von-Guericke-University, Magdeburg, Germany
, - Fabien Evrard
Institute for Mechanical Process Engineering, Otto-von-Guericke-University, Magdeburg, Germany
, - Sanaz Mostaghim
Institute for Intelligent Cooperating Systems, Otto-von-Guericke-University, Magdeburg, Germany
, - Berend van Wachem
Institute for Mechanical Process Engineering, Otto-von-Guericke-University, Magdeburg, Germany
AbstractHigh-resolution simulations of particle-laden flows are computationally limited to a scale of thousands of particles due to the complex interactions between particles and fluid. Some approaches to increase the number of particles in such ...
- 0Citation
MetricsTotal Citations0
- Julia Reuter
- Article
MACO: A Real-World Inspired Benchmark for Multi-objective Evolutionary Algorithms
- Sebastian Mai
Otto-von-Guericke University Magdeburg, Magdeburg, Germany
, - Tobias Benecke
Otto-von-Guericke University Magdeburg, Magdeburg, Germany
, - Sanaz Mostaghim
Otto-von-Guericke University Magdeburg, Magdeburg, Germany
Evolutionary Multi-Criterion Optimization•March 2023, pp 305-318• https://doi.org/10.1007/978-3-031-27250-9_22AbstractThe multi-agent coordination (MACO) problem is a real-world inspired multi-objective optimization problem for evolutionary algorithms. It recreates the challenges that are present in optimizing the real-world multi-objective multi-agent ...
- 0Citation
MetricsTotal Citations0
- Sebastian Mai
- Article
Online Learning Hyper-Heuristics in Multi-Objective Evolutionary Algorithms
- Julia Heise
Otto-von-Guericke University, Universitaetsplatz 2, 39106, Magdeburg, Germany
, - Sanaz Mostaghim
Otto-von-Guericke University, Universitaetsplatz 2, 39106, Magdeburg, Germany
Evolutionary Multi-Criterion Optimization•March 2023, pp 162-175• https://doi.org/10.1007/978-3-031-27250-9_12AbstractWell-defined Hyper-Heuristics enhance the generalization of MOEAs and the blind usability on complex and even dynamic real-world application. Previous works already showed, that Hyper-Heuristics as selectors of crossover operators improve the ...
- 1Citation
MetricsTotal Citations1
- Julia Heise
- Article
Collective Decision-Making for Conflict Resolution in Multi-Agent Pathfinding
- Sebastian Mai
https://ror.org/00ggpsq73Faculty of Computer Science, Otto von Guericke University Magdeburg, Magdeburg, Germany
, - Sanaz Mostaghim
https://ror.org/00ggpsq73Faculty of Computer Science, Otto von Guericke University Magdeburg, Magdeburg, Germany
AbstractMulti-Agent Path Planning is important in many applications involving multiple mobile robots. In this paper, we present a novel algorithm to solve the Multi-Agent Pathfinding problem by using Collective Decision-making and indirect communication (...
- 0Citation
MetricsTotal Citations0
- Sebastian Mai
- Article
Benchmarking Performances of Collective Decision-Making Strategies with Respect to Communication Bandwidths in Discrete Collective Estimation
- Qihao Shan
Chair of Computational Intelligence, Faculty of Informatics, Otto von Guericke University, Magdeburg, Germany
, - Sanaz Mostaghim
Chair of Computational Intelligence, Faculty of Informatics, Otto von Guericke University, Magdeburg, Germany
AbstractMulti-option collective decision making is an emergent topic of study within the field of swarm intelligence. Many strategies have been proposed to enable decentralized and localized decision-making behaviors in intelligent swarms. However, many ...
- 0Citation
MetricsTotal Citations0
- Qihao Shan
- research-article
Analysis of inter and intra-front operations in multi-modal multi-objective optimization problems
- Mahrokh Javadi
Faculty of Computer Science, Otto von Guericke University Magdeburg, Magdeburg, Germany
, - Sanaz Mostaghim
Faculty of Computer Science, Otto von Guericke University Magdeburg, Magdeburg, Germany
Natural Computing: an international journal, Volume 22, Issue 2•Jun 2023, pp 341-356 • https://doi.org/10.1007/s11047-022-09921-2AbstractMany real-world multi-objective optimization problems inherently have multiple multi-modal solutions and it is in fact very important to capture as many of these solutions as possible. Several crowding distance methods have been developed in the ...
- 0Citation
MetricsTotal Citations0
- Mahrokh Javadi
- research-article
A comparison of distance metrics for the multi-objective pathfinding problem
- Jens Weise
Faculty of Computer Science, Otto von Guericke University, Universitätsplatz 2, 39106, Magdeburg, Germany
, - Sanaz Mostaghim
Faculty of Computer Science, Otto von Guericke University, Universitätsplatz 2, 39106, Magdeburg, Germany
Natural Computing: an international journal, Volume 22, Issue 2•Jun 2023, pp 315-328 • https://doi.org/10.1007/s11047-022-09908-zAbstractPathfinding, also known as route planning, is one of the most important aspects of logistics, robotics, and other applications where engineers must balance many competing interests. There is a significant challenge in pathfinding problems with ...
- 0Citation
MetricsTotal Citations0
- Jens Weise
- research-article
Exploring Dynamic Pandemic Containment Strategies Using Multi-Objective Optimization [Research Frontier]
- Dominik Fischer
Otto von Guericke University Magdeburg, Germany
, - Sanaz Mostaghim
Otto von Guericke University Magdeburg, Germany
, - Thomas Seidelmann
Otto von Guericke University Magdeburg, Germany
IEEE Computational Intelligence Magazine, Volume 17, Issue 3•Aug. 2022, pp 54-65 • https://doi.org/10.1109/MCI.2022.3181347The SARS-CoV-2 pandemic demonstrates the vulnerability of societies in a globalized world. As pathogens spread at exponential rates, rapid development of appropriate medical treatments and distribution of vaccinations are major challenges. Under these ...
- 0Citation
MetricsTotal Citations0
- Dominik Fischer
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