DOI
stands for Digital Object Identifier
(
D
igital
O
bject
I
dentifier
)
,
and is the unique identifier for objects on the internet. It can be used to create persistent link and to cite articles.
Using DOI as a persistent link
To create a persistent link, add「http://dx.doi.org/」
「
http://dx.doi.org/
」
before a DOI.
For instance, if the DOI of an article is
10.5297/ser.1201.002
, you can link persistently to the article by entering the following link in your browser:
http://dx.doi.org/
10.5297/ser.1201.002
。
The DOI link will always direct you to the most updated article page no matter how the publisher changes the document's position, avoiding errors when engaging in important research.
Cite a document with DOI
When citing references, you should also cite the DOI if the article has one. If your citation guideline does not include DOIs, you may cite the DOI link.
DOIs allow accurate citations, improve academic contents connections, and allow users to gain better experience across different platforms. Currently, there are more than 70 million DOIs registered for academic contents. If you want to understand more about DOI, please visit airiti DOI Registration ( doi.airiti.com ) 。
Large-Scale Pedestrian Simulation and Its Application on Disaster Evacuation
康家瑜 , Masters Advisor:朱致遠
繁體中文
DOI:
10.6342/NTU201803960
水庫潰壩 ; 大尺度行人疏散 ; 地面場細胞自動機模式 ; 路網模式 ; 時空網路 ; 依時性最短路徑演算法 ; large-scale ; pedestrian simulation ; dam breaking ; floor field cellular automata ; network model ; time-space network ; time-dependent shortest path


- Blue, V.J., Adler, J.L., 1998. Emergent fundamental pedestrian flows from cellular automata microsimulation. Transportation Research Record 1644, 29–36.
- Blue, V.J., Adler, J.L., 2001. Cellular automata microsimulation for modeling bi-directional pedestrian walkways. Transportation Research Part B: Methodological 35, 293–312.
- Burstedde, C., Klauck, K., Schadschneider, A. & Zittartz, J., 2001. Simulation of pedestrian dynamics using a two-dimensional cellular automaton, Physica A, 295, 507–
- 25.
- Chabini, I., 1998. Discrete dynamic shortest path problems in transportation applications: complexity and algorithms with optimal run time. Transportation Research Record 1645, 170–175.