We obtain a fermionic coset realization of the primaries of minimal unitary models and show how their four-point functions may be calculated by the use of a reduction formula. We illustrate the construction for the Ising model, where we obtain an explicit realization of the energy operator, Onsager fermions, as well as of the order and disorder operators realizing the dual algebra, in terms of ...

The paper deals with the realization theory of linear and bilinear switched systems. Necessary and sufficient conditions are formulated for a family of input-output maps to be realizable by a (bi)linear switched system. Characterization of minimal realizations is presented. The paper treats two types of (bi)linear switched systems. The first one is when all switching sequences are allowed. The ...

We consider the problem of constructing a bipartite graph whose degrees lie in prescribed intervals. Necessary and sufficient conditions for the existence of such graphs are well-known. However, existing realization algorithms suffer from large running times. In this paper, we present a realization algorithm that constructs an appropriate bipartite graph G = (U, V,E) in O(|U | + |V | + |E|) tim...

Optimal construction of quantum operations is a fundamental problem in the realization of quantum computation. We here introduce a newly discovered quantum gate, B, that can implement any arbitrary two-qubit quantum operation with minimal number of both two- and single-qubit gates. We show this by giving an analytic circuit that implements a generic nonlocal two-qubit operation from just two ap...

In this paper a concept for hardware realization of graphic tactile display for visually impaired peoples is presented. For realization of tactile actuators bi-stable, solenoids and PIC based control board are used. The selected algorithm for series activation of each row of display allows using minimal number of active components to set and reset the solenoids. Finally, a program algorithm of ...

This paper presents theory, algorithms, and validation results for system identification of continuous-time statespace models from finite input–output sequences. The algorithms developed are methods of subspace model identification and stochastic realization adapted to the continuous-time context. The resulting model can be decomposed into an input–output model and a stochastic innovations mode...

Quantum convolutional codes, like their classical counterparts, promise to offer higher error correction performance than block codes of equivalent encoding complexity, and are expected to find important applications in reliable quantum communication where a continuous stream of qubits is transmitted. Grassl and Roetteler devised an algorithm to encode a quantum convolutional code with a “pearl...

Active contour is an effective technique for object boundary extraction in biomedical images such as blood vessel tracing or optic disc extraction in retinal images. The traditional serial realization of contour finding needs considerable processing time. This paper presents a parallel realization of the active contour model to speed up the contour convergence process. The initially drawn conto...

The article explores aspects of the role of prosody as a contextualization cue in aphasic conversation through auditory and acoustic analysis of an aphasic speaker's use of pitch variation in responses to closed yes/no-requests. The results reveal two prosodic realizations of 'yes' and 'no' contextualizing different kinds of responses: a flat realization with no prolongation and minimal pauses,...

In recent work, ARMARKOV representations have been proposed as an extension of ARMA representations of nite-dimensional linear time-invariant systems. ARMARKOV representations have the same form as ARMA representations, but explicitly involve Markov parameters. This paper generalizes ARMA least-squares time-domain identi cation to ARMARKOV representations. The ARMARKOV/least-squares identi cati...