701 research outputs found

    Identity in the novels of Marcio Veloz Maggiolo

    No full text
    (in English): The aim of this diploma thesis is to analyse the Dominican identity in the works of the Dominican author Marcio Veloz Maggiolo. At first, the thesis briefly summarizes the evolution of the Dominican literature and mentions its most significant figures. Secondly, it deals with the evolution of the dominicaness from the colonial period up to the present and explains the reasons of the rooted antihaitianism. The second part consists of a detailed analysis of the novels The Diffuse Biography of Sombra Castañeda and The Accordion Man by Marcio Veloz Maggiolo, emphasizing the symbols of the official government's discourse, and also a more opened perspective of the dominicaness

    The double superficiality of the frontal image of the Turin Shroud

    No full text
    Photographs of the back surface of the Turin Shroud were analysed to verify the existence of a double body image of the Man, as postulated by J. Jackson in 1990. The body image is very faint and the background not uniform, i.e., the signal-to-noise ratio is lower than one. Therefore, image processing, developed ad hoc, was necessary to highlight body features. This was based on convolution with Gaussian filters, summation of images, and filtering in spatial frequency by direct and inverse bidimensional Fourier Transforms. Body features were identified by template matching. The face and probably also the hands are visible on the back of the Turin Shroud, but not features related to the dorsal image

    About the second image of face detected on the Turin Shroud

    No full text
    A second faint image of the face of the Turin Shroud has been discovered in 2004 and many scientists in the world confirmed the discovery, but a recent paper has questioned in a debatable way its presence. With a perhaps too high degree of certainty it explained those patterns with pareidolia and Gestalt effects of the human perception, supporting its conclusion on the basis of illusory images perhaps built on purposes and on numerical results also derived from spatial cross-correlation used in a not proper way. This paper both discusses these results showing why the image processing used in that paper seems not proper to sustain its thesis and presents additional image processing for pattern recognition

    Monotonic Hybrid Systems

    No full text
    AbstractMany physical events assume values that can be represented with functions that are monotonic with respect to time passing. This paper defines the class of Monotonic Hybrid Systems, namely Hybrid Systems where activities and assignments are monotonic functions.On the basis that, among Hybrid Systems, Integrator Systems (which are Hybrid Systems equipped with stopwatches) are the most expressive of the classes with a linear evolution law, and that Timed Systems (which are Hybrid Systems equipped with clocks) enjoy most of the decidable properties required, we compare Monotonic Hybrid Systems with the above classes, with respect to decidability, expressiveness and succinctness. We show that a subclass of Monotonic Hybrid Systems is equivalent to Integrator Systems and Timed Systems with discrete time assumption, but that it strictly contains them when assuming dense time. This has practical consequences both in the discrete and dense context when symbolic verification is not possible. We also show that Monotonic Hybrid Systems allow more succinct descriptions than those of Integrator and Timed Systems. This result shows that not only hierarchy, non-determinism and communication, as already noticed in Alur et al. (Proceedings of the HSCC 00, Lecture Notes in Computer Science, Springer, Berlin, 2000, pp. 6–19) and Grosu and Stauner (Formal Methods System Design) 21 (2002) 5), have an impact on succinctness, but also the shape of functions used in descriptions does.For a subclass of Monotonic Hybrid Systems for which reachability is decidable if the functions used are computable, we consider both the problem of verifying properties written in a suitable logic and also the relationship between dense time and discrete time assumptions in the framework of verification. The formalism and the results are illustrated by some examples

    Timed Automata with Monotonic Activities

    No full text
    The paper introduces TAMA (Timed Automata with Monotonic Activities) a subclass of hybrid automata including as proper subclass TA (Timed Automata), Multirate Automata and Integrator Automata. A subclass of TAMA, called TAMA o, is studied and shown to be equivalent to Timed Automata under the assumption of discrete time, while in dense time TAMA o contains properly the subclasses of hybrid systems mentioned. We also show that TAMA o allow more succinct descriptions than TA

    HBIM METHODOLOGY AS A BRIDGE BETWEEN ITALY AND ARGENTINA

    No full text
    The availability of efficient HBIM workflows could represent a very important change towards a more efficient management of the historical real estate. The present work shows how to obtain accurate and reliable information of heritage buildings through reality capture and 3D modelling to support restoration purposes or knowledge-based applications. Two cases studies metaphorically joint Italy with Argentina. The research article explains the workflows applied at the Palazzo Ferretti at Ancona and the Manzana Histórica de la Universidad National del Litoral, providing a constructive comparison and blending technological and theoretical approaches. In a bottom-up process, the assessment of two cases study validates a workflow allowing the achievement of a useful and proper data enrichment of each HBIM model. Another key aspect is the Level of Development (LOD) evaluation of both models: different ranges and scales are defined in America (100–500) and in Italy (A–G), nevertheless is possible to obtain standard shared procedures, enabling facilitation of HBIM development and diffusion in operating workflows

    Weak bisimulation for Probabilistic Timed Automata

    No full text
    AbstractWe are interested in describing timed systems that exhibit probabilistic behaviour. To this purpose, we consider a model of Probabilistic Timed Automata and introduce a concept of weak bisimulation for these automata, together with an algorithm to decide it. The weak bisimulation relation is shown to be preserved when either time, or probability is abstracted away. As an application, we use weak bisimulation for Probabilistic Timed Automata to model and analyze a timing attack on the dining cryptographers protocol
    corecore