Engaging immersive video consumers: Challenges regarding 360-degree gamified video applications

360-degree videos is a new medium that has gained the attention of the research community imposing challenges for creating more interactive and engaging immersive experiences. The purpose of this study is to introduce a set of technical and design challenges for interactive, gamified 360-degree mixed reality applications that immerse and engage users. The development of gamified applications refers to the merely incorporation of game elements in the interaction design process to attract and engage the user through playful interaction with the virtual world. The study presents experiments with the incorporation of series of game elements such as time pressure challenges, badges and user levels, storytelling narrative and immediate visual feedback to the interaction design logic of a mixed reality mobile gaming application that runs in an environment composed of 360-degree video and 3D computer generated objects. In the present study, the architecture and overall process for creating such an application is being presented along with a list of design implications and constraints. The paper concludes with future directions and conclusions on improving the level of immersion and engagement of 360-degree video consumers

Spectrum extraction from detector plane images for the medium-resolution spectrometer of the mid-Infrared Instrument on-board the James Webb Space Telescope

The Mid-Infrared Instrument (MIRI) on-board the James Webb Space Telescope (JWST) performs mediumresolution spectroscopy in the 5 to 28.5micron wavelength range. In this paper two algorithms are presented that will be used to extract 1D spectra from the 2D absolutely calibrated detector science frames acquired with the Medium-Resolution Spectrometer (MRS) of MIRI. The first spectral extraction algorithm performs standard aperture photometry on point and extended sources. The second algorithm, applicable only to point sources, uses the instrument point spread function (PSF) and the pixel signal variance as a weighting function, to extract the signal from the detector pixels in an optimized way. This "optimal" extraction is also optimal in the case of faint source observations. The two algorithms are tested on MIRI ground test data and compared. For point sources, the optimal extraction algorithm is found to be more reliable than the aperture extraction algorithm

A valence bond liquid on the honeycomb lattice

The honeycomb lattice material Li2RuO3 undergoes a dimerization of Ru4+ cations on cooling below 270C, where the magnetic susceptibility vanishes. We use density functional theory calculations to show that this reflects the formation of a 'valence bond crystal', with a strong bond disproportionation. On warming, x-ray diffraction shows that discrete three-fold symmetry is regained on average, and the dimerization apparently disappears. In contrast, local structural measurements using high-energy x-rays, show that disordered dimers survive at the nanoscale up to at least 650C. The high temperature phase of Li2RuO3 is thus an example of a valence bond liquid, where thermal fluctuations drive resonance between different dimer coverages, a classic analogue of the resonating valence bond state often discussed in connection with high T$_c$ cuprates.Comment: 5 pages, 4 figures, References correcte

Quasiparticle interference in antiferromagnetic parent compounds of Fe-based superconductors

Recently reported quasiparticle interference imaging in underdoped Ca(Fe{1-x}Co{x})_2As{2} shows pronounced C{2} asymmetry that is interpreted as an indication of an electronic nematic phase with a unidirectional electron band, dispersive predominantly along the $b$-axis of this orthorhombic material. On the other hand, even more recent transport measurements on untwinned samples show near isotropy of the resistivity in the $ab$ plane, with slightly larger conductivity along a (and not b). We show that in fact both sets of data are consistent with the calculated ab initio Fermi surfaces, which has a decisively broken C_{4}, and yet similar Fermi velocity in both directions. This reconciles completely the apparent contradiction between the conclusions of the STM and the transport experiments.Comment: A version of this work was posted (arXiv:1005.1761) as a comment on a Science paper entitled "Nematic Electronic Structure in the Parent State of the Iron-Based Superconductor Ca(Fe1-xCox)2As2". The comment was rejected by Science on account of it being posted on the ArXiv. This is a version published in PRB as a research pape

Incommensurate itinerant antiferromagnetic excitations and spin resonance in the FeTe0.6_{0.6}Se0.4_{0.4} superconductor

We report on inelastic neutron scattering measurements that find incommensurate itinerant like magnetic excitations in the normal state of superconducting FeTe$_{0.6}$Se$_{0.4}$ (\Tc=14K) at wave-vector $\mathbf{Q}_{inc}=(1/2\pm\epsilon,1/2\mp\epsilon)$ with $\epsilon$=0.09(1). In the superconducting state only the lower energy part of the spectrum shows significant changes by the formation of a gap and a magnetic resonance that follows the dispersion of the normal state excitations. We use a four band model to describe the Fermi surface topology of iron-based superconductors with the extended $s(\pm)$ symmetry and find that it qualitatively captures the salient features of these data.Comment: 7 pages and 5 figure

