Challenging physiognomy: questioning the idea that facial characteristics are indicative of personality

Physiognomy; the idea that facial characteristics are indicative of personality has persisted within the science of psychology despite some questionable supporting evidence. Indeed the idea is not unreasonable if certain premise can be supported. The aim of this research was to test three related premise in order to ascertain whether people could accurately judge the personality of a stranger from only a superficial exposure. An experiment was devised which exposed participants to one of eight video clips. The video clips were all of the same person but varied in duration, whether the eyes were visible, and whether the person was talking. One hundred and forty participants took part in the study. After watching one of the video clips each participant was asked to assess the personality of the person in the video using a standard personality questionnaire. The null results challenge the findings of previous research in support of physiognomy

Modified mean curvature flow of entire locally Lipschitz radial graphs in hyperbolic space

The asymptotic Plateau problem asks for the existence of smooth complete hypersurfaces of constant mean curvature with prescribed asymptotic boundary at infinity in the hyperbolic space $\mathbb{H}^{n+1}$. The modified mean curvature flow (MMCF) was firstly introduced by Xiao and the second author a few years back, and it provides a tool using geometric flow to find such hypersurfaces with constant mean curvature in $\mathbb{H}^{n+1}$. Similar to the usual mean curvature flow, the MMCF is the natural negative $L^2$-gradient flow of the area-volume functional $\mathcal{I}(\Sigma)=A(\Sigma)+\sigma V(\Sigma)$ associated to a hypersurface $\Sigma$. In this paper, we prove that the MMCF starting from an entire locally Lipschitz continuous radial graph exists and stays radially graphic for all time. In general one cannot expect the convergence of the flow as it can be seen from the flow starting from a horosphere (whose asymptotic boundary is degenerate to a point).Comment: 22pages, 2 figure

An ALMA Dynamical Mass Estimate of the Proposed Planetary-mass Companion FW Tau C

Dynamical mass estimates down to the planet-mass regime can help to understand planet formation. We present Atacama Large Millimeter/submillimeter Array (ALMA) 1.3 mm observations of FW Tau C, a proposed ~10 $M_{\rm Jup}$ planet-mass companion at ~330 au from the host binary FW Tau AB. We spatially and spectrally resolve the accretion disk of FW Tau C in ${}^{12}$CO (2-1). By modeling the Keplerian rotation of gas, we derive a dynamical mass of ~0.1 $M_\odot$. Therefore, FW Tau C is unlikely a planet, but rather a low-mass star with a highly inclined disk. This also suggests that FW Tau is a triple system consisting of three ~0.1 $M_\odot$ stars.Comment: Accepted for publication in ApJ

Constructions of optimal LCD codes over large finite fields

In this paper, we prove existence of optimal complementary dual codes (LCD codes) over large finite fields. We also give methods to generate orthogonal matrices over finite fields and then apply them to construct LCD codes. Construction methods include random sampling in the orthogonal group, code extension, matrix product codes and projection over a self-dual basis.Comment: This paper was presented in part at the International Conference on Coding, Cryptography and Related Topics April 7-10, 2017, Shandong, Chin

CORE: Augmenting Regenerating-Coding-Based Recovery for Single and Concurrent Failures in Distributed Storage Systems

Data availability is critical in distributed storage systems, especially when node failures are prevalent in real life. A key requirement is to minimize the amount of data transferred among nodes when recovering the lost or unavailable data of failed nodes. This paper explores recovery solutions based on regenerating codes, which are shown to provide fault-tolerant storage and minimum recovery bandwidth. Existing optimal regenerating codes are designed for single node failures. We build a system called CORE, which augments existing optimal regenerating codes to support a general number of failures including single and concurrent failures. We theoretically show that CORE achieves the minimum possible recovery bandwidth for most cases. We implement CORE and evaluate our prototype atop a Hadoop HDFS cluster testbed with up to 20 storage nodes. We demonstrate that our CORE prototype conforms to our theoretical findings and achieves recovery bandwidth saving when compared to the conventional recovery approach based on erasure codes.Comment: 25 page