On lattices from combinatorial game theory modularity and a representation theorem: finite case

We show that a self-generated set of combinatorial games, S. may not be hereditarily closed but, strong self-generation and hereditary closure are equivalent in the universe of short games. In [13], the question "Is there a set which will give a non-distributive but modular lattice?" appears. A useful necessary condition for the existence of a finite non-distributive modular L(S) is proved. We show the existence of S such that L(S) is modular and not distributive, exhibiting the first known example. More, we prove a Representation Theorem with Games that allows the generation of all finite lattices in game context. Finally, a computational tool for drawing lattices of games is presented. (C) 2014 Elsevier B.V. All rights reserved.

Features combination for art authentication studies: brushstroke and materials analysis of Amadeo de Souza-Cardoso

This work presents a tool to support authentication studies of paintings attributed to the modernist Portuguese artist Amadeo de Souza-Cardoso (1887-1918). The strategy adopted was to quantify and combine the information extracted from the analysis of the brushstroke with information on the pigments present in the paintings. The brushstroke analysis was performed combining Gabor filter and Scale Invariant Feature Transform. Hyperspectral imaging and elemental analysis were used to compare the materials in the painting with those present in a database of oil paint tubes used by the artist. The outputs of the tool are a quantitative indicator for authenticity, and a mapping image that indicates the areas where materials not coherent with Amadeo's palette were detected, if any. This output is a simple and effective way of assessing the results of the system. The method was tested in twelve paintings obtaining promising results.