Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Ying-You Chen"'
Autor:
Ying-you Chen, 陳盈佑
100
Metrology has been the key to ensure the reliability of high volume manufacturing processes in the semiconductor foundry, including the measurements of the critical dimension (CD), the film thickness, the overlay, the wafer geometry, the sur
Metrology has been the key to ensure the reliability of high volume manufacturing processes in the semiconductor foundry, including the measurements of the critical dimension (CD), the film thickness, the overlay, the wafer geometry, the sur
Externí odkaz:
http://ndltd.ncl.edu.tw/handle/7weyb5
Autor:
Ying-You Chen, 陳映佑
96
The automobile after-sale market, having steady demand and less affected by economic prosperity, has already become one of the main profit-making sources of every motor corporation in recent years. The after-market scale of Taiwan has reached
The automobile after-sale market, having steady demand and less affected by economic prosperity, has already become one of the main profit-making sources of every motor corporation in recent years. The after-market scale of Taiwan has reached
Externí odkaz:
http://ndltd.ncl.edu.tw/handle/h9634b
Autor:
Ying-You Chen, 陳映攸
96
The (n, k)-star graph (Sn,k for short) is an attractive alternative to the hypercube and also a generalized version of the n-star (Sn for short). It is isomorphic to the n-star (n-complete, Kn for short) graph if k = n?{1 (k = 1). Jwo et al.
The (n, k)-star graph (Sn,k for short) is an attractive alternative to the hypercube and also a generalized version of the n-star (Sn for short). It is isomorphic to the n-star (n-complete, Kn for short) graph if k = n?{1 (k = 1). Jwo et al.
Externí odkaz:
http://ndltd.ncl.edu.tw/handle/61660786557524225859
Publikováno v:
Journal of Computational and Theoretical Nanoscience. 10:616-619
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7005a2c5c10d2206a0d6ecc80c6c8c97
https://doi.org/10.1166/jctn.2013.2743
https://doi.org/10.1166/jctn.2013.2743
Publikováno v:
Theoretical Computer Science. (1-3):191-199
The (n,k)-star graph (S"n","k for short) is an attractive alternative to the hypercube and also a generalized version of the n-star. It is isomorphic to the n-star (n-complete) graph if k=n-1 (k=1). Jwo et al. have already demonstrated in 1991 that a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::92fa4b25350e2babf45e22882f3c831f