Space-time clusters of dengue fever in Bangladesh

Objective:  To examine the space-time clustering of dengue fever (DF) transmission in Bangladesh using geographical information system and spatial scan statistics (SaTScan). Methods:  We obtained data on monthly suspected DF cases and deaths by district in Bangladesh for the period of 2000–2009 from Directorate General of Health Services. Population and district boundary data of each district were collected from national census managed by Bangladesh Bureau of Statistics. To identify the space-time clusters of DF transmission a discrete Poisson model was performed using SaTScan software. Results:  Space-time distribution of DF transmission was clustered during three periods 2000–2002, 2003–2005 and 2006–2009. Dhaka was the most likely cluster for DF in all three periods. Several other districts were significant secondary clusters. However, the geographical range of DF transmission appears to have declined in Bangladesh over the last decade. Conclusion:  There were significant space-time clusters of DF in Bangladesh over the last decade. Our results would prompt future studies to explore how social and ecological factors may affect DF transmission and would also be useful for improving DF control and prevention programs in Bangladesh.

A reference station-based GNSS computing mode to support unified precise point positioning and real-time kinematic services

Currently, the GNSS computing modes are of two classes: network-based data processing and user receiver-based processing. A GNSS reference receiver station essentially contributes raw measurement data in either the RINEX file format or as real-time data streams in the RTCM format. Very little computation is carried out by the reference station. The existing network-based processing modes, regardless of whether they are executed in real-time or post-processed modes, are centralised or sequential. This paper describes a distributed GNSS computing framework that incorporates three GNSS modes: reference station-based, user receiver-based and network-based data processing. Raw data streams from each GNSS reference receiver station are processed in a distributed manner, i.e., either at the station itself or at a hosting data server/processor, to generate station-based solutions, or reference receiver-specific parameters. These may include precise receiver clock, zenith tropospheric delay, differential code biases, ambiguity parameters, ionospheric delays, as well as line-of-sight information such as azimuth and elevation angles. Covariance information for estimated parameters may also be optionally provided. In such a mode the nearby precise point positioning (PPP) or real-time kinematic (RTK) users can directly use the corrections from all or some of the stations for real-time precise positioning via a data server. At the user receiver, PPP and RTK techniques are unified under the same observation models, and the distinction is how the user receiver software deals with corrections from the reference station solutions and the ambiguity estimation in the observation equations. Numerical tests demonstrate good convergence behaviour for differential code bias and ambiguity estimates derived individually with single reference stations. With station-based solutions from three reference stations within distances of 22–103 km the user receiver positioning results, with various schemes, show an accuracy improvement of the proposed station-augmented PPP and ambiguity-fixed PPP solutions with respect to the standard float PPP solutions without station augmentation and ambiguity resolutions. Overall, the proposed reference station-based GNSS computing mode can support PPP and RTK positioning services as a simpler alternative to the existing network-based RTK or regionally augmented PPP systems.

Responding to literature : accessible texts for reluctant readers

The Australian Curriculum: English 5.2 states, across all year level descriptions, that “students engage with a variety of texts for enjoyment”, with the level types of texts and levels of understanding developing over time (ACARA, 2014a). Problems arise when students are unable or unwilling to enjoy texts, and are reluctant to read, view, interpret, and evaluate written texts. This in turn impedes their ability to perform these texts for assessment purposes. The literacy abilities of students can vary widely within a single classroom, and it is a challenge for teachers to source and present texts which are accessible across the spectrum of reading abilities, as well as reflecting themes that are relevant and engaging for students, in addition to being consistent with the General Capabilities and Cross-Curriculum Priorities of the AC:E. In senior English also, the mainstream Qld Senior Syllabus (QSA, 2010, p. 6) requires that students have learning experiences developed through 15-20 literary texts, including the in-depth study of a complete novel. In the leisure context of English Communications, students may also “write stories, poems, or song lyrics” (QSA, 2004, p. 14). Since students’ responses to literature often take the form of other imaginative text creation we address this in this paper. We start by offering synopses of some accessible texts and strategies for teachers with these students who are unwilling or low literacy readers in junior secondary and senior level English. This paper canvases some easily read novels and some films with companion text suggestions which may serve as models for students responses. For the junior secondary texts, we identify how these align with the architecture of the Australian Curriculum’s General Capabilities and Cross Curriculum Priorities. Then, we will outline some suitable imaginative responses as possible assessment outcomes, such as short stories and digital stories.

