本研究基於雙鏡頭立體成像原理，提出適用於長距離的相機光軸校正演算法則。此演算法則可快速地將失真的影像修復，以提供正確物體影像的視差資訊來得到其3D立體影像的資訊。由於物體影像於長距離時會太小而變得難以辨識，因此加大影像解析度能有效提升物體影像的辨識度進而獲得長距離的立體影像，但電腦執行影像處理的運算時間也隨之變長而失去即時性。因此本研究採用圖形處理器及多重執行緒的技術，可將解析度1280*720的影像擷取和處理的運算時間縮短至每幅影像100毫秒以下，而達到影像處理的即時性。本研究最後將此研究成果用於汽車防撞警示雷達系統設計，此系統運用兩個網路攝影機來擷取影像，並利用OpenCV所提供之開放原始碼實現本研究所有使用之影像處理程序，以快速達到汽車防撞警示雷達系統的實現。

在台灣公共場合快速成長下，例如：大賣場、百貨公司、展覽會場，這些公共大型場合都有很好的消防設施，但始終有人葬身於火場？ 原因就是幾乎所有的人都不會去特別注意逃生平面圖，導致花太多的時間尋找出口，這樣生存機率就大大降低。火場裡面有太多的致命因素，像是：高溫的空氣，毒氣、濃煙…等，所以必須把握每一分每一秒。為了加快逃生速度，我們將所有的通道都設有導引警示器，逃生者只要順著導引警示器就可以安全到達出口。為了因應公共場合有龐大的人群，所以逃生路線不能只有一條，因此我們設計上是有多條路線，一、可以解決龐大人群，二、可以加快速度。;With the rapid growth of public places in Taiwan, evacuation system is of more and more importance. Actually, public places, such as hyper malls, department stores and exhibitions, are not without fire-fighting equipment, but why is that there are still people getting killed in a fire? The reason is that almost no one actually pays attention to the evacuation plans. As a result, it often takes too much time to find the exits, which lowers the possibility of survival. In a fire, there are usually too many fatal factors, which could lead to death, such as high temperature and heavy smoke; therefore time is precious when escaping from a fire. To fasten the speed of evacuation, we set guiding alarms in every passageway. By following the guiding alarms, people can get to the exits safely. Besides, owing to the huge amount of population in public places, there can’t be only one route out. With regard to this, we design many routes in order to enable and fasten the speed of evacuation of huge amount of population.

File compression has become a very important tool in the technology field because it allows faster data transfer rates over the internet and decreased file size on data disks. File compression aims to reduce file size while still retaining the quality of the file. Lossy file compression methods are not very efficient because the compressed files end up losing more data than what is usually intended causing a considerable loss in quality. Lossless file compression methods, on the other hand, take time to process since they require decompression to retrieve the original file. In this study, a lossless algorithm which does no require decompression was created. The resulting Fractal File Compression (FFC) algorithm contains two parts, the IFS algorithm and the Huffman Tree generator. Both algorithms were created using Java language and JCreator. The finished program was tested on an image file with 2542 x 1944 pixels dimensions. The image file was compressed using JPEG, BMP, PNG and FFC formats. For each method, the image file was compressed at three different resolution settings; low, medium and high. All the compressed images were then viewed under 500% zoom using Adobe Photoshop CS2. In an area of 40 by 40 pixels, the number of distinct boxes, which served as a measurement of image quality, was determined. Compressed images for JPEG, BMP, and PNG for both the low and medium settings have low image qualities, while the fractally-compressed images have a high image quality. For the high resolution setting, both JPG and fractally-compressed images have Page 2 of 2 high qualities while BMP and PNG still have low qualities. Based on the measurements obtained from the box-counting method and the file sizes, the absolute image quality for each compressed image was calculated. The absolute image qualities of the compressed images used for each setting were then compared. Coupled with large file size and small pixels per area count, the conventional methods have lower absolute image quality than the images compressed using the FFC method. This was true for the low and medium settings, however, JPG compression has a higher absolute image quality than the fractally-compressed images. This meant that JPG compression is more efficient than fractal compression when an image has a high resolution. The resulting FFC algorithm is lossless since it uses pattern searches and replacements in order to decrease the file size. To make the program more suitable for high resolution images, the FFC algorithm may be modified. Most of the changes in the FFC algorithm should be done in the IFS generator. High resolution images can be compressed fully if the pattern that was used for compression is more representative, but even shorter. A more representative bit pattern would create a high quality, high resolution image with a smaller file size.

