Compatibility Verification Research Articles

Efficient and Robust Point Cloud Registration via Heuristics-Guided Parameter Search.

Estimating the rigid transformation with 6 degrees of freedom based on a putative 3D correspondence set is a crucial procedure in point cloud registration. Existing correspondence identification methods usually lead to large outlier ratios (>95% is common), underscoring the significance of robust registration methods. Many researchers turn to parameter search-based strategies (e.g., Branch-and-Bround) for robust registration. Although related methods show high robustness, their efficiency is limited to the high-dimensional search space. This paper proposes a heuristics-guided parameter search strategy to accelerate the search while maintaining high robustness. We first sample some correspondences (i.e., heuristics) and then just need to sequentially search the feasible regions that make each sample an inlier. Our strategy largely reduces the search space and can guarantee accuracy with only a few inlier samples, therefore enjoying an excellent trade-off between efficiency and robustness. Since directly parameterizing the 6-dimensional nonlinear feasible region for efficient search is intractable, we construct a three-stage decomposition pipeline to reparameterize the feasible region, resulting in three lower-dimensional sub-problems that are easily solvable via our strategy. Besides reducing the searching dimension, our decomposition enables the leverage of 1-dimensional interval stabbing at all three stages for searching acceleration. Moreover, we propose a valid sampling strategy to guarantee our sampling effectiveness, and a compatibility verification setup to further accelerate our search. Extensive experiments on both simulated and real-world datasets demonstrate that our approach exhibits comparable robustness with state-of-the-art methods while achieving a significant efficiency boost.

DICOM Standard and Its Application in Radioinformatics

The DICOM standard is the emerging standard in the field of medical informatics. It defines the standard network interface and data model makes the medical image equipment manufacturers on the standard network equipment interconnection, simplify the development of various types of medical image, promote open unrelated to the factory of medical digital image transmission and exchange, prompting the image archiving and communication system of PACS (Picture Archiving and Communication Systems) and the combination of various hospital information system HIS (Hospital Information Systems). Radiation therapy departments in many hospitals have purchased more than one manufacturer of radiotherapy planning systems, and treatment information has to be communicated using DICOM standards. The use of DICOM in radiotherapy is called DICOM RT. At home, doctors are not fully aware of its importance and researchers do not. This paper mainly discusses the implementation and application of DICOM and protocol in precision radiotherapy system. The main contents include: (1) DICOM RT defines a total of seven information objects, which play a pivotal role in the information exchange of radiotherapy system. Discuss the content of DICOM RT; discuss the development of radiotherapy technology at home and abroad. (2) At present, DICOM standard has been widely used in the field of medical informatics, but no authority can provide DICOM compatibility verification of imaging equipment or DICOM application system, which still has many difficulties in system interconnection, that is, the research and implementation of DICOM test method. (3) The application of DICOM in PACS system. (4) Impaired compression study without visual loss in medical images based on DICOM standard.

Augmented Reality-Based BIM Data Compatibility Verification Method for FAB Digital Twin implementation

With the advancement of state-of-the-art technologies, the semiconductor industry plays a key role as an essential component in the manufacture of various electronic products. Since the manufacturing of a semiconductor goes through very sophisticated and complex processes, efficient and accurate work and management are essential in the design, construction, and operation stages of the semiconductor fabrication (FAB) plant. Recently, the combined application of building information modeling (BIM) and augmented reality (AR) technology has gained increased attention in this semiconductor FAB industry as an advanced way to improve work efficiency and accuracy while eliminating other related problems, such as human errors. Despite the perceived benefits of combined use of BIM and AR, many technical problems still exist when integrating the target test model and the 3D virtual object model using BIM data and existing AR visualization technology, due to the unique characteristics of the FAB sites. To solve these problems, this study proposed an AR-based real-time BIM data compatibility verification method for future FAB digital twin implementation and demonstrated that it could be converted into a system and applied to actual FAB sites. As a result of the development and verification of this system, the proposed AR-based real-time BIM data compatibility verification system enables the accurate fitting of the AR model and actual object through AR tracking and anchoring technology considering the characteristics of FAB sites. After the fitting, the system was able to maintain compatibility, even when the camera moved and the marker moved away from the screen. By expanding the effective distance of compatibility between the AR model and the actual object, it was possible to increase the AR application range between the 3D virtual object model and the test target model and to improve the compatibility.

