Logics for belief functions on MV-algebras

In this paper we present a generalization of belief functions over fuzzy events. In particular we focus on belief functions defined in the algebraic framework of finite MV-algebras of fuzzy sets. We introduce a fuzzy modal logic to formalize reasoning with belief functions on many-valued events. We prove, among other results, that several different notions of belief functions can be characterized in a quite uniform way, just by slightly modifying the complete axiomatization of one of the modal logics involved in the definition of our formalism. © 2012 Elsevier Inc. All rights reserved.

A Cross-modal Approach for Karaoke Artifacts Correction

Karaoke singing is a popular form of entertainment in several parts of the world. Since this genre of performance attracts amateurs, the singing often has artifacts related to scale, tempo, and synchrony. We have developed an approach to correct these artifacts using cross-modal multimedia streams information. We first perform adaptive sampling on the user's rendition and then use the original singer's rendition as well as the video caption highlighting information in order to correct the pitch, tempo and the loudness. A method of analogies has been employed to perform this correction. The basic idea is to manipulate the user's rendition in a manner to make it as similar as possible to the original singing. A pre-processing step of noise removal due to feedback and huffing also helps improve the quality of the user's audio. The results are described in the paper which shows the effectiveness of this multimedia approach.

Modal Representation of the Resonant Body within a Finite Difference Framework for Simulation of String Instruments

This paper investigates numerical simulation of a string coupled
transversely to a resonant body. Starting from a complete nite
difference formulation, a second model is derived in which the
body is represented in modal form. The main advantage of this hybrid form is that the body model is scalable, i.e. the computational
complexity can be adjusted to the available processing power. Numerical results are calculated and discussed for simplied models
in the form of string-string coupling and string-plate coupling.

Structure-Guided Investigation of Lipopolysaccharide O-Antigen Chain Length Regulators Reveals Regions Critical for Modal Length Control

The O-antigen component of the lipopolysaccharide (LPS) represents a population of polysaccharide molecules with nonrandom (modal) chain length distribution. The number of the repeat O units in each individual O-antigen polymer depends on the Wzz chain length regulator, an inner membrane protein belonging to the polysaccharide copolymerase (PCP) family. Different Wzz proteins confer vastly different ranges of modal lengths (4 to > 100 repeat units), despite having remarkably conserved structural folds. The molecular mechanism responsible for the selective preference for a certain number of O units is unknown. Guided by the three-dimensional structures of PCPs, we constructed a panel of chimeric molecules containing parts of two closely related Wzz proteins from Salmonella enterica and Shigella flexneri which confer different O-antigen chain length distributions. Analysis of the O-antigen length distribution imparted by each chimera revealed the region spanning amino acids 67 to 95 (region 67 to 95), region 200 to 255, and region 269 to 274 as primarily affecting the length distribution. We also showed that there is no synergy between these regions. In particular, region 269 to 274 also influenced chain length distribution mediated by two distantly related PCPs, WzzB and FepE. Furthermore, from the 3 regions uncovered in this study, region 269 to 274 appeared to be critical for the stability of the oligomeric form of Wzz, as determined by cross-linking experiments. Together, our data suggest that chain length determination depends on regions that likely contribute to stabilize a supramolecular complex.

O-antigen modal chain length in Shigella flexneri 2a is growth-regulated through RfaH-mediated transcriptional control of the wzy gene

Shigella flexneri 2a 2457T produces lipopolysaccharide (LPS) with two O-antigen (OAg) chain lengths: a short (S-OAg) controlled by WzzB and a very long (VL-OAg) determined by Wzz(pHS-2). This study demonstrates that the synthesis and length distribution of the S. flexneri OAg are under growth-phase-dependent regulation. Quantitative electrophoretic analysis showed that the VL-OAg increased during growth while the S-OAg distribution remained constant. Increased production of VL-OAg correlated with the growth-phase-regulated expression of the transcription elongation factor RfaH, and was severely impaired in a DeltarfaH mutant, which synthesized only low-molecular-mass OAg molecules and a small amount of S-OAg. Real-time RT-PCR revealed a drastic reduction of wzy polymerase gene expression in the DeltarfaH mutant. Complementation of this mutant with the wzy gene cloned into a high-copy-number plasmid restored the bimodal OAg distribution, suggesting that cellular levels of Wzy influence not only OAg polymerization but also chain-length distribution. Accordingly, overexpression of wzy in the wild-type strain resulted in production of a large amount of high-molecular-mass OAg molecules. An increased dosage of either wzzB or wzz(pHS-2) also altered OAg chain-length distribution. Transcription of wzzB and wzz(pHS-2) genes was regulated during bacterial growth but in an RfaH-independent manner. Overall, these findings indicate that expression of the wzy, wzzB and wzz(pHS-2) genes is finely regulated to determine an appropriate balance between the proteins responsible for polymerization and chain-length distribution of S. flexneri OAg.

Distinguished algebraic semantics for t-norm based fuzzy logics:Methods and algebraic equivalencies

This paper is a contribution to Mathematical fuzzy logic, in particular to the algebraic study of t-norm based fuzzy logics. In the general framework of propositional core and ?-core fuzzy logics we consider three properties of completeness with respect to any semantics of linearly ordered algebras. Useful algebraic characterizations of these completeness properties are obtained and their relations are studied. Moreover, we concentrate on five kinds of distinguished semantics for these logics-namely the class of algebras defined over the real unit interval, the rational unit interval, the hyperreals (all ultrapowers of the real unit interval), the strict hyperreals (only ultrapowers giving a proper extension of the real unit interval) and finite chains, respectively-and we survey the known completeness methods and results for prominent logics. We also obtain new interesting relations between the real, rational and (strict) hyperreal semantics, and good characterizations for the completeness with respect to the semantics of finite chains. Finally, all completeness properties and distinguished semantics are also considered for the first-order versions of the logics where a number of new results are proved. © 2009 Elsevier B.V. All rights reserved.

Multi-Modal CTL:Completeness, Complexity, and an Application

We define a multi-modal version of Computation Tree Logic (ctl) by extending the language with path quantifiers E and A where d denotes one of finitely many dimensions, interpreted over Kripke structures with one total relation for each dimension. As expected, the logic is axiomatised by taking a copy of a ctl axiomatisation for each dimension. Completeness is proved by employing the completeness result for ctl to obtain a model along each dimension in turn. We also show that the logic is decidable and that its satisfiability problem is no harder than the corresponding problem for ctl. We then demonstrate how Normative Systems can be conceived as a natural interpretation of such a multi-dimensional ctl logic. © 2009 Springer Science+Business Media B.V.

Modal Extraction for Wind Turbines using Moving Window Subspace Identification

This paper proposes a method for wind turbine mode identification using the multivariable output error statespace (MOESP) identification algorithm. The paper incorporates a fast moving window QR decomposition and propagator method from array signal processing, yielding a moving window subspace identification algorithm. The algorithm assumes that the system order is known as a priori and remains constant during identification. For the purpose of extracting modal information for turbines modelled as a linear parameter varying (LPV) system, the algorithm is applicable since a nonlinear system can be approximated as a piecewise time invariant system in consecutive data windows. The algorithm is exemplified using numerical simulations which show that the moving window algorithm can track the modal information. The paper also demonstrates that the low computational burden of the algorithm, compared to conventional batch subspace identification, has significant implications for online implementation.