Improving the Reliability and the Performance of CAPE by Using MPI for Data Exchange on Network

Design and engineering process integration through a multiple view intermediate modeller in a distributed object-oriented system environment

The increasing popularity of the Web of Data is motivating the need to integrate semantic-web ontologies. Data exchange is one integration approach that aims to populate a target ontology using data that come from one or more source ontologies. Currently, there exist a variety of systems that are suitable to perform data exchange among these ontologies; unfortunately, they have uneven performance, which makes it appealing assessing and ranking them from an empirical point of view. In the bibliography, there exist a number of benchmarks, but they cannot be applied to this context because they are not suitable for testing semantic-web ontologies or they do not focus on data exchange problems. In this paper, we present MostoBM, a benchmark for testing data exchange systems in the context of such ontologies. It provides a catalogue of three real-world and seven synthetic data exchange patterns, which can be instantiated into a variety of scenarios using some parameters. These scenarios help to analyze how the performance of data exchange systems evolves as the exchanging ontologies are scaled in structured and/or data. Finally, we provide an evaluation methodology to compare data exchange systems side by side and to make informed and statistically sound decisions regarding: 1) which data exchange system performs better; and 2) how the performance of a system is influenced by the parameters of our benchmark.

Data exchange deals with inserting data from one database into another database having a different schema. Fagin et al. [2005] have shown that among the universal solutions of a solvable data exchange problem, there exists—up to isomorphism—a unique most compact one, “the core”, and have convincingly argued that this core should be the database to be materialized. They stated as an important open problem whether the core can be computed in polynomial time in the general setting where the mapping between the source and target schemas is given by source-to-target constraints that are arbitrary tuple generating dependencies (tgds) and target constraints consisting of equality generating dependencies (egds) and a weakly acyclic set of tgds. In this article, we solve this problem by developing new methods for efficiently computing the core of a universal solution. This positive result shows that data exchange based on cores is feasible and applicable in a very general setting. In addition to our main result, we use the method of hypertree decompositions to derive new algorithms and upper bounds for query containment checking and computing cores of arbitrary database instances. We also show that computing the core of a data exchange problem is fixed-parameter intractable with respect to a number of relevant parameters, and that computing cores is NP-complete if the rule bodies of target tgds are augmented by a special predicate that distinguishes a null value from a constant data value.

Nowadays artificial intelligence and swarm robotics become wide spread and take their approach in civil tasks. The main purpose of the article is to show the influence of common knowledge about surroundings sharing in the robotic group navigation problem by implementing the data transferring within the group. Methodology provided in article reviews a set of tasks implementation of which improves the results of robotic group navigation. The main questions for the research are the problems of robotics vision, path planning, data storing and data exchange. Article describes the structure of real-time laser technical vision system as the main environment-sensing tool for robots. The vision system uses dynamic triangulation principle. Article provides examples of obtained data, distance-based methods for resolution and speed control. According to the data obtained by provided vision system were decided to use matrix-based approach for robots path planning, it inflows the tasks of surroundings discretization, and trajectory approximation. Two network structure types for data transferring are compared. Authors are proposing a methodology for dynamic network forming based on leader changing system. For the confirmation of theory were developed an application of robotic group modeling. Obtained results show that common knowledge sharing between robots in-group can significantly decrease individual trajectories length.

With the maturity of Internet of Vehicles (IoV) technology and blockchain technology, numerous application scenarios have emerged, including urban Internet of Vehicles, Highway Internet of Vehicles, and Specific Area Internet of Vehicles. However, the urban Internet of Vehicles systems face data security and operational mode discretization challenges. To address these issues, we propose a data security cross-chain model for the urban Internet of Vehicles. Our model utilizes hash time lock contracts to exchange data between vehicles of the same brand and model but located in different urban areas. It also uses trusted relay chains to facilitate data exchange between vehicles of the same brands but varying models within the same urban area, thus solving the problem of difficult inter-system data exchange in the urban Internet of Vehicles. In the urban Internet of Vehicles, the transmitted data encompasses business and general data, which may have varying sensitivities. To ensure data confidentiality, we propose the HR-CP-ABE algorithm, which extends CP-ABE functionalities by incorporating hierarchical decryption and revocable vehicle attributes. And the fine-grained access control by setting different access tree structures and file access validity periods. This guarantees the confidentiality and security of urban data. Finally, experimental results demonstrate that the proposed model effectively satisfies the standards for cross-chain transactions as outlined in the Evaluation Requirements for Blockchain Application Security Technology(DB43/T 1842–2020) and Evaluation Requirements for Blockchain Network Security Technology(DB43/T 1840–2020). Additionally, our model demonstrates enhanced resilience against man-in-the-middle and replay attacks.

