An effective technique in locating a source based on intersections of hyperbolic curves defined by the time differences of arrival of a signal received at a number of sensors is proposed. The approach is noniterative and gives au explicit solution. It is an approximate realization of the maximum-likelihood estimator and is shown to attain the Cramer-Rao lower bound near the small error region. ...

The single-copy entanglement of a given many-body quantum system is defined [J. Eisert and M. Cramer, Phys. Rev. A 72, 042112 (2005)10.1103/PhysRevA.72.042112] as the maximal entanglement deterministically distillable from a bipartition of a single specimen of that system. For critical (gapless) spin chains, it was recently shown that this is exactly half the von Neumann entropy [R. Orús, J. I....

The problem of estimating the frequencies, phases, and amplitudes of sinusoidal signals is considered. A simplified maximumlikelihood Gauss-Newton algorithm which provides asymptotically efficient estimates of these parameters is proposed. Initial estimates for this algorithm are obtained by a variation of the overdetermined YuleWalker method and a periodogram-based procedure. Use of the maximu...

In linear system identification, optimal excitation signals can be determined using the Cramer-Rao bound. This problem has not been thoroughly studied for the nonlinear case. In this work, the Cramer-Rao bound for a factorisable Volterra model is derived. The analytical result is supported with simulation examples. The bound is then used to find the optimal excitation signal out of the class of...

We present a construction of a CCA2-secure encryption scheme from a plaintext aware, weakly simulatable public key encryption scheme. The notion of plaintext aware, weakly simulatable public key encryption has been considered previously by Myers, Sergi and shelat (SCN, 2012) and natural encryption schemes such as the Damg̊ard Elgamal Scheme (Damg̊ard, Crypto, 1991) and the Cramer-Shoup Lite Schem...

We give the first perfectly rerandomizable, Replayable-CCA (RCCA) secure encryption scheme, positively answering an open problem of Canetti et al. (CRYPTO 2003). Our encryption scheme, which we call the Double-strand Cramer-Shoup scheme, is a non-trivial extension of the popular Cramer-Shoup encryption. Its security is based on the standard DDH assumption. To justify our definitions, we define ...

When properly constructed, biased estimators are known to produce lower mean-square errors than unbiased estimators. A biased estimator for the problem of ultrasound time-delay estimation was recently proposed. The proposed estimator incorporates knowledge of adjacent displacement estimates into the final estimate of a displacement. This is accomplished by using adjacent estimates to create a p...

We introduce a new methodology for achieving security against adaptive chosen-ciphertext attack (CCA) for public-key encryption schemes, which we call the oblivious decryptors model. The oblivious decryptors model generalizes both the two-key model of Naor and Yung, as well the Cramer–Shoup encryption schemes. The key ingredient in our new paradigm is Sahai’s notion of Simulation-Sound NIZK pro...

1. Activity of 5-aminolaevulinate synthetase was measured in the midgut and other tissues of the last larval instar of the southern armyworm (Spodoptera eridania Cramer, formerly Prodenia eridania Cramer). 2. Optimum conditions for measuring the activity were established with respect to all variables involved and considerable differences from those reported for mammalian enzyme preparations wer...

In this paper, we analyze the performance of a non-data aided near maximum likelihood (NDA-NML) estimator for symbol timing recovery in wireless communications. The performance of the estimator is evaluated for an additive noise only channel. Performance analysis is extended to fading channels characterized by Rayleigh fading, Weibull fading and log-normal fading, appropriate to a variety of tr...