Mandatory Reporting and the Difficulties Identifying and Responding to Risk of Severe Neglect: A Response Requiring a Rethink

Neglect of children is a significant social issue worldwide and is typically the most frequently reported form of maltreatment in Western nations, with its severe forms sometimes resulting in significant illness and disablement or death. Yet, paradoxically, it remains ‘neglected’ and largely in the shadow of physical and sexual abuse, often being viewed as less serious despite the real-life consequences of its insidious and compounding nature and the lasting damage it causes to intergenerational familial relationships and the life outcomes of those affected. This chapter explores the many complex forms of child neglect, its causes and impacts and the strategies to prevent it. In particular, a critical standpoint is taken in analysing the rationale and merits of mandatory reporting of neglect and their effects, systemically and for children.

Diversity Multiplexing Tradeoff of Asynchronous Cooperative Relay Networks

The assumption of nodes in a cooperative communication relay network operating in synchronous fashion is often unrealistic. In the present paper we consider two different models of asynchronous operation in cooperative-diversity networks experiencing slow fading and examine the corresponding diversity-multiplexing tradeoffs (DMT). For both models, we propose protocols and distributed space-time codes that asymptotically achieve the transmit diversity bound for all multiplexing gains and for number of relays N >= 2.

Identifying risk-efficient strategies using stochastic frontier analysis and simulation: An application to irrigated cropping in Australia

In irrigated cropping, as with any other industry, profit and risk are inter-dependent. An increase in profit would normally coincide with an increase in risk, and this means that risk can be traded for profit. It is desirable to manage a farm so that it achieves the maximum possible profit for the desired level of risk. This paper identifies risk-efficient cropping strategies that allocate land and water between crop enterprises for a case study of an irrigated farm in Southern Queensland, Australia. This is achieved by applying stochastic frontier analysis to the output of a simulation experiment. The simulation experiment involved changes to the levels of business risk by systematically varying the crop sowing rules in a bioeconomic model of the case study farm. This model utilises the multi-field capability of the process based Agricultural Production System Simulator (APSIM) and is parameterised using data collected from interviews with a collaborating farmer. We found sowing rules that increased the farm area sown to cotton caused the greatest increase in risk-efficiency. Increasing maize area also improved risk-efficiency but to a lesser extent than cotton. Sowing rules that increased the areas sown to wheat reduced the risk-efficiency of the farm business. Sowing rules were identified that had the potential to improve the expected farm profit by ca. $50,000 Annually, without significantly increasing risk. The concept of the shadow price of risk is discussed and an expression is derived from the estimated frontier equation that quantifies the trade-off between profit and risk.

From Holocaust to Rebirth Commemorative Medal

Obverse: A fading Star of David imprisoned behind bars, above the bars clear Star of David. Reverse: The emblem of the State of Israel, inscription.

Golem

Steiner-Prag, was partial to tales of the fantastic, illustrated the Gustav Meyrink novel, The Golem, published in a luxury edition in Leipzig by Kurt Wolff, 1916. In most of the illustrations of the old Jeiwsh quarter of Prague is the protagonist as much as the Golem. In this later drawing, however the bulky figure of the Golem looms on the page in isolation accompanied only by what appear to be a double shadow.

Combat sports analytics: Boxing punch classification using overhead depth imagery

In competitive combat sporting environments like boxing, the statistics on a boxer's performance, including the amount and type of punches thrown, provide a valuable source of data and feedback which is routinely used for coaching and performance improvement purposes. This paper presents a robust framework for the automatic classification of a boxer's punches. Overhead depth imagery is employed to alleviate challenges associated with occlusions, and robust body-part tracking is developed for the noisy time-of-flight sensors. Punch recognition is addressed through both a multi-class SVM and Random Forest classifiers. A coarse-to-fine hierarchical SVM classifier is presented based on prior knowledge of boxing punches. This framework has been applied to shadow boxing image sequences taken at the Australian Institute of Sport with 8 elite boxers. Results demonstrate the effectiveness of the proposed approach, with the hierarchical SVM classifier yielding a 96% accuracy, signifying its suitability for analysing athletes punches in boxing bouts.

Essays on Illegal Activities, Institutions and Economic Growth

In public economics, two extremist views on the functions of a government compete: one emphasizes government working for the public interest to provide value for the citizens, while another regards government mainly as a workhorse for private interests. Moreover, as the sole legitimate authority, the government has the right to define the rules and laws as well as to enforce them. With respect to regulation, two extremes arise: from too little regulation to too much of it. If the government does not function or ceases to exist, the state falls into anarchy or chaos (Somalia). If it regulates too much, it will completely suffocate private activities, which might be considered extralegal (the former Soviet Union). In this thesis I scrutinize the government s interventionist policies and evaluate the question of how to best promote economic well-being. The first two essays assume that the government s policies promote illegal activity. The first paper evaluates the interaction between the government and the mafia, and pays attention to the law enforcement of underground production. We show that the revenue-maximizing government will always monitor the shadow economy, as monitoring contributes to the government s revenue. In general, both legal and illegal firms are hurt by the entry of the mafia. It is, however, plausible that legal firms might benefit by the entry of the mafia if it competes with the government. The second paper tackles the issue of the measurement of the size of the shadow economy. To formulate policies it is essential to know what drives illegal economic activity; is it the tax burden, excess regulation, corruption or a weak legal environment? In this paper we propose an additional explanation for tax evasion and shadow production, namely cultural factors as manifested by religion as determinants of tax morality. According to our findings, Catholic and Protestant countries do not differ in their tax morale. The third paper contributes to the literature discussing the role of the government in promoting economic and productivity growth. Our main result is that, given the complex relationship between economic growth and economic freedom, marketization has not necessarily been beneficial in terms of growth. The last paper builds on traditional growth literature and revisits the debate on convergence clubs arising from demographic transition. We provide new evidence against the idea that countries within a club would converge over time. Instead, we propose that since the demographic transition is a dynamic process, one can expect countries to enter the last regime of stable, modern growth in stages.

