120
edits
Louie Louiie (talk | contribs) |
Louie Louiie (talk | contribs) |
||
Line 1: | Line 1: | ||
=Current Projects= | |||
===Artificial Super Organisms (In Silico)=== | |||
'''Introduction''' | '''Introduction''' | ||
Line 12: | Line 14: | ||
From the application perspective of this exercise, we can define each node as a micro-app written on the NodeJS platform, chosen for its decentralized concurrency structure and non-blocking I/O transaction capabilities<ref>[http://www.sosp.org/2001/papers/welsh.pdf Matt Welsh et al. – SEDA: An Architecture for Well-Conditioned, Scalable Internet Services (2001)]</ref>. Using a series of unique nodes as the initialization state, each node can be trained using neural networks/machine learning to do one of four tasks: worker, guard, librarians, oligarchy. A worker node accomplishes the learned tasks, unique to the purpose of application (eg: text analytics, image recognition, mathematical computation); the guard assigned to security enforcement functionality; librarians contain data; the oligarchy regulates policies to run the hive such as a queen in a colony. Each individual node can be replicated once the initial states are set. To accomplish a decentralized hive like structure for this exercise, individual node pathways may be configured in peer-to-peer (P2P) networks, forming a de facto blockchain as each node contains its own machine learned algorithm once a PGP layer is added<ref>[https://bitcoin.org/bitcoin.pdf Nakamoto, Satoshi (October 2008). "Bitcoin: A Peer-to-Peer Electronic Cash System"]</ref>. | From the application perspective of this exercise, we can define each node as a micro-app written on the NodeJS platform, chosen for its decentralized concurrency structure and non-blocking I/O transaction capabilities<ref>[http://www.sosp.org/2001/papers/welsh.pdf Matt Welsh et al. – SEDA: An Architecture for Well-Conditioned, Scalable Internet Services (2001)]</ref>. Using a series of unique nodes as the initialization state, each node can be trained using neural networks/machine learning to do one of four tasks: worker, guard, librarians, oligarchy. A worker node accomplishes the learned tasks, unique to the purpose of application (eg: text analytics, image recognition, mathematical computation); the guard assigned to security enforcement functionality; librarians contain data; the oligarchy regulates policies to run the hive such as a queen in a colony. Each individual node can be replicated once the initial states are set. To accomplish a decentralized hive like structure for this exercise, individual node pathways may be configured in peer-to-peer (P2P) networks, forming a de facto blockchain as each node contains its own machine learned algorithm once a PGP layer is added<ref>[https://bitcoin.org/bitcoin.pdf Nakamoto, Satoshi (October 2008). "Bitcoin: A Peer-to-Peer Electronic Cash System"]</ref>. | ||
'''References''' | |||
<references /> | |||
<br> | <br> | ||
<hr> | <hr> | ||
For more information, please contact me at: <br> | For more information, please contact me at: <br> |
edits