Search results for "Verification"

Spatial Forecast Verification Methods Intercomparison Project: Application of the SAL Technique

2009

Abstract In this study, a recently introduced feature-based quality measure called SAL, which provides information about the structure, amplitude, and location of a quantitative precipitation forecast (QPF) in a prespecified domain, is applied to different sets of synthetic and realistic QPFs in the United States. The focus is on a detailed discussion of selected cases and on the comparison of the verification results obtained with SAL and some classical gridpoint-based error measures. For simple geometric precipitation objects it is shown that SAL adequately captures errors in the size and location of the objects, however, not in their orientation. The artificially modified (so-called fake…

Fingerprint Quality Evaluation in a Novel Embedded Authentication System for Mobile Users

2015

The way people access resources, data and services, is radically changing using modern mobile technologies. In this scenario, biometry is a good solution for security issues even if its performance is influenced by the acquired data quality. In this paper, a novel embedded automatic fingerprint authentication system (AFAS) for mobile users is described. The goal of the proposed system is to improve the performance of a standard embedded AFAS in order to enable its employment in mobile devices architectures. The system is focused on the quality evaluation of the raw acquired fingerprint, identifying areas of poor quality. Using this approach, no image enhancement process is needed after the …

Asynchronous Runtime Verification of Business Processes

2015

The authors propose a runtime verification mechanism for business processes. This mechanism allows verifying the correctness of business process execution and it runs in parallel with the base processes affecting them insignificantly. The authors have identified the case where the use of business process runtime verification is helpful and applicable. The verification mechanism monitors the business process execution and verifies compliance with the base process description. The verification mechanism prototype was developed and tested in real business processes, as well as limits of runtime verification overhead were evaluated.

Asynchronous Runtime Verification of Business Processes: Proof of Concept

2020

An Information Systems Design Product Theory for Software Project Estimation and Measurement Systems

2009

There is relatively little research on software Project Estimation and Measurement Systems (PEMS). Commercial PEMS vary in functionality and effective- ness. Their intended users thus do not know what to ex- pect from PEMS and how to evaluate them. This paper creates an information system design product theory for the class of PEMS that prescribes the meta-requirements, the meta-design, and applicable theories for all products within the class. Meta-requirements and the meta-design are derived from the project estimation and measurement literature, experiences obtained during more than ten years of empirical work in Finnish Software Measurement Association, and a commercially available PEMS.

Look for methods, not conclusions

2019

Qualunque sia l'esito effettivo di un'indagine su un caso di presunta manipolazione dei dati, ci sono alcuni principi fermi che sono sempre veri e alcuni errori che devono essere evitati.

Patients with acute chest pain, elevated troponin and normal coronary arteries, could be the Cardiovascular Magnetic Resonance advantageous?

2013

Maximum weight relaxed cliques and Russian Doll Search revisited

2015

Trukhanov et al. [Trukhanov S, Balasubramaniam C, Balasundaram B, Butenko S (2013) Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations. Comp. Opt. and Appl., 56(1), 113–130] used the Russian Doll Search (RDS) principle to effectively find maximum hereditary structures in graphs. Prominent examples of such hereditary structures are cliques and some clique relaxations intensely discussed and studied in network analysis. The effectiveness of the tailored RDS by Trukhanov et al. for s-plex and s-defective clique can be attributed to their cleverly designed incremental verification procedures used to distinguish feasible from infeasible struct…

Co-simulation and Formal Verification of Co-operative Drone Control With Logic-Based Specifications

2021

Abstract Unmanned aerial vehicle (UAV) co-operative systems are complex cyber-physical systems that integrate a high-level control algorithm with pre-existing closed implementations of lower-level vehicle kinematics. In model-driven development, simulation is one of the techniques that are usually applied, together with testing, in the analysis of system behaviours. This work proposes a method and tools to validate the design of UAV co-operative systems based on co-simulation and formal verification. The method uses the Prototype Verification System, an interactive theorem prover based on a higher-order logic language, and the Functional Mock-up Interface, a widely accepted standard for co-…

Modular Strategies for Recursive Game Graphs

2006

AbstractMany problems in formal verification and program analysis can be formalized as computing winning strategies for two-player games on graphs. In this paper, we focus on solving games in recursive game graphs which can model the control flow in sequential programs with recursive procedure calls. While such games can be viewed as the pushdown games studied in the literature, the natural notion of winning in our framework requires the strategies to be modular with only local memory; that is, resolution of choices within a module does not depend on the context in which the module is invoked, but only on the history within the current invocation of the module. While reachability in (global…