JSON Schemas with Semantic Annotations Supporting Data Translation

As service-oriented architectures are a solution for large distributed systems, interoperability between these systems, which are often heterogeneous, can be a challenge due to the different syntax and semantics of the exchanged messages or even different data interchange formats. This paper addresses the data interchange format and data interoperability issues between XML-based and JSON-based systems. It proposes novel annotation mechanisms to add semantic annotations and complement date values to JSON Schemas, enabling an interoperability approach for JSON-based systems that, until now, was only possible for XML-based systems. A set of algorithms supporting the translation from JSON Schema to XML Schema, JSON to XML, and XML to JSON is also proposed. These algorithms were implemented in an existing prototype tool, which now supports these systems’ interoperability through semantic compatibility verification and the automatic generation of translators.

Modelling and verifying time‐aware processes for cyber‐physical environments

Cyber-physical systems (CPSs) are characterized by a multitude of physical and software. Particularly time-related properties are of paramount importance and they can impact the behaviour of these systems. Designing and verifying CPS while tackling time-related and physical properties are very important steps in the CPS life cycle development. Indeed, it is necessary to capture and characterize the different features and their dependencies with time through expressive models. Then, these models must be verified to prove their correctness. Existing process modelling languages such as business process modelling notation (BPMN) has been widely used to model business processes. However, BPMN lacks several features for modelling rich CPS processes such as those related to time and physical properties. In this study, the authors propose a verification framework for collaborative time-aware CPS processes. In this context, they propose to extend BPMN to support the various CPS concepts and properties. Based on this extension, they propose a consistency verification approach, which aims to verify that the time-related and physical properties associated with each process do not give rise to conflicts. Finally, they propose a compatibility verification approach, which aims to verify that the set of involved CPS processes form consistent inter-CPS processes.

SysML model-driven approach to verify blocks compatibility

In the component paradigm, the system is seen as an assembly of heterogeneous components, where the system reliability depends on these components compatibility. In our approach, we focus on verifying compatibility of components modelled with SysML diagrams. Thus, we model component interactions with sequence diagrams (SDs) and components with SysML blocks. The SDs constitutes a good start point for compatibility verification. However, this verification is still inapplicable directly on SDs, because they are expressed in informal language. Thus, to apply a verification method, it is necessary to translate the SDs into formal models, and then verify the wanted properties. In this paper, we propose a high-level model-driven approach which consists of an ATL grammar that automates the transformation of SDs into interface automata. Also, to allow an easy use of Ptolemy tool to verify properties on automata, we have proposed some Acceleo templates, which generate the Ptolemy entry specification.

A Study on the Anti-Corrosion Paint(EH 2350) Compatibility Verification for Naval Surface Vessels's Cavitation

A Study on the Anti-Corrosion Paint(EH 2350) Compatibility Verification for Naval Surface Vessels's Cavitation

SysML model-driven approach to verify blocks compatibility

In the component paradigm, the system is seen as an assembly of heterogeneous components, where the system reliability depends on these components compatibility. In our approach, we focus on verifying compatibility of components modelled with SysML diagrams. Thus, we model component interactions with sequence diagrams (SDs) and components with SysML blocks. The SDs constitutes a good start point for compatibility verification. However, this verification is still inapplicable directly on SDs, because they are expressed in informal language. Thus, to apply a verification method, it is necessary to translate the SDs into formal models, and then verify the wanted properties. In this paper, we propose a high-level model-driven approach which consists of an ATL grammar that automates the transformation of SDs into interface automata. Also, to allow an easy use of Ptolemy tool to verify properties on automata, we have proposed some Acceleo templates, which generate the Ptolemy entry specification.

