Difference between revisions of "User:Louie Louiie"

Jump to navigation Jump to search
258 bytes removed ,  21:52, 24 September 2017
no edit summary
Line 11: Line 11:
'''Technical'''
'''Technical'''


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 structure, versatile practicality, and low processing intensiveness<ref>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>{{cite web |url=https://bitcoin.org/bitcoin.pdf |title=Bitcoin: A Peer-to-Peer Electronic Cash System |date=October 2008 |publisher=bitcoin.org |accessdate=28 April 2014 |first=Satoshi |last=Nakamoto |deadurl=no |archiveurl=https://web.archive.org/web/20140320135003/https://bitcoin.org/bitcoin.pdf |archivedate=20 March 2014 |df=dmy-all }}</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 structure, versatile practicality, and low processing intensiveness<ref>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>Nakamoto, Satoshi (October 2008). "Bitcoin: A Peer-to-Peer Electronic Cash System"</ref>.


<br>
<br>
120

edits

Navigation menu