A method for encoding and decoding spectrum shaped binary run-length constrained sequences is described. The binary sequences with predefined range of exponential sums are introduced. On the base of Cover’s enumerative scheme, recurrence relations for calculating the number of these sequences are derived. Implementation of encoding and decoding procedures is also shown.

The run vector of a binary sequence reflects the run structure of the sequence, which is given by the set of all substrings of the run length encoding. The run vector and the aperiodic autocorrelations of a binary sequence are strongly related. In this paper, we analyze the run vector of skew-symmetric binary sequences. Using the derived results we present a new and different proof that there e...

We give algorithms to find the optimal disjoint paths around a rectangle. The set of disjoint paths connects a set of sources to a set of sinks (no fixed pairing between the sources and sinks) on the boundary of a rectangle where either the longest path length or the total path length is minimized. One algorithm finds the set of disjoint paths with the longest path length minimized in O(n log n...

This paper proposes a method of using run-length coding to perform thinning. First, we construct graphs from characters. The attributes (vertical lines, horizontal lines or points) of each node in the graph are determined according to the node’s relationship to the nodes above and below it (we will refer to these relationships as global features) and the black runs within the node. Intersection...

Speakers strive to minimize inter-turn gaps when engaged in a dialogue. However, little work has addressed what impact this might have on the fluency of the following speech. In this paper we explore whether there are interactions between turn-taking gaps and turn-initial disfluencies and if the social pressure to respond to questions plays a role in that interaction. Our results indicate that ...

The Research Laboratory of Electronics (RLE) was founded in 1946 following the ground-breaking research its predecessor conducted leading to the development of ultra high hrequency tadar, changing the course of World War II. Cognizant of its rich history and focused on maintaining its position as MIT’s leading interdisciplinary research organization, RLE fosters a stimulating and supportive env...

In recent years, we proposed a number of new and very effective features for automatic writer identification and verification. They are probability distribution functions (PDFs) extracted from the handwriting images and characterize writer individuality independently of the textual content of the written samples. In this paper, we perform an extensive analysis of feature combinations. In our fu...

The problem of coding low-entropy information sources is considered. Since the run-length code was offered about 50 years ago by Shannon, it is known that for such sources there exist coding methods much simpler than for sources of a general type. However, known coding methods of low-entropy sources do not reach the given redundancy. In this correspondence, a new method of coding low-entropy so...

In this paper we present and simulate a new self–organising algorithm for P2P unstructured networks inspired by human relationships. This algorithm, called PROSA , tries to simulate the evolution of human relationships from simple acquaintance to friendship and partnership. Our target is to obtain a self–reconfiguring P2P system which possesses some of the desirable features of social communiti...

In this paper, we present a family of novel P2P routing schemes based on Chord [26] (and its variation FChord(α) [2]) that trades off uniformity with efficiency without using any additional overhead. We prove that H-FChord(α)’s routing is more efficient than in F-Chord(α) in terms of its average path length that is O(logn/ log logn). We also show, by simulations, that H-F-Chord(α) is more effic...