We present a parity-based space compaction technique that eliminates aliasing for any given fault model. The test responses from a circuit under test with a large number of primary outputs are merged into a narrow signature stream using a multiple-output parity tree. The functions realized by the different outputs of the compactor are determined by a procedure that targets the desired fault mod...

Zur Generierung und Bearbeitung von Musik werden überwiegend Computer eingesetzt. Im Gegensatz zur Entwicklung der Software-Applikationen hin zu höherer Leistungsfähigkeit und Komplexität, verläuft die entsprechende Entwicklung von Hardware-Interfaces nur langsam. Dadurch klafft häufig eine Lücke zwischen der potentiellen Mächtigkeit einer Musik-Software und ihrer, gerade im kreativen Bereich w...

In this paper, a set-membership parity space approach for linear uncertain dynamic systems is proposed. First, a set of parity relations derived from the parity space approach is obtained by means of a transformation derived from the system characteristic polynomial. As a result of this transformation, parity relations can be expressed in regressor form. On the one hand, this facilitates the pa...

In a finite graph, an edge set Z is an element of the cycle space if and only if every vertex has even degree in Z. We extend this basic result to the topological cycle space, which allows infinite circuits, of locally finite graphs. In order to do so, it becomes necessary to attribute a parity to the ends of the graph.

Based on the reciprocity theorem, we put forward a generalized parametric space for an arbitrary transfer matrix with parity time (PT) symmetry. Through this space, one can extract complete information involving PT phases, reflectances, transmittance and known extraordinary scattering phenomena. We demonstrate heterostructure coherent perfect absorption-lasing, anisotropic transmission resonanc...

Symmetry properties of physical laws with respect to space-inversion, time-reversal and charge-conjugation are investigated in detail in the framework of the quantized 6eld theory. In most cases, the requirements of invariance for these transformations are automatically satisfied; in a few other cases they can impose certain conditions on the ways in which different types of interaction are to ...

Many modern storage systems adopt erasure coding to provide data availability guarantees with low redundancy. Log-based storage is often used to append new data rather than overwrite existing data so as to achieve high update efficiency, but introduces significant I/O overhead during recovery due to reassembling updates from data and parity chunks. We propose parity logging with reserved space,...

In this paper we propose storage allocation schemes to minimize the buffer requirements for fault-tolerant video-ondemand (VOD) servers with disk arrays. To guarantee the high reliability of video service, the servers usually adopt parity-encoding techniques in which data blocks and their associated parity block form a parity group. For real-time video service, all the blocks in a parity group ...

In this paper it is shown that deciding the winner of a parity game is in LogCFL, if the underlying graph has bounded tree-width, and in LogDCFL, if the tree-width is at most 2. It is also proven that parity games of bounded clique-width can be solved in LogCFL via a log-space reduction to the bounded tree-width case, assuming that a k-expression for the parity game is part of the input.