A computable framework for accountable data assets

From PKC
Jump to navigation Jump to search

Synoposis

This article prescribes an algebraic approach to manipulate data content in a unifying data abstraction framework. It uniquely integrates multiple fields of technical knowledge, including an algebraic formulation of data structures, a software architecture that maps these these data structures to existing, industrial strength software development and deployment tools, and a human-in-the-loop workflow model that is compatible with this algebraic model of data dissemination.

This computational framework can be thought of as an highly automated and mechanized accounting system for managing data assets on the web. In other words, this article will define the data capture and data verification procedure as an algebraically-formulated accounting process, so that it can leverage the mathematical rigor of reasoning about integrity of data, at the same time, provide an implementation specification to the construction of industry-strength data processing and workflow automation system.

Background

Since the appearance of World Wide Web in 1995, the world has been transformed by ever-faster electronic data transaction activities. This revolutionary software artifact presented many business opportunities and inspired many new technologies, however methods and tools to ensure their system integrity have not yet caught up with these changes.

  1. Complex software applications and business processes that have been serving a large portion of the society are searching for systematic ways to migrate to modern technical infrastructures.
these algebraic formulation of accounting systems has

According to Rambaud and Pérez[1][2], an algebraically-defined accounting (data capture and verification) practice may systematically automate the decision procedures for the following activities:

  1. Decide how to classify the data collected and send the collected data to relevant data processing workflows.
  2. Whether a given data set is considered admissible or not. This is judged in terms of its data formats and legal value ranges.
  3. Whether a transaction process is allowable, or not. This include whether a given transaction is feasible, in relevant operational/business logics.


Ownership associated with Accounts

Data Content that represent Decision Procedures

The Control Structure(If/Then/Else)

Computable Data Types

It is been defined axiomatically that all computable data types are Partially-ordered sets.

Lattices and Partially Ordered Sets

Composition and Decomposition

The Notion of Closure offered by Algebra

Applications in ICT System Development

Conclusion

Ensure System Integrity at multiple temporal cycles

Rigorous practice in Constructing and Deconstructing Data-Intensive Systems

Boosting producitivy in Software Development

Direct societal-scale applications as Integrated Data Processing Workflows

References

  1. ↑ Rambaud, Salvador Cruz; Pérez, José García; Nehmer, Robert A.; Robinson, Derek J S Robinson (2010). Algebraic Models for Accounting Systems. local page: Cambridge at the University Press. ISBN 978-981-4287-11-1. 
  2. ↑ Rambaud, Salvador Cruz; Pérez, José García (2005). "The Accounting System as an Algebraic Automaton". INTERNATIONAL JOURNAL OF INTELLIGENT SYSTEMS. local page: Wiley Periodicals, Inc. 20: 827–842. 

Related Pages

Retrieved from "https://pkc.pub/index.php?title=A_computable_framework_for_accountable_data_assets&oldid=30087"