Abstract. Reducing the number of edge crossings is considered one of the most important graph drawing aesthetics. While real-world graphs tend to be large and dense, most of the earlier work on evaluating the impact of edge crossings utilizes relatively small graphs that are manually generated and manipulated. We study the effect on task performance of increased edge crossings in automatically ...

Railway level crossings have the potential to bring motor vehicles and trains into fatal contact. In Australia there are approximately 9,400 public railway level crossings across the country, protected either passively (64%) or by active/automated systems (28%). Passive crossings provide only a stationary sign warning of the possibility of trains crossing. Their message remains constant over ti...

We create factor constructs for the physical characteristics of 864 passive railway crossings in South Australia. Crossings are then classified as dangerous or otherwise by means of self-organizing maps, K-means, mixture models and combinations of the latter. Results are compared using historical accident data. The self-organizing map with mixtures approach is found to be optimal in prediction ...

We carry out an exact analysis of the average frequency ν+ αxi in the direction xi of positiveslope crossing of a given level α such that, h(x, t)− h̄ = α, of growing surfaces in spatial dimension d. Here, h(x, t) is the surface height at time t, and h̄ is its mean value. We analyze the problem when the surface growth dynamics is governed by the Kardar-Parisi-Zhang (KPZ) equation without surface ...

Spin-orbit coupled superconductors are interesting candidates for realizing topological and potentially nonAbelian states with Majorana fermions. We argue that time-reversal broken spin-orbit coupled superconductors generically can be characterized as having subgap states that are bound to localized nonmagnetic impurities. Such bound states, which are referred to as the Shiba states, can be det...

Giordano, Liotta and Whitesides [1] developed an algorithm that, given an embedded planar st-digraph and a topological numbering ρ of its vertices, computes in O(n) time a ρ-constrained upward topological book embedding with at most 2n−4 spine crossings per edge. The number of spine crossings per edge is asymptotically worst case optimal. In this poster, we present improved results with respect...

In this essay, we presuppose basic knowledge of stochastic processes [1]. Let {Xt : t ≥ 0} be a zero mean, unit variance, stationary Gaussian process with twice differentiable correlation function r(|s − t|) = Cov(Xs,Xt). We wish to study the distribution of lengths of intervals between zeroes of Xt. There are two cases: the first in which r(τ) is analytic (implying differentiability up to all ...

Atomic avoided crossings in strong magnetic and electric fields are usually identified by the energy level repulsion and by the sharp extremal value of the Shannon’s entropy of the two involved states. In this work the proposal of a new information-theoretic parameter, the continuous Fisher information, for the prediction and characterization of these nonlinear phenomena is done. For just aroun...