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.

Certificateless cryptography eliminates the need of certificates in public key cryptosystems and solves the inherent key escrow problem in identity-based cryptosystems. In this paper we discuss the existence of short certificateless signature schemes provably secure in formal security models recently established, whose resulting signature consists of a single element of the underlying group by demonstrating key replacement attacks on Du-Wen's and Tso et al.'s short certificateless signature schemes.