Search results for "paces"

Understanding dynamic scenes

2000

We propose a framework for the representation of visual knowledge in a robotic agent, with special attention to the understanding of dynamic scenes. According to our approach, understanding involves the generation of a high level, declarative description of the perceived world. Developing such a description requires both bottom-up, data driven processes that associate symbolic knowledge representation structures with the data coming out of a vision system, and top-down processes in which high level, symbolic information is in its turn employed to drive and further refine the interpretation of a scene. On the one hand, the computer vision community approached this problem in terms of 2D/3D s…

Differentiability of Lipschitz maps

2010

When Geometry Constrains Vision: Systematic Misperceptions within Geometrical Configurations.

2016

International audience; How accurate are we in reproducing a point within a simple shape? This is the empirical question we addressed in this work. Participants were presented with a tiny disk embedded in an empty circle (Experiment 1 and 3) or in a square (Experiment 2). Shortly afterwards the disk vanished and they had to reproduce the previously seen disk position within the empty shape by means of the mouse cursor, as accurately as possible. Several loci inside each shape were tested. We found that the space delimited by a circle and by a square is not homogeneous and the observed distortion appears to be consistent across observers and specific for the two tested shapes. However, a com…

Lifelong Residential Exposure to Green Space and Attention: A Population-based Prospective Study

2017

C.T. is a recipient of a European Respiratory Society Fellowship (RESPIRE2–2015–7251) P.D. is funded by a Ramón y Cajal fellowship (RYC-2012-10995) awarded by the Spanish Ministry of Economy and Competitiveness. S.L. is funded by a Miguel Servet-FEDER fellowship (MS15/0025) awarded by the Spanish Ministry of Economy and Competitiveness. M.G. is funded by a Miguel Servet-FEDER fellowship (MS13/00054) awarded by the Spanish Ministry of Economy and Competitiveness

Reducing the bandwidth of a sparse matrix with tabu search

2001

The bandwidth of a matrix { } ij a A = is defined as the maximum absolute difference between i and j for which 0 ≠ ij a . The problem of reducing the bandwidth of a matrix consists of finding a permutation of the rows and columns that keeps the nonzero elements in a band that is as close as possible to the main diagonal of the matrix. This NP-complete problem can also be formulated as a labeling of vertices on a graph, where edges are the nonzero elements of the corresponding symmetrical matrix. Many bandwidth reduction algorithms have been developed since the 1960s and applied to structural engineering, fluid dynamics and network analysis. For the most part, these procedures do not incorpo…

Best Proximity Points for Some Classes of Proximal Contractions

2013

Given a self-mapping g: A → A and a non-self-mapping T: A → B, the aim of this work is to provide sufficient conditions for the existence of a unique point x ∈ A, called g-best proximity point, which satisfies d g x, T x = d A, B. In so doing, we provide a useful answer for the resolution of the nonlinear programming problem of globally minimizing the real valued function x → d g x, T x, thereby getting an optimal approximate solution to the equation T x = g x. An iterative algorithm is also presented to compute a solution of such problems. Our results generalize a result due to Rhoades (2001) and hence such results provide an extension of Banach's contraction principle to the case of non-s…

Least Energy Solutions with Sign Information for Parametric Double Phase Problems

2022

We consider a parametric double phase Dirichlet problem. In the reaction there is a superlinear perturbation term which satisfies a weak Nehari-type monotonicity condition. Using the Nehari manifold method, we show that for all parameters below a critical value, the problem has at least three nontrivial solutions all with sign information. The critical parameter value is precisely identified in terms of the spectrum of the lower exponent part of the differential operator.

Higher integrability and stability of (p,q)-quasiminimizers

2023

Using purely variational methods, we prove local and global higher integrability results for upper gradients of quasiminimizers of a $(p,q)$-Dirichlet integral with fixed boundary data, assuming it belongs to a slightly better Newtonian space. We also obtain a stability property with respect to the varying exponents $p$ and $q$. The setting is a doubling metric measure space supporting a Poincar\'e inequality.

Quasiregular ellipticity of open and generalized manifolds

2014

We study the existence of geometrically controlled branched covering maps from \(\mathbb R^3\) to open \(3\)-manifolds or to decomposition spaces \(\mathbb {S}^3/G\), and from \(\mathbb {S}^3/G\) to \(\mathbb {S}^3\).

Optimal transport maps on Alexandrov spaces revisited

2018

We give an alternative proof for the fact that in $n$-dimensional Alexandrov spaces with curvature bounded below there exists a unique optimal transport plan from any purely $(n-1)$-unrectifiable starting measure, and that this plan is induced by an optimal map.