國立自然科學博物館推出《數位博物館》，內含大量生物圖鑑及豐富館藏文物之圖文資 料，無論用於資料查詢或提供進階研究資料皆有極大貢獻。但經使用後發現，其檢索架構仍 只提供關鍵字搜尋及分類瀏覽，無法精確檢索出欲查詢之資料，尚有改進之處。 於是針對現有之影像檢索系統，我們跳脫出傳統以文字為檢索之依據，而設計出一連串 之改進方案，如下： 1. IRHI 色調辨識影像檢索，針對色調相近之影像類群提供良好檢索架構。 2. IRCI 輪廓辨識影像檢索，針對輪廓相近之影像類群提供良好檢索架構。 3. IRHCI 色調暨輪廓辨識影像檢索，綜合前述兩種方法之優點所設計。 A while ago, the National Museum of Natural Science put forth the “Digital Museum,” which contains great amount of biological pictographs and abundant collections of textual as well as pictorial materials. This has contributed tremendously to information search and advanced research. However, after employing them, we come to discover that its retrieval paradigm only provides key-word search and categorization browse, without enabling us to precisely pick out the desired data. Thus, this paradigm leaves something to be desired. To make up for the insufficiency of the existing system, we have escaped from the concept of searching by texts. Instead, we have designed a series of improvements. They are as follows: 1. IRHI(Image Retrieval by Hue Identification): Providing a sound paradigm for the image groups composed of similar hues. 2. IRCI(Image Retrieval by Contour Identification): Providing a sound paradigm for image groups composed for similar contours. 3. IRHCI(Image Retrieval by Hue and Contour Identification): Combining the strengths of the above two paradigms.

在六億年前，海洋中有許多不同種類的生物，經過了幾億年的演化和突變，令我們覺得好奇，為何基因經過交配和突變能產生這麼多變化，而且愈來愈優良，於是我們想利用電腦的符號來代表各種不同的基因，使其交配、突變，研究近年來興起的「遺傳演算法」學說。

夠炫的 E 世代銀飾品為其特徵，從銀戒、手鍊、項鍊、耳環及各式吊掛在身上之銀環，無一不是金飾加工之成品。升上三年級在工廠實習課中有機會接觸到金飾加工課程，從熔銀、滾壓、抽線、焊接、銼磨、拋光到完成獨一無二的飾品，將飾品掛在身上，同學投以欣羨眼光，那份成就感實在無以言喻。因為從事金飾加工這一行業者並不多，所以大部分工作都是純手工製作，相當費力及耗時，尤其是方形銀線要抽成圓形銀線，更是吃足苦頭。於是想利用學校設備及材料設計製作出一電動抽線機，從最基本構想用電腦繪圖繪出，如何選擇動力源，如何讓滾筒能旋轉又能向前移動，到零件製作焊接組合噴漆等等，最後終於在幾位同學協力合作，及老師指導之下完成此一成品，希望此成品對金飾加工業能有所幫助。

使用現有的電腦及網路設備，再加上一些電路就可由世界各地透過網際網路(Internet)觀看、餵食家裡的寵物，甚至開關照明、電暖器等。目前可餵食乾狗糧、乾貓糧、魚飼料、鳥飼料等。 遠距視訊寵物餵食器是由一台電腦稱餵食端(圖1右側)，經由印表機埠(printer port)控制餵食器、電暖器、照明、或設定餵食時間及照明、電暖器ON及OFF時間，且可經由串列埠控制AI馬達來改變視訊攝影機(Web Cam)的方向(上下左右)。 遠端電腦(圖1左側)透過網際網路可遙控餵食器、電暖器、照明及視訊攝影機的方向，經由餵食端電腦的視訊攝影機(Web Cam)傳回遠端，可在世界各地看寵物生活及活動情況。因有攝影機的旋轉功能，故用於家庭保全及家電控制等用途。

本屆數學參展作品中，高中組及國中組作品頗具水準。國小組作品題材本不易尋找，但本屆亦有多件高小組作品頗具巧思，初小組作品只有五件，略微少些。 國中組及高中組有多件作品能適當地利用電腦協助計算或展示其成果。複雜的幾何圖形在電腦中可呈現其動態變化，增進了解。由此顯見參展學生電腦運用的能力熟練，為一可喜現象。 一般而言，本屆參展作品的文字較以往流暢，參賽學生的表達能力亦多半很好，充滿信心，應對得宜，可看出其發展潛力，令人欣慰。

