Residual minimization is a widely used technique for solving Partial Differential Equations in variational form. It minimizes the dual norm of the residual, which naturally yields a saddle-point (min–max) problem over the ...

Let p > 3 be a prime number and let r be an integer with 1 < r < p - 1. For each r, let moreover G(r) denote the unique quotient of the maximal class pro-p group of size p(r+1).We show that the mod-p cohomology ring of ...

Riemann's non-differentiable function is a classic example of a continuous but almost nowheredifferentiable function, whose analytic regularity has been widely studied since it was proposedin the second half of the 19th ...

Estimation of Distribution Algorithms have been successfully used to solve permutation-based Combinatorial Optimization Problems. In this case, the algorithms use probabilistic models specifically designed for codifying ...

The orienteering problem is a route optimization problem which consists of finding a simple cycle that maximizes the total collected profit subject to a maximum distance limitation. In the last few decades, the occurrence ...

Background: The main purpose of this article is to introduce a universal mathematics-aided vaccine design method against malignant melanoma based on neoantigens. The universal method can be adapted to the mutanome of each ...

...

We investigate a system with Poisson arrivals to two queues. One queue stores the status updates of the process of interest (or data packets) and the other handles the energy that is required to deliver the updates to the ...

DNA damage has long been advocated as a molecular driver of aging. DNA damage occurs in a stochastic manner, and is therefore more likely to accumulate in longer genes. The length-dependent accumulation of transcription-blocking ...

This paper deals with the Orienteering Problem, which is a routing problem. In the Orienteering Problem each node has a profit assigned and the goal is to find the route that maximizes the total collected profit subject ...