Search results for " Informatica"

A recurrent deep neural network model to measure sentence complexity for the Italian Language

2019

Text simplification (TS) is a natural language processing task devoted to the modification of a text in such a way that the grammar and structure of the phrases is greatly simplified, preserving the underlying meaning and information contents. In this paper we give a contribution to the TS field presenting a deep neural network model able to detect the complexity of italian sentences. In particular, the system gives a score to an input text that identifies the confidence level during the decision making process and that could be interpreted as a measure of the sentence complexity. Experiments have been carried out on one public corpus of Italian texts created specifically for the task of TS…

Unambiguous recognizable two-dimensional languages

2006

We consider the family UREC of unambiguous recognizable two-dimensional languages. We prove that there are recognizable languages that are inherently ambiguous, that is UREC family is a proper subclass of REC family. The result is obtained by showing a necessary condition for unambiguous recognizable languages. Further UREC family coincides with the class of picture languages defined by unambiguous 2OTA and it strictly contains its deterministic counterpart. Some closure and non-closure properties of UREC are presented. Finally we show that it is undecidable whether a given tiling system is unambiguous.

Consolidation

2021

magazén - International Journal for Digital and Public Humanities is the interdisciplinary journal of the Venice Centre for Digital and Public Humanities (VeDPH) based at the Department of Humanities at Ca’ Foscari University of Venice undergoing double blind peer review and published twice per year in open access by Edizioni Ca’ Foscari. The articles of this volume focus on the consolidation of scholarly practices and research models circulating in the international scholarly context of Digital and Public Humanities addressing the concept of ‘consolidations’ from different perspectives and with different methodological approaches and presenting a varied and yet intertwined landscape.

Fusions

2020

FUSIONS

Co-simulated Digital Twin on the Network Edge: the case of platooning

2022

This paper presents an approach to create high fidelity Digital-Twin models for distributed multi-agent cyber-physical systems based on the combination of simulating components, generated from different modeling languages, each tailored for the specific domain of the subsystem. The approach specifically addresses the wireless communication domain, exploiting a Python module as a simulating component to evaluate the impact of network delay among the distributed elements of the system under analysis. A case study with a platoon of four vehicles following a leading car, all modeled in Simulink, is used to show the applicability of the approach, allowing the comparison between a Vehicle-to-Vehi…

Il trattamento digitale delle fonti giuridiche di tradizione manoscritta

2012

On fixed points of the Burrows-Wheeler transform

2017

The Burrows-Wheeler Transform is a well known transformation widely used in Data Compression: important competitive compression software, such as Bzip (cf. [1]) and Szip (cf. [2]) and some indexing software, like the FM-index (cf. [3]), are deeply based on the Burrows Wheeler Transform. The main advantage of using BWT for data compression consists in its feature of "clustering" together equal characters. In this paper we show the existence of fixed points of BWT, i.e., words on which BWT has no effect. We show a characterization of the permutations associated to BWT of fixed points and we give the explicit form of fixed points on a binary ordered alphabet a, b having at most four b's and th…

On the Shuffle of Star-Free Languages

2012

Motivated by the general problem to characterize families of languages closed under shuffle, we investigate some conditions under which the shuffle of two star-free languages is star-free. Some of the special cases here approached give rise to new problems in combinatorics on words.

An Efficient Algorithm for the Generation of Z-Convex Polyominoes

2014

We present a characterization of Z-convex polyominoes in terms of pairs of suitable integer vectors. This lets us design an algorithm which generates all Z-convex polyominoes of size n in constant amortized time.

A bijection between words and multisets of necklaces

2012

Two of the present authors have given in 1993 a bijection Phi between words on a totally ordered alphabet and multisets of primitive necklaces. At the same time and independently, Burrows and Wheeler gave a data compression algorithm which turns out to be a particular case of the inverse of Phi. In the present article, we show that if one replaces in Phi the standard permutation of a word by the co-standard one (reading the word from right to left), then the inverse bijection is computed using the alternate lexicographic order (which is the order of real numbers given by continued fractions) on necklaces, instead of the lexicographic order as for Phi(-1). The image of the new bijection, ins…