This paper presents a design principle that helps guide placement of functions among the modules of a distributed computer system. The principle, called the end-to-end argument, suggests that functions placed at low levels of a system may be redundant or of little value when compared with the cost

Are Americans more individualistic and less collectivistic than members of other groups? The authors summarize plausible psychological implications of individualism–collectivism (IND-COL), meta-analyze cross-national and within-United States IND-COL differences, and review evidence for effects of IND-COL on self-concept, well-being, cognition, and relationality. European Americans were found to be both more individualistic—valuing personal independence more—and less collectivistic—feeling duty to in-groups less—than others. However, European Americans were not more individualistic than African Americans, or Latinos, and not less collectivistic than Japanese or Koreans. Among Asians, only Chinese showed large effects, being both less individualistic and more collectivistic. Moderate IND-COL effects were found on self-concept and relationality, and large effects were found on attribution and cognitive style. To contemporary Americans, being an individualist is not only a good thing; it is a quintessentially American thing. However, the term individualism itself appears to have its roots outside of the North American continent, namely in the French Revolution. It appears that individualism was first used to describe the negative

material that, unlike traditional cryptographic keys, is (1) not reproducible precisely and (2) not distributed uniformly. We propose two primitives: a fuzzy extractor reliably extracts nearly uniform randomness R from its input; the extraction is error-tolerant in the sense that R will be the same even

How do real graphs evolve over time? What are “normal” growth patterns in social, technological, and information networks? Many studies have discovered patterns in static graphs, identifying properties in a single snapshot of a large network, or in a very small number of snapshots; these include

We examined 155 information systems research articles published from 1983 to 1988 and found that although this research is not rooted in a single overarching theoretical perspective, it does exhibit a single set of philosophical assumptions regarding the nature of the phenomena studied

were considered in the folklore to be contradictory. More generally, we show how to construct a signature scheme with such properties based on the existence of a "claw-free" pair of permutations - a potentially weaker assumption than the intractibility of integer factorization. The new scheme

quantities of unlabeled documents are readily available. We introduce an algorithm for learning from labeled and unlabeled documents based on the combination of Expectation-Maximization (EM) and a naive Bayes classifier. The algorithm first trains a classifier using the available labeled documents

Pseudorandom generators are fundamental to many theoretical and applied aspects of computing. We show howto construct a pseudorandom generator from any oneway function. Since it is easy to construct a one-way function from a pseudorandom generator, this result shows that there is a pseudorandom

Warped compactifications with significant warping provide one of the few known mechanisms for naturally generating large hierarchies of physical scales. We demonstrate that this mechanism is realizable in string theory, and give examples involving orientifold compactifications of IIB string theory and F-theory compactifications on Calabi-Yau four-folds. In each case, the hierarchy of scales is fixed by a choice of RR and NS fluxes in the compact manifold. Our solutions involve compactifications of the Klebanov-Strassler gravity dual to a confining N = 1 supersymmetric gauge theory, and the hierarchy reflects the small scale of chiral symmetry breaking in the dual gauge theory.

Abstract not found