An ongoing international arts-research-industry collaborative project focusing on the design and implementation of innovative car alarm systems, alarm/will/sound has a firm theoretical basis in theories of sound perception and classification of Pierre Schaeffer and the acousmatic tradition. In turn, the timbre perception, modelling and design components of this project have had a significant influence on a range of fixed media, electroacoustic and media installation works realised in parallel to the experimental research. An examination of the multiple points of contact and cross-influence between auditory warning research and artistic practice forms the backbone of this article, with an eye towards continued development in both the research and the artistic domains of the project.

This paper presents a study about methods for normalization of historical texts. The aim of these methods is learning relations between historical and contemporary word forms. We have compiled training and test corpora for different languages and scenarios, and we have tried to read the results related to the features of the corpora and languages. Our proposed method, based on weighted finite-state transducers, is compared to previously published ones. Our method learns to map phonological changes using a noisy channel model; it is a simple solution that can use a limited amount of supervision in order to achieve adequate performance. The compiled corpora are ready to be used for other researchers in order to compare results. Concerning the amount of supervision for the task, we investigate how the size of training corpus affects the results and identify some interesting factors to anticipate the difficulty of the task.

It has been known that categorical interpretations of dependent type theory with Σ- and Id-types induce weak factorization systems. When one has a weak factorization system $({\cal L},{\cal R})$ on a category $\mathbb{C}$ in hand, it is then natural to ask whether or not $({\cal L},{\cal R})$ harbors an interpretation of dependent type theory with Σ- and Id- (and possibly Π-) types. Using the framework of display map categories to phrase this question more precisely, one would ask whether or not there exists a class ${\cal D}$ of morphisms of $\mathbb{C}$ such that the retract closure of ${\cal D}$ is the class ${\cal R}$ and the pair $(\mathbb{C},{\cal D})$ forms a display map category modeling Σ- and Id- (and possibly Π-) types. In this paper, we show, with the hypothesis that $\cal{C}$ is Cauchy complete, that there exists such a class $\cal{D}$ if and only if $(\mathbb{C},\cal{R})$itself forms a display map category modeling Σ- and Id- (and possibly Π-) types. Thus, we reduce the search space of our original question from a potentially proper class to a singleton.

This paper clarifies that linear implication defines a branching-time preorder, preserved in all contexts, when used to compare embeddings of process in non-commutative logic. The logic considered is a first-order extension of the proof system BV featuring a de Morgan dual pair of nominal quantifiers, called BV1. An embedding of π-calculus processes as formulae in BV1 is defined, and the soundness of linear implication in BV1 with respect to a notion of weak simulation in the π -calculus is established. A novel contribution of this work is that we generalise the notion of a ‘left proof’ to a class of formulae sufficiently large to compare embeddings of processes, from which simulating execution steps are extracted. We illustrate the expressive power of BV1 by demonstrating that results extend to the internal π -calculus, where privacy of inputs is guaranteed. We also remark that linear implication is strictly finer than any interleaving preorder.