We model an ATM virtual circuit as a tandem queueing system. At each queue, transmission of the virtual circuit traac is interrupted by cross traf-c, causing the scattering and coalescing of cells. We study this phenomenon using entropy as a traf-c descriptor. We compute the entropy of traac streams produced in simulation, via an estimation technique based on the Lempel-Ziv universal data compr...

This paper presents the comparison of compression algorithms for voice transferring method over SMS in satellite communication. Voice transferring method over SMS is useful in situations when signal strength is low and due to poor signal strength voice call connection is not possible to initiate or signal dropped during voice call. This method has one serious flaw that it produces large number ...

Columnar Oriented Database is an enhance approach to service to service the needs of Business Intelligence. A Columnar Oriented Database Management system that stores content by columns rather than the row. This type of data differs from traditional database with regards to performance, storage requirements and easy to modification of the schema. One of the major advantage of column based datab...

In this paper we compare the expressive power of elementary representation formats for vague, incomplete or conflicting information. These include Boolean valuation pairs introduced by Lawry and Gonzalez-Rodriguez, orthopairs of sets of variables, Boolean possibility and necessity measures, three-valued valuations, supervaluations. We make explicit their connections with strong Kleene logic and...

The Fixed-Database version of the Lempel Ziv algorithm closely resembles many versions that appear in practice. In this paper, we ascertain several key asymptotic properties of the algorithm as applied to sources with nite memory. First, we determine that for a dictionary of size n, the algorithm achieves a redundancy n = H log log n log n + o(log log n log n), where H is the entropy of the pro...

The main strategy of algorithms in this class is to substitute “repeated strings”, i.e., exact replicas of a substring in a string, within the text with a convenient coding scheme. Those methods generally fall into the Macro Model for Data Compression introduced and studied by Storer and Szymanski (1982). The well known algorithms by Ziv and Lempel (1977, 1978), as well as many others, turn out...

Detection of ventricular tachycardia (VT) and ventricular fibrillation (VF) is crucial for the success of saving the patient’s life. The complexity of the heart signals has changed significantly when the heart state switches. In this study we proposed a novel method for detection of ventricular fibrillation (VF) and ventricular tachycardia (VT), based upon the Lempel-Ziv complexity and Wavelet ...

A theorem of Cohn and Lempel [J. Combin. Theory Ser. A 13 (1972), 83-89] gives an equality involving the number of directed circuits in a circuit partition of a 2-in, 2-out digraph and the GF (2)-nullity of an associated matrix. This equality is essentially equivalent to the relationship between directed circuit partitions of 2-in, 2-out digraphs and vertexnullity interlace polynomials of circl...

We describe a universal information compression scheme that compresses any pure quantum i.i.d. source asymptotically to its von Neumann entropy, with no prior knowledge of the structure of the source. We introduce a diagonalisation procedure that enables any classical compression algorithm to be utilised in a quantum context. Our scheme is then based on the corresponding quantum translation of ...

We define and study a quantale-valued Wijsman structure on the hyperspace of all non-empty closed sets of a quantale-valued metric space. We show its admissibility and that the metrical coreflection coincides with the quantale-valued Hausdorff metric and that, for a metric space, the topological coreflection coincides with the classical Wijsman topology. We further define an index of compactnes...