Consideramos a equação de Schrödinger não linear não-homogênea supercrítica i∂tu + u + | x | - b | u | 2σu = 0, onde (2 − b) / N <σ <(2 − b) / (N − 2) e 0 <b <min {2, N}. Provamos uma estimativa do tipo Gagliardo-Nirenberg ...

This article presents a novel impact identification algorithm that uses a linear approximation handled by a statistical inference model based on the maximum-entropy principle, termed linear approximation with maximum entropy ...

This paper studies the bioremediation, in minimal time, of a water resource or reservoir using a single continuous bioreactor. The bioreactor is connected to two pumps, at different locations in the reservoir, that pump ...

Supervised learning algorithms have been proposed as a suitable alternative to model updating methods in structural damage assessment, being Artificial Neural Networks the most frequently used. Notwithstanding, the slow ...

Let S be a point set in the plane such that each of its elements is colored either red or blue. A matching of S with rectangles is any set of pairwise-disjoint axis-aligned closed rectangles such that each rectangle contains ...

Tsallis maximum entropy distributions provide useful tools for the study of a wide range of scenarios in mathematics, physics, and other fields. Here we apply a Tsallis maximum entropy ansatz, the q-Gaussian, to obtain ...

A bipartite graph G = (V, W, E) is convex if there exists an ordering of the vertices of W such that, for each v. V, the neighbors of v are consecutive in W. We describe both a sequential and a BSP/CGM algorithm to find a ...