When I first became interested in in-depth case-study research, I was trying to understand how power and rationality shape each other and form the urban environments in which we live (Flyvbjerg, 1998). It was clear to me that in order to understand a complex issue like this, in-depth case

combined with Leaky Bucket admission control, allows the network to make a wide range of worst-case performance guarantees on throughput and delay. The scheme is flexible in that different users may be given widely different performance guarantees, and is efficient in that each of the servers is work

utaneous adnexal tumours are largely benign lesions, and are typically classified according to their state of appendageal differentiation as eccrine, apocrine, follicular and sebaceous.1 2 However, rare tumours may display a mixture of eccrine, follicular, sebaceous and apocrine differentiation. Such tumours with varied differentiation are relatively rare.3–9 The term ‘‘combined adnexal tumours of the skin’ ’ was proposed by Apisarnthanarax et al.3 Other synonyms include ‘‘benign adnexal tumour with multi-directional differentia-tion’’8 and ‘‘benign adnexal tumour of mixed lineage’’.1 Clinically, these tumours present as solitary, slowly enlarging dermal or subcutaneous nodules located in the head and neck and in the extremities.1 8 Histologically, they are characterised by well-circumscribed, non-encapsulated nodules composed of a lobular proliferation of epithelial cells displaying a spectrum

This is an Open Access article distributed under the terms of the Creative Commons Attribution License

Sentences in first-order predicate logic can be usefully interpreted as programs In this paper the operational and fixpoint semantics of predicate logic programs are defined, and the connections with the proof theory and model theory of logic are investigated It is concluded that operational

inÇÐÓ�Ò We present a novel Locality-Sensitive Hashing scheme for the Approximate Nearest Neighbor Problem underÐÔnorm, based onÔstable distributions. Our scheme improves the running time of the earlier algorithm for the case of theÐnorm. It also yields the first known provably efficient approximate

In cases where the consistencj assumption holds, the original game can be replaced by a game where nature first conducts a lottery in accordance with

boosting algorithm for combining preferences called RankBoost. We also describe an efficient implementation of the algorithm for certain natural cases. We discuss two experiments we carried out to assess the performance of RankBoost. In the first experiment, we used the algorithm to combine different WWW

This paper empirically investigates the effects of liberalized trade on plant productivity in the case of Chile. Chile presents an interesting setting to study this relationship since it underwent a massive trade liberalization that significantly exposed its plants to competition from abroad during

design is rooted in the theory of network coding. Prior work on network coding is mainly theoretical and focuses on multicast traffic. This paper aims to bridge theory with practice; it addresses the common case of unicast traffic, dynamic and potentially bursty flows, and practical issues facing