commit d1281299e1fdb834b0f2c9fb8f2df023893e10db
parent f537b22bb3a44cda18d9f8694f2bde728e78dfef
Author: ng0 <ng0@n0.is>
Date: Fri, 5 Jan 2018 19:15:08 +0000
braces yourselves
Diffstat:
1 file changed, 12 insertions(+), 13 deletions(-)
diff --git a/gnunetbib.bib b/gnunetbib.bib
@@ -15861,7 +15861,7 @@ in the communication chain. This implies that neither the respondent nor his pro
address = {Berkeley, CA, USA},
abstract = {{Network Appliance Corporation recently began shipping a new kind of network server called an NFS file server appliance, which is a dedicated server whose sole function is to provide NFS file service. The file system requirements for an NFS appliance are different from those for a general-purpose UNIX system, both because an NFS appliance must be optimized for network file access and because an appliance must be easy to use.
-This paper describes WAFL (Write Anywhere File Layout), which is a file system designed specifically to work in an NFS appliance. The primary focus is on the algorithms and data structures that WAFL uses to implement Snapshotst, which are read-only clones of the active file system. WAFL uses a copy-on-write technique to minimize the disk space that Snapshots consume. This paper also describes how WAFL uses Snapshots to eliminate the need for file system consistency checking after an unclean shutdown.},
+This paper describes WAFL (Write Anywhere File Layout), which is a file system designed specifically to work in an NFS appliance. The primary focus is on the algorithms and data structures that WAFL uses to implement Snapshotst, which are read-only clones of the active file system. WAFL uses a copy-on-write technique to minimize the disk space that Snapshots consume. This paper also describes how WAFL uses Snapshots to eliminate the need for file system consistency checking after an unclean shutdown.}},
url = {http://portal.acm.org/citation.cfm?id=1267093$\#$},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.40.3691.pdf},
author = {Hitz, Dave and Lau, James and Malcolm, Michael}
@@ -15871,7 +15871,7 @@ This paper describes WAFL (Write Anywhere File Layout), which is a file system d
booktitle = {USENIX WINTER 1994 TECHNICAL CONFERENCE},
year = {1994},
pages = {1{\textendash}10},
- abstract = {{We present a tool, called sif, for finding all similar files in a large file system. Files are considered similar if they have significant number of common pieces, even if they are very different otherwise. For example, one file may be contained, possibly with some changes, in another file, or a file may be a reorganization of another file. The running time for finding all groups of similar files, even for as little as 25\% similarity, is on the order of 500MB to 1GB an hour. The amount of similarity and several other customized parameters can be determined by the user at a post-processing stage, which is very fast. Sif can also be used to very quickly identify all similar files to a query file using a preprocessed index. Application of sif can be found in file management, information collecting (to remove duplicates), program reuse, file synchronization, data compression, and maybe even plagiarism detection. 1. Introduction Our goal is to identify files that came from the same source },
+ abstract = {{We present a tool, called sif, for finding all similar files in a large file system. Files are considered similar if they have significant number of common pieces, even if they are very different otherwise. For example, one file may be contained, possibly with some changes, in another file, or a file may be a reorganization of another file. The running time for finding all groups of similar files, even for as little as 25\% similarity, is on the order of 500MB to 1GB an hour. The amount of similarity and several other customized parameters can be determined by the user at a post-processing stage, which is very fast. Sif can also be used to very quickly identify all similar files to a query file using a preprocessed index. Application of sif can be found in file management, information collecting (to remove duplicates), program reuse, file synchronization, data compression, and maybe even plagiarism detection. 1. Introduction Our goal is to identify files that came from the same source }},
url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.12.3222},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.12.3222.pdf},
author = {Udi Manber}
@@ -15881,7 +15881,7 @@ This paper describes WAFL (Write Anywhere File Layout), which is a file system d
year = {1994},
publisher = {University of Tennessee},
address = {Knoxville, TN, USA},
- abstract = {{Checkpointing is a simple technique for rollback recovery: the state of an executing program is periodically saved to a disk file from which it can be recovered after a failure. While recent research has developed a collection of powerful techniques for minimizing the overhead of writing checkpoint files, checkpointing remains unavailable to most application developers. In this paper we describe libckpt, a portable checkpointing tool for Unix that implements all applicable performance optimizations which are reported in the literature. While libckpt can be used in a mode which is almost totally transparent to the programmer, it also supports the incorporation of user directives into the creation of checkpoints. This user-directed checkpointing is an innovation which is unique to our work. 1 Introduction Consider a programmer who has developed an application which will take a long time to execute, say five days. Two days into the computation, the processor on which the application is...},
+ abstract = {{Checkpointing is a simple technique for rollback recovery: the state of an executing program is periodically saved to a disk file from which it can be recovered after a failure. While recent research has developed a collection of powerful techniques for minimizing the overhead of writing checkpoint files, checkpointing remains unavailable to most application developers. In this paper we describe libckpt, a portable checkpointing tool for Unix that implements all applicable performance optimizations which are reported in the literature. While libckpt can be used in a mode which is almost totally transparent to the programmer, it also supports the incorporation of user directives into the creation of checkpoints. This user-directed checkpointing is an innovation which is unique to our work. 1 Introduction Consider a programmer who has developed an application which will take a long time to execute, say five days. Two days into the computation, the processor on which the application is...}},
keywords = {checkpointing, performance analysis},
url = {http://portal.acm.org/citation.cfm?id=898770$\#$},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.55.257.pdf},
@@ -15894,7 +15894,7 @@ This paper describes WAFL (Write Anywhere File Layout), which is a file system d
year = {1993},
month = {02/1993},
pages = {119-137},
- abstract = {{We report market experiments in which human traders are replaced by "zero-intelligence" programs that submit random bids and offers. Imposing a budget constraint (i.e., not permitting traders to sell below their costs or buy above their values) is sufficient to raise the allocative efficiency of these auctions close to 100 percent. Allocative efficiency of a double auction derives largely from its structure, independent of traders{\textquoteright} motivation, intelligence, or learning. Adam Smith{\textquoteright}s invisible hand may be more powerful than some may have thought; it can generate aggregate rationality not only from individual rationality but also from individual irrationality.},
+ abstract = {{We report market experiments in which human traders are replaced by "zero-intelligence" programs that submit random bids and offers. Imposing a budget constraint (i.e., not permitting traders to sell below their costs or buy above their values) is sufficient to raise the allocative efficiency of these auctions close to 100 percent. Allocative efficiency of a double auction derives largely from its structure, independent of traders{\textquoteright} motivation, intelligence, or learning. Adam Smith{\textquoteright}s invisible hand may be more powerful than some may have thought; it can generate aggregate rationality not only from individual rationality but also from individual irrationality.}},
keywords = {allocative efficiency, double auction, market, zero-intelligence trader},
url = {http://www.jstor.org/stable/2138676},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/JPE\%20\%281993\%29\%20-\%20Gode\%20\%26\%20Sunder\%20-\%20Allocative\%20Efficiency.pdf},
@@ -15922,7 +15922,7 @@ This paper describes WAFL (Write Anywhere File Layout), which is a file system d
publisher = {Springer-Verlag, LNCS 765},
organization = {Springer-Verlag, LNCS 765},
address = {Lofthus, Norway},
- abstract = {{The contribution of this paper are twofold. First, we present an efficient computationally secure anonymous channel which has no problme of ciphertext length expansion. The length is irrelevant to the number of MIXes(control centers). It improves the efficiency of Chaums{\textquoteright}s election scheme based on the MIX net automatically. Second, we show an election scheme which satisfies fairness. That is, if some vote is disrupted, no one obtains any infromation about all the other votes. Each voter sends O(nk) bits so that the probability of the fairness is 1-2^-k, where n is the bit length of the ciphertext.},
+ abstract = {{The contribution of this paper are twofold. First, we present an efficient computationally secure anonymous channel which has no problme of ciphertext length expansion. The length is irrelevant to the number of MIXes(control centers). It improves the efficiency of Chaums{\textquoteright}s election scheme based on the MIX net automatically. Second, we show an election scheme which satisfies fairness. That is, if some vote is disrupted, no one obtains any infromation about all the other votes. Each voter sends O(nk) bits so that the probability of the fairness is 1-2^-k, where n is the bit length of the ciphertext.}},
isbn = {3-540-57600-2},
url = {http://portal.acm.org/citation.cfm?id=188307.188351},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/mix.pdf},
@@ -15938,7 +15938,7 @@ This paper describes WAFL (Write Anywhere File Layout), which is a file system d
organization = {Springer},
abstract = {{Elliptic curves have been intensively studied in algebraic geometry and number theory. In recent years they have been used in devising efficient algorithms for factoring integers and primality proving, and in the construction of public key cryptosystems.
Elliptic Curve Public Key Cryptosystems provides an up-to-date and self-contained treatment of elliptic curve-based public key cryptology. Elliptic curve cryptosystems potentially provide equivalent security to the existing public key schemes, but with shorter key lengths. Having short key lengths means smaller bandwidth and memory requirements and can be a crucial factor in some applications, for example the design of smart card systems. The book examines various issues which arise in the secure and efficient implementation of elliptic curve systems.
-Elliptic Curve Public Key Cryptosystems is a valuable reference resource for researchers in academia, government and industry who are concerned with issues of data security. Because of the comprehensive treatment, the book is also suitable for use as a text for advanced courses on the subject.},
+Elliptic Curve Public Key Cryptosystems is a valuable reference resource for researchers in academia, government and industry who are concerned with issues of data security. Because of the comprehensive treatment, the book is also suitable for use as a text for advanced courses on the subject.}},
keywords = {algebraic geometry, elliptic curve cryptography, number theory, public key cryptosystem},
isbn = {978-0-7923-9368-9},
url = {http://books.google.com/books/about/Elliptic_curve_public_key_cryptosystems.html?id=bIb54ShKS68C},
@@ -15947,7 +15947,7 @@ Elliptic Curve Public Key Cryptosystems is a valuable reference resource for res
@booklet {Liedtke93apersistent,
title = {A Persistent System in Real Use - Experiences of the First 13 Years},
year = {1993},
- abstract = {{Eumel and its advanced successor L3 are operating systems built by GMD which have been used, for 13 years and 4 years respectively, as production systems in business and education. More than 2000 Eumel systems and 500 L3 systems have been shipped since 1979 and 1988. Both systems rely heavily on the paradigm of persistence (including fault-surviving persistence). Both data and processes, in principle all objects are persistent, files are implemented by means of persistent objects (not vice versa) etc. In addition to the principles and mechanisms of Eumel /L3, general and specific experiences are described: these relate to the design, implementation and maintenance of the systems over the last 13 years. For general purpose timesharing systems the idea is powerful and elegant, it can be efficiently implemented, but making a system really usable is hard work.},
+ abstract = {{Eumel and its advanced successor L3 are operating systems built by GMD which have been used, for 13 years and 4 years respectively, as production systems in business and education. More than 2000 Eumel systems and 500 L3 systems have been shipped since 1979 and 1988. Both systems rely heavily on the paradigm of persistence (including fault-surviving persistence). Both data and processes, in principle all objects are persistent, files are implemented by means of persistent objects (not vice versa) etc. In addition to the principles and mechanisms of Eumel /L3, general and specific experiences are described: these relate to the design, implementation and maintenance of the systems over the last 13 years. For general purpose timesharing systems the idea is powerful and elegant, it can be efficiently implemented, but making a system really usable is hard work.}},
url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.53.7112},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.53.7112.pdf},
author = {Jochen Liedtke}
@@ -15955,7 +15955,7 @@ Elliptic Curve Public Key Cryptosystems is a valuable reference resource for res
@conference {1993,
title = {SURF-2: A program for dependability evaluation of complex hardware and software systems},
year = {1993},
- abstract = {{SURF-2, a software tool for evaluating system dependability, is described. It is especially designed for an evaluation-based system design approach in which multiple design solutions need to be compared from the dependability viewpoint. System behavior may be modeled either by Markov chains or by generalized stochastic Petri nets. The tool supports the evaluation of different measures of dependability, including pointwise measures, asymptotic measures, mean sojourn times and, by superposing a reward structure on the behavior model, reward measures such as expected performance or cost},
+ abstract = {{SURF-2, a software tool for evaluating system dependability, is described. It is especially designed for an evaluation-based system design approach in which multiple design solutions need to be compared from the dependability viewpoint. System behavior may be modeled either by Markov chains or by generalized stochastic Petri nets. The tool supports the evaluation of different measures of dependability, including pointwise measures, asymptotic measures, mean sojourn times and, by superposing a reward structure on the behavior model, reward measures such as expected performance or cost}},
isbn = {0-8186-3680-7 },
doi = {10.1109/FTCS.1993.627372 },
url = {http://www.pubzone.org/dblp/conf/ftcs/BeoumesKALAMBS93}
@@ -15971,7 +15971,7 @@ Elliptic Curve Public Key Cryptosystems is a valuable reference resource for res
publisher = {Springer},
organization = {Springer},
address = {Balatonf{\"u}red, Hungary},
- abstract = {{All known methods for transferring electronic money have the disadvantages that the number of bits needed to represent the money after each payment increases, and that a payer can recognize his money if he sees it later in the chain of payments (forward traceability). This paper shows that it is impossible to construct an electronic money system providing transferability without the property that the money grows when transferred. Furthermore it is argued that an unlimited powerful user can always recognize his money later. Finally, the lower bounds on the size of transferred electronic money are discussed in terms of secret sharing schemes.},
+ abstract = {{All known methods for transferring electronic money have the disadvantages that the number of bits needed to represent the money after each payment increases, and that a payer can recognize his money if he sees it later in the chain of payments (forward traceability). This paper shows that it is impossible to construct an electronic money system providing transferability without the property that the money grows when transferred. Furthermore it is argued that an unlimited powerful user can always recognize his money later. Finally, the lower bounds on the size of transferred electronic money are discussed in terms of secret sharing schemes.}},
keywords = {electronic money, forward traceability, secret shraing, transfer},
isbn = {3-540-56413-6},
doi = {10.1007/3-540-47555-9_32},
@@ -15986,8 +15986,7 @@ Elliptic Curve Public Key Cryptosystems is a valuable reference resource for res
institution = {University of Michigan},
type = {Tech report},
address = {Ann Arbor, MI, United States},
- abstract = {{In this paper, we argue that partially adversarial and partially cooperative (PARC) problems in distributed arti cial intelligence can be mapped into a formalism called distributed constraint optimization problems (DCOPs), which generalize distributed constraint satisfaction problems [Yokoo, et al. 90] by introducing weak constraints (preferences). We discuss several solution criteria for DCOP and clarify the relation between these criteria and di erent levels of agent rationality [Rosenschein and Genesereth 85], and show the algorithms for solving DCOPs in which agents incrementally exchange only necessary information to converge on a mutually satis able bsolution.
-},
+ abstract = {{In this paper, we argue that partially adversarial and partially cooperative (PARC) problems in distributed arti cial intelligence can be mapped into a formalism called distributed constraint optimization problems (DCOPs), which generalize distributed constraint satisfaction problems [Yokoo, et al. 90] by introducing weak constraints (preferences). We discuss several solution criteria for DCOP and clarify the relation between these criteria and di erent levels of agent rationality [Rosenschein and Genesereth 85], and show the algorithms for solving DCOPs in which agents incrementally exchange only necessary information to converge on a mutually satis able bsolution.}},
keywords = {artificial intelligence, DCOP, PARC, partially adversial cooperation},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Tech\%20report\%20-\%20DCOP\%20as\%20a\%20formal\%20model\%20of\%20PARC.pdf},
author = {Makoto Yokoo and Edmund H. Durfee}
@@ -15997,7 +15996,7 @@ Elliptic Curve Public Key Cryptosystems is a valuable reference resource for res
booktitle = {In Proceedings of the IEEE Symposium on Research in Security and Privacy},
year = {1991},
pages = {110{\textendash}121},
- abstract = {{An intrusion-tolerant distributed system is a system which is designed so that any intrusion into apart of the system will not endanger confidentiality, integrity and availability. This approach is suitable for distributed systems, because distribution enables isolation of elements so that an intrusion gives physical access to only a part of the system. By intrusion, we mean not only computer break-ins by non-registered people, but also attempts by registered users to exceed or to abuse their privileges. In particular, possible malice of security administrators is taken into account. This paper describes how some functions of distributed systems can be designed to tolerate intrusions, in particular security functions such as user authentication and authorization, and application functions such as file management.},
+ abstract = {{An intrusion-tolerant distributed system is a system which is designed so that any intrusion into apart of the system will not endanger confidentiality, integrity and availability. This approach is suitable for distributed systems, because distribution enables isolation of elements so that an intrusion gives physical access to only a part of the system. By intrusion, we mean not only computer break-ins by non-registered people, but also attempts by registered users to exceed or to abuse their privileges. In particular, possible malice of security administrators is taken into account. This paper describes how some functions of distributed systems can be designed to tolerate intrusions, in particular security functions such as user authentication and authorization, and application functions such as file management.}},
url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.56.9968},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.56.9968.pdf},
author = {Yves Deswarte and Laurent Blain and Jean-charles Fabre}
@@ -16010,7 +16009,7 @@ Elliptic Curve Public Key Cryptosystems is a valuable reference resource for res
pages = {451{\textendash}463},
publisher = {Springer-Verlag London, UK},
organization = {Springer-Verlag London, UK},
- abstract = {{Untraceable communication for services like telephony is often considered infeasible in the near future because of bandwidth limitations. We present a technique, called ISDN-MIXes, which shows that this is not the case. As little changes as possible are made to the narrowband-ISDN planned by the PTTs. In particular, we assume the same subscriber lines with the same bit rate, and the same long-distance network between local exchanges, and we offer the same services. ISDN-MIXes are a combination of a new variant of CHAUM{\textquoteright}s MIXes, dummy traffic on the subscriber lines (where this needs no additional bandwidth), and broadcast of incoming-call messages in the subscriber-area.},
+ abstract = {{Untraceable communication for services like telephony is often considered infeasible in the near future because of bandwidth limitations. We present a technique, called ISDN-MIXes, which shows that this is not the case. As little changes as possible are made to the narrowband-ISDN planned by the PTTs. In particular, we assume the same subscriber lines with the same bit rate, and the same long-distance network between local exchanges, and we offer the same services. ISDN-MIXes are a combination of a new variant of CHAUM{\textquoteright}s MIXes, dummy traffic on the subscriber lines (where this needs no additional bandwidth), and broadcast of incoming-call messages in the subscriber-area.}},
isbn = {3-540-53721-X},
url = {http://portal.acm.org/citation.cfm?id=645662.664536},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.43.4892.pdf},