Hybrid model for motorway travel time estimation considering increased detector spacing

Travel time estimation and prediction on motorways has long been a topic of research. Prediction modeling generally assumes that the estimation is perfect. No matter how good is the prediction modeling- the errors in estimation can significantly deteriorate the accuracy and reliability of the prediction. Models have been proposed to estimate travel time from loop detector data. Generally, detectors are closely spaced (say 500m) and travel time can be estimated accurately. However, detectors are not always perfect, and even during normal running conditions few detectors malfunction, resulting in increase in the spacing between the functional detectors. Under such conditions, error in the travel time estimation is significantly large and generally unacceptable. This research evaluates the in-practice travel time estimation model during different traffic conditions. It is observed that the existing models fail to accurately estimate travel time during large detector spacing and congestion shoulder periods. Addressing this issue, an innovative Hybrid model that only considers loop data for travel time estimation is proposed. The model is tested using simulation and is validated with real Bluetooth data from Pacific Motorway Brisbane. Results indicate that during non free flow conditions and larger detector spacing Hybrid model provides significant improvement in the accuracy of travel time estimation.

From “anytime, anywhere” to “here and now”: place and time restrictions in mobile narratives to enhance situated engagement of mobile users

The usage of the mobile Internet has increased tremendously within the last couple of years, and thereby the vision of accessing information anytime, anywhere has become more realistic and a dominant design principle for providing content. However, this study challenges this paradigm of unlimited and unrestricted access, and explores the question whether constraints and restrictions can positively influence the motivation and enticement of mobile users to engage with location-specific content. Restrictions, such as a particular time or location that gives a user access to content, may be used to foster participation and engagement, as well as to support content production and to enhance the user’s experience. In order to explore this, a Mobile Narrative and a Narrative Map have been created. For the former, the access to individual chapters of the story was restricted. Authors can specify constraints, such as a location or time, which need to be met by the reader if they want to read the story. This concept allows creative writers of the story to exploit the fact that the reader’s context is known, by intensifying the user experience and integrating this knowledge into the writing process. The latter, the Narrative Map, provides users with extracts from stories or information snippets about authors at relevant locations. In both concepts, a feedback channel was also integrated, on which location, time, and size constraints were imposed. In a user-centred design process involving authors and potential readers, those concepts have been implemented, followed by an evaluation comprising four user studies. The results show that restrictions and constraints can indeed lead to more enticing and engaging user experiences, and restricted contribution opportunities can lead to a higher motivation to participate as well as to an improved quality of submissions. These findings are relevant for future developments in the area of mobile narratives and creative writing, as well as for common mobile services that aim for enticing user experiences.

Ruptured relations : guerrilla theatre, time & Pranksterish disability performance practice

