We develop and analyze low-complexity cooperative diversity protocols that combat fading induced by multipath propagation in wireless networks. The underlying techniques exploit space diversity available through cooperating terminals’ relaying signals for one another. We outline several strategies

Explaining cross-country differences in growth rates requires not only an understanding of the link between growth and public policies, but also an understanding of why countries choose different public policies. This paper shows that ethnic diversity helps explain cross-country differences

Emerging high-performance applications require the ability to exploit diverse, geographically distributed resources. These applications use high-speed networks to integrate supercomputers, large databases, archival storage devices, advanced visualization devices, and/or scientific instruments

are challenging problems due to the considerable diversity, large numbers, dynamic behavior, and geographical distribution of the entities in which a user might be interested. Consequently, information services are a vital part of any Grid software infrastructure, providing fundamental mechanisms for discovery

to find much better spread of solutions in all problems compared to PAES---another elitist multi-objective EA which pays special attention towards creating a diverse Pareto-optimal front. Because of NSGA-II's low computational requirements, elitist approach, and parameter-less sharing approach

, is able to find much better spread of solutions and better convergence near the true Pareto-optimal front compared to PAES and SPEA - two other elitist multi-objective EAs which pay special attention towards creating a diverse Pareto-optimal front. Moreover, we modify the definition of dominance in order

Although several psychological theories predict that members of stigmatized groups should have low global self-esteem, empirical research typically does not support this prediction. It is proposed here that this discrepancy may be explained by considering the ways in which membership in a

Recent advancements in iterative processing of channel codes and the development of turbo codes have allowed the communications industry to achieve near-capacity on a single-antenna Gaussian or fading channel with low complexity. We show how these iterative techniques can also be used to achieve

Given an m×n haplotype matrix A, we show linear time algorithms for finding all interval diversities, farthest sites, and the longest block with low diversity. For selecting the multiple long blocks with diversity constraint, we show that selecting k blocks with longest total length can be be found

very flexible, thereby providing support for diverse networking environments and usage scenarios. It accommodates a variety of policies for when and where to propagate updates. It operates over diverse network topologies, including low-bandwidth links. It is incremental. It enables replica convergence