Features of Business Creation in the Virtual Space

This article addresses the development of methodological bases of on-line business organization, as this type of business has distinguishing features from traditional business. The purpose of the researh is to find out the key features and advantages of on-line business, offer a model of a step-by-step plan of business creation in the virtual space, which could be proposed to the use in different niches. The article was written with the application of the methods of critical analysis of scientific literature and Internet sources, practical experience, supervision, abstracting, generalization, deduction and induction, ascent from abstract to concrete, system analysis, structural analysis and synthesis, and simulation.The offered plan template consists of seven stages: the first stage is the determination of business foundation. This stage consists of formation of the general picture of on-line business is foreseen, the choice of the niche on the basis of intellectual maps and concept of Ikigai, determination of the plan of the project development (terms and resources), juridical and organizational infrastructure of the selected niche. The second stage defines the building of partner relationships between the participants of business: search of an expert/producer, framework of co-operation and financial relationships, compatibility verification, conclusion of the agreement. The third stage determines the business-model that contains construction of business-model canvas by Osterwalder and Pigneur, description and creation of the conception of the product of S. E. R. (System, Exclusive, Registered), and development of the financial plan and the team development plan. The fourth stage consists in determination of architectonics of the product and includes research of the target audience and market, creation of the unique selling proposition, definition of liabilities to clients, gamification, group dynamics, formation of sales presentation, templates of page of subscription, and letters-suggestions. The fifth stage – the start of publicity campaign and determination of framework of sales – consists of the preliminarys announcements, presentations, paid traffic, free traffic, lead-magnet, partner sites, analytics, key blocks, work with objections, comments, and guarantees. The sixth stage – support of publicity campaign through social network sites – contains SMM-advancement in social network, context advertising, target advertising in social network sites, chat-bots. The seventh stage includes formation of repeated purchases strategies: Up-sell, Crosssell, Reccurent, and start of a new product. For every stage, a certain list of actions is defined that the owner of on-line business must realize in order to achieve the effective start in the virtual space.The offered method of business start can be used for determination of the right niche, competitive benefits of the on-line product, development and estimation of the efficiency of marketing influence on the consumer in the process of decision-making about the first and repeated purchases, determination of the on-line advancement strategy of the product and leader positions taking in the virtual space.Thereafter, the use of the plan template of the start of business in the virtual space will allow the companies to use both a preventive market orientation and a market orientation with the reverse connection more effectively, observing consumer preferences, creating new products or services, and perfecting internal processes directed on the increasing of consumer needs understanding in development of new products and services, and as a result achieving the leadership in the selected niche of market.Article received 2.05.2018

Extended Semantic Annotations for Generating Translators in the Arrowhead Framework

In order to create distributed automation systems, it is required to ensure their interoperability; however, ensuring interoperability between heterogeneous systems (using different communication protocols, data formats, and semantics) is a challenging task. Among many interoperability challenges, this paper addresses issues concerning semantic and data interoperability, namely, it provides a contribution to support the semantic compatibility verification and the generation of translators for XML messages. Translators are generated based on XML-schemas that are annotated with a reference ontology. We base our annotations on an extension of an existing declarative annotation method. In particular, our extension explicitly addresses ambiguities of annotations, schema instance mismatches, and coverage mismatches that frequently occur on Internet-of-things message schemas. We have evaluated our approach based on a set of interaction scenarios from the domain of the Arrowhead Project. A tool prototype that supports the semantic compatibility verification and the generation of XML translators is available at http://gres.uninova.pt/tag/ .

Tools for Symbol Development – Safety Symbol Response Taxonomy and Graphic Compatibility Verification

