When do we eat? An evaluation of food items input into an electronic monitoring application

We present a formative study that examines what, when, and how participants in a chronic kidney disease (stage 5) population input food items into an electronic intake monitoring application. Participants scanned food item barcodes or voice recorded food items they consumed during a three week period. The results indicated that a learning curve was associated with barcode scanning; participants with low literacy skills had difficulty describing food items in voice recordings; and participants input food items depending on when they had dialysis treatment. Participants thought this electronic self monitoring application would be helpful for chronically ill populations in their first year of treatmen

Amplified Dispersive Fourier-Transform Imaging for Ultrafast Displacement Sensing and Barcode Reading

Dispersive Fourier transformation is a powerful technique in which the spectrum of an optical pulse is mapped into a time-domain waveform using chromatic dispersion. It replaces a diffraction grating and detector array with a dispersive fiber and single photodetector. This simplifies the system and, more importantly, enables fast real-time measurements. Here we describe a novel ultrafast barcode reader and displacement sensor that employs internally-amplified dispersive Fourier transformation. This technique amplifies and simultaneously maps the spectrally encoded barcode into a temporal waveform. It achieves a record acquisition speed of 25 MHz -- four orders of magnitude faster than the current state-of-the-art.Comment: Submitted to a journa

Securing Interactive Sessions Using Mobile Device through Visual Channel and Visual Inspection

Communication channel established from a display to a device's camera is known as visual channel, and it is helpful in securing key exchange protocol. In this paper, we study how visual channel can be exploited by a network terminal and mobile device to jointly verify information in an interactive session, and how such information can be jointly presented in a user-friendly manner, taking into account that the mobile device can only capture and display a small region, and the user may only want to authenticate selective regions-of-interests. Motivated by applications in Kiosk computing and multi-factor authentication, we consider three security models: (1) the mobile device is trusted, (2) at most one of the terminal or the mobile device is dishonest, and (3) both the terminal and device are dishonest but they do not collude or communicate. We give two protocols and investigate them under the abovementioned models. We point out a form of replay attack that renders some other straightforward implementations cumbersome to use. To enhance user-friendliness, we propose a solution using visual cues embedded into the 2D barcodes and incorporate the framework of "augmented reality" for easy verifications through visual inspection. We give a proof-of-concept implementation to show that our scheme is feasible in practice.Comment: 16 pages, 10 figure

Increasing the digital repository of DNA barcoding sequences of sand flies (Psychodidae: Phlebotominae)

Sand f ly identification is complex because it depends on the expertise of the taxonomist. The females show subtle morphological differences and the occurrence of the species complexes are usual in this taxon. Therefore, a fragment of the cytochrome c oxidase subunit I (COI) gene is used for taxon barcoding to resolve this kind of problem. This study incorporates barcode sequences, for the first time, for Evandromyia cortelezzii and Migonemyia migonei from Argentina. The nucleotide sequence divergences were estimated to generate a neighbour-joining (NJ) tree. The automatic barcode gap discovery (ABGD) approach was employed to find the barcode gaps and the operational taxonomic unit (OTU) delimitation. Other species of the subtribe were included. The frequency histogram of divergences showed a barcoding gap. The ABGD analysis identified 14 operational taxonomic units (OTUs) from 13 morphological species. Sequences of Ev. cortelezzii and Mg. migonei formed well supported clusters and were diagnosed as primary species. These sequences are useful tools for molecular identification of the sand f lies of the New World.Fil: Laurito, Magdalena. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Córdoba. Instituto de Investigaciones Biológicas y Tecnológicas. Universidad Nacional de Córdoba. Facultad de Ciencias Exactas, Físicas y Naturales. Instituto de Investigaciones Biológicas y Tecnológicas; Argentina. Universidad Nacional de Córdoba. Facultad de Ciencias Exactas, Físicas y Naturales. Centro de Investigaciones Entomológicas de Córdoba; ArgentinaFil: Ontivero, Iliana Mayra. Universidad Nacional de Córdoba. Facultad de Ciencias Exactas, Físicas y Naturales. Centro de Investigaciones Entomológicas de Córdoba; ArgentinaFil: Almiron, Walter Ricardo. Universidad Nacional de Córdoba. Facultad de Ciencias Exactas, Físicas y Naturales. Centro de Investigaciones Entomológicas de Córdoba; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Córdoba. Instituto de Investigaciones Biológicas y Tecnológicas. Universidad Nacional de Córdoba. Facultad de Ciencias Exactas, Físicas y Naturales. Instituto de Investigaciones Biológicas y Tecnológicas; Argentin

