nils-herrmann/clean_scirepeval huggingface dataset:
Confronting globalization : the quest for a social agenda : Geneva lectures

The International Labour Organisation (ILO) established the World Commission on the Social Dimension of Globalisation in February 2002. In February 2004, following numerous international and regional conferences and consultations, the Commission's report, A Fair Globalisation: Creating Opportunities for All, was presented to the Governing Body of the International Labour Organisation, to the Secretary General of the United Nations, and to the heads of other UN agencies, the World Bank, the International Monetary Fund, and the World Trade Organisation. This volume represents the first in-depth evaluation of this important report. The analyses and commentaries collected in this volume accomplish two essential tasks. They detail the findings and recommendations of the Commission, and they also spell out the implications of the Commission's report for the ongoing viability of economic globalisation in practice. The authors include ILO officials, representatives of both employers and labour unions, specialists in various work-related professions, and academics in disciplines related to work and society. Several authors deal with the role played by other international organisations like the OECD and the EU regarding the social aspects of globalisation. Two important EU documents on the promotion of core labour standards and on the social dimension of globalisation are reprinted here. Treating as it does one of the major problems of our generation - how to see to it that globalisation benefits all of us and not only a few - " The Quest for a Social Agenda" promises to take its place as an indispensable resource for practitioners in many fields, from labour and employment law to health care and environmental policy. It is not too much to say that this book represents an immensely valuable contribution and commitment to the future well-being of the world we live in.
A Research Roadmap of Cognitive Vision

Peter Auer Aude Billard Horst Bischof Isabelle Bloch Pia Boettcher Heinrich Bulthoff Hilary Buxton Henrik Christensen Tony Cohn Patrick Courtney Andrew Crookell James Crowley Sven Dickinson Christof Eberst Jan-Olof Eklundh Bob Fisher Wolfgang Forstner John Gilby Goesta Granlund Vaclav Hlavac Josef Kittler Walter Kropatsch Ales Leonardis Jim Little Giorgio Metta Hans-Hellmut Nagel Bernhard Nebel Bernd Neumann Heinrich Niemann Lucas Paletta Axel Pinz Fiora Pirri Gerhard Sagerer Giulio Sandini Bernt Schiele Rebecca Simpson Gerald Sommer John Tsotsos Monique Thonnat David Vernon Markus Vincze
Postface: Differentiating and Differentiated Views on Linguistic Representation

This special issue of the Canadian Journal of Linguistics/Revue canadienne de linguistique is devoted to the intriguing notion of représentation linguistique, an idea that developed in French (socio-)linguistics some ten years ago (cf. Jodelet 1993), following earlier work by Anne-Marie Houdebine (1982). In their preface, Philippe Hambye and Anne Catherine Simon discuss one of the major tenets of this approach, namely the idea that représentation linguistique, in addition to being concerned with how language is represented in the human mind — and thus very much in line with the cognitive turn of linguistics — also implies that as a cognitive entity, language has no self-contained status in the sense of post-structualist, generative grammar. Rather, the way in which we language users look upon language is always socially contextualised. Whatever we know, in the largest sense of the word, about language and varieties of language is inextricably linked to the situations and social groups, the speakers and geographical regions, the linguistic genres and social styles that constitute it. Linguistic representations, understood as everyday knowledge of language, are therefore normatively organised. They have to do with how someone of a certain type (incumbent to a certain social category) is supposed to, or can be expected to speak, given certain typified circumstances, and what it means for him or her to speak in this way.
Tracking the Best Disjunction

AbstractLittlestone developed a simple deterministic on-line learning algorithm for learning k-literal disjunctions. This algorithm (called 
$${WINNOW}$$
) keeps one weight for each of then variables and does multiplicative updates to its weights. We develop a randomized version of 
$${WINNOW} $$
 and prove bounds for an adaptation of the algorithm for the case when the disjunction may change over time. In this case a possible target disjunction schedule
$${\mathcal{T}} $$
 is a sequence of disjunctions (one per trial) and the shift size is the total number of literals that are added/removed from the disjunctions as one progresses through the sequence.We develop an algorithm that predicts nearly as well as the best disjunction schedule for an arbitrary sequence of examples. This algorithm that allows us to track the predictions of the best disjunction is hardly more complex than the original version. However, the amortized analysis needed for obtaining worst-case mistake bounds requires new techniques. In some cases our lower bounds show that the upper bounds of our algorithm have the right constant in front of the leading term in the mistake bound and almost the right constant in front of the second leading term. Computer experiments support our theoretical findings.
Weak Hypotheses and Boosting for Generic Object Detection and Recognition