Metro-Line Crossing Minimization: Hardness, Approximations, and Tractable Cases

Crossing minimization is one of the central problems in graph drawing. Recently, there has been an increased interest in the problem of minimizing crossings between paths in drawings of graphs. This is the metro-line crossing minimization problem (MLCM): Given an embedded graph and a set L of simple paths, called lines, order the lines on each edge so that the total number of crossings is minimized. So far, the complexity of MLCM has been an open problem. In contrast, the problem variant in which line ends must be placed in outermost position on their edges (MLCM-P) is known to be NP-hard. Our main results answer two open questions: (i) We show that MLCM is NP-hard. (ii) We give an $O(\sqrt{\log |L|})$-approximation algorithm for MLCM-P

Relation between crystal and magnetic structures of the layered manganites La2-2xSr1+2xMn2O7 (0.30 =< x =< 0.50)

Comprehensive neutron-powder diffraction and Rietveld analyses were carried out to clarify the relation between the crystal and magnetic structures of La2-2xSr1+2xMn2O7 (0.30 =< x =< 0.50). The Jahn-Teller (JT) distortion of Mn-O6 octahedra, i.e., the ratio of the averaged apical Mn-O bond length to the equatorial Mn-O bond length, is Delta_JT=1.042(5) at x=0.30, where the magnetic easy-axis at low temperature is parallel to the c axis. As the JT distortion becomes suppressed with increasing x, a planar ferromagnetic structure appears at x =< 0.32, which is followed by a canted antiferromagnetic (AFM) structure at x =< 0.39. The canting angle between neighboring planes continuously increases from 0 deg (planar ferromagnet: 0.32 =< x < 0.39) to 180 deg (A-type AFM: x=0.48 where Delta_JT=1.013(5)). Dominance of the A-type AF structure with decrease of JT distortion can be ascribed to the change in the eg orbital state from d3z^2-r^2 to dx^2-y^2

Bar 1-Visibility Drawings of 1-Planar Graphs

A bar 1-visibility drawing of a graph $G$ is a drawing of $G$ where each vertex is drawn as a horizontal line segment called a bar, each edge is drawn as a vertical line segment where the vertical line segment representing an edge must connect the horizontal line segments representing the end vertices and a vertical line segment corresponding to an edge intersects at most one bar which is not an end point of the edge. A graph $G$ is bar 1-visible if $G$ has a bar 1-visibility drawing. A graph $G$ is 1-planar if $G$ has a drawing in a 2-dimensional plane such that an edge crosses at most one other edge. In this paper we give linear-time algorithms to find bar 1-visibility drawings of diagonal grid graphs and maximal outer 1-planar graphs. We also show that recursive quadrangle 1-planar graphs and pseudo double wheel 1-planar graphs are bar 1-visible graphs.Comment: 15 pages, 9 figure

HyperReenact: one-shot reenactment via jointly learning to refine and retarget faces

In this paper, we present our method for neural face reenactment, called HyperReenact, that aims to generate realistic talking head images of a source identity, driven by a target facial pose. Existing state-of-the-art face reenactment methods train controllable generative models that learn to synthesize realistic facial images, yet producing reenacted faces that are prone to significant visual artifacts, especially under the challenging condition of extreme head pose changes, or requiring expensive few-shot fine-tuning to better preserve the source identity characteristics. We propose to address these limitations by leveraging the photorealistic generation ability and the disentangled properties of a pretrained StyleGAN2 generator, by first inverting the real images into its latent space and then using a hypernetwork to perform: (i) refinement of the source identity characteristics and (ii) facial pose re-targeting, eliminating this way the dependence on external editing methods that typically produce artifacts. Our method operates under the one-shot setting (i.e., using a single source frame) and allows for cross-subject reenactment, without requiring any subject-specific fine-tuning. We compare our method both quantitatively and qualitatively against several state-of-the-art techniques on the standard benchmarks of VoxCeleb1 and VoxCeleb2, demonstrating the superiority of our approach in producing artifact-free images, exhibiting remarkable robustness even under extreme head pose changes. We make the code and the pretrained models publicly available at: https://github.com/ StelaBou/HyperReenact