跳到主要內容

臺灣博碩士論文加值系統

(216.73.216.66) 您好!臺灣時間:2026/08/15 04:52
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果 :::

詳目顯示

我願授權國圖
: 
twitterline
研究生:賴佩瑞
研究生(外文):Pei-Jui Lai
論文名稱:以物件導向為基之演算法再造工程與其在變數篩選過程之應用
論文名稱(外文):An Object-Oriented Algorithm Reengineering Methodology and Its Application to Variable Selection Process
指導教授:范治民
指導教授(外文):Chih-Min Fan
學位類別:碩士
校院名稱:國立臺灣大學
系所名稱:工業工程學研究所
學門:工程學門
學類:工業工程學類
論文種類:學術論文
論文出版年:2007
畢業學年度:95
語文別:英文
論文頁數:82
中文關鍵詞:演算法再造工程物件導向變數篩選
外文關鍵詞:algorithm reengineering methodologyobject-oriented analysis and designvariable selection processeffective algorithm evolution
相關次數:
  • 被引用被引用:0
  • 點閱點閱:171
  • 評分評分:
  • 下載下載:0
  • 收藏至我的研究室書目清單書目收藏:0
Most 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.
Acknowledgement 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
1.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.
QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top