In this paper we describe the first stage of a new learning system for object detection and recognition. For our system we propose Boosting (5) as the underlying learning technique. This allows the use of very diverse sets of visual features in the learning process within a com- mon framework: Boosting — together with a weak hypotheses finder — may choose very inhomogeneous features as most relevant for combina- tion into a final hypothesis. As another advantage the weak hypotheses finder may search the weak hypotheses space without explicit calculation of all available hypotheses, reducing computation time. This contrasts the related work of Agarwal and Roth (1) where Winnow was used as learning algorithm and all weak hypotheses were calculated explicitly. In our first empirical evaluation we use four types of local descriptors: two basic ones consisting of a set of grayvalues and intensity moments and two high level descriptors: moment invariants (8) and SIFTs (12). The descriptors are calculated from local patches detected by an inter- est point operator. The weak hypotheses finder selects one of the local patches and one type of local descriptor and efficiently searches for the most discriminative similarity threshold. This differs from other work on Boosting for object recognition where simple rectangular hypotheses (22) or complex classifiers (20) have been used. In relatively simple images, where the objects are prominent, our approach yields results comparable to the state-of-the-art (3). But we also obtain very good results on more complex images, where the objects are located in arbitrary positions, poses, and scales in the images. These results indicate that our flexible approach, which also allows the inclusion of features from segmented re- gions and even spatial relationships, leads us a significant step towards generic object recognition.
A Boosting Approach to Multiple Instance Learning

In this paper we present a boosting approach to multiple instance learning. As weak hypotheses we use balls (with respect to various metrics) centered at instances of positive bags. For the oo-norm these hypotheses can be modified into hyper-rectangles by a greedy algorithm. Our approach includes a stopping criterion for the algorithm based on estimates for the generalization error. These estimates can also be used to choose a preferable metric and data normalization. Compared to other approaches our algorithm delivers improved or at least competitive results on several multiple instance benchmark data sets.
On-line learning with malicious noise and the closure algorithm

We investigate a variant of the on-line learning model for classes of \0,1\-valued functions (concepts) in which the labels of a certain amount of the input instances are corrupted by adversarial noise. We propose an extension of a general learning strategy, known as “Closure Algorithm”, to this noise model, and show a worst-case mistake bound of m + (d+1)K for learning an arbitrary intersection-closed concept class C, where K is the number of noisy labels, d is a combinatorial parameter measuring C's complexity, and m is the worst-case mistake bound of the Closure Algorithm for learning C in the noise-free model. For several concept classes our extended Closure Algorithm is efficient and can tolerate a noise rate up to the information-theoretic upper bound. Finally, we show how to efficiently turn any algorithm for the on-line noise model into a learning algorithm for the PAC model with malicious noise.
A New PAC Bound for Intersection-Closed Concept Classes

For hyper-rectangles in R d Auer et al.  proved a PAC bound of \(O(\frac{1}{\epsilon}(d+{\rm log}\frac{1}{\delta}))\), where e and δ are the accuracy and confidence parameters. It is still an open question whether one can obtain the same bound for intersection-closed concept classes of VC-dimension d in general. We present a step towards a solution of this problem showing on one hand a new PAC bound of \(O(\frac{1}{\epsilon}(d{\rm log}d+\frac{1}{\delta}))\) for arbitrary intersection-closed concept classes complementing the well-known bounds \(O(\frac{1}{\epsilon}({\rm log}\frac{1}{\delta}+d{\rm log}\frac{1}{\epsilon}))\) and \(O(\frac{d}{\epsilon}{\rm log}\frac{1}{\delta})\) of Blumer et al. and Haussler et al. . Our bound is established using the closure algorithm, that generates as its hypothesis the smallest concept that is consistent with the positive training examples. On the other hand, we show that maximum intersection-closed concept classes meet the bound of \(O(\frac{1}{\epsilon}(d+{\rm log}\frac{1}{\delta}))\) as well. Moreover, we indicate that our new as well as the conjectured bound cannot hold for arbitrary consistent learning algorithms, giving an example of such an algorithm that needs \(\Omega(\frac{1}{\epsilon}(d+{\rm log}\frac{1}{\epsilon}+{\rm log \frac{1}{\delta}}))\) examples to learn some simple maximum intersection-closed concept class.
Structural Results About On-line Learning Models With and Without Queries

We solve an open problem of Maass and Turán, showing that the optimal mistake-bound when learning a given concept class without membership queries is within a constant factor of the optimal number of mistakes plus membership queries required by an algorithm that can ask membership queries. Previously known results imply that the constant factor in our bound is best possible.We then show that, in a natural generalization of the mistake-bound model, the usefulness to the learner of arbitrary “yes-no” questions between trials is very limited. We show that several natural structural questions about relatives of the mistake-bound model can be answered through the application of this general result. Most of these results can be interpreted as saying that learning in apparently less powerful (and more realistic) models is not much more difficult than learning in more powerful models.
Sprache, Grenze, Raum

