Home | ISISLab | Dipartimento di Informatica e Applicazioni | Università di Salerno

Vittorio Scarano

Dipartimento di Informatica ed Applicazioni "R.M. Capocelli", Università di Salerno, Italy

Author	Title	Year	Journal/Proceedings	Reftype	DOI/URL
Andreoli, R., De Chiara, R., Erra, U., Iannaccone, A., La Greca, F. & Scarano, V.	Some Real Experiences in Developing Virtual Environments [Abstract] [BibTeX]	2006	Proceedings of 10th International Conference on Information Visualisation (IV 2006) July 5-7 2006, London, UK , pp. 545-552. IEEE Computer Society.	inproceedings	DOI
Abstract: The paper presents some experiences in developing a virtual environment using a videogame engine. It provides the details and the caveats met during development, with particular attentions to the architectural reconstruction problem, the textures resolution and the programmability. Some considerations are also reported from an historical point of view, emphasizing the importance of virtual reconstructions, and from a psychological point of view stressing how a narrative context enhances the learning process.
BibTeX: @inproceedings{AndreoliDEILS2006, author = {Roberto Andreoli and Rosario {De Chiara} and Ugo Erra and Antonio Iannaccone and Fernando {La Greca} and Vittorio Scarano}, title = {{Some Real Experiences in Developing Virtual Environments}}, booktitle = {Proceedings of 10th International Conference on Information Visualisation (IV 2006) July 5-7 2006, London, UK}, publisher = {IEEE Computer Society}, year = {2006}, pages = {545-552}, doi = {http://doi.ieeecomputersociety.org/10.1109/IV.2006.98} }
Andreoli, R., De Chiara, R., Erra, U. & Scarano, V.	Interactive 3D Environments by Using Videogame Engines [Abstract] [BibTeX]	2005	Proceedings of 9th International Conference on Information Visualisation (IV 2005), July 6-8 2005, London, UK , pp. 515-520. IEEE Computer Society.	inproceedings	DOI
Abstract: In this paper we study state-of-the-art technologies to design interactive and cooperative 3D environments that are based on videogame 3D engines. We provide, first, a categorization of videogame 3D engines from the point of view of their usage in creating interactive 3D worlds and show a comparison of the most important characteristics. Then, we show an example of how we used a commercial videogame engine to create an interactive an enjoyable visit to an archaeological site.
BibTeX: @inproceedings{AndreoliDES2005, author = {Roberto Andreoli and Rosario {De Chiara} and Ugo Erra and Vittorio Scarano}, title = {{Interactive 3D Environments by Using Videogame Engines}}, booktitle = {Proceedings of 9th International Conference on Information Visualisation (IV 2005), July 6-8 2005, London, UK}, publisher = {IEEE Computer Society}, year = {2005}, pages = {515-520}, doi = {http://doi.ieeecomputersociety.org/10.1109/IV.2005.64} }
Andreoli, R., De Chiara, R., Erra, U., Scarano, V., Pontrandolfo, A., Rizzo, L. & Santoriello, A.	An interactive 3D reconstruction of a funeral in Andriuolo's Necropolis in Paestum [Abstract] [BibTeX]	2005	Proceedings of Computer Applications and Quantitative Methods in Archaeology (CAA 2005)	inproceedings
Abstract: In this paper we describe an interactive 3D reconstruction of a funeral cortege in the Andriuolo necropolis in Paestum . The reconstruction is based on ordinary videogame engines that are used to provide both a highly realistic environment on ordinary hardware as well as an entertaining and informative interactive tool to explore archaeological research to a wide audience.
BibTeX: @inproceedings{AndreoliDESPRS2005, author = {Roberto Andreoli and Rosario {De Chiara} and Ugo Erra and Vittorio Scarano and Angela Pontrandolfo and Luigia Rizzo and Alfonso Santoriello}, title = {{An interactive 3D reconstruction of a funeral in Andriuolo's Necropolis in Paestum}}, booktitle = {Proceedings of Computer Applications and Quantitative Methods in Archaeology (CAA 2005)}, year = {2005} }
Auletta, V., Das, S. K., De Vivo, A., Pinotti, M. C. & Scarano, V.	Optimal Tree Access by Elementary and Composite Templates in Parallel Memory Systems [Abstract] [BibTeX]	2002	IEEE Trans. Parallel Distrib. Syst. Vol. 13 (4) , pp. 399-412.	article	DOI
Abstract: In this paper, we study efficient strategies for mapping onto parallel memory systems complete trees that are accessed by fixed templates (like complete subtrees, paths, or any combinations their of). These mappings are evaluated with respect to the following criteria: (1) the largest number of data items that can be accessed in parallel without memory conflicts; (2) the number of memory conflicts that can occur when accessing templates of size equal to the number of available memory modules, thereby exploiting the full parallelism of the system; (3) the complexity of the memory addressing scheme, i.e., the cost of retrieving the module where a given data item is mapped. We show that there exist trade-offs between these three criteria and the performance of different mapping strategies depends on the emphasis given on each of these criteria. More specifically, we describe an algorithm for mapping complete binary trees of height H onto M memory modules and prove that it achieves the following performance results: (1) conflict-free access to complete subtrees of size K and paths of size N such that N + K - [log K] &les; M; (2) at most 1 conflict in accessing complete subtrees and paths of size M; (3) O(K/M + c) conflicts when accessing a composite template of K nodes consisting of c disjoint subsets, each subset being a complete subtree, or a path or a set of consecutive nodes in a level of the tree
BibTeX: @article{AulettaDDPS2002, author = {Vincenzo Auletta and Sajal K. Das and Amelia {De Vivo} and Maria Cristina Pinotti and Vittorio Scarano}, title = {{Optimal Tree Access by Elementary and Composite Templates in Parallel Memory Systems}}, journal = {IEEE Trans. Parallel Distrib. Syst.}, year = {2002}, volume = {13}, number = {4}, pages = {399-412}, doi = {http://dx.doi.org/10.1109/71.995820} }
Auletta, V., Das, S. K., De Vivo, A., Pinotti, M. C. & Scarano, V.	Optimal Tree Access by Elementary and Composite Templates in Parallel Memory Systems [BibTeX]	2001	Proceedings of the 15th International Parallel & Distributed Processing Symposium (IPDPS-01), April 23-27, 2001, San Francisco, California, USA , pp. 35. IEEE Computer Society.	inproceedings
BibTeX: @inproceedings{Auletta2001, author = {Vincenzo Auletta and Sajal K. Das and Amelia {De Vivo} and Maria Cristina Pinotti and Vittorio Scarano}, title = {{Optimal Tree Access by Elementary and Composite Templates in Parallel Memory Systems}}, booktitle = {Proceedings of the 15th International Parallel {\&} Distributed Processing Symposium (IPDPS-01), April 23-27, 2001, San Francisco, California, USA}, publisher = {IEEE Computer Society}, year = {2001}, pages = {35} }
Auletta, V., Das, S. K., De Vivo, A., Pinotti, M. C. & Scarano, V.	Toward a Universal Mapping Algorithm for Accessing Trees in Parallel Memory Systems [BibTeX]	1998	Proceedings of the IEEE 12th joint International Parallel Processing Symposium and Symposium on Parallel and Distributed Computing (IPPS/SPDP), March 3 - April 1 1998, Orlando, Florida, USA , pp. 447. IEEE Computer Society.	inproceedings	DOI
BibTeX: @inproceedings{AulettaDDPS1998, author = {Vincenzo Auletta and Sajal K. Das and Amelia {De Vivo} and Maria Cristina Pinotti and Vittorio Scarano}, title = {{Toward a Universal Mapping Algorithm for Accessing Trees in Parallel Memory Systems}}, booktitle = {Proceedings of the IEEE 12th joint International Parallel Processing Symposium and Symposium on Parallel and Distributed Computing (IPPS/SPDP), March 3 - April 1 1998, Orlando, Florida, USA}, publisher = {IEEE Computer Society}, year = {1998}, pages = {447}, doi = {http://dx.doi.org/10.1109/IPPS.1998.669955} }
Auletta, V., De Vivo, A. & Scarano, V.	Multiple Templates Access of Trees in Parallel Memory Systems [Abstract] [BibTeX]	1998	J. Parallel Distrib. Comput. Vol. 49 (1) , pp. 22-39. Academic Press, Inc..	article	DOI
Abstract: We study the problem of mapping theNnodes of a data structure onMmemory modules so that they can be accessed in parallel bytemplates, i.e., distinct sets of nodes. In literature several algorithms are available for arrays (accessed by rows, columns, diagonals, and subarrays) and trees (accessed by subtrees, root-to-leaf paths, levels, etc.). Although some mapping algorithms for arrays allow conflict-free access to several templates at once (for example rows and columns), no mapping algorithm is known for efficiently accessing subtree, path and level templates in complete binary trees. In our paper, we first prove that any mapping algorithm that is conflict-free for tree/level template has Omega(M/logM) conflicts when access is done according to path template and vice versa. Therefore, no mapping algorithm can be found that is conflict-free on both path and tree (or path and level) templates. Our main result is an algorithm for mapping complete binary trees withN= 2M- 1 nodes on Mmemory modules in such a way that: - the number of conflicts for accessing an-node subtree,adjacent nodes in the same level, orconsecutive nodes of a root-to-leaf path is(), - the load (i.e., the ratio between the maximum and minimum number of data items mapped on each module) is 1 + o(1), - the time complexity for retrieving the module where a given data item is stored is(1), if a preprocessing phase of space and time complexity(log) is executed, or(log log), if no preprocessing is allowed. The algorithm can be easily generalized to complete binary trees of any size.
BibTeX: @article{AulettaDS1998, author = {Vincenzo Auletta and Amelia {De Vivo} and Vittorio Scarano}, title = {{Multiple Templates Access of Trees in Parallel Memory Systems}}, journal = {J. Parallel Distrib. Comput.}, publisher = {Academic Press, Inc.}, year = {1998}, volume = {49}, number = {1}, pages = {22--39}, doi = {http://dx.doi.org/10.1006/jpdc.1998.1426} }
Auletta, V., Negro, A. & Scarano, V.	Efficient Token Clustering On Hypercubes [BibTeX]	1996	Proceedings of the 4th Workshop on Parallel Systems and Algorithms (PASA '96), April 10-12 1996, Jülich, Germany , pp. 211-217. World Scientific Co..	inproceedings
BibTeX: @inproceedings{AulettaNS1996, author = {Vincenzo Auletta and Alberto Negro and Vittorio Scarano}, title = {{Efficient Token Clustering On Hypercubes}}, booktitle = {Proceedings of the 4th Workshop on Parallel Systems and Algorithms (PASA '96), April 10-12 1996, J\"ulich, Germany}, publisher = {World Scientific Co.}, year = {1996}, pages = {211-217} }
Auletta, V., Negro, A. & Scarano, V.	Fast execution of irregularly structured programs with low communication frequency on the hypercube [BibTeX]	1995	Proceedings of 2nd International Workshop on Parallel Algorithms for Irregularly Structured Problems (IRREGULAR '95) September 4–6 1995, Lyon, France , pp. 59-73. Lecture Notes in Computer Science (980). Springer.	inproceedings	DOI
BibTeX: @inproceedings{AulettaNS1995, author = {Vincenzo Auletta and Alberto Negro and Vittorio Scarano}, title = {{Fast execution of irregularly structured programs with low communication frequency on the hypercube}}, booktitle = {Proceedings of 2nd International Workshop on Parallel Algorithms for Irregularly Structured Problems (IRREGULAR '95) September 4–6 1995, Lyon, France}, publisher = {Springer}, year = {1995}, pages = {59-73}, doi = {http://dx.doi.org/10.1007/3-540-60321-2} }
Auletta, V., Negro, A. & Scarano, V.	A Combinatorial Approach to Mapping Problem [BibTeX]	1991	Proceedings of the ISMM International Workshop on Parallel Computing, September 10-13 1991, Trani (Bari), Italy Acta Press.	inproceedings
BibTeX: @inproceedings{AulettaNS1991, author = {Vincenzo Auletta and Alberto Negro and Vittorio Scarano}, title = {{A Combinatorial Approach to Mapping Problem}}, booktitle = {Proceedings of the ISMM International Workshop on Parallel Computing, September 10-13 1991, Trani (Bari), Italy}, publisher = {Acta Press}, year = {1991} }
Auletta, V., Rescigno, A. A. & Scarano, V.	Embedding Graphs onto the Supercube [Abstract] [BibTeX]	1995	IEEE Trans. Comput. Vol. 44 (4) , pp. 593-597. IEEE Computer Society.	article	DOI
Abstract: In this paper we consider the Supercube, a new interconnection network derived from the hypercube. The Supercube, introduced by A. Sen (1989), has the same diameter and connectivity as a Hypercube but can be realized for any number of nodes, not only powers of 2. We study the Supercube's ability to execute parallel programs, using graph-embedding techniques. We show that complete binary trees and bidimensional meshes (with a side length power of 2) are spanning subgraphs of the Supercube. We then prove that the Supercube is Hamiltonian and, when the number of nodes is not a power of 2, it contains all cycles of length greater than 3 as subgraphs
BibTeX: @article{AulettaRS1995, author = {Vincenzo Auletta and Adele Anna Rescigno and Vittorio Scarano}, title = {{Embedding Graphs onto the Supercube}}, journal = {IEEE Trans. Comput.}, publisher = {IEEE Computer Society}, year = {1995}, volume = {44}, number = {4}, pages = {593--597}, doi = {http://dx.doi.org/10.1109/12.376173} }
Auletta, V., Rescigno, A. A. & Scarano, V.	Fault Tolerant Routing in the Supercube [BibTeX]	1993	Parallel Processing Letters Vol. 3 (4) , pp. 393-405.	article
BibTeX: @article{AulettaRS1993, author = {Vincenzo Auletta and Adele Anna Rescigno and Vittorio Scarano}, title = {{Fault Tolerant Routing in the Supercube}}, journal = {Parallel Processing Letters}, year = {1993}, volume = {3}, number = {4}, pages = {393-405} }
Auletta, V., Rescigno, A. A. & Vittorio Scarano, V.	On the Fault Tolerance and Computational Capabilities of the Supercube [BibTeX]	1992	Proceedings of the 4th Italian Conference on Theoretical Computer Science (ICTCS '92), October 28-30 L'Aquila, Italy , pp. 38-52. World Scientific Co..	inproceedings
BibTeX: @inproceedings{AulettaRS1992, author = {Vincenzo Auletta and Adele A. Rescigno and Vittorio Scarano, V.}, title = {{On the Fault Tolerance and Computational Capabilities of the Supercube}}, booktitle = {Proceedings of the 4th Italian Conference on Theoretical Computer Science (ICTCS '92), October 28-30 L'Aquila, Italy}, publisher = {World Scientific Co.}, year = {1992}, pages = {38-52} }
Auletta, V., Vivo, A. D. & Scarano, V.	Multiple Templates Access of Trees in Parallel Memory Systems [BibTeX]	1997	Proceedings of the 11th International Symposium on Parallel Processing (IPPS '97), April 1-5 1997, Geneva, Switzerland , pp. 694-701. IEEE Computer Society.	inproceedings
BibTeX: @inproceedings{AulettaDS1997, author = {Vincenzo Auletta and Amelia De Vivo and Vottorio Scarano}, title = {{Multiple Templates Access of Trees in Parallel Memory Systems}}, booktitle = {Proceedings of the 11th International Symposium on Parallel Processing (IPPS '97), April 1-5 1997, Geneva, Switzerland}, publisher = {IEEE Computer Society}, year = {1997}, pages = {694--701} }
Barra, M., Cattaneo, G., Ferraro Petrillo, U., Garofalo, V., Rossi, C. & Scarano, V.	Teach++: A Cooperative Distance Learning and Teaching Environment [BibTeX]	2000	Proceedings of 2000 ACM Symposium on Applied Computing (SAC 2000), March 19-21 2000, Villa Olmo, Como, Italy , pp. 124-130. ACM Press.	inproceedings
BibTeX: @inproceedings{Barra2000SAC, author = {Maria Barra and Giuseppe Cattaneo and Umberto {Ferraro Petrillo} and Vincenzo Garofalo and Claudia Rossi and Vittorio Scarano}, title = {{Teach++: A Cooperative Distance Learning and Teaching Environment}}, booktitle = {Proceedings of 2000 ACM Symposium on Applied Computing (SAC 2000), March 19-21 2000, Villa Olmo, Como, Italy}, publisher = {ACM Press}, year = {2000}, pages = {124-130} }
Barra, M., Cattaneo, G., Ferraro Petrillo, U. & Scarano, V.	JSEB (Java Scalable sErvices Builder): Scalable Systems for Clusters of Workstations [BibTeX]	2001	Proceedings of the 6th IEEE Symposium on Computers and Communications (ISCC 2001), 3-5 July 2001, Hammamet, Tunisia , pp. 80-85. IEEE Computer Society.	inproceedings	DOI URL
BibTeX: @inproceedings{Barra2001, author = {Maria Barra and Giuseppe Cattaneo and Umberto {Ferraro Petrillo} and Vittorio Scarano}, title = {{JSEB (Java Scalable sErvices Builder): Scalable Systems for Clusters of Workstations}}, booktitle = {Proceedings of the 6th IEEE Symposium on Computers and Communications (ISCC2001),3-5July2001,Hammamet,Tunisia},publisher={IEEEComputerSociety},year={2001},pages={80-85},url={http://csdl2.computer.org/persagen/DLAbsToc.jsp?resourcePath=/dl/proceedings/&toc=comp/proceedings/iscc/2001/1177/00/1177toc.xml&DOI=10.1109/ISCC.2001.935358}, doi = {http://doi.ieeecomputersociety.org/10.1109/ISCC.2001.935358} }
Barra, M., Cattaneo, G., Ferraro Petrillo, U. & Scarano, V.	JSEB (Java Scalable sErvice Builder): A tool for building scalable services [BibTeX]	1999	Atti del 4$^o$ Workshop su Sistemi Distribuiti: Algoritmi, Architetture e Linguaggi (WSDAAL 99), September 13-15 1999, Fonte Cerreto (L'Aquila), Italy	inproceedings
BibTeX: @inproceedings{BarraCFS1999, author = {Maria Barra and Giuseppe Cattaneo and Umberto {Ferraro Petrillo} and Vittorio Scarano}, title = {{JSEB (Java Scalable sErvice Builder): A tool for building scalable services}}, booktitle = {Atti del 4$^o$ Workshop su Sistemi Distribuiti: Algoritmi, Architetture e Linguaggi (WSDAAL 99), September 13-15 1999, Fonte Cerreto (L'Aquila), Italy}, year = {1999} }
Barra, M., Cattaneo, G., Izzo, M., Negro, A. & Scarano, V.	Symmetric Adaptive Customer Modeling for Electronic Commerce in a Distributed Environment [BibTeX]	1998	Proceedings of International IFIP/GI Working Conference Trends in Distributed Systems for Electronic Commerce (TREC '98), June 3 - 5 1998, Hamburg, Germany , pp. 11-25. Lecture Notes in Computer Science (1402). Springer.	inproceedings	DOI
BibTeX: @inproceedings{BarraCINS1998, author = {Maria Barra and Giuseppe Cattaneo and Mario Izzo and Alberto Negro and Vittorio Scarano}, title = {{Symmetric Adaptive Customer Modeling for Electronic Commerce in a Distributed Environment}}, booktitle = {Proceedings of International IFIP/GI Working Conference Trends in Distributed Systems for Electronic Commerce (TREC '98), June 3 - 5 1998, Hamburg, Germany}, publisher = {Springer}, year = {1998}, pages = {11-25}, doi = {http://dx.doi.org/10.1007/BFb0053396} }
Barra, M., Cattaneo, G., Izzo, M., Negro, A. & Scarano, V.	Commercio Elettronico: Adattività, Sicurezza e Privacy [BibTeX]	1998	Atti del Convegno "Caboto '98: Il Commercio Elettronico per le Piccole e Medie Imprese", February 26-27 1998, Venezia, Italy	inproceedings
BibTeX: @inproceedings{BarraCINS1998b, author = {Maria Barra and Giuseppe Cattaneo and Mario Izzo and Alberto Negro and Vittorio Scarano}, title = {{Commercio Elettronico: Adattività, Sicurezza e Privacy}}, booktitle = {Atti del Convegno "Caboto '98: Il Commercio Elettronico per le Piccole e Medie Imprese", February 26-27 1998, Venezia, Italy}, year = {1998} }
Barra, M., Cattaneo, G., Negro, A. & Scarano, V.	Symmetric Adaptive Customer Modeling in an Electronic Store [BibTeX]	1998	Proceedings of the Third IEEE Symposium on Computers & Communications (ISCC '98), June 29 - July 2, 1998, Athens, Greece , pp. 348-352. IEEE Computer Society.	inproceedings	DOI
BibTeX: @inproceedings{BarraCNS1998, author = {Maria Barra and Giuseppe Cattaneo and Alberto Negro and Vittorio Scarano}, title = {{Symmetric Adaptive Customer Modeling in an Electronic Store}}, booktitle = {Proceedings of the Third IEEE Symposium on Computers \& Communications (ISCC '98), June 29 - July 2, 1998, Athens, Greece}, publisher = {IEEE Computer Society}, year = {1998}, pages = {348-352}, doi = {http://dx.doi.org/10.1109/ISCC.1998.702545} }
Barra, M., Cattaneo, G. & Scarano, V.	Architecture Design of a Distributed System for Cooperative and Remote Software Support and Maintenance [BibTeX]	1997	Proceedings of 5th Conference on Re-Technologies for Information Systems, December 4-5 1997, Klagenfurt, Austria	inproceedings
BibTeX: @inproceedings{BarraCS1997, author = {Maria Barra and Giuseppe Cattaneo and Vittorio Scarano}, title = {{Architecture Design of a Distributed System for Cooperative and Remote Software Support and Maintenance}}, booktitle = {Proceedings of 5th Conference on Re-Technologies for Information Systems, December 4-5 1997, Klagenfurt, Austria}, year = {1997} }
Barra, M., Cillo, T., De Santis, A., Ferraro Petrillo, U., Negro, A. & Scarano, V.	Multimodal Monitoring of Web Server [Abstract] [BibTeX]	2002	IEEE MultiMedia Vol. 9 (3) , pp. 32-41.	article	DOI
Abstract: We present a multimodal real-time monitoring system called MMM that describes server activity by multimodal representation and supplements traditional ways of conveying sonification and peripheral information to Webmasters. We also describe a prototype and plug-in that MMM's three-level distributed architecture implements
BibTeX: @article{BarraCDFNS2002, author = {Maria Barra and Tania Cillo and Antonio {De Santis} and Umberto {Ferraro Petrillo} and Alberto Negro and Vittorio Scarano}, title = {{Multimodal Monitoring of Web Server}}, journal = {IEEE MultiMedia}, year = {2002}, volume = {9}, number = {3}, pages = {32-41}, doi = {http://dx.doi.org/10.1109/MMUL.2002.1022857} }
Barra, M., Cillo, T., De Santis, A., Ferraro Petrillo, U., Negro, A., Scarano, V., Matlock, T. & Maglio, P. P.	Personal WebMelody: Customized Sonification of Web Servers [BibTeX]	2001	Proceedings of the 7th International Conference on Auditory Display (ICAD), 2001 July 29th - August 1, Helsinki (Finland) Elsevier Science.	inproceedings	URL
BibTeX: @inproceedings{Barra2001ICAD, author = {Maria Barra and Tania Cillo and Antonio {De Santis} and Umberto {Ferraro Petrillo} and Alberto Negro and Vittorio Scarano and Teenie Matlock and Paul P. Maglio}, title = {{Personal WebMelody: Customized Sonification of Web Servers}}, booktitle = {Proceedings of the 7th International Conference on Auditory Display (ICAD), 2001 July 29th - August 1, Helsinki (Finland)}, publisher = {Elsevier Science}, year = {2001}, url = {http://www.acoustics.hut.fi/icad2001/proceedings/papers/barra.pdf} }
Barra, M., Cillo, T., De Santis, A., Ferraro Petrillo, U., Negro, A., Scarano, V., Matlock, T. & Maglio, P. P.	Personal WebMelody: Customized Sonification of Web Servers [BibTeX]	2001	Poster Proceedings 10th Int. World Wide Web Conference (WWW10), May 1-5 2001, Hong Kong. Elsevier Science.	inproceedings	URL
BibTeX: @inproceedings{Barra2001WWW10, author = {Maria Barra and Tania Cillo and Antonio {De Santis} and Umberto {Ferraro Petrillo} and Alberto Negro and Vittorio Scarano and Teenie Matlock and Paul P. Maglio}, title = {{Personal WebMelody: Customized Sonification of Web Servers}}, booktitle = {Poster Proceedings 10th Int. World Wide Web Conference (WWW10), May 1-5 2001, Hong Kong.}, publisher = {Elsevier Science}, year = {2001}, url = {http://www10.org/cdrom/posters/1060.pdf} }
Barra, M., Cillo, T., De Santis, A., Ferraro, U., Negro, A. & Scarano, V.	WebMelody: Sonification of Web Servers [BibTeX]	2000	Poster Proceedings of 9th International World Wide Web Conference (WWW9), May 15-19 2000, Amsterdam, Holland Elsevier Science.	inproceedings
BibTeX: @inproceedings{Barra2000WWW9, author = {Maria Barra and Tania Cillo and Antonio {De Santis} and Umberto Ferraro and Alberto Negro and Vittorio Scarano}, title = {{WebMelody: Sonification of Web Servers}}, booktitle = {Poster Proceedings of 9th International World Wide Web Conference (WWW9), May 15-19 2000, Amsterdam, Holland}, publisher = {Elsevier Science}, year = {2000} }
Barra, M., Cillo, T., Ferraro Petrillo, U., De Santis, A., Negro, A. & Scarano, V.	WebMelody: Sonification of Web Servers [BibTeX]	2000	Atti del 5$^o$ Workshop su Sistemi Distribuiti: Algoritmi, Architetture e Linguaggi (WSDAAL 00), September 18-20 2000, Ischia (Napoli), Italy	inproceedings
BibTeX: @inproceedings{BarraCFDNS2000, author = {Maria Barra and Tania Cillo and Umberto {Ferraro Petrillo} and Antonio {De Santis} and Alberto Negro and Vittorio Scarano}, title = {{WebMelody: Sonification of Web Servers}}, booktitle = {Atti del 5$^o$ Workshop su Sistemi Distribuiti: Algoritmi, Architetture e Linguaggi (WSDAAL 00), September 18-20 2000, Ischia (Napoli), Italy}, year = {2000} }
Barra, M., Ferrandino, S. & Scarano, V.	WebSlide: A "Virtual" Slide Projector on World Wide Web [Abstract] [BibTeX]	1999	International Journal of Science Education and Technology Vol. 8 (1) , pp. 45-53.	article	DOI
Abstract: We present here the design key concepts of WEBSLIDE, a software project whose objective is to provide a simple, cheap and efficient solution for showing slides during lessons in computer labs. In fact, WEBSLIDE allows the video monitors of several client machines (the "STUDENTS") to be synchronously updated by the actions of a particular client machine, called the "INSTRUCTOR." The system is based on the World Wide Web and the software components of WEBSLIDE mainly consists in a WWW server, browsers and small Cgi-Bill scripts. What makes WEBSLIDE particularly appealing for small educational institutions is that WEBSLIDE is built with "off the shelf" products: it does not involve using a specifically designed program but any Netscape browser, one of the most popular browsers available on the market, is sufficient. Another possible use is to use our system to implement "guided automatic tours" through several pages or Intranets internal news bulletins: the company Web server can broadcast to all employees relevant information on their browser
BibTeX: @article{BarraFS1999, author = {Maria Barra and Salvatore Ferrandino and Vittorio Scarano}, title = {{WebSlide: A "Virtual" Slide Projector on World Wide Web}}, journal = {International Journal of Science Education and Technology}, year = {1999}, volume = {8}, number = {1}, pages = {45-53}, doi = {http://dx.doi.org/10.1023/A:1009477420811} }
Barra, M., Ferrandino, S. & Scarano, V.	WebSlide: A Slide Projector on World Wide Web [BibTeX]	1998	Proceedings of the 14th International Conference on Advanced Science and Technology (ICAST '98), Apr. 3-5 1998, Naperville, Illinois, USA	inproceedings
BibTeX: @inproceedings{BarraFS1998, author = {Maria Barra and Salvatore Ferrandino and Vittorio Scarano}, title = {{WebSlide: A Slide Projector on World Wide Web}}, booktitle = {Proceedings of the 14th International Conference on Advanced Science and Technology (ICAST '98), Apr. 3-5 1998, Naperville, Illinois, USA}, year = {1998} }
Barra, M., Grieco, R., Malandrino, D., Negro, A. & Scarano, V.	TextToSpeech: a Heavy-weight Edge Service [BibTeX]	2003	Poster Proceedings of The 12th International World Wide Web Conference, May 20-24 2003, Budapest, Hungary , pp. 20-24. Elsevier Science.	inproceedings	URL
BibTeX: @inproceedings{BarraGMNS2003, author = {Maria Barra and Raffaella Grieco and Delfina Malandrino and Alberto Negro and Vittorio Scarano}, title = {{TextToSpeech: a Heavy-weight Edge Service}}, booktitle = {Poster Proceedings of The 12th International World Wide Web Conference, May 20-24 2003, Budapest, Hungary}, publisher = {Elsevier Science}, year = {2003}, pages = {20--24}, url = {http://www2003.org/cdrom/papers/poster/p161/p161-Scarano.html} }
Barra, M., Iannaccone, A., Palmieri, G. & Scarano, V.	Test++: an Adaptive Training System on the Internet [BibTeX]	2002	Proceedings of the Seventh IEEE Symposium on Computers and Communications (ISCC 2002), 1-4 July 2002, Taormina, Italy , pp. 225-230. IEEE Computer Society.	inproceedings	DOI
BibTeX: @inproceedings{Barra2002ISCC, author = {Maria Barra and Antonio Iannaccone and Giuseppina Palmieri and Vittorio Scarano}, title = {{Test++: an Adaptive Training System on the Internet}}, booktitle = {Proceedings of the Seventh IEEE Symposium on Computers and Communications (ISCC 2002), 1-4 July 2002, Taormina, Italy}, publisher = {IEEE Computer Society}, year = {2002}, pages = {225-230}, doi = {http://doi.ieeecomputersociety.org/10.1109/ISCC.2002.1021683} }
Barra, M., Maglio, P. P., Negro, A. & Scarano, V.	GAS: Group Adaptive System [Abstract] [BibTeX]	2002	Proceedings of the Second International Conference on Adaptive Hypermedia and Adaptive Web-Based Systems (AH 2002), May 29-31, 2002, Malaga, Spain , pp. 47-57. Lecture Notes in Computer Science (2347). Springer.	inproceedings	URL
Abstract: This paper describes an ongoing research project to design a Group Adaptive System (GAS) for collaborative navigation on the web. Our objective is to provide information that adapts to web users based on automatically determined, dynamic user groups. To do this, our approach takes into account the structure of the web (using the CLEVER algorithm [16]) and user interactions when navigating the web (gathered by our collaborative environment) to offer users in a consistent information space determined by their interests and activities. In the end, our system, GAS, enables users to perform asynchronous collaborative navigation by combining resources discovered by a group of users and suggestions discovered by the CLEVER algorithm to provide recommendations to the group.
BibTeX: @inproceedings{Barra2002AH, author = {Maria Barra and Paul P. Maglio and Alberto Negro and Vittorio Scarano}, title = {{GAS: Group Adaptive System}}, booktitle = {Proceedings of the Second International Conference on Adaptive Hypermedia and Adaptive Web-Based Systems (AH 2002), May 29-31, 2002, Malaga, Spain}, publisher = {Springer}, year = {2002}, pages = {47-57}, url = {http://link.springer.de/link/service/series/0558/bibs/2347/23470047.htm} }
Barra, M., Malandrino, D. & Scarano, V.	"Common" Web Paths in a Group Adaptive System [Abstract] [BibTeX]	2003	Proceedings of the 14th ACM Conference on Hypertext and Hypermedia (Hypertext 2003), August 26-30, 2003, Nottingham, UK , pp. 218-219. ACM.	inproceedings	DOI
Abstract: In this paper we describe how we use a group of users' accesses and interactions with web pages to discover and recommend relevant common navigation paths to other users. We collect data using a social navigation environment called GAS (Group Adaptive System) that we developed and are currently integrating the common path navigation tool into the system. The goal is to use the common path of a subset of users in the system as a recommendation for other users.
BibTeX: @inproceedings{BarraMS2003, author = {Maria Barra and Delfina Malandrino and Vittorio Scarano}, title = {{"Common" Web Paths in a Group Adaptive System}}, booktitle = {Proceedings of the 14th ACM Conference on Hypertext and Hypermedia (Hypertext 2003), August 26-30, 2003, Nottingham, UK}, publisher = {ACM}, year = {2003}, pages = {218-219}, doi = {http://doi.acm.org/10.1145/900051.900099} }
Barra, M., Negro, A. & Scarano, V.	When the teacher learns: A Model for Symmetric Adaptivity [BibTeX]	1999	Proceedings of the 2nd Workshop on Adaptive Systems and User Modeling on the World Wide Web, Satellite Workshop of 8th International World Wide Web Conference (WWW8), May 11-14, 1999, Toronto, Canada , pp. 21-28.	inproceedings	URL
BibTeX: @inproceedings{Barra1999, author = {Maria Barra and Alberto Negro and Vittorio Scarano}, title = {{When the teacher learns: A Model for Symmetric Adaptivity}}, booktitle = {Proceedings of the 2nd Workshop on Adaptive Systems and User Modeling on the World Wide Web, Satellite Workshop of 8th International World Wide Web Conference (WWW8), May 11-14, 1999, Toronto, Canada}, year = {1999}, pages = {21-28}, url = {http://wwwis.win.tue.nl/asum99/barra/barra.html} }
Barra, M., Palmieri, G., Napolitano, S., Scarano, V. & Zitarosa, L.	Adaptive Testing by Test++ [BibTeX]	2000	Proceedings of the International Conference on Adaptive Hypermedia and Adaptive Web-Based Systems (AH '00), August 28-30, 2000, Trento, Italy , pp. 264-267. Lecture Notes in Computer Science (1892). Springer-Verlag.	inproceedings	DOI URL
BibTeX: @inproceedings{Barra2000AH, author = {Maria Barra and Giuseppina Palmieri and Simona Napolitano and Vittorio Scarano and Luca Zitarosa}, title = {{Adaptive Testing by Test++}}, booktitle = {Proceedings of the International Conference on Adaptive Hypermedia and Adaptive Web-Based Systems (AH '00), August 28-30, 2000, Trento, Italy}, publisher = {Springer-Verlag}, year = {2000}, pages = {264--267}, url = {http://www.springerlink.com/content/fact6r490dvmjnmg/}, doi = {http://dx.doi.org/10.1007/3-540-44595-1_25} }
Belgiorno, F., De Chiara, R., Manno, I., Overdijk, M., Scarano, V. & van Diggelen, W.	Face to face cooperation with CoFFEE [Abstract] [BibTeX]	2008	Proceedings of 3rd European Conference on Technology-Enhanced Learning (ECTEL 08), September 16-19 2008, Maastricht, The Netherlands , pp. 49-57. Lecture Notes in Computer Science (5192). Springer-Verlag.	inproceedings	DOI
Abstract: Co-located collaboration in classroom is the topic we tackle in this paper. In particular we will describe how CoFFEE implements this kind of collaboration. CoFFEE is an extensible platform on which to implement different collaborative tools. Every tool renders a different kind cooperation between users. In this paper we will also provide further details in about the newly implemented tools for collaboration, the Repository, the Positionometer and the Co-Writer.
BibTeX: @inproceedings{BelgiornoDMS2008b, author = {Furio Belgiorno and Rosario {De Chiara} and Ilaria Manno and Maarten Overdijk and Vittorio Scarano and Wouter {van Diggelen}}, title = {{Face to face cooperation with CoFFEE}}, booktitle = {Proceedings of 3rd European Conference on Technology-Enhanced Learning (ECTEL 08), September 16-19 2008, Maastricht, The Netherlands}, publisher = {Springer-Verlag}, year = {2008}, pages = {49-57}, doi = {http://dx.doi.org/10.1007/978-3-540-87605-2_6} }
Belgiorno, F., De Chiara, R., Manno, I. & Scarano, V.	A Flexible and Tailorable Architecture for Scripts in F2F Collaboration [Abstract] [BibTeX]	2008	Proceedings of 3rd European Conference on Technology-Enhanced Learning (ECTEL 08), September 16-19 2008, Maastricht, The Netherlands , pp. 401-412. Lecture Notes in Computer Science (5192). Springer-Verlag.	inproceedings	DOI
Abstract: In this paper we introduce the architecture of the script engine of a collaborative co-located discussion support system, named CoFFEE, and, in particular, we describe its extendibility and flexibility as a macro-script engine for CSCL activities (see Dillenbourg et al. 2007).
BibTeX: @inproceedings{BelgiornoDMS2008, author = {Furio Belgiorno and Rosario {De Chiara} and Ilaria Manno and Vittorio Scarano}, title = {{A Flexible and Tailorable Architecture for Scripts in F2F Collaboration}}, booktitle = {Proceedings of 3rd European Conference on Technology-Enhanced Learning (ECTEL 08), September 16-19 2008, Maastricht, The Netherlands}, publisher = {Springer-Verlag}, year = {2008}, pages = {401-412}, doi = {http://dx.doi.org/10.1007/978-3-540-87605-2_45} }
Calabrese, G., Capobianco, R., Izzo, M. & Scarano, V.	Un Agente intelligente e dinamico a supporto delle transazioni di acquisto [BibTeX]	1998	Atti del Convegno Annuale AICA 1998, November 18-20 1998, Napoli, Italy	inproceedings
BibTeX: @inproceedings{CCIS1998, author = {Giuseppe Calabrese and Roberto Capobianco and Mario Izzo and Vittorio Scarano}, title = {{Un Agente intelligente e dinamico a supporto delle transazioni di acquisto}}, booktitle = {Atti del Convegno Annuale AICA 1998, November 18-20 1998, Napoli, Italy}, year = {1998} }
Calabrò, M., Malandrino, D. & Scarano, V.	Group Recording of Web Navigation [BibTeX]	2003	Poster Proceedings of the 14th ACM Conference on Hypertext and Hypermedia, August 26-30, 2003, Nottingham, UK , pp. 26-30.	inproceedings
BibTeX: @inproceedings{CalabroMS2003, author = {Mariagrazia Calabrò and Delfina Malandrino and Vittorio Scarano}, title = {{Group Recording of Web Navigation}}, booktitle = {Poster Proceedings of the 14th ACM Conference on Hypertext and Hypermedia, August 26-30, 2003, Nottingham, UK}, year = {2003}, pages = {26--30} }
Cattaneo, G., Petrillo, U. F., Italiano, G. F. & Scarano, V.	Concurrent Algorithms and Data Types Animation over the Internet [BibTeX]	1998	Proceedings of 15th IFIP World Computer Congress on Fundamentals - Foundations of Computer Science, August 31 - September 4 1998, Wien, Austria , pp. 63-80. Österreichischen Computer Gesellschaft.	inproceedings
BibTeX: @inproceedings{CattaneoFOS1998, author = {Giuseppe Cattaneo and Umberto Ferraro Petrillo and Giuseppe F. Italiano and Vittorio Scarano}, title = {{Concurrent Algorithms and Data Types Animation over the Internet}}, booktitle = {Proceedings of 15th IFIP World Computer Congress on Fundamentals - Foundations of Computer Science, August 31 - September 4 1998, Wien, Austria}, publisher = {\"{O}sterreichischen Computer Gesellschaft}, year = {1998}, pages = {63--80} }
Chiola, G., Cordasco, G., Gargano, L., Negro, A. & Scarano, V.	Degree-Optimal Routing for P2P Systems [Abstract] [BibTeX]	2009	Theory of Computing Systems (accepted for publication, inprint; available online since October 25, 2007)	article	DOI
Abstract: We define a family of Distributed Hash Table systems whose aim is to combine the routing efficiency of randomized networks—e.g. optimal average path length O(log2 n/delta log with delta degree—with the programmability and startup efficiency of a uniform overlay—that is, a deterministic system in which the overlay network is transitive and greedy routing is optimal. It is known that log n) is a lower bound on the average path length for uniform overlays with O(log n) degree (Xu et al., IEEE J. Sel. Areas Commun. 22(1), 151–163, 2004). Our work is inspired by neighbor-of-neighbor (NoN) routing, a recently introduced variation of greedy routing that allows us to achieve optimal average path length in randomized networks. The advantage of our proposal is that of allowing the NoN technique to be implemented without adding any overhead to the corresponding deterministic network. We propose a family of networks parameterized with a positive integer c which measures the amount of randomness that is used. By varying the value c, the system goes from the deterministic case (c = 1) to an “almost uniform” system. Increasing c to relatively low values allows for routing with asymptotically optimal average path length while retaining most of the advantages of a uniform system, such as easy programmability and quick bootstrap of the nodes entering the system. We also provide a matching lower bound for the average path length of the routing schemes for any c.
BibTeX: @article{ChiolaCGNS08a, author = {Giovanni Chiola and Gennaro Cordasco and Luisa Gargano and Alberto Negro and Vittorio Scarano}, title = {{Degree-Optimal Routing for P2P Systems}}, journal = {Theory of Computing Systems}, year = {2009}, note = {(accepted for publication, inprint; available online since October 25, 2007)}, doi = {http://dx.doi.org/10.1007/s00224-007-9074-x} }
Chiola, G., Cordasco, G., Gargano, L., Negro, A. & Scarano, V.	Optimizing the finger tables in Chord-like DHTs [Abstract] [BibTeX]	2008	Concurrency and Computation: Practice and Experience Vol. 20 (6) , pp. 643-657.	article	DOI
Abstract: The Chord protocol is the best known example of implementation of logarithmic complexity routing for structured peer-to-peer networks. Its routing algorithm, however, does not provide an optimal trade-off between resources exploited (the size of the finger table) and performance (the average or worst-case number of hops to reach destination). Cordasco et al. showed that a finger table based on Fibonacci distances provides lower number of hops with fewer table entries. In this paper we generalize this result, showing how to construct an improved finger table when the objective is to reduce the number of hops, possibly at the expense of an increased size of the finger table. Our results can also be exploited to guarantee low routing time in case a fraction of nodes fails. Copyright
BibTeX: @article{ChiolaCGNS08b, author = {Giovanni Chiola and Gennaro Cordasco and Luisa Gargano and Alberto Negro and Vittorio Scarano}, title = {{Optimizing the finger tables in Chord-like DHTs}}, journal = {Concurrency and Computation: Practice and Experience}, year = {2008}, volume = {20}, number = {6}, pages = {643-657}, doi = {http://dx.doi.org/10.1002/cpe.1243} }
Chiola, G., Cordasco, G., Gargano, L., Negro, A. & Scarano, V.	Optimizing the finger table in chord-like DHTs [Abstract] [BibTeX]	2006	Proceedings of 20th International Parallel and Distributed Processing Symposium (IPDPS 2006), April 25-29 2006, Rhodes Island, Greece IEEE.	inproceedings	DOI
Abstract: The chord protocol is the best known example of implementation of logarithmic complexity routing for structured peer-to-peer networks. Its routing algorithm, however, does not provide an optimal trade-off between resources exploited (the size of the "finger table") and performance (the average or worst-case number of hops to reach destination). Cordasco et al. showed that a finger table based on Fibonacci distances provides lower number of hops with fewer table entries. In this paper, we generalize this result, showing how to construct an improved finger table when the objective is to reduce the number of hops, possibly at the expense of an increased size of the finger table. Our results can also be exploited to guarantee low routing time in case a fraction of nodes is assumed to fail.
BibTeX: @inproceedings{ChiolaCGNS2006, author = {Giovanni Chiola and Gennaro Cordasco and Luisa Gargano and Alberto Negro and Vittorio Scarano}, title = {{Optimizing the finger table in chord-like DHTs}}, booktitle = {Proceedings of 20th International Parallel and Distributed Processing Symposium (IPDPS 2006), April 25-29 2006, Rhodes Island, Greece}, publisher = {IEEE}, year = {2006}, doi = {http://dx.doi.org/10.1109/IPDPS.2006.1639707} }
Chiola, G., Cordasco, G., Gargano, L., Negro, A. & Scarano, V.	Overlay Networks with Class [Abstract] [BibTeX]	2005	Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks (ISPAN '05) , pp. 241-247. IEEE Computer Society.	inproceedings	DOI
Abstract: We define a family of distributed hash table systems whose aim is to combine routing efficiency of the randomized networks - i.e. average path length O(log n/log log n) vs. the O(log n) average path length of the deterministic system - with the programmability and startup efficiency of a uniform system - that is a system in which the overlay network is transitive, and greedy routing is optimal. It is known that /spl Omega/(logn) is a lower bound to the average path length for uniform systems with O(log n) degree. The proposed family is parameterized with a positive integer c which measures the amount of randomness that is used. Indeed, edges are partitioned into c equivalence classes. Varying the value c, the system goes from the deterministic case (c=1) to an "almost uniform" system. Increasing c to relatively low values allows routing with optimal average path length while retaining most of the advantages of a uniform system, such as easy programmability and quick bootstrap of the nodes entering the system. We also provide a matching lower bound for the average path length of the family of routing schemes for any c. Moreover, we show how to extend the result to other overlay networks.
BibTeX: @inproceedings{ChiolaCGNS2005, author = {G. Chiola and G. Cordasco and L. Gargano and A. Negro and V. Scarano}, title = {{Overlay Networks with Class}}, booktitle = {Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks (ISPAN '05)}, publisher = {IEEE Computer Society}, year = {2005}, pages = {241--247}, doi = {http://dx.doi.org/10.1109/ISPAN.2005.66} }
Colajanni, M., Grieco, R., Malandrino, D., Mazzoni, F. & Scarano, V.	A Scalable Framework for the Support of Advanced Edge Services [Abstract] [BibTeX]	2005	Proceedings of First International Conference on High Performance Computing and Communications (HPCC 2005), September 21-23, 2005, Sorrento, Italy , pp. 1033-1042. Lecture Notes in Computer Science (3726). Springer.	inproceedings	DOI
Abstract: The Ubiquitous Web requires novel programming paradigms and distributed architectures for the support of advanced services to a multitude of user devices and profiles. In this paper we describe a Scalable Intermediary Software Infrastructure (SISI) that aims at efficiently providing content adaptation and combinations of other complex functionalities at edge servers on the WWW. SISI adopts different user profiles to achieve automatic adaptation of the content according to the capabilities of the target devices and users. We demonstrate SISI efficiency by comparing its performance against another framework for content adaptation at edge servers.
BibTeX: @inproceedings{ColajanniGMMS2005, author = {Michele Colajanni and Raffaella Grieco and Delfina Malandrino and Francesca Mazzoni and Vittorio Scarano}, title = {{A Scalable Framework for the Support of Advanced Edge Services}}, booktitle = {Proceedings of First International Conference on High Performance Computing and Communications (HPCC 2005), September 21-23, 2005, Sorrento, Italy}, publisher = {Springer}, year = {2005}, pages = {1033-1042}, doi = {http://dx.doi.org/10.1007/11557654_114} }
Colajanni, M., Grieco, R., Malandrino, D., Mazzoni, F. & Scarano., V.	A Scalable Framework for the Support of Advanced Edge Services [Abstract] [BibTeX]	2005	Proceedings of 2005 International Conference on High Performance Computing and Communications (HPCC'05), September 21-23, 2005, Sorrento, Italy Lecture Notes in Computer Science (3726). Springer.	inproceedings	DOI
Abstract: The Ubiquitous Web requires novel programming paradigms and distributed architectures for the support of advanced services to a multitude of user devices and profiles. In this paper we describe a Scalable Intermediary Software Infrastructure (SISI) that aims at efficiently providing content adaptation and combinations of other complex functionalities at edge servers on the WWW. SISI adopts different user profiles to achieve automatic adaptation of the content according to the capabilities of the target devices and users. We demonstrate SISI efficiency by comparing its performance against another framework for content adaptation at edge servers.
BibTeX: @inproceedings{ColajanniGMMS05, author = {Michele Colajanni and Raffaella Grieco and Delfina Malandrino and Francesca Mazzoni and Vittorio Scarano.}, title = {{A Scalable Framework for the Support of Advanced Edge Services}}, booktitle = {Proceedings of 2005 International Conference on High Performance Computing and Communications (HPCC'05), September 21-23, 2005, Sorrento, Italy}, publisher = {Springer}, year = {2005}, doi = {http://dx.doi.org/10.1007/11557654} }
Cordasco, G., Gargano, L., Hammar, M., Negro, A. & Scarano, V.	F-Chord: Improved Uniform Routing on Chord [Abstract] [BibTeX]	2008	Networks Vol. 52 (4) , pp. 325-332.	article	DOI
Abstract: We propose a family of novel Chord-based P2P schemes retaining all positive aspects that made Chord a popular topology for routing in P2P networks. The schemes, based on the Fibonacci number system, allow to simultaneously improve on the maximum-average number of hops for lookups and the routing table size per node
BibTeX: @article{CordascoGHNS08, author = {Gennaro Cordasco and Luisa Gargano and Mikael Hammar and Alberto Negro and Vittorio Scarano}, title = {{F-Chord: Improved Uniform Routing on Chord}}, journal = {Networks}, year = {2008}, volume = {52}, number = {4}, pages = {325-332}, doi = {http://dx.doi.org/10.1002/net.v52:4} }
Cordasco, G., Gargano, L., Hammar, M., Negro, A. & Scarano, V.	F-Chord: Improved Uniform Routing on Chord [Abstract] [BibTeX]	2004	Proceedings of the 11th Colloquium on Structural Information and Communication Complexity (SIROCCO 2004), June 21-23 2004, Smolenice Castle, Slovakia , pp. 89-98. Lecture Notes in Computer Science (3104). Springer.	inproceedings	DOI
Abstract: We propose a family of novel schemes based on Chord retaining all positive aspects that made Chord a popular topology for routing in P2P networks. The schemes, based on the Fibonacci number system, allow to improve on the maximum/average number of hops for lookups and the routing table size per node.
BibTeX: @inproceedings{CordascoGHNS04a, author = {Gennaro Cordasco and Luisa Gargano and Mikael Hammar and Alberto Negro and Vittorio Scarano}, title = {{F-Chord: Improved Uniform Routing on Chord}}, booktitle = {Proceedings of the 11th Colloquium on Structural Information and Communication Complexity (SIROCCO 2004), June 21-23 2004, Smolenice Castle, Slovakia}, publisher = {Springer}, year = {2004}, pages = {89--98}, doi = {http://dx.doi.org/10.1007/b98251} }
Cordasco, G., Gargano, L., Hammar, M., Negro, A. & Scarano, V.	Non-uniform deterministic routing on F-Chord($) [Abstract] [BibTeX]	2004	Proceedings of First International Workshop on Hot Topics in Peer-to-Peer Systems, October 8 2004, Volendam, The Nederlands , pp. 16-21. IEEE Computer Society.	inproceedings	DOI
Abstract: In this paper, we present a family of novel P2P routing schemes based on Chord [26] (and its variation FChord( [2]) that trades off uniformity with efficiency without using any additional overhead. We prove that H-FChord(’s routing is more efficient than in F-Chord( in terms of its average path length that is O(log n/ log log n). We also show, by simulations, that H-F-Chord( is more efficient than the corresponding F-Chord( by a percentage that goes from 15% to 22% even for small n.
BibTeX: @inproceedings{CordascoGHNS04b, author = {Gennaro Cordasco and Luisa Gargano and Mikael Hammar and Alberto Negro and Vittorio Scarano}, title = {{Non-uniform deterministic routing on F-Chord($\alpha$)}}, booktitle = {Proceedings of First International Workshop on Hot Topics in Peer-to-Peer Systems, October 8 2004, Volendam, The Nederlands}, publisher = {IEEE Computer Society}, year = {2004}, pages = {16--21}, doi = {http://dx.doi.org/10.1109/PTPSYS.2004.13} }
Cordasco, G., Gargano, L., Hammar, M. & Scarano, V.	Degree-Optimal Deterministic Routing for P2P Systems [Abstract] [BibTeX]	2005	Proceedings of the 10th IEEE Symposium on Computers and Communications (ISCC 2005), June 27-30 2005, Murcia, Cartagena, Spain , pp. 158-163.	inproceedings	DOI
Abstract: We propose routing schemes that optimize the average number of hops for lookup requests in Peer-to-Peer (P2P) systems without adding any overhead to the system. Our work is inspired by the recently introduced variation of greedy routing, called neighbor-of-neighbor (NoN), which allows to get optimal average path length with respect to the degree. Our proposal has the advantage of first "limiting" and then "eliminating" the use of randomization. As a consequence, the NoN technique can be implemented with our schemes without adding any overhead. Analyzed networks include several popular topologies: Chord, Hypercube based networks, Symphony, Skip-Graphs. Theoretical results and extensive simulations show that the proposed simplifications (while maintaining the original node degree) do not increase the average path length of the networks, which is often improved in practice. The improvement is obtained with no harm to the operational efficiency (e.g. stability, ease of programming, scalability, fault-tolerance) of the considered systems.
BibTeX: @inproceedings{CordascoGHS2005, author = {Gennaro Cordasco and Luisa Gargano and Mikael Hammar and Vittorio Scarano}, title = {{Degree-Optimal Deterministic Routing for P2P Systems}}, booktitle = {Proceedings of the 10th IEEE Symposium on Computers and Communications (ISCC 2005), June 27-30 2005, Murcia, Cartagena, Spain}, year = {2005}, pages = {158-163}, doi = {http://doi.ieeecomputersociety.org/10.1109/ISCC.2005.45} }
Cordasco, G., Gargano, L., Hammar, M. & Scarano, V.	Brief Announcement: Degree-Optimal Deterministic Routing for P2P Systems [BibTeX]	2004	Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, July 25-28 2004, St. John's, Newfoundland, Canada , pp. 395-395. ACM.	inproceedings	DOI
BibTeX: @inproceedings{CordascoGHS04, author = {Gennaro Cordasco and Luisa Gargano and Mikael Hammar and Vittorio Scarano}, title = {{Brief Announcement: Degree-Optimal Deterministic Routing for P2P Systems}}, booktitle = {Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, July 25-28 2004, St. John's, Newfoundland, Canada}, publisher = {ACM}, year = {2004}, pages = {395--395}, doi = {http://doi.acm.org/10.1145/1011767.1011859} }
Cordasco, G., Negro, A., Sala, A. & Scarano, V.	PON: Exploiting Proximity on Overlay Networks [Abstract] [BibTeX]	2007	Proceedings of 21st International Parallel and Distributed Processing Symposium (IPDPS 2007), March 26--30, Long Beach, California, USA , pp. 1-7. IEEE.	inproceedings	DOI
Abstract: We define a proximity overlay network (PON) which allow to realize DHT systems whose aim is to combine routing efficiency - i.e. an optimal degree/diameter tradeoff - and proximity awareness. The proposed systems is parameterized with a positive integer s which measures the amount of flexibility offered by the network. Varying the value of s the system goes from a quite rigid network (s=2) which offer an optimal degree/diameter tradeoff. Increasing s to relatively low values allows to increase the flexibility of the network and consequently improves the stretch, that is, the ratio between the latency of two nodes on the overlay network and the unicast latency between those nodes. We are able to reconcile the conflict between the load balancing and proximity relationship by proving the efficiency of the main performance metrics. In particular we analytically prove that our system can result in lookup latencies proportional to the maximum latency of the underlying physical network, provided that the physical network has a power law latency expansion.
BibTeX: @inproceedings{CordascoNSS2007, author = {Cordasco, G. and Negro, A. and Sala, A. and Scarano, V.}, title = {{PON: Exploiting Proximity on Overlay Networks}}, booktitle = {Proceedings of 21st International Parallel and Distributed Processing Symposium (IPDPS 2007), March 26--30, Long Beach, California, USA}, publisher = {IEEE}, year = {2007}, pages = {1--7}, doi = {http://dx.doi.org/10.1109/IPDPS.2007.370659} }
Cordasco, G., Negro, A., Scarano, V. & Rosenberg, A. L.	c-Perfect Hashing Schemes for Binary Trees, with Applications to Parallel Memories [Abstract] [BibTeX]	2003	Proceedings of Euro-Par 2003 Parallel Processing, August 26 - 29 2003, Klagenfurt, Austria , pp. 911-916. Lecture Notes in Computer Science (2790). Springer.	inproceedings	DOI
Abstract: We study the problem of mapping array-structured data to an ensemble of parallel memory modules, by allowing at most c conflicts (i.e. simultaneous access by up to c processors to the same memory module). We seek the smallest ensemble that will allow us to store any n-vertex instance of three array-like data structures with no more than c array-vertices stored on the same module. For the most general family, chaotic arrays, we prove that n^2/c^2) memory modules are needed to achieve this bound on conflicts. Similarly tight bounds are found for the other two families, ragged and rectangular arrays.
BibTeX: @inproceedings{CordascoNSR03, author = {Gennaro Cordasco and Alberto Negro and Vittorio Scarano and Arnold L. Rosenberg}, title = {{c-Perfect Hashing Schemes for Binary Trees, with Applications to Parallel Memories}}, booktitle = {Proceedings of Euro-Par 2003 Parallel Processing, August 26 - 29 2003, Klagenfurt, Austria}, publisher = {Springer}, year = {2003}, pages = {911--916}, doi = {http://dx.doi.org/10.1007/b12024} }
Cordasco, G., Negro, A., Scarano, V. & Rosenberg, A. L.	c-Perfect Hashing Schemes for Arrays, with Applications to Parallel Memories [Abstract] [BibTeX]	2003	Proceedings of 5th Workshop on Distributed Data & Structures (WDAS '03), June 13-14 2003, Thessaloniki, Greece , pp. 61-72.	inproceedings
Abstract: We study the problem of mapping tree-structured data to an ensemble of parallel memory modules.We are given a “conflict tolerance” c, and we seek the smallest ensemble that will allow us to store any n-vertex rooted binary tree with no more than c tree-vertices stored on the same module. Our attack on this problem abstracts it to a search for the smallest c-perfect universal graph for complete binary trees. We construct such a graph which witnesses that only O(c^(1-1/c) 2^(n+1)/(c+1)) memory modules are needed to obtain the required bound on conflicts, and we prove that 2^(n+1)/(c+1)) memory modules are necessary. These bounds are tight to within constant factors when c is fixed—as it is with the motivating application.
BibTeX: @inproceedings{CordascoNSR03b, author = {Gennaro Cordasco and Alberto Negro and Vittorio Scarano and Arnold L. Rosenberg}, title = {{c-Perfect Hashing Schemes for Arrays, with Applications to Parallel Memories}}, booktitle = {Proceedings of 5th Workshop on Distributed Data \& Structures (WDAS '03), June 13-14 2003, Thessaloniki, Greece}, year = {2003}, pages = {61--72} }
Cordasco, G., Scarano, V. & Rosenberg, A. L.	Bounded-Collision Memory-Mapping Schemes for Data Structures with Applications to Parallel Memories [Abstract] [BibTeX]	2007	IEEE Trans. Parallel Distrib. Syst. Vol. 18 (7) , pp. 973-982. IEEE Press.	article	DOI
Abstract: Techniques are developed for mapping structured data to an ensemble of parallel memory modules in a way that limits the number of conflicts, i.e., simultaneous accesses by distinct processors to the same memory module. The techniques determine, for any given conflict tolerancec, the smallest ensemble that allows one to store anynhbox-rm node data structure "of type X?ý in such a way that no more than c nodes of a structure are stored on the same module. This goal is achieved by determining the smallest chbox-it perfect universal graphs for data structures "of type X.?ý Such a graph is the smallest graph that contains a homomorphic image of each nhbox-rm node structure "of type X,?ý with each node of the image holding leq c nodes of the structure. In the current paper, "type X?ý refers to rooted binary trees and three array-like structures: chaotic arrays, ragged arrays, and rectangular arrays. For each of these families of data structures, the number of memory modules needed to achieve conflict tolerance c is determined to within constant factors.
BibTeX: @article{CordascoSR2007, author = {Gennaro Cordasco and Vittorio Scarano and Arnold L. Rosenberg}, title = {{Bounded-Collision Memory-Mapping Schemes for Data Structures with Applications to Parallel Memories}}, journal = {IEEE Trans. Parallel Distrib. Syst.}, publisher = {IEEE Press}, year = {2007}, volume = {18}, number = {7}, pages = {973-982}, doi = {http://dx.doi.org/10.1109/TPDS.2007.1024} }
Cordasco, G., Scarano, V. & Vitolo, C.	Architecture of a P2P Distributed Adaptive Directory [BibTeX]	2004	Proceedings of the 13th International Conference on World Wide Web, Alternate track papers & posters, May 17-22 2004, New York, NY, USA , pp. 282-283. IEEE.	inproceedings	DOI URL
BibTeX: @inproceedings{CordascoSV04a, author = {Gennaro Cordasco and Vittorio Scarano and Cristiano Vitolo}, title = {{Architecture of a P2P Distributed Adaptive Directory}}, booktitle = {Proceedings of the 13th International Conference on World Wide Web, Alternate track papers \& posters, May 17-22 2004, New York, NY, USA}, publisher = {IEEE}, year = {2004}, pages = {282--283}, url = {http://dx.medra.org/10.1145/1013367.1013436}, doi = {http://dx.doi.org/10.1145/1013367.1013436} }
Cordasco, G., Scarano, V. & Vitolo, C.	A P2P Distributed Adaptive Directory [Abstract] [BibTeX]	2004	Proceedings of Third International Conference on Adaptive Hypermedia and Adaptive Web-Based Systems, August 23-26 2004, Eindhoven, The Netherlands , pp. 44-54. Lecture Notes in Computer Science (3137). Springer.	inproceedings	DOI
Abstract: We describe a P2P system that offers a distributed, cooperative and adaptive environment for bookmark sharing. DAD offers an adaptive environment since it provides suggestions about the navigation based on (a) the bookmarks, (b) the feedback implicitly provided by users and (c) the structure of the Web. Our system is fully scalable because of its peer-to-peer architecture and provides, also, an infrastructure to build easily P2P overlay networks.
BibTeX: @inproceedings{CordascoSV04b, author = {Gennaro Cordasco and Vittorio Scarano and Cristiano Vitolo}, title = {{A P2P Distributed Adaptive Directory}}, booktitle = {Proceedings of Third International Conference on Adaptive Hypermedia and Adaptive Web-Based Systems, August 23-26 2004, Eindhoven, The Netherlands}, publisher = {Springer}, year = {2004}, pages = {44--54}, doi = {http://dx.doi.org/10.1007/b99480} }
Cosenza, B., Cordasco, G., De Chiara, R., Erra, U. & Scarano, V.	Load Balancing in Mesh-like Computations using Prediction Binary Trees [Abstract] [BibTeX]	2008	Proceedings of 7th International Symposium on Parallel and Distributed Computing, July 1-5 2008, Krakow, Poland , pp. 139-146. IEEE Computer Society Press.	inproceedings	DOI
Abstract: We present a load-balancing technique that exploits the temporal coherence, among successive computation phases, in mesh-like computations to be mapped on a cluster of processors. Our method partitions the computation in balanced tasks and distributes them to independent processors through the Prediction Binary Tree (PBT). At each new phase, current PBT is updated by using previous phase computing time (for each task) as (next phase) cost estimate. The PBT is designed so that it balances the load across the tasks as well as reduce dependency among processors for higher performances. Reducing dependency is obtained by using rectangular tiles of the mesh, of almost-square shape (i.e. one dimension is at most twice the other). By reducing dependency, one can reduce inter-processors communication or exploit local dependencies among tasks (such as data locality).Our strategy has been assessed on a significant problem, Parallel Ray Tracing. Our implementation shows a good scalability, and improves over coherence-oblivious implementations. We report different measurements showing that granularity of tasks is a key point for the performances of our decomposition/mapping strategy.
BibTeX: @inproceedings{CosenzaCDES08, author = {Biagio Cosenza and Gennaro Cordasco and Rosario {De Chiara} and Ugo Erra and Vittorio Scarano}, title = {{Load Balancing in Mesh-like Computations using Prediction Binary Trees}}, booktitle = {Proceedings of 7th International Symposium on Parallel and Distributed Computing, July 1-5 2008, Krakow, Poland}, publisher = {IEEE Computer Society Press}, year = {2008}, pages = {139-146}, doi = {http://www2.computer.org/portal/web/csdl/doi/10.1109/ISPDC.2008.24} }
Cosenza, B., Cordasco, G., De Chiara, R., Erra, U. & Vittorio Scarano, V.	On Estimating the Effectiveness of Temporal and Spatial Coherence in Parallel Ray Tracing [Abstract] [BibTeX]	2008	Proceedings of 6th Eurographics Italian Chapter Conference, July 2-4 2008, Salerno (Italy)	inproceedings
Abstract: In this paper we estimate the effectiveness of exploiting coherence in Parallel Ray Tracing. We present a load- balancing technique which divides the original rendering problem in balanced subtasks and distribute them to independent processors through a Prediction Binary Tree (PBT). Furthermore the PBT allows to exploit temporal coherence among successive image frames. At each new frame, it updates the current PBT using a cost function which uses the previous rendering time as cost estimate. We also provide two heuristics which take advantage of data-locality. We assess the effectiveness of the proposed solution by running two experiments. The £rst one aims to investigate the accurancy of predictions made using the PBT. Results show that such predictions are quite accurate even considering a heavily unbalanced scene and a fast moving camera. The second experiment evaluates the two locality-aware heuristics showing a modest improvement.
BibTeX: @inproceedings{CosenzaCDES2008, author = {Biagio Cosenza and Gennaro Cordasco and Rosario {De Chiara} and Ugo Erra and Vittorio Scarano, V.}, title = {{On Estimating the Effectiveness of Temporal and Spatial Coherence in Parallel Ray Tracing}}, booktitle = {Proceedings of 6th Eurographics Italian Chapter Conference, July 2-4 2008, Salerno (Italy)}, year = {2008} }
De Chiara, R., Di Matteo, A., Ilaria Manno & Scarano, V.	CoFFEE: Cooperative Face2Face Educational Environment [Abstract] [BibTeX]	2007	Proceedings of the 3rd International Conference on Collaborative Computing: Networking, Applications and Worksharing (CollaborateCom 2007), November 12-15, 2007, New York, USA	inproceedings
Abstract: Co-located collaboration in classroom is the topic we tackle in this paper. We present CoFFEE a tailorable collaborative environment that is designed for interactive, co-located (i.e. Face2Face) collaboration in classroom. We present the requirements for tailorability that have driven our design, CoFFEE architecture, some tools that have been deployed and discuss the latecomer management issue that is offered by the core of our architecture to all the tools that can be developed within the framework.
BibTeX: @inproceedings{DeChiaraDMS2007, author = {Rosario {De Chiara} and Antonio {Di Matteo} and {Ilaria Manno} and Vittorio Scarano}, title = {{CoFFEE: Cooperative Face2Face Educational Environment}}, booktitle = {Proceedings of the 3rd International Conference on Collaborative Computing: Networking, Applications and Worksharing (CollaborateCom 2007), November 12-15, 2007, New York, USA}, year = {2007} }
De Chiara, R., Di Santo, V., Erra, U. & Scarano, V.	Real positioning in Virtual Environments Using Game Engines [Abstract] [BibTeX]	2007	Proceedings of 5th Eurographics Italian Chapter Conference, February 14-17 2007, Trento, Italy , pp. 197-203.	inproceedings
Abstract: Immersive virtual environments offer a natural setting for educational and instructive experiences for users, and game engine technology offers an interesting, cost-effective and efficient solution for building them. In this paper we describe an ongoing project whose goal is to provide a virtual environment where the “real” location of the user is used to position the user’s avatar into the virtual environment.
BibTeX: @inproceedings{DeChiaraDES07, author = {Rosario {De Chiara} and Valentina {Di Santo} and Ugo Erra and Vittorio Scarano}, title = {{Real positioning in Virtual Environments Using Game Engines}}, booktitle = {Proceedings of 5th Eurographics Italian Chapter Conference, February 14-17 2007, Trento, Italy}, year = {2007}, pages = {197-203} }
De Chiara, R., Erra, U., Petta, A., Scarano, V. & Serra, L.	An infrastructure for remote virtual exploration on PDAs [Abstract] [BibTeX]	2007	Proceedings of the 11th International Conference on Information Visualisation (IV 2007), July 2-6 2007, Zürich, Switzerland , pp. 813-818. IEEE Computer Society.	inproceedings	DOI
Abstract: In this paper we present a prototyped system to enable the virtual exploration of a complex virtual environment. Our approach exploits Quest3D as main rendering engine, its output is conveyed toward users PDAs to allow them to explore using the PDA as a (mobile) interface to the virtual environment. An important aspect of the system is that it relies on an off-the-shelf PC and low end wireless network. Some early results showed that the prototype is able to easily manage 5 PDAs. Suggested fields of use of our system are virtual cultural heritage, educational virtual environments, videogames.
BibTeX: @inproceedings{DechiaraEPSS2007, author = {Rosario {De Chiara} and Ugo Erra and Andrea Petta and Vittorio Scarano and Luigi Serra}, title = {{An infrastructure for remote virtual exploration on PDAs}}, booktitle = {Proceedings of the 11th International Conference on Information Visualisation (IV 2007), July 2-6 2007, Z{\"u}rich, Switzerland}, publisher = {IEEE Computer Society}, year = {2007}, pages = {813-818}, doi = {http://doi.ieeecomputersociety.org/10.1109/IV.2007.25} }
De Chiara, R., Erra, U. & Scarano, V.	An Architecture for Distributed Behavioral Models with GPUs [Abstract] [BibTeX]	2006	Proceedings of 4th Eurographics Italian Chapter Conference 2006, February 22-24 2006, Catania, Italy, , pp. 197-203. Eurographics.	inproceedings
Abstract: We describe an architecture for massive simulation of a distributed behavioral model using graphics hardware. By leveraging on the recent programmable capabilities of GPUs we implemented the model capable of managing a large aggregate motion of birds in a virtual environment that can avoid both static and dynamic obstacles. We demonstrate the effectiveness of our GPU implementation by comparing the results to a CPU implementation and, emphasize the modularity of the proposed architecture that favors reusability in several contexts
BibTeX: @inproceedings{DeChiaraES2006, author = {Rosario {De Chiara} and Ugo Erra and Vittorio Scarano}, title = {{An Architecture for Distributed Behavioral Models with GPUs}}, booktitle = {Proceedings of 4th Eurographics Italian Chapter Conference 2006, February 22-24 2006, Catania, Italy,}, publisher = {Eurographics}, year = {2006}, pages = {197-203} }
De Chiara, R., Erra, U. & Scarano, V.	A Visual Adaptive Interface to File Systems [Abstract] [BibTeX]	2004	Proceedings of the Working Conference on Advanced Visual Interfaces (AVI 04) , pp. 366-369. ACM.	inproceedings	DOI
Abstract: In this paper we present our experience in building a visual file manager, VennFS2, that offers to users an adaptive interface toward access to files. Our file manager was originally designed to overcome some of limitations of hierarchical file systems, since it allows users to categorize files in such a way that files may belong multiple categories at once. Based on the past history of the files that were opened and modified by the user, VennFS2 graphically presents the user a small number of choices of the next file the user will modify. Some preliminary testing with interesting hints are also reported.
BibTeX: @inproceedings{DeChiara2004, author = {Rosario {De Chiara} and Ugo Erra and Vittorio Scarano}, title = {{A Visual Adaptive Interface to File Systems}}, booktitle = {Proceedings of the Working Conference on Advanced Visual Interfaces (AVI 04)}, publisher = {ACM}, year = {2004}, pages = {366--369}, doi = {http://doi.acm.org/10.1145/989863.989926} }
De Chiara, R., Erra, U. & Scarano, V.	VENNFS: a Venn-diagram File Manager [Abstract] [BibTeX]	2003	Proceedings of 7th International Conference on Information Visualization (IV 2003), 16--18 July 2003, London, UK , pp. 120-125.	inproceedings
Abstract: We present a prototypal file manager, VENNFS, that is designed to overcome some of the limitations of the current desktop interfaces, that are strongly based on hierarchical file systems. VENNFS allows users to place documents and categories on a plane so that files may belong to multiple categories at once, where proximity on the plane can represent similarity and time filtering is allowed.
BibTeX: @inproceedings{DeChiaraES2003, author = {Rosario {De Chiara} and Ugo Erra and Vittorio Scarano}, title = {{VENNFS: a Venn-diagram File Manager}}, booktitle = {Proceedings of 7th International Conference on Information Visualization (IV 2003), 16--18 July 2003, London, UK}, year = {2003}, pages = {120--125} }
De Chiara, R., Erra, U., Scarano, V. & Tatafiore, M.	Massive Simulation using GPU of a Distributed Behavioral Model of a Flock with Obstacle Avoidance [Abstract] [BibTeX]	2004	Proceedings of the Vision, Modeling, and Visualization Conference 2004 (VMV 2004), November 16-18, 2004, Stanford, California, USA , pp. 233-240. Aka GmbH.	inproceedings
Abstract: In this work, we present a massive simulation of a behavioral model using graphics hardware. In particular we took a well established model to simulate complex flocks and we focused our attention on its implementation using techniques to manage efficiently large amount of data. Using the recent programmability of GPUs and recent extensions of computer graphics programming, we implemented on the graphics hardware the model capable of managing a large aggregate motion of birds in a virtual environment as well as to avoiding both static and dynamic obstacles. We demonstrated the effectiveness of our GPU implementation when compared with CPU according to recent trends that show graphics hardware capable of also working outside of its natural application field.
BibTeX: @inproceedings{DeChiaraEST04, author = {Rosario {De Chiara} and Ugo Erra and Vittorio Scarano and Maurizio Tatafiore}, title = {{Massive Simulation using GPU of a Distributed Behavioral Model of a Flock with Obstacle Avoidance}}, booktitle = {Proceedings of the Vision, Modeling, and Visualization Conference 2004 (VMV 2004), November 16-18, 2004, Stanford, California, USA}, publisher = {Aka GmbH}, year = {2004}, pages = {233-240} }
De Chiara, R., Hammar, M. & Scarano, V.	A System for Virtual Directories Using Euler Diagrams [Abstract] [BibTeX]	2005	Electr. Notes Theor. Comput. Sci. Vol. 134 , pp. 33-53.	article	DOI
Abstract: In this paper, we describe how to use Euler Diagrams to represent virtual directories. i.e. collection of files that are computed on demand and satisfy a number of constraints. We, then, briefly describe the state of VennFS project that is currently modified to include this new capability. In particular, we show a data structure designed to answer queries about a given Euler Diagram and its sets. The data structure EulerTree described here is based on the R-Tree (see [Pankaj K. Agarwal, Mark de Berg, Joachim Gudmundsson, Mikael Hammar and Herman J. Haverkort, Box-trees and R-trees with near-optimal query time, in: Symposium on Computational Geometry, 2001, pp. 124–133]), a data structure designed for answering range queries over a family of shapes in the 2-dimensional space.
BibTeX: @article{DeChiaraHS2005, author = {Rosario {De Chiara} and Mikael Hammar and Vittorio Scarano}, title = {{A System for Virtual Directories Using Euler Diagrams}}, journal = {Electr. Notes Theor. Comput. Sci.}, year = {2005}, volume = {134}, pages = {33-53}, doi = {http://dx.doi.org/10.1016/j.entcs.2005.02.019} }
De Chiara, R., Manno, I. & Scarano, V.	Design Issue for a Co-located Collaborative Learning System [Abstract] [BibTeX]	2007	Proceedings of 12th Conference of European Association for Research on Learning and Instruction (EARLI 2007), August 28 - September 1 2007, Budapest, Hungary	inproceedings
Abstract: Most of the existing systems for collaborative learning are designed for remote situations, employing the traditional client-server model where the server coordinates the cooperation among remote users. Among the important features, remote systems is providing team awareness, workspace awareness, collaboration process awareness that have different scope in a co-located scenario. Users can "appropriate" these systems by using them in the face-to-face (f2f) situations, but a different design for addressing co-location is needed. The aim of this paper is to present the technological and design issues for a Co-located Collaborative Learning System (CoCoLeS). Our studies in this field are within the LEAD project, whose aims are to develop, implement and evaluate conceptual models, pratical scenarios and associated network-computing technologies for effective face-toface problem solving discussion (LEAD). On the basis of the inputs provided us by the pedagogical partners, we analyze the differences between remote and co-located systems and address the open questions specific to CoCoLeS design. The first and main difference between a remote and a CoCoLeS is the distance and remote systems employs a lot of effort, resources, design issues to fill up the distance between the users, a non-existing problem in f2f. Technologically, Local Area Networks dictate stringent requirements on management and ask for smooth service discovery and effective and stable connections. Functionalities that are influenced by the co-location are awareness, meta-task communication, teacher's role, control and design of the phases while different tools, i.e., co-located tools can be fruitful i.e. tools where contributions are physically located by relating the screen of each learner to others' screens. Most of the existing systems for collaborative learning are designed for remote situations, employing the traditional client-server model where the server coordinates the cooperation among remote users. Among the important features, remote systems is providing team awareness, workspace awareness, collaboration process awareness that have different scope in a co-located scenario. Users can "appropriate" these systems by using them in the face-to-face (f2f) situations, but a different design for addressing co-location is needed. The aim of this paper is to present the technological and design issues for a Co-located Collaborative Learning System (CoCoLeS). Our studies in this field are within the LEAD project, whose aims are to develop, implement and evaluate conceptual models, pratical scenarios and associated network-computing technologies for effective face-toface problem solving discussion (LEAD). On the basis of the inputs provided us by the pedagogical partners, we analyze the differences between remote and co-located systems and address the open questions specific to CoCoLeS design. The first and main difference between a remote and a CoCoLeS is the distance and remote systems employs a lot of effort, resources, design issues to fill up the distance between the users, a non-existing problem in f2f. Technologically, Local Area Networks dictate stringent requirements on management and ask for smooth service discovery and effective and stable connections. Functionalities that are influenced by the co-location are awareness, meta-task communication, teacher's role, control and design of the phases while different tools, i.e., co-located tools can be fruitful i.e. tools where contributions are physically located by relating the screen of each learner to others' screens.
BibTeX: @inproceedings{DeChiaraMS2007, author = {Rosario {De Chiara} and Ilaria Manno and Vittorio Scarano}, title = {{Design Issue for a Co-located Collaborative Learning System}}, booktitle = {Proceedings of 12th Conference of European Association for Research on Learning and Instruction (EARLI 2007), August 28 - September 1 2007, Budapest, Hungary}, year = {2007} }
Erra, U., Iaccarino, G., Malandrino, D. & Scarano, V.	Personalizable edge services for Web accessibility [Abstract] [BibTeX]	2007	Univers. Access Inf. Soc. Vol. 6 (3) , pp. 285-306. Springer-Verlag.	article	DOI
Abstract: Web Content Accessibility guidelines by W3C (W3C Recommendation, May 1999. http://www.w3.org/TR/WCAG10/) provide several suggestions for Web designers regarding how to author Web pages in order to make them accessible to everyone. In this context, this paper proposes the use of edge services as an efficient and general solution to promote accessibility and breaking down the digital barriers that inhibit users with disabilities to actively participate to any aspect of society. The idea behind edge services mainly affect the advantages of a personalized navigation in which contents are tailored according to different issues, such as client’s devices capabilities, communication systems and network conditions and, finally, preferences and/or abilities of the growing number of users that access the Web. To meet these requirements, Web designers have to efficiently provide content adaptation and personalization functionalities mechanisms in order to guarantee universal access to the Internet content. The so far dominant paradigm of communication on the WWW, due to its simple request/response model, cannot efficiently address such requirements. Therefore, it must be augmented with new components that attempt to enhance the scalability, the performances and the ubiquity of the Web. Edge servers, acting on the HTTP data flow exchanged between client and server, allow on-the-fly content adaptation as well as other complex functionalities beyond the traditional caching and content replication services. These value-added services are called edge services and include personalization and customization, aggregation from multiple sources, geographical personalization of the navigation of pages (with insertion/emphasis of content that can be related to the user’s geographical location), translation services, group navigation and awareness for social navigation, advanced services for bandwidth optimization such as adaptive compression and format transcoding, mobility, and ubiquitous access to Internet content. This paper presents Personalizable Accessible Navigation (Pan) that is a set of edge services designed to improve Web pages accessibility, developed and deployed on top of a programmable intermediary framework. The characteristics and the location of the services, i.e., provided by intermediaries, as well as the personalization and the opportunities to select multiple profiles make Pan a platform that is especially suitable for accessing the Web seamlessly also from mobile terminals.
BibTeX: @article{ErraIMS2007, author = {Ugo Erra and Gennaro Iaccarino and Delfina Malandrino and Vittorio Scarano}, title = {{Personalizable edge services for Web accessibility}}, journal = {Univers. Access Inf. Soc.}, publisher = {Springer-Verlag}, year = {2007}, volume = {6}, number = {3}, pages = {285--306}, doi = {http://dx.doi.org/10.1007/s10209-007-0091-y} }
Erra, U., Scarano, V. & Guida, D.	Fractal Compression Approach for Efficient Interactive Terrain Rendering on the GPU [Abstract] [BibTeX]	2008	Proceedings of 6th Eurographics Italian Chapter Conference, July 2-4 2008, Salerno (Italy)	inproceedings
Abstract: This paper describes an efficient technique for the rendering of large terrain surfaces. The technique is based on a simple rings structure: a sequence of concentric rings at different resolutions and centeredon the viewer’s position. Each ring is represented by a set of patches at identical resolutions. Rings near the viewer have a finer resolution than the rings further from the viewer. At runtime, the patches within the rings change resolution based on the viewer’s position. The GPU decodes in real time height maps encoded by a fractal compressor from which sample the height component of the terrain. Since adjacent patches of different rings can disagree on the resolution of common edge GPU stitches the meshes in order to avoid any cracks or degenerate triangles. The renderedmeshes ensure the absence of cracks that may cause the appearance of visual artifacts. In addition, a tile manager support is evaluated in order to maintain terrain datasets on disk storage avoiding a costly load of the entire datasets into the memory.
BibTeX: @inproceedings{ErraSDG2008, author = {Ugo Erra and Vittorio Scarano and Davide Guida}, title = {{Fractal Compression Approach for Efficient Interactive Terrain Rendering on the GPU}}, booktitle = {Proceedings of 6th Eurographics Italian Chapter Conference, July 2-4 2008, Salerno (Italy)}, year = {2008} }
Ferrandino, S., Negro, A. & Scarano, V.	CHEOPS: Adaptive hypermedia on World Wide Web [BibTeX]	1997	Proceedings of 4th International Workshop on Interactive Distributed Multimedia Systems and Telecommunication Services (IDMS '97), September 10–12, 1997, Darmstadt, Germany , pp. 210-219. Lecture Notes in Computer Science (1309). Springer.	inproceedings	DOI
BibTeX: @inproceedings{FerrandinoNS1997, author = {Salvatore Ferrandino and Alberto Negro and Vittorio Scarano}, title = {{CHEOPS: Adaptive hypermedia on World Wide Web}}, booktitle = {Proceedings of 4th International Workshop on Interactive Distributed Multimedia Systems and Telecommunication Services (IDMS '97), September 10–12, 1997, Darmstadt, Germany}, publisher = {Springer}, year = {1997}, pages = {210-219}, doi = {http://dx.doi.org/10.1007/BFb0000353} }
Grieco, R., Malandrino, D., Mazzoni, F. & Scarano, V.	Mobile-Web Services VIA Programmable Proxies [Abstract] [BibTeX]	2005	Vol. 2005 Proceedings of the IFIP TC8 Working Conference on Mobile Information Systems (MOBS 2005), Leeds, UK, December 2005 , pp. 139-146. Springer Boston.	inproceedings	DOI
Abstract: Our goal, in this paper, is to present the effectiveness of an inteimediary frame-work to provide mobile-oriented services via edge services. To this end we developed services for device independence in such a way that content is adapted according to the capabilities of the target devices.
BibTeX: @inproceedings{GriecoMMS2005, author = {Raffaella Grieco and Delfina Malandrino and Francesca Mazzoni and Vittorio Scarano}, title = {{Mobile-Web Services VIA Programmable Proxies}}, booktitle = {Proceedings of the IFIP TC8 Working Conference on Mobile Information Systems (MOBS 2005), Leeds, UK, December 2005}, publisher = {Springer Boston}, year = {2005}, volume = {2005}, pages = {139--146}, doi = {http://dx.doi.org/10.1007/0-387-31166-1_10} }
Grieco, R., Malandrino, D. & Scarano, V.	A Scalable Cluster-based Infrastructure for Edge-computing Services [Abstract] [BibTeX]	2006	World Wide Web Vol. 9 (3) , pp. 317-341. Kluwer Academic Publishers.	article	DOI
Abstract: In this paper we present a scalable and dynamic intermediary infrastructure, SEcS (acronym of "Scalable Edge computing Services"), for developing and deploying advanced Edge computing services, by using a cluster of heterogeneous machines. Our goal is to address the challenges of the next-generation Internet services: scalability, high availability, fault-tolerance and robustness, as well as programmability and quick prototyping. The system is written in Java and is based on IBM's Web Based Intermediaries (WBI) [71] developed at IBM Almaden Research Center.
BibTeX: @article{GriecoMS2006, author = {Raffaella Grieco and Delfina Malandrino and Vittorio Scarano}, title = {{A Scalable Cluster-based Infrastructure for Edge-computing Services}}, journal = {World Wide Web}, publisher = {Kluwer Academic Publishers}, year = {2006}, volume = {9}, number = {3}, pages = {317--341}, doi = {http://dx.doi.org/10.1007/s11280-006-8559-x} }
Grieco, R., Malandrino, D. & Scarano, V.	SEcS: Scalable Edge-Computing Services [Abstract] [BibTeX]	2005	Proceedings of the 2005 ACM Symposium on Applied Computing (SAC 2005), March 13-17, 2005, Santa Fe, New Mexico, USA, , pp. 1709-1713. ACM.	inproceedings	DOI
Abstract: We present the architecture of a scalable and dynamic intermediary infrastructure for developing and deploying advanced Edge computing services, by using a cluster of heterogeneous machines. Our main goal is to address the challenges of the next-generation Internet services: scalability, high availability, fault-tolerance and robustness. Moreover, SEcS offers an easy, "on-the-fly" and per-user configuration of services. The architecture is based on IBM's Web Based Intermediaries (WBI) [8, 9].
BibTeX: @inproceedings{GriecoMS2005, author = {Raffaella Grieco and Delfina Malandrino and Vittorio Scarano}, title = {{SEcS: Scalable Edge-Computing Services}}, booktitle = {Proceedings of the 2005 ACM Symposium on Applied Computing (SAC 2005), March 13-17, 2005, Santa Fe, New Mexico, USA,}, publisher = {ACM}, year = {2005}, pages = {1709--1713}, doi = {http://doi.acm.org/10.1145/1066677.1067063} }
Grieco, R., Malandrino, D., Scarano, V., Varriale, F. & Mazzoni, F.	An Intermediary Software Infrastructure for Edge Services [Abstract] [BibTeX]	2005	Proc. of the First International Workshop on Services and Infrastructure for the Ubiquitout and Mobile Internet (SIUMI '05). Workshop of the 25th International Conference on Distributed Computing Systems Workshops (ICDCS 2005 Workshops), 6-10 June 2005, Columbus, OH, USA , pp. 259-265. IEEE Computer Society.	inproceedings	DOI
Abstract: We describe the goals and architecture of a new framework that aims at facilitating the deployment of adaptation services running on intermediate edge servers. The main goal is to guarantee robustness and quick prototyping of functions that should integrate mobile/fixed-network services. Moreover, we intend to design a distributed architecture with the purpose of guaranteeing efficient delivery.
BibTeX: @inproceedings{GriecoMSVM2005, author = {Raffaella Grieco and Delfina Malandrino and Vittorio Scarano and Francesco Varriale and Francesca Mazzoni}, title = {{An Intermediary Software Infrastructure for Edge Services}}, booktitle = {Proc. of the First International Workshop on Services and Infrastructure for the Ubiquitout and Mobile Internet (SIUMI '05). Workshop of the 25th International Conference on Distributed Computing Systems Workshops (ICDCS 2005 Workshops), 6-10 June 2005, Columbus, OH, USA}, publisher = {IEEE Computer Society}, year = {2005}, pages = {259-265}, doi = {http://doi.ieeecomputersociety.org/10.1109/ICDCSW.2005.38} }
Iaccarino, G., Malandrino, D., Del Percio, M. & Scarano, V.	Efficient Edge-Services for Colorblind Users [Abstract] [BibTeX]	2006	Proceedings of the 15th International Conference on World Wide Web, WWW 2006, May 23-26, 2006, Edinburgh, Scotland, UK , pp. 919-920. ACM.	inproceedings	DOI
Abstract: Web Content Accessibility guidelines by W3C (http://www.w3.org/TR/WCAG10/) provide several suggestions for Web designers on how to authorWeb pages in order to make them accessible to everyone. In this context, we are proposing to use edge services as an efficient and general solution to the problem of colorblind users: we, first, describe an efficient algorithm that modifies any color in Web pages, by increasing contrast and lightness, in order to make them accessible for users with such a disability; then, the algorithm is implemented as an edge service called the ColorBlind Filter Service on top of a programmable intermediary framework called SISI [3].
BibTeX: @inproceedings{Iaccarino2006Poster, author = {Gennaro Iaccarino and Delfina Malandrino and Marco {Del Percio} and Vittorio Scarano}, title = {{Efficient Edge-Services for Colorblind Users}}, booktitle = {Proceedings of the 15th International Conference on World Wide Web, WWW 2006, May 23-26, 2006, Edinburgh, Scotland, UK}, publisher = {ACM}, year = {2006}, pages = {919--920}, doi = {http://doi.acm.org/10.1145/1135777.1135944} }
Iaccarino, G., Malandrino, D. & Scarano, V.	Personalizable Edge Services for Web Accessibility [Abstract] [BibTeX]	2006	Proceedings of the 2006 International Cross-Disciplinary Workshop on Web Accessibility (W4A 2006): "Building the mobile web: rediscovering accessibility?", May 22 2006, Edinburgh, UK , pp. 23-32. ACM International Conference Proceeding Series (134). ACM.	inproceedings	DOI
Abstract: Web Content Accessibility guidelines by W3C [29] provide several suggestions for Web designers on how to author Web pages in order to make them accessible to everyone. In this context, we are proposing the use of edge services as an efficient and general solution to promote accessibility and breaking down the digital barriers that inhibit users with disabilities to actively participate to any aspect of our society.To this aim, we present in this paper PAN: Personalizable Accessible Navigation, that is a set of edge services designed to improve Web pages accessibility, developed and deployed on top of a programmable intermediary framework [8].The characteristics and the location of the services, i. e. provided by intermediaries, as well as the personalization and the opportunities to select multiple profiles make PAN a platform that is especially suitable in accessing the Web seamlessly also from mobile terminals.
BibTeX: @inproceedings{Iaccarino2006, author = {Gennaro Iaccarino and Delfina Malandrino and Vittorio Scarano}, title = {{Personalizable Edge Services for Web Accessibility}}, booktitle = {Proceedings of the 2006 International Cross-Disciplinary Workshop on Web Accessibility (W4A 2006): "Building the mobile web: rediscovering accessibility?", May 22 2006, Edinburgh, UK}, publisher = {ACM}, year = {2006}, pages = {23--32}, doi = {http://doi.acm.org/10.1145/1133219.1133224} }
Malandrino, D., Mea, D., Negro, A., Palmieri, G. & Scarano., V.	NeMoS: Network Monitoring with Sound [BibTeX]	2003	Proceedings of 9th International Conference on Auditory Display (ICAD 2003), July 6-9 2003, Boston, Massachusetts, USA ICAD.	inproceedings
BibTeX: @inproceedings{MalandrinoMNPS2003, author = {Delfina Malandrino and Daniela Mea and Alberto Negro and Giuseppina Palmieri and Vittorio Scarano.}, title = {{NeMoS: Network Monitoring with Sound}}, booktitle = {Proceedings of 9th International Conference on Auditory Display (ICAD 2003), July 6-9 2003, Boston, Massachusetts, USA}, publisher = {ICAD}, year = {2003} }
Malandrino, D., Meo, G., Palmieri, G. & Scarano, V.	3WPS: A 3D Web-based Process Visualization Framework [BibTeX]	2002	Proceedings of 1st International Symposium on 3D Data Processing Visualization and Transmission (3DPVT 2002), June 19-21 2002, Padova, Italy , pp. 48-51. IEEE Computer Society.	inproceedings	DOI
BibTeX: @inproceedings{Malandrino2002, author = {Delfina Malandrino and Gennaro Meo and Giuseppina Palmieri and Vittorio Scarano}, title = {{3WPS: A 3D Web-based Process Visualization Framework}}, booktitle = {Proceedings of 1st International Symposium on 3D Data Processing Visualization and Transmission (3DPVT 2002), June 19-21 2002, Padova, Italy}, publisher = {IEEE Computer Society}, year = {2002}, pages = {48-51}, doi = {http://doi.ieeecomputersociety.org/10.1109/TDPVT.2002.1024038} }
Malandrino, D., Meo, G., Palmieri, G. & Scarano, V.	Web-based Visualization of Process Applications [Abstract] [BibTeX]	2001	Proceedings of IEEE 2001 Workshop on Multimedia Signal Processing October 3-5, 2001, Cannes, France , pp. 383-388. IEEE.	inproceedings	DOI
Abstract: We describe several Web-based visualizations of processes obtained using 3WPS, a distributed framework to build systems that monitor and interact with a process by a 3D interface accessible via WWW
BibTeX: @inproceedings{Malandrino2001, author = {Delfina Malandrino and Giovanni Meo and Giuseppina Palmieri and Vittorio Scarano}, title = {{Web-based Visualization of Process Applications}}, booktitle = {Proceedings of IEEE 2001 Workshop on Multimedia Signal Processing October 3-5, 2001, Cannes, France}, publisher = {IEEE}, year = {2001}, pages = {383-388}, doi = {http://dx.doi.org/10.1109/MMSP.2001.962764} }
Malandrino, D., Meo, P., Palmieri, G. & Scarano, V.	AMIFAST: an Architecture for MIDI Flows as Sonification Tools [Abstract] [BibTeX]	2004	Proceedings of 8th International Conference on Information Visualisation (IV 2004) , pp. 677-682. IEEE Computer Society.	inproceedings	DOI
Abstract: We describe a framework in Java to create sonification applications with minimum effort from the programmer and musician. Our tool, AMIFAST, offers a set of modules that can be easily assembled to produce sonification of off-line as well as on-line (i.e. real-time) applications. Moreover, the programmer can easily add new functionalities In AMIFaST, we included a sonification technique that we introduce here, Markov Chain Perturbation.
BibTeX: @inproceedings{Malandrino2004, author = {Malandrino, D. and Meo, P. and Palmieri, G. and Scarano, V.}, title = {{AMIFAST: an Architecture for MIDI Flows as Sonification Tools}}, booktitle = {Proceedings of 8th International Conference on Information Visualisation (IV 2004)}, publisher = {IEEE Computer Society}, year = {2004}, pages = {677--682}, doi = {http://dx.doi.org/10.1109/IV.2004.1320215} }
Malandrino, D., Negro, A., Ferraro Petrillo, U., Romano, N. & Scarano, V.	JPDC: Java Package for Distributed Computing [BibTeX]	2003	Proceedings of 2003 International Conference on Software,Telecomunications and Computer Network, October 10-13, 2003, Dubrovnik (Croatia)	inproceedings
BibTeX: @inproceedings{MalandrinoNFRS2003, author = {Delfina Malandrino and Aberto Negro and Umberto {Ferraro Petrillo} and Nadia Romano and Vittorio Scarano}, title = {{JPDC: Java Package for Distributed Computing}}, booktitle = {Proceedings of 2003 International Conference on Software,Telecomunications and Computer Network, October 10-13, 2003, Dubrovnik (Croatia)}, year = {2003} }
Malandrino, D., Negro, A. & Scarano, V.	Una piattaforma per HTTP-Proxy Scalabili basati su Cluster [BibTeX]	2001	Atti del 6$^o$ Workshop su Sistemi Distribuiti: Algoritmi, Architetture e Linguaggi (WSDAAL 01), September 10-12 2001, Como, Italy	inproceedings
BibTeX: @inproceedings{MalandrinoNS2001, author = {Delfina Malandrino and Alberto Negro and Vittorio Scarano}, title = {{Una piattaforma per HTTP-Proxy Scalabili basati su Cluster}}, booktitle = {Atti del 6$^o$ Workshop su Sistemi Distribuiti: Algoritmi, Architetture e Linguaggi (WSDAAL 01), September 10-12 2001, Como, Italy}, year = {2001} }
Malandrino, D., Palmieri, G., Grieco, R. & Scarano, V.	Face2face Social Bookmarking with Recommendations: WebQuests in the Classrooms [Abstract] [BibTeX]	2007	Proceedings of the 3rd International Conference on Collaborative Computing: Networking, Applications and Worksharing (CollaborateCom 2007), November 12-15, 2007, New York, USA , pp. 223 - 232.	inproceedings	DOI
Abstract: In this paper we present SynCoBook, a distributed system that offers the functionalities of a face-to-face cooperative bookmarking system and of a recommendation system. Our overall objective was to design and realize a practical tool that can be used in project-based learning, in the classroom, to participate in the WebQuests [12] or to cooperatively build an annotated Webliography, i.e., a set of URLs, organized and scaffolded with group annotations. Moreover, our system also offers advanced awareness tools as well as recommendations based on the items in the Webliography and their Google-related pages.
BibTeX: @inproceedings{MalandrinoPFS07, author = {Delfina Malandrino and Giuseppina Palmieri and Raffaella Grieco and Vittorio Scarano}, title = {{Face2face Social Bookmarking with Recommendations: WebQuests in the Classrooms}}, booktitle = {Proceedings of the 3rd International Conference on Collaborative Computing: Networking, Applications and Worksharing (CollaborateCom 2007), November 12-15, 2007, New York, USA}, year = {2007}, pages = {223 - 232}, doi = {http://dx.doi.org/10.1109/COLCOM.2007.4553834} }
Malandrino, D., Palmieri, G. & Scarano, V.	Visualizing Processes on the Web [Abstract] [BibTeX]	2007	J. Vis. Lang. Comput. Vol. 18 (6) , pp. 592-612. Academic Press, Inc..	article	DOI
Abstract: In this paper, we describe 3WPS, a framework to build distributed systems that are able to monitor and interact with a process through a 3D interface that is accessible via the World Wide Web (WWW). The 3WPS is easily configurable, easily adaptable to different processes with high reuse of its software components and its distributed architecture leverages on off-the-shelf components of the WWW infrastructure such as Java applets and Virtual Reality Modeling Language (VRML) browsers. We describe the characteristics of 3WPS framework by mainly focusing on the issue of programmability and by contextually providing an example tour of its usage.
BibTeX: @article{MalandrinoPS2007, author = {Delfina Malandrino and Giuseppina Palmieri and Vittorio Scarano}, title = {{Visualizing Processes on the Web}}, journal = {J. Vis. Lang. Comput.}, publisher = {Academic Press, Inc.}, year = {2007}, volume = {18}, number = {6}, pages = {592--612}, doi = {http://dx.doi.org/10.1016/j.jvlc.2006.07.001} }
Malandrino, D. & Scarano, V.	Tackling web dynamics by programmable proxies [Abstract] [BibTeX]	2006	Comput. Networks Vol. 50 (10) , pp. 1564-1580. Elsevier North-Holland, Inc..	article	DOI
Abstract: Web services are becoming increasingly complex as users become more experienced in their requests to access an ever growing collection of information on the Web. In this paper we review the state of the art in programmable HTTP proxies. We discuss and present the evolution of HTTP proxies and present some of the environments that were proposed to support the design and implementation of proxy-based services. Then, we present a new computational model, called collateral-push, that is well suited for several proxy applications whose goal is to cope with the dynamics of the Web. Finally, after presenting existing examples of the collateral-push services in the literature, we present some new examples that were quickly prototyped using two programmable proxy environments.
BibTeX: @article{MalandrinoS2006, author = {Delfina Malandrino and Vittorio Scarano}, title = {{Tackling web dynamics by programmable proxies}}, journal = {Comput. Networks}, publisher = {Elsevier North-Holland, Inc.}, year = {2006}, volume = {50}, number = {10}, pages = {1564--1580}, doi = {http://dx.doi.org/10.1016/j.comnet.2005.10.019} }
Malandrino, D. & Scarano, V.	A Taxonomy of Programmable HTTP Proxies for Advanced Edge Services [Abstract] [BibTeX]	2005	WEBIST 2005, Proceedings of the First International Conference on Web Information Systems and Technologies, May 26-28, 2005, Miami, USA , pp. 231-238. INSTICC Press.	inproceedings
Abstract: In this paper, we present the state of the art in the field of programmability in HTTP proxies. In particular, we first deal with programmability and show how it is a crucial requirement to easily realize and assemble edge services that can enhance the quality and the user perception of the navigation into a crowded and confusing World Wide Web. Then, we compare some of the most used HTTP proxies to provide an analysis of their programmability and, finally, show some evidence of successful edge services realized on top of existing programmable HTTP proxy frameworks.
BibTeX: @inproceedings{MalandrinoS2005, author = {Delfina Malandrino and Vittorio Scarano}, title = {{A Taxonomy of Programmable HTTP Proxies for Advanced Edge Services}}, booktitle = {WEBIST 2005, Proceedings of the First International Conference on Web Information Systems and Technologies, May 26-28, 2005, Miami, USA}, publisher = {INSTICC Press}, year = {2005}, pages = {231-238} }
Malandrino, D. & Scarano, V.	A Platform for a Programmable Proxy Farm [BibTeX]	2003	Proceedings of 2003 International Conference on Software,Telecomunications and Computer Network, October 10-13, 2003, Dubrovnik (Croatia)	inproceedings
BibTeX: @inproceedings{MalandrinoS2003, author = {Delfina Malandrino and Vittorio Scarano}, title = {{A Platform for a Programmable Proxy Farm}}, booktitle = {Proceedings of 2003 International Conference on Software,Telecomunications and Computer Network, October 10-13, 2003, Dubrovnik (Croatia)}, year = {2003} }
Manno, I., Belgiorno, F., De Chiara, R., Di Matteo, A., Erra, U., Malandrino, D., Palmieri, G., Pirozzi, D. & Scarano, V.	Collaborative Face2Face Educational Environment (CoFFEE) [BibTeX]	2007	Proceedings of 1st International Conference on Eclipse Tecnhologies (Eclipse-IT), Oct. 4-5 2007, Naples, Italy	inproceedings
BibTeX: @inproceedings{MannoBDDEMPPS2007, author = {Ilaria Manno and Furio Belgiorno and Rosario {De Chiara} and Antonio {Di Matteo} and Ugo Erra and Delfina Malandrino and Giuseppina Palmieri and Donato Pirozzi and Vittorio Scarano}, title = {{Collaborative Face2Face Educational Environment (CoFFEE)}}, booktitle = {Proceedings of 1st International Conference on Eclipse Tecnhologies (Eclipse-IT), Oct. 4-5 2007, Naples, Italy}, year = {2007} }
Negro, A., Scarano, V. & Simari, R.	User Adaptivity on WWW through CHEOPS [BibTeX]	1998	Proceedings of Second Workshop on Adaptive Hypertext and Hypermedia, Satellite Workshop of 9th ACM Conference on Hypertext, June 20-24, 1998, Pittsburgh, USA	inproceedings
BibTeX: @inproceedings{NegroSS1998, author = {Alberto Negro and Vittorio Scarano and Rosaria Simari}, title = {{User Adaptivity on WWW through CHEOPS}}, booktitle = {Proceedings of Second Workshop on Adaptive Hypertext and Hypermedia, Satellite Workshop of 9th ACM Conference on Hypertext, June 20-24, 1998, Pittsburgh, USA}, year = {1998} }
Picquendar, M., Rosenberg, A. L. & Scarano, V.	A Cost-Effective Streamlining of the Diogenes Design Methodology [BibTeX]	1995	Parallel Processing Letters Vol. 5 , pp. 513-524.	article
BibTeX: @article{PicquendarRS1995, author = {Marc Picquendar and Arnold L. Rosenberg and Vittorio Scarano}, title = {{A Cost-Effective Streamlining of the Diogenes Design Methodology}}, journal = {Parallel Processing Letters}, year = {1995}, volume = {5}, pages = {513-524} }
Rosenberg, A. L., Scarano, V. & Sitaraman, R. K.	The Reconfigurable Ring of Processors: Fine-Grain Tree-Structured Computations [Abstract] [BibTeX]	1997	IEEE Trans. Computers Vol. 46 (10) , pp. 1119-1131. IEEE Computer Society.	article	DOI
Abstract: We study fine-grain computation on the Reconfigurable Ring of Processors $(l RRP),$ a parallel architecture whose processing elements (PEs) are interconnected via a multiline reconfigurable bus, each of whose lines has one-packet width and can be configured, independently of other lines, to establish an arbitrary PE-to-PE connection. We present a "cooperative" message-passing protocol that will, in the presence of suitable implementation technology, endow an $l RRP$ with message latency that is logarithmic in the number of PEs a message passes over in transit. Our study focuses on the computational consequences of such latency in such an architecture. Our main results prove that: 1) an N-PE $l RRP$ can execute a sweep up or down an N-leaf complete binary tree in time proportional to log N log log N; 2) a broad range of N-PE architectures, including N-PE $l RRPrm s,$ require time proportional to log N log log N to perform such a sweep.
BibTeX: @article{RosenbergSS1997, author = {Arnold L. Rosenberg and Vittorio Scarano and Ramesh K. Sitaraman}, title = {{The Reconfigurable Ring of Processors: Fine-Grain Tree-Structured Computations}}, journal = {IEEE Trans. Computers}, publisher = {IEEE Computer Society}, year = {1997}, volume = {46}, number = {10}, pages = {1119-1131}, doi = {http://dx.doi.org/10.1109/12.628396} }
Rosenberg, A. L., Scarano, V. & Sitaraman, R. K.	Efficient emulations of trees and arrays on a reconfigurable ring of processors [BibTeX]	1997	Proceedings of the 11th International Conference on Mathematical and Computer Modelling and Scientific Computing (ICMCM & SC), March 31 - April 3, 1997, Washington, USA	inproceedings
BibTeX: @inproceedings{RosenbergSS1997b, author = {Arnold L. Rosenberg and Vittorio Scarano and Ramesh K. Sitaraman}, title = {{Efficient emulations of trees and arrays on a reconfigurable ring of processors}}, booktitle = {Proceedings of the 11th International Conference on Mathematical and Computer Modelling and Scientific Computing (ICMCM \& SC), March 31 - April 3, 1997, Washington, USA}, year = {1997} }
Rosenberg, A. L., Scarano, V. & Sitaraman, R. K.	The Reconfigurable Ring of Processors: Efficient Algorithms via Hypercube Simulation [BibTeX]	1995	Parallel Processing Letters Vol. 5 , pp. 37-48.	article
BibTeX: @article{RosenbergSS1995, author = {Arnold L. Rosenberg and Vittorio Scarano and Ramesh K. Sitaraman}, title = {{The Reconfigurable Ring of Processors: Efficient Algorithms via Hypercube Simulation}}, journal = {Parallel Processing Letters}, year = {1995}, volume = {5}, pages = {37-48} }
Rosenberg, A. L., Scarano, V. & Sitaraman, R. K.	The reconfigurable ring of processors: fine-grained tree-structured computations [BibTeX]	1994	Proceedings of 6th IEEE Symposium on Parallel and Distributed Processing (SPDP '94), Oct. 26-29 2004, Dallas, Texas, USA , pp. 470-477. IEEE Computer Society Press.	inproceedings	DOI
BibTeX: @inproceedings{RosenbergSS1994, author = {Arnold L. Rosenberg and Vittorio Scarano and Ramesh K. Sitaraman}, title = {The reconfigurable ring of processors: fine-grained tree-structured computations}, booktitle = {Proceedings of 6th IEEE Symposium on Parallel and Distributed Processing (SPDP '94), Oct. 26-29 2004, Dallas, Texas, USA}, publisher = {IEEE Computer Society Press}, year = {1994}, pages = {470-477}, doi = {http://dx.doi.org/0.1109/SPDP.1994.346133} }
Scarano, V.	On the Sizes of Extended Fibonacci Cubes [Abstract] [BibTeX]	1999	IEEE Trans. Parallel Distrib. Syst. Vol. 10 (7) , pp. 764-766. IEEE Press.	article	DOI
Abstract: Hypercube is a popular interconnection network whose size must be a power of 2. Several interconnection networks have been proposed that do not suffer this limitation. Among them the extended Fibonacci cubes are based on the same sequence of the Fibonacci cubes and share many appealing structural properties. In this paper, we show how Extended Fibonacci Cubes can be seen as (Cartesian) product graphs whose components are hypercubes and Fibonacci Cubes. By exposing this property, we prove a conjecture that there are no distinct Extended Fibonacci Cubes (except the trivial ones) with the same number of nodes. Our result further validates the motivations behind the proposal of this interconnection network as a flexible alternative to hypercubes
BibTeX: @article{Scarano1999, author = {Vittorio Scarano}, title = {{On the Sizes of Extended Fibonacci Cubes}}, journal = {IEEE Trans. Parallel Distrib. Syst.}, publisher = {IEEE Press}, year = {1999}, volume = {10}, number = {7}, pages = {764--766}, doi = {http://dx.doi.org/10.1109/71.780869} }
Scarano, V.	Versatile Access to Parallel Memory Systems [BibTeX]	1998	Proceedings of 1st Workshop on Distributed Data & Structures (WDAS '98), Orlando, Florida, USA , pp. 65-83. Proceedings in Informatics (2). Carleton Scientific.	inproceedings
BibTeX: @inproceedings{Scarano98, author = {Vittorio Scarano}, title = {{Versatile Access to Parallel Memory Systems}}, booktitle = {Proceedings of 1st Workshop on Distributed Data \& Structures (WDAS '98), Orlando, Florida, USA}, publisher = {Carleton Scientific}, year = {1998}, pages = {65-83} }
	Proceedings of the 6th Eurographics Italian Chapter Conference [BibTeX]	2008	Eurographics Association.	proceedings
BibTeX: @proceedings{EGITAProceedings2008,, title = {Proceedings of the 6th Eurographics Italian Chapter Conference}, publisher = {Eurographics Association}, year = {2008} }
	Workshop Proceedings EC-TEL 2006 ``Exploring the potentials of networked-computing support for face-to-face collaborative learning'', 1st European Symposium on Technology Enhanced Learning, Creete, Greece, Oct. 1st 2006 [BibTeX]	2006	Utrecht University.	proceedings	URL
BibTeX: @proceedings{WorkshopEctelProceedings2006,, title = {Workshop Proceedings EC-TEL 2006 ``Exploring the potentials of networked-computing support for face-to-face collaborative learning'', 1st European Symposium on Technology Enhanced Learning, Creete, Greece, Oct. 1st 2006}, publisher = {Utrecht University}, year = {2006}, url = {http://cnm.open.ac.uk/projects/ectel06/pdfs/ECTEL06WS4d.pdf} }
Belgiorno, F., Malandrino, D., Manno, I., Palmieri, G. & Scarano, V.	Computer-Supported WebQuests [BibTeX]	2009	Proceedings of 4th European Conference on Technology Enhanced Learning (EC-TEL 2009), "Learning in the Synergy of Multiple Disciplines", Nice, France, September 29 - October 2, 2009 , pp. 712-718. Lecture Notes in Computer Science (5794). Springer.	inproceedings
BibTeX: @inproceedings{BelgiornoMMPS2009, author = {Furio Belgiorno and Delfina Malandrino and Ilaria Manno and Giuseppina Palmieri and Vittorio Scarano}, title = {Computer-Supported WebQuests}, booktitle = {Proceedings of 4th European Conference on Technology Enhanced Learning (EC-TEL 2009), "Learning in the Synergy of Multiple Disciplines", Nice, France, September 29 - October 2, 2009}, publisher = {Springer}, year = {2009}, pages = {712-718} }
Boccardo, A., De Chiara, R. & Scarano, V.	Massive Battle: Coordinated Movements of Autonomous Agents [BibTeX]	2009	Proceedings of Workshop on 3D Advanced Media In Gaming and Simulation (3AMIGAS) held in conjunction of the 22nd Annual Conference on Computer Animation and Social Agents (CASA 2009), Amsterdam - Netherlands, Jun. 17 - 19, 2009.	inproceedings	URL
BibTeX: @inproceedings{BoccardoDS2009, author = {Alberto Boccardo and Rosario {De Chiara} and Vittorio Scarano}, title = {{Massive Battle: Coordinated Movements of Autonomous Agents}}, booktitle = {Proceedings of Workshop on 3D Advanced Media In Gaming and Simulation (3AMIGAS) held in conjunction of the 22nd Annual Conference on Computer Animation and Social Agents (CASA 2009), Amsterdam - Netherlands, Jun. 17 - 19, 2009.}, year = {2009}, url = {http://www.focusk3d.eu/awg-gaming-simulation/awg-g-s-3amigas-workshop} }
Chiola, G., Cordasco, G., Gargano, L., Negro, A. & Scarano, V.	Degree-Optimal Routing for P2P Systems [Abstract] [BibTeX]	2009	Theory of Computing Systems Vol. 45 (1) , pp. 43-63.	article	DOI
Cordasco, G., Corte, F. D., Negro, A., Sala, A. & Scarano, V.	Relaxed-2-Chord: Efficiency, flexibility and provable stretch [BibTeX]	2009	Proceedings of 6th International Workshop on Hot Topics in Peer-to-Peer Systems (HOTP2P 2009), held in conjunction with the 23rd IEEE International Symposium on Parallel and Distributed Processing, IPDPS 2009, Rome, Italy, May 23-29, 2009 , pp. 1-8. IEEE.	inproceedings
BibTeX: @inproceedings{CordascoDNSS2009, author = {Gennaro Cordasco and Francesca Della Corte and Alberto Negro and Alessandra Sala and Vittorio Scarano}, title = {Relaxed-2-Chord: Efficiency, flexibility and provable stretch}, booktitle = {Proceedings of 6th International Workshop on Hot Topics in Peer-to-Peer Systems (HOTP2P 2009), held in conjunction with the 23rd IEEE International Symposium on Parallel and Distributed Processing, IPDPS 2009, Rome, Italy, May 23-29, 2009}, publisher = {IEEE}, year = {2009}, pages = {1-8} }
Cordasco, G., De Chiara, R., Erra, U. & Scarano, V.	Some Considerations on the Design of a P2P Infrastructure for Massive Simulations [BibTeX]	2009	Proceedings of International Conference on Ultra Modern Telecommunications (ICUMT '09), October 2009, St.-Petersburg, Russia	inproceedings
BibTeX: @inproceedings{CordascoDUS2009, author = {Gennaro Cordasco and Rosario {De Chiara} and Ugo Erra and Vittorio Scarano}, title = {{Some Considerations on the Design of a P2P Infrastructure for Massive Simulations}}, booktitle = {Proceedings of International Conference on Ultra Modern Telecommunications (ICUMT '09), October 2009, St.-Petersburg, Russia}, year = {2009} }
Cordasco, G., Gargano, L., Hammar, M., Negro, A. & Scarano, V.	F-Chord: Improved Uniform Routing on Chord [Abstract] [BibTeX]	2008	Networks Vol. 52 (4) , pp. 325-332.	article	DOI
Abstract: We propose a family of novel Chord-based P2P schemes retaining all positive aspects that made Chord a popular topology for routing in P2P networks. The schemes, based on the Fibonacci number system, allow to simultaneously improve on the maximum-average number of hops for lookups and the routing table size per node