Finite dimensional semigroup quadratic algebras with the minimal number of relations

A quadratic semigroup algebra is an algebra over a field given by the generators x_1, . . . , x_n and a finite set of quadratic relations each of which either has the shape x_j x_k = 0 or the shape x_j x_k = x_l x_m . We prove that a quadratic semigroup algebra given by n generators and d=(n^2+n)/4 relations is always infinite dimensional. This strengthens the Golod–Shafarevich estimate for the above class of algebras. Our main result however is that for every n, there is a finite dimensional quadratic semigroup algebra with n generators and d_n relations, where d_n is the first integer greater than (n^2+n)/4 . That is, the above Golod–Shafarevich-type estimate for semigroup algebras is sharp.

Selectable linear or quadratic coupling in an optomechanical system

There has been much interest recently in the analysis of optomechanical systems incorporating dielectric nano- or microspheres inside a cavity field. We analyse here the situation when one of the mirrors of the cavity itself is also allowed to move. We reveal that the interplay between the two oscillators yields a cross-coupling that results in, e.g., appreciable cooling and squeezing of the motion of the sphere, despite its nominal quadratic coupling. We also discuss a simple modification that would allow this cross-coupling to be removed at will, thereby yielding a purely quadratic coupling for the sphere.

Sound Synthesis for Contact-Driven Musical Instruments via Discretisation of Hamilton's Equations

Physical modelling of musical instruments involves studying nonlinear interactions between parts of the instrument. These can pose several difficulties concerning the accuracy and stability of numerical algorithms. In particular, when the underlying forces are non-analytic functions of the phase-space variables, a stability proof can only be obtained in limited cases. An approach has been recently presented by the authors, leading to unconditionally stable simulations for lumped collision models. In that study, discretisation of Hamilton’s equations instead of the usual Newton’s equation of motion yields a numerical scheme that can be proven to be energy conserving. In this paper, the above approach is extended to collisions of distributed objects. Namely, the interaction of an ideal string with a flat barrier is considered. The problem is formulated within the Hamiltonian framework and subsequently discretised. The resulting nonlinearmatrix equation can be shown to possess a unique solution, that enables the update of the algorithm. Energy conservation and thus numerical stability follows in a way similar to the lumped collision model. The existence of an analytic description of this interaction allows the validation of the model’s accuracy. The proposed methodology can be used in sound synthesis applications involving musical instruments where collisions occur either in a confined (e.g. hammer-string interaction, mallet impact) or in a distributed region (e.g. string-bridge or reed-mouthpiece interaction).

Scaling of magneto-quantum-radiative hydrodynamic equations: From laser-produced plasmas to astrophysics

We introduce the equations of magneto-quantum-radiative hydrodynamics. By rewriting them in a dimensionless form, we obtain a set of parameters that describe scale-dependent ratios of characteristic hydrodynamic quantities. We discuss how these dimensionless parameters relate to the scaling between astrophysical observations and laboratory experiments.

New results on stability analysis of delayed recurrent neural networks based on the integral quadratic constraints approach

This paper is concerned with the analysis of the stability of delayed recurrent neural networks. In contrast to the widely used Lyapunov–Krasovskii functional approach, a new method is developed within the integral quadratic constraints framework. To achieve this, several lemmas are first given to propose integral quadratic separators to characterize the original delayed neural network. With these, the network is then reformulated as a special form of feedback-interconnected system by choosing proper integral quadratic constraints. Finally, new stability criteria are established based on the proposed approach. Numerical examples are given to illustrate the effectiveness of the new approach.

QUADrATiC: scalable gene expression connectivity mapping for repurposing FDA-approved therapeutics

