Dynamic policy simulation of linear models with rational expectations of future events: A computer package

Software;Game Theory

Drawing non-layered tidy trees in linear time

The well-known Reingold–Tilford algorithm produces tidy-layered drawings of trees: drawings where all nodes at the same depth are vertically aligned. However, when nodes have varying heights, layered drawing may use more vertical space than necessary. A non-layered drawing of a tree places children at a fixed distance from the parent, thereby giving a more vertically compact drawing. Moreover, non-layered drawings can also be used to draw trees where the vertical position of each node is given, by adding dummy nodes. In this paper, we present the first linear-time algorithm for producing non-layered drawings. Our algorithm is a modification of the Reingold–Tilford algorithm, but the original complexity proof of the Reingold–Tilford algorithm uses an invariant that does not hold for the non-layered case. We give an alternative proof of the algorithm and its extension to non-layered drawings. To improve drawings of trees of unbounded degree, extensions to the Reingold–Tilford algorithm have been proposed. These extensions also work in the non-layered case, but we show that they then cause a O(n2) run-time. We then propose a modification to these extensions that restores the O(n) run-time

Efficient abstractions for visualization and interaction

Abstractions, such as functions and methods, are an essential tool for any programmer. Abstractions encapsulate the details of a computation: the programmer only needs to know what the abstraction achieves, not how it achieves it. However, using abstractions can come at a cost: the resulting program may be inefficient. This can lead to programmers not using some abstractions, instead writing the entire functionality from the ground up. In this thesis, we present several results that make this situation less likely when programming interactive visualizations. We present results that make abstractions more efficient in the areas of graphics, layout and events

Trying to say what was true': Language, divinity, difference in marilynne robinson's gilead

Marilynne Robinson's Gilead is the journal of elderly minister John Ames, written to the seven-year-old son that he knows he will never live to see grow up. Though quite traditional in his conception of God, Ames nevertheless embraces progressive and even atheistic ideas regarding the divine. This article contends that Gilead resists being read strictly as an exploration of language's failure to express the transcendence of divinity, or, conversely, solely as an articulation of language's cryptic capacity to enact such inability. Instead, it seeks to be read as the confluence of these two approaches. In other words, Robinson's novel troubles the distinction between language's ability and inability to express by formulating it as in/expressibility, as the paradoxical simultaneity of the two that makes divinity discernible as difference. This article thus investigates the markedly unorthodox notion of divinity offered in Gilead and its broader implications for theological discourse. © Australasian Universities Language and Literature Association 2016