Although discriminating between all efficient decision making units (DMUs) with identical efficiency is a very important subject in data envelopment analysis (DEA), it may not be an easy task, particularly when the decision maker wants to select one and only one efficient DMU among all. There are some papers that have proposed methods for finding an efficient DMU as the most efficient one but h...

In this paper, we propose a new logarithmic filter grouping which can capture the nonlinearity of filter distribution in shallow CNNs. Residual identity shortcut is incorporated with the filter grouping to enhance the performance of shallow networks. The proposed logarithmic filter grouping is evaluated using a compact CNN structure with logarithmic group convolution modules which are composed ...

Let G be a finite abelian group G with N elements. In this paper we give a O(N) time algorithm for computing a basis of G. Furthermore, we obtain an algorithm for computing a basis from a generating system of G with M elements having time complexity O(M ∑ p|N e(p)⌈p 1/2⌉μ(p)), where p runs over all the prime divisors of N , and pe(p), μ(p) are the exponent and the number of cyclic groups which ...

We propose an efficient Verifiable Ring Encryption (VRE) for ad hoc groups. VRE is a kind of verifiable encryption [16,1,4,2,8] in which it can be publicly verified that there exists at least one user, out of a designated group of n users, who can decrypt the encrypted message, while the semantic security of the message and the anonymity of the actual decryptor can be maintained. This concept w...

We study a class of two-generator two-relator groups, denoted Jn(m, k), that arise in the study of relative asphericity as groups satisfying a transitional curvature condition. Particular instances of these groups occur in the literature as finite groups of intriguing orders. Here we find infinite families of non-elementary virtually free groups and of finite metabelian non-nilpotent groups, fo...

This paper proposes a new public key authenticated encryption (signcryption) scheme based on the Diffie-Hellman problem in Gap Diffie-Hellman groups. This scheme is built on the scheme proposed by Boneh, Lynn and Shacham in 2001 to produce short signatures. The idea is to introduce some randomness into this signature to increase its level of security in the random oracle model and to re-use tha...

This paper presents an efficient solution to key exchange problem for large groups in the password-based scenario. Our scheme can combine existing group protocols to get a hybrid group key exchange protocol which is efficient in terms of both computation and communication. And the resulting protocol allows users to securely join and leave the group at any time—the so-called dynamic case. For dy...

Mona, secure data sharing in a multi-owner manner for dynamic groups preserves data, identity privacy from an untrusted cloud and allows frequent change of the membership. In RLS while the number of invoked users grows larger, the length of RL increases. To send all user revocation details to the group members for sharing purpose, leads to communication overhead .To address this issue, in this ...

Let G be a finite group, f: G --+ C a function, and p an ir-reducible representation of G. The Fourier transform is defined as j(p) =E SEG f(s)p(s) . Direct computation for all irreducible representations involvesorder IGI2 operations. We derive fast algorithms and develop them for thesymmetric groupSn. There, (n!)2 is reduced to n(n!)a/2, where a is theconstant for matr...

A Private Information Retrieval (PIR) protocol allows a database user, or client, to obtain information from a database in a manner that prevents the database from knowing which data was retrieved. Although substantial progress has been made in the discovery of computationally PIR (cPIR) protocols with reduced communication complexity, there has been relatively little work in reducing the compu...