Browsing by Issue Date, starting with "2008-04-03"

Now showing 1 - 20 of 55747

Intelligent classification system of sound signals and method thereof
(2008-04-03)
Bai, Mingsian R.
;
Chen, Meng-Chun
A system that integrates various intelligent classification techniques and preprocessing algorithms is provided. A feature extracting unit receives audio signals and extracts audio features for identification by using various descriptors; a preprocessing unit normalized the data for data consistency; a classification unit classifying audio signals into several categories according to the audio features.
Multidimensional scaling for large genomic data sets
(2008-04-04)
Tzeng, Jengnan
;
Lu, Henry Horng-Shing
;
Li, Wen-Hsiung
;
統計學研究所
;
Institute of Statistics
Background: Multi-dimensional scaling (MDS) is aimed to represent high dimensional data in a low dimensional space with preservation of the similarities between data points. This reduction in dimensionality is crucial for analyzing and revealing the genuine structure hidden in the data. For noisy data, dimension reduction can effectively reduce the effect of noise on the embedded structure. For large data set, dimension reduction can effectively reduce information retrieval complexity. Thus, MDS techniques are used in many applications of data mining and gene network research. However, although there have been a number of studies that applied MDS techniques to genomics research, the number of analyzed data points was restricted by the high computational complexity of MDS. In general, a non-metric MDS method is faster than a metric MDS, but it does not preserve the true relationships. The computational complexity of most metric MDS methods is over O(N(2)), so that it is difficult to process a data set of a large number of genes N, such as in the case of whole genome microarray data. Results: We developed a new rapid metric MDS method with a low computational complexity, making metric MDS applicable for large data sets. Computer simulation showed that the new method of split-and-combine MDS (SC-MDS) is fast, accurate and efficient. Our empirical studies using microarray data on the yeast cell cycle showed that the performance of K-means in the reduced dimensional space is similar to or slightly better than that of K-means in the original space, but about three times faster to obtain the clustering results. Our clustering results using SC-MDS are more stable than those in the original space. Hence, the proposed SC-MDS is useful for analyzing whole genome data. Conclusion: Our new method reduces the computational complexity from O(N(3)) to O(N) when the dimension of the feature space is far less than the number of genes N, and it successfully reconstructs the low dimensional representation as does the classical MDS. Its performance depends on the grouping method and the minimal number of the intersection points between groups. Feasible methods for grouping methods are suggested; each group must contain both neighboring and far apart data points. Our method can represent high dimensional large data set in a low dimensional space not only efficiently but also effectively.
PMSE 226-Synthesis and characteristics of hydrogen-bonding supramolecules composed of octaphenol-functionalized polyhedral oligomeric silsesquioxane
(2008-04-06)
Lu, Chu-Hua, Jr.
;
Huang, Chih-Feng
;
Chang, Feng-Chih
;
應用化學系
;
Department of Applied Chemistry
《權力風暴》戰爭的三角辯證
(2008-04-06)
陳濡群
;
Department of Communication and Technology
;
傳播與科技學系
關於美國與阿富汗的緊張關係
販售親情《紀子，出租中》
(2008-04-06)
陳貞儒
;
Department of Communication and Technology
;
傳播與科技學系
影評
七年沉寂　X-Japan再復出
(2008-04-06)
蔡昇峰
;
Department of Communication and Technology
;
傳播與科技學系
睽違十年，日本元老級視覺系搖滾樂團X-JAPAN終於不負歌迷眾望，在2007年重組復出，並於今年初在東京巨蛋展開連續三個晚上的復出演唱會。以《攻擊再開2008、面向毀滅》為主題，表示雖然吉他手HIDE已經過世，過去的X-JAPAN也已不再，但同時也在此時此刻新生，用新的面貌面對歌迷。演唱會的最後一天，X-JAPAN成員和現場五萬位歌迷一起紀念已逝的HIDE，為演唱會劃下感動的句點。
PHYS 689-Rovibronic bands of the A(2)B(2) <- X(2)B(1) transition of C(6)H(5)O and C(6)D(5)O detected with cavity ringdown absorption near 1.15-1.32 mu m
(2008-04-06)
Cheng, Chi-Wen
;
Witek, Henryk
;
Lee, Yuan-Pern
;
應用化學系
;
應用化學系分子科學碩博班
FUEL 133-Investigation into sulfur poisoning processes in Ni-based catalysts using quantum-chemical computations
(2008-04-06)
Wang, J. H.
;
Lin, M. C.
;
Liu, M.
;
應用化學系
;
應用化學系分子科學碩博班
總編輯的話
(2008-04-06)
黃夙蓮
;
Department of Communication and Technology
;
傳播與科技學系
總編輯的話
BIOL 68-Identification, functional expression and kinetic characterization of two GDP-L-fucose biosynthetic enzymes from Ganoderma lucidum
(2008-04-06)
Chiu, Hsien-Tai
;
Wu, Chih Chien
;
Deng, Shi-Jie
;
Huang, Pei-Ning
;
生物科技學系
精打細算　日本省省玩
(2008-04-06)
薛怡凡
;
Department of Communication and Technology
;
傳播與科技學系
跟團的老套行程已經落伍了，兩名大學男生自己安排行程、規劃路線，拎起行李就去日本東京自助旅行，他們不僅玩得自在，連荷包也省下不少！
總統大選選後大評比
(2008-04-06)
楊宇軒
;
Department of Communication and Technology
;
傳播與科技學系
總統大選FLASH
CARB 83-In vitro enzymatic generation of GDP-L-fucose and GDP-D-rhamnose by GDP-D-mannose 4,6-dehydratase and GDP-L-fucose synthetase from medicinal fungus Ling-Zhi
(2008-04-06)
Chiu, Hsien-Tai
;
Deng, Shi-Jie
;
Wu, Chih Chien
;
生物科技學系
;
Department of Biological Science and Technology
第一廣場　落寞的異國風情
(2008-04-06)
陳惠玟
;
Department of Communication and Technology
;
傳播與科技學系
第一廣場外勞的新天地
PHYS 689-Rovibronic bands of the A(2)B(2) <- (XB1)-B-2 transition of C6H5O and C6D5O detected with cavity ringdown absorption near 1.15-1.32 mu m
(2008-04-06)
Cheng, Chi-Wen
;
Witek, Henryk
;
Lee, Yuan-Pern
;
應用化學系
;
應用化學系分子科學碩博班
《風格的技術》創意時代來臨
(2008-04-06)
姜建亨
;
Department of Communication and Technology
;
傳播與科技學系
隨著時代演變，科技越來越發達，人們的觀念已經不如從前那樣傳統與保守，進而轉變為求新、求變，並追求創意的時代。從現在蔚為風潮，且不定期出現在誠品書局敦南店周遭、西門町等地的「創意市集」就能夠看出，「創意」已經成為現代生活中不可或缺的元素之一。
水蜜桃阿嬤的泰崗部落
(2008-04-06)
張雅雯
;
Department of Communication and Technology
;
傳播與科技學系
尖石後山的部落經濟與教育問題。
On spanning connected graphs
(2008-04-06)
Lin, Cheng-Kuan
;
Huang, Hua-Min
;
Tan, Jimmy J. M.
;
Hsu, Lih-Hsing
;
資訊工程學系
A k-container C(u, v) of G between u and v is a set of k internally disjoint paths between u and v. A k-container C(u, v) of G is a k*-container if the set of the vertices of all the paths in C(u, v) contains all the vertices of G. A graph G is k*-connected if there exists a k*-container between any two distinct vertices. Therefore, a graph is 1*-connected (respectively, 2*-connected) if and only if it is hamiltonian connected (respectively, hamiltonian). In this paper, a classical theorem of Ore, providing sufficient conditional for a graph to be hamiltonian (respectively, hamiltonian connected), is generalized to k*-connected graphs. (c) 2007 Published by Elsevier B.V.
勇敢面對《明日的喜多善男》
(2008-04-06)
賴奕如
;
Department of Communication and Technology
;
傳播與科技學系
命運不順遂的喜多善男，決定在十一天後結束自己的生命。但是奇蹟卻逐漸在他身旁出現…
鬥志、堅持　釀造出奧運金牌
(2008-04-06)
郭品君
;
Department of Communication and Technology
;
傳播與科技學系
奧運的由來與金牌選手的故事