Targeting Escalation and Harm in Intimate Partner Violence: Evidence from Northern Territory Police, Australia

Research Question: Does analysis of intimate partner violence (IPV) among Aboriginal and non-Aboriginal couples in the Northern Territory (NT), Australia reveal any predictable escalation in frequency or severity of harm over a four-year observation period? Data: We examined all 61,796 incidents of IPV recorded by the NT Police for 23,104 unique couples (‘dyads’), over the five year period from 1 January 2010 to 31 December 2014. For purposes of analysing changes over time in frequency and harm, we used standardized observation periods (generally four years) from first incident to end of observations. Methods: Each IPV incident was re-classified by crime type using the penal code of England and Wales, in order to measure the severity of harm in NT with the Cambridge Crime Harm Index (CHI). The CHI scores were used to test for patterns of concentration and escalation, based on the total days of recommended imprisonment for each offence type, summed across all offences of that type for the entire sample. Findings: The findings were sharply split between Aboriginal and white dyads. While there was no evidence of escalation in either frequency or severity of IPV 2 incidents in the white dyads, there was substantial evidence of escalation among Aboriginal offenders with three or more incidents in a four year period. Less than 2% of white offenders (2 of 111) had three or more incidents in four years, compared to 32.4% of Aboriginals (N = 105 out of 355 offenders). For those couples of both races known by police to have two or more incidents, there was a strong pattern of escalation in the frequency and seriousness of offending for up to 20 incidents over four years. While 66% of couples had desisted by year 3 with no further reports that year or the next, among the 34% of couples (N= 3,621) persisting into year 3 the probability of a new incident by year 4 was 99.9%. Similarly, the time between incidents for these repeaters declined with each new incident, indicating an increase in frequency. Severity of harm also rose with repeated incidents, from 0.6 of expected Cambridge CHI value per dyad among couples with 1 to 5 incidents over four years to 3.82 times higher than expected value per dyad among those couples observed to have 16-20 incidents over four years—six times more harm among couples (almost entirely Aboriginals) with the highest frequency of incidents than among couples with the lowest frequency. Conclusions: This targeting analysis confirms other research that shows no escalation in frequency or severity of domestic abuse among predominantly white European populations. Yet it also provides the first systematic test of the escalation hypothesis about IPV reported to police among Australian Aboriginal dyads. That evidence provides a strong basis in evidence for developing a two-track policy for policing IPV in Australian areas with substantial Indigenous populations. Track 1 would serve dyads (of either race) presenting for the first or second time, for whom a light touch may generally be sufficient. Yet any couple known to have had two or more prior offences could receive a far more intensive 3 strategic investment, including the testing of new strategies for prevention of escalation in harm or frequency of IPV. Yet because this pattern of escalation is found only in a minority of Aboriginal dyads, it is important to base policy on evidence-based targeting of dyads with prior occurrences rather than race. KEY WORDS: Intimate Partner Violence/Domestic Abuse/ Aboriginal Offenders and Victims/ Police/ Evidence-Based Targetin

Evolving graphs: dynamical models, inverse problems and propagation

Applications such as neuroscience, telecommunication, online social networking, transport and retail trading give rise to connectivity patterns that change over time. In this work, we address the resulting need for network models and computational algorithms that deal with dynamic links. We introduce a new class of evolving range-dependent random graphs that gives a tractable framework for modelling and simulation. We develop a spectral algorithm for calibrating a set of edge ranges from a sequence of network snapshots and give a proof of principle illustration on some neuroscience data. We also show how the model can be used computationally and analytically to investigate the scenario where an evolutionary process, such as an epidemic, takes place on an evolving network. This allows us to study the cumulative effect of two distinct types of dynamics

Any-order propagation of the nonlinear Schroedinger equation

We derive an exact propagation scheme for nonlinear Schroedinger equations. This scheme is entirely analogous to the propagation of linear Schroedinger equations. We accomplish this by defining a special operator whose algebraic properties ensure the correct propagation. As applications, we provide a simple proof of a recent conjecture regarding higher-order integrators for the Gross-Pitaevskii equation, extend it to multi-component equations, and to a new class of integrators.Comment: 10 pages, no figures, submitted to Phys. Rev.

Mining and Analyzing the Italian Parliament: Party Structure and Evolution

The roll calls of the Italian Parliament in the XVI legislature are studied by employing multidimensional scaling, hierarchical clustering, and network analysis. In order to detect changes in voting behavior, the roll calls have been divided in seven periods of six months each. All the methods employed pointed out an increasing fragmentation of the political parties endorsing the previous government that culminated in its downfall. By using the concept of modularity at different resolution levels, we identify the community structure of Parliament and its evolution in each of the considered time periods. The analysis performed revealed as a valuable tool in detecting trends and drifts of Parliamentarians. It showed its effectiveness at identifying political parties and at providing insights on the temporal evolution of groups and their cohesiveness, without having at disposal any knowledge about political membership of Representatives.Comment: 27 pages, 14 figure

