Does the use of store-and-forward telehealth systems improve outcomes for clinicians managing diabetic foot ulcers? : A pilot study

Diabetic foot ulcers are one of the most hospitalised diabetes complications and contribute to many leg amputations. Trained diabetic foot teams and specialists managing diabetic foot ulcers have demonstrated reductions in amputations and hospitalisation by up to 90%. Few such teams exist in Australia. Thus, access is limited for all geographical populations and may somewhat explain the high rates of hospitalisation. Aim: This pilot study aims to analyse if local clinicians managing diabetic foot complications report improved access to diabetic foot specialists and outcomes with the introduction of a telehealth store-and-forward system. Method: A store-and-forward telehealth system was implemented in six different Queensland locations between August 2009 and February 2010. Sites were offered ad hoc and/or fortnightly telehealth access to a diabetic foot speciality service. A survey was sent six months following commencement of the trial to the 14 eligible clinicians involved in the trial to gauge clinical perception of the telehealth system. Results: Eight participants returned the surveys. The majority of responding clinicians reported that the telehealth system was easy to use (100%), improved their access to diabetic foot speciality services (75%), improved upskilling of local diabetes service staff (100%), and improved patient outcomes (100%). Conclusion: This pilot study suggests that clinicians found the use of a telehealth store-and-forward system very useful in improving access to speciality services, clinical skills and patient outcomes. This study supports the recommendation that telehealth systems should be made available for diabetic foot ulcer management.

Old-fashioned and forward looking : Neoliberalism and nostalgia in the Daring Books for Girls

This paper interogates the international bestselling series, The Daring Books for Girls (Buchanan & Peskowitz, 2007, 2008), asking what kinds of girls are produced through these texts.

Hingeless-rotor aeromechanical stability in axial and forward flight with wake dynamics

A finite-state wake model is used to investigate aeromechanical stability of hingeless-rotor helicopters in the ground-contact, hover and trimmed-night conditions. The investigation covers three items: (1) the convergence of the damping with increasing number of wake harmonics for the lag regressing, and body pitch and roll modes; (2) a parametric study of the damping over a range of thrust level, advance ratio and number of blades; and (3) correlations, primarily with the damping and frequency measurements of these lag and body modes. The convergence and parametric studies are conducted in the hover and trimmed-flight conditions; they include predictions from the widely used dynamic inflow model. The correlations are conducted in the ground-contact conditions and include predictions from the dynamic inflow and vortex models; recently, this vortex model is proposed for the axial-flight conditions and is used to investigate the coupled free vibrations of rotor flapping and body modes. The convergence and parametric studies show that a finite-state wake model that goes well beyond the dynamic inflow model is required for fairly converged damping, Moreover, the correlations from the finite-state wake, dynamic inflow and vortex models are generally satisfactory.

D-MG Tradeoff and Optimal Codes for a Class of AF and DF Cooperative Communication Protocols

Cooperative relay communication in a fading channel environment under the orthogonal amplify-and-forward (OAF), nonorthogonal and orthogonal selection decode-and-forward (NSDF and OSDF) protocols is considered here. The diversity-multiplexing gain tradeoff (DMT) of the three protocols is determined and DMT-optimal distributed space-time (ST) code constructions are provided. The codes constructed are sphere decodable and in some instances incur minimum possible delay. Included in our results is the perhaps surprising finding that the orthogonal and the nonorthogonal amplify-and-forward (NAF) protocols have identical DMT when the time durations of the broadcast and cooperative phases are optimally chosen to suit the respective protocol. Moreover our code construction for the OAF protocol incurs less delay. Two variants of the NSDF protocol are considered: fixed-NSDF and variable-NSDF protocol. In the variable-NSDF protocol, the fraction of time occupied by the broadcast phase is allowed to vary with multiplexing gain. The variable-NSDF protocol is shown to improve on the DMT of the best previously known static protocol when the number of relays is greater than two. Also included is a DMT optimal code construction for the NAF protocol.

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.

A non-orthogonal distributed space-time coded protocol - Part 1:Signal model and design criteria

