A Virtual Element Method for elastic and inelastic problems on polytope meshes

We present a Virtual Element Method (VEM) for possibly nonlinear elastic and inelastic problems, mainly focusing on a small deformation regime. The numerical scheme is based on a low-order approximation of the displacement field, as well as a suitable treatment of the displacement gradient. The proposed method allows for general polygonal and polyhedral meshes, it is efficient in terms of number of applications of the constitutive law, and it can make use of any standard black-box constitutive law algorithm. Some theoretical results have been developed for the elastic case. Several numerical results within the 2D setting are presented, and a brief discussion on the extension to large deformation problems is included

Four-body Efimov effect

We study three same spin state fermions of mass M interacting with a distinguishable particle of mass m in the unitary limit where the interaction has a zero range and an infinite s-wave scattering length. We predict an interval of mass ratio 13.384 < M/m < 13.607 where there exists a purely four-body Efimov effect, leading to the occurrence of weakly bound tetramers without Efimov trimers.Comment: 4 pages, 2 figure

Conocimiento didáctico del contenido curricular del profesorado de Química

Esta comunicación presenta los resultados finales del proyecto El conocimiento didáctico del contenido curricular, CDCC: una estrategia sustentada en el diseño de tramas conceptuales, financiado por el Centro de investigaciones de la UPN, (CIUP: DQU-025-07). Las preguntas centrales fueron: ¿cuáles son los referentes teórico/prácticos que definen el CDCC, de qué manera el CDCC le permite al profesorado de química diseñar Tramas Histórico Epistemológicas (THE) y tramas didácticas (TD), qué aspectos tienen en cuenta al seleccionar, diseñan e implementan los contenidos de enseñanza en química? El trabajo se realizó con profesores de química en formación inicial (PFI) de educación media en Bogotá, durante el 2007 y 2008, que hacían su práctica pedagógica/didáctica y profesores en ejercicio, PE que tienen varios años de experiencia docente

A census of ρ\rho Oph candidate members from Gaia DR2

The Ophiuchus cloud complex is one of the best laboratories to study the earlier stages of the stellar and protoplanetary disc evolution. The wealth of accurate astrometric measurements contained in the Gaia Data Release 2 can be used to update the census of Ophiuchus member candidates. We seek to find potential new members of Ophiuchus and identify those surrounded by a circumstellar disc. We constructed a control sample composed of 188 bona fide Ophiuchus members. Using this sample as a reference we applied three different density-based machine learning clustering algorithms (DBSCAN, OPTICS, and HDBSCAN) to a sample drawn from the Gaia catalogue centred on the Ophiuchus cloud. The clustering analysis was applied in the five astrometric dimensions defined by the three-dimensional Cartesian space and the proper motions in right ascension and declination. The three clustering algorithms systematically identify a similar set of candidate members in a main cluster with astrometric properties consistent with those of the control sample. The increased flexibility of the OPTICS and HDBSCAN algorithms enable these methods to identify a secondary cluster. We constructed a common sample containing 391 member candidates including 166 new objects, which have not yet been discussed in the literature. By combining the Gaia data with 2MASS and WISE photometry, we built the spectral energy distributions from 0.5 to 22\microm for a subset of 48 objects and found a total of 41 discs, including 11 Class II and 1 Class III new discs. Density-based clustering algorithms are a promising tool to identify candidate members of star forming regions in large astrometric databases. If confirmed, the candidate members discussed in this work would represent an increment of roughly 40% of the current census of Ophiuchus.Comment: A&A, Accepted. Abridged abstrac

A second order minimality condition for the Mumford-Shah functional

A new necessary minimality condition for the Mumford-Shah functional is derived by means of second order variations. It is expressed in terms of a sign condition for a nonlocal quadratic form on $H^1_0(\Gamma)$, $\Gamma$ being a submanifold of the regular part of the discontinuity set of the critical point. Two equivalent formulations are provided: one in terms of the first eigenvalue of a suitable compact operator, the other involving a sort of nonlocal capacity of $\Gamma$. A sufficient condition for minimality is also deduced. Finally, an explicit example is discussed, where a complete characterization of the domains where the second variation is nonnegative can be given.Comment: 30 page

Software infrastructure for solving non-linear partial differential equations and its application to modelling crustal fault systems

In this paper we will give a brief introduction into the Python-based modelling language escript. We will present a model for the dynamics of fault systems in the Earth's crust and then show how escript is used to implement solution algorithms for a dynamic as well as a quasi-static scenario

Globally Guided Trajectory Planning in Dynamic Environments

Navigating mobile robots through environments shared with humans is challenging. From the perspective of the robot, humans are dynamic obstacles that must be avoided. These obstacles make the collision-free space nonconvex, which leads to two distinct passing behaviors per obstacle (passing left or right). For local planners, such as receding-horizon trajectory optimization, each behavior presents a local optimum in which the planner can get stuck. This may result in slow or unsafe motion even when a better plan exists. In this work, we identify trajectories for multiple locally optimal driving behaviors, by considering their topology. This identification is made consistent over successive iterations by propagating the topology information. The most suitable high-level trajectory guides a local optimization-based planner, resulting in fast and safe motion plans. We validate the proposed planner on a mobile robot in simulation and real-world experiments.Comment: 7 pages, 6 figures, accepted to IEEE International Conference on Robotics and Automation (ICRA) 202