Difference between revisions of "Data is the asset"

From PKC
Jump to navigation Jump to search
m (Text replacement - "{{#ev:youtube|hP3ENPc8Jf0 |width=900 |height=500 }} " to "{{#widget:YouTube |id= hP3ENPc8Jf0 |width= 900 |height=500 }}")
 
(11 intermediate revisions by 3 users not shown)
Line 1: Line 1:
Data, especially data content that is verified by trusted parties, defines the accountability of participants in this inter-connected world, therefore, becomes the binding force in exercising [[social contracts]].
TEST, especially data content that is verified by trusted parties, defines the accountability of participants in this inter-connected world, therefore, becomes the binding force in exercising [[social contracts]].




==The Goal==
==The Goal==


Establish up a rigorous reasoning mechanism to ensure all judgements are based on a known set of rules. All rules are also encoded as immutable data, so that all decisions can be traced and justified with respect to these rules. This rigorous mechanism can avoid halting problem by setting up various levels of abstractions, so that decisions can be reached within the domain of defined vocabulary, often known as the domain of partially ordered set. The original concepts of such sound decision procedures can be traced back to Dana Scott<ref>Data Scott, Outline of a Mathematical Theory of Computation, https://www.researchgate.net/publication/242406560_Outline_of_a_Mathematical_Theory_of_Computation, last accessed: May 15, 2021</ref> and Patrick & Radhia Cousot's work on <ref>Patrick Cousot & Radhia Cousot.
Establish up a rigorous reasoning mechanism to ensure all judgements are based on a known set of rules. All rules are also encoded as immutable data, so that all decisions can be traced and justified with respect to these rules. This rigorous mechanism can avoid halting problem by setting up various levels of abstractions, so that decisions can be reached within the domain of defined vocabulary, often known as the domain of partially ordered set. The original concepts of such sound decision procedures can be traced back to Dana Scott<ref>{{:Paper/Outline of a Mathematical Theory of Computation}}</ref> and Patrick & Radhia Cousot's work on <ref>Patrick Cousot & Radhia Cousot.
[[wikipedia:Abstract interpretation|Abstract interpretation]]: a unified lattice model for static analysis of programs by construction or approximation of fixpoints.
[[wikipedia:Abstract interpretation|Abstract interpretation]]: a unified lattice model for static analysis of programs by construction or approximation of fixpoints.
In Conference Record of the Sixth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 238—252, Los Angeles, California, 1977. ACM Press, New York.</ref> [[wikipedia:Abstract interpretation|Abstract interpretation]].
In Conference Record of the Sixth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 238—252, Los Angeles, California, 1977. ACM Press, New York.</ref> [[Abstract Interpretation]].




Line 20: Line 20:
For starters, please watch a presentation on the history of [[wikipedia:Double entry bookkeeping|Double entry bookkeeping]], titled: [https://www.youtube.com/watch?v=jmVfDbqRxKo Monks, Maths and Magic], by [https://www.janegleesonwhite.com Jane Gleeson White].
For starters, please watch a presentation on the history of [[wikipedia:Double entry bookkeeping|Double entry bookkeeping]], titled: [https://www.youtube.com/watch?v=jmVfDbqRxKo Monks, Maths and Magic], by [https://www.janegleesonwhite.com Jane Gleeson White].


{{#ev:youtube|https://www.youtube.com/watch?v=jmVfDbqRxKo|||||start=100&end=103}}
{{#widget:YouTube
|id= hP3ENPc8Jf0
|width= 900
|height=500
}}|https://www.youtube.com/watch?v=jmVfDbqRxKo|||||start=100&end=103}}


=Lecture Notes=
=Lecture Notes=
Line 27: Line 31:
{{#widget:Google Presentation|docid= 1p6LjD_veyIwZ_U6S1mS3OBlOEC9WMuLsiGlLDCvYni8|size=medium}}
{{#widget:Google Presentation|docid= 1p6LjD_veyIwZ_U6S1mS3OBlOEC9WMuLsiGlLDCvYni8|size=medium}}


=References=
{{#widget:Google Presentation|docid=1S-izT-XysKuLwjB1zsHXVEEW-sjt4afp|size=medium}}
 
{{#widget:Google Presentation|docid=1ngtbIXWA9o5FgYUPxleRTKJMj8kYHDi_k4seOUZorcU|size=medium}}


{{#widget:Google Presentation|docid=1SLnWglKRvFM6ifCZxiJ6CpkS6YP3n3Mg|size=medium}}


[[hasSecureProperty::http://thewiki.us]]
=References=
[[hasSecureProperty::mySignature]]
[[hasSecureProperty::myPublicKey]]

Latest revision as of 05:05, 13 January 2024

TEST, especially data content that is verified by trusted parties, defines the accountability of participants in this inter-connected world, therefore, becomes the binding force in exercising social contracts.


The Goal

Establish up a rigorous reasoning mechanism to ensure all judgements are based on a known set of rules. All rules are also encoded as immutable data, so that all decisions can be traced and justified with respect to these rules. This rigorous mechanism can avoid halting problem by setting up various levels of abstractions, so that decisions can be reached within the domain of defined vocabulary, often known as the domain of partially ordered set. The original concepts of such sound decision procedures can be traced back to Dana Scott[1] and Patrick & Radhia Cousot's work on [2] Abstract Interpretation.


Professor Sandy Pentland and others had published a paper titled Personal Data: The Emergence of a New Asset Class[3]. He is also the founder of the software called: OPAL for Open Algorithm.

Some relevant papers and online articles can be found here[4]:

Data Governance

History of Data Governance

The Notion of Key-Value Pairs

For starters, please watch a presentation on the history of Double entry bookkeeping, titled: Monks, Maths and Magic, by Jane Gleeson White.

|https://www.youtube.com/watch?v=jmVfDbqRxKo%7C%7C%7C%7C%7Cstart=100&end=103}}

Lecture Notes

The following Google Presentation is the slide set for: Intro to Thread 5:ICT Awareness and Competency in Data Governance.

References

  1. ↑ Scott, Dana (January 1, 1970). "Outline of a Mathematical Theory of Computation". local page: Oxford University Computing Laboratory Programming Research Group. 
  2. ↑ Patrick Cousot & Radhia Cousot. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Conference Record of the Sixth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 238—252, Los Angeles, California, 1977. ACM Press, New York.
  3. ↑ World Economic Forum, Personal Data: The Emergence of a New Asset Class, 2011, URL:http://www3.weforum.org/docs/WEF_ITTC_PersonalDataNewAsset_Report_2011.pdf, last accessed: May 4, 2021
  4. ↑ Virginia Collins,Managing Data as an Asset, https://www.cpajournal.com/2019/06/24/managing-data-as-an-asset/#:~:text=Because%20data%20is%20an%20intangible,as%20the%20asset%20it%20is.&text=Organizations%20must%20begin%20managing%20data,from%20it%20as%20real%20assets.,The CPA Journal ,June 2019 Issue
Retrieved from "https://pkc.pub/index.php?title=Data_is_the_asset&oldid=40283"