Author response to : Brough et al. in response to the recently published article : Lottering,N., MacGregor,D.M.,Barry,M.D.,Reynolds,M.S., Gregory,L.S., 2014. Introducing standardized protocols for anthropological measurement of virtual sub-adult crania using computed tomography 2(1),34–38

Firstly, we would like to thank Ms. Alison Brough and her colleagues for their positive commentary on our published work [1] and their appraisal of our utility of the “off-set plane” protocol for anthropometric analysis. The standardized protocols described in our manuscript have wide applications, ranging from forensic anthropology and paleodemographic research to clinical settings such as paediatric practice and orthopaedic surgical design. We affirm that the use of geometrically based reference tools commonly found in computer aided design (CAD) programs such as Geomagic Design X® are imperative for more automated and precise measurement protocols for quantitative skeletal analysis. Therefore we stand by our recommendation of the use of software such as Amira and Geomagic Design X® in the contexts described in our manuscript...

Reconsidering pro bono : a comparative analysis of protocols in Australia, the united states, the United Kingdom and Singapore

As of now, there is little evidence on the questions of whether pro bono services are effective, whether lawyer charity is a cheaper way to provide them (because it does cost money to do pro bono), or whether it would in fact be more efficient and effective if firms and attorneys stopped giving their time and instead donated money to the organizations already specializing in these clients and causes. Pro bono may or may not be an efficient way of doing socially important work; at this point, we simply do not know

On the Security of Two RFID Mutual Authentication Protocols

In this paper, the security of two recent RFID mutual authentication protocols are investigated. The first protocol is a scheme proposed by Huang et al. [7] and the second one by Huang, Lin and Li [6]. We show that these two protocols have several weaknesses. In Huang et al.’s scheme, an adversary can determine the 32-bit secret password with a probability of 2−2 , and in Huang-Lin-Li scheme, a passive adversary can recognize a target tag with a success probability of 1−2−4 and an active adversary can determine all 32 bits of Access password with success probability of 2−4 . The computational complexity of these attacks is negligible.

DS-VBF : dual sink vector-based routing protocol for underwater wireless sensor network

Underwater wireless sensor networks (UWSNs) have become the seat of researchers' attention recently due to their proficiency to explore underwater areas and design different applications for marine discovery and oceanic surveillance. One of the main objectives of each deployed underwater network is discovering the optimized path over sensor nodes to transmit the monitored data to onshore station. The process of transmitting data consumes energy of each node, while energy is limited in UWSNs. So energy efficiency is a challenge in underwater wireless sensor network. Dual sinks vector based forwarding (DS-VBF) takes both residual energy and location information into consideration as priority factors to discover an optimized routing path to save energy in underwater networks. The modified routing protocol employs dual sinks on the water surface which improves network lifetime. According to deployment of dual sinks, packet delivery ratio and the average end to end delay are enhanced. Based on our simulation results in comparison with VBF, average end to end delay reduced more than 80%, remaining energy increased 10%, and the increment of packet reception ratio was about 70%.

Managing and sharing health data through information accountability protocols

Concerns over the security and privacy of patient information are one of the biggest hindrances to sharing health information and the wide adoption of eHealth systems. At present, there are competing requirements between healthcare consumers' (i.e. patients) requirements and healthcare professionals' (HCP) requirements. While consumers want control over their information, healthcare professionals want access to as much information as required in order to make well-informed decisions and provide quality care. In order to balance these requirements, the use of an Information Accountability Framework devised for eHealth systems has been proposed. In this paper, we take a step closer to the adoption of the Information Accountability protocols and demonstrate their functionality through an implementation in FluxMED, a customisable EHR system.

A framework for freeway incident modeling and traffic re-routing

