Applied Filters
- Dean F. Hougen
- AuthorRemove filter
People
Colleagues
- Maria L Gini (8)
- Paul Edmund Rybski (6)
- Brent E Eskridge (5)
- Nikolaos Panagiotis Papanikolopoulos (5)
- Pedro A Diaz-Gomez (5)
- Sascha Arne Stoeter (5)
- James Robert Slagle (2)
- Benjamin P Carlson (1)
- Bryan Hoke (1)
- Gerardo Gonzalez (1)
- Jason M Black (1)
- John M Crofford (1)
- Michael D Erickson (1)
- Nathaniel P Troutman (1)
- William Booker (1)
Roles
Publication
Proceedings/Book Names
- GECCO '09: Proceedings of the 11th Annual conference on Genetic and evolutionary computation (3)
- 2018 IEEE Congress on Evolutionary Computation (CEC) (2)
- GECCO '10: Proceedings of the 12th annual conference on Genetic and evolutionary computation (2)
- AAAI'06: proceedings of the 21st national conference on Artificial intelligence - Volume 2 (1)
- AAMAS '02: Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 3 (1)
- AAMAS '07: Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems (1)
- AGENTS '00: Proceedings of the fourth international conference on Autonomous agents (1)
- AGENTS '01: Proceedings of the fifth international conference on Autonomous agents (1)
- Autonome Mobile Systeme 2000, 16. Fachgespräch (1)
- CIC '06: Proceedings of the 15th International Conference on Computing (1)
- Connectionist reinforcement learning for control of robotic systems (1)
- GECCO '05: Proceedings of the 7th annual conference on Genetic and evolutionary computation (1)
- GECCO '06: Proceedings of the 8th annual conference on Genetic and evolutionary computation (1)
- GECCO '08: Proceedings of the 10th annual conference on Genetic and evolutionary computation (1)
- ICML '00: Proceedings of the Seventeenth International Conference on Machine Learning (1)
- Revised Papers from the International Seminar on Advances in Plan-Based Control of Robotic Agents, (1)
- SNPD-SAWN '06: Proceedings of the Seventh ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (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
Nurturing Promotes the Evolution of Generalized Supervised Learning
- Bryan Hoke
School of Computer Science, University of Oklahoma, Gallogly College of Engineering, Robotics, Evolution, Adaptation, and Learning Laboratory, Norman, OK, 73019-1101
, - Dean Frederick Hougen
School of Computer Science, University of Oklahoma, Gallogly College of Engineering, Robotics, Evolution, Adaptation, and Learning Laboratory, Norman, OK, 73019-1101
2018 IEEE Congress on Evolutionary Computation (CEC)•July 2018, pp 1-8• https://doi.org/10.1109/CEC.2018.8477786The ability to learn makes intelligent systems more adaptive. One approach to the development of learning algorithms is to evolve them using evolutionary algorithms. The evolution of learning is interesting as a practical matter because harnessing it may ...
- 0Citation
MetricsTotal Citations0
- Bryan Hoke
- research-article
Meiotic Inheritance and Gene Dominance in Synthetic Sympatric Speciation
- William Booker
School of Computer Science, University of Oklahoma, Gallogly College of Engineering, Robotics, Evolution, Adaptation, and Learning Laboratory, Norman, OK, 730191101
, - Dean Frederick Hougen
School of Computer Science, University of Oklahoma, Gallogly College of Engineering, Robotics, Evolution, Adaptation, and Learning Laboratory, Norman, OK, 730191101
2018 IEEE Congress on Evolutionary Computation (CEC)•July 2018, pp 1-8• https://doi.org/10.1109/CEC.2018.8477761Speciation is a critical process in both evolutionary biology and evolutionary computation. It helps us understand the development of life on Earth and can improve evolutionary algorithms' abilities to find global maxima. In recent years, there ...
- 0Citation
MetricsTotal Citations0
- William Booker
- article
Extending adaptive fuzzy behavior hierarchies to multiple levels of composite behaviors
- Brent E. Eskridge
Southern Nazarene University, Bethany, OK, 73008, USA and University of Oklahoma, Norman, OK, 73019, USA
, - Dean F. Hougen
University of Oklahoma, Norman, OK, 73019, USA
Robotics and Autonomous Systems, Volume 58, Issue 9•September, 2010, pp 1076-1084 • https://doi.org/10.1016/j.robot.2010.05.003We propose an extended version of adaptive fuzzy behavior hierarchies, termed Multiple Composite Levels (MCL), that allows for the proper modulation of composite behaviors over multiple levels of a behavior hierarchy, and demonstrate its effectiveness ...
- 0Citation
MetricsTotal Citations0
- Brent E. Eskridge
- research-articlePublished By ACMPublished By ACM
Applying the triple parameter hypothesis to maintenance scheduling
- John Crofford
Southern Nazarene University, Bethany, OK, USA
, - Brent E. Eskridge
Southern Nazarene University, Bethany, OK, USA
, - Dean F. Hougen
University of Oklahoma, Norman, OK, USA
GECCO '10: Proceedings of the 12th annual conference on Genetic and evolutionary computation•July 2010, pp 799-806• https://doi.org/10.1145/1830483.1830623A method for identifying values for a genetic algorithm's probability of crossover, mutation rate, and selection pressure that promote the evolution of better results in fewer generations has recently been proposed. This approach, termed the Triple ...
- 0Citation
- 102
- Downloads
MetricsTotal Citations0Total Downloads102Last 12 Months1
- John Crofford
- research-articlePublished By ACMPublished By ACM
Phenotype feedback genetic algorithm operators for heuristic encoding of snakes within hypercubes
- Benjamin P. Carlson
University of Oklahoma, Norman, OK, USA
, - Dean F. Hougen
University of Oklahoma, Norman, OK, USA
GECCO '10: Proceedings of the 12th annual conference on Genetic and evolutionary computation•July 2010, pp 791-798• https://doi.org/10.1145/1830483.1830622Many complex problems can be solved by a sequence of steps or simple heuristics. In many cases a good solution relies on both good heuristics and proper ordering of their application. Problems such as creating a constrained path through a graph can be ...
- 7Citation
- 185
- Downloads
MetricsTotal Citations7Total Downloads185Last 12 Months1Last 6 weeks1
- Benjamin P. Carlson
- posterPublished By ACMPublished By ACM
Elitism, fitness, and growth
- Gerardo Gonzalez
University of Oklahoma, Norman, OK, USA
, - Dean F. Hougen
University of Oklahoma, Norman, OK, USA
GECCO '09: Proceedings of the 11th Annual conference on Genetic and evolutionary computation•July 2009, pp 1851-1852• https://doi.org/10.1145/1569901.1570199Bloat may occur when evolution allows chromosome growth. Recently it has been shown that elitism can inhibit bloat. Here we study interactions between growth, elitism, and fitness landscapes. Our results show that in some cases elitism neither ...
- 0Citation
- 115
- Downloads
MetricsTotal Citations0Total Downloads115
- Gerardo Gonzalez
- posterPublished By ACMPublished By ACM
Using action abstraction to evolve effective controllers
- Brent E. Eskridge
University of Oklahoma, Norman, OK, USA
, - Dean F. Hougen
University of Oklahoma, Norman, OK, USA
GECCO '09: Proceedings of the 11th Annual conference on Genetic and evolutionary computation•July 2009, pp 1773-1774• https://doi.org/10.1145/1569901.1570153We propose that abstracting the actions of a behavior coordination mechanism promotes the faster development and higher fitness of an effective controller for complex, composite tasks. Various techniques are well suited for the development of ...
- 2Citation
- 76
- Downloads
MetricsTotal Citations2Total Downloads76
- Brent E. Eskridge
- research-articlePublished By ACMPublished By ACM
Three interconnected parameters for genetic algorithms
- Pedro A. Diaz-Gomez
Cameron University, Lawton, OK, USA
, - Dean F. Hougen
University of Oklahoma, Norman, OK, USA
GECCO '09: Proceedings of the 11th Annual conference on Genetic and evolutionary computation•July 2009, pp 763-770• https://doi.org/10.1145/1569901.1570007When an optimization problem is encoded using genetic algorithms, one must address issues of population size, crossover and mutation operators and probabilities, stopping criteria, selection operator and pressure, and fitness function to be used in ...
- 7Citation
- 209
- Downloads
MetricsTotal Citations7Total Downloads209Last 12 Months2
- Pedro A. Diaz-Gomez
- posterPublished By ACMPublished By ACM
Is "best-so-far" a good algorithmic performance metric?
- Nathaniel P. Troutman
Southern Nazarene University, Bethany, OK, USA
, - Brent E. Eskridge
Southern Nazarene University, Bethany, OK, USA
, - Dean F. Hougen
University of Oklahoma, Norman, OK, USA
GECCO '08: Proceedings of the 10th annual conference on Genetic and evolutionary computation•July 2008, pp 1147-1148• https://doi.org/10.1145/1389095.1389321In evolutionary computation, experimental results are commonly analyzed using an algorithmic performance metric called best-so-far. While best-so-far can be a useful metric, its use is particularly susceptible to three pitfalls: a failure to establish a ...
- 3Citation
- 122
- Downloads
MetricsTotal Citations3Total Downloads122
- Nathaniel P. Troutman
- posterPublished By ACMPublished By ACM
Using priorities to simplify behavior coordination
- Brent E. Eskridge
University of Oklahoma, Norman, Oklahoma
, - Dean F. Hougen
University of Oklahoma, Norman, Oklahoma
AAMAS '07: Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems•May 2007, Article No.: 236, pp 1-3• https://doi.org/10.1145/1329125.1329411Previous research has used behavior hierarchies to address the problem of coordinating large numbers of behaviors. However, behavior hierarchies scale poorly since they require the state information of low-level behaviors. Abstracting this state ...
- 2Citation
- 139
- Downloads
MetricsTotal Citations2Total Downloads139
- Brent E. Eskridge
- Article
A Genetic Algorithm Approach for Doing Misuse Detection in Audit Trail Files
- Pedro A. Diaz-Gomez
University of Oklahoma, USA
, - Dean F. Hougen
University of Oklahoma, USA
CIC '06: Proceedings of the 15th International Conference on Computing•November 2006, pp 329-338• https://doi.org/10.1109/CIC.2006.6This paper focuses on the development of an Intrusion Detection System based on Genetic Algorithms. We present and justify a fitness function independent of variable parameters that addresses the problem of false positives. This fitness function is a ...
- 3Citation
MetricsTotal Citations3
- Pedro A. Diaz-Gomez
- Article
A benchmark for cooperative learning agents
- Jason M. Black
Robotics, Evolution, Adaptation, and Learning Laboratory, School of Computer Science, University of Oklahoma, Norman, OK
, - Dean F. Hougen
Robotics, Evolution, Adaptation, and Learning Laboratory, School of Computer Science, University of Oklahoma, Norman, OK
AAAI'06: proceedings of the 21st national conference on Artificial intelligence - Volume 2•July 2006, pp 1855-1856- 0Citation
MetricsTotal Citations0
- Jason M. Black
- ArticlePublished By ACMPublished By ACM
The snake in the box problem: mathematical conjecture and a genetic algorithm approach
- Pedro A. Diaz-Gomez
University of Oklahoma, OK
, - Dean F. Hougen
University of Oklahoma, OK
GECCO '06: Proceedings of the 8th annual conference on Genetic and evolutionary computation•July 2006, pp 1409-1410• https://doi.org/10.1145/1143997.1144219With applications in coding theory and hypercube-based computing and networking, the "snake in the box" problem is of great practical importance. Moreover, it is both mathematically elegant and highly difficult. The problem is simply to find the longest ...
- 0Citation
- 23
- Downloads
MetricsTotal Citations0Total Downloads23Last 12 Months3
- Pedro A. Diaz-Gomez
- Article
Genetic Algorithms for Hunting Snakes in Hypercubes: Fitness Function Analysis and Open Questions
- Pedro A. Diaz-Gomez
University of Oklahoma, OK, USA
, - Dean F. Hougen
University of Oklahoma, OK, USA
SNPD-SAWN '06: Proceedings of the Seventh ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing•June 2006, pp 389-394• https://doi.org/10.1109/SNPD-SAWN.2006.41Hunting for snakes of maximum length in hypercubes has been addressed with non-heuristic methods for hypercubes of dimension less than eight. Above that dimension the problem is intractable because the search grows exponentially with the dimension, ...
- 3Citation
MetricsTotal Citations3
- Pedro A. Diaz-Gomez
- ArticlePublished By ACMPublished By ACM
Analysis and mathematical justification of a fitness function used in an intrusion detection system
- Pedro A. Diaz-Gomez
Universidad El Bosque, Bogota, Colombia
, - Dean F. Hougen
University of Oklahoma, Norman, OK
GECCO '05: Proceedings of the 7th annual conference on Genetic and evolutionary computation•June 2005, pp 1591-1592• https://doi.org/10.1145/1068009.1068274Convergence to correct solutions in Genetic Algorithms depends largely on the fitness function. A fitness function that captures all goals and constraints can be difficult to find. This paper gives a mathematical justification for a fitness function ...
- 3Citation
- 431
- Downloads
MetricsTotal Citations3Total Downloads431Last 12 Months1
- Pedro A. Diaz-Gomez
- ArticlePublished By ACMPublished By ACM
A distributed surveillance task using miniature robots
- Paul E. Rybski
University of Minnesota, Minneapolis, MN
, - Maria Gini
University of Minnesota, Minneapolis, MN
, - Dean F. Hougen
University of Minnesota, Minneapolis, MN
, - Sascha A. Stoeter
University of Minnesota, Minneapolis, MN
, - Nikolaos Papanikolopoulos
University of Minnesota, Minneapolis, MN
AAMAS '02: Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 3•July 2002, pp 1393-1394• https://doi.org/10.1145/545056.545139We present experimental results from a distributed surveillance task in which multiple miniature robots (called Scouts) automatically position themselves in an area and watch for motion. We discuss how the limited communication bandwidth affects how the ...
- 3Citation
- 271
- Downloads
MetricsTotal Citations3Total Downloads271
- Paul E. Rybski
- Article
Performance of a Distributed Robotic System Using Shared Communication Channels
Revised Papers from the International Seminar on Advances in Plan-Based Control of Robotic Agents,•October 2001, pp 211-225We have designed and built a set of miniature robots and developed a distributed software system to control them. We present experimental results on a surveillance taskin which multiple robots patrol an area and watch for motion. We discuss how the ...
- 0Citation
MetricsTotal Citations0
- ArticlePublished By ACMPublished By ACM
Dynamic scheduling of a fixed bandwidth communications channel for controlling multiple robots
- Paul E. Rybski
Center for Distributed Robotics, Department of Computer Science and Engineering, University of Minnesota Minneapolis, MN
, - Sascha A. Stoeter
Center for Distributed Robotics, Department of Computer Science and Engineering, University of Minnesota Minneapolis, MN
, - Maria Gini
Center for Distributed Robotics, Department of Computer Science and Engineering, University of Minnesota Minneapolis, MN
, - Dean F. Hougen
Center for Distributed Robotics, Department of Computer Science and Engineering, University of Minnesota Minneapolis, MN
, - Nikolaos Papanikolopoulos
Center for Distributed Robotics, Department of Computer Science and Engineering, University of Minnesota Minneapolis, MN
AGENTS '01: Proceedings of the fifth international conference on Autonomous agents•May 2001, pp 153-154• https://doi.org/10.1145/375735.376033We describe a distributed software system for controlling a group of miniature robots using a low capacity communication system. Space and power limitations on the robots drastically limit the capacity of the communication system and require sharing ...
- 2Citation
- 178
- Downloads
MetricsTotal Citations2Total Downloads178
- Paul E. Rybski
- Article
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