We demonstrate a generalization of Maximum Entropy Density Estimation that elegantly handles incomplete presence-only data. We provide a formulation that is able to learn from known values of incomplete data without having to learn imputed values, which may be inaccurate. This saves the effort needed to perform accurate imputation while observing the principle of maximum entropy throughout the ...

Code injection attacks that target the control-data of an application have been prevalent amongst exploit writers for over 20 years. Today however, these attacks are getting increasingly harder for attackers to successfully exploit due to numerous countermeasures that are deployed by modern operating systems. We believe that this fact will drive exploit writers away from classic control-data at...

A new recursive augmented Lagrangian (AL) algorithm is presented for reconstruction of a 3D wave field for intensity-only measurements obtained from two or more sensor planes parallel to the object plane. This reconstruction is framed as a maximum likelihood constrained nonlinear optimization problem for Gaussian additive noise observations. A contribution of this paper concerns a development o...

We revisit the random-access-machine model in which the input is given on a read-only random-access media, the output is to be produced to a write-only sequential-access media, and in addition there is a limited random-access workspace. The length of the input is N elements, the length of the output is limited by the computation itself, and the capacity of the workspace is O(S + w) bits, where ...

In this report, I presented my results to the tasks of 2008 UC San Diego Data Mining Contest. This contest consists of two classification tasks based on data from scientific experiment. The first task is a binary classification task which is to maximize accuracy of classification on an evenly-distributed test data set, given a fully labeled imbalanced training data set. The second task is also ...

In this paper, we address the issue of ensuring consistency of multiple data items requested in a certain order by read-only transactions in wireless data broadcast. To handle the inherent property in a data broadcast environment that data can only be accessed strictly sequential by users, we explore a predeclaration-based query optimization and devise two practical transaction processing metho...

Conventional protein structure determination from nuclear magnetic resonance data relies heavily on side-chain proton-to-proton distances. The necessary side-chain resonance assignment, however, is labor intensive and prone to error. Here we show that structures can be accurately determined without nuclear magnetic resonance (NMR) information on the side chains for proteins up to 25 kilodaltons...

The standard approach in Digital Particle Image Velocimetry (DPIV) data processing is to use Fast Fourier Transforms to obtain the cross-correlation of two single exposure subregions, where the location of the cross-correlation peak is representative of the most probable particle displacement across the subregion. This standard DPIV processing technique is analogous to Matched Spatial Filtering...

Besides the algorithm selection, the data layout choice is the key intellectual step in writing an eecient HPF program. Although nding an eecient data layout fully automatically may not be possible in all cases, HPF users will need support during the diicult data layout selection process. In particular, this support is necessary if the user is not familiar with the characteristics of the target...

In distributed computing environments, replication of data provides improved availability, isolation between workloads with di erent characteristics, and improved performance through local access to data. The \real data" is server resident and by \local data" we refer to cached client data. We examine which data should be cached on behalf of a cached query. The minimum requirement for cached da...