Taxonomic analysis of marine phytoplankton

Samples of sea water contain phytoplankton taxa in varying amounts, and marine scientists are interested in the relative abundance of each taxa. Their relative biomass can be ascertained indirectly by measuring the quantity of various pigments using high performance liquid chromatography. However, the conversion from pigment to taxa is mathematically non trivial as it is a positive matrix factorisation problem where both matrices are unknown beyond the level of initial estimates. The prior information on the pigment to taxa conversion matrix is used to give the problem a unique solution. An iteration of two non-negative least squares algorithms gives satisfactory results. Some sample analysis of data indicates prospects for this type of analysis. An alternative more computationally intensive approach using Bayesian methods is discussed.

Closed-form solutions for low-rank non-rigid reconstruction

Recovering the motion of a non-rigid body from a set of monocular images permits the analysis of dynamic scenes in uncontrolled environments. However, the extension of factorisation algorithms for rigid structure from motion to the low-rank non-rigid case has proved challenging. This stems from the comparatively hard problem of finding a linear “corrective transform” which recovers the projection and structure matrices from an ambiguous factorisation. We elucidate that this greater difficulty is due to the need to find multiple solutions to a non-trivial problem, casting a number of previous approaches as alleviating this issue by either a) introducing constraints on the basis, making the problems nonidentical, or b) incorporating heuristics to encourage a diverse set of solutions, making the problems inter-dependent. While it has previously been recognised that finding a single solution to this problem is sufficient to estimate cameras, we show that it is possible to bootstrap this partial solution to find the complete transform in closed-form. However, we acknowledge that our method minimises an algebraic error and is thus inherently sensitive to deviation from the low-rank model. We compare our closed-form solution for non-rigid structure with known cameras to the closed-form solution of Dai et al. [1], which we find to produce only coplanar reconstructions. We therefore make the recommendation that 3D reconstruction error always be measured relative to a trivial reconstruction such as a planar one.

Towards an exact factorization of the molecular wave function

An exact single-product factorisation of the molecular wave function for the timedependent Schrodinger equation is investigated by using an ansatz involving a phasefactor. By using the Frenkel variational method, we obtain the Schrodinger equations for the electronic and nuclear wave functions. The concept of a potential energy surface (PES) is retained by introducing a modified Hamiltonian as suggested earlier by Cederbaum. The parameter in the phase factor is chosen such that the equations of motion retain the physically appealing Born- Oppenheimer-like form, and is therefore unique.

Models for acoustic propagation through turbofan exhaust flows-lined ducts

Turbomachinery noise radiating into the rearward arc is an important problem. This noise is scattered by the trailing edges of the nacelle and the jet exhaust, and interacts with the shear layers between the external flow, bypass stream and jet, en route to the far field. In the past a range of relevant model problems involving semi-infinite cylinders have been solved. However, one limitation of these previous solutions is that they do not allow for the jet nozzle protruding a finite distance beyond the end of the nacelle (or in certain configurations being buried a finite distance upstream). With this in mind, we have used the matrix Wiener-Hopf technique to allow precisely this finite nacelle-jet nozzle separation to be included. We have previously reported results for the case of hard-walled ducts, which requires factorisation of a 2 × 2 matrix. In this paper we extend this work by allowing one of the duct walls, in this case the outer wall of the jet pipe, to be acoustically lined. This results in the need to factorise a 3 × 3 matrix, which is completed by use of a combination of pole-removal and Pad́e approximant techniques. Sample results are presented, investigating in particular the effects of exit plane stagger and liner impedance. Here we take the mean flow to be zero, but extension to nonzero Mach numbers in the core and bypass flow has also been completed. Copyright © 2009 by Nigel Peake & Ben Veitch.

Comparison of different scheduling techniques for H-infinity controllers

Several approaches to designing schedule H-infinity control systems are compared. These include a controller switching approach and also parameter scheduling of an observer representation of the controller. They are illustrated by application to a Generic VSTOI. Aircraft Model (GVAM) supplied by The Royal Aerospace Establishment (RAE) at Bedford. The switched design has been tested on the simulator at RAE Bedford. The linear H-infinity designs make use of a loop-shaping followed by robust stabilisation to additive perturbations of a normalised coprime factorisation of the shaped plans. The different scheduling approaches are compared with respect to achieved robust stability levels. performance and complexity of implementation.

Models for acoustic propagation through turbofan exhaust flows

