本文關鍵詞： DNA計算 創(chuàng)新設計 骨骼結構 DNA編碼　出處：《山東師范大學》2012年碩士論文　論文類型：學位論文

【摘要】：DNA計算作為一種新的生物計算模型，它以DNA分子作為計算介質，以生物化學反應作為計算工具。DNA計算具有運算速度快、高度并行性和存儲信息量巨大等優(yōu)點，具有廣闊的研究前景。創(chuàng)新設計是一種創(chuàng)造性的實踐活動，從本質上來說是一種先輸入在輸出的過程。一個優(yōu)秀的設計是由許多部分組成，在組合的過程中，最優(yōu)的個體組合往往不能達到最優(yōu)秀的效果。以往依靠設計人員的經(jīng)驗解決此類問題，但是這種辦法效率很低。如果將此類組合問題的設計要求看作問題的約束條件，設計的目的轉化為符合條件的最優(yōu)解，那么此類組合問題就轉化為一個組合優(yōu)化問題。采用DNA計算可以快速高效解決相應問題。 本文從DNA計算的編碼問題入手。DNA計算中，編碼問題是計算的重點和難點之一。為了提高計算的有效性和可靠性，本文提出了一種基于模擬退火遺傳算法的DNA編碼算法。分析了DNA編碼需要滿足的約束條件，選擇適當?shù)募s束條件，并建立相應的數(shù)序模型。采用模擬退火與遺傳算法結合的方法解決多目標優(yōu)化問題。將實驗結果同已有序列結果進行對比，證明該方法的有效性，并將該方法應用于創(chuàng)新設計中的編碼中。 一個產(chǎn)品在經(jīng)歷構思、概念設計、建模和實際制造出來需要很多過程。在產(chǎn)品產(chǎn)生初步的構思并進入設計階段的過程中需要大量擁有多年設計經(jīng)驗人員的設計經(jīng)驗和智慧。這個過程要根據(jù)用戶的需要，建立需求模型、并用規(guī)范和標準的方式將部件的特性和功能準確的表達。如果一個有n個部件的設計產(chǎn)品，每個部件有m個選擇，那么就有mn種選擇。采用數(shù)學和計算機的方法，根據(jù)實際的部件組合和部件屬性，建立相適應的映射模型；進而將映射與功能一一對應，轉為滿足設計需求的含有特定限制的設計解。改進了一種基于骨骼結構來分析實體模型的方法，增加了骨骼弧度作參數(shù)來描述實體。通過骨骼結構的方法，將設計實體分解為若干部件組裝問題，將創(chuàng)新設計中的部件裝備模型抽象為普通的組合問題，進一步延伸為基本的NP問題模型。 在深入探討DNA計算的原理，方法和計算模型的基礎上，提出了一種用DNA計算來解決抽象出的組合優(yōu)化問題的方法。以吊燈設計的實例，詳細的說明DNA計算如何應用到創(chuàng)新設計的過程。首先將連續(xù)的參數(shù)離散化處理，劃分為若干個區(qū)間并進行DNA編碼，編碼采用固定長度編碼和可變長度編碼兩種方式。以閉環(huán)DNA模型為基礎建立DNA計算模型，并在閉環(huán)DNA上設定相應的參數(shù)分位點，在限制性內切酶的作用下與相關參數(shù)依次發(fā)生反應，最后產(chǎn)生大量編碼。將DNA分子鏈的長度作為適應度函數(shù)閾值，采用凝膠電泳等技術找出符合要求的目標解。經(jīng)過計算機模擬出實驗結果，證明了方法的有效性和可行性。
[Abstract]:As a new biological computing model, DNA computing has the advantages of fast computing speed, high parallelism and huge amount of information, using DNA molecule as computing medium and biochemical reaction as computing tool. Innovative design is a kind of creative practical activity, essentially a process of input and output. A good design is composed of many parts, in the process of combination, The optimal combination of individuals is often unable to achieve the best results. In the past, the designer's experience was used to solve this kind of problem, but this method is very inefficient. If the design requirement of this kind of combinatorial problem is regarded as the constraint of the problem, If the purpose of the design is transformed into the optimal solution which meets the conditions, then the combination problem can be transformed into a combinatorial optimization problem, and the corresponding problem can be solved quickly and efficiently by using DNA calculation. In this paper, the coding problem is one of the most important and difficult problems in DNA computing. In order to improve the efficiency and reliability of the calculation, In this paper, a DNA coding algorithm based on simulated annealing genetic algorithm is proposed. The constraint conditions of DNA coding are analyzed, and the appropriate constraints are selected. The simulation annealing and genetic algorithm are used to solve the multi-objective optimization problem. The experimental results are compared with the existing sequence results, and the effectiveness of the method is proved. The method is applied to the coding of innovative design. A product is experiencing conception, conceptual design, Modeling and actual manufacturing takes a lot of processes. It takes a lot of design experience and wisdom to have a lot of people with years of design experience in the process of producing the initial idea and entering the design phase. The process is based on the needs of the user. The requirements model is established, and the features and functions of the components are accurately expressed in a normative and standard way. If a design product has n components, each component has m choices, Then there are mn kinds of selections. By using mathematical and computer methods, an appropriate mapping model is established according to the actual component combination and component properties, and then the mapping is mapped to the function one by one. An improved method for analyzing entity models based on bone structure, with the addition of bone radians as parameters to describe entities. The design entity is decomposed into several component assembly problems, and the component and equipment model in innovative design is abstracted into a general combinatorial problem, which is further extended to a basic NP problem model. On the basis of deeply discussing the principle, method and calculation model of DNA calculation, this paper presents a method of solving the combinatorial optimization problem abstracted by DNA calculation. The example of chandelier design is given. How to apply DNA computation to the process of innovative design is explained in detail. Firstly, the continuous parameters are discretized, divided into several intervals and coded by DNA. Based on the closed-loop DNA model, the DNA calculation model is established, and the corresponding parameter loci are set up on the closed-loop DNA. The restriction endonuclease reacts with the related parameters in turn, resulting in a large amount of coding. The length of DNA molecular chain is used as the threshold of fitness function. Using gel electrophoresis and other techniques to find out the target solution which meets the requirements. The computer simulation results show that the method is effective and feasible.
【學位授予單位】：山東師范大學
【學位級別】：碩士
【學位授予年份】：2012
【分類號】：TP38

