Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Tzung-Ching Lin"'
Autor:
Shu Ya Pan, Chih-Lung Hung, Tzung-Ching Lin, Chao-Tien Hsu, Jiun-Han Yan, Yu-Jung Huang, Hui Li Wang, I-Yueh Fang, Wei-Cheng Lin, Te-Tsun Shen, Shao-I Chu
Blockchain is a new emerging technology of distributed databases, which guarantees the integrity, security and incorruptibility of data by means of the cryptography. Such features are suitable for secure and reliable data storage. This chapter invest
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::52b5ba93c211424ec709785d9fe88d36
https://doi.org/10.5772/intechopen.94370
https://doi.org/10.5772/intechopen.94370
Publikováno v:
IEEE Transactions on Computers. 65:1158-1164
Based on an error-flattened, non-uniform-region linear-approximation algorithm, this brief proposes a low-error and a cost-efficient design procedure for realizing an optimized shift-and-add Logarithmic Unit (LU), which uses minimum hardware to meet
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::481034c9e619c49e36a4223feae41c45
https://doi.org/10.1109/tc.2015.2441696
https://doi.org/10.1109/tc.2015.2441696
Autor:
Tzung-Ching Lin, 林宗慶
100
There are two parts in the thesis; the first part is the design of Intelligent Midnight Earthquake Alarm System with Self-Calibration Mechanism, which serves as warning signal when earthquake happens. First, the three-axis accelerometer is e
There are two parts in the thesis; the first part is the design of Intelligent Midnight Earthquake Alarm System with Self-Calibration Mechanism, which serves as warning signal when earthquake happens. First, the three-axis accelerometer is e
Externí odkaz:
http://ndltd.ncl.edu.tw/handle/qukypx
Autor:
Tzung-Ching Lin, 林宗慶
100
Bodlaender conjectured that the game chromatic number of planar graphs is bounded by a constant in the first place. It was proved by Kierstead and Trotter that the game chromatic number of planar graphs less than 33 by using the Four-Color T
Bodlaender conjectured that the game chromatic number of planar graphs is bounded by a constant in the first place. It was proved by Kierstead and Trotter that the game chromatic number of planar graphs less than 33 by using the Four-Color T
Externí odkaz:
http://ndltd.ncl.edu.tw/handle/95431329459118853388