The Push-Tree Problem is a recently addressed optimization problem, with the aim to minimize the total amount of traffic generated on information broadcasting networks by a compromise between the use of "push" and "pull" mechanisms. That is, the push-tree problem can be seen as a mixture of building multicast trees with respect to nodes receiving pieces of information while further nodes may obtain information from the closest node within the tree by means of shortest paths. In this sense we are accounting for tradeoffs of push and pull mechanisms in information distribution.

Cow's milk allergy (CMA) is a common condition in the pediatric population. CMA can induce a diverse range of symptoms of variable intensity. It occurs mainly in the first year of life, and if the child is not breastfed, hypoallergenic formula is the dietary treatment. Extensively hydrolyzed cow's milk formulas (eHF) with documented hypo-allergenicity can be recommended as the first choice, while amino acid-based formulas (AAF) are recommended for patients with more severe symptoms.

We describe the emergence of topological singularities in periodic media within the Ginzburg-Landau model and the core-radius approach. The energy functionals of both models are denoted by E, where ? represent the coherence length (in the Ginzburg-Landau model) or the core-radius size (in the core-radius approach) and ? denotes the periodicity scale. We carry out the ? -convergence analysis of E as ?-> 0 and ?= ?-> 0 in the | log ?| scaling regime, showing that the ? -limit consists in the energy cost of finitely many vortex-like point singularities of integer degree.

Poisson shot noise processes are natural generalizations of compound Poisson processes that have been widely applied in insurance, neuroscience, seismology, computer science and epidemiology. In this paper we study sharp deviations, fluctuations and the stable probability approximation of Poisson shot noise processes. Our achievements extend, improve and complement existing results in the literature. We apply the theoretical results to Poisson cluster point processes, including generalized linear Hawkes processes, and risk processes with delayed claims. Many examples are discussed in detail.

We prove that positive solutions of the fractional Lane-Emden equation with homogeneous Dirichlet boundary conditions satisfy pointwise estimates in terms of the best constant in Poincaré's inequality on all open sets, and are isolated in $L^1$ on smooth bounded ones, whence we deduce the isolation of the first non-local semilinear eigenvalue .

Age of infection epidemic models [1, 3], based on non-linear integro-dierential equations, naturally describe the evolution of diseases whose infectivity depends on the time since becoming infected. Here we consider a multi-group age of infection model [2] and we extend the investigations in [4], [5] and [6] to provide numerical solutions that retain the main properties of the continuous system. In particular, we use Direct Quadrature methods and prove that the numerical solution is positive and bounded.

Image resizing is a basic tool in image processing, and in literature, we have many methods based on different approaches, which are often specialized in only upscaling or downscaling. In this paper, independently of the (reduced or enlarged) size we aim to get, we approach the problem at a continuous scale where the underlying function representing the image is globally approximated by its Lagrange-Chebyshev I kind interpolation polynomial corresponding to suitable (tensor product) grids of first kind Chebyshev zeros.

This paper provides a unified point of view on fractional perimeters and Riesz potentials. Denoting byH? - for ? 2 .0; 1/ - the ?-fractional perimeter and by J ? - for ? 2 .(d; 0)- the ?-Riesz energies acting on characteristic functions, we prove that both functionals can be seen as limits of renormalized self-attractive energies as well as limits of repulsive interactions between a set and its complement. We also show that the functionals H? and J ? , up to a suitable additive renormalization diverging when ? ? 0, belong to a continuous one-parameter family of functionals, which for ?

Given a graph G with a label (color) assigned to each edge (not necessarily properly) we look for an hamiltonian cycle of G with the minimum number of different colors. The problem has several applications in telecommunication networks, electric networks, multimodal transportation networks, among others, where one aims to ensure connectivity or other properties by means of limited number of different connections. We analyze the complexity of the problem on special graph classes and propose, for the general case, heuristic resolution algorithms.