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 ） 。
Data Source: Academic Citation Index (ACI)
As Taiwan's largest Citation Index, we currently have on record all Humanities, and Sociology journals that were published in Taiwan. The number of periodicals that are published on a regular basis total around 400 different types. If periodicals that were added to the collection but then halted are counted as well, the number of periodicals total over 500 types. Every year we announce the recorded periodicals' impact factor, etc. to the public, and allow scholars utilize our materials to carry out academic research for free.
Impact Factor: The statistic indicating the average number of times a journal's articles published in the past two years have been cited in the counting year.
Formula: (Number of cites in counting year to articles published in the span of two years ) ÷ (Number of articles published in the span of two years)
Example: The impact factor in 2010 (determined in 2011)
In 2009, Journal A published 15 articles, and these 15 articles were cited 20 times in 2010.
In 2008, Journal A published 16 articles, and these 16 articles were cited 30 times in 2010.
→ →2010's Impact Factor = (20+30) ÷ (15+16) = 1.61 =（20+30）÷（15+16）≒1.61
What is "Preprint"?
In order to provide readers the forefront academic information, after articles are accepted to publish in the journal, we publish them in network before they're printed. Those "on-line first articles" are called the "preprint articles". The preprint articles do not have volume No., page No., publication date, but can be identified by the DOI number. 「 http://dx.doi.org/ 」 Link to the latest version of the article.
How to cite Preprint Articles?
Please use the online publication date and the DOI number of the preprint article to cite the literature.
Cited example (may vary with different formats you cited):
Author name. Article name. Journal name. YYYY/MM/DD online publish in advance.
清華大學資訊工程學系所學位論文 ； 2015年 (2015 / 01 / 01) ， P1 - 238
英文 DOI： 10.6843/NTHU.2015.00379
圖形最佳化演算法 ； 支配集 ； 獨立支配集 ； 邊獨立集 ； 幾何展開演算法 ； 最小被鎖住的樹鏈結 ； $k$單調線性樹鏈結 ； Graph Optimization Algorithms ； Domination ； Independent Domination ； Edge-Independent Sets ； Geometric Unfolding Algorithms ； Minimal Locked Tree Linkages ； $k$-Monotone Linear Tree Linkages
-  J. Alber, M. R. Fellows, and R. Niedermeier. Polynomial-time data reduction for dominating set. Journal of the ACM, 51(3):363–384, 2004.
-  M. O. Albertson and K. L. Collins. Duality and perfection for edges in cliques. Journal of Combinatorial Theory, Series B, 36(3):298–309, 1984.
-  L. Alcón, L. Faria, C. M. H. de Figueiredo, and M. Gutierrez. The complexity of clique graph recognition. Theoretical Computer Science, 410(21–23):2072–2083, 2009.
-  P. Alimonti and T. Calamoneri. Improved approximations of independent dominating set in bounded degree graphs. In Proceedings of WG’96, pages 2–16, 1996.
-  N. Alon and S. Gutner. Linear time algorithms for finding a dominating set of fixed size in degenerated graphs. Algorithmica, 54(4):544–556, 2009.
The cart has had several articles, so do you want to clear it, or add together to the cart?