Results 1 - 10 of 6,797

Dynamo: amazon’s highly available key-value store

by Giuseppe DeCandia, Deniz Hastorun, Madan Jampani, Gunavardhan Kakulapati, Avinash Lakshman, Alex Pilchin, Swaminathan Sivasubramanian, Peter Vosshall, Werner Vogels - IN PROC. SOSP , 2007
"... Reliability at massive scale is one of the biggest challenges we face at Amazon.com, one of the largest e-commerce operations in the world; even the slightest outage has significant financial consequences and impacts customer trust. The Amazon.com platform, which provides services for many web sites ..."
Abstract - Cited by 684 (0 self) - Add to MetaCart
sites worldwide, is implemented on top of an infrastructure of tens of thousands of servers and network components located in many datacenters around the world. At this scale, small and large components fail continuously and the way persistent state is managed in the face of these failures drives

Random Early Detection Gateways for Congestion Avoidance.

by Sally Floyd , Van Jacobson - IEEELACM Transactions on Networking, , 1993
"... Abstract-This paper presents Random Early Detection (RED) gateways for congestion avoidance in packet-switched networks. The gateway detects incipient congestion by computing the average queue size. The gateway could notify connections of congestion either by dropping packets arriving at the gatewa ..."
Abstract - Cited by 2716 (31 self) - Add to MetaCart
at the gateway or by setting a bit in packet headers. When the average queue size exceeds a preset threshold, the gateway drops or marks each arriving packet with a certain probability, where the exact probability is a function of the average queue size. RED gateways keep the average queue size low while

Policy gradient methods for reinforcement learning with function approximation.

by Richard S Sutton , David Mcallester , Satinder Singh , Yishay Mansour - In NIPS, , 1999
"... Abstract Function approximation is essential to reinforcement learning, but the standard approach of approximating a value function and determining a policy from it has so far proven theoretically intractable. In this paper we explore an alternative approach in which the policy is explicitly repres ..."
Abstract - Cited by 439 (20 self) - Add to MetaCart
and in the state-visitation distribution. In this paper we prove that an unbiased estimate of the gradient (1) can be obtained from experience using an approximate value function satisfying certain properties. Our result also suggests a way of proving the convergence of a wide variety of algorithms based on "

Bethe Ansatz for Quantum Strings

by Gleb Arutyunov, Sergey Frolov, Matthias Staudacher , 2004
"... We propose Bethe equations for the diagonalization of the Hamiltonian of quantum strings on AdS5×S 5 at large string tension and restricted to certain large charge states from a closed su(2) subsector. The ansatz differs from the recently proposed all-loop gauge theory asymptotic Bethe ansatz by add ..."
Abstract - Cited by 281 (16 self) - Add to MetaCart
We propose Bethe equations for the diagonalization of the Hamiltonian of quantum strings on AdS5×S 5 at large string tension and restricted to certain large charge states from a closed su(2) subsector. The ansatz differs from the recently proposed all-loop gauge theory asymptotic Bethe ansatz

Superstrings and topological strings at large

by Cumrun Vafa - N”, J. Math. Phys
"... We embed the large N Chern-Simons/topological string duality in ordinary superstrings. This corresponds to a large N duality between generalized gauge systems with N = 1 supersymmetry in 4 dimensions and superstrings propagating on non-compact Calabi-Yau manifolds with certain fluxes turned on. We a ..."
Abstract - Cited by 254 (27 self) - Add to MetaCart
We embed the large N Chern-Simons/topological string duality in ordinary superstrings. This corresponds to a large N duality between generalized gauge systems with N = 1 supersymmetry in 4 dimensions and superstrings propagating on non-compact Calabi-Yau manifolds with certain fluxes turned on. We

Developments in the Measurement of Subjective Well-Being

by Daniel Kahneman , Alan B Krueger - Psychological Science. , 1993
"... F or good reasons, economists have had a long-standing preference for studying peoples' revealed preferences; that is, looking at individuals' actual choices and decisions rather than their stated intentions or subjective reports of likes and dislikes. Yet people often make choices that b ..."
Abstract - Cited by 284 (7 self) - Add to MetaCart
F or good reasons, economists have had a long-standing preference for studying peoples' revealed preferences; that is, looking at individuals' actual choices and decisions rather than their stated intentions or subjective reports of likes and dislikes. Yet people often make choices

Split States, Entropy Enigmas, Holes and Halos

by Frederik Denef, Gregory W. Moore , 2007
"... We investigate degeneracies of BPS states of D-branes on compact Calabi-Yau manifolds. We develop a factorization formula for BPS indices using attractor flow trees associated to multicentered black hole bound states. This enables us to study background dependence of the BPS spectrum, to compute e ..."
Abstract - Cited by 235 (22 self) - Add to MetaCart
radius but do not form stable D6-anti-D6 bound states. We point out a likely breakdown of the OSV conjecture at small gtop (in the large background CY volume limit), due to the surprising phenomenon that for sufficiently large background Kähler moduli, a charge ΛΓ supporting single centered black holes

MOPS: an Infrastructure for Examining Security Properties of Software

by Hao Chen, David Wagner - In Proceedings of the 9th ACM Conference on Computer and Communications Security , 2002
"... We describe a formal approach for finding bugs in security-relevant software and verifying their absence. The idea is as follows: we identify rules of safe programming practice, encode them as safety properties, and verify whether these properties are obeyed. Because manual verification is too expen ..."
Abstract - Cited by 233 (8 self) - Add to MetaCart
expensive, we have built a program analysis tool to automate this process. Our program analysis models the program to be verified as a pushdown automaton, represents the security property as a finite state automaton, and uses model checking techniques to identify whether any state violating the desired

Decentralization of Governance and Development

by Pranab Bardhan - Journal of Economic Perspectives , 2002
"... A ll around the world in matters of governance, decentralization is the rage.Even apart from the widely debated issues of subsidiarity and devolution inthe European Union and states ’ rights in the United States, decentraliza-tion has been at the center stage of policy experiments in the last two de ..."
Abstract - Cited by 208 (3 self) - Add to MetaCart
A ll around the world in matters of governance, decentralization is the rage.Even apart from the widely debated issues of subsidiarity and devolution inthe European Union and states ’ rights in the United States, decentraliza-tion has been at the center stage of policy experiments in the last two

Turbo-charging Vertical Mining of Large Databases

by Pradeep Shenoy , Jayant R. Haritsa , S. Sudarshan, Gaurav Bhalotia, Mayank Bawa, Devavrat Shah - IN PROC. OF ACM SIGMOD INT. CONF. ON MANAGEMENT OF DATA , 2000
"... In a vertical representation of a market-basket database, each item is associated with a column of values representing the transactions in which it is present. The association-rule mining algorithms that have been recently proposed for this representation show performance improvements over their cla ..."
Abstract - Cited by 104 (5 self) - Add to MetaCart
their classical horizontal counterparts, but are either efficient only for certain database sizes, or assume particular characteristics of the database contents, or are applicable only to specific kinds of database schemas. We present here a new vertical mining algorithm called VIPER, which is general
Results 1 - 10 of 6,797