|
English
|
正體中文
|
简体中文
|
总笔数 :2853537
|
|
造访人次 :
45255713
在线人数 :
1145
教育部委托研究计画 计画执行:国立台湾大学图书馆
|
|
|
显示项目 693941-693950 / 2346288 (共234629页)
<< < 69390 69391 69392 69393 69394 69395 69396 69397 69398 69399 > >>
每页显示[10|25|50]项目
| 國立臺灣大學 |
2003-12 |
Pronunciation variation analysis based on acoustic and phonemic distance measures with application examples on Mandarin Chinese
|
Tsai, Ming-Yi; Lee, Lin-Shan |
| 臺大學術典藏 |
2018-09-10T04:35:32Z |
Pronunciation Variation Analysis Based on Acoustic and Phonemic Distance Measures with Application Examples on Mandarin Chinese
|
Tsai, Ming-Yi; Lee, Lin-Shan; LIN-SHAN LEE |
| 亞洲大學 |
2013 |
Prony-Based Technique for Voltage Envelope Extraction and Estimation of Instantaneous Flicker Level
|
Anonymous |
| 亞洲大學 |
201304 |
Prony-based technique for voltage envelope extraction and estimation of instantaneous flicker level
|
陳正一;Chen, Cheng-I;陳永欽;CHEN, YEONG-CHIN;陳兆南;CHEN, CHAO-NAN |
| 國立政治大學 |
2016-07 |
Proof by model: a new knowledge-based reachability analysis methodology for Petri net
|
趙玉;季延平;游宗憲;游禮志;李耀中 |
| 國立臺灣大學 |
1993 |
Proof methods for reasoning about possibility and necessity
|
Liau, Churn Jung; Lin, Bertrand I-peng |
| 臺大學術典藏 |
2022-09-21T23:31:06Z |
Proof of a Conjecture About Minimum Spanning Tree Cycle Intersection
|
Chen, Min Jen; Chao, Kun Mao |
| 東海大學 |
1978-06-00 |
Proof of Beurling's Lemma
|
解萬臣 |
| 國立交通大學 |
2017-04-21T06:48:40Z |
PROOF OF HIDDEN NODE NUMBER AND EXPERIMENTS ON RBF NETWORK FOR WELL LOG DATA INVERSION
|
Huang, Kou-Yuan; Shen, Liang-Chi; You, Jiun-Der; Weng, Li-Sheng |
| 國立交通大學 |
2017-04-21T06:49:04Z |
Proof of Hidden Node Number in MLP and Experiments on Well Log Data Inversion
|
Huang, Kou-Yuan; Shen, Liang-Chi; You, Jiun-Der |
显示项目 693941-693950 / 2346288 (共234629页)
<< < 69390 69391 69392 69393 69394 69395 69396 69397 69398 69399 > >>
每页显示[10|25|50]项目
|