【參考文獻】

相關期刊論文 前10條

1 劉文斌,高琳,王淑棟,劉向榮,許進;最大匹配問題的DNA表面計算模型[J];電子學報;2003年10期

2 王淑棟,劉文斌,許進;圖的最小頂點覆蓋問題的質粒DNA計算模型[J];華中科技大學學報(自然科學版);2004年11期

3 周康,同小軍,許進;路徑排序問題基于表面的DNA算法[J];華中科技大學學報(自然科學版);2005年08期

4 周康;王延峰;劉文斌;許進;;基于閉環(huán)DNA的邊著色問題DNA算法[J];華中科技大學學報(自然科學版);2006年09期

5 周康;同小軍;許進;;基于閉環(huán)DNA模型的八皇后問題算法[J];計算機工程與應用;2007年06期

6 李珍;王淑棟;;DNA編碼限制條件與編碼策略[J];計算機工程與應用;2009年05期

7 周康;同小軍;劉文斌;許進;;基于閉環(huán)DNA計算的最大獨立集問題的算法[J];計算機工程;2008年04期

8 劉弘;劉希玉;;支持外觀造型創(chuàng)新設計的進化計算方法[J];計算機輔助設計與圖形學學報;2006年01期

9 劉毅;宋玉階;;收縮背包問題的DNA算法[J];計算機工程與科學;2007年08期

10 崔光照;李小廣;張勛才;王延峰;李翠玲;;基于改進的粒子群遺傳算法的DNA編碼序列優(yōu)化[J];計算機學報;2010年02期

相關博士學位論文 前1條

1 鄭自然;基于智能計算的計算機輔助建模方法研究[D];山東師范大學;2010年

，

本文編號：1527666