This paper proposes an analytical Incident Traffic Management framework for freeway incident modeling and traffic re-routing. The proposed framework incorporates an econometric incident duration model and a traffic re-routing optimization module. The incident duration model is used to estimate the expected duration of the incident and thus determine the planning horizon for the re-routing module. The re-routing module is a CTM-based Single Destination System Optimal Dynamic Traffic Assignment model that generates optimal real-time strategies of re-routing freeway traffic to its adjacent arterial network during incidents. The proposed framework has been applied to a case study network including a freeway and its adjacent arterial network in South East Queensland, Australia. The results from different scenarios of freeway demand and incident blockage extent have been analyzed and advantages of the proposed framework are demonstrated.

Advanced CUBIC protocols for whole-brain and whole-body clearing and imaging

Here we describe a protocol for advanced CUBIC (Clear, Unobstructed Brain/Body Imaging Cocktails and Computational analysis). The CUBIC protocol enables simple and efficient organ clearing, rapid imaging by light-sheet microscopy and quantitative imaging analysis of multiple samples. The organ or body is cleared by immersion for 1–14 d, with the exact time required dependent on the sample type and the experimental purposes. A single imaging set can be completed in 30–60 min. Image processing and analysis can take <1 d, but it is dependent on the number of samples in the data set. The CUBIC clearing protocol can process multiple samples simultaneously. We previously used CUBIC to image whole-brain neural activities at single-cell resolution using Arc-dVenus transgenic (Tg) mice. CUBIC informatics calculated the Venus signal subtraction, comparing different brains at a whole-organ scale. These protocols provide a platform for organism-level systems biology by comprehensively detecting cells in a whole organ or body.

Energy-Efficient Decentralized Cooperative Routing in Wireless Networks

Wireless adhoc networks transmit information from a source to a destination via multiple hops in order to save energy and, thus, increase the lifetime of battery-operated nodes. The energy savings can be especially significant in cooperative transmission schemes, where several nodes cooperate during one hop to forward the information to the next node along a route to the destination. Finding the best multi-hop transmission policy in such a network which determines nodes that are involved in each hop, is a very important problem, but also a very difficult one especially when the physical wireless channel behavior is to be accounted for and exploited. We model the above optimization problem for randomly fading channels as a decentralized control problem - the channel observations available at each node define the information structure, while the control policy is defined by the power and phase of the signal transmitted by each node. In particular, we consider the problem of computing an energy-optimal cooperative transmission scheme in a wireless network for two different channel fading models: (i) slow fading channels, where the channel gains of the links remain the same for a large number of transmissions, and (ii) fast fading channels, where the channel gains of the links change quickly from one transmission to another. For slow fading, we consider a factored class of policies (corresponding to local cooperation between nodes), and show that the computation of an optimal policy in this class is equivalent to a shortest path computation on an induced graph, whose edge costs can be computed in a decentralized manner using only locally available channel state information (CSI). For fast fading, both CSI acquisition and data transmission consume energy. Hence, we need to jointly optimize over both these; we cast this optimization problem as a large stochastic optimization problem. We then jointly optimize over a set of CSI functions of the local channel states, and a c- - orresponding factored class of control poli.

CBCT image guidance in head and neck irradiation: The impact of daily and weekly imaging protocols

Purpose This study evaluated the impact of a daily and weekly image-guided radiotherapy protocols in reducing setup errors and setting of appropriate margins in head and neck cancer patients. Materials and methods Interfraction and systematic shifts for the hypothetical day 1–3 plus weekly imaging were extrapolated from daily imaging data from 31 patients (964 cone beam computed tomography (CBCT) scans). In addition, residual setup errors were calculated by taking the average shifts in each direction for each patient based on the first three shifts and were presumed to represent systematic setup error. The clinical target volume (CTV) to planning target volume (PTV) margins were calculated using van Herk formula and analysed for each protocol. Results The mean interfraction shifts for daily imaging were 0·8, 0·3 and 0·5 mm in the S-I (superior-inferior), L-R (left-right) and A-P (anterior-posterior) direction, respectively. On the other hand the mean shifts for day 1–3 plus weekly imaging were 0·9, 1·8 and 0·5 mm in the S-I, L-R and A-P direction, respectively. The mean day 1–3 residual shifts were 1·5, 2·1 and 0·7 mm in the S-I, L-R and A-P direction, respectively. No significant difference was found in the mean setup error for the daily and hypothetical day 1–3 plus weekly protocol. However, the calculated CTV to PTV margins for the daily interfraction imaging data were 1·6, 3·8 and 1·4 mm in the S-I, L-R and A-P directions, respectively. Hypothetical day 1–3 plus weekly resulted in CTV–PTV margins of 5, 4·2 and 5 mm in the S-I, L-R and A-P direction. Conclusions The results of this study show that a daily CBCT protocol reduces setup errors and allows setup margin reduction in head and neck radiotherapy compared to a weekly imaging protocol.

