MIPVU: A manual for identifying metaphor-related words 25 2.1 The basic procedure 25 2.2 Deciding about words: Lexical units 26 2.2.1 General guideline 27 2.2.2 Exceptions 27 2.3 Indirect use potentially explained by cross-domain mapping 32 2.3.1 Identifying contextual meanings 33 2.3.2 Deciding about more basic meanings 35 2.3.3 Deciding about sufficient distinctness 37 2.3.4 Deciding about the role of similarity 37 2.4 Direct use potentially explained by cross-domain mapping 38 2.5 Implicit meaning potentially explained by cross-domain mapping 39 2.6 Signals of potential cross-domain mappings 40 2.7 New-formations and parts that may be potentially explained by cross-domain mapping 41

This paper examines patterns of metaphor in usage. Four samples of text excerpts of on average 47,000 words each were taken from the British National Corpus and annotated for metaphor. The linguistic metaphor data were collected by five analysts on the basis of a highly explicit identification procedure that is a variant of the approach developed by the Pragglejaz Group (Metaphor and Symbol 22: 1–39, 2007). Part of this paper is a report of the protocol and the reliability of the procedure. Data analysis shows that, on average, one in every seven and a half lexical units in the corpus is related to metaphor defined as a potential cross-domain mapping in conceptual structure. It also appears that the bulk of the expression of metaphor in discourse consists of non-signalled metaphorically used words, not similes. The distribution of metaphor-related words, finally, turns out to be quite variable between the four registers examined in this study: academic texts have 18.5%, news 16.4%, fiction 11.7%, and conversation 7.7%. The systematic comparative investigation of these registers raises new questions about the relation between cognitive linguistic and other approaches to metaphor.

Der Beitrag gibt einen Überblick über die Ergebnisse des ZUTECH‐Forschungsvorhabens FOSTA P815, das sich mit dem Ermüdungsverhalten von geschweißten K‐ und KK‐Knoten in Fachwerken aus Rundhohlprofilen mit dickwandigen Gurten beschäftigt hat. Im Mittelpunkt des Beitrags stehen die experimentellen und numerischen Untersuchungen, die zu Planungs‐, Fertigungs‐ und Bemessungsempfehlungen für die Praxis zusammengefasst wurden. Fatigue‐resistant trusses of circular hollow sections with thick‐walled chords. This paper gives an overview about the results of the ZUTECH‐Research Project FOSTA P815 dealing with the fatigue behaviour of welded K‐ and KK‐joints in trusses made of circular hollow sections with thickwalled chords. The focus is laid on the experimental and numerical investigations that had been summarized to recommendations on planning, fabrication and design for practitioners.

No abstract

Prominent among the social developments that the web 2.0 has facilitated is digital social reading (DSR): on many platforms there are functionalities for creating book reviews, 'inline' commenting on book texts, online story writing (often in the form of fanfiction), informal book discussions, book vlogs, and more. In this article we argue that DSR offers unique possibilities for research into literature, reading, the impact of reading and literary communication. We also claim that in this context computational tools are especially relevant, making DSR a field particularly suitable for the application of Digital Humanities methods. We draw up an initial categorization of research aspects of DSR and briefly examine literature for each category. We distinguish between studies on DSR that use it as a lens to study wider processes of literary exchange as opposed to studies for which the DSR culture is a phenomenon interesting in its own right. Via seven examples of DSR research we discuss the chosen approaches and their connection to research questions in literary studies.

No abstract

Recently Koulamas and Kyparisis (2006) introduced past-sequence-dependent setup times to scheduling problems. This means that the setup time of a job is proportionate to the sum of processing times of the jobs already scheduled. Koulamas and Kyparisis (2006) were able to show for a number of single-machine scheduling problems with completion time goals that they remain polynomially solvable. In this paper we extend the analysis to problems with due dates. We were able to show that some problems remain polynomially solvable. However, for some other problems well-known polynomially solution approaches do not guarantee optimality any longer, consequently we concentrated on finding polynomially solvable special cases.

No abstract