The calculation of the local density of states (LDOS) in lossy materials has long been disputed due to the divergence of the homogeneous Green functionwith equal space arguments. For arbitrary-shaped lossy structures, such as those of interest in nanoplasmonics, this problem is particularly challenging. A nondivergent LDOS obtained in numerical methods such as the finite-difference time-domain ...

Absorber is an important component in various optical devices. Here we report a novel type of asymmetric absorber in the visible and near-infrared spectrum which is based on lossy Bragg stacks. The lossy Bragg stacks can achieve near-perfect absorption at one side and high reflection at the other within the narrow bands (several nm) of resonance wavelengths, whereas display almost identical abs...

This paper proposes an effective technique, which can detect malicious manipulations under video lossy compressing data (e.g. H.263) and still-image lossy compressing data (e.g. JPEG). A blockclassification strategy is used to divide DCT-blocks into the flat-blocks and the normal-blocks. Simple features of the both blocks are embedded invisibly. For later authentication, the watermarked frame i...

We consider a novel variant of $d$ -semifaithful lossy coding in which the distortion measure is revealed only to encoder and at run-time, as well an extension it constraint also run-time. Two forms rate redundancy are used analyze pe...

In this paper, we present a novel method for fast lossy or lossless compression and decompression of regular height fields. The method is suitable for SIMD parallel implementation and thus inherently suitable for modern GPU architectures. Lossy compression is achieved by approximating the height field with a set of quadratic Bezier surfaces. In addition, lossless compression is achieved by supe...

This paper evaluates four forwarding strategies for fragmented datagrams in the Internet of Things (IoT). We focus on classic end-to-end fragmentation, hop-wise reassembly, a minimal approach to direct fragments, and utilizing selective fragment recovery. To fully analyze potentials recovery, we include common congestion control mechanisms. compare all fragmentation comprehensively extensive ex...

In this work, we propose a new construction of polar lattices to achieve the rate-distortion bound memoryless Gaussian source. The structure proposed allows integrate entropy coding into lattice quantizer, which greatly simplifies compression process. overall complexity encoding and decoding is O(N log <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink...

The problem of joint universal source coding and modeling, treated in the context of lossless codes by Rissanen, was recently generalized to fixed-rate lossy coding of finitely parametrized continuous-alphabet i.i.d. sources. We extend these results to variable-rate lossy block coding of stationary ergodic sources and show that, for bounded metric distortion measures, any finitely parametrized ...

Lossy compression techniques have been applied to image and text compression, yielding compression factors that are vastly superior to lossless compression schemes. In this paper, we present a preliminary study on a set of lossy transformations for XML documents that preserve the semantics. Inspired by previous techniques, e.g. lossy text compression and literate programming, we apply a simple ...