Data Set Used
The Pacific oyster Crassostrea gigas belongs to one of the most species-rich but genomically poorly explored phyla, the Mollusca. Here we report the sequencing and assembly of the oyster genome using short reads and a fosmid-pooling strategy, along with transcriptomes of development and stress response and the proteome of the shell. The oyster genome is… (More)
Wireless sensor networks need an efficient and reliable reprogramming service to facilitate management and maintenance tasks. In this article we first outline a framework to examine different functions in reprogramming, followed by an analysis of reprogramming challenges. We then provide a comprehensive survey of the state-of-the-art reprogramming systems,… (More)
We propose a dimensionality reduction technique for time series analysis that significantly improves the efficiency and accuracy of similarity searches. In contrast to piecewise constant approximation (PCA) techniques that approximate each time series with constant value segments, the proposed method--Piecewise Vector Quantized Approximation--uses the… (More)
Our previous studies have demonstrated that stable microRNAs (miRNAs) in mammalian serum and plasma are actively secreted from tissues and cells and can serve as a novel class of biomarkers for diseases, and act as signaling molecules in intercellular communication. Here, we report the surprising finding that exogenous plant miRNAs are present in the sera… (More)
Location is a fundamental service for mobile computing. Typical GPS receivers, although widely available, consume too much energy to be useful for many applications. Observing that in many sensing scenarios, the location information can be post-processed when the data is uploaded to a server, we design a Cloud-Offloaded GPS (CO-GPS) solution that allows a… (More)
Let p be an odd prime and q = p m. Let l be an odd positive integer. Let p ≡ −1 (mod l) or p ≡ 1 (mod l) and l | m. By employing the integer sequence an = l−1 2 t=1 2 cos π(2t − 1) l n , which can be considered as a generalized Lucas sequence, we construct all the permutation binomials P (x) = x r + x u of the finite field Fq.
The Harvard community has made this article openly available. Please share how this access benefits you. Your story matters.
Motivated by several constructions of permutation polynomials done by several authors (most notably by Zieve), we propose a unified treatment for a large set of classes of permutation polynomials of F q. Our approach yields a recipe for constructing several new and old classes of permutation polynomials of F q .
It is well observed that usually the run-length of successive zero coefficients becomes longer and the magnitude of non-zero coefficients gets smaller while the DCT subband frequency increases. So the probability distributions of level/run combinations should be different at different DCT positions. Based on this observation, an efficient context based… (More)
In this paper, a novel method for learning based image super resolution (SR) is presented. The basic idea is to bridge the gap between a set of low resolution (LR) images and the corresponding high resolution (HR) image using both the SR reconstruction constraint and a patch based image synthesis constraint in a general probabilistic framework. We show that… (More)