295,101 research outputs found
Likelihood-Ratio-Based Biometric Verification
The paper presents results on optimal similarity measures for biometric verification based on fixed-length feature vectors. First, we show that the verification of a single user is equivalent to the detection problem, which implies that, for single-user verification, the likelihood ratio is optimal. Second, we show that, under some general conditions, decisions based on posterior probabilities and likelihood ratios are equivalent and result in the same receiver operating curve. However, in a multi-user situation, these two methods lead to different average error rates. As a third result, we prove theoretically that, for multi-user verification, the use of the likelihood ratio is optimal in terms of average error rates. The superiority of this method is illustrated by experiments in fingerprint verification. It is shown that error rates below 10/sup -3/ can be achieved when using multiple fingerprints for template construction
Web Services: A Process Algebra Approach
It is now well-admitted that formal methods are helpful for many issues
raised in the Web service area. In this paper we present a framework for the
design and verification of WSs using process algebras and their tools. We
define a two-way mapping between abstract specifications written using these
calculi and executable Web services written in BPEL4WS. Several choices are
available: design and correct errors in BPEL4WS, using process algebra
verification tools, or design and correct in process algebra and automatically
obtaining the corresponding BPEL4WS code. The approaches can be combined.
Process algebra are not useful only for temporal logic verification: we remark
the use of simulation/bisimulation both for verification and for the
hierarchical refinement design method. It is worth noting that our approach
allows the use of any process algebra depending on the needs of the user at
different levels (expressiveness, existence of reasoning tools, user
expertise)
PATH: Person Authentication using Trace Histories
In this paper, a solution to the problem of Active Authentication using trace
histories is addressed. Specifically, the task is to perform user verification
on mobile devices using historical location traces of the user as a function of
time. Considering the movement of a human as a Markovian motion, a modified
Hidden Markov Model (HMM)-based solution is proposed. The proposed method,
namely the Marginally Smoothed HMM (MSHMM), utilizes the marginal probabilities
of location and timing information of the observations to smooth-out the
emission probabilities while training. Hence, it can efficiently handle
unforeseen observations during the test phase. The verification performance of
this method is compared to a sequence matching (SM) method , a Markov
Chain-based method (MC) and an HMM with basic Laplace Smoothing (HMM-lap).
Experimental results using the location information of the UMD Active
Authentication Dataset-02 (UMDAA02) and the GeoLife dataset are presented. The
proposed MSHMM method outperforms the compared methods in terms of equal error
rate (EER). Additionally, the effects of different parameters on the proposed
method are discussed.Comment: 8 pages, 9 figures. Best Paper award at IEEE UEMCON 201
Procedure-modular specification and verification of temporal safety properties
This paper describes ProMoVer, a tool for fully automated procedure-modular verification of Java programs equipped with method-local and global assertions that specify safety properties of sequences of method invocations. Modularity at the procedure-level is a natural instantiation of the modular verification paradigm, where correctness of global properties is relativized on the local properties of the methods rather than on their implementations. Here, it is based on the construction of maximal models for a program model that abstracts away from program data. This approach allows global properties to be verified in the presence of code evolution, multiple method implementations (as arising from software product lines), or even unknown method implementations (as in mobile code for open platforms). ProMoVer automates a typical verification scenario for a previously developed tool set for compositional verification of control flow safety properties, and provides appropriate pre- and post-processing. Both linear-time temporal logic and finite automata are supported as formalisms for expressing local and global safety properties, allowing the user to choose a suitable format for the property at hand. Modularity is exploited by a mechanism for proof reuse that detects and minimizes the verification tasks resulting from changes in the code and the specifications. The verification task is relatively light-weight due to support for abstraction from private methods and automatic extraction of candidate specifications from method implementations. We evaluate the tool on a number of applications from the domains of Java Card and web-based application
Identity Authentication Based on Keystroke Latencies Using Neural Networks
Most computer security systems verify the identity of a user through objects in the user\u27s possession such as keys or magnetic cards, or through knowledge the user has, such as a password or PIN number. There are, however, two other methods of user verification, which have as yet received little or no attention. There has been some work done on the third method, recognition of physiological patterns (such as finger prints, retinal patterns, or voice patterns), but this work has been limited and requires expensive hardware to implement. The final method of user verification is through actions such as signature or behavior patterns
SINGULAB - A Graphical user Interface for the Singularity Analysis of Parallel Robots based on Grassmann-Cayley Algebra
This paper presents SinguLab, a graphical user interface for the singularity
analysis of parallel robots. The algorithm is based on Grassmann-Cayley
algebra. The proposed tool is interactive and introduces the designer to the
singularity analysis performed by this method, showing all the stages along the
procedure and eventually showing the solution algebraically and graphically,
allowing as well the singularity verification of different robot poses.Comment: Advances in Robot Kinematics, Batz sur Mer : France (2008
Comparison between audio and tactile systems for delivering simple navigational information to visually impaired pedestrians
Many of the current GPS (Global Positioning Systems) navigation aids use an audio method to deliver navigation information to the user. For the visually impaired person this method can be problematic. The visually impaired pedestrian relies heavily on information contained within the ambient sound environment; for location and orientation information, navigation information, and importantly, safety information. In this paper we present the design of an innovative tactile interface and verification of results obtained through experimental trials. This pilot study compared the efficiency of the tactile interface, to an audio method of delivering simple navigational information. The findings indicate that the tactile interface could be used successfully by blind and sighted pedestrians and may offer advantages over auditory interfaces
Bounded Verification with On-the-Fly Discrepancy Computation
Simulation-based verification algorithms can provide formal safety guarantees
for nonlinear and hybrid systems. The previous algorithms rely on user provided
model annotations called discrepancy function, which are crucial for computing
reachtubes from simulations. In this paper, we eliminate this requirement by
presenting an algorithm for computing piece-wise exponential discrepancy
functions. The algorithm relies on computing local convergence or divergence
rates of trajectories along a simulation using a coarse over-approximation of
the reach set and bounding the maximal eigenvalue of the Jacobian over this
over-approximation. The resulting discrepancy function preserves the soundness
and the relative completeness of the verification algorithm. We also provide a
coordinate transformation method to improve the local estimates for the
convergence or divergence rates in practical examples. We extend the method to
get the input-to-state discrepancy of nonlinear dynamical systems which can be
used for compositional analysis. Our experiments show that the approach is
effective in terms of running time for several benchmark problems, scales
reasonably to larger dimensional systems, and compares favorably with respect
to available tools for nonlinear models.Comment: 24 page
- ā¦