Haijun Huang
Applied Filters
- Haijun Huang
- AuthorRemove filter
People
Publication
Proceedings/Book Names
- AAIM'05: Proceedings of the First international conference on Algorithmic Applications in Management (1)
- CSO '09: Proceedings of the 2009 International Joint Conference on Computational Sciences and Optimization - Volume 02 (1)
- CSO '11: Proceedings of the 2011 Fourth International Joint Conference on Computational Sciences and Optimization (1)
- CSO '12: Proceedings of the 2012 Fifth International Joint Conference on Computational Sciences and Optimization (1)
- ICICTA '08: Proceedings of the 2008 International Conference on Intelligent Computation Technology and Automation - Volume 02 (1)
- ICNC '07: Proceedings of the Third International Conference on Natural Computation - Volume 04 (1)
- ICNC '07: Proceedings of the Third International Conference on Natural Computation - Volume 05 (1)
- NISS '09: Proceedings of the 2009 International Conference on New Trends in Information and Service Science (1)
- WINE'05: Proceedings of the First international conference on Internet and Network Economics (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
The Day-to-Day Departure Time Choice of Heterogeneous Commuters Under an Anonymous Toll Charge for System Optimum
- Ren-Yong Guo
School of Economics and Management, Beihang University, Beijing 100191, China;
Key Laboratory of Complex System Analysis and Management Decision, Ministry of Education, Beijing 100191, China;
, - Hai Yang
Department of Civil and Environmental Engineering, The Hong Kong University of Science and Technology, Hong Kong
, - Hai-Jun Huang
School of Economics and Management, Beihang University, Beijing 100191, China;
Key Laboratory of Complex System Analysis and Management Decision, Ministry of Education, Beijing 100191, China;
Transportation Science, Volume 57, Issue 3•May-June 2023, pp 661-684 • https://doi.org/10.1287/trsc.2022.1191We consider a bottleneck system in a state of disequilibrium, in which commuters are heterogeneous in the values of travel time and schedule delays. Three representative dynamical systems are used to formulate the day-to-day departure time choice of ...
- 0Citation
MetricsTotal Citations0
- Ren-Yong Guo
- article
Are We Really Solving the Dynamic Traffic Equilibrium Problem with a Departure Time Choice?
- Ren-Yong Guo
School of Economics and Management, Beihang University, 100191 Beijing, China; and Key Laboratory of Complex System Analysis and Management Decision, Ministry of Education, 100191 Beijing, China
, - Hai Yang
Department of Civil and Environmental Engineering, Hong Kong University of Science and Technology, Kowloon, Hong Kong, China
, - Hai-Jun Huang
School of Economics and Management, Beihang University, 100191 Beijing, China; and Key Laboratory of Complex System Analysis and Management Decision, Ministry of Education, 100191 Beijing, China
Transportation Science, Volume 52, Issue 3•June 2018, pp 603-620 • https://doi.org/10.1287/trsc.2017.0764The dynamic traffic equilibrium problem has been a pivotal area of research in transportation for a few decades. The current state-of-the-art research in this area generally considers simultaneous departure time and route choice. In this paper, we ...
- 6Citation
MetricsTotal Citations6
- Ren-Yong Guo
- article
Day-to-Day Flow Dynamics and Congestion Control
- Ren-Yong Guo
College of Computer Science, Inner Mongolia University, 010021 Hohhot, China
, - Hai Yang
Department of Civil and Environmental Engineering, Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong
, - Hai-Jun Huang
School of Economics and Management, Beihang University, 100191 Beijing, China
, - Zhijia Tan
School of Management, Huazhong University of Science and Technology, 430074 Wuhan, China
Transportation Science, Volume 50, Issue 3•August 2016, pp 982-997 • https://doi.org/10.1287/trsc.2015.0596For a predetermined set of an upper bound of link flows, this paper proposes a price-based congestion control scheme for achieving such a restraint target of traffic flow that evolves from day to day. On each day, drivers have to pay a toll selected ...
- 3Citation
MetricsTotal Citations3
- Ren-Yong Guo
- article
Congestion Behavior and Tolls in a Bottleneck Model with Stochastic Capacity
- Ling-Ling Xiao
School of Economics and Management, Beihang University, Beijing 100191, China; and Key Lab of Complex System Analysis Management and Decision, Ministry of Education, China
, - Hai-Jun Huang
School of Economics and Management, Beihang University, Beijing 100191, China; and Key Lab of Complex System Analysis Management and Decision, Ministry of Education, China
, - Ronghui Liu
Institute for Transport Studies, University of Leeds, Leeds LS2 9JT, United Kingdom
Transportation Science, Volume 49, Issue 1•February 2015, pp 46-65 • https://doi.org/10.1287/trsc.2013.0483In this paper we investigate a bottleneck model in which the capacity of the bottleneck is assumed stochastic and follows a uniform distribution. The commuters' departure time choice is assumed to follow the user equilibrium principle according to mean ...
- 5Citation
MetricsTotal Citations5
- Ling-Ling Xiao
- article
Simulating the Dynamic Escape Process in Large Public Places
- Ziyou Gao
School of Traffic and Transportation, Beijing Jiaotong University, Beijing 100044, China
, - Yunchao Qu
School of Traffic and Transportation, Beijing Jiaotong University, Beijing 100044, China
, - Xingang Li
School of Traffic and Transportation, Beijing Jiaotong University, Beijing 100044, China
, - Jiancheng Long
School of Transportation Engineering, Hefei University of Technology, Hefei 230009, China
, - Hai-Jun Huang
School of Economics and Management, Beihang University, Beijing 100191, China
Pedestrian dynamics plays an important role in public facility design and evacuation management. During an escape process from a large public space, crowd behavior is a collection of pedestrian exit/route choice behavior, and movement behavior. ...
- 1Citation
MetricsTotal Citations1
- Ziyou Gao
- article
Camera location optimisation for traffic surveillance in urban road networks with multiple user classes
- Xiao-Shan Lu
School of Economics and Management, Beihang University, Beijing 100191, China
, - Hai-Jun Huang
School of Economics and Management, Beihang University, Beijing 100191, China
, - Jiancheng Long
School of Transportation Engineering, Hefei University of Technology, Hefei 230009, China
International Journal of Systems Science, Volume 44, Issue 12•December 2013, pp 2211-2222 • https://doi.org/10.1080/00207721.2012.685776New sensor technologies e.g. surveillance cameras, loop detectors enable the synthesis of disaggregated vehicle information from multiple locations. This article studies the camera location problem for traffic surveillance in urban road networks with ...
- 0Citation
MetricsTotal Citations0
- Xiao-Shan Lu
- research-article
Theoretical analysis and simulation of pedestrian evacuation under invisible conditions
- Ren-Yong Guo
College of Computer Science, Inner Mongolia University, Hohhot, China
, - Hai-Jun Huang
School of Economics and Management, Beijing University of Aeronautics and Astronautics, Beijing, China
Simulation, Volume 88, Issue 9•September 2012, pp 1138-1148 • https://doi.org/10.1177/0037549712450532We study a class of pedestrian evacuation process in rooms without visibility by analytical and simulative methods. First, the moving distance of pedestrians for leaving the rooms is analyzed using the mean and variance theory. A microscopic pedestrian ...
- 0Citation
MetricsTotal Citations0
- Ren-Yong Guo
- Article
Equilibrium Trip Scheduling in Bottleneck Model with Stochastic Capacity
CSO '12: Proceedings of the 2012 Fifth International Joint Conference on Computational Sciences and Optimization•June 2012, pp 504-508• https://doi.org/10.1109/CSO.2012.116In this paper we develop a novel bottleneck model which assumes that the capacity of the bottleneck is stochastic and follows uniform distribution. Commuters form a heterogeneous population with distinctive requirements on the probability of punctual ...
- 0Citation
MetricsTotal Citations0
- Article
A Bi-level Programming Model for Network Traffic Surveillance of Optimal Camera Location
CSO '11: Proceedings of the 2011 Fourth International Joint Conference on Computational Sciences and Optimization•April 2011, pp 1035-1039• https://doi.org/10.1109/CSO.2011.19Cameras enable synthesis of disaggregated vehicle information from multiple locations. This paper addresses the problem of how to determine the optimal locations of cameras for best traffic surveillance in urban road networks. All users are divided into ...
- 0Citation
MetricsTotal Citations0
- article
Novel travel cost functions based on morning peak commuting equilibrium
- Qiong Tian
School of Economics and Management, Beijing University of Aeronautics and Astronautics, Beijing, China
, - Hai Yang
Department of Civil and Environmental Engineering, The Hong Kong University of Science and Technology, Hong Kong, China
, - Hai-Jun Huang
School of Economics and Management, Beijing University of Aeronautics and Astronautics, Beijing, China
Operations Research Letters, Volume 38, Issue 3•May, 2010, pp 195-200 • https://doi.org/10.1016/j.orl.2010.02.003This paper derives two novel travel cost functions by formulating a morning commuting equilibrium model that incorporates traffic congestion based on fundamental traffic flow diagram. The travel cost functions have components to represent traversal cost,...
- 0Citation
MetricsTotal Citations0
- Qiong Tian
- Article
A Spatial Model Based on Dynamic Rail Commuter Equilibrium in a Monocentric City
NISS '09: Proceedings of the 2009 International Conference on New Trends in Information and Service Science•June 2009, pp 1176-1179• https://doi.org/10.1109/NISS.2009.97This paper presents a spatial model of rail commuter congestion in a monocentric city to investigate the congestion level on each location along the rail line. A dynamic rail commuter model is formulated to capture the variable crowding environment ...
- 0Citation
MetricsTotal Citations0
- Article
Modeling Time-Dependent Travel Choice Problems in a Mixed-Mode Network with Park-and-Ride Facilities
CSO '09: Proceedings of the 2009 International Joint Conference on Computational Sciences and Optimization - Volume 02•April 2009, pp 119-123• https://doi.org/10.1109/CSO.2009.316This paper proposes a time-dependent network equilibrium model in a mixed-mode network with P&R facilities to investigate the effects on travelers' choice of time-varying price of the P&R. An equivalent variational inequality (VI) problem is formulated ...
- 0Citation
MetricsTotal Citations0
- Article
Dynamic User Equilibrium in the Morning Peak Period
ICICTA '08: Proceedings of the 2008 International Conference on Intelligent Computation Technology and Automation - Volume 02•October 2008, pp 353-357• https://doi.org/10.1109/ICICTA.2008.137This paper formulates a dynamic user equilibria model that incorporates the traffic congestion based on the flow-density fundamental diagram. By using Greenshield’s speed-density relationship, we derive the analytical solution, which is different with ...
- 0Citation
MetricsTotal Citations0
- Article
A Cell Transmission Model and Its Application in Optimizing the Location of Variable Message Signs
- Hua-Yan Shang
Beijing University of Aeronautics and Astronautics, China
, - Hai-Jun Huang
Beijing University of Aeronautics and Astronautics, China
ICNC '07: Proceedings of the Third International Conference on Natural Computation - Volume 04•August 2007, pp 75-79• https://doi.org/10.1109/ICNC.2007.7The variable message signs (VMS) have been widely used in guiding and managing the dynamic traffic with development of intelligent transportation technologies. This paper employs a cell transmission model to study the location problem of VMS information ...
- 0Citation
MetricsTotal Citations0
- Hua-Yan Shang
- Article
Multi-agent Simulation on Day-to-Day Route Choice Behavior
- Tian-Liang Liu
Beijing University of Aeronautics and Astronautics, China
, - Hai-Jun Huang
Beijing University of Aeronautics and Astronautics, China
ICNC '07: Proceedings of the Third International Conference on Natural Computation - Volume 05•August 2007, pp 492-498• https://doi.org/10.1109/ICNC.2007.483The day-to-day route choice is a non-cooperative game process with many participants during a long time period. The multi-agent simulation system SeSAm is used to investigate two different route update rules designed for traffic information release and ...
- 0Citation
MetricsTotal Citations0
- Tian-Liang Liu
- Article
Fixed-Point model and schedule reliability of morning commuting in stochastic and time-dependent transport networks
- Zhi-Chun Li
School of Economics and Management, Beijing University of Aeronautics and Astronautics, Beijing, China
, - Hai-Jun Huang
School of Economics and Management, Beijing University of Aeronautics and Astronautics, Beijing, China
WINE'05: Proceedings of the First international conference on Internet and Network Economics•December 2005, pp 777-787• https://doi.org/10.1007/11600930_78This paper presents a fixed-point model for studying the morning commuting behavior in stochastic and time-dependent transport networks. The model considers the network uncertainty caused by supply and demand variations as well as the commuters’ ...
- 0Citation
MetricsTotal Citations0
- Zhi-Chun Li
- Article
An equilibrium model in urban transit riding and fare polices
- Hai-Jun Huang
School of Economics and Management, Beijing University of Aeronautics and Astronautics, Beijing, China
, - Qiong Tian
School of Economics and Management, Beijing University of Aeronautics and Astronautics, Beijing, China
, - Zi-You Gao
School of Traffic and Transportation, Beijing Jiaotong University, Beijing, China
AAIM'05: Proceedings of the First international conference on Algorithmic Applications in Management•June 2005, pp 112-121• https://doi.org/10.1007/11496199_14This paper deals with the riding behavior of commuters who take trains from a living place to a work place during morning rush hours. The total travel cost include early and late arrival penalties as well as carriage body capacity. An equivalent ...
- 0Citation
MetricsTotal Citations0
- Hai-Jun Huang
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