Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

阅读索引 #5

Open
yaoguangluo opened this issue Oct 29, 2020 · 1 comment
Open

阅读索引 #5

yaoguangluo opened this issue Oct 29, 2020 · 1 comment

Comments

@yaoguangluo
Copy link
Owner

yaoguangluo commented Oct 29, 2020

<<类人DNA与 神经元基于催化算子映射编码方式 V_1.2.2版本国家软著申请 流水号 2020Z11L0333706>>
<<肽展公式推导与元基编码进化计算以及它的应用发现 V_1.2.2版本国家软著申请 流水号 2020Z11L0356797>>
https://gitee.com/DetaChina/collection-of-papers-by-deta/blob/master/DNA%20%E7%BC%96%E7%A0%81%E6%96%B9%E5%BC%8F1.2.2%20%E4%B8%AD%E8%AF%91%E8%8B%B1%E6%B7%B7%E5%90%88%E7%89%88.pdf
观点: DNA的本质是一种智慧体 对 数据 增删改查 的 四个 元操作 的 组合方式 编码索引链. VPCS 架构不是德塔最终架构, 观点很明确, 至少这篇文章中, 作者会做一个详细的论点论证, 基于5个部分, 德塔工作在类人认知方式, 医学商业逻辑的后端处理, 催化计算的过程, 德塔计算算力本质的寻找, 以及仿生DNA的解码分析, 最后, 作者会组织很多的文字来描述德塔的一些振奋人心的发现: 比如 DNA的编码元基 如IDUC对应 增删改查, 以及它的真实环境的社会应用实例.
ABSTRACT: In order to Emancipate the productive forces, create new productivity, optimize existing production tools to better adapt to the production environment and Better assists Humanoid in where understanding, adaptation and transformation of the environment. We know VPCS [9] architecture is not the end. Absolutely, At least at this paper, will make an implementation in five section: DETA HUMANOID [20] cognition, DETA AOPM Humanoid [20] Cognition Theory, DETA VPCS Medical Business backend logic, DETA IDUQ Catalytic computing and DETA INITONS DECODING [18]. Above all There will spend more and more words in my DETA DNA [14] Law of IDUQ. The Essence of INITONS; DNA [14] theorem: The Essence of DNA [14]; Execution mode of Neuron Calculation; The Essence of Adapting to The Environment; The essence of HUMANOID [20] evolution offspring etc.
KEYWORDS: VPCS [9] AOPM [10], IDUC, Nero, Artificial, Decoder, Medical, PARALLING [19], Computing, Humanoid, ETL, Parser [1], Data Mining [21], INITONS [57]
INTRODUCTION: Recently the real-world first-time human find a solution how to build the magnitude INITONS PDN Life by using computer, now the kernel of this paper will definitely proof that how does this life born and how many scientific tasks we had already finished, finally, also includes the pending tasks for example NUWA Plan, PDE and TVM etc. thus all and all will be implemented in the TEXT section where on the research factors way of how we finding.
文章跟进太多主要为3个方向

1 DNA 编码规范 著作 AOPM VECS IDUQ 工程 与 initons 定义, 活性肽原理函数规范定义 等 见所有个人软著体系和