Database technology is of great variety, structure diversity, solving data integration and exchanges sharing of the heterogeneous database system have became the important problem in all fields. Because of XML is the very important data exchange technology to realize data exchange and transmission ability, this paper mainly explores the data exchange problem how to use XML in heterogeneous database system, , and .Net platform have good support to XML and heterogeneous database system, so the combination of XML and.net, can realize data exchange of heterogeneous database system.

A wireless mesh network (WMN) comprises of mesh access points (MAPs), mesh routers and mesh clients (MCs), where MAPs are almost static and form the back-bone of WMNs. MCs are wireless devices and dynamic in nature, communicating among themselves over possibly multi-hop paths, with or without the help of MAPs. Security has been a primary concern in order to provide protected communication in WMNs due to the open peer-to-peer network topology, shared wireless medium, stringent resource constraints and highly dynamic environment. These challenges clearly make a case for building multi-layer security solution that achieves both broad protection and desirable network performance. In this paper, we propose a cross-layer secure protocol for routing, data exchange and ARP problems (in case of LAN based upon WMNs). Our protocol is a ticket-based ad hoc on demand distance vector (TAODV) protocol, a secure routing protocol that is based on the design of ad hoc on demand distance vector (AODV) protocol. Due to availability of the backbone, we incorporate the authentication server (AS) for the issuance of tickets which are further used for secure routing, transfer of public keys and MAC addresses in one single step. With the transfer of public keys, source and destination can easily generate their shared secret key based upon fixed Diffie-Hellman key exchange protocol for data encryption and decryption. Our protocol is secure against both active and passive attacks.

Purpose: This paper summarizes and compares the types and interpretations of the basic attributes necessary to enter product data in selected e-commerce platforms. Design/Methodology/Approach: The research methodology was based on an analysis and selection of a reference group of basic product attributes and identification of appropriate market representatives, platforms and tools commonly used in e-commerce. Furthermore, for each of the selected basic attributes of the product, an analysis was made in terms of the presence, mandatory field, and data input validators. The best practices indicated by the platform developers were also reviewed.

Relational schema mappings have been extensively studied in connection with data integration and exchange problems, but mappings between XML schemas have not received the same amount of attention. Our goal is to develop a theory of expressive XML schema mappings. Such mappings should be able to use various forms of navigation in a document, and specify conditions on data values. We develop a language for XML schema mappings, and concentrate on three types of problems: static analysis of mappings, their complexity, and their composition. We look at static analysis problems related to various flavors of consistency: for example, whether it is possible to map some document of a source schema into a document of the target schema, or whether all documents of a source schema can be mapped. We classify the complexity of these problems. We then move to the complexity of mappings themselves, i.e., recognizing pairs of documents such that one can be mapped into the other, and provide a classification based on sets of features used in mappings. Finally we look at composition of XML schema mappings. We study its complexity and show that it is harder to achieve closure under composition for XML than for relational mappings. Nevertheless, we find a robust class of XML schema mappings that have good complexity properties and are closed under composition.

Healthcare providers need to communicate and exchange the clinical and administrative data from Electronic Health Records of patients. The Health Insurance Portability and Accountability Act (HIPAA) of 1996 requires the safeguarding and protection of Electronic Health Records when in transit and in storage. This paper presents a solution to protect Electronic Health Records in both states, in transit and at rest. Our secure data container guarantees data confidentiality and integrity and supports different data formats, including text and images. It can work in environments with limited Internet connectivity, which is important at times of disease pandemics or natural disasters. The potential benefit of this solution for healthcare providers would allow emailing data to patients in the form of our data container without using a HIPAA-compliant email server. This technology supports the ability to send and receive medical record documents, for a single encounter or encounters related to a condition, (1) allowing patient to download and keep their personal health record; (2) sharing continuity of care information with a provider referral to ensure medication reconciliation, for instance, with providers who are outside the information exchange network; and (3) delivering medical records securely to an insurance company who requires notes for a submitted claim. To address the problem of clinical and administrative data exchange between different healthcare providers across multiple networks, states and countries, our methodology allows patients to download and store their Electronic Health Records locally.

