English
Related papers

Related papers: Optimization of quasi-normal eigenvalues for Krein…

200 papers

The paper is devoted to optimization of resonances associated with 1-D wave equations in inhomogeneous media. The medium's structure is represented by a nonnegative function B. The problem is to design for a given $\alpha \in \R$ a medium…

Spectral Theory · Mathematics 2013-02-22 Illya M. Karabash

The random access problem for compressed strings is to build a data structure that efficiently supports accessing the character in position $i$ of a string given in compressed form. Given a grammar of size $n$ compressing a string of size…

Data Structures and Algorithms · Computer Science 2015-01-27 Patrick Hagge Cording

Quasi-normal-eigenvalue optimization is studied under constraints $b_1(x) \le B(x) \le b_2 (x)$ on structure functions $B$ of 2-side open optical or mechanical resonators. We prove existence of various optimizers and provide an example when…

Optimization and Control · Mathematics 2018-07-31 Illya M. Karabash , Olga M. Logachova , Ievgen V. Verbytskyi

We obtain results for the spectral optimisation of Neumann eigenvalues on rectangles in $\mathbb{R}^2$ with a measure or perimeter constraint. We show that the rectangle with measure $1$ which maximises the $k$'th Neumann eigenvalue…

Spectral Theory · Mathematics 2018-05-16 Michiel van den Berg , Dorin Bucur , Katie Gittins

We introduce a novel definition of approximate palindromes in strings, and provide an algorithm to find all maximal approximate palindromes in a string with up to $k$ errors. Our definition is based on the usual edit operations of…

Data Structures and Algorithms · Computer Science 2007-05-23 A. H. L. Porto , V. C. Barbosa

We derive two methods for simultaneously controlling the resonance frequency, linewidth and multipolar nature of the resonances of radially symmetric structures. Firstly, we formulate an eigenvalue problem for a global shift in the…

Optics · Physics 2023-10-23 James R Capers , Dean A Patient , Simon A R Horsley

Monotonicity is a simple yet significant qualitative characteristic. We consider the problem of segmenting a sequence in up to K segments. We want segments to be as monotonic as possible and to alternate signs. We propose a quality metric…

Databases · Computer Science 2009-09-01 Daniel Lemire , Martin Brooks , Yuhong Yan

Strings are a natural representation of biological data such as DNA, RNA and protein sequences. The problem of finding a string that summarizes a set of sequences has direct application in relative compression algorithms for genome and…

Data Structures and Algorithms · Computer Science 2019-12-06 P. Mirabal , J. Abreu , D. Seco

We review some aspects of moduli in string theory. We argue that one should focus on {\it approximate moduli spaces}, and that there is evidence that such spaces exist non-perturbatively. We ask what it would mean for string theory to…

High Energy Physics - Theory · Physics 2016-11-03 Michael Dine

We study eigenvibrations for inhomogeneous string consisting of two parts with strongly contrasting stiffness and mass density. In this work we treat a critical case for the high frequency approximations, namely the case when the order of…

Spectral Theory · Mathematics 2013-09-03 Natalia Babych , Yuri Golovaty

Monotonicity is a simple yet significant qualitative characteristic. We consider the problem of segmenting an array in up to K segments. We want segments to be as monotonic as possible and to alternate signs. We propose a quality metric for…

Data Structures and Algorithms · Computer Science 2007-05-23 Daniel Lemire , Martin Brooks , Yuhong Yan

In this paper we investigate the possibility of obtaining a measure representation for function- als arising in the context of optimal design problems under non-standard growth conditions and perimeter penalization. Applications to…

Analysis of PDEs · Mathematics 2017-12-12 Ana Cristina Barroso , Elvira Zappale

Recovering nonlinearly degraded signal in the presence of noise is a challenging problem. In this work, this problem is tackled by minimizing the sum of a non convex least-squares fit criterion and a penalty term. We assume that the…

Signal Processing · Electrical Eng. & Systems 2019-02-27 Marc Castella , Jean-Christophe Pesquet , Arthur Marmin

We consider a statistical inverse learning problem, where we observe the image of a function $f$ through a linear operator $A$ at i.i.d. random design points $X_i$, superposed with an additive noise. The distribution of the design points is…

Machine Learning · Statistics 2016-04-15 Gilles Blanchard , Nicole Mücke

We investigate the maximum signal to noise ratio per unit time that can be achieved for a spin 1/2 particle subjected to a periodic pulse sequence. Optimal control techniques are applied to design the control field and the position of the…

Quantum Physics · Physics 2015-06-22 M. Lapert , E. Assémat , S. J. Glaser , D. Sugny

A general method of regularisation of classical self interaction in strings is extended from the electromagnetic case (for which it was originally developed) to the gravitation case, for which the result can also be represented as a…

High Energy Physics - Theory · Physics 2007-05-23 Brandon Carter

We study analytically the fundamental resonances of near-extremal, slowly rotating Kerr-Newman black holes. We find a simple analytic expression for these black-hole quasinormal frequencies in terms of the black-hole physical parameters:…

General Relativity and Quantum Cosmology · Physics 2009-01-16 Shahar Hod

The problem called "String reconstruction from substrings" is a mathematical model of sequencing by hybridization that plays an important role in DNA sequencing. In this problem, we are given a blackbox oracle holding an unknown string…

Data Structures and Algorithms · Computer Science 2018-08-03 Kazuo Iwama , Junichi Teruyama , Shuntaro Tsuyama

In this paper we present mathematical and physical models to be used in the analysis of the problem of intonation of musical instruments such as guitars, mandolins and the like, i.e., we study how to improve the tuning on these instruments.…

Classical Physics · Physics 2010-01-26 Gabriele U. Varieschi , Christina M. Gower

Described are two algorithms to find long approximate palindromes in a string, for example a DNA sequence. A simple algorithm requires O(n)-space and almost always runs in $O(k.n)$-time where n is the length of the string and k is the…

Data Structures and Algorithms · Computer Science 2007-05-23 L. Allison
‹ Prev 1 2 3 10 Next ›