Skip navigation

DSpace

機構典藏 DSpace 系統致力於保存各式數位資料(如:文字、圖片、PDF)並使其易於取用。

點此認識 DSpace
DSpace logo
English
中文
  • 瀏覽論文
    • 校院系所
    • 出版年
    • 作者
    • 標題
    • 關鍵字
    • 指導教授
  • 搜尋 TDR
  • 授權 Q&A
    • 我的頁面
    • 接受 E-mail 通知
    • 編輯個人資料
  1. NTU Theses and Dissertations Repository
  2. 工學院
  3. 工業工程學研究所
請用此 Handle URI 來引用此文件: http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/27801
完整後設資料紀錄
DC 欄位值語言
dc.contributor.advisor范治民(Chih-Min Fan)
dc.contributor.authorPei-Jui Laien
dc.contributor.author賴佩瑞zh_TW
dc.date.accessioned2021-06-12T18:21:20Z-
dc.date.available2008-09-03
dc.date.copyright2007-09-03
dc.date.issued2007
dc.date.submitted2007-08-22
dc.identifier.citation1. IBM. 以服務為中心的企業整合.
2. Zimmermann, Olaf, Pal Krogdahl, and Clive Gee. Elements of Service-Oriented Analysis and Design (An interdisciplinary modeling approach for SOA projects). 2004.
3. IBM. Service-oriented modeling and architecture. 2004.
4. Fu, Shih-Hao, Robust Test for Stepwise Selection, in GIIE. 2003, NTU.
5. Ho, Tsui-Ju, Sample-Efficient Regression Tree for Binary and Ordinal Attributes and Continuous Target. 2003, NTU.
6. Lin, Chia Lung, Robust Test for Batch-to-Batch Variable Selection, in GIIE. 2004, NTU.
7. Lau, Chao Wen, Enhanced sample-efficient regression trees with MaxF selection criterion and attribute combination selection, in GIIE. 2004, NTU.
8. Hung, Yi- Hsi, Sample-efficient regression trees for attributes with mixed continuous and discrete effects : a piecewise-linear regression tree, in GIIE. 2005, NTU.
9. Kleinbaum, David G., Lawrence L. Kupper, and Keith E. Muller, Applied Regression Analysis and Other Multivariable Methods. 1988.
10. Hsu, Shie-Jay, Design and Implementation of An Enabling Mechanism for Effective Yield Analysis Procedure. 2007, National Taiwan University.
11. The New Encyclopedia Britannica.
12. wikipedia.
13. Flury, Bernhard and Hans Riedwyl, Multivariate Statistics A Practical Approach. 1988.
14. Su, Yea-Huey, Virtual Fab Service Provision: Enabling Framework and Dynamic Service Provision Mechanism, in Graduate Institute of Business Administration. 2003, National Taiwan University.
15. Tanenbaum, Andrew S., Computer networks 3rd ed. 1996: Prentice Hall PTR.
16. Booch, Grady, James Rumbaugh, and Ivar Jacobson, The Unified Modeling Language User Guide. 1999: Addison Wesley.
17. Gamma, Erich, Richard Helm, Ralph Johnson, and John Vlissides, Design Patterns. 1995.
18. Booch, Grady, Object-oriented analysis and design with applications. 1994.
dc.identifier.urihttp://tdr.lib.ntu.edu.tw/jspui/handle/123456789/27801-
dc.description.abstractMost algorithms are evolved from a lot of modifications and improvements to become more precise. If we can decompose the essential of an algorithm and realize the reusability and expansibility, it would be possible to accelerate the algorithm’s improvement, reduce the complexity when programming, cut down the maintenance and decrease the possibility to re-program the code.
Aiming at this objective, we select the variable selection algorithm as the problem conveyer. There are a lot of possible modifications and significances in the variable selection process. We want to drill through the individual algorithm instead of combination of algorithms. We also want to overcome the challenge to minimize the IT effort and achieve several design goals, such as (G1) reusable component, (G2) flexible configuration and (G3) analyzable data abstraction.
This research aims at developing an algorithm reengineering methodology. The purpose is to provide a mechanism for effective algorithm evolutions, where the inputs are (I1) what to change and (I2) what to change to, while the outputs are (O1) where to change and (O2) how to change. The mechanism is based on the object-oriented analysis and design, a four-stage methodology is proposed for the effective algorithm evolutions: (S1) domain-independent module abstraction, (S2) domain-dependent function decomposition, (S3) objects extraction and configuration, and (S4) strategy design and derivation for effective algorithm evolutions. Finally, we design several generations to demonstrate and validate the proposed reengineering methodology for effective algorithm evolutions.
en
dc.description.provenanceMade available in DSpace on 2021-06-12T18:21:20Z (GMT). No. of bitstreams: 1
ntu-96-R94546015-1.pdf: 1456707 bytes, checksum: cffc20a96fb84d66cc9c088c567ef9f4 (MD5)
Previous issue date: 2007
en
dc.description.tableofcontentsAcknowledgement i
Abstract ii
Contents iii
Contents of Figures v
Contents of Tables vi
Chapter 1 Introduction 1
1.1 Motivation 1
1.2 Conveyer Problem 3
1.3 Research Scope and Methodology 7
Chapter 2 Domain-independent Module Derivation 9
2.1 Fundamental elements of an algorithm 9
2.2 Data Perspective 12
2.2.1 Data Module 12
2.2.2 Parameter Module 13
2.3 Procedure Perspective 14
2.3.1 Math Module 16
2.3.2 Logic Module 16
Chapter 3 Domain-dependent Function Decomposition 18
3.1 Flow Chart Introduction 18
3.2 Flow Decomposition Example 19
3.3 Flow Decomposition Process 21
Chapter 4 Object Derivation by Mapping Functions-Modules 26
4.1 Information technique for enabling algorithm configuration 26
4.1.1 Layered Architecture 26
4.1.2 Object-oriented Methodology 27
4.1.3 Strategy Design Pattern 28
4.2 Match Function Flow and Modules 29
4.3 Object Derivation 32
4.4 Match Function Flow and Objects 38
4.5 Data Module Discussion 42
Chapter 5 Strategy Derivation for Effective Algorithm Evolution 46
5.1 Effective algorithm evolution 46
5.2 Design of generations 47
5.2.1 Generation 1: Forward Selection 48
5.2.2 Generation 2: Backward Elimination 53
5.2.3 Generation 3: Stepwise Selection 64
5.2.4 Generation 4: Robust Stepwise Selection 69
5.3 Summary of generations 78
Chapter 6 Conclusions 81
6.1 Conclusions 81
6.2 Future Research 81
dc.language.isoen
dc.subjecteffective algorithm evolutionen
dc.subjectalgorithm reengineering methodologyen
dc.subjectvariable selection processen
dc.subjectobject-oriented analysis and designen
dc.title以物件導向為基之演算法再造工程與其在變數篩選過程之應用zh_TW
dc.titleAn Object-Oriented Algorithm Reengineering Methodology and Its Application to Variable Selection Processen
dc.typeThesis
dc.date.schoolyear95-2
dc.description.degree碩士
dc.contributor.coadvisor陳正剛(Argon Chen)
dc.contributor.oralexamcommittee楊烽正(Feng-Cheng Yang),蔡雅蓉(Ya-Jung Tsai)
dc.subject.keyword演算法再造工程,物件導向,變數篩選,zh_TW
dc.subject.keywordalgorithm reengineering methodology,object-oriented analysis and design,variable selection process,effective algorithm evolution,en
dc.relation.page82
dc.rights.note有償授權
dc.date.accepted2007-08-22
dc.contributor.author-college工學院zh_TW
dc.contributor.author-dept工業工程學研究所zh_TW
顯示於系所單位:工業工程學研究所

文件中的檔案:
檔案 大小格式 
ntu-96-1.pdf
  未授權公開取用
1.42 MBAdobe PDF
顯示文件簡單紀錄


系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。

社群連結
聯絡資訊
10617臺北市大安區羅斯福路四段1號
No.1 Sec.4, Roosevelt Rd., Taipei, Taiwan, R.O.C. 106
Tel: (02)33662353
Email: ntuetds@ntu.edu.tw
意見箱
相關連結
館藏目錄
國內圖書館整合查詢 MetaCat
臺大學術典藏 NTU Scholars
臺大圖書館數位典藏館
本站聲明
© NTU Library All Rights Reserved