Results 1  10
of
15
CostAware WWW Proxy Caching Algorithms
 IN PROCEEDINGS OF THE 1997 USENIX SYMPOSIUM ON INTERNET TECHNOLOGY AND SYSTEMS
, 1997
"... Web caches can not only reduce network traffic and downloading latency, but can also affect the distribution of web traffic over the network through costaware caching. This paper introduces GreedyDualSize, which incorporates locality with cost and size concerns in a simple and nonparameterized fash ..."
Abstract

Cited by 470 (6 self)
 Add to MetaCart
Web caches can not only reduce network traffic and downloading latency, but can also affect the distribution of web traffic over the network through costaware caching. This paper introduces GreedyDualSize, which incorporates locality with cost and size concerns in a simple and nonparameterized fashion for high performance. Tracedriven simulations show that with the appropriate cost definition, GreedyDualSize outperforms existing web cache replacement algorithms in many aspects, including hit ratios, latency reduction and network cost reduction. In addition, GreedyDualSize can potentially improve the performance of mainmemory caching of Web documents.
Deniable Encryption
 In Proceedings of CRYPTO
, 1997
"... Abstract. Consider a situation in which the transmission of encrypted messages is intercepted by an adversary who can later ask the sender to reveal the random choices (and also the secret key, if one exists) used in generating the ciphertext, thereby exposing the cleartext. An encryption scheme is ..."
Abstract

Cited by 53 (8 self)
 Add to MetaCart
Abstract. Consider a situation in which the transmission of encrypted messages is intercepted by an adversary who can later ask the sender to reveal the random choices (and also the secret key, if one exists) used in generating the ciphertext, thereby exposing the cleartext. An encryption scheme is deniable if the sender can generate ‘fake random choices ’ that will make the ciphertext ‘look like ’ an encryption of a different cleartext, thus keeping the real cleartext private. Analogous requirements can be formulated with respect to attacking the receiver and with respect to attacking both parties. Deniable encryption has several applications: It can be incorporated in current protocols for incoercible (“receiptfree”) voting, in a way that eliminates the need for physically secure communication channels. It also underlies recent protocols for general incoercible multiparty computation (with no physical security assumptions). Deniable encryption also provides a simplified and elegant construction of an adaptively secure multiparty protocol. In this paper we introduce and define deniable encryption and propose constructions of such schemes. Our constructions, while demonstrating that deniability is obtainable in principle, achieve only a limited level of it. Whether they can be improved is an interesting open problem. 1
Page replacement with multisize pages and applications to Web caching
 in 29th ACM STOC
, 1997
"... We consider the paging problem where the pages have varying size. This problem has applications to page replacement policies for caches containing World Wide Web documents. We consider two models for the cost of an algorithm on a request sequence. In the rst, (the Fault model) the goal is to minimiz ..."
Abstract

Cited by 16 (0 self)
 Add to MetaCart
We consider the paging problem where the pages have varying size. This problem has applications to page replacement policies for caches containing World Wide Web documents. We consider two models for the cost of an algorithm on a request sequence. In the rst, (the Fault model) the goal is to minimize the number of page faults. In the second, (the Bit model) the goal is to minimize the total numberofbitsthathave tobereadinto the cache. We show o ine algorithms for both cost models that obtain approximation factors of O(log k), where k is the ratio of the size of the cache to the size of the smallest page. We show randomized online algorithms for both cost models that are O(log 2 k)competitive. In addition, if the input sequence is generated by aknown distribution, we show an algorithm for the Fault model whose expected cost is within a factor of O(log k) ofany other online algorithm. 1
Games Computers Play: GameTheoretic Aspects of Computing
 In
, 1992
"... this article is on protocols allowing the wellfunctioning parts of such a large and complex system to carry out their work despite the failure of others. Many deep and interesting results on such problems have been discovered by computer scientists in recent years, the incorporation of which into g ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
this article is on protocols allowing the wellfunctioning parts of such a large and complex system to carry out their work despite the failure of others. Many deep and interesting results on such problems have been discovered by computer scientists in recent years, the incorporation of which into game theory can greatly enrich this field
Improved Bounds on the Word Error Probability of RA(2) Codes with Linear Programming Based Decoding
, 2003
"... This paper deals with the linear programming based decoding algorithm of Feldman and Karger [FK02] for RepeatAccumulate "Turbolike" codes. We present a new structural characterization that captures the event that decoding fails. Based on this structural characterization, we develop polynomial a ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
This paper deals with the linear programming based decoding algorithm of Feldman and Karger [FK02] for RepeatAccumulate "Turbolike" codes. We present a new structural characterization that captures the event that decoding fails. Based on this structural characterization, we develop polynomial algorithms that, given an RA(2) code, compute upper and lower bounds on the word error probability Pw for the binary symmetric channel and the AWGN channel. Our experiments with an implementation of these algorithms for bounding Pw demonstrate in many interesting cases an improvement in the upper bound on the word error probability by a factor of over 1000 compared to the bounds by Feldman et al. [FK02, FKW02, F03a, F03b]. The experiments also indicate that the improvement in upper bound increases as the codeword length increases and the channel noise decreases. The computed lower bounds on the word error probability in our experiments are roughly 10 times smaller than the upper bound.
Mooij, “Engineering decoherence in Josephson persistentcurrent qubits. Measurement apparatus and other electromagnetic environments,” Eur
 Phys. J. B
