聽聽貝多芬作品的下一代：將碎形及基因演算法應用於數位音樂產生器
本研究整合了碎形圖形的迭代運算方法與基因交配觀念來達到音樂創新，並透過音樂和諧性判別機制來提高創新音樂的悅耳程度。利用基因觀念之交配的方法來解決長短的問題。這個方法是把原始音符輸入後，找出它們的中心點，以這個中心點為準，其他的音符按照一定比例向外延展，成為新的迭代點。再利用這些迭代點，迭代出新的音符。把製造好的音符染色體放置到交配池中，以隨機的方式在交配池中選取其中之一個染色體進行交配的動作，此二音符染色體會交換彼此的基因，產生下一代新的代表音符長短之染色體，隨後以「模仿母體判斷式」來判斷這新一代的音樂是否與母體音樂相似，藉此淘汰掉「不肖的」下一代，而若新一代與母體的相似程度高的話，它的悅耳性相信也會相對提高。最後把這些技術應用於數位音樂創作，以衍生新穎應用與創新的結果。Fractals can be produced by IFS (Iterated Function Systems). By iterative computation of many times, we can obtain the similar graphics. In my research, the methods to generate the iterative algorithms were presented. In addition, I would discuss the regularity and the content as well as the properties of those digital patterns. At last, the advanced application of fractals to digital music pieces was presented. The program took a note of several measure of music as the beginning point, and made the IFS calculations for each new note in each measure. But there was no difference in beats if you just make the IFS iteration. So I changed the beats with genetic crossover method. In this research, the expression of the DNA to each beat of note was adopted. The same way, it took a note as a beginning point. And the system obtained the new DNA from the old notes for new ones randomly. After producing the new pieces of music, I want to know if it is good to listen. So I used the algorithm that checks the simulation to the shape of mother music. If its shape is similar to the mother music, the probability that the new music is pleasing may even increase. That would make a piece of brand new music. What I want to do in this research is improve the multiformity of music and find what the relationship is of ‘good music’ and mathematical algorithms
Parallelize it! 運算分享與系統自我校調
The research is about the optimal on parallel processing. Through boot disk – which will automatically finish booting configuration, .it is efficient and quick to build high performance PC clusters. The advantage of parallel computing could be applied to massive image processing. By sharing processing and breaking huge processing load into lots of pieces, we could get more efficient result. It is also possible to optimal parallel system through some special means such as dynamic configuration. Through the means, the system could distribute work loading itself. It could also adjust itself to get the highest performance and the most stable environment. 本研究之目的在於探討平行處理中的計算資源的最佳化，透過自動完成開機設定的Boot Disk 來有效快速建製出高效率的PC Clusters 環境，並透過動態配置與類神經網路的校調，使整體叢集的運算能自動調整至最佳化。平行處理優勢，可以應用在耗費極大量的運算資源的影像處理上。透過運算資源分享，可以以很高的效率將極為龐大的運算工作分散成許多較小的程序，使影像處理速度加快。經由平行演算法及實際應用的調整，可對已成形之平行系統作效能上的加強。使用類神經網路的方式訓練，使其系統能夠自我分配運算工作量，且隨著各平行化程式與各節點的不同，能自我校調至最佳化，達到高效率且穩定的運算環境。\r 本研究透過高效率且能自我調校的運算環境，可用於優化其本身結構，以達到\r 演化出更進一步系統，具有相當大的發展潛力。
攔截未知病毒之基礎技術-參數監控
在網際網路蓬勃發展的時代，電腦病毒也更加的猖獗。雖說防毒軟體百家爭鳴，但對於未知病毒的防治技術仍然束手無策。本研究的目的在追溯出電腦惡意程式運行模式，利用IDA靜態反編譯軟體與病毒原始碼尋找出病毒共同的特徵，阻斷其滋生途徑。 本研究在實驗中，研究者利用Borland C++ Builder 6作為應用程式開發環境，配合WinAPI函數與TRegistry類別設計出參數監控系統。研究顯示不論是修改於Window 9x架構下的win.ini, system.ini，或是Run與Run Service之下的資料項，本系統都能有效運作。此系統能成功的攔截到惡意程式對Registry鍵值的讀寫，亦即當使用者否決其修改鍵值時，惡意程式無法在重新開機後運行；易言之，惡意程式失去執行效力。 實驗結果發現，參數監控系統可攔截惡意程式之修改命令，防止未知病毒與惡意程式開機自動運行，以此達到未知病毒的攔截基礎技術。本研究之結果可補強市售防毒系統，對於未知病毒的攔截，能達到完整的防護效果。 Computer viruses become more rampant in the rapidly-developing era of Internet. With the various kinds of Anti-Virus software, people still can do nothing about detecting the unknown viruses. This research aims to trace back the computer virus function mode. By using IDA Pro Disassembler and Virus Source, we can find out the common characteristics of viruses. Thus, we can stop viruses from thriving. The experiment uses Borland C++ Builder 6 as the Registry Detection System by coordinating Win API and TRegistry. It works no matter by modifying win.ini and system.ini under the structure of Window 9x or by modifying Run Value and RunService Value. Moreover, it can intercept the viruses from reading and writing of the ValueKey. As the users deny the modified ValueKey, the viruses cannot run after resetting. In other words, the viruses lose their effects. The results present that Registry Detection System can intercept the modifying commands and prevent the automatic running from unknown viruses. By doing so, we can acquire the basic technology of intercepting the unknown viruses. The application of this study can improve the functions of Anti-Virus. In this way, through protection from unknown viruses can be obtained.
CryptoDefender - afast way to encrypt your files
1. Purpose of the research\r Nowadays, many encryption software are available to computer user. However, very few people use them which result in many cases of information and data leakage due mainly over the Internet. Most people use USB Flash Drive to store and carry confident files back home to work on. When the USB Drive is lost, the files stored are often leaked. To prevent this type of incident occurring, “CryptoDefender” is developed to enhance files protection and to change user’s habit in handling confidential information. \r 2. Procedures\r “CryptoDefender” is an add-in for common application software, e.g. Word, Excel, etc. It will appear as a new tab in the ribbon which provides the software an alternative for saving and opening a file. It protects the files in two ways: encryption and steganography. The data is first encrypted into cipher text as these encrypted data will be hidden in an image file to lower suspicion of readers. All of these procedures will be done by one click. For encrypt and decrypt, the user just needs to click the “Protect” and “Decrypt”. An extremely fast way to encrypt the file is “Quick Protect”. It will randomly choose an image from the image folder according to their file size. This function saves the time for choosing an image.\r 3. Data\r The method for steganography is using last two bit of R, last three bit of G and B to store the encrypted data. In 24-bit bitmap, RGB is represented the color of each pixel and each of them is 8-bit. The leftmost bit of each byte contains the highest value, and the right one contains the lowest value. Therefore, any change in the rightmost byte will only cause a minimal change in a byte value, and the color as well. 2-3-3 method is adopted to replace the pixels as encrypted data. It is used because it is in coordination with the program’s fluency. 2-3-3 is obtained so that 1 pixel will contain 1 byte of encrypted data. For R, the last two bit will be replaced by encrypted data. For G and B, the last 3 bit will be replaced by encrypted data. If the Bitmap size is larger than the encrypted data, random data will be replaced into the remaining pixels.\r 4. Conclusion \r “CryptoDefender” is user-friendly and efficient way to protect important and confidential digital files on most personal computers. This software will help to change the user’s habit in securing their information as to avoid data leakage even when they are accidentally lost.
The Use of Simulated Annealing in Predicting Solar Flare Activity
A program based on the simulated annealing (SA) algorithm was developed to allow for a longer-term prediction of the occurrence of solar flares, thus reducing the risks they may pose to astronauts, satellites, and ultimately the planet Earth. Sunspot data such as the solar cycle, the appearance of sunspots, the sun's magnetic field, the occurrence of solar flares and other factors that concern the sun were considered in the development of the algorithm. The program, coded in C++, included providing for an initial random state that pertained to the sun's state at a specified time. A neighborhood function was designed based on how sunspots are formed and how they disappear, and the probability function was designed using previous solar cycles to show relationships between the number of sunspots and the time it takes for the sun to reach solar maxima. Finally, the cooling function was designed as a representation of the time. Recorded sunspot counts obtained from the US National Geophysical Data Center (NGDC) during the solar cycle 22 from 1986 to 1996 was used as test data. The output was compared to the actual recorded solar events or the period. The program was found to be 66.7% accurate in predicting solar flares when compared on a smoothed trendline, while it exhibited a 50.5% accuracy when comparing day-to-day data. Since solar flare acitivty is predicted in terms of the trend of activity and intensity, improving daily data accuracy is superfluous. Smoothed trendline prediction accuracy may however be improved by altering the importance of each factor in predicting solar flare activity and by devising a different sunspot classification scheme for intensity and activity.
將錯就錯的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.