A Dynamic Tree Structure for Hierarchical On-Chain Asset Management
- URL: http://arxiv.org/abs/2412.06026v1
- Date: Sun, 08 Dec 2024 18:58:28 GMT
- Title: A Dynamic Tree Structure for Hierarchical On-Chain Asset Management
- Authors: Mojtaba Eshghie, Gustav Andersson Kasche,
- Abstract summary: Sarv is a novel non-monolithic blockchain-based data structure designed to represent hierarchical relationships between digitally representable components.
Our approach leverages a tree-based data structure to accurately reflect products and their sub-components, enabling functionalities such as modification, disassembly, borrowing, and refurbishment.
The uniqueness of Sarv lies in its compact and non-monolithic architecture, its mutability, and a two-layer action authorization scheme.
- Score: 1.6114012813668932
- License:
- Abstract: In this paper, we introduce the Sarv, a novel non-monolithic blockchain-based data structure designed to represent hierarchical relationships between digitally representable components. Sarv serves as an underlying infrastructure for a wide range of applications requiring hierarchical data management, such as supply chain tracking, asset management, and circular economy implementations. Our approach leverages a tree-based data structure to accurately reflect products and their sub-components, enabling functionalities such as modification, disassembly, borrowing, and refurbishment, mirroring real-world operations. The hierarchy within Sarv is embedded in the on-chain data structure through a smart contract-based design, utilizing Algorand Standard Assets (ASAs). The uniqueness of Sarv lies in its compact and non-monolithic architecture, its mutability, and a two-layer action authorization scheme that enhances security and delegation of asset management. We demonstrate that Sarv addresses real-world requirements by providing a scalable, mutable, and secure solution for managing hierarchical data on the blockchain.
Related papers
- HDT: Hierarchical Document Transformer [70.2271469410557]
HDT exploits document structure by introducing auxiliary anchor tokens and redesigning the attention mechanism into a sparse multi-level hierarchy.
We develop a novel sparse attention kernel that considers the hierarchical structure of documents.
arXiv Detail & Related papers (2024-07-11T09:28:04Z) - Adaptive Restructuring of Merkle and Verkle Trees for Enhanced Blockchain Scalability [28.727306785987537]
We propose an adaptive restructuring of Merkle and Verkle trees, fundamental components of blockchain architecture.
Unlike traditional static tree structures, our adaptive model dynamically adjusts the configuration of these trees based on usage patterns.
This study's implications extend beyond theoretical advancements, offering a scalable, secure, and efficient method for blockchain data verification.
arXiv Detail & Related papers (2024-03-01T09:52:50Z) - Serving Deep Learning Model in Relational Databases [70.53282490832189]
Serving deep learning (DL) models on relational data has become a critical requirement across diverse commercial and scientific domains.
We highlight three pivotal paradigms: The state-of-the-art DL-centric architecture offloads DL computations to dedicated DL frameworks.
The potential UDF-centric architecture encapsulates one or more tensor computations into User Defined Functions (UDFs) within the relational database management system (RDBMS)
arXiv Detail & Related papers (2023-10-07T06:01:35Z) - Cooperative Multi-Agent Reinforcement Learning for Inventory Management [0.5276232626689566]
Reinforcement Learning (RL) for inventory management is a nascent field of research.
We present a system with a custom GPU-parallelized environment that consists of one warehouse and multiple stores.
We achieve a system that outperforms standard inventory control policies.
arXiv Detail & Related papers (2023-04-18T06:55:59Z) - Implant Global and Local Hierarchy Information to Sequence based Code
Representation Models [25.776540440893257]
We analyze how the complete hierarchical structure influences the tokens in code sequences and abstract this influence as a property of code tokens called hierarchical embedding.
We propose the Hierarchy Transformer (HiT), a simple but effective sequence model to incorporate the complete hierarchical embeddings of source code into a Transformer model.
arXiv Detail & Related papers (2023-03-14T12:01:39Z) - Hierarchical Decentralized Deep Reinforcement Learning Architecture for
a Simulated Four-Legged Agent [0.0]
In nature, control of movement happens in a hierarchical and decentralized fashion.
We present a novel decentral, hierarchical architecture to control a simulated legged agent.
arXiv Detail & Related papers (2022-09-21T07:55:33Z) - CircleChain: Tokenizing Products with a Role-based Scheme for a Circular
Economy [0.5138012450471438]
In a circular economy, tracking the flow of second-life components for quality control is critical.
We propose a role-based token management scheme, which can achieve authentication, synthesis, circulation, and reuse of these second-life components.
The proposed scheme achieves fine-grained and scalable second-life component management, but also enables on-chain trading, subsidies, and green-bond issuance.
arXiv Detail & Related papers (2022-05-23T11:43:31Z) - Use All The Labels: A Hierarchical Multi-Label Contrastive Learning
Framework [75.79736930414715]
We present a hierarchical multi-label representation learning framework that can leverage all available labels and preserve the hierarchical relationship between classes.
We introduce novel hierarchy preserving losses, which jointly apply a hierarchical penalty to the contrastive loss, and enforce the hierarchy constraint.
arXiv Detail & Related papers (2022-04-27T21:41:44Z) - Policy Architectures for Compositional Generalization in Control [71.61675703776628]
We introduce a framework for modeling entity-based compositional structure in tasks.
Our policies are flexible and can be trained end-to-end without requiring any action primitives.
arXiv Detail & Related papers (2022-03-10T06:44:24Z) - Auto-Panoptic: Cooperative Multi-Component Architecture Search for
Panoptic Segmentation [144.50154657257605]
We propose an efficient framework to simultaneously search for all main components including backbone, segmentation branches, and feature fusion module.
Our searched architecture, namely Auto-Panoptic, achieves the new state-of-the-art on the challenging COCO and ADE20K benchmarks.
arXiv Detail & Related papers (2020-10-30T08:34:35Z) - Dual-constrained Deep Semi-Supervised Coupled Factorization Network with
Enriched Prior [80.5637175255349]
We propose a new enriched prior based Dual-constrained Deep Semi-Supervised Coupled Factorization Network, called DS2CF-Net.
To ex-tract hidden deep features, DS2CF-Net is modeled as a deep-structure and geometrical structure-constrained neural network.
Our network can obtain state-of-the-art performance for representation learning and clustering.
arXiv Detail & Related papers (2020-09-08T13:10:21Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.