Please use this identifier to cite or link to this item:
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/64935
Title: | 以區域群集為基礎之自動機視覺化設計 Visualizing Automata Using Local Clustering |
Authors: | Hong-Yi Ruo 羅鴻毅 |
Advisor: | 顏嗣鈞 |
Keyword: | 加權自動機,圖形佈置,群集, weighted automata,graph layout,clustering, |
Publication Year : | 2012 |
Degree: | 碩士 |
Abstract: | 自動機的概念及其應用,可以用來建立多樣的數學模型,舉例而言,決定性的有限自動機、非決定性的有限自動機,以及加權式自動機等等重要的研究領域。以加權式自動機來說,透過給予其邊上不同的權重和定義特殊的運算,它被證實在不同的領域上,包含語音辦識(speech recognition),模型驗證(model checking),圖像辦認(pattern recognition),自然語言處理(natural language processing)及數位影像壓縮(digital image compression)都有些成功的應用。也因為被發展出這許多的應用,以及後來更多的定理和理論基礎被證實,自動機一直以來在電腦科學中總是一個重要的領域。
在此篇論文中,我們將結合圖形佈置(graph layout),群集(clustering)和加權自動機等領域,以視覺化的方式在區域位置加強加權自動機的特徵,讓使用者在建立模型的過程,能更快的對其特徵進行處理。 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. |
URI: | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/64935 |
Fulltext Rights: | 有償授權 |
Appears in Collections: | 電機工程學系 |
Files in This Item:
File | Size | Format | |
---|---|---|---|
ntu-101-1.pdf Restricted Access | 1.41 MB | Adobe PDF |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.