Topological Tracking of Connected Components in Image Sequences

Persistent homology provides information about the lifetime of homology classes along a filtration of cell complexes. Persistence barcode is a graphical representation of such information. A filtration might be determined by time in a set of spatiotemporal data, but classical methods for computing persistent homology do not respect the fact that we can not move backwards in time. In this paper, taking as input a time-varying sequence of two-dimensional (2D) binary digital images, we develop an algorithm for encoding, in the so-called {\it spatiotemporal barcode}, lifetime of connected components (of either the foreground or background) that are moving in the image sequence over time (this information may not coincide with the one provided by the persistence barcode). This way, given a connected component at a specific time in the sequence, we can track the component backwards in time until the moment it was born, by what we call a {\it spatiotemporal path}. The main contribution of this paper with respect to our previous works lies in a new algorithm that computes spatiotemporal paths directly, valid for both foreground and background and developed in a general context, setting the ground for a future extension for tracking higher dimensional topological features in $nD$ binary digital image sequences

Bayesian Cosmic Web Reconstruction: BARCODE for Clusters

We describe the Bayesian BARCODE formalism that has been designed towards the reconstruction of the Cosmic Web in a given volume on the basis of the sampled galaxy cluster distribution. Based on the realization that the massive compact clusters are responsible for the major share of the large scale tidal force field shaping the anisotropic and in particular filamentary features in the Cosmic Web. Given the nonlinearity of the constraints imposed by the cluster configurations, we resort to a state-of-the-art constrained reconstruction technique to find a proper statistically sampled realization of the original initial density and velocity field in the same cosmic region. Ultimately, the subsequent gravitational evolution of these initial conditions towards the implied Cosmic Web configuration can be followed on the basis of a proper analytical model or an N-body computer simulation. The BARCODE formalism includes an implicit treatment for redshift space distortions. This enables a direct reconstruction on the basis of observational data, without the need for a correction of redshift space artifacts. In this contribution we provide a general overview of the the Cosmic Web connection with clusters and a description of the Bayesian BARCODE formalism. We conclude with a presentation of its successful workings with respect to test runs based on a simulated large scale matter distribution, in physical space as well as in redshift space.Comment: 18 pages, 8 figures, Proceedings of IAU Symposium 308 "The Zeldovich Universe: Genesis and Growth of the Cosmic Web", 23-28 June 2014, Tallinn, Estoni

A homological definition of the HOMFLY polynomial

We give a new definition of the knot invariant associated to the Lie algebra su_{N+1}. The knot or link must be presented as the plat closure of a braid. The invariant is then a homological intersection pairing between two submanifolds of a configuration space of points in a disk. This generalizes previous work on the Jones polynomial, which is the case N=1.Comment: 22 pages, 7 figure

Separating Topological Noise from Features Using Persistent Entropy

Topology is the branch of mathematics that studies shapes and maps among them. From the algebraic definition of topology a new set of algorithms have been derived. These algorithms are identified with “computational topology” or often pointed out as Topological Data Analysis (TDA) and are used for investigating high-dimensional data in a quantitative manner. Persistent homology appears as a fundamental tool in Topological Data Analysis. It studies the evolution of k−dimensional holes along a sequence of simplicial complexes (i.e. a filtration). The set of intervals representing birth and death times of k−dimensional holes along such sequence is called the persistence barcode. k−dimensional holes with short lifetimes are informally considered to be topological noise, and those with a long lifetime are considered to be topological feature associated to the given data (i.e. the filtration). In this paper, we derive a simple method for separating topological noise from topological features using a novel measure for comparing persistence barcodes called persistent entropy.Ministerio de Economía y Competitividad MTM2015-67072-