variously referred to as source coding, lossless coding, noiseless coding or entropy coding exactly and without error, the original message. Lossless coding implies that the message may be decoded back to the original sequence of symbols. The converse of lossless coding (“lossy” coding) implies some degree of approximation of the original message. lossless coding may augment lossy coding, eg VQ...

Because of the vast volume of data being produced by today’s scientific simulations, lossy compression allowing user-controlled information loss can significantly reduce the data size and the I/O burden. However, for large-scale cosmology simulation, such as the Hardware/Hybrid Accelerated Cosmology Code (HACC), where memory overhead constraints restrict compression to only one snapshot at a ti...

Department of Computer Science, University of Edinburgh, JCMB, Edinburgh EH9 3JZ, UK. e-mail: [email protected] Abstract. Lossy counter machines are defined as Minsky n-counter machines where the values in the counters can spontaneously decrease at any time. While termination is decidable for lossy counter machines, structural termination (termination for every input) is undecidable. This und...

In this paper, shielding effectiveness (SE) of a perforated enclosure with imperfectly conducting walls is evaluated. To this end, first, an accurate numerical technique based on method of Moments (MoM) ispresented. In this method, lossy metallic walls of the enclosure are replaced by equivalent electric surfacecurrent sources. Then, the impedance boundary condition on the imperfectly conductin...

Lossy channel systems model a set of nite state processes interacting with each other over unbounded, lossy FIFO channels. This computational model is an abstraction of protocols in the lower layers of the network protocol hierarchy. In spite of its unbounded FIFO queues the Lossy channel system model is not turing-powerful. It has been shown that the reachability problem is decidable 1]. Howev...

In this review paper, we present a development of parts of rate-distortion theory and pattern-matching algorithms for lossy data compression, centered around a lossy version of the asymptotic equipartition property (AEP). This treatment closely parallels the corresponding development in lossless compression, a point of view that was advanced in an important paper of Wyner and Ziv in 1989. In th...

We propose a practical technique for the identification of lossy network links from end-to-end measurements. Our scheme is based on a function that computes the likelihood of each link to be lossy. This function depends on the number of times a link appears in lossy paths and on the relative loss rates of these paths. Preliminary simulation results show that our algorithm achieves accuracy high...

A rigorous fast numerical method called E-PILE+SMCG is introduced and then used in a Monte Carlo study of scattering from a three dimensional perfectly electrical conductor (PEC) object below lossy soil rough surface. This method is the three dimensional (3D) extendability of PILE (Propagation-Inside-Layer Expansion) method which is proposed for two dimensional (2D) scattering problem. The roug...