stands for Digital Object Identifier
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/」
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 ） 。
-  Joshua Morse, Joshua Palay, Yarun Luon and Satyendra Nainwal, “CarLoop: Leveraging Common Ground to Develop Long-term Carpools,” Computer Human Interaction, pp. 2073-2078, 2007.
-  Jun Zhang, Nikos Mamoulis, Dimitris Papadias and Yufei Tao, “All-Nearest-Neighbors Queries in Spatial Databases,” International Conference on Scientific and Statistical Database Management, pp. 297-306, 2004.
-  Leong Hou U, Nikos Mamoulis and Man Lung Yiu, “Computation and Monitoring of Exclusive Closest Pairs,” IEEE Transactions on Knowledge and Data Engineering, pp. 1641 - 1654, 2008.
-  Manel Sghaier, Hayfa Zgaya, Slim Hammadi and Christian Tahon, “A Distributed Optimized Approach based on the Multi Agent Concept for the Implementation of a Real Time Carpooling Service with an Optimization Aspect on Siblings,” International Journal of Engineering, 2011.
-  Norbert Beckmann, Hans-Peter Kriegel, Ralf Schneider and Bernhard Seeger, “The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles,” Special Interest Group on Management of Data, pp. 322-331, 1990.
The cart has had several articles, so do you want to clear it, or add together to the cart?