In this two-part series of papers, a generalized non-orthogonal amplify and forward (GNAF) protocol which generalizes several known cooperative diversity protocols is proposed. Transmission in the GNAF protocol comprises of two phases - the broadcast phase and the cooperation phase. In the broadcast phase, the source broadcasts its information to the relays as well as the destination. In the cooperation phase, the source and the relays together transmit a space-time code in a distributed fashion. The GNAF protocol relaxes the constraints imposed by the protocol of Jing and Hassibi on the code structure. In Part-I of this paper, a code design criteria is obtained and it is shown that the GNAF protocol is delay efficient and coding gain efficient as well. Moreover GNAF protocol enables the use of sphere decoders at the destination with a non-exponential Maximum likelihood (ML) decoding complexity. In Part-II, several low decoding complexity code constructions are studied and a lower bound on the Diversity-Multiplexing Gain tradeoff of the GNAF protocol is obtained.

Voluntary Energy Harvesting Relays and Selection in Cooperative Wireless Networks

The use of energy harvesting (EH) nodes as cooperative relays is a promising and emerging solution in wireless systems such as wireless sensor networks. It harnesses the spatial diversity of a multi-relay network and addresses the vexing problem of a relay's batteries getting drained in forwarding information to the destination. We consider a cooperative system in which EH nodes volunteer to serve as amplify-and-forward relays whenever they have sufficient energy for transmission. For a general class of stationary and ergodic EH processes, we introduce the notion of energy constrained and energy unconstrained relays and analytically characterize the symbol error rate of the system. Further insight is gained by an asymptotic analysis that considers the cases where the signal-to-noise-ratio or the number of relays is large. Our analysis quantifies how the energy usage at an EH relay and, consequently, its availability for relaying, depends not only on the relay's energy harvesting process, but also on its transmit power setting and the other relays in the system. The optimal static transmit power setting at the EH relays is also determined. Altogether, our results demonstrate how a system that uses EH relays differs in significant ways from one that uses conventional cooperative relays.

Flap‐Lag Damping in Hover and Forward Flight with a Three‐Dimensional Wake

Prediction of lag damping is difficult owing to the delicate balance of drag, induced drag and Coriolis forces in the in‐plane direction. Moreover, induced drag” is sensitive to dynamic wake, bath shed and trailing components, and thus its prediction requires adequate unsteady‐wake representation. Accordingly, rigid‐blade flap‐lag equations are coupled with a three‐dimensional finite‐state wake model; three isolatcd rotor canfigurations with three, four and five blades are treated over a range of thrust levels, tack numbers, lag frequencies and advance ratios. The investigation includes convergence characteristics of damping with respect to the number of radial shape functions and harmonics of the wake model for multiblade modes of low frequency (< 1/ rev.) to high frequency (> 1/rev.). Predicted flap and lag damping levels are then compared with similar predictions with 1) rigid wake (no unsteady induced now), 2) Loewy lift deficiency and 3) dynamic inflow. The coverage also includes correlations with the measured lag regressive‐mode damping in hover and forward flight and comparisons with similar correlations with dynamic inflow. Lag‐damping predictions with the dynamic wake model are consistently higher than the predictions with the dynamic inflow model; even for the low frequency lag regressive mode, the number of wake harmonics should at least be equal to twice the number of blades.

Flap-lag-torsion stability in hover and forward flight with three-dimensional wake

The contributions of full-wake dynamics in trim analysis are demonstrated for finding the control inputs and periodic responses simultaneously, as well as in Floquet eigenanalysis for finding the damping levels. The equations of flap bending, lag bending, and torsion are coupled with a three-dimensional, finite state wake, and low-frequency (<1/rev) to high frequency (>1/rev) multiblade modes are considered. Full blade-wake dynamics is used in trim analysis and Floquet eigenanalysis. A uniform cantilever blade in trimmed flight is investigated over a range of thrust levels, advance ratios, number of blades, and blade torsional frequencies. The investigation includes the convergence characteristics of control inputs, periodic responses, and damping levels with respect to the number of spatial azimuthal harmonics and radial shape functions in the wake representation. It also includes correlation with the measured lag damping of a three-bladed untrimmed rotor. The parametric study shows the dominant influence of wake dynamics on control inputs, periodic responses, and damping levels, and wake theory generally improves the correlation.

Multi-hop Cooperative Wireless Networks: Diversity Multiplexing Tradeoff and Optimal Code Design

