化學中的數學與程式設計
When we were learning about organic compounds at school ,there was a unit discussing the isomers of alkane .Our teacher made us practice drawing all the structural formula of the isomers from hexane to nonane .We were much interested in the subject .However ,we often missed or duplicated some isomers .Thus , we began to think if it is possible to find a way by developing programs to let the computer calculate the exact number of the isomers of alkane . After discussion ,we set up a complete coding system .We numbered the isomers in the way that computers could decode and then wrote them in C language. Through computer execution ,the numbers of the isomers from C1 to C20 all match those on the reference website. According to the same concept , we also find a way to calculate the number of alkane with one substituted group . In the future,our goal will be focused on the research of multi- substituted alkane and cyclokane. In addition , the ionic crystal accumulation model are so variable. Take the double face-centered accumulation of NaCl for example, when the ion pairs are extended to the infinity , the potential energy of attractive field will approach a constant which is named as the Madelung Constant. We also managed to write a computer program with C language to approach this convergence with three models, including cube , octahedron , and sphere . The result turned out to be that the data of the sphere was less stable . In the other two models , when “n” is up to 43 layers , the data is identical with that on the reference website to the eight decimal point . 在學校裡學習有機化合物有關烷類異構物這個單元，老師讓我們練習畫出己烷~壬烷的所有異構物結構式，這引起我們極大的興趣！但常一不小心就漏掉或多出幾個，我們開始思考：能不能找到一個方法並設計成程式，讓電腦執行以找出烷類異構物？經過討論，我們建立了一套完整的編碼系統，將各異構物以電腦可解讀的方式編號，並以C 語言寫成程式。透過電腦執行，各碳數化合物自C1至C20都與參考網站吻合。依相同觀念，我們也設計出烷類含一個取代基的異構物數目。將來努力的目標為：多取代基及環烷類之研究！另外，離子晶體堆積模型變化多端，以NaCl 雙面心堆積為例，其引力場位能，當離子對延伸至無限大時，這個值將趨近於一個常數，又稱為馬德隆常數。我們嘗試以C 語言設計電腦程式，用三種模型（正立方體、正八面體、圓球）來逼近並求得這個收斂值。執行結果是：圓球數據較不穩定；而另二種模型到n=43 層以上，其數值大小與參考網路上的數值，在小數點以下8 位完全相同。
倒車攝影機影像之變形校正
與傳統的鏡頭比較起來，廣角鏡頭可取得較大範圍的影像，所以廣泛地運用在很多地方，例如倒車攝影機、內視鏡、防盜警眼等，但是其影像會有很大的變形失真，容易造成人類眼睛的錯覺與誤判。本篇研究以倒車攝影機為例，使用了多項式函數來校正其影像的變形與失真，從程式實作的校正結果看來，我們的方法之效果還不錯，相信同樣的模式可用來校正其他使用廣角鏡頭的儀器設備之變形影像。 Compared with the traditional lens, wide-angle lens can make images of larger range, so they are widely used in a lot of places, such as move backward cine-cameras, laparoscopes, and burglarproof eyes. The drawback is that the images distort a lot and may cause the illusion to human eyes and lead to erroneous judgments. This reserch takes the backward cine-camera as example and utilizes multinomial function to correct the deformation and distortion of the image. The results show that the method we use are quite effective and the model can be applied to other equipment with wide-angle lens.
打破語言隔閡-以圖點餐之數位餐廳
本次研究利用Web Sevrice軟體系統和Microsoft SQL Server的全文搜尋(Full-Text search)並藉由使用者選擇的圖片組合排列從系統資料庫中檢索比對，篩檢出正確或者最相似的餐點。Web Service 是建立於網際網路上之系統架構，且為一個具開放性、分散式的軟體元件，其基礎建立在HTTP、XML、SOAP、WSDL和UDDI等標準協定上，此研究即是透過Web Service系統與資料庫伺服器的連結進行。很多數位化資訊是以沒有結構化的文字資料，存成純文字檔及格式化的文件。這一類的文字資料儲存在檔案系統，而許多組織現在將這一類資料儲存到關聯式資料庫。這樣做就可以廣泛利用資料庫的好處-包括高效能存取、查詢能力、對使用者而言簡單的應用程式使用者介面，以及安全的遠端存取、查詢能力、對使用者而言簡單的應用程式使用者介面，以及安全的遠端存取。運用此功能即可在配對完成時搜尋最佳的結果並加以排名。「打破語言隔閡-以圖點餐之數位餐廳 」不只消除語言隔閡，更讓點餐手續方便許多，並讓錯誤的可能性降低。另外圖片資料庫的增減簡單快速、介面明瞭易懂。希望這些應用及創新能讓人們用餐方便及餐廳事業蓬勃發展。This research uses Web Service software system and Microsoft SQL Server. To choose the correct or the most similar meals by checking the combination and arrangement of the pictures chosen by users form the system data banks. Web-Service is a system structure establishes at the Internet. And its an open, dispersed software part. Its foundation is established at the standard agreement of HTTP,XML,SOAP,WSDL, and UDDI. The research proceeds by linking Web Service system and data-bank server lots of digital data are stored as words files and stylization documents without any structural words data. This kid of ward data are stored at file system, and many organized systems now store them at connected data banks. By doing this, people can make the most advantage of data banks- including efficient access, inquiry abilities, simple applies user’ interface, and safe remote access. People can find the best results and place them when this function finishes matching. It can not only eliminate language barriers but also make order procedure more convenient. It can also lower the mistake possibilities. In addition, we can increase or decrease pictures of data banks easily and fast. We can make the interface understood easily. We hope the applications and innovations can make it more convenient for people to order meals. And the business of restaurant can be developed successfully.
彩色蠶繭之研究
近幾年來，蠶繭彩色化已引起廣泛的注意，日本與中國大陸紛紛投入此研究領域。我們用食用色素、酸性染料和活體染色劑中性紅等色素水溶液，以沾附於桑葉餵食、浸泡蠶體、注射入蠶體血腔等方法，使白色繭品系的家蠶生產出多種顏色的彩色蠶繭，其中以附於桑葉餵食最有效率，我們就此法找出投與色素的有效期間，可以比日本、中國的方法更節省色素。同法處理黃色品系的家蠶則產生黃色與所加色素的混合色蠶繭。由於這樣得到的彩色蠶繭放久了都會褪色，我們試用奈米色素餵食家蠶所得彩色蠶繭，與一般食用色素所製成的彩色蠶繭比較，發現對各種光照、清潔劑清洗等處理，用奈米色素所得蠶繭明顯較用一般食用色素所得蠶繭不易褪色。這樣用奈米色素生產的彩色蠶繭，因為解決了褪色的問題而更具有潛在的產業價值。To make silkworm cocoons with different colors has received a great attention recently. Japan and China have invested great resources in this field of the study. In order to let white cocoon silkworms produce cocoons of different colors, we used the aqueous solutions of food dyes, acid dyes and neutral red, and fed the worms with mulberry leaves immersed with such aqueous solutions, or directly soaked or injected them with the solutions. We found that using mulberry leaves immersed in the dye solutions was the best approach. We improved this approach by finding a critical, effective time of applying dyes. It saved the dyes and labor than those of Japan and China. We also found that yellow cocoon silkworms produced yellow and mixing colored cocoons by the mulberry leaf feeding method with the same dyes. Because all colors of the cocoons mentioned above faded easily, we furthermore tested nano-dye and found that colors of the cocoons had better resistant to fading away in washing with detergents under various types and intensities of light illumination. This result suggested that nano-dye has a potential in solving the fading problem of the colored cocoons.
類固醇對斑馬魚胚胎細胞的影響
Steroid hormones are very important for physiological homeostasis, but some functions of steroids are still unclear during embryonic development. Embryonic cell movements are required forming embryonic body. Recently, there is already known Pregeneolone (P5) which could affect epiboly movement of zebrafish embryos is the first product of the steroidogenesis pathway, but effects of further downstream products on epiboly movement are unknown. In order to know this, we treat embryos with Pregnenolone (P5), 17α-Hydroxypregnenolone (17OH-P5), DHEA, Progesterone (P4), 17α-Hydroxyprogesterone (17OH-P4), 11-Deoxycortisol (D), or Testosterone (T). We found out that P5 can accelerate epiboly movement, 17OH-P5 and D have no significant effects on it, and DHEA, P4, 17OH-P4, and T can decelerate it. These results indicated that steroids play important roles on embryonic epiboly movement in zebrafish. 類固醇荷爾蒙對生理平衡很重要，但其對於胚胎發育的影響仍舊不明。胚胎個體的形成需要胚胎細胞進行不同的移動排列。目前研究已知類固醇荷爾蒙生合成機制的第一個產物pregnenolone (P5)對斑馬魚胚胎epiboly 移動有影響，但其它更下游的類固醇荷爾蒙對epiboly移動的影響仍然未知。為了了解類固醇其他下游產物對魚卵早期細胞移動的影響，將胚胎處理Pregnenolone (P5) 、17α-Hydroxypregnenolone (17OH-P5) 、DHEA 、Progesterone (P4) 、17α-Hydroxyprogesterone (17OH-P4)、11-Deoxycortisol (D)、Testosterone (T)，發現17OH-P5、D對epiboly 的移動沒有影響，而DHEA、P4、17OH-P4、T 會使其變慢。這些結果說明了類固醇對胚胎細胞的移動扮演著重要角色。
探討聲致發光效應中，改變溫度，濃度，液體種類，頻率對氣泡發光的影響?
聲致發光效應(sonoluminesence)為最近二十年來相當新穎的研究領域，其基本原理是利用超聲波將水中的氣泡集中，並使之隨著超聲波快速且連續的膨脹壓縮，當氣泡被壓縮至最小時溫度急遽上升，並放出藍白色的光芒。正因為這是一個嶄新的領域，所以許多實驗是以嘗試錯誤的方法去進行，但也因此發現了一些特殊的現象：1. 氣泡在正常的頻率(30kHz)以外，經過一段不可發光的頻率後，還可在更高頻率(接近40kHz)的地方發光2. 氣泡發光效率曲線在不同性質溶液中的差異3. 針對高頻率發光及雙泡發光的部分，做了兩個相關的假設並進一步驗證，得到了相當特別的結論。至今已有許多關於此研究的成果發表，但對於同時兩顆氣泡存在並發光的雙泡發光現象(double-bubble sonoluminesence)卻還很少人研究。因此我們嘗試較系統化地分析雙泡發光，期望能夠對這個現象有進一步的認識，並對日後的多泡發光(muti-bubble sonoluninesence)研究奠定基礎。Sonoluminescence has been a very popular topic for the past twenty years. Single-bubble sonoluminescence occurs when an acoustically trapped and periodically driven gas bubble collapses so strongly that the energy focusing on collapse leads to light emission. Because it is a new topic, few related experiments on this issue have been carried out before. However, while doing the research and making adjustments at the same time we discovered some special phenomenon: 1. Besides the normal amplitude frequency (30kHz) added on the bubble, we found that after a period of frequency which can not emit, the bubble is able to remain and emit in higher amplitude frequency (about 40 kHz). 2. We also compared the emission efficiency when bubbles are in different liquids. 3. To explain part of the results in high frequency and double-bubble sonoluminescence, we made two assumptions and attempted to demonstrated them in the end of the report. Some research studies in this field have been released already; nevertheless, few people concentrate on “double-bubble sonoluminescence.” Therefore, we attempt to systematically analyze the emission of double-bubble, expecting to have more comprehension of this marvelous effect and also establish the fundamental background to “muti-bubble sonoluninescence.”
Amazing Fairy Chess －討論多元方形鏈的數量
在這篇研究報告中，我們討論的是一種方形集合圖形的數量。”多元方形鏈”約略在 60 年代被提出，衍生出一系列的問題和遊戲，例如熟知的電玩軟體 『 俄羅斯方塊 』 ，或是 『 益智積木 』 的遊戲，都是多元方形鏈的應用。在這些問題當中，最令人頭痛的難題就是 n 元方形鏈的圖形總數。為了解決這道難題，我們採用一種轉換方法將圖形轉換成序組，並且給出序組的性質，再據此寫成 C 語言的程式；反覆地修改程式以增進執行效率及速度，最後利用該程式成功地統計出圖形總數。 In this report, we discussed the amount of polyominoes, the graphs of a set of squares. “Polyominoes” has been brought up in 1960s, and later developed into a series of questions and games, such as a well-known video game — Tetrix, and the game of puzzle blocks. Both are the applications of polyominoes. Among those questions, the toughest one is the amount of n-polyominoes. To solve this problem, we used a method which transforms the graphs into sequences. By looking into the properties of those sequences, we obtain a set of rules that can be used to determine the quantity of n-polyomines. The rules are implemented into computer codes in C language with proper modifications made to speed up the efficiency of our algorithm. The computational results show that the amount has been successfully calculated.