Browsing by Issue Date, starting with "2009-01-04"
Now showing 1 - 20 of 51623
- Results Per Page
- Sort Options
Item type:Item, Item type:Item, Item type:Item, Item type:Item, Item type:Item, Item type:Item, Item type:Item, Item type:Item, Item type:Item, 第四十期總編輯的話(2009-01-04) ;吳佳玲 ;Department of Communication and Technology傳播與科技學系距離本學期完成電子報大工程已倒數兩週,面對如此壓力的同學們也早已輕鬆不少,而最令人感動的莫過於全體同學們其攜手度過抗戰的歲月,我們越堅強也越進步,身為總編的我非常期望這次大家辛苦創作的結晶!Item type:Item, Item type:Item, 《大象的眼淚》(2009-01-04) ;林麗珊 ;Department of Communication and Technology傳播與科技學系「我明白守祕密有多重要、多困難,而我也守住了,直到故事的主角永遠地離開後,我仍繼續保守祕密。」《大象的眼淚》讓讀者一直帶著疑問去展開這場生命的冒險之旅,而謎底將會在旅程結束前公開。Item type:Item, 男人型不型 風潮怎麼吹(2009-01-04) ;邵奕儒 ;Department of Communication and Technology傳播與科技學系近年來男人也拿起化妝用品修飾自己,究竟是什麼樣的社會文化氛圍,讓這現象成為風潮趨勢呢?Item type:Item, Item type:Item, Item type:Item, Item type:Item, 與時代同時進化的東京事變(2009-01-04) ;楊純芳 ;Department of Communication and Technology傳播與科技學系東京事變(Tokyo Incidents)是一個以椎名林檎為領導中心所組成的日本知名樂團,縱使如此,與椎名林檎一同合作的樂手們,他們各自閃耀、各自襯托,在舞台上,他們是閃亮的五顆星,迷人的演出溢於「音」表。Item type:Item, 《戀愛情結》長短腿之戀(2009-01-04) ;羅佩雯 ;Department of Communication and Technology傳播與科技學系經由十分通俗的少女漫畫橋段改編而成的電影,電影運用許多視覺特效, 整體內容呈現五彩繽紛的效果!是個有趣的愛情故事,過程十分精采,也給人帶來青春愛情力量!Item type:Item, 交大e-News第040期(2009-01-05) ;Secretariat國立交通大學秘書室Item type:Item, Self-calibrating high-speed analog-to-digital converter(2009-01-06) ;Su ;Chau-Chin ;Lu ;Hung-WenChiIn a precisely self-calibrating high-speed analog to digital converter the aspect ratios of tri-state inverters are adjusted to fine-tune threshold voltage as comparators. And the multiplexers composed of tri-state inverters amplify the signal from the output of comparators. Their switches of tri-state inverters may be properly controlled to select the optimal channels and reduce unnecessary power consumption. The calibration circuitry utilizes under-sampling to calculate the duty cycles of comparators, selecting the optimal comparators and channels. By the way, the invention may avoid process variation.Item type:Item, The minimum number of e-vertex-covers among hypergraphs with e edges of given ranks(2009-01-06) ;Chang, F. H. ;Fu, H. L. ;Hwang, F. K. ;Lin, B. C.應用數學系We study the problem that among all hypergraphs with e edges of ranks l(1), ..., l(e) an v vertices, which hypergraph has the least number of vertex-covers of size e. The problem is very difficult and we only get some partial answers. We show an application of our results to improve the error-tolerance of a pooling design proposed in the literature. (c) 2008 Elsevier B.V. All rights reserved.