Media Coverage of EPA\u27s Draft Dioxin Reassessment Report

Using content analysis, the authors examine the utility of news media in democratic decision making

Sport, public relations and social media

This chapter examines the disruptive nature of social media as it alters the relationship between sports journalism and public relations. It looks at some key examples and argues that while much is changing, some aspects of the relationship between the media and sports also remain constant

Theories of practice and geography

Recent developments in theories of practice have seen place and space taken explicitly into account. In particular, THEODORE SCHATZKI’s ‘site ontology’ offers distinctive but as yet under-explored means of engaging with human geographies. By giving ontological priority to practices as constitutive of the social, this kind of practice theory provides an integrative conceptual framework that enables the analysis of diverse phenomena in relation to each other, over space and time, as they are constituted through practices. This article develops an outline agenda for bringing theories of practice, and particularly SCHATZKI’s ‘site ontology’, together with geographical inquiry. We elucidate this agenda through consideration of three contemporary preoccupations in human geography, comprising emotion, materiality and knowledge

The Cowl - v.79 - n.11 - Nov 20, 2014

The Cowl - student newspaper of Providence College. Vol 79 - No. 11 - November 20, 2014. 24 pages

The Cowl - v.83 - n.9 - Nov 8, 2018

The Cowl - student newspaper of Providence College. Vol 83 - No. 9 - November 8, 2018. 28 pages

Fast filtering and animation of large dynamic networks

Detecting and visualizing what are the most relevant changes in an evolving network is an open challenge in several domains. We present a fast algorithm that filters subsets of the strongest nodes and edges representing an evolving weighted graph and visualize it by either creating a movie, or by streaming it to an interactive network visualization tool. The algorithm is an approximation of exponential sliding time-window that scales linearly with the number of interactions. We compare the algorithm against rectangular and exponential sliding time-window methods. Our network filtering algorithm: i) captures persistent trends in the structure of dynamic weighted networks, ii) smoothens transitions between the snapshots of dynamic network, and iii) uses limited memory and processor time. The algorithm is publicly available as open-source software.Comment: 6 figures, 2 table

The New Hampshire, Vol. 106, No. 26 (Jan. 30, 2017)

An independent student produced newspaper from the University of New Hampshire