We consider single-source single-sink (ss-ss) multi-hop relay networks, with slow-fading links and single-antenna half-duplex relay nodes. While two-hop cooperative 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 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.KPP networks, can be viewed as the union of K node-disjoint parallel relaying paths, each of length greater than one. KPP networks 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 DMT of these families of networks completely for K > 3. Layered networks are networks comprising of layers of relays with edges existing only between adjacent layers, with more than one relay in each layer. We prove that a linear DMT between the maximum diversity dmax and the maximum multiplexing gain of 1 is achievable for single-antenna fully-connected layered networks. This is shown to be equal to the optimal DMT if the number of relaying layers is less than 4.For multiple-antenna KPP and layered networks, we provide an achievable DMT, which is significantly better than known lower bounds for half duplex networks.For arbitrary multi-terminal wireless networks with multiple source-sink pairs, the maximum achievable diversity is shown to be equal to the min-cut between the corresponding source and the sink, irrespective of whether the network has half-duplex or full-duplex relays. 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.Along the way, we derive the optimal DMT of a generalized parallel channel and derive lower bounds for the DMT of triangular channel matrices, which are useful in DMT computation of various protocols. We also give alternative and often simpler proofs of several existing results and show that codes achieving full diversity on a MIMO Rayleigh fading channel achieve full diversity on arbitrary fading channels. All protocols in this paper are explicit and use only amplify-and-forward (AF) relaying. We also construct codes with short block-lengths based on cyclic division algebras that achieve the optimal DMT for all the proposed schemes.Two key implications of the results in the paper are that the half-duplex constraint does not entail any rate loss for a large class of cooperative networks and that simple AF protocols are often sufficient to attain the optimal DMT

D-MG Tradeoff and Optimal Codes for a Class of AF and DF Cooperative Communication Protocols

Cooperative relay communication in a fading channel environment under the orthogonal amplify-and-forward (OAF), non-orthogonal and orthogonal selection decode-and-forward (NSDF and OSDF) protocols is considered here. The diversity-multiplexing gain tradeoff (DMT) of the three protocols is determined and DMT-optimal distributed space-time code constructions are provided. The codes constructed are sphere decodable and in some instances incur minimum possible delay. Included in our results is the perhaps surprising finding that the OAF and NAF protocols have identical DMT when the time durations of the broadcast and cooperative phases are optimally chosen to suit the respective protocol. Two variants of the NSDF protocol are considered: fixed-NSDF and variable-NSDF protocol. In the variable-NSDF protocol, the fraction of time occupied by the broadcast phase is allowed to vary with multiplexing gain. In the two-relay case, the variable-NSDF protocol is shown to improve on the DMT of the best previously-known static protocol for higher values of multiplexing gain. Our results also establish that the fixed-NSDF protocol has a better DMT than the NAF protocol for any number of relays.

Collocated and Distributed STBCs with Partial Interference Cancellation Decoding, Part II: Code Construction

In this second part of a two part series of papers, we construct a new class of Space-Time Block Codes (STBCs) for point-to-point MIMO channel and Distributed STBCs (DSTBCs) for the amplify-and-forward relay channel that give full-diversity with Partial Interference Cancellation (PIC) and PIC with Successive Interference Cancellation (PIC-SIC) decoders. The proposed class of STBCs include most of the known full-diversity low complexity PIC/PIC-SIC decodable STBCs as special cases. We also show that a number of known full-diversity PIC/PIC-SIC decodable STBCs that were constructed for the point-topoint MIMO channel can be used as full-diversity PIC/PIC-SIC decodable DSTBCs in relay networks. For the same decoding complexity, the proposed STBCs and DSTBCs achieve higher rates than the known low decoding complexity codes. Simulation results show that the new codes have a better bit error rate performance than the low ML decoding complexity codes available in the literature.

DMT of Multihop Networks: End Points and Computational Tools

In this paper, the diversity-multiplexing gain tradeoff (DMT) of single-source, single-sink (ss-ss), multihop relay networks having slow-fading links is studied. In particular, the two end-points of the DMT of ss-ss full-duplex networks are determined, by showing that the maximum achievable diversity gain is equal to the min-cut and that the maximum multiplexing gain is equal to the min-cut rank, the latter by using an operational connection to a deterministic network. Also included in the paper, are several results that aid in the computation of the DMT of networks operating under amplify-and-forward (AF) protocols. In particular, it is shown that the colored noise encountered in amplify-and-forward protocols can be treated as white for the purpose of DMT computation, lower bounds on the DMT of lower-triangular channel matrices are derived and the DMT of parallel MIMO channels is computed. All protocols appearing in the paper are explicit and rely only upon AF relaying. Half-duplex networks and explicit coding schemes are studied in a companion paper.