臺灣博碩士論文加值系統

我們的研究目的是把一個複雜的運算，把它切割成較小的運算來做處理，而較小的運算間再各自交給自己的處理器來做處理，如此可以免去單一運算所需耗費的冗長的時間，而我們則是採取動態壓縮的演算法來面對我們傳輸所遇到的問題，此種演算法有隨壓隨解的性質，可以先把解壓縮過後的資料來拿先做處理，可以省去較多時間。

而我們還採取了網路傳輸的一些觀念，模擬多核心的架構，我們運用了3~5台的電腦來實做我們的系統架構，來達到我們的實驗需求，已獲得合理且有效的實驗數據。

Our aim is to a complex operation, it cut less computation to do processing, and smaller operations in their respective rooms to deal with their own processor to do so without having a single operator can spend the necessary the long time, and we are taking the dynamic compression algorithms to transmit the face of our problems, this algorithm has properties of solutions with the pressure as can be first to come and collect the data after decompression do first processing, can save more time.
And we have also taken some ideas network transmission, analog multi-core architecture, we use the computer at 3 to 5 we implement our system architecture, to achieve our experimental needs, has been given a reasonable and effective experimental data

中文摘要 ……………………………………………………………………………ii
英文摘要 ……………………………………………………………………………iii
致謝 …………………………………………………………………………………iv
目錄 …………………………………………………………………………………v
第一章 緒論 ……………………………………………………………………1
1.1簡介…………………………………………………………………………1
1.2論文架構……………………………………………………………………1
第二章 背景與理論基礎…………………………………………………………2
2.1 前言………………………………………………………………………2
2.2 平行計算…………………………………………………………………3
2.3 Huffman演算法介紹………………………………………………5
2.4 FGK 演算法介紹………………………………………………………6
2.5 Gaussian filter 介紹……………………………………………………13
第三章 實作方法……………………………………………………………14
3.1 實驗簡介………………………………………………………………14
3.2 FGK演算法……………………………………………………………14
3.3 程式平行處理部分……………………………………………………20
3.4 檔案一切四和四合一部分……………………………………………22
3.5 網路傳輸部分…………………………………………………………23
3.6 即時動態壓縮影像系統總覽…………………………………………24


第四章 實驗結果分析…………………………………………………………25
4.1 實驗簡介………………………………………………………………25
4.2 實驗環境………………………………………………………………25
4.3 實驗結果………………………………………………………………26
第五章 結論與未來展望………………………………………………………38
參考文獻 ……………………………………………………………………………39

[1] R. G. GALLAGER. Variations on a theme by Huffman, IEEE Trans. Inform.
Theory IT-24 (1978). 668-674.

[2] D. E. KNUTH, Solution to problem E2307, Amer. Math. Monthly 79 (1972),
773-774.
[3] KNUTH, D. E. Dynamic Huffman coding. J. Algorithms 6 (1985), 163-180.
[4] VIITER, J. S. Dynamic Huffman Coding. ACM Trans. Math. Sojlw. Submitted
1986.
[5] VITTER, J. S. Design and analysis of dynamic Huffman codes. J. ACM 34, 4
(Oct. 1987),825-845.
[6] BENTLEY, J. L., SLEATOR, D. D., TARJAN, R. E., AND WEI, V. K. A locally
adaptive data compression scheme. Commun. ACM 29,4 (Apr. 1986), 320-330.
[7] ELIAS, P. Interval and recency-rank source coding: Two online adaptive
variable-length schemes.IEEE Trans. InJ Theory. To be published.
[8] FALLER, N. An adaptive system for data compression. In Record ofthe 7th
Asilomar Conference on Circuits, Systems, and Computers. 1913, pp. 593-591
[9]VIITER, J. S., AND CHEN, W. C. Design and Analysis of Coalesced Hashing.
Oxford UniversityPress, New York, 1987.
[10]D. E. KNUTH, Solution to problem E2307, Amer. Math. Monthly 79 (1972),
773-774.

[11]JEFFREY SCOTT VITTER “ALGORITHM 673 Dynamic Huffman Coding”
ACM Transactions on Mathematical Software, Vol. 15, No. 2, June 1989, Pages
158-167
[12] T.C. Bell，J.G. Cleary，and I.H. Witten，Text Compression，NJ: Prentice Hall，
1990
[13] Ross N. Williams “Adaptive Data Compression”
[ 14 ] http://en.wikipedia.org/wiki/Speedup
[ 15 ] https://computing.llnl.gov/tutorials/parallel_comp/