Donatella Gubiani

Dr. Donatella Gubiani

orcid

Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 November 2017 in Expert Systems with Applications
Verified
Journal Article
Closed access
DGDonatella Gubiani
Donatella Gubiani
EFElsa Fabbretti
Elsa Fabbretti
BCBojan Cestnik
Bojan Cestnik
NLNada Lavrač
Nada Lavrač
TUTanja Urbančič
Tanja Urbančič

1 September 2007
Verified
Conference Paper
Closed access
MFMassimo Franceschet
Massimo Franceschet
AMAngelo Montanari
Angelo Montanari
DGDonatella Gubiani
Donatella Gubiani
In this paper, we describe a translation algorithm that maps spatio-temporal conceptual schemas into XML schemas expressed in the W3C XML Schema Language. Moreover, we extend the standard XML Schema validator with a Java library to check spatio-temporal constraints. The resulting framework allows one to validate XML documents containing spatio-temporal information with respect to spatio-temporal conceptual schemas.

1 January 2009
Verified
Book Chapter
Closed access
PDF file
MFMassimo Franceschet
Massimo Franceschet
DGDonatella Gubiani
Donatella Gubiani
AMAngelo Montanari
Angelo Montanari
Carla  PiazzaCarla Piazza
Carla Piazza

3 April 2019 in Geo-spatial Information Science
Verified
Journal Article
Open access
ATAndrea Dalla Torre
Andrea Dalla Torre
PGPaolo Gallo
Paolo Gallo
DGDonatella Gubiani
Donatella Gubiani
CMChris Marshall
Chris Marshall
AMAngelo Montanari
Angelo Montanari
AVAndrea Viel
Andrea Viel
The widespread availability of mobile communication makes mobile devices a resource for the collection of data about mobile infrastructures and user mobility. In these contexts, the problem of reconstructing the most likely trajectory of a device on the road network on the basis of the sequence of observed locations (map-matching problem) turns out to be particularly relevant. Different contributions have demonstrated that the reconstruction of the trajectory of a device with good accuracy is technically feasible even when only a sparse set of GNSS positions is available. In this paper, we face the problem of coping with sparse sequences of cellular fingerprints. Compared to GNSS positions, cellular fingerprints provide coarser spatial information, but they work even when a device is missing GNSS positions or is operating in an energy saving mode. We devise a new map-matching algorithm, that exploits the well-known Hidden Markov Model and Random Forests to successfully deal with noisy and sparse cellular observations. The performance of the proposed solution has been tested over a medium-sized Italian city urban environment by varying both the sampling of the observations and the density of the fingerprint map as well as by including some GPS positions into the sequence of fingerprint observations.

26 April 2013 in ACM Transactions on Database Systems
Verified
Journal Article
Open access
PDF file
MFMassimo Franceschet
Massimo Franceschet
DGDonatella Gubiani
Donatella Gubiani
AMAngelo Montanari
Angelo Montanari
Carla  PiazzaCarla Piazza
Carla Piazza
We propose a mapping from a database conceptual design to a schema for XML that produces highly connected and nested XML structures. We first introduce two alternative definitions of the mapping, one modeling entities as global XML elements and expressing relationships among them in terms of keys and key references (flat design), the other one encoding relationships by properly including the elements for some entities into the elements for other entities (nest design). Then we provide a benchmark evaluation of the two solutions showing that the nest approach, compared to the flat one, leads to improvements in both query and validation performances. This motivates us to systematically investigate the best way to nest XML structures. We identify two different nesting solutions: a maximum depth nesting, that keeps low the number of costly join operations that are necessary to reconstruct information at query time using the mapped schema, and a maximum density nesting, that minimizes the number of schema constraints used in the mapping of the conceptual schema, thus reducing the validation overhead. On the one hand, the problem of finding a maximum depth nesting turns out to be NP-complete and, moreover, it admits no constant ratio approximation algorithm. On the other hand, we devise a graph-theoretic algorithm, NiduX, that solves the maximum density problem in linear time. Interestingly, NiduX finds the optimal solution for the harder maximum depth problem whenever the conceptual design graph is either acyclic or complete. In randomly generated intermediate cases of the graph topology, we experimentally show that NiduX finds a good approximation of the optimal solution.

1 March 2018
Verified
Conference Paper
Closed access
AVAndrea Viel
Andrea Viel
DGDonatella Gubiani
Donatella Gubiani
PGPaolo Gallo
Paolo Gallo
AMAngelo Montanari
Angelo Montanari
ATAndrea Dalla Torre
Andrea Dalla Torre
CMChris Marshall
Chris Marshall
Determining the path followed by a moving device is an important task in a number of fields. Map matching is the problem of obtaining the most likely trajectory of a device on the road network given a sequence of observed locations. Past work has demonstrated that it is possible to reconstruct the trajectory of a device with good accuracy even with sparse GPS positions. In this work, we show that similar results can be achieved using sparse sequences of cellular fingerprints. Compared to GPS positions, cellular fingerprints provide coarser spatial information, but they allow a significant reduction in power consumption. We propose a new map-matching algorithm, based on the well-known Hidden Markov Model construction, that successfully works with noisy and sparse cellular observations. The proposal has been tested on a urban environment of a medium-sized Italian city. Its robustness has been checked by varying the sampling of the observations and the density of the fingerprint map, and by using mixed sequences of GPS and fingerprints observations.