本研究主題主要是解決化學上複雜同分異構物的繪製以及其命名，因為物質在結構複雜時其同分異構物變化之多令人難以捉摸，於是我應用電腦強大的邏輯處理以及運算判斷的能力來讓電腦繪製。以下是我想達成的目的：(1)排列出分子式的同分異構物(2)顯示出同分異構物之示性式、結構式(3)預知尚未創造出物質的性質研究中我創造出以下原則讓我方便達成研究(1) 數位密碼：為了讓電腦方便執行我使用數碼的方式表達各種同分異構物(2) 五大原則：此原則能讓不僅是電腦甚至是各個要繪製同分異構物的人都能有架構的繪製，不會遺漏任何的組成。(3) ３Ｄ顯示：透過Ｘ３Ｄ軟體的協助我能讓使用者透過立體的方式了解到物質的結構。The purpose of this research is to solve the problem of Isomer’s structure drawing and named problem. It’s hard to predict the status of complex Isomers, so we use the powerful logic and calculational ability of computer to draw the structure of Isomers. The following points is the goal that we want to reach (1) Arrange the structure of the Isomer’s formula (2) Show structural formula of Isomers (3) Predict the chemistry of things that haven’t been created During our research, we create the following principle to help us do the research (1) Digital Codes: In order to let the computer to run the process, we use digital codes to express all the Isomer’s formula. (2) The “5 Rules”: The 5 rules can help not only computers but all the people who try to draw the structure of Isomers without losing any of compositions. (3) 3D Display: Helping our user to understand the structures of materials with the 3D images producing by the “X3D”.

為了將去年我們所獨創的「一滴溶液的化學顯微電解實驗」能延續到其他的化學實驗上，今年我們更是創新突破了很多困難的關卡，在傳統實驗對照下，由第一代實驗到第五代的減量設計，現在已能成功的運用【報廢的光碟片】、【報廢的電腦】、【報廢滑鼠內的感光二極體元件及電品體】來自製設計出『兩極反應物各一滴容易做自動偵測反應的紀錄』；更企圖一併可在學校大力推動電腦融入教學的設備下，能『透過顯微鏡加裝的ＣＣＤ電子螢幕目視觀看』、『聯結電視螢幕立即播放』或『拍成電子影片檔由電腦播放』，已和現在政府大力推動的奈米科學教育接軌，並真正達到顯微化學環保實驗的終極目標。

南美洲及非洲兩大陸塊的形狀非常契合，是因為中洋脊的擴張使它們分開。本研究以奧伊勒理論為基礎，利用大西洋中洋脊附近的許多轉型斷層及破裂帶，並以空間向量及解空間方程式的方法，來求奧伊勒極的位置，以進行南美洲和非洲之間板塊運動模擬。先算出分別中垂於兩個不同轉型斷層的兩個平面方程式，再找出兩平面與地球球面的交點，即奧伊勒極的位置。奧伊勒極可以用來描述板塊相對運動，相對運動量則由中洋脊兩側的條帶磁力異常線換算求得。最後將所求得的奧伊勒極和現有的板塊資料與海岸線資料，輸入電腦進行板塊運動的模擬，並進一步算出兩板塊間的相對運動速率。本研究所算出的奧伊勒極位於63.8° N、32.9° W；以奧伊勒極為基礎，算出兩億年來非洲和南美洲兩板塊間相對運動的平均角速率約為0.305 度/百萬年；最後模擬出兩億年來南美洲相對於非洲的古位置。在一億九千五百萬年前的古位置圖中可發現，當兩陸塊北端密合時，南端有陸塊重疊的現象，可見南端實際相對運動的量比預估的還少，推測是因為板塊經過長時間的運動，受到擠壓而變形，而這些變形吸收了部分的相對運動量，而非洲西南外海的確有一Wafisch Ridge 存在。

本研究運用兩套方法，成功的化簡、篩選眾多結構；配合繪圖檢驗，證明了六邊形共有20種對稱拼貼圖結構。透過本研究，在適當軟體的支援下，使用者可快速且精準的設計出富有創意的密貼圖樣；所有的圖形結構亦可被更加廣泛運用。運用本研究理論與結果，我們撰寫了一Visual Basic程式，可供使用者快速方便判別任意的六邊形磁磚是否可對稱拼貼；最後，我們將研究結果應用於相關立體圖形，如：環面(Torus)、圓柱曲面(Cylinders)及莫比紙圈(Mobius Strip)；運用前人的研究，再配合本研究結果，將可以有更廣泛的應用，如：阿基米德立體圖….等。