Editorial: Closing the gap: Nurses and midwives making a difference

Life expectancy at birth is one of the main indicators of health inequality. Current health and social status indicators for Australian Indigenous people demonstrate major discrepancies in comparison to other Australians. For example, in Australia in 2005–2007 the Indigenous life expectancy gap at birth was 11.5 years for males and 9.7 years for females (Australian Bureau of Statistics, 2009). This gap has remained relatively constant over the last few decades (ABS, 2008). While the main causes of death for Indigenous Australians are similar to those of non-Indigenous Australians, the percentages attributed to the different disease categories are significantly different. For example, death from external causes is 16.2% for the Indigenous population compared to 6.3% for non-Indigenous, and diabetes is 8% for Indigenous Australians compared to 2.4% for non-Indigenous (ABS, 2008; AIHW, 2008). The Australian Government’s response to this troubling issue, urged on by unprecedented support from the public, was the Close the Gap initiative which aims to reduce the gap in life expectancy within a generation (Shadow Report, 2010). Since the introduction of the Close the Gap strategy there have been some claims of success. For example, the Honourable Warren Snowden (Snowden, 2010), Minister for Indigenous Health, outlines some of the changes that have occurred as a result of the implementation of the Indigenous Chronic Disease Package, funded at $805.5 million over four years, as: 294 new positions...

A non-orthogonal cooperative multiple access (NCMA) protocol and low ML decoding complexity codes

A half-duplex constrained non-orthogonal cooperative multiple access (NCMA) protocol suitable for transmission of information from N users to a single destination in a wireless fading channel is proposed. Transmission in this protocol comprises of a broadcast phase and a cooperation phase. In the broadcast phase, each user takes turn broadcasting its data to all other users and the destination in an orthogonal fashion in time. In the cooperation phase, each user transmits a linear function of what it received from all other users as well as its own data. In contrast to the orthogonal extension of cooperative relay protocols to the cooperative multiple access channels wherein at any point of time, only one user is considered as a source and all the other users behave as relays and do not transmit their own data, the NCMA protocol relaxes the orthogonality built into the protocols and hence allows for a more spectrally efficient usage of resources. Code design criteria for achieving full diversity of N in the NCMA protocol is derived using pair wise error probability (PEP) analysis and it is shown that this can be achieved with a minimum total time duration of 2N - 1 channel uses. Explicit construction of full diversity codes is then provided for arbitrary number of users. Since the Maximum Likelihood decoding complexity grows exponentially with the number of users, the notion of g-group decodable codes is introduced for our setup and a set of necesary and sufficient conditions is also obtained.

Diversity and degrees of freedom of cooperative wireless networks

Two key parameters in the outage characterization of a wireless fading network are the diversity and the degrees of freedom (DOF). These two quantities represent the two endpoints of the diversity multiplexing gain tradeoff, In this paper, we present max-flow min-cut type theorems for computing both the diversity and the DOF of arbitrary single-source single-sink networks with nodes possessing multiple antennas. We also show that an amplify-and-forward protocol is sufficient to achieve the same. The DOF characterization is obtained using a conversion to a deterministic wireless network for which the capacity was recently found. This conversion is operational in the sense that a capacity-achieving scheme for the deterministic network can be converted into a DOF-achieving scheme for the fading network. We also show that the diversity result easily extends to multisource multi-sink networks whereas the DOF result extends to a single-source multi-cast network. Along the way, we prove that the zero error capacity of the deterministic network is the same as its c-error capacity.

DMT of Multi-hop Cooperative Networks-Part II: Layered and Multi-Antenna Networks

We consider single-source, single-sink (ss-ss) multi-hop relay networks, with slow-fading Rayleigh links. This two part paper aims at giving explicit protocols and codes to achieve the optimal diversity-multiplexing tradeoff (DMT) of two classes of multi-hop networks: K-parallel-path (KPP) networks and Layered networks. While single-antenna KPP networks were the focus of the first part, we consider layered and multi-antenna networks in this second part. We prove that a linear DMT between the maximum diversity d(max). and the maximum multiplexing gain of 1 is achievable for single-antenna fully-connected layered networks under the half-duplex constraint. This is shown to be equal to the optimal DMT if the number of relaying layers is less than 4. For the multiple-antenna case, we provide an achievable DMT, which is significantly better than known lower bounds for half duplex networks. Along the way, we compute the DMT of parallel MIMO channels in terms of the DMT of the component channel. For arbitrary ss-ss single-antenna directed acyclic networks with full-duplex relays, we prove that a linear tradeoff between maximum diversity and maximum multiplexing gain is achievable using an amplify-and-forward (AF) protocol. Explicit short-block-length codes are provided for all the proposed protocols. Two key implications of the results in the two-part paper are that the half-duplex constraint does not necessarily entail rate loss by a factor of two as previously believed and that simple AN protocols are often sufficient to attain the best possible DMT.

