Rotatable random sequences in local fields

Local Randomness in Pseudo - random Sequences 1

The concept of provable cryptographic security for pseudo-random number generators that was introduced by Schnorr is investigated and extended. The cryptanalyst is assumed to have in nite computational resources and hence the security of the generators does not rely on any unproved hypothesis about the di culty of solving a certain problem, but rather relies on the assumption that the number of...

TildeCRF: Conditional Random Fields for Logical Sequences

Conditional Random Fields (CRFs) provide a powerful instrument for labeling sequences. So far, however, CRFs have only been considered for labeling sequences over flat alphabets. In this paper, we describe TildeCRF, the first method for training CRFs on logical sequences, i.e., sequences over an alphabet of logical atoms. TildeCRF’s key idea is to use relational regression trees in Dietterich e...

Local Whittle estimator for anisotropic random fields

AMS 1991 subject classifications: primary 62G07 secondary 62M10 Keywords: Spatial long memory Local Whittle method a b s t r a c t A local Whittle estimator is developed to simultaneously estimate the long memory parameters for stationary anisotropic scalar random fields. It is shown that these estimators are consistent and asymptotically normal, under some weak technical conditions. A brief si...

Local Functionals and Generalized Random Fields

Local likelihood estimation for nonstationary random fields

We develop a weighted local likelihood estimate for the parameters that govern the local spatial dependency of a locally stationary random field. The advantage of this local likelihood estimate is that it smoothly downweights the influence of faraway observations, works for irregular sampling locations, and when designed appropriately, can trade bias and variance for reducing estimation error. ...