3,544 research outputs found
War and Emotion in the Age of Biedermeier: The United Service Journal and the Military Tale
Get PDFA History of Emotions Stephanie Downes, Andrew Lynch, Katrina O'Loughlin. 12.
WAR. AND. EMOTION. IN. THE. AGE. OF. BIEDERMEIER. The United Service
Journal and the military tale Neil Ramsey Following the close of the French ..
War and Trauma
No full textFew concepts have become as closely associated with war literature as trauma. War literature revolves around the isolated voices of soldiers and their deeply unsettled afterlives – it takes as its subject matter the individual experience and consequences of war. This chapter argues, however, that the mass may be more than incidental in our understanding of how war literature embodies trauma. An overwhelming experience, trauma is deeply entangled with mass warfare, industrialisation, and the homogenous, empty time of global capitalism. The question of mass or scale is central to how we have come to conceptualise trauma more generally, whether in relation to genocide, pandemics, ecological limits to growth, or the political consequences of global finance or even mass trauma itself. Understood as a structural condition of anxiety, trauma is now even encroaching upon the future as a pre-traumatic foreboding of militarism and the threat of global catastrophe. Examining these links between war and the mass, this chapter suggests a reconceptualization of trauma that associates its characteristic temporal dislocations with questions of scale, uniformity, and incomprehension
The complexity of proving that a graph is Ramsey
No full textWe say that a graph with n vertices is c-Ramsey if it does not contain either a clique or an independent set of size c log n. We define a CNF formula which expresses this property for a graph G. We show a superpolynomial lower bound on the length of resolution proofs that G is c-Ramsey, for every graph G. Our proof makes use of the fact that every Ramsey graph must contain a large subgraph with some of the statistical properties of the random graph.</p
Facing the Future: the Changing Shape of Academic Skills Support at Bournemouth University
No full textThis paper explores the potential impact of changes to higher education in England on student expectations, engagement, lifestyles and diversity, and outlines implications for the development of digital literacy within academic skills support at Bournemouth University (BU). We will investigate how tackling resource constraints with organisational change can also enable efficient, centralised provision of support materials that utilise networks to overcome the risk of fragmented support for digital literacy. We will also look at how changing delivery modes for support can accommodate changing student lifestyles whilst tackling a weakness of centralised support for digital literacy: that it can become detached from the student’s subject-focused academic practice. Finally we will explore how involving students in developing support can help us to face changes to student expectations and engagement whilst ensuring that materials are authentic and speak to learners in their own voice
The complexity of proving that a graph is Ramsey
No full textWe say that a graph with n vertices is c-Ramsey if it does not contain either a clique or an independent set of size clogn. We define a CNF formula which expresses this property for a graph G. We show a superpolynomial lower bound on the length of resolution proofs that G is c-Ramsey, for every graph G. Our proof makes use of the fact that every Ramsey graph must contain a large subgraph with some of the statistical properties of the random graph
Ultrafilters applied to Ergodic Ramsey Theory
No full textOs ultrafiltros têm aplicações em diversas áreas da matemática, como Topologia, Teoria de Modelos ou Análise Non-standard. Neste trabalho veremos aplicações a Dinâmica Topológica e Teoria de Ramsey para então chegarmos aos resultados clássicos de Teoria Ergódica de Ramsey. Apresentamos uma introdução auto contida à área, baseada em grande parte nos trabalhos de Neil Hindman, Dona Strauss e Vitaly Bergelson.Ultrafilters have applications in several fields of mathematics, such as Topology, Model Theory or Non-Standard Analysis. In this work it will be presented applications to Topological Dynamics and Ramsey Theory, aiming for the classical results from Ergodic Ramsey Theory. We present a self-contained introduction to the area, based mainly on the works of Neil Hindman, Dona Strauss and Vitaly Bergelson
Ramsey equivalence
Get PDFIn this paper, I critique the claim that a theory’s Ramsey sentence (or something like it) is a good candidate for encoding that theory’s structural content, by showing that such a claim leads to implausible criteria of the- oretical equivalence
Why Privacy Matters: An Interview with Neil Richards
No full textProfessor Daniel J. Solove discusses the book \u27Why Privacy Matters\u27 and the future of privacy with the author, Professor Neil Richards
- …
