Feature Representation for Online Signature Verification

Biometrics systems have been used in a wide range of applications and have improved people authentication. Signature verification is one of the most common biometric methods with techniques that employ various specifications of a signature. Recently, deep learning has achieved great success in many fields, such as image, sounds and text processing. In this paper, deep learning method has been used for feature extraction and feature selection.Comment: 10 pages, 10 figures, Submitted to IEEE Transactions on Information Forensics and Securit

The effect of tensor interaction in splitting the energy levels of relativistic systems

In this paper we solve analytically Dirac equation for Eckart plus Hulthen potentials with Coulomb-like and Yukawa-like tensor interaction in the presence of Spin and Pseudo-spin Symmetry for any k number. The Parametric Nikiforov-Uvarov method is used to obtain the energy Eigen-values and wave functions. We also discuss the energy Eigen-values and the Dirac spinors for the Eckart plus Hulthen potentials for the spin and pseudo-spin symmetry with PNU method. To show the accuracy of the present model, some numerical results are shown in both pseudo-spin and spin symmetry limits.Comment: 19 Pages, 13 Figures,6 Tabl

Polynomial-Time Fence Insertion for Structured Programs

To enhance performance, common processors feature relaxed memory models that reorder instructions. However, the correctness of concurrent programs is often dependent on the preservation of the program order of certain instructions. Thus, the instruction set architectures offer memory fences. Using fences is a subtle task with performance and correctness implications: using too few can compromise correctness and using too many can hinder performance. Thus, fence insertion algorithms that given the required program orders can automatically find the optimum fencing can enhance the ease of programming, reliability, and performance of concurrent programs. In this paper, we consider the class of programs with structured branch and loop statements and present a greedy and polynomial-time optimum fence insertion algorithm. The algorithm incrementally reduces fence insertion for a control-flow graph to fence insertion for a set of paths. In addition, we show that the minimum fence insertion problem with multiple types of fence instructions is NP-hard even for straight-line programs