A fuzzy dynamic flood routing model for natural channels

A fuzzy dynamic flood routing model (FDFRM) for natural channels is presented, wherein the flood wave can be approximated to a monoclinal wave. This study is based on modification of an earlier published work by the same authors, where the nature of the wave was of gravity type. Momentum equation of the dynamic wave model is replaced by a fuzzy rule based model, while retaining the continuity equation in its complete form. Hence, the FDFRM gets rid of the assumptions associated with the momentum equation. Also, it overcomes the necessity of calculating friction slope (S-f) in flood routing and hence the associated uncertainties are eliminated. The fuzzy rule based model is developed on an equation for wave velocity, which is obtained in terms of discontinuities in the gradient of flow parameters. The channel reach is divided into a number of approximately uniform sub-reaches. Training set required for development of the fuzzy rule based model for each sub-reach is obtained from discharge-area relationship at its mean section. For highly heterogeneous sub-reaches, optimized fuzzy rule based models are obtained by means of a neuro-fuzzy algorithm. For demonstration, the FDFRM is applied to flood routing problems in a fictitious channel with single uniform reach, in a fictitious channel with two uniform sub-reaches and also in a natural channel with a number of approximately uniform sub-reaches. It is observed that in cases of the fictitious channels, the FDFRM outputs match well with those of an implicit numerical model (INM), which solves the dynamic wave equations using an implicit numerical scheme. For the natural channel, the FDFRM Outputs are comparable to those of the HEC-RAS model.

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.

Surveillance protocols for management of invasive plants: modelling Chilean needle grass (Nassella neesiana) in Australia

Aim: To develop a surveillance support model that enables prediction of areas susceptible to invasion, comparative analysis of surveillance methods and intensity and assessment of eradication feasibility. To apply the model to identify surveillance protocols for generalized invasion scenarios and for evaluating surveillance and control for a context-specific plant invasion. Location: Australia. Methods: We integrate a spatially explicit simulation model, including plant demography and dispersal vectors, within a Geographical Information System. We use the model to identify effective surveillance protocols using simulations of generalized plant life-forms spreading via different dispersal mechanisms in real landscapes. We then parameterize the surveillance support model for Chilean needle grass [CNG; Nassella neesiana (Trin. & Rupr.) Barkworth], a highly invasive tussock grass, which is an eradication target in south-eastern Queensland, Australia. Results: General surveillance protocols that can guide rapid response surveillance were identified; suitable habitat that is susceptible to invasion through particular dispersal syndromes should be targeted for surveillance using an adaptive seek-and-destroy method. The search radius of the adaptive method should be based on maximum expected dispersal distances. Protocols were used to define a surveillance strategy for CNG, but simulations indicated that despite effective and targeted surveillance, eradication is implausible at current intensities. Main conclusions: Several important surveillance protocols emerged and simulations indicated that effectiveness can be increased if they are followed in rapid response surveillance. If sufficient data are available, the surveillance support model should be parameterized to target areas susceptible to invasion and determine whether surveillance is effective and eradication is feasible. We discovered that for CNG, regardless of a carefully designed surveillance strategy, eradication is implausible at current intensities of surveillance and control and these efforts should be doubled if they are to be successful. This is crucial information in the face of environmentally and economically damaging invasive species and large, expensive and potentially ineffective control programmes.

