Component Matching as a Graph Matching Problem

• URL: http://arxiv.org/abs/2407.17273v1
• Date: Wed, 24 Jul 2024 13:39:26 GMT
• Title: Component Matching as a Graph Matching Problem
• Authors: Suresh Kamath,
• Abstract summary: Category theory is the formal language to unify the business and IT worlds. The concept of pseudo-category was then utilized to represent the business and application architecture specifications. The linkages between them is now established using the matching of the business component contracts with the application component contracts.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: The development of an IT strategy and ensuring that it is the best possible one for business is a key problem many organizations face. This problem is that of linking business architecture to IT architecture in general and application architecture specifically. In our earlier work we proposed Category theory as the formal language to unify the business and IT worlds with the ability to represent the concepts and relations between the two in a unified way. We used rCOS as the underlying model for the specification of interfaces, contracts, and components. The concept of pseudo-category was then utilized to represent the business and application architecture specifications and the relationships contained within. Contracts are used for the specification of both IT and Business architecture components. The linkages between them is now established using the matching of the business component contracts with the application component contracts. Typically, the matching was based on manual process, in this paper we extend the work by considering automated component matching process. In this paper we provide implementation of the matching process using graph matching.

Related papers

• Component Matching Approach in Linking Business and Application Architecture [0.0]
  We proposed Category theory as the formal language to unify the business and IT worlds. We used rCOS as the underlying model for the specification of interfaces, contracts, and components. The linkages between them now can be established using the matching of the business component contracts with the application component contracts.
  arXiv  Detail & Related papers  (2024-06-08T14:18:00Z)
• 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)
• Introduction and Assessment of the Addition of Links and Containers to the Blackboard Architecture [0.0]
  This paper proposes and evaluates the inclusion of containers and links in the Blackboard Architecture. These objects are designed to allow them to model organizational, physical, spatial and other relationships.
  arXiv  Detail & Related papers  (2023-06-07T09:41:46Z)
• Extension of the Blackboard Architecture with Common Properties and Generic Rules [0.76146285961466]
  The Blackboard Architecture provides a mechanism for embodying data, decision making and actuation. It lacks the capability to directly model organizational, spatial and other relationships. This paper presents and assesses two additional concepts to add to the Blackboard Architecture: common properties and generic rules.
  arXiv  Detail & Related papers  (2023-06-07T09:40:13Z)
• Enterprise Model Library for Business-IT-Alignment [0.0]
  This work is the reference architecture of a repository for models with function of reuse. It includes the design of the data structure for filing, the processes for administration and possibilities for usage.
  arXiv  Detail & Related papers  (2022-11-21T11:36:54Z)
• 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)
• Federated Learning with Heterogeneous Architectures using Graph HyperNetworks [154.60662664160333]
  We propose a new FL framework that accommodates heterogeneous client architecture by adopting a graph hypernetwork for parameter sharing. Unlike existing solutions, our framework does not limit the clients to share the same architecture type, makes no use of external data and does not require clients to disclose their model architecture.
  arXiv  Detail & Related papers  (2022-01-20T21:36:25Z)
• CateCom: a practical data-centric approach to categorization of computational models [77.34726150561087]
  We present an effort aimed at organizing the landscape of physics-based and data-driven computational models. We apply object-oriented design concepts and outline the foundations of an open-source collaborative framework.
  arXiv  Detail & Related papers  (2021-09-28T02:59:40Z)
• Enterprise Architecture Model Transformation Engine [0.0]
  This paper presents a transformation engine to convert enterprise architecture models between several languages. The transformation process is defined by various pattern matching techniques using a rule-based description language. It uses set theory and first-order logic for an intuitive description as a basis.
  arXiv  Detail & Related papers  (2021-08-15T11:10:42Z)
• Coordination Among Neural Modules Through a Shared Global Workspace [78.08062292790109]
  In cognitive science, a global workspace architecture has been proposed in which functionally specialized components share information. We show that capacity limitations have a rational basis in that they encourage specialization and compositionality.
  arXiv  Detail & Related papers  (2021-03-01T18:43:48Z)
• Bidirectional Graph Reasoning Network for Panoptic Segmentation [126.06251745669107]
  We introduce a Bidirectional Graph Reasoning Network (BGRNet) to mine the intra-modular and intermodular relations within and between foreground things and background stuff classes. BGRNet first constructs image-specific graphs in both instance and semantic segmentation branches that enable flexible reasoning at the proposal level and class level.
  arXiv  Detail & Related papers  (2020-04-14T02:32:10Z)

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.