Ernesto Damiani
Personal Homepage:
http://olaf.crema.unimi.itCurrent place of employment:
University of MilanErnesto Damiani is a professor at the Computer Technology Department of the University of Milan, Italy. His research interests include semi-structured information processing, secure software architectures and software engineering. Prof. Damiani holds/held visiting positions at several institutions including George Mason University, Fairfax, VA (US) and LaTrobe University, Melbourne (Australia).
Publications by Ernesto Damiani (bibliography)
Damiani, Ernesto, Marrara, Stefania and Pasi, Gabriella (2008): A flexible extension of XPath to improve XML querying. In: Proceedings of the 31st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval 2008. pp. 849-850.
“This work presents a flexible XML selection language, FleXPath which allows the formulation of flexible constraints on both structure and content of XML documents. Some experimental results, obtained with a preliminary prototype, are described in order to show that the idea promises good results.”
© All rights reserved Damiani et al. and/or ACM Press
Aringhieri, Roberto, Damiani, Ernesto, Vimercati, Sabrina De Capitani di, Paraboschi, Stefano and Samarati, Pierangela (2006): Fuzzy techniques for trust and reputation management in anonymous peer-to-peer systems. In JASIST - Journal of the American Society for Information Science and Technology, 57 (4) pp. 528-537.
Damiani, Ernesto, Vimercati, Sabrina De Capitani di, Paraboschi, Stefano, Samarati, Pierangela, Tironi, Andrea and Zaniboni, Luca (2004): Spam attacks: p2p to the rescue. In: Proceedings of the 2004 International Conference on the World Wide Web 2004. pp. 358-359.
“We propose a decentralized privacy-preserving approach to spam filtering. Our solution exploits robust digests to identify messages that are a slight variation of one another and a peer-to-peer architecture between mail servers to collaboratively share knowledge about spam.”
© All rights reserved Damiani et al. and/or ACM Press
Damiani, Ernesto, Vimercati, Sabrina De Capitani di and Samarati, Pierangela (2003): Managing Multiple and Dependable Identities. In IEEE Internet Computing, 7 (6) pp. 29-37.
Cornelli, Fabrizio, Damiani, Ernesto, Vimercati, Sabrina De Capitani di, Paraboschi, Stefano and Samarati, Pierangela (2002): Choosing reputable servents in a P2P network. In: Proceedings of the 2002 International Conference on the World Wide Web 2002. pp. 376-386.
“Peer-to-peer information sharing environments are increasingly gaining acceptance on the Internet as they provide an infrastructure in which the desired information can be located and downloaded while preserving the anonymity of both requestors and providers. As recent experience with P2P environments such as Gnutella shows, anonymity opens the door to possible misuses and abuses by resource providers exploiting the network as a way to spread tampered with resources, including malicious programs, such as Trojan Horses and viruses. In this paper we propose an approach to P2P security where servents can keep track, and share with others, information about the reputation of their peers. Reputation sharing is based on a distributed polling algorithm by which resource requestors can assess the reliability of perspective providers before initiating the download. The approach nicely complements the existing P2P protocols and has a limited impact on current implementations. Furthermore, it keeps the current level of anonymity of requestors and providers, as well as that of the parties sharing their view on others' reputations.”
© All rights reserved Cornelli et al. and/or ACM Press
Khosla, Rajiv, Sethi, Ishwar K and Damiani, Ernesto (2001): Intelligent multimedia multi-agent systems: a human-centered approach. Kluwer Academic Publishers
Comai, Sara, Damiani, Ernesto and Fraternali, Piero (2001): Computing graphical queries over XML data. In ACM Transactions on Information Systems, 19 (4) pp. 371-430.
“The rapid evolution of XML from a mere data exchange format to a universal syntax for encoding domain-specific information raises the need for new query languages specifically conceived to address the characteristics of XML. Such languages should be able not only to extract information from XML documents, but also to apply powerful transformation and restructuring operators, based on a well-defined semantics. Moreover, XML queries should be natural to write and understand, as nontechnical persons also are expected to access the large XML information bases supporting their businesses. This article describes XML-GL, a graphical query language for XML data. XML-GL's uniqueness is in the definition of a graph-based syntax to express a wide variety of XML queries, ranging from simple selections to expressive data transformations involving grouping, aggregation, and arithmetic calculations. XML-GL has an operational semantics based on the notion of graph matching, which serves as a guideline both for the implementation of native processors, and for the adoption of XML-GL as a front-end to any of the XML query languages that are presently under discussion as the standard paradigm for querying XML data.”
© All rights reserved Comai et al. and/or ACM Press
Damiani, Ernesto, Samarati, Pierangela, Vimercati, Sabrina De Capitani di and Paraboschi, Stefano (2001): Controlling Access to XML Documents. In IEEE Internet Computing, 5 (6) pp. 18-28.
Damiani, Ernesto, Vimercati, Sabrina De Capitani di, Paraboschi, Stefano and Samarati, Pierangela (2001): Fine grained access control for SOAP E-services. In: Proceedings of the 2001 International Conference on the World Wide Web 2001. pp. 504-513.
Damiani, Ernesto, Fugini, Maria Grazia and Fusaschi, Enrico (1997): A Descriptor-Based Approach to OO Code Reuse. In IEEE Computer, 30 (10) pp. 73-80.
Show this list on your homepage
Knowledge wants to be free !
We have decided to give away world-class educational materials
because we believe that universal access to high quality education is key to the building
of peace, sustainable social and economic development, and intercultural dialogue.
To calculate just have much we have saved you, our wonderful readers, we compare our free encyclopedia to two
books we love:
$110: Human-Computer Interaction by Dix et al (a great textbook but without video interviews)
$116: Shneiderman's Designing the User Interface
(a great textbook but without video interviews).
As you are reading our encyclopedia on your iPad/tablet (and saving a few trees), we estimate that the price would be $90 if sold as an eBook.
With that number, we can calculate how much money we have saved our readers, based on calculating the number of readers.
How we calculate readership
Because of our online and tablet/iPad approach to publishing, we are able to precisely measure reading behaviour across hundreds of parameters in realtime: Anything from reading
speed, drop-off points in the text, reader demographics, and much more.
Based on our server logs and the Google Analytics API,
we calculate the number of readers as described in the calculation method below.
A reader is not the same as a simple pageview and a reader is not the same as a
website visitor (as described in our calculation method below).
We calculate readership for two types of readers:
- Readers that have read our whole encyclopedia, much the same way you read a printed book
- Readers that have reader an individual chapter
Calcalution method: How we define a reader
- First we use the Google Analytics API to get a report of the number of unique human visitors to a chapter/page. Google runs its business on ads and thus completely relies on the ability to distinguish between a human visitor and an automated request. If not, you could earn millions on automating clicks on Google Ads.
- We then compare that number to our Apache webserver logs, which report the much higher number of actual visits to a chapter/page (both human and automated). We calculate the difference in percent, which we call an "exaggeration factor", which we use in step 6 below.
- With a large part of the visitors excluded, we further exclude any visitor who:
- has not remained on the page for at least 3 minutes (this factor is calculated by recording visit durations of 1000 randomly selected visitors) or has not printed the page (i.e. has not visited the printerfriendly version of the chapter/page)
- has not scrolled the page (this factor is calculated by recording scroll movements on 1000 randomly selected visitors)
- We then further exclude "double readers", i.e. readers who read a portion of a chapter and then returns in,
say, a week or a month to read the rest.
Although this person's reading activity spans multiple server sessions, the person is only counted as a single reader.
We categorize a "double reader" as a visitor who:
- visits a page, or multiple pages, across multiple server sessions
- qualifies to be defined as a reader, cf step 1-3 above, in all server sessions
- uses the same originating IP address
- We then subtract 5% from the final number to counter-balance a last remaining factor, namely the situation where one reader reads a chapter on his/her tablet
using a WiFi connection (and counted as one reader) but then picks up his other tablet using a 3G dongle
(with another IP address) and re-reads some of the chapter. That will equal two readers, not one. We have no way
of calculating how many times this situation arises, but to be on the safe side we subtract 5%
from the final number.
- We then take half of the "exaggeration factor" from step 2 and substract from the final number. We do this for no rational reason. We do it only as a further measure to be certain that our number of readers is not inflated.
- To qualify as a reader who has read our whole encyclopedia - much the same way you read a printed book - that person must have qualified as a reader (cf. 1-6 above) of at least 80% of the encyclopedia chapters.
As a result, we have eliminated everything from automated requests to the more casual visitors. That leaves us with what we can safely call readers.
Changes to this page (author)
24 Feb 2010: Enabled abstracts to be shown on Ernesto Damiani's author page.09 Jul 2009: Author was edited 09 Jul 2009: Author was edited
09 Jul 2009: Author was edited
02 Jun 2009: Author was edited
02 Jun 2009: Author was edited
01 Jun 2009: Author was edited
31 May 2009: Author was edited
08 Apr 2009: Author was edited
28 Apr 2003: Added the author to the bibliography
Page Information
Page maintainer:
The Editorial TeamHow to cite/reference this page
URL: http://www.interaction-design.org/references/authors/ernesto_damiani.html
