Equtatetor-新一代智慧型數學處理器
此研究的目的是要設計出一套完整編輯顯現數學式、加以計算,並求出解的一套方法與成品。而這項工作的執行者,在此稱之Equatetor 。一般的數學式子,若要計算的話,普通的計算機是不足夠的。原因是它們沒有辦法表現出數學式的「原貌」,例如分號、指數、函數、根號等數學符號混在一起時的情況。於是,我便擬定了一個研究,希望設計出一套更方便且實用的方法。換句話說,我要設計出一個功能強大的工程計算機程式。其中,自然牽扯到數學式子的顯現方式(以MathML 實現),以及計算機科學的演算法及資料結構。我主要的目的有四:(1) 顯示數學式(2) 方便編輯數學式(3) 計算數學式(4) 處理可以以不同形式輸出解答的計算(如輸出分數、根號、函數解等)。研究結果中,成功地運用XML 中的MathML 與二分逼近分數等演算法及若干資料結構,達到了以下實用的幾點:(1) 結構化的數學式編輯(2) 完整地顯示數學式(3) 正確運算並輸出運算式的答案(4) 提供一般數學形式之解(非小數之解);The object of this study is to design a method and processor which is able to edit, display a mathematical expression representing a number, calculate and output the answer. The executor of this task is called Equatetor. Normal calculators are not adequate for this kind of task. The main reason is that they can’t reveal the original expression, such as fractions, radicals, exponents or mathematic functions. Therefore, a simple and convenient method is needed. To perform the possible way of handling those tasks, a computer program has been written. Several techniques were used, such as MathML, computing algorithms, data structures, and so on. Following are main purposes: (1) Displaying mathematical expressions. (2) Editing mathematical expressions simply. (3) Calculating mathematical expressions. (4) Outputting the answers(in different expressions). And the achievements:(1) Structured methods of editing of mathematical expressions. (2) Displaying mathematical expressions completely. (3) Calculating mathematical expressions precisely. (4) Offering answers in different expressions.
利用Google Maps 建立高中地理資訊系統
台灣通史「婆娑之洋,美麗之島」,身為台灣人,應知台灣事,本研究本維 基百科(Wikipedia)所揭示的「海納百川,有容乃大」精神,以Apache 網頁伺 服器為平台,MySQL 為資料庫,利用AJAX、PHP 網頁技術,並使用Google Maps 提供之服務,建立符合Web 2.0 精神的的b04地理資訊共享系統。在此系統下, 我們允許教師(編輯者)以合作方式上網提供與課程相關的地理資訊,並可進行資 訊修改或刪除,希望集合所有教師之力,提供給學生最豐富、最正確的b04地理 資訊系統。 In this paper, we propose a new map-based collaboration environment “MyGIS” for geographical information distribution. In MyGIS, the publishers/teachers can easily collaborate to annotate a spot with contents such as messages and links. The annotations of a spot are updated on the map in real-time which enables the receivers/students to correctly study at anywhere and anytime. To ensure the trustfulness of the content, the publishers are authenticated using login mechanism. In this study, several technologies inc lu ding Apache, PHP, MySQL, Ajax are involved. Finally, We implemented MyGIS on Google Maps and evaluated its feasibility and usefulness.
將錯就錯的knuth 河內塔
在這篇報告中,我們探索了「將錯就錯的Knuth 河內塔問題」。傳統河內塔問題在電腦科學上佔有重要的地位,是一個極具內涵的模型。由於這個模型的深厚數學內涵,使其和巴斯卡三角形建立了緊密的連結,且利用這個緊密的數學連結,設計出復原任意起始狀態的良好演算法。Knuth 河內塔起因於數學家Knuth 在論文[3]中,描述傳統的河內塔問題時所發生的一次筆誤。在這個新的規則之下,我們意外發現Knuth 河內塔存在著一個和傳統河內塔平行的模型,此模型在電腦科學及數學上有著完全不同於傳統河內塔的內涵。我們的研究主要如下:(分別為內文中的四大段)(一) 結構分析。移動環所需要的次數,如何移動環並分析每一次動作所動的環,及每個環何時被動到並給出演算法。(二) 正整數的分割。所有的移動步驟將正整數做了一個新的分割(Partition);此分割模k之後有良好的循環性質。(三) 費波那契真分數的排序。這個正整數的分割形成一張表,這張表恰好就是分子分母皆為費波那契真分數之排序。(四) 隨意亂排的Knuth 河內塔復原演算法。在Knuth 河內塔的規定下將起始狀態改變,找出良好的復原演算法,並分析。 In this project we study the "Knuth Hanoi Tower", which is motivated by a typo in a paper of Knuth. This inadvertently typo leads to a new rule of moving the discs on the Hanoi Tower (see introduction below for definition). Although seemingly similar to the traditional Hanoi-Tower problem, it turns out that under this rule the "Knuth Hanoi Tower" problem consists of amazing properties, and is totally different from the traditional one. Our study focuses on the following directions: (1) Structure analyzing: We analysis the sequences recording the disc moving and offer enumeration results and recurrsive/non-recurrsive algorithms. (2) Partition of N: The moving sequence forms a partition (a table) of N, which has an amazing congruence property. (3) The order of Fibonacci proper fraction: The row/column of the partition table is, even more amazing, exactly the order when sorting the Fibonacci proper fraction with fixed denominator/numerator. (4) The Restoration of an arbitrary initial state: We offer an efficient algorithm for restoring any initial state of discs. We hope that our study on the "Knuth Hanoi Tower" offers a simple, neat, and new example on the theory of Algorithm, Number theory and Combinatorics.
Computer Vision for Alternative Input Systems
In the fast-paced environment of a hospital intensive care unit (ICU), good doctor-patient communication is essential. However, medical conditions and devices often inhibit a patient’s ability to speak, write or type. Current assistive communication devices are either prohibitively expensive or cumbersome and time-consuming, creating a gap in communication during a patient’s first days in the ICU. This project applies computer vision to develop a low-cost software solution that bridges this gap by enabling patients to generate words with eye movements. In the system, a webcam acquires an image of the patient, and an image processing algorithm classifies patient’s gaze as pointing in one of eight directions. Each direction corresponds to an option on a graphical menu presented to the patient on the computer’s display. The patient can use the menu to select a preformed phrase from a list of common phrases. Patients desiring to express more complex ideas can type custom words using the menu as an ambiguous keyboard (similar to a phone keypad). In either case, the patient-generated text will be displayed on screen and read aloud through the computer’s audio system. The only hardware requirements are an existing computer and a $6 webcam. The program can process and respond to an image in 148ms. A new user can be trained in approximately 10 minutes, and after training can type a simple phrase such as “hello world” in 40 seconds. While further testing and improvement is required before the system will be ready for implementation, the project shows promise as a low-cost solution to ICU communication.
Digital Viedo Compression Enhancement With Reduced Psychovisual Redundancy
Video compression is indispensable to web streaming and memory storage.Most video\r compression technology has difficulty to achieve high quality video at lower bit\r rates.Apparently,limited transmission bandwidth and network resources often degrade\r video signals.Thus the goal of my research was to enhance video degrade video\r signals.Thus the goal of my research was to enhance video compression performance and\r to improve visual quality.It is hypothesized that the reduction in neighboring pixels\r coding,and humans perceptual mechanisms(psychovisual)redundancy could produce a\r low-complexity geometry streams for animated visual objects.A set of algorithms is\r developed to parse bidirectional interpolation pixels into their characteristic cells,which\r vary in spectral energy and wavelength.The bits contained in these cells are vectorized and\r transformed recursively to identify lower correlations among vector arrarys for blocks\r filtering.DCT function calculates energy ratios between high spatial frequency and low\r spatial frequency,to devote most of the highest spatial frequency bits with the calculated\r energy ratios.A variable quantization method is used to measure the sensitivity of colors\r and its intensity ratios to restore any missing high spatial frequency pixels.presnted in\r mathematical intrinsic.This approach leads to the ability to compress video data that\r normally require a large amount of memory to store and high bandwidth to\r transmit,Results form the enhanced video compression experiment have attained\r 0.1bpp(256kbps,25fps)without noticeable effects comparable to the video compression\r technique that achieved 0.5bpp(1.5Mbps,25fps)in use today.