Guerrilla theatre tends, by its very definition, to pop up unpredictably – it interrupts what people might see as the proper or typical flow of time, place and space. The subversive tenor of such work means that questions about ‘what has happened’ tend to the decidedly less polite form of ‘WTF’ as passersby struggle to make sense of, and move on from, moments in which accustomed narratives of action and interaction no longer apply. In this paper I examine examples of guerrilla theatre by performers with disabilities in terms of these ruptures in time, and the way they prompt reflection, reconfigure relations, or recede into traditional relations again - focusing particularly on comedian Laurence Clark. Many performers with disabilities – Bill Shannon, Katherine Araniello, Aaron Williamson, Ju Gosling, and others – find guerrilla-style interventions in public places apposite to their aesthetic and political agendas. They prompt passersby to reflect on their relationship to people with disabilities. They can be recorded for later dissection and display, teaching people something about the way social performers, social spectators and society as a whole deal with disability. In this paper, as I unpack Clark's work, I note that the embarrassment that characterises these encounters can be a flag of an ethical process taking place for passersby. Caught between two moments in which time, roles and relationships suddenly fail to flow along the smooth routes of socially determined habits, passersbys’ frowns, gasps and giggles flag difficulties dealing with questions about their attitude to disabled people they do not now know how to answer. I consider the productivity, politics and performerly ethics of drawing passersby into such a process – a chaotic, challenging interstitial time in which a passersbys choices become fodder for public consumption – in such a wholly public way.

A finite volume method with linearisation in time for the solution of advection-reaction-diffusion systems

The numerical solution in one space dimension of advection--reaction--diffusion systems with nonlinear source terms may invoke a high computational cost when the presently available methods are used. Numerous examples of finite volume schemes with high order spatial discretisations together with various techniques for the approximation of the advection term can be found in the literature. Almost all such techniques result in a nonlinear system of equations as a consequence of the finite volume discretisation especially when there are nonlinear source terms in the associated partial differential equation models. This work introduces a new technique that avoids having such nonlinear systems of equations generated by the spatial discretisation process when nonlinear source terms in the model equations can be expanded in positive powers of the dependent function of interest. The basis of this method is a new linearisation technique for the temporal integration of the nonlinear source terms as a supplementation of a more typical finite volume method. The resulting linear system of equations is shown to be both accurate and significantly faster than methods that necessitate the use of solvers for nonlinear system of equations.

A deconvolution method for deriving the transit time spectrum for ultrasound propagation through cancellous bone replica models

The acceptance of broadband ultrasound attenuation for the assessment of osteoporosis suffers from a limited understanding of ultrasound wave propagation through cancellous bone. It has recently been proposed that the ultrasound wave propagation can be described by a concept of parallel sonic rays. This concept approximates the detected transmission signal to be the superposition of all sonic rays that travel directly from transmitting to receiving transducer. The transit time of each ray is defined by the proportion of bone and marrow propagated. An ultrasound transit time spectrum describes the proportion of sonic rays having a particular transit time, effectively describing lateral inhomogeneity of transit times over the surface of the receiving ultrasound transducer. The aim of this study was to provide a proof of concept that a transit time spectrum may be derived from digital deconvolution of input and output ultrasound signals. We have applied the active-set method deconvolution algorithm to determine the ultrasound transit time spectra in the three orthogonal directions of four cancellous bone replica samples and have compared experimental data with the prediction from the computer simulation. The agreement between experimental and predicted ultrasound transit time spectrum analyses derived from Bland–Altman analysis ranged from 92% to 99%, thereby supporting the concept of parallel sonic rays for ultrasound propagation in cancellous bone. In addition to further validation of the parallel sonic ray concept, this technique offers the opportunity to consider quantitative characterisation of the material and structural properties of cancellous bone, not previously available utilising ultrasound.

Time as the critical factor in the investigation of the relationship between pollutant wash-off and rainfall characteristics

The approach adopted for investigating the relationship between rainfall characteristics and pollutant wash-off process is commonly based on the use of parameters which represent the entire rainfall event. This does not permit the investigation of the influence of rainfall characteristics on different sectors of the wash-off process such as first flush where there is a high pollutant wash-off load at the initial stage of the runoff event. This research study analysed the influence of rainfall characteristics on the pollutant wash-off process using two sets of innovative parameters by partitioning wash-off and rainfall characteristics. It was found that the initial 10% of the wash-off process is closely linked to runoff volume related rainfall parameters including rainfall depth and rainfall duration while the remaining part of the wash-off process is primarily influenced by kinetic energy related rainfall parameters, namely, rainfall intensity. These outcomes prove that different sectors of the wash-off process are influenced by different segments of a rainfall event.

