A5058595042- Data Management and Algorithms
- Advanced Database Systems and Queries
- Algorithms and Data Compression
- Geographic Information Systems Studies
- Teaching and Learning Programming
- Advanced Graph Theory Research
- Semantic Web and Ontologies
- Complexity and Algorithms in Graphs
- Access Control and Trust
- Computational Geometry and Mesh Generation
- Experimental Learning in Engineering
- Service-Oriented Architecture and Web Services
- Optimization and Search Problems
- Interconnection Networks and Systems
- Peer-to-Peer Network Technologies
- Distributed systems and fault tolerance
- Advanced Image and Video Retrieval Techniques
- Data Visualization and Analytics
- Higher Education Learning Practices
- 3D Modeling in Geospatial Applications
- Information Systems Education and Curriculum Development
- Digital Rights Management and Security
- Constraint Satisfaction and Optimization
- Open Education and E-Learning
- Gene Regulatory Network Analysis
University of Rome Tor Vergata
2015-2024
University of L'Aquila
1997-2017
Centro di Ricerca in Matematica Pura ed Applicata
2016
Istituto di Analisi dei Sistemi ed Informatica Antonio Ruberti
1996-2005
Istituto Nazionale di Documentazione Innovazione e Ricerca Educativa
2005
National Research Council
1988-2002
University of Massachusetts Lowell
1991
Istituto Nazionale di Fisica Nucleare, Sezione di Roma I
1987
Sapienza University of Rome
1986
We consider spatio-temporal databases supporting spatial objects with continuously changing position and extent, termed moving . formally define a data model for such that includes complex evolving structures as line networks or multi-component regions holes. The is given collection of types operations which can be plugged attribute into any DBMS (e.g. relational, object-oriented) to obtain complete query language. A particular novel concept the sliced representation represents temporal...
A layout algorithm is presented that allows the automatic drawing of data flow diagrams, a diagrammatic representation widely used in functional analysis information systems. grid standard defined for such and aesthetics good readability are identified. The receives as input an abstract graph specifying connectivity relations between elements diagram, produces output corresponding diagram according to aesthetics. basic strategy build incrementally layout; first, topology constructed with few...
Considering the expression "computational thinking" as an entry point to understand why fundamental contribution of computing science is shift from solving problems having solved.
Whereas earlier work on spatiotemporal databases generally focused geometries changing in discrete steps, the emerging area of moving objects supports continuously. Two important abstractions are point and region, modelling for which only time-dependent position, or also shape extent relevant, respectively. Examples first kind entity all kinds vehicles, aircraft, people animals; latter hurricanes, forest fires, growth oil spills sea. The goal is to develop data models query languages as well...
Many advanced countries are recognizing more and the importance of teaching computing, in some cases even as early primary school. "Computational thinking" is term often used to denote conceptual core computer science or "the way a scientist thinks", Wing put it. Such - given also lack widely accepted definition has become "buzzword" meaning different things people. We investigated Italian school teachers' conceptions about computational thinking by analyzing results survey (N=972) conducted...
In this paper the first two years of activities "Programma il Futuro" project are described. Its goal is to disseminate among teachers in Italian primary and secondary schools a better awareness informatics as scientific basis digital technologies. The has adapted Code.org learning material introduced it with support dedicated web site. Response been enthusiastic terms participation: more than one million students have engaged completed total 10 hours schools. Almost all found useful were...
In diagrammatic representations of hierarchies the minimization number crossings between edges is a well-known criterion for improving readability. An efficient algorithm testing if hierarchy planar (i.e. it can be drawn without edge crossings) proposed. A complete combinatorial characterization class also given.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
research-article Share on Informatics as a fundamental discipline for the 21st century Authors: Michael E. Caspersen Aarhus University, Aarhus, Denmark DenmarkView Profile , Judith Gal-Ezer The Open University of Israel, Ra'anana, Israel IsraelView Andrew McGettrick Strathclyde Glasgow, Scotland ScotlandView Enrico Nardelli Tor Vergata Rome, Italy ItalyView Authors Info & Claims Communications ACMVolume 62Issue 4April 2019 pp 58https://doi.org/10.1145/3310330Published:20 March...
article Chorochronos: a research network for spatiotemporal database systems Share on Authors: Andrew Frank View Profile , Stephane Grumbach Ralf Hartmut Güting Christian S. Jensen Manolis Koubarakis Nikos Lorentzos Yannis Manolopoulos Enrico Nardelli Barbara Pernici Hans-Jörg Schek Michel Scholl Timos Sellis Dept. of Electrical and Comp. Engin., National Tech. University Athens, Zografou, 15773, Greece GreeceView Babis Theodoulidis Peter Widmayer Authors Info & Claims ACM SIGMOD...
research-article Share on Informatics Education for School: A European Initiative Authors: Michael Caspersen It-vest networking universities and Aarhus University, Denmark DenmarkView Profile , Judith Gal-Ezer Open University of Israel, Israel IsraelView Andrew McGettrick Strathclyde Glasgow, UK UKView Enrico Nardelli Vergata Rome, Italy ItalyView Authors Info & Claims ACM InroadsVolume 14Issue 1March 2023pp 49–53https://doi.org/10.1145/3583088Published:21 February 2023Publication History...
In network communication systems, frequently messages are routed along a minimum diameter spanning tree (MDST) of the network, to minimize maximum delay in delivering message. When transient edge failure occurs, it is important choose temporary replacement which minimizes new tree. Such an optimal called best swap. As natural extension, all-best-swaps (ABS) problem finding swap for every MDST. Given weighted graph G = (V,E), where |V| n and |E| m, we solve ABS O(n√m) time O(m + n) space,...