8 research outputs found

    Neanderthal Use of Fish, Mammals, Birds, Starchy Plants and Wood 125-250,000 Years Ago

    Get PDF
    Neanderthals are most often portrayed as big game hunters who derived the vast majority of their diet from large terrestrial herbivores while birds, fish and plants are seen as relatively unimportant or beyond the capabilities of Neanderthals. Although evidence for exploitation of other resources (small mammals, birds, fish, shellfish, and plants) has been found at certain Neanderthal sites, these are typically dismissed as unusual exceptions. The general view suggests that Neanderthal diet may broaden with time, but that this only occurs sometime after 50,000 years ago. We present evidence, in the form of lithic residue and use-wear analyses, for an example of a broad-based subsistence for Neanderthals at the site of Payre, Ardèche, France (beginning of MIS 5/end of MIS 6 to beginning of MIS 7/end of MIS 8; approximately 125–250,000 years ago). In addition to large terrestrial herbivores, Neanderthals at Payre also exploited starchy plants, birds, and fish. These results demonstrate a varied subsistence already in place with early Neanderthals and suggest that our ideas of Neanderthal subsistence are biased by our dependence on the zooarchaeological record and a deep-seated intellectual emphasis on big game hunting

    Lexicographic

    No full text
    In the last decade, several robustness approaches have been developed to deal with uncertainty. In decision problems, and particularly in location problems, the most used robustness approach rely either on maximal cost or on maximal regret criteria. However, it is well known that these criteria are too conservative. In this paper, we present a new robustness approach, called lexicographic α-robustness, which compensates for the drawbacks of criteria based on the worst case. We apply this approach to the 1-median location problem under uncertainty on node weights and we give a specific algorithm to determine robust solutions in the case of a tree. We also show that this algorithm can be extended to the case of a general network
    corecore