, 2003
"... apparatus and other electromagnetic environments ..."
Programmable, HighDynamic Range SigmaDelta A/D Converter for Multistandard, FullyIntegrated CMOS RF Receiver
, 1998
"... A major focus of recent RF transceiver IC designs has been to increase both the integration and adaptability to multiple RF communication standards. Performing channel selection on chip at baseband allows the use of highintegration receiver architectures, and enhances programmability to different c ..."
Abstract
 Add to MetaCart
A major focus of recent RF transceiver IC designs has been to increase both the integration and adaptability to multiple RF communication standards. Performing channel selection on chip at baseband allows the use of highintegration receiver architectures, and enhances programmability to different channel bandwidths and dynamic range requirements of multiple RF standards. A wideband, highdynamic range sigmadelta modulator can be used to digitize both the desired signal and potentially stronger adjacentchannel interferers. In the digital domain, the decimation filter following the ADC can be easily made programmable. A 4thorder sigmadelta ADC which is capable of adapting to GSM (cellular) and DECT (cordless) communication standards is described. The ADC achieves 14 bits of resolution at 128x oversampling ratio (200kS/s Nyquist rate) for GSM, and 12 bits of i resolution at 32x oversampling ratio (1.4MS/s Nyquist rate) for DECT. Power reduction strategies are developed at both the sigmadelta architecture and circuit design levels. The experimental prototype, fabricated in a 0.35μm CMOS process, dissipates 70mW from a 3.3V supply.
Deniable Encryption
 In Crypto ’97
, 1996
"... Consider a situation in which the transmission of encrypted messages is intercepted by an adversary who can later ask the sender to reveal the random choices (and also the secret key, if one exists) used in generating the ciphertext, thereby exposing the cleartext. An encryption scheme is deniable ..."
Abstract
 Add to MetaCart
Consider a situation in which the transmission of encrypted messages is intercepted by an adversary who can later ask the sender to reveal the random choices (and also the secret key, if one exists) used in generating the ciphertext, thereby exposing the cleartext. An encryption scheme is deniable if the sender can generate `fake random choices' that will make the ciphertext `look like' an encryption of a different cleartext, thus keeping the real cleartext private. Analogous requirements can be formulated with respect to attacking the receiver and with respect to attacking both parties. In this paper we introduce deniable encryption and propose constructions of schemes with polynomial deniability. In addition to being interesting by itself, and having several applications, deniable encryption provides a simplified and elegant construction of adaptively secure multiparty computation. 1
DEUTERON COMPTON SCATTERING BELOW PION PHOTOPRODUCTION THRESHOLD
, 1998
"... Deuteron Compton scattering below pion photoproduction threshold is considered in the framework of the nonrelativistic diagrammatic approach with the Bonn OBE potential. The complete gaugeinvariant set of diagrams is taken into account which includes resonance diagrams without and with rescatterin ..."
Abstract
 Add to MetaCart
Deuteron Compton scattering below pion photoproduction threshold is considered in the framework of the nonrelativistic diagrammatic approach with the Bonn OBE potential. The complete gaugeinvariant set of diagrams is taken into account which includes resonance diagrams without and with rescattering and diagrams with one and twobody seagulls. The obtained results are compared with predictions of other models and with experimental data. A possibility of determining isospinaveraged electromagnetic polarizabilities of the nucleon is discussed. The electric αN and magnetic βN polarizabilities of the nucleon are structure parameters characterizing the ability of the nucleon to be deformed in external electromagnetic fields. In the case of the proton, the polarizabilities have been successfully measured in lowenergy γpscattering. The polarizabilities of the neutron have so far been measured only in lowenergy experiments on neutron transmission by the lead and on quasifree Compton scattering off deuterons, both giving not very certain results. Elastic γdscattering provides another attractive option for measurements. In the present work we consider the amplitude of this process in the framework of the nonrelativistic diagrammatic approach which consistently takes into account electromagnetic interactions of nucleons and those mesons which determine NN interaction in the deuteron, as contained in the nonrelativistic versions of the Bonn OBE potential 1,2. In such an approach, the total γdscattering amplitude consists of the resonance and seagull parts. The resonance part is determined by two deuteron photodisintegration amplitudes of γd → pn and pn → γ ′ d ′ , which are taken from Ref. 3 with the relativistic spinorbit correction included, and by the full Tmatrix of rescattering the intermediate offshell nucleons. The seagull operator, which involves both photons together, consists of onebody parts (they are the Thomson term, a term with the nucleon polarizabilities, and a 1 ( nb/ sr) / d
AVIAN TUMOR VIRUS
"... Thymus glands of chicks with leukemia induced by BAI strain A (myeloblastosis) virus were fixed in cold 4 per cent formaldehydesucrose. Frozen sections were incubated in the ATPase medium of Wachstein and Meisel and studied by light microscopy and electron microscopy. The ATPase activity of the vir ..."
Abstract
 Add to MetaCart
Thymus glands of chicks with leukemia induced by BAI strain A (myeloblastosis) virus were fixed in cold 4 per cent formaldehydesucrose. Frozen sections were incubated in the ATPase medium of Wachstein and Meisel and studied by light microscopy and electron microscopy. The ATPase activity of the virus is localized to the outermost membrane of the virus. The membrane of the blastlike cells of the thymus cortex from which the virus emerges, by budding, also possesses such activity. It appears likely that the outermost membrane of the virus is derived from the plasma membrane of these cells.