一种广义分子计算模型及其在 NP问题中的应用
目前各种分子计算模型多基于生物技术，求解一个问题的分子计算机算法很难不作修改地应用于其他类似的问题，尚不似传统计算机般通用。为此，提出一种基于图灵机的广义分子计算模型，其由一台单带图灵机、一条单向只写带和一条工作带组成，通过只写带与工作带之间特殊的映射函数实现并行的同时读、写操作。实验说明了该模型能够在多项式时间求解NP完全的满足性问题（SAT），比现有分子计算模型在计算准确性和通用性上存在明显优势。...
Saved in:
| Published in | 计算机应用研究 Vol. 31; no. 11; pp. 3353 - 3356 |
|---|---|
| Main Author | |
| Format | Journal Article |
| Language | Chinese |
| Published |
北京理工大学 机电学院爆炸科学与技术国家重点实验室,北京,100081%北京邮电大学计算机学院智能通信软件多媒体北京市重点实验室,北京,100876
2014
|
| Subjects | |
| Online Access | Get full text |
| ISSN | 1001-3695 |
| DOI | 10.3969/j.issn.1001-3695.2014.11.035 |
Cover
| Abstract | 目前各种分子计算模型多基于生物技术，求解一个问题的分子计算机算法很难不作修改地应用于其他类似的问题，尚不似传统计算机般通用。为此，提出一种基于图灵机的广义分子计算模型，其由一台单带图灵机、一条单向只写带和一条工作带组成，通过只写带与工作带之间特殊的映射函数实现并行的同时读、写操作。实验说明了该模型能够在多项式时间求解NP完全的满足性问题（SAT），比现有分子计算模型在计算准确性和通用性上存在明显优势。 |
|---|---|
| AbstractList | TP301; 目前各种分子计算模型多基于生物技术，求解一个问题的分子计算机算法很难不作修改地应用于其他类似的问题，尚不似传统计算机般通用。为此，提出一种基于图灵机的广义分子计算模型，其由一台单带图灵机、一条单向只写带和一条工作带组成，通过只写带与工作带之间特殊的映射函数实现并行的同时读、写操作。实验说明了该模型能够在多项式时间求解NP完全的满足性问题（SAT），比现有分子计算模型在计算准确性和通用性上存在明显优势。 目前各种分子计算模型多基于生物技术，求解一个问题的分子计算机算法很难不作修改地应用于其他类似的问题，尚不似传统计算机般通用。为此，提出一种基于图灵机的广义分子计算模型，其由一台单带图灵机、一条单向只写带和一条工作带组成，通过只写带与工作带之间特殊的映射函数实现并行的同时读、写操作。实验说明了该模型能够在多项式时间求解NP完全的满足性问题（SAT），比现有分子计算模型在计算准确性和通用性上存在明显优势。 |
| Abstract_FL | DNA computing is a novel parallel computation paradigm.Existing models were mostly based on molecular biologi-cal technology and different from the traditional computers,they were less universal than traditional ones,so the algorithm or a DNA computer just for one kind of problem could not be transplanted to solve other problems without any modification.This paper put forward a new generalized molecular computational model(designated by GMCM)based on Turing machine,which did not rely on biotechnology and included an ordinary single tape Turing machine,a finite write-only tape,and a special working tape.Through the topological mapping between the write-only tape and the wokring tape,it could realize read or write in parallel.Validation test proves that GMCM can solve the satisfiability problem in a polynomial time and has obvious advan-tages compared with exsiting DNA computer on computation accuracy and universal property. |
| Author | 李艳梅 余文 宁建国 |
| AuthorAffiliation | 北京理工大学机电学院爆炸科学与技术国家重点实验室,北京100081 北京邮电大学计算机学院智能通信软件多媒体北京市重点实验室,北京100876 |
| AuthorAffiliation_xml | – name: 北京理工大学 机电学院爆炸科学与技术国家重点实验室,北京,100081%北京邮电大学计算机学院智能通信软件多媒体北京市重点实验室,北京,100876 |
| Author_FL | YU Wen LI Yan-mei NING Jian-guo |
| Author_FL_xml | – sequence: 1 fullname: LI Yan-mei – sequence: 2 fullname: YU Wen – sequence: 3 fullname: NING Jian-guo |
| Author_xml | – sequence: 1 fullname: 李艳梅 余文 宁建国 |
| BookMark | eNo9j71KA0EcxLeIYBJ9BxELmzv3v7t364KNBL8gqEX6sLe5izl0ozlErrMw4geiRSAiIsTGa5JSEhtfJuuZt_AkIlMMDD9mmALK6ab2EVoCbFPhipXQbkSRtgFjsKgrHJtgYDaAjamTQ_n_fBYVoijEmBEQOI_WxsPz9O3OjD7Ho2tzdWn6D9-DXjrofiU983Jr7m9M-908Jwu7-5PuYPL6OB7206cL89FJO8kcmgnkYeTP_3kRVTY3KqVtq7y3tVNaL1vKxY7lKCakF_jcU4oL5gMDTjmsEkUBE86FIDVBQAbM9RweOLTme4zUJAkUo4L6tIiWp7VnUgdS16th87Sls8FqGIVxHIe_VwGyoxm6OEXVQVPXTxoZfNxqHMlWXHVdkokC0B_1oWyW |
| ClassificationCodes | TP301 |
| ContentType | Journal Article |
| Copyright | Copyright © Wanfang Data Co. Ltd. All Rights Reserved. |
| Copyright_xml | – notice: Copyright © Wanfang Data Co. Ltd. All Rights Reserved. |
| DBID | 2RA 92L CQIGP W92 ~WA 2B. 4A8 92I 93N PSX TCJ |
| DOI | 10.3969/j.issn.1001-3695.2014.11.035 |
| DatabaseName | 维普_期刊 中文科技期刊数据库-CALIS站点 中文科技期刊数据库-7.0平台 中文科技期刊数据库-工程技术 中文科技期刊数据库- 镜像站点 Wanfang Data Journals - Hong Kong WANFANG Data Centre Wanfang Data Journals 万方数据期刊 - 香港版 China Online Journals (COJ) China Online Journals (COJ) |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| DocumentTitleAlternate | Generalized molecular computational model for NP problems |
| DocumentTitle_FL | Generalized molecular computational model for NP problems |
| EndPage | 3356 |
| ExternalDocumentID | jsjyyyj201411035 662626311 |
| GrantInformation_xml | – fundername: 国家自然科学基金资助项目 funderid: (11272066) |
| GroupedDBID | -0Y 2B. 2C0 2RA 5XA 5XJ 92H 92I 92L ACGFS ALMA_UNASSIGNED_HOLDINGS CCEZO CQIGP CUBFJ CW9 TCJ TGT U1G U5S W92 ~WA 4A8 93N ABJNI PSX |
| ID | FETCH-LOGICAL-c605-5c49abfe7bcc794e141737182c310277992d921af46b57f53deb42da2fc4393e3 |
| ISSN | 1001-3695 |
| IngestDate | Thu May 29 03:54:50 EDT 2025 Wed Feb 14 10:34:00 EST 2024 |
| IsPeerReviewed | false |
| IsScholarly | true |
| Issue | 11 |
| Keywords | SAT问题 generalized molecular computational model satisfiability problem 图灵机 Turing machine 广义分子计算模型 |
| Language | Chinese |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c605-5c49abfe7bcc794e141737182c310277992d921af46b57f53deb42da2fc4393e3 |
| Notes | 51-1196/TP LI Yan-mei, YU Wen, NING Jian-guo （1. State Key Laboratory of Explosive Science ＆ Technology, College of Mechatronical Engineering, Beijing Institute of Technology, Beijing 100081, China; 2. Beijing Key Laboratory of Intelligent Telecommunication Software ＆ Multimedia, College of Computer, Beijing University of Posts ＆ Telecommunications, Beijing 100876, China） DNA computing is a novel parallel computation paradigm.Existing models were mostly based on molecular biologi-cal technology and different from the traditional computers,they were less universal than traditional ones,so the algorithm or a DNA computer just for one kind of problem could not be transplanted to solve other problems without any modification.This paper put forward a new generalized molecular computational model（designated by GMCM）based on Turing machine,which did not rely on biotechnology and included an ordinary single tape Turing machine,a finite write-only tape,and a special working tape.Through the topological mapping between t |
| PageCount | 4 |
| ParticipantIDs | wanfang_journals_jsjyyyj201411035 chongqing_primary_662626311 |
| PublicationCentury | 2000 |
| PublicationDate | 2014 |
| PublicationDateYYYYMMDD | 2014-01-01 |
| PublicationDate_xml | – year: 2014 text: 2014 |
| PublicationDecade | 2010 |
| PublicationTitle | 计算机应用研究 |
| PublicationTitleAlternate | Application Research of Computers |
| PublicationTitle_FL | Application Research of Computers |
| PublicationYear | 2014 |
| Publisher | 北京理工大学 机电学院爆炸科学与技术国家重点实验室,北京,100081%北京邮电大学计算机学院智能通信软件多媒体北京市重点实验室,北京,100876 |
| Publisher_xml | – name: 北京理工大学 机电学院爆炸科学与技术国家重点实验室,北京,100081%北京邮电大学计算机学院智能通信软件多媒体北京市重点实验室,北京,100876 |
| SSID | ssj0042190 ssib001102940 ssib002263599 ssib023646305 ssib051375744 ssib025702191 |
| Score | 1.9402794 |
| Snippet | ... TP301;... |
| SourceID | wanfang chongqing |
| SourceType | Aggregation Database Publisher |
| StartPage | 3353 |
| SubjectTerms | SAT问题 图灵机 广义分子计算模型 |
| Title | 一种广义分子计算模型及其在 NP问题中的应用 |
| URI | http://lib.cqvip.com/qk/93231X/201411/662626311.html https://d.wanfangdata.com.cn/periodical/jsjyyyj201411035 |
| Volume | 31 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV3NaxQxFA91C-LFb7FWZYXmVLbuZJKZCXjJ7M5SPJQeKvS2zMzOtvSwVdse2pMHFT8QPRQqIkK92Et7lNaL_0zHtfhP-PKS7o510Vq8LNnkvTfv916YvITMe4SMxZwzWBWrlcypphWepaICi15c0bnaE5mmqZfhBdkpb_IevzsrZodKPwq3llaWk4l0beB3JSfxKvSBX_VXsv_g2Z5Q6IA2-Bd-wcPweywf04jTMNCXFSKfKp8GdRoJGkoaNnBI0kDqngBoPN1QdSqBOKAqospBrohKn0YeVQH2CCojGoTI1aCBwgbIRHZZA7LxqWkaSc0FvNBQjMrAagLyQaZUNOCoiaKSYw8HxmIcPFgHkB-q3xmRpmp7FKDrnSYiU50GkZYHWEMXoTBqCvQYEtAMYEuk9Wh_4UWDAFhEHYb20RIa9eJZiNM_BUVj1FBZrslVDXWsWuuGoJ1AqVx7w9hbeeMFaIgoFL0xtCTaEIasm6DBtDGNT6VTIDbujrRAcI32O0pWjZ7mFlSIkgMzJYxAaYek8ZrSSEwPqMtqA7CxmoPBHGViEHKpxeo5UAT1C_K_ePmoBTzd0EOA0UUsEi_iKHxoA-UEul-Z6R3aaQkPlUYgTBt26HB3kM4CDcj-l3ECU1XIrur63qDrmWquhy80p7Bsu67JWG1DQPjrDQovXOlJDC-01ImeVH1BlE_oXMAm886RBO4LSwurq6sLmghibVecIsPM9x1RIsMqrIeN_u4Fgv1iNkumE0X1Twt0qQevsDzr-pMQb_SWZ-G4vsBiFiYQ5TBokrFYPU-TMQvi9p8g6Cwz84uduQcQO-OnjJ123JkrRN0z58lZu10uK_Puu0CG1uYvknOHpWjKNjK5RO7s7z7qfnqV733d33ueP3uab7_5vrPZ3dn4trWZf3iZv36RP_mcv98qT00fbOwcfHy7v7vdffc4_7LeXd-6TGYa0UxtsmILw1RSryoqIuUyTtqZn6QphBMZ2NV3IcZmKexVwbRSspZkTtzmXiL8tnBbWcJZK2btFLZfbuZeIaXOYie7SspVzmOWOKkrRaYzTcZ-26-KVovFbZ_HWTZCRnu2aN43-X-ansd0Di_HGSG3rHWadlVYah719rVj0IySM7ptTnavk9Lyw5XsBux1lpObdo78BGC17yw |
| linkProvider | EBSCOhost |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=%E4%B8%80%E7%A7%8D%E5%B9%BF%E4%B9%89%E5%88%86%E5%AD%90%E8%AE%A1%E7%AE%97%E6%A8%A1%E5%9E%8B%E5%8F%8A%E5%85%B6%E5%9C%A8+NP%E9%97%AE%E9%A2%98%E4%B8%AD%E7%9A%84%E5%BA%94%E7%94%A8&rft.jtitle=%E8%AE%A1%E7%AE%97%E6%9C%BA%E5%BA%94%E7%94%A8%E7%A0%94%E7%A9%B6&rft.au=%E6%9D%8E%E8%89%B3%E6%A2%85&rft.au=%E4%BD%99%E6%96%87&rft.au=%E5%AE%81%E5%BB%BA%E5%9B%BD&rft.date=2014&rft.pub=%E5%8C%97%E4%BA%AC%E7%90%86%E5%B7%A5%E5%A4%A7%E5%AD%A6+%E6%9C%BA%E7%94%B5%E5%AD%A6%E9%99%A2%E7%88%86%E7%82%B8%E7%A7%91%E5%AD%A6%E4%B8%8E%E6%8A%80%E6%9C%AF%E5%9B%BD%E5%AE%B6%E9%87%8D%E7%82%B9%E5%AE%9E%E9%AA%8C%E5%AE%A4%2C%E5%8C%97%E4%BA%AC%2C100081%25%E5%8C%97%E4%BA%AC%E9%82%AE%E7%94%B5%E5%A4%A7%E5%AD%A6%E8%AE%A1%E7%AE%97%E6%9C%BA%E5%AD%A6%E9%99%A2%E6%99%BA%E8%83%BD%E9%80%9A%E4%BF%A1%E8%BD%AF%E4%BB%B6%E5%A4%9A%E5%AA%92%E4%BD%93%E5%8C%97%E4%BA%AC%E5%B8%82%E9%87%8D%E7%82%B9%E5%AE%9E%E9%AA%8C%E5%AE%A4%2C%E5%8C%97%E4%BA%AC%2C100876&rft.issn=1001-3695&rft.issue=11&rft.spage=3353&rft.epage=3356&rft_id=info:doi/10.3969%2Fj.issn.1001-3695.2014.11.035&rft.externalDocID=jsjyyyj201411035 |
| thumbnail_s | http://utb.summon.serialssolutions.com/2.0.0/image/custom?url=http%3A%2F%2Fimage.cqvip.com%2Fvip1000%2Fqk%2F93231X%2F93231X.jpg http://utb.summon.serialssolutions.com/2.0.0/image/custom?url=http%3A%2F%2Fwww.wanfangdata.com.cn%2Fimages%2FPeriodicalImages%2Fjsjyyyj%2Fjsjyyyj.jpg |