One of the most popular encoder in the literature is the LZ78, which was proposed by Ziv and Lempel in 1978. After the original paper was published, many variants of the LZ78 were proposed to improve its performance. Simulation results have shown that the well known LZW version has an improvement around 10%. Given a sequence u ∈ A, where A is the source alphabet, all versions of LempelZiv parse...

We study the fluctuations, in the large deviations regime, of the longest increasing subsequence of a random i.i.d. sample on the unit square. In particular, our results yield the precise upper and lower exponential tails for the length of the longest increasing subsequence of a random permutation. §.

In this paper, we give a polynomial (O(n)) algorithm for finding a longest common pattern between two permutations of size n given that one is separable. We also give an algorithm for general permutations whose complexity depends on the length of the longest simple permutation involved in one of our permutations.

current research, that involves laboratory investigations into the phenomena of solubility, uses circulation equipment that has been developed to study the enlargement of joint aperture. this paper describes the preliminary results of laboratory experiments on ten different length and width of samples, which show that the flow rate through the fissures increases with time as the fissures enlarg...

In comparing open and closed economies, researchers often arrange shorter sessions under the former condition than under the latter. Several studies indicate that session length per se can affect performance and there are some data that indicate that this variable can influence demand functions. To provide further data, the present study exposed domestic hens to series of increasing fixed-ratio...

We present several results concerning the Laborde-Payan-Xuang conjecture stating that in every digraph there exists an independent set of vertices intersecting every longest path. The digraphs we consider are defined in terms of local semicompleteness and local transitivity. We also look at oriented graphs for which the length of a longest path does not exceed 4.

Thermal convection experiments in a liquid gallium layer were carried out with various intensities of uniform horizontal magnetic fields. The gallium layer was in a rectangular vessel with a 4:1:1 length ratio (1 is the height), where the magnetic field is applied in the direction normal to the longest vertical wall. An ultrasonic velocity profiling method was used to visualize the spatiotempor...

In this note, we show that some problems related to the length of the longest simple path from a given vertex in a graph are NP-complete. We also discuss an extension to the graph coloring problem. @ 2004 Elsevier Ltd. All rights reserved. Keywords-Longest path, Graph coloring, Complexity.

Background & Aim: Effects of ultra violet spectrum on plants due to their obligatory requirement for sunlight for survival are unavoidable. Direct effects of UV on plant growth and development are generally negative and usually they use many different defense mechanisms to acclimate and protect themselves. Material & Methods: The present research for the first time was conducted to investigate...

Single molecules of DNA, visualized in video fluorescence microscopy, were stretched to full extension in a flow, and their relaxation was measured when the flow stopped. The molecules, attached by one end to a 1-micrometer bead, were manipulated in an aqueous solution with optical tweezers. Inverse Laplace transformations of the relaxation data yielded spectra of decaying exponentials with dis...