The fully packed loop model of closed paths covering the honeycomb lattice is studied through its identiication with the sl q (3) integrable lattice model. Some known results from the Bethe ansatz solution of this model are reviewed. The free energy, correlation length, and the ensemble average loop length are given explicitly for the many-loop phase. The results are compared with the known res...

We use a multilevel dominant eigenvector estimation algorithm to develop a new run-length texture feature extraction algorithm that preserves much of the texture information in run-length matrices and significantly improves image classification accuracy over traditional run-length techniques. The advantage of this approach is demonstrated experimentally by the classification of two texture data...

Simulation of large scale networks can be very time and resource-consuming. It is hard to predict when the amount of data collected from a simulation is enough and the measurement is accurate enough for the parameter of interest. In this paper, we study the planning of simulation run length, and investigate how many cycles of overflow / non-overflow are needed for the packet loss probability to...

In this report, we present a series of improvements to the basic run-length encoding algorithm. Several modified algorithms are generated, from basic CPU single-threaded compression to a highly parallelized version on NVidia CUDA hardware. We also investigated changes to memory access locality in the parallel versions. With a comparison of the various compression times and their corresponding d...

1 Motivation Measuring the similarity between two strings, through such standard measures as Hamming distance, edit distance, and longest common subsequence, is one of the fundamental problems in pattern matching. We consider the problem of nding the longest common subsequence of two strings. A well-known dynamic programming algorithm computes the longest common subsequence of strings X and Y i...