Background: Gene expression connectivity mapping has proven to be a powerful and flexible tool for research. Its application has been shown in a broad range of research topics, most commonly as a means of identifying potential small molecule compounds, which may be further investigated as candidates for repurposing to treat diseases. The public release of voluminous data from the Library of Integrated Cellular Signatures (LINCS) programme further enhanced the utilities and potentials of gene expression connectivity mapping in biomedicine. Results: We describe QUADrATiC (http://go.qub.ac.uk/QUADrATiC), a user-friendly tool for the exploration of gene expression connectivity on the subset of the LINCS data set corresponding to FDA-approved small molecule compounds. It enables the identification of compounds for repurposing therapeutic potentials. The software is designed to cope with the increased volume of data over existing tools, by taking advantage of multicore computing architectures to provide a scalable solution, which may be installed and operated on a range of computers, from laptops to servers. This scalability is provided by the use of the modern concurrent programming paradigm provided by the Akka framework. The QUADrATiC Graphical User Interface (GUI) has been developed using advanced Javascript frameworks, providing novel visualization capabilities for further analysis of connections. There is also a web services interface, allowing integration with other programs or scripts.Conclusions: QUADrATiC has been shown to provide an improvement over existing connectivity map software, in terms of scope (based on the LINCS data set), applicability (using FDA-approved compounds), usability and speed. It offers potential to biological researchers to analyze transcriptional data and generate potential therapeutics for focussed study in the lab. QUADrATiC represents a step change in the process of investigating gene expression connectivity and provides more biologically-relevant results than previous alternative solutions.

Nonequilibrium processes from generalized Langevin equations: Realistic nanoscale systems connected to two thermal baths

We extend the generalized Langevin equation (GLE) method [L. Stella, C. D. Lorenz, and L. Kantorovich, Phys. Rev. B 89, 134303 (2014)] to model a central classical region connected to two realistic thermal baths at two different temperatures. In such nonequilibrium conditions a heat flow is established, via the central system, in between the two baths. The GLE-2B (GLE two baths) scheme permits us to have a realistic description of both the dissipative central system and its surrounding baths. Following the original GLE approach, the extended Langevin dynamics scheme is modified to take into account two sets of auxiliary degrees of freedom corresponding to the mapping of the vibrational properties of each bath. These auxiliary variables are then used to solve the non-Markovian dissipative dynamics of the central region. The resulting algorithm is used to study a model of a short Al nanowire connected to two baths. The results of the simulations using the GLE-2B approach are compared to the results of other simulations that were carried out using standard thermostatting approaches (based on Markovian Langevin and Nosé-Hoover thermostats). We concentrate on the steady-state regime and study the establishment of a local temperature profile within the system. The conditions for obtaining a flat profile or a temperature gradient are examined in detail, in agreement with earlier studies. The results show that the GLE-2B approach is able to treat, within a single scheme, two widely different thermal transport regimes, i.e., ballistic systems, with no temperature gradient, and diffusive systems with a temperature gradient.

Exact and numerical solutions for diffusio-reaction equations with convection term

Esta dissertação estuda essencialmente dois problemas: (A) uma classe de equações unidimensionais de reacção-difusão-convecção em meios não uniformes (dependentes do espaço), e (B) um problema elíptico não-linear e paramétrico ligado a fenómenos de capilaridade. A Análise de Perturbação Singular e a dinâmica de Hamilton-Jacobi são utilizadas na obtenção de expressões assimptóticas para a solução (com comportamento de frente) e para a sua velocidade de propagação. Os seguintes três métodos de decomposição, Adomian Decomposition Method (ADM), Decomposition Method based on Infinite Products (DIP), e New Iterative Method (NIM), são apresentados e brevemente comparados. Adicionalmente, condições suficientes para a convergência da solução em série, obtida pelo ADM, e uma aplicação a um problema da Telecomunicações por Fibras Ópticas, envolvendo EDOs não-lineares designadas equações de Raman, são discutidas. Um ponto de vista mais abrangente que unifica os métodos de decomposição referidos é também apresentado. Para subclasses desta EDP são obtidas soluções numa forma explícita, para diferentes tipos de dados e usando uma variante do método de simetrias de Bluman-Cole. Usando Teoria de Pontos Críticos (o teorema usualmente designado mountain pass) e técnicas de truncatura, prova-se a existência de duas soluções não triviais (uma positiva e uma negativa) para o problema elíptico não-linear e paramétrico (B). A existência de uma terceira solução não trivial é demonstrada usando Grupos Críticos e Teoria de Morse.

Convex Quadratic Programming Approach to the Maximum Matching Problem

The problem of determining a maximum matching or whether there exists a perfect matching, is very common in a large variety of applications and as been extensively studied in graph theory. In this paper we start to introduce a characterisation of a family of graphs for which its stability number is determined by convex quadratic programming. The main results connected with the recognition of this family of graphs are also introduced. It follows a necessary and sufficient condition which characterise a graph with a perfect matching and an algorithmic strategy, based on the determination of the stability number of line graphs, by convex quadratic programming, applied to the determination of a perfect matching. A numerical example for the recognition of graphs with a perfect matching is described. Finally, the above algorithmic strategy is extended to the determination of a maximum matching of an arbitrary graph and some related results are presented.

Existence results for elliptic equations with singular terms

Esta dissertação estuda em detalhe três problemas elípticos: (I) uma classe de equações que envolve o operador Laplaciano, um termo singular e nãolinearidade com o exponente crítico de Sobolev, (II) uma classe de equações com singularidade dupla, o expoente crítico de Hardy-Sobolev e um termo côncavo e (III) uma classe de equações em forma divergente, que envolve um termo singular, um operador do tipo Leray-Lions, e uma função definida nos espaços de Lorentz. As não-linearidades consideradas nos problemas (I) e (II), apresentam dificuldades adicionais, tais como uma singularidade forte no ponto zero (de modo que um "blow-up" pode ocorrer) e a falta de compacidade, devido à presença do exponente crítico de Sobolev (problema (I)) e Hardy-Sobolev (problema (II)). Pela singularidade existente no problema (III), a definição padrão de solução fraca pode não fazer sentido, por isso, é introduzida uma noção especial de solução fraca em subconjuntos abertos do domínio. Métodos variacionais e técnicas da Teoria de Pontos Críticos são usados para provar a existência de soluções nos dois primeiros problemas. No problema (I), são usadas uma combinação adequada de técnicas de Nehari, o princípio variacional de Ekeland, métodos de minimax, um argumento de translação e estimativas integrais do nível de energia. Neste caso, demonstramos a existência de (pelo menos) quatro soluções não triviais onde pelo menos uma delas muda de sinal. No problema (II), usando o método de concentração de compacidade e o teorema de passagem de montanha, demostramos a existência de pelo menos duas soluções positivas e pelo menos um par de soluções com mudança de sinal. A abordagem do problema (III) combina um resultado de surjectividade para operadores monótonos, coercivos e radialmente contínuos com propriedades especiais do operador de tipo Leray- Lions. Demonstramos assim a existência de pelo menos, uma solução no espaço de Lorentz e obtemos uma estimativa para esta solução.

Implementing and testing branch-and-bound algorithm for the quadratic 0-1 problem on transputers

Discrete optimization problems are very difficult to solve, even if the dimention is small. For most of them the problem of finding an ε-approximate solution is already NP-hard. The branch-and-bound algorithms are the most used algorithms for solving exactly this sort of problems.

A computational study of a parallel Branch and Bound algorithm for the quadratic 0-1 programming problem on transputers

Discrete optimization problems are very difficult to solve, even if the dimantion is small. For most of them the problem of finding an ε-approximate solution is already NP-hard.

Self-adaptive combination of global tabu search and local search for nonlinear equations

Solving systems of nonlinear equations is a very important task since the problems emerge mostly through the mathematical modelling of real problems that arise naturally in many branches of engineering and in the physical sciences. The problem can be naturally reformulated as a global optimization problem. In this paper, we show that a self-adaptive combination of a metaheuristic with a classical local search method is able to converge to some difficult problems that are not solved by Newton-type methods.