The paper presents a new script classification method for the discrimination of the South Slavic medieval labels. It consists in the textural analysis of the script types. In the first step, each letter is coded by the equivalent script type, which is defined by its typographical features. Obtained coded text is subjected to the run-length statistical analysis and to the adjacent local binary p...

This paper presents a pipeline algorithm for MPI Reduce that uses a Run Length Encoding (RLE) scheme to improve the global reduction of sparse floating-point data. The RLE scheme is directly incorporated into the reduction process and causes only low overheads in the worst case. The high throughput of the RLE scheme allows performance improvements when using high performance interconnects, too....

Introduction: Up to now, besides sparsity, the standard compressed sensing methods used in MR do not exploit any other prior information about the underlying signal. In general, the MR data in its sparse representation always exhibits some structure. As an example, for dynamic cardiac MR data, the signal support in its sparse representation (x-f space) is always in compact form [1]. In this wor...

The purpose of this article is to present an optimization model for designing an acceptance sampling plan based on cumulative sum of run length of conforming items. The objective is to minimize the total loss including both the producer and consumer losses. The concept of minimum angle method is applied to consider producer and consumer risks in the optimization model. Also the average number o...

MOTIVATION Matching a biological sequence against a probabilistic pattern (or profile) is a common task in computational biology. A probabilistic profile, represented as a scoring matrix, is more suitable than a deterministic pattern to retain the peculiarities of a given segment of a family of biological sequences. Brute-force algorithms take O(NP) to match a sequence of N characters against a...