Properties of continuous Fourier extension of the discrete cosine transform and its multidimensional generalization

A versatile method is described for the practical computation of the discrete Fourier transforms (DFT) of a continuous function $g(t)$ given by its values $g_{j}$ at the points of a uniform grid $F_{N}$ generated by conjugacy classes of elements of finite adjoint order $N$ in the fundamental region $F$ of compact semisimple Lie groups. The present implementation of the method is for the groups SU(2), when $F$ is reduced to a one-dimensional segment, and for $SU(2)\times ... \times SU(2)$ in multidimensional cases. This simplest case turns out to result in a transform known as discrete cosine transform (DCT), which is often considered to be simply a specific type of the standard DFT. Here we show that the DCT is very different from the standard DFT when the properties of the continuous extensions of these two discrete transforms from the discrete grid points $t_j; j=0,1, ... N$ to all points $t \in F$ are considered. (A) Unlike the continuous extension of the DFT, the continuous extension of (the inverse) DCT, called CEDCT, closely approximates $g(t)$ between the grid points $t_j$. (B) For increasing $N$, the derivative of CEDCT converges to the derivative of $g(t)$. And (C), for CEDCT the principle of locality is valid. Finally, we use the continuous extension of 2-dimensional DCT to illustrate its potential for interpolation, as well as for the data compression of 2D images.Comment: submitted to JMP on April 3, 2003; still waiting for the referee's Repor

TRAINING FOR THE BIKE TO RUN TRANSITION IN TRIATHLON

The purpose of this study was to examine the effect of a practice regimen that targets the bike-to-run transition for triathlons; known as brick workouts. The principle of specificity suggests that since this skill is a critical transition in a triathlon, having further impact on the subsequent running section, practicing this skill is vital for success. Moreover, the identification of performance parameters that quantify a successful transition will serve to maximize practice efficiency. Subjects (N=12) performed either brick workouts or single event training, to examine their effects on the bike-run transition. Our results indicate that the brick workouts had a positive effect by eliciting an increased adaptability in knee behavior in response to the transition from cycling to running. Quicker adoption of efficient running mechanics may ensue, leading to less fatigue and greater performance

Reducing drug related deaths : a pre-implementation assessment of knowledge,barriers and enablers for naloxone distribution through general practice

Peer reviewedPublisher PD

Bounds on Quantum Correlations in Bell Inequality Experiments

Bell inequality violation is one of the most widely known manifestations of entanglement in quantum mechanics; indicating that experiments on physically separated quantum mechanical systems cannot be given a local realistic description. However, despite the importance of Bell inequalities, it is not known in general how to determine whether a given entangled state will violate a Bell inequality. This is because one can choose to make many different measurements on a quantum system to test any given Bell inequality and the optimization over measurements is a high-dimensional variational problem. In order to better understand this problem we present algorithms that provide, for a given quantum state, both a lower bound and an upper bound on the maximal expectation value of a Bell operator. Both bounds apply techniques from convex optimization and the methodology for creating upper bounds allows them to be systematically improved. In many cases these bounds determine measurements that would demonstrate violation of the Bell inequality or provide a bound that rules out the possibility of a violation. Examples are given to illustrate how these algorithms can be used to conclude definitively if some quantum states violate a given Bell inequality.Comment: 13 pages, 1 table, 2 figures. Updated version as published in PR

Mirror formation control in the vicinity of an asteroid

Two strategies are presented for the positioning and control of a spacecraft formation designed to focus sunlight onto a point on the surface of asteroid, thereby sublimating the material and ejecting debris creating thrust. In the first approach, the formation is located at artficial equilibrium points around the asteroid and controlled using the force from the solar radiation pressure. The second approach determines the optimal periodic formation orbits, subject to the gravitational perturbations from the asteroid, the solar radiation pressure and the control acceleration derived from a control law

Products, coproducts and singular value decomposition

Products and coproducts may be recognized as morphisms in a monoidal tensor category of vector spaces. To gain invariant data of these morphisms, we can use singular value decomposition which attaches singular values, ie generalized eigenvalues, to these maps. We show, for the case of Grassmann and Clifford products, that twist maps significantly alter these data reducing degeneracies. Since non group like coproducts give rise to non classical behavior of the algebra of functions, ie make them noncommutative, we hope to be able to learn more about such geometries. Remarkably the coproduct for positive singular values of eigenvectors in $A$ yields directly corresponding eigenvectors in A\otimes A.Comment: 17 pages, three eps-figure