A weak square in a binary word is a pair of adjacent non-empty blocks of the same length, having the same number of 1s. A weak circular square is a weak square which is possibly wrapped around the word: the tail protruding from the right end of the word reappears at the left end. Two weak circular squares are equivalent if they have the same length and contain the same number of ones. We prove ...

We investigate experimentally several routing algorithms for asynchronous deflection networks, i.e., ones that operate in an unslotted manner. We determine the impact of an extra input buffer space on the quality of routing decisions. Finally, we compare the performance of asynchronous and synchronous deflection networks.

In this paper GI/G/1 queueing systems with buffer overflows are involved. First, we will give asymptotic expressions for the long-run fraction of rejected customers, in case the buffer capacity K grows large. Furthermore, we give a non-trivial upper and lower bound for this fraction for all K larger than some constant. Finally, we treat a method to speed up the simulation of the fraction of rej...

We introduce an architectural software formalism, buffer automata, for the specification, implementation and analysis of a particular class of discrete interactive systems and devices. The approach defines a layer between the physical user interface and the application (if any) and provides a clear framework for highlighting a number of interaction design issues, in particular around modes and ...

Linear hashing with partial expansions is a file organization intended for dynamic files. In this paper an improved version of the method is presented. Instead of having a separate overflow area, the storage area for overflow records is incorporated into the main file. Hence, all the records are stored in one file which grows and shrinks according to the number of records stored. By using sever...

An introduction to the key topics and challenges in Botnet, buffer overflow vulnerability, privacy-preserving and others.