Finding space and time in the West

WHENEVER I talk to my students about the requisites for writing, I always tell them that they need at least two things: space and time. Time, which we frequently describe through verbs of motion such as ‘flow’ or ‘flux’, and space, which we usually view as emptiness or the absence of matter. I.e., two dimensions, which are co-dependent, are not only features of the physical world but mental constructs that are elementary to the faculty of cognition...

Real-time image classification for adaptive mission planning using an Autonomous Underwater Vehicle

Real-time image analysis and classification onboard robotic marine vehicles, such as AUVs, is a key step in the realisation of adaptive mission planning for large-scale habitat mapping in previously unexplored environments. This paper describes a novel technique to train, process, and classify images collected onboard an AUV used in relatively shallow waters with poor visibility and non-uniform lighting. The approach utilises Förstner feature detectors and Laws texture energy masks for image characterisation, and a bag of words approach for feature recognition. To improve classification performance we propose a usefulness gain to learn the importance of each histogram component for each class. Experimental results illustrate the performance of the system in characterisation of a variety of marine habitats and its ability to operate onboard an AUV's main processor suitable for real-time mission planning.

A finite volume method for solving the two-sided time-space fractional advection-dispersion equation

We present a finite volume method to solve the time-space two-sided fractional advection-dispersion equation on a one-dimensional domain. The spatial discretisation employs fractionally-shifted Grünwald formulas to discretise the Riemann-Liouville fractional derivatives at control volume faces in terms of function values at the nodes. We demonstrate how the finite volume formulation provides a natural, convenient and accurate means of discretising this equation in conservative form, compared to using a conventional finite difference approach. Results of numerical experiments are presented to demonstrate the effectiveness of the approach.

Pulse-coupled neural network performance for real-time identification of vegetation during forced landing

Safety concerns in the operation of autonomous aerial systems require safe-landing protocols be followed during situations where the mission should be aborted due to mechanical or other failure. This article presents a pulse-coupled neural network (PCNN) to assist in the vegetation classification in a vision-based landing site detection system for an unmanned aircraft. We propose a heterogeneous computing architecture and an OpenCL implementation of a PCNN feature generator. Its performance is compared across OpenCL kernels designed for CPU, GPU, and FPGA platforms. This comparison examines the compute times required for network convergence under a variety of images to determine the plausibility for real-time feature detection.

Multiple-time signature schemes against adaptive chosen message attacks

Multiple-time signatures are digital signature schemes where the signer is able to sign a predetermined number of messages. They are interesting cryptographic primitives because they allow to solve many important cryptographic problems, and at the same time offer substantial efficiency advantage over ordinary digital signature schemes like RSA. Multiple-time signature schemes have found numerous applications, in ordinary, on-line/off-line, forward-secure signatures, and multicast/stream authentication. We propose a multiple-time signature scheme with very efficient signing and verifying. Our construction is based on a combination of one-way functions and cover-free families, and it is secure against the adaptive chosen-message attack.

Decomposition construction for secret sharing schemes with graph access structures in polynomial time

The purpose of this paper is to describe a new decomposition construction for perfect secret sharing schemes with graph access structures. The previous decomposition construction proposed by Stinson is a recursive method that uses small secret sharing schemes as building blocks in the construction of larger schemes. When the Stinson method is applied to the graph access structures, the number of such “small” schemes is typically exponential in the number of the participants, resulting in an exponential algorithm. Our method has the same flavor as the Stinson decomposition construction; however, the linear programming problem involved in the construction is formulated in such a way that the number of “small” schemes is polynomial in the size of the participants, which in turn gives rise to a polynomial time construction. We also show that if we apply the Stinson construction to the “small” schemes arising from our new construction, both have the same information rate.