2 Algorithms For 3-Layer Channel Routing

A channel router is an important design aid in the design automation of VLSI circuit layout. Many algorithms have been developed based on various wiring models with routing done on two layers. With the recent advances in VLSI process technology, it is possible to have three independent layers for interconnection. In this paper two algorithms are presented for three-layer channel routing. The first assumes a very simple wiring model. This enables the routing problem to be solved optimally in a time of O(n log n). The second algorithm is for a different wiring model and has an upper bound of O(n2) for its execution time. It uses fewer horizontal tracks than the first algorithm. For the second model the channel width is not bounded by the channel density.

Developing effective fumigation protocols to manage strongly phosphine-resistant Cryptolestes ferrugineus (Stephens) (Coleoptera: Laemophloeidae)

BACKGROUND The emergence of high levels of resistance in Cryptolestes ferrugineus (Stephens) in recent years threatens the sustainability of phosphine, a key fumigant used worldwide to disinfest stored grain. We aimed at developing robust fumigation protocols that could be used in a range of practical situations to control this resistant pest. RESULTS Values of the lethal time to kill 99.9% (LT99.9, in days) of mixed-age populations, containing all life stages, of a susceptible and a strongly resistant C. ferrugineus population were established at three phosphine concentrations (1.0, 1.5 and 2.0 mg L−1) and three temperatures (25, 30 and 35 °C). Multiple linear regression analysis revealed that phosphine concentration and temperature both contributed significantly to the LT99.9 of a population (P < 0.003, R2 = 0.92), with concentration being the dominant variable, accounting for 75.9% of the variation. Across all concentrations, LT99.9 of the strongly resistant C. ferrugineus population was longest at the lowest temperature and shortest at the highest temperature. For example, 1.0 mg L−1 of phosphine is required for 20, 15 and 15 days, 1.5 mg L−1 for 12, 11 and 9 days and 2.0 mg L−1 for 10, 7 and 6 days at 25, 30 and 35 °C, respectively, to achieve 99.9% mortality of the strongly resistant C. ferrugineus population. We also observed that phosphine concentration is inversely proportional to fumigation period in regard to the population extinction of this pest. CONCLUSION The fumigation protocols developed in this study will be used in recommending changes to the currently registered rates of phosphine in Australia towards management of strongly resistant C. ferrugineus populations, and can be repeated in any country where this type of resistance appears.

Offloading content routing cost from routers

The publish/subscribe paradigm has lately received much attention. In publish/subscribe systems, a specialized event-based middleware delivers notifications of events created by producers (publishers) to consumers (subscribers) interested in that particular event. It is considered a good approach for implementing Internet-wide distributed systems as it provides full decoupling of the communicating parties in time, space and synchronization. One flavor of the paradigm is content-based publish/subscribe which allows the subscribers to express their interests very accurately. In order to implement a content-based publish/subscribe middleware in way suitable for Internet scale, its underlying architecture must be organized as a peer-to-peer network of content-based routers that take care of forwarding the event notifications to all interested subscribers. A communication infrastructure that provides such service is called a content-based network. A content-based network is an application-level overlay network. Unfortunately, the expressiveness of the content-based interaction scheme comes with a price - compiling and maintaining the content-based forwarding and routing tables is very expensive when the amount of nodes in the network is large. The routing tables are usually partially-ordered set (poset) -based data structures. In this work, we present an algorithm that aims to improve scalability in content-based networks by reducing the workload of content-based routers by offloading some of their content routing cost to clients. We also provide experimental results of the performance of the algorithm. Additionally, we give an introduction to the publish/subscribe paradigm and content-based networking and discuss alternative ways of improving scalability in content-based networks. ACM Computing Classification System (CCS): C.2.4 [Computer-Communication Networks]: Distributed Systems - Distributed applications