Now showing 1 - 4 of 4
  • Publication
    International Data Spaces. Reference architecture for the digitization of industries
    The International Data Space (IDS) offers an information technology architecture for safeguarding data sovereignty within the corporate ecosystem. It provides a virtual space for data where data remains with the data owner until it is needed by a trusted business partner. When the data is shared, terms of use can be linked to the data itself. Analysis of six use cases from the first phase of the prototype implementation of the IDS architecture shows that the focus lies on the standardized interface, the information model for describing data assets, and the connector component. Further use cases are planned for the next wave of implementation that are based on the broker functionality and require the use of vocabularies for simple data integration. In addition, companies need to standardize the principles that are translated into the terms of use. These principles need to be shaped, described, documented, and implemented in a simple and understandable way. They also need to be understood in the same way by different actors in the corporate ecosystem, thus requiring semantic standardization. Furthermore, the IDS Reference Architecture Model needs to be set in context with respect to related models. In the F3 use case, an OPC UA adapter is used. Additional use cases for integration with the Plattform Industrie 4.0 administration shell and Industrial Internet Reference Architecture are pending. The IDS Architecture is also increasingly being utilized in so-called verticalization initiatives, in healthcare and in the energy sector for example. These kinds of initiatives - like the Materials Data Space - demonstrate the crossdomain applicability of the architectural components and provide information about further development needs. Finally, in anticipation of the future development of the use cases and utilization of the IDS, work on the economic valuation of data and on the settlement and pricing of data transactions must be accelerated.
  • Publication
    Listing closed sets of strongly accessible set systems with applications to data mining
    We study the problem of listing all closed sets of a closure operator a that is a partial function on the power set of some finite ground set E, i.e., sigma : F -> F with F subset of P(E). A very simple divide-and-conquer algorithm is analyzed that correctly solves this problem if and only if the domain of the closure operator is a strongly accessible set system. Strong accessibility is a strict relaxation of greedoids as well as of independence systems. This algorithm turns out to have delay O (vertical bar E vertical bar (T-F + T-sigma + vertical bar E vertical bar)) and space O (vertical bar E vertical bar + S-F + S-sigma), where T-F, S-F, T-sigma, and S-sigma are the time and space complexities of checking membership in F and computing a, respectively. In contrast, we show that the problem becomes intractable for accessible set systems. We relate our results to the data mining problem of listing all support-closed patterns of a dataset and show that there is a corresponding closure operator for all datasets if and only if the set system satisfies a certain confluence property.