commit 29fc0b1636fb2f6858d5f31a98197c168115016d
parent b7e2fa4fba8ce83d0cd6230a5f754347e7d569be
Author: ng0 <ng0@n0.is>
Date: Fri, 5 Jan 2018 19:22:37 +0000
braces yourselves
Diffstat:
1 file changed, 7 insertions(+), 8 deletions(-)
diff --git a/gnunetbib.bib b/gnunetbib.bib
@@ -15127,7 +15127,7 @@ Results based on simulations confirm that Overcast provides its added functional
pages = {115{\textendash}129},
publisher = {Springer-Verlag, LNCS 2009},
organization = {Springer-Verlag, LNCS 2009},
- abstract = {{We present the architecture, design issues and functions of a MIX-based system for anonymous and unobservable real-time Internet access. This system prevents traffic analysis as well as flooding attacks. The core technologies include an adaptive, anonymous, time/volumesliced channel mechanism and a ticket-based authentication mechanism. The system also provides an interface to inform anonymous users about their level of anonymity and unobservability.},
+ abstract = {{We present the architecture, design issues and functions of a MIX-based system for anonymous and unobservable real-time Internet access. This system prevents traffic analysis as well as flooding attacks. The core technologies include an adaptive, anonymous, time/volumesliced channel mechanism and a ticket-based authentication mechanism. The system also provides an interface to inform anonymous users about their level of anonymity and unobservability.}},
keywords = {anonymity, traffic analysis},
isbn = {978-3-540-41724-8},
doi = {10.1007/3-540-44702-4},
@@ -15144,8 +15144,7 @@ Results based on simulations confirm that Overcast provides its added functional
pages = {153{\textendash}164},
publisher = {ACM},
address = {New York, NY, USA},
- abstract = {{We describe a tool for compressing XML data, with applications in data exchange and archiving, which usually achieves about twice the compression ratio of gzip at roughly the same speed. The compressor, called XMill, incorporates and combines existing compressors in order to apply them to heterogeneous XML data: it uses zlib, the library function for gzip, a collection of datatype specific compressors for simple data types, and, possibly, user defined compressors for application specific data types.
-},
+ abstract = {{We describe a tool for compressing XML data, with applications in data exchange and archiving, which usually achieves about twice the compression ratio of gzip at roughly the same speed. The compressor, called XMill, incorporates and combines existing compressors in order to apply them to heterogeneous XML data: it uses zlib, the library function for gzip, a collection of datatype specific compressors for simple data types, and, possibly, user defined compressors for application specific data types.}},
keywords = {compression},
issn = {0163-5808},
doi = {10.1145/335191.335405},
@@ -15162,7 +15161,7 @@ Results based on simulations confirm that Overcast provides its added functional
pages = {63{\textendash}84},
publisher = {ACM Press},
address = {New York, NY, USA},
- abstract = {{In this work we examine the problem of efficient anonymous broadcast and reception in general communication networks. We show an algorithm which achieves anonymous communication with O(1) amortized communication complexity on each link and low computational complexity. In contrast, all previous solutions require polynomial (in the size of the network and security parameter) amortized communication complexity.},
+ abstract = {{In this work we examine the problem of efficient anonymous broadcast and reception in general communication networks. We show an algorithm which achieves anonymous communication with O(1) amortized communication complexity on each link and low computational complexity. In contrast, all previous solutions require polynomial (in the size of the network and security parameter) amortized communication complexity.}},
keywords = {anonymity, anonymous multicast, communication complexity},
isbn = {978-3-540-63384-6},
issn = {1094-9224},
@@ -15181,7 +15180,7 @@ Results based on simulations confirm that Overcast provides its added functional
publisher = {ACM},
organization = {ACM},
address = {Atlanta, Georgia, USA},
- abstract = {{We consider algorithmic problems in a distributed setting where the participants cannot be assumed to follow the algorithm but rather their own self-interest. As such participants, termed agents, are capable of manipulating the algorithm, the algorithm designer should ensure in advance that the agents {\textquoteright} interests are best served by behaving correctly. Following notions from the field of mechanism design, we suggest a framework for studying such algorithms. Our main technical contribution concerns the study of a representative task scheduling problem for which the standard mechanism design tools do not suffice. },
+ abstract = {{We consider algorithmic problems in a distributed setting where the participants cannot be assumed to follow the algorithm but rather their own self-interest. As such participants, termed agents, are capable of manipulating the algorithm, the algorithm designer should ensure in advance that the agents {\textquoteright} interests are best served by behaving correctly. Following notions from the field of mechanism design, we suggest a framework for studying such algorithms. Our main technical contribution concerns the study of a representative task scheduling problem for which the standard mechanism design tools do not suffice. }},
keywords = {algorithms, mechanis design},
isbn = {1-58113-067-8},
doi = {http://doi.acm.org/10.1145/301250.301287},
@@ -15201,7 +15200,7 @@ Results based on simulations confirm that Overcast provides its added functional
address = {Trier, Germany},
abstract = {{This paper considers algorithmic problems in a distributed setting where the participants cannot be assumed to follow the algorithm but rather their own self-interest. Such scenarios arise, in particular, when computers or users aim to cooperate or trade over the Internet. As such participants, termed agents, are capable of manipulating the algorithm, the algorithm designer should ensure in advance that the agents{\textquoteright} interests are best served by behaving correctly.
-This exposition presents a model to formally study such algorithms. This model, based on the field of mechanism design, is taken from the author{\textquoteright}s joint work with Amir Ronen, and is similar to approaches taken in the distributed AI community in recent years. Using this model, we demonstrate how some of the techniques of mechanism design can be applied towards distributed computation problems. We then exhibit some issues that arise in distributed computation which require going beyond the existing theory of mechanism design.},
+This exposition presents a model to formally study such algorithms. This model, based on the field of mechanism design, is taken from the author{\textquoteright}s joint work with Amir Ronen, and is similar to approaches taken in the distributed AI community in recent years. Using this model, we demonstrate how some of the techniques of mechanism design can be applied towards distributed computation problems. We then exhibit some issues that arise in distributed computation which require going beyond the existing theory of mechanism design.}},
keywords = {algorithms, mechanism design, selfish agent},
isbn = {3-540-65691-X},
url = {http://dl.acm.org/citation.cfm?id=1764891.1764893},
@@ -15218,7 +15217,7 @@ This exposition presents a model to formally study such algorithms. This model,
publisher = {MIT Press},
address = {Cambridge, MA, USA},
abstract = {{This article presents an overview of recent work on ant algorithms, that is, algorithms for discrete optimization that took inspiration from the observation of ant colonies{\textquoteright} foraging behavior, and introduces the ant colony optimization (ACO) metaheuristic. In the first part of the article the basic biological findings on real ants are reviewed and their artificial counterparts as well as the ACO metaheuristic are defined. In the second part of the article a number of applications of ACO algorithms to combinatorial optimization and routing in communications networks are described. We conclude with a discussion of related work and of some of the most important aspects of the ACO metaheuristic.},
- keywords = {ant colony optimization, metaheuristics, natural computation, swarm intelligence},
+ keywords = {ant colony optimization, metaheuristics, natural computation, swarm intelligence}},
issn = {1064-5462},
doi = {10.1162/106454699568728},
url = {http://portal.acm.org/citation.cfm?id=338955$\#$},
@@ -15233,7 +15232,7 @@ This exposition presents a model to formally study such algorithms. This model,
publisher = {USENIX Association},
organization = {USENIX Association},
address = {Berkeley, CA, USA},
- abstract = {{Burt is a freely distributed parallel network backup system written at the University of Wisconsin, Madison. It is designed to backup large heterogeneous networks. It uses the Tcl scripting language and standard backup programs like dump(1) and GNUTar to enable backups of a wide variety of data sources, including UNIX and Windows NT workstations, AFS based storage, and others. It also uses Tcl for the creation of the user interface, giving the system administrator great flexibility in customizing the system. Burt supports parallel backups to ensure high backup speeds, and checksums to ensure data integrity. The principal contribution of Burt is that it provides a powerful I/O engine within the context of a flexible scripting language; this combination enables graceful solutions to many problems associated with backups of large installations. At our site, we use Burt to backup data from 350 workstations and from our AFS servers, a total of approximately 900 GB every two weeks.},
+ abstract = {{Burt is a freely distributed parallel network backup system written at the University of Wisconsin, Madison. It is designed to backup large heterogeneous networks. It uses the Tcl scripting language and standard backup programs like dump(1) and GNUTar to enable backups of a wide variety of data sources, including UNIX and Windows NT workstations, AFS based storage, and others. It also uses Tcl for the creation of the user interface, giving the system administrator great flexibility in customizing the system. Burt supports parallel backups to ensure high backup speeds, and checksums to ensure data integrity. The principal contribution of Burt is that it provides a powerful I/O engine within the context of a flexible scripting language; this combination enables graceful solutions to many problems associated with backups of large installations. At our site, we use Burt to backup data from 350 workstations and from our AFS servers, a total of approximately 900 GB every two weeks.}},
keywords = {backup},
url = {http://portal.acm.org/citation.cfm?id=1039861$\#$},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.112.7612.pdf},
