MAPPA. Metodologie Applicate alla Predittività del Potenziale Archeologico. 2

La carta di potenziale archeologico della città di Pisa. L'algoritmo elaborato ad hoc per il calcolo del potenziale archeologico. Il MOD: il primo archivio italiano open data di documenti archeologici

Developing the ArchAIDE Application: A digital workflow for identifying, organising and sharing archaeological pottery using automated image recognition

Pottery is of fundamental importance for understanding archaeological contexts, facilitating the understanding of production, trade flows, and social interactions. Pottery characterisation and the classification of ceramics is still a manual process, reliant on analogue catalogues created by specialists, held in archives and libraries. The ArchAIDE project worked to streamline, optimise and economise the mundane aspects of these processes, using the latest automatic image recognition technology, while retaining key decision points necessary to create trusted results. Specifically, ArchAIDE worked to support classification and interpretation work (during both fieldwork and post-excavation analysis) with an innovative app for tablets and smartphones. This article summarises the work of this three-year project, funded by the European Union's Horizon 2020 Research and Innovation Programme under grant agreement N.693548, with a consortium of partners representing both the academic and industry-led ICT (Information and Communications Technology) domains, and the academic and development-led archaeology domains. The collaborative work of the archaeological and technical partners created a pipeline where potsherds are photographed, their characteristics compared against a trained neural network, and the results returned with suggested matches from a comparative collection with typical pottery types and characteristics. Once the correct type is identified, all relevant information for that type is linked to the new sherd and stored within a database that can be shared online. ArchAIDE integrated a variety of novel and best-practice approaches, both in the creation of the app, and the communication of the project to a range of stakeholders

Left invertibility of discrete-time output-quantized systems: the linear case with finite inputs

This paper studies left invertibility of discrete-time linear output-quantized systems. Quantized outputs are generated according to a given partition of the state-space, while inputs are sequences on a finite alphabet. Left invertibility, i.e. injectivity of I/O map, is reduced to left D-invertibility, under suitable conditions. While left invertibility takes into account membership to sets of a given partition, left D-invertibility considers only membership to a single set, and is much easier to detect. The condition under which left invertibility and left D-invertibility are equivalent is that the elements of the dynamic matrix of the system form an algebraically independent set. Our main result is a method to compute left D-invertibility (so also left invertibility for a full measure matrix set) for all linear systems with no eigenvalue of modulus one. Some examples are presented to show the application of the proposed method

Left invertibility of output-quantized systems: an application to cryptography

In this paper a secure communication method is proposed, based on left invertibility of output-quantized dynamical systems. The sender uses an output-quantized linear system with a feedback function to encode messages, which are sequences of inputs of the system. So left invertibility property enables the receiver to recover the messages. The secret key is formed by the system’s parameters, including the feedback function. The use of quantization makes the cryptographic system work exactly, and without asymptotic estimates. Simulations of encoding-decoding procedure and results about security of the method are finally shown

Left invertibility of discrete systems with finite inputs and quantized output

The aim of this paper is to address left invertibility for dynamical systems with inputs and outputs in discrete sets. We study systems that evolve in discrete time within a continuous state-space. Quantized outputs are generated by the system according to a given partition of the state-space, while inputs are arbitrary sequences of symbols in a finite alphabet, which are associated to specific actions on the system. We restrict to the case of contractive dynamics for fixed inputs. The problem of left invertibility, i.e. recovering an unknown input sequence from the knowledge of the corresponding output string, is addressed using the theory of Iterated Function Systems (IFS), a tool developed for the study of fractals. We show how the IFS naturally associated to a system and the geometric properties of its attractor are linked to the left invertibility property of the system. Our main results are a necessary and sufficient condition for a given system to be left invertible with probability one on the space of inputs (i.e. for almost all input sequences), and necessary and sufficient conditions for left invertibility and uniform left invertibility under some weak additional hypotheses. A few examples are presented to illustrate the application of the proposed method

Distributed consensus on boolean information

In this paper we study the convergence towards consensus on information in a distributed system of agents communicating over a network. The particularity of this study is that the information on which the consensus is seeked is not represented by real numbers, rather by logical values or compact sets. Whereas the problems of allowing a network of agents to reach a consensus on logical functions of input events, and that of agreeing on set{valued information, have been separately addressed in previous work, in this paper we show that these problems can indeed be attacked in a unied way in the framework of Boolean distributed information systems. Based on a notion of contractivity for Boolean dynamical systems, a necessary and sucient condition ensuring the global convergence toward a unique equilibrium point is presented. This result can be seen as a rst step toward the denition of a unied framework to uniformly address all consensus problems on Boolean algebras

Melanoma Prevention: Comparison of Different Screening Methods for the Selection of a High Risk Population

Background: Guidelines recommend limiting melanoma screening in a population with known risk factors, but none indicates methods for efficient recruitment. The purpose of this study is to compare three different methods of recruiting subjects to be screened for melanoma to detect which, if any, is the most efficient. Methods: From 2010 to 2019, subjects were recruited as follows: (1) regular skin examinations (RS), mainly conducted through the Associazione Contro il Melanoma network; (2) occasional melanoma screening (OS), during annual public campaigns; (3) and selective screening (SS), where people were invited to undergo a skin check after filling in a risk evaluation questionnaire, in cases where the assigned outcome was intermediate/high risk. Melanoma risk factors were compared across different screening methods. Generalized Linear Mixed Models were used for multivariable analysis. Results: A total of 2238 subjects (62.7% women) were recruited, median age 44 years (2–85), and 1094 (48.9 %) records were collected through RS, 826 (36.9 %) through OS, and 318 (14.2 %) through SS. A total of 131 suspicious non-melanoma skin cancers were clinically diagnosed, 20 pathologically confirmed, and 2 melanomas detected. SS performed significantly better at selecting subjects with a family history of melanoma and I-II phototypes compared to OS. Conclusions: Prior evaluation of melanoma known risk factors allowed for effective selection of a population to screen at higher risk of developing a melanoma