The data sharing based on process level network is the development trend of the digitalization of the secondary circuit in smart substation. However, abnormal problems of data transmission such as network storms bring certain hidden dangers to the safe and stable operation of the secondary equipment. In this paper, the main problems affecting the reliability of data transmission are analyzed, and the message management technology based on data flow control is proposed, which can effectively improve the reliability of data transmission. Aiming at the problem of cross-network data exchange, a solution based on cross-network port flow control is also proposed.

We consider the problem of cooperative data exchange in a group of wireless clients. In this problem each client initially holds a subset of packets and needs to obtain all packets held by other clients. Each client can broadcast its own packets or a combinations thereof to other clients via an error-free broadcast channel. Assuming that clients know which packets are available to other clients, our goal is to minimize the total number of transmissions needed to satisfy the demands of all clients. We present a deterministic algorithm that computes an optimal solution to this problem in polynomial time.

The article is devoted to the problem of information exchange between automated systems of situational centers (SC) of the government authorities of the Security and Defence Sector (SDS) of Ukraine. The prob-lem is extremely topical today, since in the event of nationwide threats (military intervention, terrorism, emergencies), the SDS should work as a single well-coordinated mechanism. Therefore, the creation of the SC SDS system and the establishment of information exchange between them is a prerequisite for this. The paper assesses the most common types of data integration in information systems (IS), such as data ware-houses, data federation and service-oriented approach. As the most modern approach to information inter-action of disparate ISs, a service-oriented approach is proposed. It is noted that for data exchange it is inappropriate to get access to “other” IS and independently search for the necessary information there. Alternatively, it is proposed to isolate the data exchange subject area (SbA) from the IS subject areas of various SCs and to determine the topics necessary for the exchange. Next, for each topic, to build a the-matic view of grouped, analytical data by the type of data mart. Such views will become a data source for the corresponding services in SOA and can be used in Publish/Subscribe and Request/Response modes. The paper considers a method and proposes an algorithm for the interaction of ISs of disparate SCs based on the use of the ontology of SbA data exchange and SOA. The MIP4-IES family of data exchange specifi-cations of the NATO Multilateral Interoperability Program (MIP) is taken as an example. On the basis of legislative documents in the field of emergency response, an ontology of data exchange between the IS of the SC in response to emergency situations has been built. Examples of topics and thematic views are given that can be constructed on the basis of the constructed SbA ontology for data exchange.

The State Grid ETL(SG-ETL) tool, based on Extract, Transform and Load(ETL) technology, has important application value in intelligent power data exchange. As an important part of the transmission component in the power grid system, it realizes the data exchange between power systems, but in the process of data exchange, problems are gradually exposed such as unguaranteed data quality and uncontrolled business process. In this respect, this thesis studies the blockchain technology and analyzes its feasibility in the application of intelligent power data exchange, optimizes the power transaction order management business process from the blockchain perspective as example, proposes the Decentralized Transaction credit model based on Blockchain P2P(DTBP) according to the process, and describes its evaluation algorithm, introduces the idea of on the to plan the scheme of data to chain in the data exchange process, designs the smart contract life cycle, formulates contract rules and interface function conventions, uses the JSPIN tool to design the third convention's Promela mode, verifies the data and analyse the result to solve the data exchange problems finally.

To address data management and data exchange problems in the nuclear magnetic resonance (NMR) community, the Collaborative Computing Project for the NMR community (CCPN) created a "Data Model" that describes all the different types of information needed in an NMR structural study, from molecular structure and NMR parameters to coordinates. This paper describes the development of a set of software applications that use the Data Model and its associated libraries, thus validating the approach. These applications are freely available and provide a pipeline for high-throughput analysis of NMR data. Three programs work directly with the Data Model: CcpNmr Analysis, an entirely new analysis and interactive display program, the CcpNmr FormatConverter, which allows transfer of data from programs commonly used in NMR to and from the Data Model, and the CLOUDS software for automated structure calculation and assignment (Carnegie Mellon University), which was rewritten to interact directly with the Data Model. The ARIA 2.0 software for structure calculation (Institut Pasteur) and the QUEEN program for validation of restraints (University of Nijmegen) were extended to provide conversion of their data to the Data Model. During these developments the Data Model has been thoroughly tested and used, demonstrating that applications can successfully exchange data via the Data Model. The software architecture developed by CCPN is now ready for new developments, such as integration with additional software applications and extensions of the Data Model into other areas of research.