Computer generated singing choir synthesis can be achieved by two means: clone transformation of a single voice or concatenation of real choir recording snippets. As of today, the synthesis quality for these two methods lack of naturalness and intelligibility respectively. Unisong is a new concatenation based choir singing synthesizer able to generate a high quality synthetic performance out of...

Low-density parity-check (LDPC) codes have been shown to deliver capacity approaching performance; however, problematic graphical structures (e.g. trapping sets) in the Tanner graph of some LDPC codes can cause high error floors in bit-errorratio (BER) performance under conventional sum-product algorithm (SPA). This paper presents a serial concatenation scheme to avoid the trapping sets and to ...

i Given any word w, the reduced word w associated to w is any word obtained from w by reduction, such that wi cannot be reduced any further. Given two words w1 and w2 of A, the concatenation of w1 and w2 is the word w = w1w2. The empty word is denoted e. The set of all reduced words is denoted FA. With product defined as the reduced concatenation, this set becomes a group, called the free group...

In this tutorial paper, we consider various classes of automata generated by simple rewrite transition systems. These classes are deened by two natural hierarchies, one given by interpreting concatenation of symbols in the rewrite system as sequential composition, and the other by interpreting concatenation as parallel composition. In this way we provide natural deenitions for commutative (para...

As a result of the ongoing paradigm shift towards web-based software, the JavaScript language has become one of the most widely used programming languages in the world. In this paper we propose some extensions to JavaScript in order to support concatenation-based prototype inheritance – an alternative model of object-oriented programming that was first introduced in the early 1990s.

There is a straightforward generalization of traces to infinite traces as dependence graphs where every vertex has finitely many predecessors, or what is the same, as a backward closed and directed set of traces with respect to prefix ordering. However, this direct approach has a drawback since it does not allow one to describe some basic phenomena which are related to concatenation. We solve t...

We describe a corpus-based approach to improving synthesized speech quality and present two useful cost functions for unit selection. One is pitch-synchronous cross correlation for concatenation costs to reduce the noise caused by phase mismatch at concatenation points. The other is a discontinuous cost function for internal and concatenation costs to eliminate unnecessary cost calculation. An ...

Runtime verification (RV) is a pragmatic and scalable, yet rigorous technique, to assess the correctness of complex systems, including cyber-physical systems (CPS). By measuring how robustly a CPS run satisfies a specification, RV allows in addition, to quantify the resiliency of a CPS to perturbations. In this paper we propose Algebraic Runtime Verification (ARV), a general, semantic framework...