Spatial representations of numbers and letters in children

Different lines of evidence suggest that children's mental representations of numbers are spatially organized in form of a mental number line. It is, however, still unclear whether a spatial organization is specific for the numerical domain or also applies to other ordinal sequences in children. In the present study, children (n = 129) aged 8–9 years were asked to indicate the midpoint of lines flanked by task-irrelevant digits or letters. We found that the localization of the midpoint was systematically biased toward the larger digit. A similar, but less pronounced, effect was detected for letters with spatial biases toward the letter succeeding in the alphabet. Instead of assuming domain-specific forms of spatial representations, we suggest that ordinal information expressing relations between different items of a sequence might be spatially coded in children, whereby numbers seem to convey this kind of information in the most salient way

What May Visualization Processes Optimize?

In this paper, we present an abstract model of visualization and inference processes and describe an information-theoretic measure for optimizing such processes. In order to obtain such an abstraction, we first examined six classes of workflows in data analysis and visualization, and identified four levels of typical visualization components, namely disseminative, observational, analytical and model-developmental visualization. We noticed a common phenomenon at different levels of visualization, that is, the transformation of data spaces (referred to as alphabets) usually corresponds to the reduction of maximal entropy along a workflow. Based on this observation, we establish an information-theoretic measure of cost-benefit ratio that may be used as a cost function for optimizing a data visualization process. To demonstrate the validity of this measure, we examined a number of successful visualization processes in the literature, and showed that the information-theoretic measure can mathematically explain the advantages of such processes over possible alternatives.Comment: 10 page

Wavelength-multiplexed computer-generated volume holography

We demonstrate recording and reconstruction of multiple-computer-generated wavelength-multiplexed volume holograms in a holographic storage medium. The holograms display high selectivity, and their reconstruction process results in a convenient conversion of wavelength into angular multiplexing

Reduction in the reconstruction error of computer-generated holograms by photorefractive volume holography

We suggest a method for coding high-resolution computer-generated volume holograms. It involves splitting the computer-generated hologram into multiple holograms, their individual recording as volume holograms by use of the maximal resolution available from the spatial light modulator, and subsequent simultaneous reconstruction. We demonstrate the recording and the reconstruction of a computer-generated volume hologram with a space-bandwidth product much higher than the limitation imposed by the interfacing spatial light modulator. Finally, we analyze the scheduling procedure of the multiple holographic recording process in photorefractive medium in this specific application

A quantum key distribution protocol for rapid denial of service detection

We introduce a quantum key distribution protocol designed to expose fake users that connect to Alice or Bob for the purpose of monopolising the link and denying service. It inherently resists attempts to exhaust Alice and Bob's initial shared secret, and is 100% efficient, regardless of the number of qubits exchanged above the finite key limit. Additionally, secure key can be generated from two-photon pulses, without having to make any extra modifications. This is made possible by relaxing the security of BB84 to that of the quantum-safe block cipher used for day-to-day encryption, meaning the overall security remains unaffected for useful real-world cryptosystems such as AES-GCM being keyed with quantum devices.Comment: 13 pages, 3 figures. v2: Shifted focus of paper towards DoS and added protocol 4. v1: Accepted to QCrypt 201

Texture Mixer: A Network for Controllable Synthesis and Interpolation of Texture

This paper addresses the problem of interpolating visual textures. We formulate this problem by requiring (1) by-example controllability and (2) realistic and smooth interpolation among an arbitrary number of texture samples. To solve it we propose a neural network trained simultaneously on a reconstruction task and a generation task, which can project texture examples onto a latent space where they can be linearly interpolated and projected back onto the image domain, thus ensuring both intuitive control and realistic results. We show our method outperforms a number of baselines according to a comprehensive suite of metrics as well as a user study. We further show several applications based on our technique, which include texture brush, texture dissolve, and animal hybridization.Comment: Accepted to CVPR'1