On the basis of a cognitive approach to space in the tradition of Georg Simmel, I argue in this paper that geopolitical (above all, national) borders should be looked upon as cognitive constructs intimately linked to the “imagined communities” (Andersen) they delimit. These “imagined borders” can nonetheless have a strong impact on the dialect continua which they crosscut. Dialect divergence at the national borders of Germany is therefore not due to impeded communication as suggested in traditional dialectology (Verkehr); rather, the borders are the limits (boundaries) of the reach of the national standard languages or of repertoire types which symbolise, in some way or other, nation-state identities. Divergence can be expected to increase to the degree that (in this order) (a) the national standard languages, (b) the repertoire types (diaglossic/diglossic) or (c) the regional dialects differ on both sides of the border. 1. Einleitung Professionelle und nicht-professionelle Sprachbetrachter sind sich einig: Sprache ist an den geographischem Raum gebunden. In der Sprachwissenschaft bzw. den Philologien hat sich schon in fruhester Zeit eine Teildisziplin entwickelt die Dialektologie , deren primares Ziel die Erforschung der arealen Distribution sprachlicher Merkmale ist; weitere, die Grenzen der Einzelsprachen uberschreitende raumbezogene Fragestellungen spielen seit der Schmidtschen Wellentheorie (Schmidt 1872, Goebl 1983) und bis zur heutigen Geolinguistik in der historischen und synchronen Sprachbetrachtung eine wichtige Rolle. Nicht-professionelle Sprachbetrachter (Ethnolinguisten) sind davon uberzeugt, dass jede
Object recognition using segmentation for feature detection

A new method is presented to learn object categories from unlabeled and unsegmented images for generic object recognition. We assume that each object can be characterized by a set of typical regions, and use a new segmentation method - "similarity-measure segmentation" - to split the images into regions of interest. This approach may also deliver segments, which are split into several disconnected parts, which turn out to be a powerful description of local similarities. Several textural features are calculated for each region, which are used to learn object categories with boosting. We demonstrate the flexibility and power of our method by excellent results on various datasets. In comparison, our recognition results are significantly higher than the results published in related work.
Delayed self-repairs as a structuring device for complex turns in conversation

This paper looks into the interactional basis of the grammatical format of parentheticals. It will be argued that such a basis can be found in abandoned or broken off units of talk in conversation which are not immediately recycled (repaired) but whose activity status is attended to at some later point of the emerging talk. These abandoned/broken off units, then, are not erased or “overwritten” by the subsequent structure, but their projectional force remains valid and needs to be attended to by recipients. On the interactional plane, the paper focuses on those post-break-off structures which introduce subsidiary elements of talk (often materials qualifying or specifying the upcoming main point of the turn) and after which the speaker returns or attempts to return into the broken-off/abandoned structure.
Is a stable workforce good for the economy ? : insight into the tenure-productivity-employment relationship

Based on the European Community Labour Force Survey and on similar surveys in Japan and the USA from 1992 to 2002. Explores whether employment tenure (defined as the amount of time a worker has spent working for the same employer) inhibits or contributes to productivity and whether there is an optimum level of tenure for promoting productivity. Proposes an econometric analysis of the relationship between tenure and productivity in 13 European countries and looks at the impact of labour market institutions on employment tenure.
Reviews

These two volumes complete Eichhoff’s work on German dialect geography, which he started in 1977-1978 with the publication of volumes 1 and 2 of the Wortatlas der deutschen Umgangssprachen. The two new volumes, which comprise a total of 141 maps, are based on a new set of data mainly collected shortly before the Wende (i.e., in the late 1980s) in the total area in which German is spoken as a first language, but they follow the methodology of the previous volumes in all but small details. This means that data collection was done through a questionnaire on an onomasiological basis, mainly (and in the GDR exclusively) by the indirect method (mailing); that the net of elicitation points was only slightly changed (by the addition of Luxemburg and one additional point in South Tyrol, making a total of 404 points altogether); and that informants were middle-aged (born after 1945) urban speakers who were asked to report on their “everyday language.” Thus, the atlas clearly aims to give a picture of “real German” as it is spoken today, in contrast to the archaizing and retrospectively oriented methodology of traditional dialect atlases. While this aim continues to be exceptional in linguistic atlas work (where the methods and research interests of the first half of the twentieth century still prevail in Germany), other features of Eichhoff’s atlas are quite conservative (as was already noted by Markey in a review of the first volume in 1978). He is not interested in social variability or age grading, the elicitation points are treated as homogeneous (with only one questionnaire per town), and the ways in which the results are represented in the maps follow the traditional pattern (which, however, is handled with perfection by the author). This is surely legitimate, but it would have been useful to document (if not control) the informants’social background in order to understand which part of the German speech community is actually portrayed.
Identifying regional varieties b A comparison of two

