Results 1  10
of
30,702
ERC  A Theory of Equity, Reciprocity and Competition
 FORTHCOMING AMERICAN ECONOMIC REVIEW
, 1999
"... We demonstrate that a simple model, constructed on the premise that people are motivated by both their pecuniary payoff and their relative payoff standing, explains behavior in a wide variety of laboratory games. Included are games where equity is thought to be a factor, such as ultimatum, twoperio ..."
Abstract

Cited by 699 (21 self)
 Add to MetaCart
We demonstrate that a simple model, constructed on the premise that people are motivated by both their pecuniary payoff and their relative payoff standing, explains behavior in a wide variety of laboratory games. Included are games where equity is thought to be a factor, such as ultimatum, two
Homological Algebra of Mirror Symmetry
 in Proceedings of the International Congress of Mathematicians
, 1994
"... Mirror Symmetry was discovered several years ago in string theory as a duality between families of 3dimensional CalabiYau manifolds (more precisely, complex algebraic manifolds possessing holomorphic volume elements without zeroes). The name comes from the symmetry among Hodge numbers. For dual Ca ..."
Abstract

Cited by 529 (3 self)
 Add to MetaCart
CalabiYau manifolds V, W of dimension n (not necessarily equal to 3) one has dim H p (V, Ω q) = dim H n−p (W, Ω q). Physicists conjectured that conformal field theories associated with mirror varieties are equivalent. Mathematically, MS is considered now as a relation between numbers of rational curves
Crowds: Anonymity for Web Transactions
 ACM Transactions on Information and System Security
, 1997
"... this paper we introduce a system called Crowds for protecting users' anonymity on the worldwide web. Crowds, named for the notion of "blending into a crowd", operates by grouping users into a large and geographically diverse group (crowd) that collectively issues requests on behalf o ..."
Abstract

Cited by 831 (12 self)
 Add to MetaCart
this paper we introduce a system called Crowds for protecting users' anonymity on the worldwide web. Crowds, named for the notion of "blending into a crowd", operates by grouping users into a large and geographically diverse group (crowd) that collectively issues requests on behalf
Wireless Communications
, 2005
"... Copyright c ○ 2005 by Cambridge University Press. This material is in copyright. Subject to statutory exception and to the provisions of relevant collective licensing agreements, no reproduction of any part may take place without the written permission of Cambridge University ..."
Abstract

Cited by 1129 (32 self)
 Add to MetaCart
Copyright c ○ 2005 by Cambridge University Press. This material is in copyright. Subject to statutory exception and to the provisions of relevant collective licensing agreements, no reproduction of any part may take place without the written permission of Cambridge University
Horus: A flexible group communication system
 Comm. of the ACM
, 1996
"... innovative system offering application developers an extensively flexible group communication model is described. The emergence of processgroup environments for distributed computing represents a promising step toward robustness for missioncritical distributed applications. Process groups have a “ ..."
Abstract

Cited by 434 (28 self)
 Add to MetaCart
innovative system offering application developers an extensively flexible group communication model is described. The emergence of processgroup environments for distributed computing represents a promising step toward robustness for missioncritical distributed applications. Process groups have a
Capacity Limits of MIMO Channels
 IEEE J. SELECT. AREAS COMMUN
, 2003
"... We provide an overview of the extensive recent results on the Shannon capacity of singleuser and multiuser multipleinput multipleoutput (MIMO) channels. Although enormous capacity gains have been predicted for such channels, these predictions are based on somewhat unrealistic assumptions about t ..."
Abstract

Cited by 409 (17 self)
 Add to MetaCart
, for each definition, different correlation models and channel information assumptions that we consider. We first provide a comprehensive summary of ergodic and capacity versus outage results for singleuser MIMO channels. These results indicate that the capacity gain obtained from multiple antennas heavily
The KolmogorovArnoldMoser theorem
 Math. Phys. Electron. J
, 2004
"... This paper gives a self contained proof of the perturbation theorem for invariant tori in Hamiltonian systems by Kolmogorov, Arnold, and Moser with sharp differentiablility hypotheses. The proof follows an idea outlined by Moser in [16] and, as byproducts, gives rise to uniqueness and regularity the ..."
Abstract

Cited by 20 (0 self)
 Add to MetaCart
This paper gives a self contained proof of the perturbation theorem for invariant tori in Hamiltonian systems by Kolmogorov, Arnold, and Moser with sharp differentiablility hypotheses. The proof follows an idea outlined by Moser in [16] and, as byproducts, gives rise to uniqueness and regularity
Turbulence statistics in fully developed channel flow at low Reynolds number
 J. Fluid Mech
, 1987
"... A direct numerical simulation of a turbulent channel flow is performed. The unsteady NavierStokes equations are solved numerically at a Reynolds number of 3300, based on thc mean centreline velocity and channel halfwidth, with about 4 x los grid points (192 x 129 x 160 in 2, y, 2). All essential t ..."
Abstract

Cited by 373 (14 self)
 Add to MetaCart
A direct numerical simulation of a turbulent channel flow is performed. The unsteady NavierStokes equations are solved numerically at a Reynolds number of 3300, based on thc mean centreline velocity and channel halfwidth, with about 4 x los grid points (192 x 129 x 160 in 2, y, 2). All essential
On sets of integers containing no k elements in arithmetic progression
, 1975
"... integers is arbitrarily partitioned into two classes then at least one class contains arbitrarily long arithmetic progressions. It is well known and obvious that neither class must contain an infinite arithmetic progression. In fact, it is easy to see that for any sequence an there is another sequen ..."
Abstract

Cited by 358 (1 self)
 Add to MetaCart
, due to Berlekamp [3], asserts that/(«) < nln9 for n prime, which improves previous results of Erdös, Rado and W. Schmidt. More than 40 years ago, Erdös and Turân [4] considered the quantity rk{n)9 defined to be the greatest integer / for which there is a sequence of integers 0 < a \ < a2 <
Results 1  10
of
30,702