發(fā)布時(shí)間：2018-02-23 21:22

  本文關(guān)鍵詞： DNA計(jì)算 創(chuàng)新設(shè)計(jì) 骨骼結(jié)構(gòu) DNA編碼　出處：《山東師范大學(xué)》2012年碩士論文　論文類型：學(xué)位論文

【摘要】：DNA計(jì)算作為一種新的生物計(jì)算模型，它以DNA分子作為計(jì)算介質(zhì)，以生物化學(xué)反應(yīng)作為計(jì)算工具。DNA計(jì)算具有運(yùn)算速度快、高度并行性和存儲(chǔ)信息量巨大等優(yōu)點(diǎn)，具有廣闊的研究前景。創(chuàng)新設(shè)計(jì)是一種創(chuàng)造性的實(shí)踐活動(dòng)，從本質(zhì)上來說是一種先輸入在輸出的過程。一個(gè)優(yōu)秀的設(shè)計(jì)是由許多部分組成，在組合的過程中，最優(yōu)的個(gè)體組合往往不能達(dá)到最優(yōu)秀的效果。以往依靠設(shè)計(jì)人員的經(jīng)驗(yàn)解決此類問題，但是這種辦法效率很低。如果將此類組合問題的設(shè)計(jì)要求看作問題的約束條件，設(shè)計(jì)的目的轉(zhuǎn)化為符合條件的最優(yōu)解，那么此類組合問題就轉(zhuǎn)化為一個(gè)組合優(yōu)化問題。采用DNA計(jì)算可以快速高效解決相應(yīng)問題。 本文從DNA計(jì)算的編碼問題入手。DNA計(jì)算中，編碼問題是計(jì)算的重點(diǎn)和難點(diǎn)之一。為了提高計(jì)算的有效性和可靠性，本文提出了一種基于模擬退火遺傳算法的DNA編碼算法。分析了DNA編碼需要滿足的約束條件，選擇適當(dāng)?shù)募s束條件，并建立相應(yīng)的數(shù)序模型。采用模擬退火與遺傳算法結(jié)合的方法解決多目標(biāo)優(yōu)化問題。將實(shí)驗(yàn)結(jié)果同已有序列結(jié)果進(jìn)行對(duì)比，證明該方法的有效性，并將該方法應(yīng)用于創(chuàng)新設(shè)計(jì)中的編碼中。 一個(gè)產(chǎn)品在經(jīng)歷構(gòu)思、概念設(shè)計(jì)、建模和實(shí)際制造出來需要很多過程。在產(chǎn)品產(chǎn)生初步的構(gòu)思并進(jìn)入設(shè)計(jì)階段的過程中需要大量擁有多年設(shè)計(jì)經(jīng)驗(yàn)人員的設(shè)計(jì)經(jīng)驗(yàn)和智慧。這個(gè)過程要根據(jù)用戶的需要，建立需求模型、并用規(guī)范和標(biāo)準(zhǔn)的方式將部件的特性和功能準(zhǔn)確的表達(dá)。如果一個(gè)有n個(gè)部件的設(shè)計(jì)產(chǎn)品，每個(gè)部件有m個(gè)選擇，那么就有mn種選擇。采用數(shù)學(xué)和計(jì)算機(jī)的方法，根據(jù)實(shí)際的部件組合和部件屬性，建立相適應(yīng)的映射模型；進(jìn)而將映射與功能一一對(duì)應(yīng)，轉(zhuǎn)為滿足設(shè)計(jì)需求的含有特定限制的設(shè)計(jì)解。改進(jìn)了一種基于骨骼結(jié)構(gòu)來分析實(shí)體模型的方法，增加了骨骼弧度作參數(shù)來描述實(shí)體。通過骨骼結(jié)構(gòu)的方法，將設(shè)計(jì)實(shí)體分解為若干部件組裝問題，將創(chuàng)新設(shè)計(jì)中的部件裝備模型抽象為普通的組合問題，進(jìn)一步延伸為基本的NP問題模型。 在深入探討DNA計(jì)算的原理，方法和計(jì)算模型的基礎(chǔ)上，提出了一種用DNA計(jì)算來解決抽象出的組合優(yōu)化問題的方法。以吊燈設(shè)計(jì)的實(shí)例，詳細(xì)的說明DNA計(jì)算如何應(yīng)用到創(chuàng)新設(shè)計(jì)的過程。首先將連續(xù)的參數(shù)離散化處理，劃分為若干個(gè)區(qū)間并進(jìn)行DNA編碼，編碼采用固定長(zhǎng)度編碼和可變長(zhǎng)度編碼兩種方式。以閉環(huán)DNA模型為基礎(chǔ)建立DNA計(jì)算模型，并在閉環(huán)DNA上設(shè)定相應(yīng)的參數(shù)分位點(diǎn)，在限制性內(nèi)切酶的作用下與相關(guān)參數(shù)依次發(fā)生反應(yīng)，最后產(chǎn)生大量編碼。將DNA分子鏈的長(zhǎng)度作為適應(yīng)度函數(shù)閾值，采用凝膠電泳等技術(shù)找出符合要求的目標(biāo)解。經(jīng)過計(jì)算機(jī)模擬出實(shí)驗(yàn)結(jié)果，證明了方法的有效性和可行性。
[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.
【學(xué)位授予單位】：山東師范大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2012
【分類號(hào)】：TP38

【參考文獻(xiàn)】

相關(guān)期刊論文 前10條

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

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

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

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

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

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

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

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

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

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

相關(guān)博士學(xué)位論文 前1條

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

，

本文編號(hào)：1527666