Animal crossing: New leaf and the diversity of horror in video games

This paper explores the diverse ways horror can be conveyed in games by investigating how games that are not associated with the horror genre can produce unsettling or scary experiences. To conduct this exploration, this study uses interaction mapping, as outlined by Consalvo and Dutton (2006), to examine a game that has thoroughly pleasant and cutesy trappings: Animal Crossing: New Leaf (Nintendo 2013). The interactions were analysed according to three themes prevalent within literature on horror and horror games: the loss of agency, the Freudian uncanny, and the Heideggerian uncanny. Ultimately, this paper demonstrates that a game which is not explicitly scary is occasionally made so through its rudimentary simulation of human behaviour and societal constructs as well as its autonomous functions and inclusion of real-world time, showing that games have very diverse means of conveying unsettling or horrifying experiences. The paper also shows how frameworks used to analyse games in the horror genre can be applicable to critical readings of non-horror games in order to understand the unexpected player reactions they can evoke

Spectral Relaxations and Fair Densest Subgraphs

Reducing hidden bias in the data and ensuring fairness in algorithmic data analysis has recently received significant attention. In this paper, we address the problem of identifying a densest subgraph, while ensuring that none of one binary protected attribute is disparately impacted. Unfortunately, the underlying algorithmic problem is NP-hard, even in its approximation version: approximating the densest fair subgraph with a polynomial-time algorithm is at least as hard as the densest subgraph problem of at most k vertices, for which no constant approximation algorithms are known. Despite such negative premises, we are able to provide approximation results in two important cases. In particular, we are able to prove that a suitable spectral embedding allows recovery of an almost optimal, fair, dense subgraph hidden in the input data, whenever one is present, a result that is further supported by experimental evidence. We also show a polynomial-time, $2$-approximation algorithm, whenever the underlying graph is itself fair. We finally prove that, under the small set expansion hypothesis, this result is tight for fair graphs. The above theoretical findings drive the design of heuristics, which we experimentally evaluate on a scenario based on real data, in which our aim is to strike a good balance between diversity and highly correlated items from Amazon co-purchasing graphs

History of the Academy of Accounting Historians: 1989-1998

This paper describes the evolution of The Academy of Accounting Historians from 1989 through 1998. It is a continuation of a history of the first 15 years of The Academy that appeared in the December 1989 issue of this journal by the same authors

Making Maps Available for Play: Analyzing the Design of Game Cartography Interfaces.

Maps in video games have grown into complex interactive systems alongside video games themselves. What map systems have done and currently do have not been cataloged or evaluated. We trace the history of game map interfaces from their paper-based inspiration to their current smart phone-like appearance. Read- only map interfaces enable players to consume maps, which is sufficient for wayfinding. Game cartography interfaces enable players to persistently modify maps, expanding the range of activity to support planning and coordination. We employ thematic analysis on game cartography interfaces, contributing a near-exhaustive catalog of games featuring such interfaces, a set of properties to describe and design such interfaces, a collection of play activities that relate to cartography, and a framework to identify what properties promote the activities. We expect that designers will find the contributions enable them to promote desired play experiences through game map interface design

Yellow Tree: A Distributed Main-memory Spatial Index Structure for Moving Objects

Mobile devices equipped with wireless technologies to communicate and positioning systems to locate objects of interest are common place today, providing the impetus to develop location-aware applications. At the heart of location-aware applications are moving objects or objects that continuously change location over time, such as cars in transportation networks or pedestrians or postal packages. Location-aware applications tend to support the tracking of very large numbers of such moving objects as well as many users that are interested in finding out about the locations of other moving objects. Such location-aware applications rely on support from database management systems to model, store, and query moving object data. The management of moving object data exposes the limitations of traditional (spatial) database management systems as well as their index structures designed to keep track of objects\u27 locations. Spatial index structures that have been designed for geographic objects in the past primarily assume data are foremost of static nature (e.g., land parcels, road networks, or airport locations), thus requiring a limited amount of index structure updates and reorganization over a period of time. While handling moving objects however, there is an incumbent need for continuous reorganization of spatial index structures to remain up to date with constantly and rapidly changing object locations. This research addresses some of the key issues surrounding the efficient database management of moving objects whose location update rate to the database system varies from 1 to 30 minutes. Furthermore, we address the design of a highly scaleable and efficient spatial index structure to support location tracking and querying of large amounts of moving objects. We explore the possible architectural and the data structure level changes that are required to handle large numbers of moving objects. We focus specifically on the index structures that are needed to process spatial range queries and object-based queries on constantly changing moving object data. We argue for the case of main memory spatial index structures that dynamically adapt to continuously changing moving object data and concurrently answer spatial range queries efficiently. A proof-of concept implementation called the yellow tree, which is a distributed main-memory index structure, and a simulated environment to generate moving objects is demonstrated. Using experiments conducted on simulated moving object data, we conclude that a distributed main-memory based spatial index structure is required to handle dynamic location updates and efficiently answer spatial range queries on moving objects. Future work on enhancing the query processing performance of yellow tree is also discussed

PICES Press, Vol. 9, No. 1, January 2001

The state of PICES science – 2000 [pp. 1-2] [pdf, 0.6 Mb] The state of the western North Pacific in the first half of 2000 [pp. 3-5] [pdf, 0.7 Mb] The status of the Bering Sea: January – August 2000 [pp. 6-7] [pdf, 0.3 Mb] The state of the eastern North Pacific since spring 2000 [pp. 8-9] [pdf, 0.4 Mb] Makoto Kashiwai [pp. 10-14] [pdf, 0.9 Mb] Alkalinity measurement quality improves for PICES nations [pp. 15-16] [pdf, 0.4 Mb] Dr. Timothy R. Parsons Awarded 2001 Japan Prize [p. 17] [pdf, 0.2 Mb] Highlights of the PICES Nineth Annual Meeting [pp. 18-19] [pdf, 0.4 Mb] Tangible outline of the whole elephant (Results of ecosystem studies of biological resources in the far-eastern seas in 1990s) [pp. 20-24] [pdf, 0.7 Mb] The Oshoro Maru: A short history of Hokkaido University's workhorse in the North Pacific [pp. 25-28] [pdf, 0.4 Mb] Bering Sea and North Pacific Ocean Theme Page [pp. 29-30] [pdf, 0.3 Mb] PICES IX Japan/East Sea cruise [pp. 31-34] [pdf, 1.1 Mb] 35 PICES Wooster Award [p. 35] [pdf, 0.2 Mb] PICES Intern Program [p. 35] [pdf, 0.2 Mb] Obituary - Prof. Michael M. Mulin [p. 36] [pdf, 0.2 Mb