DMT of Multi-hop Cooperative Networks-Part I: K-Parallel-Path Networks

We consider single-source, single-sink multi-hop relay networks, with slow-fading Rayleigh fading links and single-antenna relay nodes operating under the half-duplex constraint. While two hop relay networks have been studied in great detail in terms of the diversity-multiplexing tradeoff (DMT), few results are available for more general networks. In this two-part paper, we identify two families of networks that are multi-hop generalizations of the two hop network: K-Parallel-Path (KPP) networks and Layered networks. In the first part, we initially consider KPP networks, which can be viewed as the union of K node-disjoint parallel paths, each of length > 1. The results are then generalized to KPP(I) networks, which permit interference between paths and to KPP(D) networks, which possess a direct link from source to sink. We characterize the optimal DMT of KPP(D) networks with K >= 4, and KPP(I) networks with K >= 3. Along the way, we derive lower bounds for the DMT of triangular channel matrices, which are useful in DMT computation of various protocols. As a special case, the DMT of two-hop relay network without direct link is obtained. Two key implications of the results in the two-part paper are that the half-duplex constraint does not necessarily entail rate loss by a factor of two, as previously believed and that, simple AF protocols are often sufficient to attain the best possible DMT.

Jointly optimal power control and routing for a single cell, dense, ad hoc wireless network

We consider a dense, ad hoc wireless network confined to a small region, such that direct communication is possible between any pair of nodes. The physical communication model is that a receiver decodes the signal from a single transmitter, while treating all other signals as interference. Data packets are sent between source-destination pairs by multihop relaying. We assume that nodes self-organise into a multihop network such that all hops are of length d meters, where d is a design parameter. There is a contention based multiaccess scheme, and it is assumed that every node always has data to send, either originated from it or a transit packet (saturation assumption). In this scenario, we seek to maximize a measure of the transport capacity of the network (measured in bit-meters per second) over power controls (in a fading environment) and over the hop distance d, subject to an average power constraint. We first argue that for a dense collection of nodes confined to a small region, single cell operation is efficient for single user decoding transceivers. Then, operating the dense ad hoc network (described above) as a single cell, we study the optimal hop length and power control that maximizes the transport capacity for a given network power constraint. More specifically, for a fading channel and for a fixed transmission time strategy (akin to the IEEE 802.11 TXOP), we find that there exists an intrinsic aggregate bit rate (Theta(opt) bits per second, depending on the contention mechanism and the channel fading characteristics) carried by the network, when operating at the optimal hop length and power control. The optimal transport capacity is of the form d(opt)((P) over bar (t)) x Theta(opt) with d(opt) scaling as (P) over bar (1/eta)(t), where (P) over bar (t) is the available time average transmit power and eta is the path loss exponent. Under certain conditions on the fading distribution, we then provide a simple characterisation of the optimal operating point.

Detection of SFBC-OFDM signals in frequency- and time-selective MIMO channels

Use of space-frequency block coded (SFBC) OFDM signals is advantageous in high-mobility broadband wireless access, where the channel is highly time- as well as frequency-selective because of which the receiver experiences both inter-symbol interference (ISI) as well as inter-carrier interference (10). ISI occurs due to the violation of the 'quasi-static' fading assumption caused due to frequency- and/or time-selectivity of the channel. In addition, ICI occurs due to time-selectivity of the channel which results in loss of orthogonality among the subcarriers. In this paper, we are concerned with the detection of SFBC-OFDM signals on time- and frequency-selective MIMO channels. Specifically, we propose and evaluate the performance of an interference cancelling receiver for SFBC-OFDM which alleviates the effects of ISI and ICI in highly time- and frequency-selective channels.

Learning Feature Trajectories Using Gabor Filter Bank for Human Activity Segmentation and Recognition

We describe a novel method for human activity segmentation and interpretation in surveillance applications based on Gabor filter-bank features. A complex human activity is modeled as a sequence of elementary human actions like walking, running, jogging, boxing, hand-waving etc. Since human silhouette can be modeled by a set of rectangles, the elementary human actions can be modeled as a sequence of a set of rectangles with different orientations and scales. The activity segmentation is based on Gabor filter-bank features and normalized spectral clustering. The feature trajectories of an action category are learnt from training example videos using dynamic time warping. The combined segmentation and the recognition processes are very efficient as both the algorithms share the same framework and Gabor features computed for the former can be used for the later. We have also proposed a simple shadow detection technique to extract good silhouette which is necessary for good accuracy of an action recognition technique.