找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Molecular Computing; Towards a Novel Comp Weng-Long Chang,Athanasios V. Vasilakos Book 2014 Springer International Publishing Switzerland 2

[复制链接]
查看: 46629|回复: 35
发表于 2025-3-21 17:43:05 | 显示全部楼层 |阅读模式
书目名称Molecular Computing
副标题Towards a Novel Comp
编辑Weng-Long Chang,Athanasios V. Vasilakos
视频video
概述Recent research in molecular computing.Presents a novel computing architecture for complex problem solving.Written by experts in the field.Includes supplementary material:
丛书名称Studies in Big Data
图书封面Titlebook: Molecular Computing; Towards a Novel Comp Weng-Long Chang,Athanasios V. Vasilakos Book 2014 Springer International Publishing Switzerland 2
描述.This textbook introduces a concise approach to the design of molecular algorithms for students or researchers who are interested in dealing with complex problems. Through numerous examples and exercises, you will understand the main difference of molecular circuits and traditional digital circuits to manipulate the same problem and you will also learn how to design a molecular algorithm of solving any a problem from start to finish. The book starts with an introduction to computational aspects of digital computers and molecular computing, data representation of molecular computing, molecular operations of molecular computing and number representation of molecular computing and provides many molecular algorithm to construct the parity generator and the parity checker of error-detection codes on digital communication, to encode integers of different formats, single precision and double precision of floating-point numbers, to implement addition and subtraction of unsigned integers, to construct logic operations including .NOT., .OR., .AND., .NOR., .NAND., .Exclusive.-.OR. (.XOR.) and .Exclusive.-.NOR. (.XNOR.), to implement comparators, shifters, increase, decrease, and to complete t
出版日期Book 2014
关键词Algorithmic Self-Assembly; Big Data; Bio-Molecular Computing; DNA Computing; Molecular Computing
版次1
doihttps://doi.org/10.1007/978-3-319-05122-2
isbn_softcover978-3-319-38098-8
isbn_ebook978-3-319-05122-2Series ISSN 2197-6503 Series E-ISSN 2197-6511
issn_series 2197-6503
copyrightSpringer International Publishing Switzerland 2014
The information of publication is updating

书目名称Molecular Computing影响因子(影响力)




书目名称Molecular Computing影响因子(影响力)学科排名




书目名称Molecular Computing网络公开度




书目名称Molecular Computing网络公开度学科排名




书目名称Molecular Computing被引频次




书目名称Molecular Computing被引频次学科排名




书目名称Molecular Computing年度引用




书目名称Molecular Computing年度引用学科排名




书目名称Molecular Computing读者反馈




书目名称Molecular Computing读者反馈学科排名




单选投票, 共有 0 人参与投票
 

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 22:19:28 | 显示全部楼层
2197-6503 ations including .NOT., .OR., .AND., .NOR., .NAND., .Exclusive.-.OR. (.XOR.) and .Exclusive.-.NOR. (.XNOR.), to implement comparators, shifters, increase, decrease, and to complete t978-3-319-38098-8978-3-319-05122-2Series ISSN 2197-6503 Series E-ISSN 2197-6511
发表于 2025-3-22 02:33:42 | 显示全部楼层
发表于 2025-3-22 08:13:42 | 显示全部楼层
发表于 2025-3-22 10:21:23 | 显示全部楼层
Studies in Big Datahttp://image.papertrans.cn/m/image/638149.jpg
发表于 2025-3-22 12:56:12 | 显示全部楼层
发表于 2025-3-22 18:58:44 | 显示全部楼层
发表于 2025-3-22 23:32:16 | 显示全部楼层
2197-6503 ncludes supplementary material: .This textbook introduces a concise approach to the design of molecular algorithms for students or researchers who are interested in dealing with complex problems. Through numerous examples and exercises, you will understand the main difference of molecular circuits a
发表于 2025-3-23 04:11:58 | 显示全部楼层
Book 2014lex problems. Through numerous examples and exercises, you will understand the main difference of molecular circuits and traditional digital circuits to manipulate the same problem and you will also learn how to design a molecular algorithm of solving any a problem from start to finish. The book sta
发表于 2025-3-23 08:25:17 | 显示全部楼层
Approximating the Smallest 2-Vertex Connected Spanning Subgraph of a Directed Graphe the efficiency of fast heuristics. First, we present a linear-time heuristic that gives a 3-approximation of the smallest 2-VCSS. Then we show that this heuristic can be combined with an algorithm of Cheriyan and Thurimella that achieves a (1 + 1/.)-approximation of the smallest .-VCSS. The combin
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-18 21:02
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表