This article describes the development of a prototype Resilience Analysis Grid for rail traffic management. The findings from testing of the initial model led to the identification of a set of potential vectors for improvement, in particular the need to integrate trade-offs. Based on Resilience Engineering trade-off theory this paper discusses how to integrate trade-offs into the system descrip...

Prey should adjust their defences against natural enemies to match their current level of risk and balance other needs. This is particularly important when optimal defences represent trade-offs, as is the case with many predator-induced trait-mediated indirect effects (TMIEs) that are antagonistic to those promoting host resistance to parasites and pathogens. However, trade-offs may depend on w...

Developing cognitive control over one's thoughts, emotions, and actions is a fundamental process that predicts important life outcomes. Such control begins in infancy, and shifts during development from a predominantly reactive form (e.g. retrieving task-relevant information when needed) to an increasingly proactive form (e.g. maintaining task-relevant information in anticipation of needing it)...

In this paper, we analyze the trade-offs encountered when minimizing the total execution time using the rake-based applications on GPUs. We use clustering data streams as a case study, and present a rake-based implementation for it, making it more efficient in terms of memory usage. In order to maximize performance for different problem sizes and architectures, we propose a model-based auto-tun...

In this chapter, we present several GPU algorithms for evaluating molecular orbitals on three-dimensional lattices, as is commonly used for molecular visualization. For each kernel, we describe necessary design trade-offs, applicability to various problem sizes, and performance on different generations of GPU hardware. Further, we demonstrate the appropriate and effective use of fast on-chip GP...

Modern network applications require high performance and consume a lot of energy. Their inherent dynamic nature makes the dynamic memory subsystem a critical contributing factor to the overall energy consumption and to the execution time performance. This paper presents a novel, systematic methodology for generating performance-energy trade-offs by implementing optimal Dynamic Data Types, finel...

Pharmacological enhancers of cognition promise a bright new future for humankind: more focus, more willpower, and better memory, with applications ranging from education to military combat. Underlying such promises is a linear, more-is-better vision of cognition that makes intuitive sense. This vision is at odds, however, with our understanding of cognition’s evolutionary origins. The mind has ...

Individual variation in social behavior seems ubiquitous, but we know little about how it relates to brain diversity. Among monogamous prairie voles, levels of vasopressin receptor (encoded by the gene avpr1a) in brain regions related to spatial memory predict male space use and sexual fidelity in the field. We find that trade-offs between the benefits of male fidelity and infidelity are reflec...

An s-workspace algorithm is an algorithm that has read-only access to the values of the input, write-only access to the output, and only uses O(s) additional words of space. We present a randomized s-workspace algorithm for triangulating a simple polygon P of n vertices that runs in O(n/s+ n logn log(n/s)) expected time using O(s) variables, for any s ≤ n. In particular, when s ≤ n logn log5 lo...

Given a string X[1, n] and a position k ∈ [1, n], the Shortest Unique Substring of X covering k, denoted by Sk, is a substring X[i, j] of X which satisfies the following conditions: (i) i ≤ k ≤ j, (ii) i is the only position where there is an occurrence of X[i, j], and (iii) j − i is minimized. The best-known algorithm [Hon et al., ISAAC 2015] can find Sk for all k ∈ [1, n] in time O(n) using t...