It is a commonly held belief that languages and dialects can be identified by pitch information alone. In most previous experiments, subjects were presented with pitch information as well as with limited information on amplitude and timing but not with higher-level, i.e. linguistic, information as represented by intonation contours. The question arises as to whether higher-level information may significantly enhance success rates. To evaluate both approaches, two experiments were carried out. In the first experiment, listeners were presented with isolated pitch information extracted from recordings of four varieties of German. In the second experiment, listeners were presented with intonation contours of the same varieties, which were superimposed on neutral carrier utterances. The results suggest that success rates may indeed be enhanced by using intonation contours. Moreover, the linguistic background of the listeners was found to affect performance in both tests.
Employment stability in an age of flexibility : evidence from industrialized countries

This volume begins by examining the state of the stable employment relationship in the context of rapid globalization and technological change. Mass dismissals, high unemployment, and the rise of part-time and temporary jobs reveal that work in the new labour market is very different from that of the past. However, the authors present convincing evidence that the long-term employment relationship is more resilient than is commonly thought. While offering a comparison of employment stability and flexibility in 16 OECD countries, the book offers a detailed analysis on the type of labour market regulations needed to ensure a balance of employment flexibility and security. In particular, it studies the linkages between employment protection and labour market policies in Denmark, France, Japan, and the United States.
Using Confidence Bounds for Exploitation-Exploration Trade-offs

We show how a standard tool from statistics --- namely confidence bounds --- can be used to elegantly deal with situations which exhibit an exploitation-exploration trade-off. Our technique for designing and analyzing algorithms for such situations is general and can be applied when an algorithm has to make exploitation-versus-exploration decisions based on uncertain information provided by a random process. We apply our technique to two models with such an exploitation-exploration trade-off. For the adversarial bandit problem with shifting our new algorithm suffers only O((ST)1/2) regret with high probability over T trials with S shifts. Such a regret bound was previously known only in expectation. The second model we consider is associative reinforcement learning with linear value functions. For this model our technique improves the regret from O(T3/4) to O(T1/2).
The InfoSky visual explorer: Exploiting Hierarchical Structure and Document Similarities

InfoSky is a system enabling users to explore large, hierarchically structured document collections. Similar to a real-world telescope, InfoSky employs a planar graphical representation with variable magnification. Documents of similar content are placed close to each other and are visualised as stars, forming clusters with distinct shapes. For greater performance, the hierarchical structure is exploited and force-directed placement is applied recursively at each level on much fewer objects, rather than on the whole corpus. Collections of documents at a particular level in the hierarchy are visualised with bounding polygons using a modified weighted Voronoi diagram. Their area is related to the number of documents contained. Textual labels are displayed dynamically during navigation, adjusting to the visualisation content. Navigation is animated and provides a seamless zooming transition between summary and detail view. Users can map metadata such as document size or age to attributes of the visualisation such as colour and luminance. Queries can be made and matching documents or collections are highlighted. Formative usability testing is ongoing; a small baseline experiment comparing the telescope browser to a tree browser is discussed.
Identification of Regional Varieties by Intonational Cues

Two experiments examined the commonly held belief that regional varieties of German can be identified by intonational features alone. In both experiments, listeners were presented with regional intonational contours of German. In the first experiment, listeners judged contours of Hamburg urban vernacular compared with contours of Northern Standard German. In the second experiment, listeners judged contours of Berlin urban vernacular compared with contours of both Northern Standard German and Low Alemannic German. The performance of listeners was found to vary with their linguistic experience. Listeners who were familiar both with the local variety and with some nonlocal variety by personal contact performed better than listeners who were familiar with the local variety only. Moreover, also listeners not familiar with Hamburg German and Berlin German, respectively, were found to perform the identification test with some success. This led to the conclusion that overall success rates do not only depend on true recognition of local contours but may additionally be enhanced by using some kind of elimination strategy. A second factor that affected performance was the choice of speaker for generating the carrier utterances. In the first experiment, all carrier utterances were produced by a speaker of Northern Standard German. In the second experiment, two sets of carrier utterances were used. The first set was obtained from a speaker of Northern Standard German and the second set from a speaker of Berlin urban vernacular. As expected, Berlin contours were better identified when presented with an utterance that was produced by a speaker of Berlin urban vernacular. However, no uniform effect was found for the different contours that were ex a mined.