Biometrics have the potential to solidify person-authentication by examining \unforgeable" features of individuals. This paper explores issues involved with e ective integration of biometric-enhanced authentication into computer systems and design options for addressing them. Because biometrics are not secrets, systems must not use them like passwords; otherwise, biometric-based authentication ...

Biometrics have the potential to solidify person-authentication by examining "unforgeable" features of individuals. This paper explores issues involved with effective integration of biometric-enhanced authentication into computer systems and design options for addressing them. Because biometrics are not secrets, systems must not use them like passwords; otherwise, biometric-based authentication...

MOTIVATION We have created a suite of Java-based software to better provide taxonomic assignments to DNA sequences. We anticipate that the program will be useful for protistologists, virologists, mycologists and other microbial ecologists. The program relies on NCBI utilities including the BLAST software and Taxonomy database and is easily manipulated at the command-line to specify a BLAST cand...

The present study is aimed at assessing the state of national identity among female students of Ahwaz Islamic Azad University and explores the social factors affecting upon it. The statistical society consisted of 8532 students at the three levels of associate diploma undergraduate and master degrees. The research method in this study is a “survey” and collection of data has been carried out by...

We study the detailed convergence of the binomial tree scheme. It is known that the scheme is first order. We find the exact constants, and show it is possible to modify Richardson extrapolation to get a method of order three-halves. We see that the delta, used in hedging, converges at the same rate. We analyze this by first embedding the tree scheme in the Black-Scholes diffusion model by mean...

An edge-colored graph G is conflict-free connected if, between each pair of distinct vertices, there exists a path containing a color used on exactly one of its edges. The conflict-free connection number of a connected graph G, denoted by cfc(G), is defined as the smallest number of colors that are required in order to make G conflict-free connected. A coloring of vertices of a hypergraph H = (...

Developed only recently, support vector learning machines achieve high generalization ability by minimizing a bound on the expected test error; however, so far there existed no way of adding knowledge about invariances of a classiication problem at hand. We present a method of incorporating prior knowledge about transformation invari-ances by applying transformations to support vectors, the tra...

In this paper we propose a Symmetrical Binomial Lattice Approach that is equivalent to the well‐known and widely utilized Lattice of Cox, Ross & Rubinstein (1979) when modeling Geometric Brownian Motion type of processes, but can be utilized for a wide variety of other Markov style stochastic processes. This is due to the highly intuitive construction in which first the expecte...

As the transition to renewable energy sources progresses, their integration makes electricity production increasingly fluctuating, also causing amplified volatility in electricity prices on energy markets. To contribute to power grid stability, utilities need to balance volatile supply through shifting demand. This measure of demand side management creates flexibility, being enabled as the inte...

In this expository paper we illustrate the generality of game theoretic probability protocols of Shafer and Vovk (2001) in finite-horizon discrete games. By restricting ourselves to finite-horizon discrete games, we can explicitly describe how discrete distributions with finite support and the discrete pricing formulas, such as the Cox-Ross-Rubinstein formula, are naturally derived from game-th...