Symbols and graphics are often used in place of or in combination with word messages in product information. This paper discusses two development tools in the context of safety symbols and warnings. The first tool is a detailed Safety Symbol Response Taxonomy that allows richer analysis of open-ended comprehension testing responses than that provided by the “correct/wrong/wrong with opposite meaning” coding used when determining if a symbol meets ISO 9186-1 criteria of acceptability. This is useful in targeting improvements as well as selecting between variants that otherwise appear to have similar results. The second tool is a method for verifying safety symbols or graphics supplementing warning text are compatible with their associated word messages, including guidance for categorizing open-ended responses. Practical considerations for symbol development and examples are provided.

A Study of the Compatibility Verification about Buffer of Coupler System in Railway Vehicle

The type approval institution of the railway safety law was enforced in 2014. And technical standard for a coupler system what railway parts was enforced in 30th August 2016. Domestic technical standards for railway were developed in accord with international technical standards including TSI criteria. Sub-systems that constitute a coupler should consider compliance and performance through design compatibility, manufacturing conformity and tests according to type approval process and compatibility verification. This study was carried out compatibility verification such as design compatibility, manufacturing conformity and test evaluation about a buffer that is one of components for the coupler system. It was evaluated through strength test, static test, crash test and so on. The result, requirements that obtained from standards and technical specifications of domestic and foreign were demonstrated according to compatibility verification.

Two-dimensional hp adaptive finite element spaces for mixed formulations

One important characteristic of mixed finite element methods is their ability to provide accurate and locally conservative fluxes, an advantage over standard H1-finite element discretizations. However, the development of p or hp adaptive strategies for mixed formulations presents a challenge in terms of code complexity for the construction of H(div)-conforming shape functions of high order on non-conforming meshes, and compatibility verification of the approximation spaces for primal and dual variables (inf–sup condition). In the present paper, a methodology is presented for the assembly of such approximation spaces based on quadrilateral and triangular meshes. In order to validate the computational implementations, and to show their consistent applications to mixed formulations, elliptic model problems are simulated to show optimal convergence rates for h and p refinements, using uniform and non-uniform (non-conformal) settings for a problem with smooth solution, and using adaptive hp-meshes for the approximation of a solution with strong gradients. Results for similar simulations using H1-conforming formulation are also presented, and both methods are compared in terms of accuracy and required number of degrees of freedom using static condensation.

Web Service Compatibility Verification Based on Conflict Interactions

There are more and more composite Web services with complex interactions over the Internet,so how to efficiently and effectively verify their compatibility is important.However,there are two major challenges:compatibility verification should be faster,and the verification should include complete and precise incompatibility interactions.In order to address the two challenges,we propose a compatibility verification approach based on conflict interactions.This approach exploits the behavior constraint relation to verify compatibility.And we prove that this approach is able to reach the agreement with the compatibility defined in the classical research works.Finally,we evaluate our approach with the SAP reference repository,which is used by many research works.Experiments illustrate that our approach outperforms the state-of-the-art on time complexity,and is able to discover complete and precise incompatibility interactions.

Compatibility verification of certified reference materials and user measurements

A problem that frequently occurs in metrology is one of assessing compatibility of data obtained by a user laboratory with the specified values and uncertainty estimates from the certificate of analysis. The user's data are summarized by an estimated measurand value and a confidence interval, which is typically based on a repeatability standard deviation, but may include other variance or bias components. If the lab's interval and the certificate interval do not overlap, or more generally when the ‘no-bias’ hypothesis is rejected, the user may seek guidance on how to confirm this lack of compatibility or how to rectify it. The suggested two-stage statistical approach demonstrates a confidence interval whose width is similar to that of the certificate, and a compatibility test of guaranteed power for the given bias magnitude. Practical computationally simple formulae for each stage sample size are provided.

Research on the dynamic reconfiguration of Web application using two-phase compatibility verification

