Related papers: The shortest lengths and the enclosure method for …
In this work we consider the inverse elastic scattering problem by an inclusion in two dimensions. The elastic inclusion is placed in an isotropic homogeneous elastic medium. The inverse problem, using the third Betti's formula (direct…
Short-step methods are an important class of algorithms for solving convex constrained optimization problems. In this short paper, we show that under very mild assumptions on the self-concordant barrier and the width of the…
The min-knapsack problem with compactness constraints extends the classical knapsack problem, in the case of ordered items, by introducing a restriction ensuring that they cannot be too far apart. This problem has applications in…
We present an alternative pathway in the application of the variation improvement of ordinary perturbation theory exposed in [1] which can preserve the internal symmetries of a model by means of a time compactification.
This work considers special types of interval linear systems - overdetermined systems. Simply said these systems have more equations than variables. The solution set of an interval linear system is a collection of all solutions of all…
A general approach to a broad class of asymptotic problems related to long-time influence of small perturbations, of both deterministic and stochastic type, is presented in the paper. The main characteristic of this influence is a limiting…
The shortest-path distance is a fundamental concept in graph analytics and has been extensively studied in the literature. In many real-world applications, quality constraints are naturally associated with edges in the graphs and finding…
This work presents neural network based minimal entropy closures for the moment system of the Boltzmann equation, that preserve the inherent structure of the system of partial differential equations, such as entropy dissipation and…
We investigate the longest common substring problem for encoded sequences and its asymptotic behaviour. The main result is a strong law of large numbers for a re-scaled version of this quantity, which presents an explicit relation with the…
This paper considers an inverse problem for the classical wave equation in an exterior domain. It is a mathematical interpretation of an inverse obstacle problem which employs the dynamical scattering data of acoustic wave over a finite…
We study an inverse problem that consists in estimating the first (zero-order) moment of some R2-valued distribution m supported within a closed interval S $\subset$ R, from partial knowledge of the solution to the Poisson-Laplace partial…
Given a set of $n$ points in the plane, and a parameter $k$, we consider the problem of computing the minimum (perimeter or area) axis-aligned rectangle enclosing $k$ points. We present the first near quadratic time algorithm for this…
We employ the enclosure method to reconstruct unknown inclusions within an object that is governed by a semilinear elliptic equation with power-type nonlinearity. Motivated by [16], we tried to solve the problem without using special…
This paper investigates the problem of time-harmonic acoustic scattering in an inhomogeneous medium with a complex topological structure. Specifically, the medium is anisotropic and contains several disjoint sound-soft obstacles. This model…
Motivated by the grid search method and Bayesian optimization, we introduce the concept of contractibility and its applications in model-based optimization. First, a basic framework of contraction methods is established to construct a…
This paper is concerned with a space-time adaptive numerical method for instationary porous media flows with nonlinear interaction between porosity and pressure, with focus on problems with discontinuous initial porosities. A convergent…
We study the smallest intersecting and enclosing ball problems in Euclidean spaces for input objects that are compact and convex. They link and unify many problems in computational geometry and machine learning. We show that both problems…
The interplay between the topological and geometrical properties of a polymer ring can be clarified by establishing the entanglement trapped in any portion (arc) of the ring. The task requires to close the open arcs into a ring, and the…
We give an algorithm that takes a directed graph $G$ undergoing $m$ edge insertions with lengths in $[1, W]$, and maintains $(1+\epsilon)$-approximate shortest path distances from a fixed source $s$ to all other vertices. The algorithm is…
We solve the truncated K-moment problem when $K\subseteq R^n$ is the closure of a, not necessarily bounded, open set (which includes the important cases $K=R^n$ and $K=R^n_+$). That is, we completely characterize the interior of the convex…