Turbomachinery noise radiating into the rearward arc is an important problem. This noise is scattered by the trailing edges of the nacelle and the jet exhaust, and interacts with the shear layers between the external flow, bypass stream and jet, en route to the far field. In the past a range of relevant model problems involving semi-infinite cylinders have been solved. However, one limitation of previous solutions is that they do not allow for the jet nozzle to protrude a finite distance beyond the end of the nacelle (or in certain configurations being buried a finite distance upstream). In this paper we use the matrix Wiener-Hopf technique, which will allow precisely the finite nacelle-jet nozzle separation to be included. The crucial step in our work is to factorise a certain matrix as a product of terms analytic and invertible in the upper/lower halves of the complex plane. The way we do this matrix factorisation is quite different in the buried and protruding nozzle cases. In the buried case our solution method is the so-called pole-removal technique. In the technically more demanding protruding case, however, we must first use Pade approximants to generate a uniformly-valid, meromorphic representation of a certain function, before the same pole-removal method can be applied. Sample results are presented, investigating in particular the effects of exit plane stagger. © 2007 by B Veitch and N Peake.

Non-existence of polar factorisations and polar inclusion of a vector-valued mapping

R.J. DOUGLAS, Non-existence of polar factorisations and polar inclusion of a vector-valued mapping. Intern. Jour. Of Pure and Appl. Math., (IJPAM) 41, no. 3 (2007).

New FFT architecture and chip design for motion compensation based on phase correlation

Details of a new low power FFT processor for use in digital television applications are presented. This has been fabricated using a 0.6 µm CMOS technology and can perform a 64 point complex forward or inverse FFT on real-rime video at up to 18 Megasamples per second. It comprises 0.5 million transistors in a die area of 7.8×8 mm and dissipates 1 W. Its performance, in terms of computational rate per area per watt, is significantly higher than previously reported devices, leading to a cost-effective silicon solution for high quality video processing applications. This is the result of using a novel VLSI architecture which has been derived from a first principles factorisation of the DFT matrix and tailored to a direct silicon implementation.

Non-negative matrix decomposition approaches to frequency domain analysis of music audio signals

On étudie l’application des algorithmes de décomposition matricielles tel que la Factorisation Matricielle Non-négative (FMN), aux représentations fréquentielles de signaux audio musicaux. Ces algorithmes, dirigés par une fonction d’erreur de reconstruction, apprennent un ensemble de fonctions de base et un ensemble de coef- ficients correspondants qui approximent le signal d’entrée. On compare l’utilisation de trois fonctions d’erreur de reconstruction quand la FMN est appliquée à des gammes monophoniques et harmonisées: moindre carré, divergence Kullback-Leibler, et une mesure de divergence dépendente de la phase, introduite récemment. Des nouvelles méthodes pour interpréter les décompositions résultantes sont présentées et sont comparées aux méthodes utilisées précédemment qui nécessitent des connaissances du domaine acoustique. Finalement, on analyse la capacité de généralisation des fonctions de bases apprises par rapport à trois paramètres musicaux: l’amplitude, la durée et le type d’instrument. Pour ce faire, on introduit deux algorithmes d’étiquetage des fonctions de bases qui performent mieux que l’approche précédente dans la majorité de nos tests, la tâche d’instrument avec audio monophonique étant la seule exception importante.

Modeling High-Dimensional Audio Sequences with Recurrent Neural Networks

Cette thèse étudie des modèles de séquences de haute dimension basés sur des réseaux de neurones récurrents (RNN) et leur application à la musique et à la parole. Bien qu'en principe les RNN puissent représenter les dépendances à long terme et la dynamique temporelle complexe propres aux séquences d'intérêt comme la vidéo, l'audio et la langue naturelle, ceux-ci n'ont pas été utilisés à leur plein potentiel depuis leur introduction par Rumelhart et al. (1986a) en raison de la difficulté de les entraîner efficacement par descente de gradient. Récemment, l'application fructueuse de l'optimisation Hessian-free et d'autres techniques d'entraînement avancées ont entraîné la recrudescence de leur utilisation dans plusieurs systèmes de l'état de l'art. Le travail de cette thèse prend part à ce développement. L'idée centrale consiste à exploiter la flexibilité des RNN pour apprendre une description probabiliste de séquences de symboles, c'est-à-dire une information de haut niveau associée aux signaux observés, qui en retour pourra servir d'à priori pour améliorer la précision de la recherche d'information. Par exemple, en modélisant l'évolution de groupes de notes dans la musique polyphonique, d'accords dans une progression harmonique, de phonèmes dans un énoncé oral ou encore de sources individuelles dans un mélange audio, nous pouvons améliorer significativement les méthodes de transcription polyphonique, de reconnaissance d'accords, de reconnaissance de la parole et de séparation de sources audio respectivement. L'application pratique de nos modèles à ces tâches est détaillée dans les quatre derniers articles présentés dans cette thèse. Dans le premier article, nous remplaçons la couche de sortie d'un RNN par des machines de Boltzmann restreintes conditionnelles pour décrire des distributions de sortie multimodales beaucoup plus riches. Dans le deuxième article, nous évaluons et proposons des méthodes avancées pour entraîner les RNN. Dans les quatre derniers articles, nous examinons différentes façons de combiner nos modèles symboliques à des réseaux profonds et à la factorisation matricielle non-négative, notamment par des produits d'experts, des architectures entrée/sortie et des cadres génératifs généralisant les modèles de Markov cachés. Nous proposons et analysons également des méthodes d'inférence efficaces pour ces modèles, telles la recherche vorace chronologique, la recherche en faisceau à haute dimension, la recherche en faisceau élagué et la descente de gradient. Finalement, nous abordons les questions de l'étiquette biaisée, du maître imposant, du lissage temporel, de la régularisation et du pré-entraînement.

