Acorn, D. A., Hamilton, D. L., & Sherman, S. J. (1988). Generalization of biased perceptions of groups based on illusory correlations. Social Cognition, 6, 345-372. Exp 1's purpose was to see if an IC based on one dimension would influence trait judgments on another dimension. Cell sizes were 16:8:8:4. Three conditions (mixed, social and intellectual) and three dependent variables (trait rating...

Lack of the viability and vitality and totally well- being in life and low-level of the rural community wellbeing, could have decreased the belonging to the community and caused less participation. It also would lead to non- qualitative life and satisfaction. On the other hand, low level of the wellbeing and lack of the attractive situation put the sustainability and stability of the rural in d...

The network distance estimation schemes based on Euclidean embedding have been shown to provide reasonably good overall accuracy. While some recent studies have revealed that triangle inequality violations (TIVs) inherent in network distances among Internet hosts fundamentally limit their accuracy, these Euclidean embedding methods are nonetheless appealing and useful for many applications due ...

The recent availability of data describing social networks is changing our understanding of the "microscopic structure" of a social tie. A social tie indeed is an aggregated outcome of many social interactions such as face-to-face conversations or phone calls. Analysis of data on face-to-face interactions shows that such events, as many other human activities, are bursty, with very heterogeneou...

Let (W,d) be a metric space and S = {s1 . . . sk} an ordered list of subsets of W . The distance between p ∈ W and si ∈ S is d(p, si) = min{ d(p, q) : q ∈ si }. S is a resolving set forW if d(x, si) = d(y, si) for all si implies x = y. A metric basis is a resolving set of minimal cardinality, named the metric dimension of (W,d). The metric dimension has been extensively studied in the literatur...

This work deals with trace theorems for a class of ramified bidimensional domains Ω with a self-similar fractal boundary Γ. The fractal boundary Γ is supplied with a probability measure μ called the self-similar measure. Emphasis is put on the case when the domain is not a − δ domain as defined by Jones and the fractal set is not totally disconnected. In this case, the classical trace results c...

We say that a set system F ⊆ 2[n] shatters a given set S ⊆ [n] if 2S = {F ∩ S : F ∈ F}. The Sauer inequality states that in general, a set system F shatters at least |F| sets. Here we concentrate on the case of equality. A set system is called shattering-extremal if it shatters exactly |F| sets. In this paper we characterize shattering-extremal set systems of Vapnik-Chervonenkis dimension 2 in ...

The classical Hausdorff-Young inequality for locally compact abelian groups states that, for 1 ≤ p ≤ 2, the L-norm of a function dominates the L-norm of its Fourier transform, where 1/p + 1/q = 1. By using the theory of non-commutative L-spaces and by reinterpreting the Fourier transform, R. Kunze (1958) [resp. M. Terp (1980)] extended this inequality to unimodular [resp. non-unimodular] groups...

Rademacher complexity is a measure of the richness of a class of real-valued functions. In this sense, it is similar to the VC dimension. In fact, we will establish a uniform deviation bound in terms of Rademacher complexity, and then use this result to prove the VC inequality. Unlike VC dimension, however, Rademacher complexity is not restricted to binary functions, and will also prove useful ...