Towards a gauge-polyvalent Numerical Relativity code

The gauge polyvalence of a new numerical code is tested, both in harmonic-coordinate simulations (gauge-waves testbed) and in singularity-avoiding coordinates (simple Black-Hole simulations, either with or without shift). The code is built upon an adjusted first-order flux-conservative version of the Z4 formalism and a recently proposed family of robust finite-difference high-resolution algorithms. An outstanding result is the long-term evolution (up to 1000M) of a Black-Hole in normal coordinates (zero shift) without excision.Comment: to appear in Physical Review

Video-rate computational super-resolution and integral imaging at longwave-infrared wavelengths

We report the first computational super-resolved, multi-camera integral imaging at long-wave infrared (LWIR) wavelengths. A synchronized array of FLIR Lepton cameras was assembled, and computational super-resolution and integral-imaging reconstruction employed to generate video with light-field imaging capabilities, such as 3D imaging and recognition of partially obscured objects, while also providing a four-fold increase in effective pixel count. This approach to high-resolution imaging enables a fundamental reduction in the track length and volume of an imaging system, while also enabling use of low-cost lens materials.Comment: Supplementary multimedia material in http://dx.doi.org/10.6084/m9.figshare.530302

TAIP: an anytime algorithm for allocating student teams to internship programs

In scenarios that require teamwork, we usually have at hand a variety of specific tasks, for which we need to form a team in order to carry out each one. Here we target the problem of matching teams with tasks within the context of education, and specifically in the context of forming teams of students and allocating them to internship programs. First we provide a formalization of the Team Allocation for Internship Programs Problem, and show the computational hardness of solving it optimally. Thereafter, we propose TAIP, a heuristic algorithm that generates an initial team allocation which later on attempts to improve in an iterative process. Moreover, we conduct a systematic evaluation to show that TAIP reaches optimality, and outperforms CPLEX in terms of time.Comment: 10 pages, 7 figure

Efficient implementation of finite volume methods in Numerical Relativity

Centered finite volume methods are considered in the context of Numerical Relativity. A specific formulation is presented, in which third-order space accuracy is reached by using a piecewise-linear reconstruction. This formulation can be interpreted as an 'adaptive viscosity' modification of centered finite difference algorithms. These points are fully confirmed by 1D black-hole simulations. In the 3D case, evidence is found that the use of a conformal decomposition is a key ingredient for the robustness of black hole numerical codes.Comment: Revised version, 10 pages, 6 figures. To appear in Phys. Rev.

Hydrodynamic fingering instability of driven wetting films: hindrance by diffusion

Recent experimental and theoretical efforts have revealed the existence of a fingering instability at the moving front of thin liquid films forced to spread under gravitational, rotational or surface shear stresses, as for example by using the Marangoni effect. The authors describe how the presence of a precursor film in front of the spreading macroscopic film, whether it is by prewetting the substrate or by surface diffusion or multilayer absorption, can prevent the development of the instability

Definable orthogonality classes in accessible categories are small

We lower substantially the strength of the assumptions needed for the validity of certain results in category theory and homotopy theory which were known to follow from Vopenka's principle. We prove that the necessary large-cardinal hypotheses depend on the complexity of the formulas defining the given classes, in the sense of the Levy hierarchy. For example, the statement that, for a class S of morphisms in a locally presentable category C of structures, the orthogonal class of objects is a small-orthogonality class (hence reflective) is provable in ZFC if S is \Sigma_1, while it follows from the existence of a proper class of supercompact cardinals if S is \Sigma_2, and from the existence of a proper class of what we call C(n)-extendible cardinals if S is \Sigma_{n+2} for n bigger than or equal to 1. These cardinals form a new hierarchy, and we show that Vopenka's principle is equivalent to the existence of C(n)-extendible cardinals for all n. As a consequence, we prove that the existence of cohomological localizations of simplicial sets, a long-standing open problem in algebraic topology, is implied by the existence of arbitrarily large supercompact cardinals. This result follows from the fact that cohomology equivalences are \Sigma_2. In contrast with this fact, homology equivalences are \Sigma_1, from which it follows (as is well known) that the existence of homological localizations is provable in ZFC.Comment: 38 pages; some results have been improved and former inaccuracies have been correcte

A Nonlinear Adiabatic Theorem for Coherent States

We consider the propagation of wave packets for a one-dimensional nonlinear Schrodinger equation with a matrix-valued potential, in the semi-classical limit. For an initial coherent state polarized along some eigenvector, we prove that the nonlinear evolution preserves the separation of modes, in a scaling such that nonlinear effects are critical (the envelope equation is nonlinear). The proof relies on a fine geometric analysis of the role of spectral projectors, which is compatible with the treatment of nonlinearities. We also prove a nonlinear superposition principle for these adiabatic wave packets.Comment: 21 pages, no figur

Synergistic Team Composition

Effective teams are crucial for organisations, especially in environments that require teams to be constantly created and dismantled, such as software development, scientific experiments, crowd-sourcing, or the classroom. Key factors influencing team performance are competences and personality of team members. Hence, we present a computational model to compose proficient and congenial teams based on individuals' personalities and their competences to perform tasks of different nature. With this purpose, we extend Wilde's post-Jungian method for team composition, which solely employs individuals' personalities. The aim of this study is to create a model to partition agents into teams that are balanced in competences, personality and gender. Finally, we present some preliminary empirical results that we obtained when analysing student performance. Results show the benefits of a more informed team composition that exploits individuals' competences besides information about their personalities