學習資訊專業學院—資訊教育研究所

Permanent URI for this communityhttp://rportal.lib.ntnu.edu.tw/handle/20.500.12235/25

資訊教育研究所之碩士班成立於民國80年,博士班成立於民國86年,目前研究生共約160名。本所原屬資訊教育學系,於95學年度起因應系所組織調整,成為獨立研究所,歸屬教育學院。

本所以『資訊科技教育』和『數位學習』兩個專業領域之研究發展與人才培育為宗旨,課程設計分別針對此兩個專業領域規劃必、選修專業科目,提供學生紮實而嚴謹的學術專業知能及個別化之研究訓練。本所教育目標包括:

1、培育資訊科技教育人才;
2、培育數位學習產業人才;
3、培育資訊科技教育與數位學習研究人才。

本所目前六名專任教師,四位教授,二位副教授,在資訊教育領域均具有豐富之教學與研究經驗且均積極從事研究,每年獲科技部補助研究計畫之平均數量與金額在本校名列前茅。另外,本所教師積極參與國內重大資訊教育政策及課程綱要之制定,積極推動國內資訊教育之發展。
 

Browse

Search Results

Now showing 1 - 2 of 2
  • Item
    Constrained via minimization with practical considerations for multi-layer VLSI/PCB routing problems
    (1991-03-01) Fang, Sung-Chuan; Chang, Kuo-En; Feng, Wu-Shiung; Chen, Sao-Jie
  • Item
    Constrained via minimization for three-layer routing
    (Elsevier, 1989-07-01) Chang, K. E.; Jyu, H. F.; Feng, W. S.
    The previous constrained via minimization problem for VLSI previous three-layer routing is the problem of deining which previous layers can be used for previous routing the wire segments in the interconnections of nets so that the number of previous vias is minimized. This problem has been shown to be NP-complete15. In this paper, this problem is first transformed to the contractibility problem of a previous three -colourable graph, then an heuristic algorithm is proposed on the basis of the graph contractability model. From experimental results, the algorithm proves faster and more efficient at generating very good results. For a typical case, the number of previous vias can be reduced by about 30%.