Finger vein recognition is a biometric technique which identifies individuals using their unique finger vein patterns. It is reported to have a high accuracy and rapid processing speed. In addition, it is impossible to steal a vein pattern located inside the finger. We propose a new identification method of finger vascular patterns using a weighted local binary pattern (LBP) and support vector machine (SVM). This research is novel in the following three ways. First, holistic codes are extracted through the LBP method without using a vein detection procedure. This reduces the processing time and the complexities in detecting finger vein patterns. Second, we classify the local areas from which the LBP codes are extracted into three categories based on the SVM classifier: local areas that include a large amount (LA), a medium amount (MA), and a small amount (SA) of vein patterns. Third, different weights are assigned to the extracted LBP code according to the local area type (LA, MA, and SA) from which the LBP codes were extracted. The optimal weights are determined empirically in terms of the accuracy of the finger vein recognition. Experimental results show that our equal error rate (EER) is significantly lower compared to that without the proposed method or using a conventional method.

Resources in a cloud can be identified using identifiers based on random numbers. When using a distributed hash table to resolve such identifiers to network locations, the straightforward approach is to store the network location directly in the hash table entry associated with an identifier. When a mobile host contains a large number of resources, this requires that all of the associated hash table entries must be updated when its network address changes. We propose an alternative approach where we store a host identifier in the entry associated with a resource identifier and the actual network address of the host in a separate host entry. This can drastically reduce the time required for updating the distributed hash table when a mobile host changes its network address. We also investigate under which circumstances our approach should or should not be used. We evaluate and confirm the usefulness of our approach with experiments run on top of OpenDHT.

By using different interface adapters for different methods, it is possible to construct a maximally covering web of interface adapters which incurs minimum loss during interface adaptation. We introduce a polynomial-time algorithm that can achieve this. However, we also show that minimizing the number of adapters included in a maximally covering web of interface adapters is an NP-complete problem.

In this paper, we consider a Mann-type iterative algorithm for nonself strict pseudo-contractions. Weak and strong convergence theorems are established in the framework of Hilbert spaces. The results presented in this paper improve and extend the results announced by many others.

In this paper, three iterations are designed to approach zeros of set-valued accretive operators in Banach spaces. The first one is the continuous Picard type iteration involving the resolvent, the second one is the approximate Picard type iteration involving the resolvent and the third one is the Halpern type iteration involving the resolvent. Some strong convergence theorems for three iterations are proved.

The purpose of this paper is to establish some new KKM type theorems in G-convex spaces and, as applications, to obtain some new matching theorems, fixed point theorems, section theorems and minimax theorems in G-convex spaces. The results presented in this paper improve and generalize the corresponding results in [1-6, 16, 20, 23].

We consider q-Euler numbers, polynomials, and q-Stirling numbers of first and second kinds. Finally, we investigate some interesting properties of the modified q-Bernstein polynomials related to q-Euler numbers and q-Stirling numbers by using fermionic p-adic integrals on .

We consider some of the properties of divisor functions arising from q-series and theta functions. Using these we obtain several new identities involving divisor functions. On the other hand we prove a conjecture of Z. H. Sun concerning representations by the ternary quadratic form x(2) + y(2) + 3z(2), and also get an analogous result for x(2) + y(2) + 2z(2).

An aggregate signature scheme allows n signatures on n distinct messages from n distinct users to aggregate a single signature. The main benefit of such schemes is that they allow bandwidth and computational savings. Since Boneh et al.’s aggregate signature scheme from pairings, there exist several trials for constructing ID-based aggregate signature schemes. However, their computational complexity for pairing computations grows linearly with the number of signers. In this paper, we propose an efficient ID-based aggregate signature scheme with constant pairing computations. We also give its security proof in the random oracle model under the Computational Diffie–Hellman assumption.