In this paper the performance of the support vector machine (SVM) on a speaker verification task is assessed. Since speaker verification requires binary decisions, support vector machines seem to be a promising candidate to perform the task. A new technique for normalising the polynomial kernel is developed and used to achieve performance comparable to other classifiers on the YOHO database. We...

For fully-extended, orthogonal infinitary Combinatory Reduction Systems, we prove that terms with perpetual reductions starting from them do not have (head) normal forms. Using this, we show that 1. needed reduction strategies are normalising for fully-extended, orthogonal infinitary Combinatory Reduction Systems, and that 2. weak and strong normalisation coincide for such systems as a whole an...

The sixth author’s name is spelled incorrectly. The correct name is: Helen P. Makarenkova. The correct citation is: Collins-Hooper H, Sartori R, Giallourou N, Matsakas A, Mitchell R, Makarenkova HP, et al. (2015) Symmorphosis through Dietary Regulation: A Combinatorial Role for Proteolysis, Autophagy and Protein Synthesis in Normalising Muscle Metabolism and Function of Hypertrophic Mice after ...

We give a brief introduction to the clocked λ-calculus, an extension of the classical λ-calculus with a unary symbol τ used to witness the β-steps. In contrast to the classical λ-calculus, this extension is infinitary strongly normalising and infinitary confluent. The infinitary normal forms are enriched Lévy–Longo Trees, which we call clocked Lévy–Longo Trees. 1998 ACM Subject Classification D...

Constraints on the parameters in a Bayesian hierarchical model typically make Bayesian computation and analysis complicated. Posterior densities that contain analytically intractable integrals as normalising constants depending on the hyperparameters often make implementation of Gibbs sampling or the Metropolis algorithms difficult. By using reweighting mixtures (Geyer, 1995), we develop altern...

We introduce the framework of algebraic pure type systems, a generalisation of pure type systems with higher order rewriting a la Jouannaud-Okada, and initiate a generic study of the modular properties of these systems. We give a general criterion for a system of this framework to be strongly normalising. As an application of our criterion , we recover all previous strong normalisation results ...

Protective effect of ethanolic extract of polyherbalformulation (PHF) of three medicinalplants was studied on carbon tetrachloride induced liver damage in rats. Treatment with 250mg I kg b.w. of ethanolic extract of PHF protected rats against carbon tetrachloride liver injury by significantly lowering 5'NT, GGF, GDH and SDH and bilirubin levels compared to control group of rats. Normalising the...

This paper presents a simple notion of proof net for multiplicative linear logic with units. Cut elimination is direct and strongly normalising, in contrast to previous approaches which resorted to moving jumps (attachments) of par units during normalisation. Composition in the resulting category of proof nets is simply path composition: all of the dynamics happens in GoI(Setp), the geometry-of...

We describe a type system for the linear-algebraic lambda-calculus. The type system accounts for the part of the language emulating linear operators and vectors, i.e. it is able to statically describe the linear combinations of terms resulting from the reduction of programs. This gives rise to an original type theory where types, in the same way as terms, can be superposed into linear combinati...