https://gitee.com/DetaChina/collection-of-papers-by-deta/blob/master/DNA%20%E7%BC%96%E7%A0%81%E6%96%B9%E5%BC%8F1.2.2%20%E4%B8%AD%E8%AF%91%E8%8B%B1%E6%B7%B7%E5%90%88%E7%89%88.pdf
(https://github.com/yaoguangluo/Deta_Resource/blob/master/DNA%20%E7%BC%96%E7%A0%81%E6%96%B9%E5%BC%8F1.2.2%20%E4%B8%AD%E8%AF%91%E8%8B%B1%E6%B7%B7%E5%90%88%E7%89%88.pdf)

2 DNA 计算著作 变嘧啶, DNA 肽展, 核酸钥匙, 推导完整过程等.

https://gitee.com/DetaChina/collection-of-papers-by-deta/blob/master/CN_DT_pdn_computing1_2_2.pdf
全球首发 AOPM VECS IDUQ 肽展催化公式推导集备份 中华人民共和国国家个人著作权申请文章中文版 备份

https://github.com/yaoguangluo/Deta_Resource/blob/master/CN_DT_pdn_computing1_2_2.pdf
(仅仅纠正 第10页 新冠苷 的s=q的推导结果) https://gitee.com/DetaChina/collection-of-papers-by-deta/blob/master/CN_DT_pdn_computing1_2_2%20%E4%BB%85%E4%BB%85%20FIX%20%E7%AC%AC12%E9%A1%B5%20S=Q%20%E6%96%B0%E5%86%A0%E5%A4%84%E6%B6%89%E7%9A%84%E5%87%A0%E8%A1%8C%20.pdf

https://github.com/yaoguangluo/Deta_Resource/blob/master/CN_DT_pdn_computing1_2_2%20%E4%BB%85%E4%BB%85%20FIX%20%E7%AC%AC12%E9%A1%B5%20S%3DQ%20%E6%96%B0%E5%86%A0%E5%A4%84%E6%B6%89%E7%9A%84%E5%87%A0%E8%A1%8C%20.pdf

发布受干扰, 20201102报警, 国家公安备案 按git 时间戳 增量模式 确定的 保留的 中英 混合版本(肽展定理的推导过程一字不变):
https://gitee.com/DetaChina/collection-of-papers-by-deta/blob/master/著作权版本PDE_Formular_1_2_2.pdf

3 对应 期刊, 会议, 演讲, 展示 论文, 题材, 作品和介绍的资料集合等. 会议论文版本

https://gitee.com/DetaChina/collection-of-papers-by-deta/blob/master/DNA%E7%BC%96%E7%A0%81%E6%96%B9%E5%BC%8F1_2_2%E8%BD%AF%E8%91%97_%E4%B8%AD%E6%96%87%E8%A3%81%E5%89%AA_1_2_3_%E7%B2%BE%E7%AE%80%E5%85%A8%E8%8B%B1%E8%AE%BA%E6%96%87%E7%89%88V0_0_2.pdf
https://gitee.com/DetaChina/collection-of-papers-by-deta/blob/master/PDE_Formular_ENpaper1_2_2.pdf (1_2_2_1)
PPT

https://github.com/yaoguangluo/Deta_Resource/blob/master/Deta_OSS%2Bv11.3.2.pdf
11.3.3 仅仅纠正下11.3.2最后一页 新冠苷 的s = q 5行推理

https://gitee.com/DetaChina/collection-of-papers-by-deta/blob/master/Deta_OSS%20v11.3.3.pdf
https://github.com/yaoguangluo/Deta_Resource/blob/master/Deta_OSS%20v11.3.3.pdf
11.3.final for fix the (thanks page) https://github.com/yaoguangluo/Deta_Resource/blob/master/Deta_OSS%20v11.final.pdf https://gitee.com/DetaChina/collection-of-papers-by-deta/blob/master/Deta_OSS%20v11.final.pdf

最终解释权 罗瑶光 浏阳德塔软件开发有限公司. 20201029

记住这个时间:
公元二零二零年十月四号, DNA 编码手册 首次破译.
公元二零二零年十月二十五号 完整破译 DNA INITONS 肽展变换定理公式
公元二零二零年十月二十七号 首次 完整破译 DNA INITONS 肽展变换生命词根
公元二零二零年十一月六号 首次 完整破译 费洛蒙

@yaoguangluo
Copy link
Owner Author

input:MSIOCUOCIPCUPCI 测试
肽展 降元

降元A = V + S
MSIOCUOCIPCUPCI
降元O = E + S
MSIESCUESCIPCUPCI
降元P = E + C
MSIESCUESCIECCUECCI
降元M = C + S
CSSIESCUESCIECCUECCI
降元V = U + Q
CSSIESCUESCIECCUECCI
1降元概率IU

11降元E = I + U
CSSIIUSCUIUSCIIUCCUIUCCI
11降元C = I + D
IDSSIIUSIDUIUSIDIIUIDIDUIUIDIDI
1111概率S

1111概率S_11降元S = I + Q
IDIQIQIIUIQIDUIUIQIDIIUIDIDUIUIDIDI
1111概率S_11肽展 增元

1111概率S_11V = U + Q
IDIQIQIIUIQIDUIUIQIDIIUIDIDUIUIDIDI
1111概率S_111概率Increment IU

1111概率S_E = I + U
IDIQIQIEIQIDUEIQIDIEIDIDUEIDIDI
1111概率S_C = I + D
CIQIQIEIQCUEIQCIECCUECCI
1111概率S_S = I + Q
CSSIESCUESCIECCUECCI
1111概率S_A = V + S
CSSIESCUESCIECCUECCI
1111概率S_O = E + S
CSSIOCUOCIECCUECCI
1111概率S_P = E + C
CSSIOCUOCIPCUPCI
1111概率S_M = C + S
MSIOCUOCIPCUPCI
1111概率S_112概率Increment DU

1111概率S_E = D + U
IDIQIQIIUIQIEIUIQIDIIUIDIEIUIDIDI
1111概率S_C = I + D
CIQIQIIUIQIEIUIQCIIUCIEIUCCI
1111概率S_S = I + Q
CSSIIUSIEIUSCIIUCIEIUCCI
1111概率S_A = V + S
CSSIIUSIEIUSCIIUCIEIUCCI
1111概率S_O = E + S
CSSIIUSIEIUSCIIUCIEIUCCI
1111概率S_P = E + C
CSSIIUSIEIUSCIIUCIEIUCCI
1111概率S_M = C + S
MSIIUSIEIUSCIIUCIEIUCCI
1112概率S_I

1111概率S_I_11降元S = I
IDIIIIUIIDUIUIIDIIUIDIDUIUIDIDI
1111概率S_I_11肽展 增元

1111概率S_I_11V = U + Q
IDIIIIUIIDUIUIIDIIUIDIDUIUIDIDI
1111概率S_I_111概率Increment IU

1111概率S_I_E = I + U
IDIIIEIIDUEIIDIEIDIDUEIDIDI
1111概率S_I_C = I + D
CIIIEICUEICIECCUECCI
1111概率S_I_S = I + Q
CIIIEICUEICIECCUECCI
1111概率S_I_A = V + S
CIIIEICUEICIECCUECCI
1111概率S_I_O = E + S
CIIIEICUEICIECCUECCI
1111概率S_I_P = E + C
CIIIEICUEICIPCUPCI
1111概率S_I_M = C + S
CIIIEICUEICIPCUPCI
1111概率S_I_112概率Increment DU

1111概率S_I_E = D + U
IDIIIIUIIEIUIIDIIUIDIEIUIDIDI
1111概率S_I_C = I + D
CIIIIUIIEIUICIIUCIEIUCCI
1111概率S_I_S = I + Q
CIIIIUIIEIUICIIUCIEIUCCI
1111概率S_I_A = V + S
CIIIIUIIEIUICIIUCIEIUCCI
1111概率S_I_O = E + S
CIIIIUIIEIUICIIUCIEIUCCI
1111概率S_I_P = E + C
CIIIIUIIEIUICIIUCIEIUCCI
1111概率S_I_M = C + S
CIIIIUIIEIUICIIUCIEIUCCI
1113概率S_Q

1111概率S_Q_降元S = Q
IDQQIIUQIDUIUQIDIIUIDIDUIUIDIDI
1111概率S_Q_肽展 增元

1111概率S_Q_V = U + Q
IDQQIIVIDUIVIDIIUIDIDUIUIDIDI
1111概率S_Q_概率Increment IU

1111概率S_Q_E = I + U
IDQQIIVIDUIVIDIEIDIDUEIDIDI
1111概率S_Q_C = I + D
CQQIIVCUIVCIECCUECCI
1111概率S_Q_S = I + Q
CQQIIVCUIVCIECCUECCI
1111概率S_Q_A = V + S
CQQIIVCUIVCIECCUECCI
1111概率S_Q_O = E + S
CQQIIVCUIVCIECCUECCI
1111概率S_Q_P = E + C
CQQIIVCUIVCIPCUPCI
1111概率S_Q_M = C + S
CQQIIVCUIVCIPCUPCI
1111概率S_Q_概率Increment DU

1111概率S_Q_E = D + U
IDQQIIVIEIVIDIIUIDIEIUIDIDI
1111概率S_Q_C = I + D
CQQIIVIEIVCIIUCIEIUCCI
1111概率S_Q_S = I + Q
CQQIIVIEIVCIIUCIEIUCCI
1111概率S_Q_A = V + S
CQQIIVIEIVCIIUCIEIUCCI
1111概率S_Q_O = E + S
CQQIIVIEIVCIIUCIEIUCCI
1111概率S_Q_P = E + C
CQQIIVIEIVCIIUCIEIUCCI
1111概率S_Q_M = C + S
CQQIIVIEIVCIIUCIEIUCCI
2降元概率DU

21降元E = D + U
CSSIDUSCUDUSCIDUCCUDUCCI
21降元C = I + D
IDSSIDUSIDUDUSIDIDUIDIDUDUIDIDI
2111概率S

2222概率S_11降元S = I + Q
IDIQIQIDUIQIDUDUIQIDIDUIDIDUDUIDIDI
2222概率S_11肽展 增元

2222概率S_11V = U + Q
IDIQIQIDUIQIDUDUIQIDIDUIDIDUDUIDIDI
2222概率S_111概率Increment IU

2222概率S_E = I + U
IDIQIQIDUIQIDUDUIQIDIDUIDIDUDUIDIDI
2222概率S_C = I + D
CIQIQCUIQCUDUIQCCUCCUDUCCI
2222概率S_S = I + Q
CSSCUSCUDUSCCUCCUDUCCI
2222概率S_A = V + S
CSSCUSCUDUSCCUCCUDUCCI
2222概率S_O = E + S
CSSCUSCUDUSCCUCCUDUCCI
2222概率S_P = E + C
CSSCUSCUDUSCCUCCUDUCCI
2222概率S_M = C + S
MSCUSCUDUSCCUCCUDUCCI
2222概率S_112概率Increment DU

2222概率S_E = D + U
IDIQIQIEIQIEEIQIDIEIDIEEIDIDI
2222概率S_C = I + D
CIQIQIEIQIEEIQCIECIEECCI
2222概率S_S = I + Q
CSSIESIEESCIECIEECCI
2222概率S_A = V + S
CSSIESIEESCIECIEECCI
2222概率S_O = E + S
CSSIOIEOCIECIEECCI
2222概率S_P = E + C
CSSIOIEOCIPIEPCI
2222概率S_M = C + S
MSIOIEOCIPIEPCI
2112概率S_I

2222概率S_I_11降元S = I
IDIIIDUIIDUDUIIDIDUIDIDUDUIDIDI
2222概率S_I_11肽展 增元

2222概率S_I_11V = U + Q
IDIIIDUIIDUDUIIDIDUIDIDUDUIDIDI
2222概率S_I_111概率Increment IU

2222概率S_I_E = I + U
IDIIIDUIIDUDUIIDIDUIDIDUDUIDIDI
2222概率S_I_C = I + D
CIICUICUDUICCUCCUDUCCI
2222概率S_I_S = I + Q
CIICUICUDUICCUCCUDUCCI
2222概率S_I_A = V + S
CIICUICUDUICCUCCUDUCCI
2222概率S_I_O = E + S
CIICUICUDUICCUCCUDUCCI
2222概率S_I_P = E + C
CIICUICUDUICCUCCUDUCCI
2222概率S_I_M = C + S
CIICUICUDUICCUCCUDUCCI
2222概率S_I_112概率Increment DU

2222概率S_I_E = D + U
IDIIIEIIEEIIDIEIDIEEIDIDI
2222概率S_I_C = I + D
CIIIEIIEEICIECIEECCI
2222概率S_I_S = I + Q
CIIIEIIEEICIECIEECCI
2222概率S_I_A = V + S
CIIIEIIEEICIECIEECCI
2222概率S_I_O = E + S
CIIIEIIEEICIECIEECCI
2222概率S_I_P = E + C
CIIIEIIEEICIPIEPCI
2222概率S_I_M = C + S
CIIIEIIEEICIPIEPCI
2113概率S_Q

2222概率S_Q_降元S = Q
IDQQIDUQIDUDUQIDIDUIDIDUDUIDIDI
2222概率S_Q_肽展 增元

2222概率S_Q_V = U + Q
IDQQIDVIDUDVIDIDUIDIDUDUIDIDI
2222概率S_Q_概率Increment IU

2222概率S_Q_E = I + U
IDQQIDVIDUDVIDIDUIDIDUDUIDIDI
2222概率S_Q_C = I + D
CQQCVCUDVCCUCCUDUCCI
2222概率S_Q_S = I + Q
CQQCVCUDVCCUCCUDUCCI
2222概率S_Q_A = V + S
CQQCVCUDVCCUCCUDUCCI
2222概率S_Q_O = E + S
CQQCVCUDVCCUCCUDUCCI
2222概率S_Q_P = E + C
CQQCVCUDVCCUCCUDUCCI
2222概率S_Q_M = C + S
CQQCVCUDVCCUCCUDUCCI
2222概率S_Q_概率Increment DU

2222概率S_Q_E = D + U
IDQQIDVIEDVIDIEIDIEEIDIDI
2222概率S_Q_C = I + D
CQQCVIEDVCIECIEECCI
2222概率S_Q_S = I + Q
CQQCVIEDVCIECIEECCI
2222概率S_Q_A = V + S
CQQCVIEDVCIECIEECCI
2222概率S_Q_O = E + S
CQQCVIEDVCIECIEECCI
2222概率S_Q_P = E + C
CQQCVIEDVCIPIEPCI
2222概率S_Q_M = C + S
CQQCVIEDVCIPIEPCI

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant