950 resultados para French tables.
Resumo:
Based on material collected from French Polynesia and deposited in the Museum national d'Histoire naturelle, Paris, the present paper reports 31 palaemonid shrimp species, which belong to the Palaemoninae (two genera, three species) and to the Pontoniinae (12 genera, 28 species), including six new species. The new species are: Izucaris crosnieri n. sp., Periclimenes alexanderi n. sp., P. josephi n. sp., P platydactylus n. sp., P polynesiensis n. sp. and P vicinus n. sp. Detailed descriptions and illustrations of the new species are provided. Besides the six new species, ten other species are recorded for the first time from French Polynesia: Exoclimenella maldivensis Duris & Bruce, 1995, Kemponia rapanui (Fransen, 1987) n. comb., Palaemonella crosnieri Bruce, 1978, P spinulata Yokoya, 1936, Periclimenaeus hecate (Nobili, 1904), P orbitocarinatus Fransen, 2006, Periclimenes aleator Bruce, 199 1, P paralcocki Li & Bruce, 2006, P uniunguiculatus Bruce, 1990, Pontonides loloata Bruce, 2005.
Resumo:
The academic debate on partnerships has so far mainly focused on whether there are mutual gains for both unions and employers and whether they support or undermine branch organisation. This debate is here assessed in relation to learning partnerships, which are considered to be a distinctive form of partnership and represent a process of institution-building.
Resumo:
Jackson, Peter, and Joe Maiolo, 'Strategic intelligence, Counter-Intelligence and Alliance Diplomacy in Anglo-French relations before the Second World War', Military History (2006) 65(2) pp.417-461 RAE2008
Resumo:
Price, Roger, The French Second Empire: an anatomy of political power (Cambridge: Cambridge University Press, 2001), pp.x+507 RAE2008
Resumo:
Rothwell, W., 'Anglo-French and English Society in Chaucer's ?The Reeve's Tale?', English Studies (2006) 87(5) pp.511-538 RAE2008
Resumo:
Rothwell, W., 'Synonymity and Semantic Variability in Medieval French and Middle English', Modern Language Review (2007) 102(2) pp.363-380 RAE2008
Resumo:
Memorial Service.
Resumo:
http://www.archive.org/details/anheroicbishopli00stocuoft
Resumo:
http://www.archive.org/details/forthefaithlifeo00appeuoft
Resumo:
http://www.archive.org/details/missionofthechur013324mbp
Resumo:
http://www.archive.org/details/historyofthemiss013362mbp
Resumo:
http://www.archive.org/details/lifeofstvincento00colluoft
Resumo:
http://www.archive.org/details/churchsmissionin013224mbp
Resumo:
Distributed hash tables have recently become a useful building block for a variety of distributed applications. However, current schemes based upon consistent hashing require both considerable implementation complexity and substantial storage overhead to achieve desired load balancing goals. We argue in this paper that these goals can b e achieved more simply and more cost-effectively. First, we suggest the direct application of the "power of two choices" paradigm, whereby an item is stored at the less loaded of two (or more) random alternatives. We then consider how associating a small constant number of hash values with a key can naturally b e extended to support other load balancing methods, including load-stealing or load-shedding schemes, as well as providing natural fault-tolerance mechanisms.
Resumo:
We consider the problem of performing topological optimizations of distributed hash tables. Such hash tables include Chord and Tapestry and are a popular building block for distributed applications. Optimizing topologies over one dimensional hash spaces is particularly difficult as the higher dimensionality of the underlying network makes close fits unlikely. Instead, current schemes are limited to heuristically performing local optimizations finding the best of small random set of peers. We propose a new class of topology optimizations based on the existence of clusters of close overlay members within the underlying network. By constructing additional overlays for each cluster, a significant portion of the search procedure can be performed within the local cluster with a corresponding reduction in the search time. Finally, we discuss the effects of these additional overlays on spatial locality and other load balancing scheme.