The performance of the proposed radial basis function (RBF) assisted turbo-coded adaptive modulation scheme is characterized in a wideband channel scenario. We commence by introducing the novel concept of the Jacobian RBF equalizer, which is a reduced-complexity version of the conventional RBF equalizer. Specifically, the Jacobian logarithmic RBF equalizer generates its output in the logarithmi...

Signcryption is a cryptographic primitive which can offer simultaneously security requirements of confidentiality and authentication, and is more efficient than the traditional sign-then-encrypt way. Recently, Liu et al. proposed the first certificateless signcryption scheme in the standard model. However, their scheme is proved to have some security weaknesses. In this paper, we propose a corr...

Providing authentication for the messages exchanged between group members in addition to confidentiality is an important issue in Secure Group communication. We develop a protocol for Secure Authentic Communication where we address authentication for the group communication scheme proposed by Blundo et al. which only provides confidentiality. Authentication scheme used is a multiparty authentic...

‎we extend the method of adaptive two-stage sequential sampling to‎‎include designs where there is more than one criteria is used in‎‎deciding on the allocation of additional sampling effort‎. ‎these‎‎criteria‎, ‎or conditions‎, ‎can be a measure of the target‎‎population‎, ‎or a measure of some related population‎. ‎we develop‎‎murthy estimator for the design that is unbiased estimators for‎‎t...

We design adaptive high-order Galerkin methods for the solution of linear elliptic problems and study their performance. We start by considering adaptive Fourier-Galerkin methods and Legendre spectralelement methods, which offer unlimited approximation power only restricted by solution and data regularity. We next turn our attention to the $hp$-version of the finite element method, for which we...

In this paper, a new mapping model, called n-INode, is presented and it is used to support dynamic updating of XML data flexibly. One key feature of n-INode is the use of multi-dimensional numbering scheme to verify the containment relationships between XML nodes The preliminary experiments show that n-INode supports dynamic updating of XML documents effectively and efficiently..

We introduce a compression mechanism for the de Bruijn representation of lambda terms. In combination with a tree-based number system, we use it for a bijective size-proportionate Gödel numbering scheme that combines into a uniform representation natural number arithmetic with generation and normalization of lambda terms.

We consider several issues related to the multidimensional integration using a network of heterogeneous computers. Based on these considerations, we develop a new general purpose scheme which can significantly reduce the time needed for evaluation of integrals with CPU intensive integrands. This scheme is a parallel version of the well-known adaptive Monte Carlo method (the VEGAS algorithm), an...

In this paper, we propose a new signcryption scheme and its online/offline version from pairings. Based on the assumption of k+1 square roots, the scheme is proven, without random oracles, to be secure against the existential forgery under an adaptive chosen-message attack. It is also proven that its IND-CPA security also implies its IND-CCA2 security. A comparison is made with existing schemes...