Geometric Algebra and Einstein’s Electron

This thesis entitled Geometric algebra and einsteins electron: Deterministic field theories .The work in this thesis clarifies an important part of Koga’s theory.Koga also developed a theory of the electron incorporating its gravitational field, using his substitutes for Einstein’s equation.The third chapter deals with the application of geometric algebra to Koga’s approach of the Dirac equation. In chapter 4 we study some aspects of the work of mendel sachs (35,36,37,).Sachs stated aim is to show how quantum mechanics is a limiting case of a general relativistic unified field theory.Chapter 5 contains a critical study and comparison of the work of Koga and Sachs. In particular, we conclude that the incorporation of Mach’s principle is not necessary in Sachs’s treatment of the Dirac equation.

Mersenne numbers

These notes have been issued on a small scale in 1983 and 1987 and on request at other times. This issue follows two items of news. First, WaIter Colquitt and Luther Welsh found the 'missed' Mersenne prime M110503 and advanced the frontier of complete Mp-testing to 139,267. In so doing, they terminated Slowinski's significant string of four consecutive Mersenne primes. Secondly, a team of five established a non-Mersenne number as the largest known prime. This result terminated the 1952-89 reign of Mersenne primes. All the original Mersenne numbers with p < 258 were factorised some time ago. The Sandia Laboratories team of Davis, Holdridge & Simmons with some little assistance from a CRAY machine cracked M211 in 1983 and M251 in 1984. They contributed their results to the 'Cunningham Project', care of Sam Wagstaff. That project is now moving apace thanks to developments in technology, factorisation and primality testing. New levels of computer power and new computer architectures motivated by the open-ended promise of parallelism are now available. Once again, the suppliers may be offering free buildings with the computer. However, the Sandia '84 CRAY-l implementation of the quadratic-sieve method is now outpowered by the number-field sieve technique. This is deployed on either purpose-built hardware or large syndicates, even distributed world-wide, of collaborating standard processors. New factorisation techniques of both special and general applicability have been defined and deployed. The elliptic-curve method finds large factors with helpful properties while the number-field sieve approach is breaking down composites with over one hundred digits. The material is updated on an occasional basis to follow the latest developments in primality-testing large Mp and factorising smaller Mp; all dates derive from the published literature or referenced private communications. Minor corrections, additions and changes merely advance the issue number after the decimal point. The reader is invited to report any errors and omissions that have escaped the proof-reading, to answer the unresolved questions noted and to suggest additional material associated with this subject.

Mersenne Numbers: consolidated results

This document provides and comments on the results of the Lucas-Lehmer testing and/or partial factorisation of all Mersenne Numbers Mp = 2^p-1 where p is prime and less than 100,000. Previous computations have either been confirmed or corrected. The LLT computations on the ICL DAP is the first implementation of Fast-Fermat-Number-Transform multiplication in connection with Mersenne Number testing. This paper championed the disciplines of systematically testing the Mp, and of double-sourcing results which were not manifestly correct. Both disciplines were adopted by the later GIMPS initiative, the 'Great Internet Mersenne Prime Search, which was itself one of the first web-based distributed-community projects.

Ordinal random fields for recommender systems

Recommender Systems heavily rely on numerical preferences, whereas the importance of ordinal preferences has only been recognised in recent works of Ordinal Matrix Factorisation (OMF). Although the OMF can effectively exploit ordinal properties, it captures only the higher-order interactions among users and items, without considering the localised interactions properly. This paper employs Markov Random Fields (MRF) to investigate the localised interactions, and proposes a unified model called Ordinal Random Fields (ORF) to take advantages of both the representational power of the MRF and the ease of modelling ordinal preferences by the OMF. Experimental result on public datasets demonstrates that the proposed ORF model can capture both types of interactions, resulting in improved recommendation accuracy.

The Morse oscillator generalised from supersymmetry

Using the factorisation method in supersymmetric quantum mechanics the author determines new potentials from the Morse oscillator. This method is applied although the ladder operators are not used.