Mapping Dynamics into Graphs. The Visibility Algorithm

Si no tenemos en cuenta posibles procesos subyacentes con significado físico, químico, económico, etc., podemos considerar una serie temporal como un mero conjunto ordenado de valores y jugar con él algún inocente juego matemático como transformar dicho conjunto en otro objeto con la ayuda de una operación matemática para ver qué sucede: qué propiedades del conjunto original se conservan, cuáles se transforman y cómo, qué podemos decir de alguna de las dos representaciones matemáticas del objeto con sólo atender a la otra... Este ejercicio sería de cierto interés matemático por sí solo. Ocurre, además, que las series temporales son un método universal de extraer información de sistemas dinámicos en cualquier campo de la ciencia. Esto hace ganar un inesperado interés práctico al juego matemático anteriormente descrito, ya que abre la posibilidad de analizar las series temporales (vistas ahora como evolución temporal de procesos dinámicos) desde una nueva perspectiva. Hemos para esto de asumir la hipótesis de que la información codificada en la serie original se conserva de algún modo en la transformación (al menos una parte de ella). El interés resulta completo cuando la nueva representación del objeto pertencece a un campo de la matemáticas relativamente maduro, en el cual la información codificada en dicha representación puede ser descodificada y procesada de manera efectiva. ABSTRACT Disregarding any underlying process (and therefore any physical, chemical, economical or whichever meaning of its mere numeric values), we can consider a time series just as an ordered set of values and play the naive mathematical game of turning this set into a different mathematical object with the aids of an abstract mapping, and see what happens: which properties of the original set are conserved, which are transformed and how, what can we say about one of the mathematical representations just by looking at the other... This exercise is of mathematical interest by itself. In addition, it turns out that time series or signals is a universal method of extracting information from dynamical systems in any field of science. Therefore, the preceding mathematical game gains some unexpected practical interest as it opens the possibility of analyzing a time series (i.e. the outcome of a dynamical process) from an alternative angle. Of course, the information stored in the original time series should be somehow conserved in the mapping. The motivation is completed when the new representation belongs to a relatively mature mathematical field, where information encoded in such a representation can be effectively disentangled and processed. This is, in a nutshell, a first motivation to map time series into networks.

Advanced Characterisation of a Coffee Fermenting Tank by Multi-distributed Wireless Sensors: Spatial Interpolation and Phase Space Graphs

The fermentation stage is considered to be one of the critical steps in coffee processing due to its impact on the final quality of the product. The objective of this work is to characterise the temperature gradients in a fermentation tank by multi-distributed, low-cost and autonomous wireless sensors (23 semi-passive TurboTag® radio-frequency identifier (RFID) temperature loggers). Spatial interpolation in polar coordinates and an innovative methodology based on phase space diagrams are used. A real coffee fermentation process was supervised in the Cauca region (Colombia) with sensors submerged directly in the fermenting mass, leading to a 4.6 °C temperature range within the fermentation process. Spatial interpolation shows a maximum instant radial temperature gradient of 0.1 °C/cm from the centre to the perimeter of the tank and a vertical temperature gradient of 0.25 °C/cm for sensors with equal polar coordinates. The combination of spatial interpolation and phase space graphs consistently enables the identification of five local behaviours during fermentation (hot and cold spots).

An Access Control Model for Protecting Provenance Graphs

Postprint

The role of London forces in defining noncentrosymmetric order of high dipole moment–high hyperpolarizability chromophores in electrically poled polymeric thin films

Graphs of second harmonic generation coefficients and electro-optic coefficients (measured by ellipsometry, attenuated total reflection, and two-slit interference modulation) as a function of chromophore number density (chromophore loading) are experimentally observed to exhibit maxima for polymers containing chromophores characterized by large dipole moments and polarizabilities. Modified London theory is used to demonstrated that this behavior can be attributed to the competition of chromophore-applied electric field and chromophore–chromophore electrostatic interactions. The comparison of theoretical and experimental data explains why the promise of exceptional macroscopic second-order optical nonlinearity predicted for organic materials has not been realized and suggests routes for circumventing current limitations to large optical nonlinearity. The results also suggest extensions of measurement and theoretical methods to achieve an improved understanding of intermolecular interactions in condensed phase materials including materials prepared by sequential synthesis and block copolymer methods.

Constellations and the unsupervised learning of graphs

In this paper, we propose a novel method for the unsupervised clustering of graphs in the context of the constellation approach to object recognition. Such method is an EM central clustering algorithm which builds prototypical graphs on the basis of fast matching with graph transformations. Our experiments, both with random graphs and in realistic situations (visual localization), show that our prototypes improve the set median graphs and also the prototypes derived from our previous incremental method. We also discuss how the method scales with a growing number of images.

Student essay attributed to William Ellery Channing, 1797 June 5

Three-page handwritten essay composed in English and attributed to Harvard undergraduate William Ellery Channing. The verso of the last page is inscribed "Channing 5 June 97." A quotation from Edward Young appears at the top of the first page: "A Competence is vital to content / Much wealth is corpulence, if not disease" and discusses the topic of affluence. The document includes edits and struck-through words.

Mathematical notebook attributed to Thaddeus Mason Harris, ca. 1787

Hardcover notebook containing handwritten transcriptions of rules, cases, and examples from 18th century mathematical texts. The author and purpose of the volume is unclear, though it has been connected with Thaddeus Mason Harris (Harvard AB 1787). Most of the entries include questions and related answers, suggesting the notebook was used as a manuscript textbook and workbook. The extracts appear to be copied from John Dean's " Practical arithmetic" (published in 1756 and 1761), Daniel Fenning's "The young algebraist's companion" (published in multiple editions beginning in 1750), and Martin Clare's "Youth's introduction to trade and business" (extracts first included in 1748 edition).