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

Validation of an information model for inspection with CMM

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.

Feature recognition, integrated with design-by-features, has the potential to support a multiple-view CAD environment, allowing the representation of different feature-based models, that are meaningful for different contexts. They represent a vital step in the direction of product modelling in Concurrent Engineering. In this paper we present a flexible feature recognition system, in which topological, morphological and geometric information is processed at different levels of detail, providing the user with a mechanism that can be tuned to application needs.

CAPE -- which stands for Checkpointing Aided Parallel Execution -- has demonstrated to be a high-performance and compliant OpenMP implementation for distributed memory systems. CAPE is based on the use of checkpoints to automatically distribute jobs of OpenMP parallel constructs to distant machines and to automatically collect the calculated results on these machines to the master machine. However, on the current version, the data exchange on networks use manual sockets that require time to establish connections between machines for each parallel construct. Furthermore, this technique is not really reliable due to the risk of conflicts on ports and the problem of data exchange using stream. This paper aims at presenting the impact of using MPI to improve the reliability and the performance of CAPE. Both socket and MPI implementations are analyzed and discussed, and performance evaluations are provided.

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.

Crowd counting has been a long-standing task in surveillance video analysis. Most of existing methods focus on a single-view setting. Crowd counting with multiple views can provide richer and complementary information across views. However, the task is still inadequately explored in the literature. Previous works have attempted either to project each camera view onto a common geometric 2-D ground-plane and estimate crowd density map through aggregation [1], or set up connections among all pixel pairs [2]. However, registering a local view to the global ground-plane is error-prone and fails to explicitly model the critical inter-view correlation. Full inter-pixel connections inevitably lead to explosion of parameters. To solve these problems, in this paper, we propose an efficient module that effectively does the job of cross-view fusion by directly modeling the correlation between each pair of views. More specifically, to distill and transfer all useful information from multiple sources views to a target camera view, we factorize the full transformation into a generic-fusion component that encodes all geometric / semantic information of this target view, and a view-specific affine-transform component that encodes the scene geometry / semantics cues of specific source view. This factorization significantly reduces the parameter redundancy and enables plug-and-play of new cameras. Extensive experiments on three multi-view counting datasets (PETS2009, DukeMTMC, and CityStreet) clearly and consistently demonstrate the superiority of the proposed method.

Semantic data has semantic information about the relationship between information and resources of data collected in a smart city so that all different domains and data can be organically connected. Various services using semantic data such as public data integration of smart cities, semantic search, and linked open data are emerging, and services that open and freely use semantic data are also increasing. By using semantic data, it is possible to create a variety of services regardless of platform and resource characteristics. However, despite the many advantages of semantic data, it is not easy to use because it requires a high understanding of semantics such as SPARQL. Therefore, in this paper, we propose a semantic framework for users of semantic data so that new services can be created without a high understanding of semantics. The semantics framework includes a template-based annotator that supports automatically generating semantic data based on user input and a semantic REST API that allows you to utilize semantic data without understanding SPAROL.

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.

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.

In order to combine advantages of real-time operating systems implementing the time-triggered (TT) execution model and model-based design frameworks, we aim at proposing a correct-by-design methodology that derives correct TT implementations from high-level models. This methodology consists of two main steps: (1) transforming the high-level model into an intermediate model which respects the TT communication principles and where all communications between components are simple send/receive interactions, and (2) transforming the obtained intermediate model into the programming language of the target platform. In this paper, we focus on the presentation of the transformational methodology of the first step of this design flow. This methodology produces a correct-by-construction TT model by starting from a high-level model of the application software in behaviour, interaction, priority (BIP). BIP is a component-based framework with formal semantics that rely on multiparty interactions for synchronizing components. Commonly in TT implementations, tasks interact with each other through a communication medium. Our methodology transforms, depending on a user-defined task mapping, high-level BIP models where communication between components is strongly synchronized, into TT model that integrates a communication medium. Thus, only inter-task communications and components participating in such interactions are concerned by the transformation process. We also provide correctness proofs of the transformation and apply it on an industrial case study.

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.

Integration methodology for feature-based modeling and recognition

Integration of all engineering related information in a single complex product model is one of the main purposes in computer system based engineering activities. Because engineering process highly depends on product development and application projects, its definition was first realized in product modeling environments at the application of product data management (PDM) systems. However, this administrative solution could not be integrated with the content of product descriptions. As a contribution to efforts for integration of engineering process definitions in product model, work in a recent research project theoretically grounded the definition of engineering process entities and their connections with product model entities. The author of this paper participated at that project and considered practical points of view in order to reveal possibilities for the implementation of the proposed method in industrial product modeling environments. This paper introduces an analysis on the role of product model in engineering process and characteristics of processes for engineering process definition. Following this, it discusses definition, integration, coordination, content, product, and background related resources of engineering process definition in product model.

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.