Implemented by dynamic service composition and integration, Web application has significantly affected our daily life, such as e-commerce and e-government. However, the open and ever-changing environment makes Web users more vulnerable to the usability problem, i.e. unreachable pages and reduced responsiveness. Accordingly, there is a need to deliver reliable Web application with attributes that cover the correctness and reliability. For the efficient handling of failures, the compatibility verification of dynamic reconfiguration strategies is attached great importance since it can guarantee the robustness and high quality of Web-based software. This paper extends the classical finite state machine (FSM) to formalize the behaviour of Web application, namely the extended FSM for Web applications (EFSM4WA) model. This model is also suitable to formally describe the interaction behaviours of dynamic reconfiguration when Web application encountered failure. Then, the compatibility verification of dynamic reconfiguration is carried out in two phases. During the first phase, it adopts the trace projection approach to check the compatibility against the synchronized product model in a qualitative way, which will select a set of candidate Web applications. During the second phase, it takes performance into consideration to choose a high-reliability Web application in a quantitative way. Finally, a case study is demonstrated to show the applicability of our approach.

Required Functions of e-Textbook and Compatibility Verification with ePub Materials

Required Functions of e-Textbook and Compatibility Verification with ePub Materials

Typical Functions of e-Textbook, Implementation, and Compatibility Verification with Use of ePub3 Materials

This paper shows typical functions required on electronic textbooks to be adopted in various countries, trial implementation of these functions, and their verification of representation and behavior in six e-book platforms. First, the authors extracted the functions by checking preceding researches and investigations. The result contains 52 items, including 7 categories of “authentication”, “copyright”, “contents representation”, “related information”, “additional information by learners”, “learning support”, and “restriction of contents and platforms”. Next, these functions were implemented with ePub3 format e-books. ePub3 is going to be one of de jure standard format of e-books. Also, contents representation and behavior of the result ePub e-books were verified on 6 types of e-book platforms on operating systems of iOS, Android, Windows, and Kindle Linux. The verification result shows that iBooks3 on iOS worked best among the 6 e-book readers. Also it shows that many e-book readers support only representation of ePub2 files, while HTML5, JavaScript, and Web API are not supported yet.

Backward compatibility of software interfaces: Steps towards automatic verification

This paper discusses problems of ensuring backward compatibility between new and old versions of software components (e.g., libraries). The Linux environment is considered as the main example. Breach of the compatibility in a new version of a software component may result in crashing or incorrect behavior (at the binary level) or inability to build (at the source level) applications targeted at a previous version of the component when the applications are used with the new version of the component. The paper describes typical issues that cause backward compatibility problems at the binary level and presents a new method for automatic detection of such issues in the course of the component development, with the main attention being focused on changes in structure of interfaces. The C and C++ languages are used to exemplify the approach, although it can be applied to other languages, such as Java or C#, as well. Unlike the existing means, the suggested method can verify a broad spectrum of backward compatibility problems by comparing function signatures and type definitions obtained from the component's header files in addition to analyzing symbols in the component's binaries. This paper also describes an automated checker tool that implements the suggested method together with some results of its practical usage. In conclusion, further improvements of automatic means for backward compatibility verification are discussed.

Formalizing and verifying compatibility and consistency of SysML blocks

The objective of this paper is to define an approach to formalize and verify the SysML blocks in a refinement process. We propose to specify system architecture with SysML Block Definition Diagram, this diagram is then analyzed and decomposed into several sub-blocks in order to verify their compatibility. The structural architecture of an abstract block is given by the Internal Block Diagram (IBD) which defines the communication links between sub-blocks. The compatibility verification between sub-blocks is only made on linked sub-blocks. The behaviour of each sub-block is described by an interface automaton which species the invocations exchanged with its environment. The verification between blocks is translated into consistency verification between the blocks and compatibility verification between their interface automata. Incompatibilities can be inconsistent at architecture level and at communication level if there are deadlocks during the interaction between sub-blocks. Once the verification is established between the sub-blocks, the abstract block can be then substituted by the sub-blocks which compose it.