請用此 Handle URI 來引用此文件：
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/64935完整後設資料紀錄
| DC 欄位 | 值 | 語言 |
|---|---|---|
| dc.contributor.advisor | 顏嗣鈞 | |
| dc.contributor.author | Hong-Yi Ruo | en |
| dc.contributor.author | 羅鴻毅 | zh_TW |
| dc.date.accessioned | 2021-06-16T23:08:57Z | - |
| dc.date.available | 2022-08-27 | |
| dc.date.copyright | 2012-08-10 | |
| dc.date.issued | 2012 | |
| dc.date.submitted | 2012-08-03 | |
| dc.identifier.citation | REFERENCES
[1] M. Mohri, On some Applications of Finite-state Automata Theory to Natural Language Processing, J. Natural Language Eng. 2 (1996) 1-20. [2] Mohri, M., Pereira, F., & Riley, M. (2002). Weighted Finite-state Transducers in Speech Recognition. Computer Speech and Language, 16, 69–88. [3] Corinna Cortes, Patrick Haffner, Mehryar Mohri, A Machine Learning Framework For Spoken-Dialog Classification, Springer Handbook on Speech Processing and Speech Communication , 2008. [4] K. Culik, J. Kari, Image Compression using Weighted Finite Automata, Computer and Graphics 17 (1993) 305–313. [5] J. E. Hopcroft, J. D. Ullman, and R. Motwani. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading, MA, 2000. [6] M. Baur and U. Brandes, “Crossing Reduction in Circular Layouts”, Proc. Graph-Theoretic Concepts in Computer-Science (WG ’04), 332-343, 2004. [7] P. Eades and K. Sugiyama. How to draw a directed graph. Journal of Information Processing, 13(4):424–437, 1990. [8] K. Sugiyama, S. Tagawa, and M. Toda. Methods for visual understanding of hierarchical system structures. IEEE Transaction on Systems, Man, and Cybernetics, 11(2):109–125, February 1981. [9] Andreas Noack. An Energy Model for Visual Graph Clustering. In Proceedings of the 11th International Symposium on Graph Drawing (GD 2003), LNCS 2912, pages 425-436. c Springer-Verlag, 2004. [10] FRUCHTERMAN, T. M. J., REINGOLD, E. M. (1991): Graph Drawing by Force-Directed Placement. Software, Practice and Experience, 21, 1129-1164. [11] A. Noack. Modularity Clustering is Force-Directed Layout, Physical Review E, 79:026102, 2009. [12] D. P. Dobkin, E. R. Gansner, E. Koutsofios, and S. C.North. Implementing a general-purpose edge router. In Proceedings of the 5th International Symposium on Graph Drawing, pages 262–271. Springer-Verlag Berlin Heidelberg, 1997. [13] J. Dokulil and J. Katreniakova. Edge routing with fixed node positions. In IV ’08: Proceedings of the 2008 12th International Conference Information Visualisation, pages 626–631, Washington, DC, USA, 2008. IEEE Computer Society. [14] G. Di Battista, P. Eades, R. Tamassia, and I. Tollis. Graph Drawing: Algorithms for the Visualization of Graphs. Pearson 1998. [15] R. Fleischer and C. Hirsch. Graph Drawing and Its Applications. In Drawing Graphs: Methods and Models, Kaufmann and Wagner (Eds.) LNCS 2025, pp. 1-22. Springer 2001. [16] H. C. Purchase, E. Hoggan, and C. Gorg. How Important is the“Mental Map”? – An Empirical investigation of a Dynamic Graph Layout Algorithm. Proc. Graph Drawing (GD’06), LNCS 4372, pp. 262-273. Springer 2007. [17] H. C. Purchase and A. Samra. Extremes Are Better: Investigating Mental Map Preservation in Dynamic Graphs. Proc. Diagrammatic Representation and Inference (Diagrams’08), LNAI 5223, pp. 60-73. Springer 2008. [18] F. van Ham and B. Rogowitz. Perceptual Organization in User Generated Graph Layouts. IEEE Trans. on Visualization and Computer Graphics, 14(6): 1333-1339, 2008. [19] Dwyer T., Lee B., Fisher D., Quinn K. I., Isenberg P., Robertson G., NORTH C.: A comparison of user generated and automatic graph layouts. In IEEE Symposium on Information Visualization (2009). [20] Mehryar Mohri. 2009. Weighted automata algorithms. In Manfred Droste, Werner Kuich, and Heiko Vogler, editors, Handbook of Weighted Automata, chapter 6, pages 213–254. Springer-Verlag. [21] Jacques Sakarovitch. 2009. Rational and recognizable power series. In Handbook of Weighted Automata, chapter IV, pages 105–174. Springer. [22] C. D. Jones, A. B. Smith, and E.F. Roberts, Book Title, Publisher, Location, Date. [23] R. C. Gonzalez, R. E. Woods, Digital Image Processing second edition, Prentice Hall, 2002. [24] Alex Hamelin (2011, January). Networks [online]. Available: http://www.lrde.epita.fr/dload//20110119-Seminar/hamelin-vaucanson-2.0-internals.pdf. [25] “Vaucanson,” http://www.lrde.epita.fr/cgi-bin/twiki/view/Projects/Vaucanson. | |
| dc.identifier.uri | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/64935 | - |
| dc.description.abstract | 自動機的概念及其應用，可以用來建立多樣的數學模型，舉例而言，決定性的有限自動機、非決定性的有限自動機，以及加權式自動機等等重要的研究領域。以加權式自動機來說，透過給予其邊上不同的權重和定義特殊的運算，它被證實在不同的領域上，包含語音辦識(speech recognition)，模型驗證(model checking)，圖像辦認(pattern recognition)，自然語言處理(natural language processing)及數位影像壓縮(digital image compression)都有些成功的應用。也因為被發展出這許多的應用，以及後來更多的定理和理論基礎被證實，自動機一直以來在電腦科學中總是一個重要的領域。
在此篇論文中，我們將結合圖形佈置(graph layout)，群集(clustering)和加權自動機等領域，以視覺化的方式在區域位置加強加權自動機的特徵，讓使用者在建立模型的過程，能更快的對其特徵進行處理。 | zh_TW |
| dc.description.abstract | The concept and application of automata theory can develop variety of
mathematical models. For example, deterministic finite automata, non-deterministic finite automata and weighted automata models. Especially to be mentioned, weighted automata are one of the most important research fields. By assigning different of weights and their computations, it have been successful used in many applications such as speech recognition, model checking, pattern recognition, natural language-processing and digital image compression. The huge number of applications makes automata a very valuable research theories and topics. Therefore, it plays an important role in the field of computer science all the time. In this thesis, we will introduce an algorithm to emphasize the feature of an automaton at some local area in a way of visualization by combining the works of graph layout, clustering. To help the users process the feature part of the automata quickly when building the model of the automata. | en |
| dc.description.provenance | Made available in DSpace on 2021-06-16T23:08:57Z (GMT). No. of bitstreams: 1 ntu-101-R99921076-1.pdf: 1439457 bytes, checksum: de3f084d906cc32034adcd4f7252a12b (MD5) Previous issue date: 2012 | en |
| dc.description.tableofcontents | CONTENTS
口試委員會審定書 # 誌謝 i 中文摘要 ii ABSTRACT iii CONTENTS iv LIST OF FIGURES vi LIST OF TABLES ix Chapter 1 INTRODUCTION 1 Chapter 2 RELATED WORK 3 2.1 Weighted Automata 4 2.2 Basic Graph Layout 6 2.2.1 Circular layout: 7 2.2.2 Hierarchical layout: 7 2.2.3 Force-directed layout: 8 2.2.4 Tree layout: 9 2.3 Clustering 9 2.3.1 Barnes and Hut algorithm 10 2.3.2 LinLog energy model 11 2.4 Edge routing 12 2.5 User studies for graph layout 13 Chapter 3 FEATURE LAYOUT 16 3.1 Cycle Detector 17 3.2 Clustering using LinLog model 19 3.2.1 LinLog energy model 20 3.2.2 Separate the dissimilarity clusters 21 3.2.3 Combination heuristics 23 3.3 Feature Layout 25 3.3.1 Cycle detector feature layout 26 3.3.2 Clustering feature layout 27 3.4 Feature nodes rotation 30 3.5 Edge Routing 31 Chapter 4 EXPERIMENT 36 4.1 Develop environment- VAUCANSON graph interface 36 4.2 Clustering experiment 38 Chapter 5 Conclusion 50 REFERENCE 51 | |
| dc.language.iso | en | |
| dc.subject | 加權自動機 | zh_TW |
| dc.subject | 群集 | zh_TW |
| dc.subject | 圖形佈置 | zh_TW |
| dc.subject | weighted automata | en |
| dc.subject | graph layout | en |
| dc.subject | clustering | en |
| dc.title | 以區域群集為基礎之自動機視覺化設計 | zh_TW |
| dc.title | Visualizing Automata Using Local Clustering | en |
| dc.type | Thesis | |
| dc.date.schoolyear | 100-2 | |
| dc.description.degree | 碩士 | |
| dc.contributor.oralexamcommittee | 郭斯彥,雷欽隆,黃秋煌 | |
| dc.subject.keyword | 加權自動機,圖形佈置,群集, | zh_TW |
| dc.subject.keyword | weighted automata,graph layout,clustering, | en |
| dc.relation.page | 53 | |
| dc.rights.note | 有償授權 | |
| dc.date.accepted | 2012-08-06 | |
| dc.contributor.author-college | 電機資訊學院 | zh_TW |
| dc.contributor.author-dept | 電機工程學研究所 | zh_TW |
| 顯示於系所單位： | 電機工程學系 | |
文件中的檔案：
| 檔案 | 大小 | 格式 | |
|---|---|---|---|
| ntu-101-1.pdf 未授權公開取用 | 1.41 MB | Adobe PDF |
系統中的文件，除了特別指名其著作權條款之外，均受到著作權保護，並且保留所有的權利。