Optimising the length of Random Breath Tests : results from the Queensland Community Engagement Trial

Research suggests that the length and quality of police-citizen encounters affect policing outcomes. The Koper Curve, for example, shows that the optimal length for police presence in hot spots is between 14 and 15 minutes, with diminishing returns observed thereafter. Our study, using data from the Queensland Community Engagement Trial (QCET), examines the impact of encounter length on citizen perceptions of police performance. QCET involved a randomised field trial, where 60 random breath test (RBT) traffic stop operations were randomly allocated to an experimental condition involving a procedurally just encounter or a business-as-usual control condition. Our results show that the optimal length of time for procedurally just encounters during RBT traffic stops is just less than 2 minutes. We show, therefore, that it is important to encourage and facilitate positive police–citizen encounters during RBTat traffic stops, while ensuring that the length of these interactions does not pass a point of diminishing returns.

Efficient selective identity-based encryption without random oracles

We construct two efficient Identity-Based Encryption (IBE) systems that admit selective-identity security reductions without random oracles in groups equipped with a bilinear map. Selective-identity secure IBE is a slightly weaker security model than the standard security model for IBE. In this model the adversary must commit ahead of time to the identity that it intends to attack, whereas in an adaptive-identity attack the adversary is allowed to choose this identity adaptively. Our first system—BB1—is based on the well studied decisional bilinear Diffie–Hellman assumption, and extends naturally to systems with hierarchical identities, or HIBE. Our second system—BB2—is based on a stronger assumption which we call the Bilinear Diffie–Hellman Inversion assumption and provides another approach to building IBE systems. Our first system, BB1, is very versatile and well suited for practical applications: the basic hierarchical construction can be efficiently secured against chosen-ciphertext attacks, and further extended to support efficient non-interactive threshold decryption, among others, all without using random oracles. Both systems, BB1 and BB2, can be modified generically to provide “full” IBE security (i.e., against adaptive-identity attacks), either using random oracles, or in the standard model at the expense of a non-polynomial but easy-to-compensate security reduction.

Short signature without random oracles and the SDH assumption in bilinear groups

We describe a short signature scheme that is strongly existentially unforgeable under an adaptive chosen message attack in the standard security model. Our construction works in groups equipped with an efficient bilinear map, or, more generally, an algorithm for the Decision Diffie-Hellman problem. The security of our scheme depends on a new intractability assumption we call Strong Diffie-Hellman (SDH), by analogy to the Strong RSA assumption with which it shares many properties. Signature generation in our system is fast and the resulting signatures are as short as DSA signatures for comparable security. We give a tight reduction proving that our scheme is secure in any group in which the SDH assumption holds, without relying on the random oracle model.

Random Gabor based templates for facial expression recognition in images with facial occlusion

Robust facial expression recognition (FER) under occluded face conditions is challenging. It requires robust algorithms of feature extraction and investigations into the effects of different types of occlusion on the recognition performance to gain insight. Previous FER studies in this area have been limited. They have spanned recovery strategies for loss of local texture information and testing limited to only a few types of occlusion and predominantly a matched train-test strategy. This paper proposes a robust approach that employs a Monte Carlo algorithm to extract a set of Gabor based part-face templates from gallery images and converts these templates into template match distance features. The resulting feature vectors are robust to occlusion because occluded parts are covered by some but not all of the random templates. The method is evaluated using facial images with occluded regions around the eyes and the mouth, randomly placed occlusion patches of different sizes, and near-realistic occlusion of eyes with clear and solid glasses. Both matched and mis-matched train and test strategies are adopted to analyze the effects of such occlusion. Overall recognition performance and the performance for each facial expression are investigated. Experimental results on the Cohn-Kanade and JAFFE databases demonstrate the high robustness and fast processing speed of our approach, and provide useful insight into the effects of occlusion on FER. The results on the parameter sensitivity demonstrate a certain level of robustness of the approach to changes in the orientation and scale of Gabor filters, the size of templates, and occlusions ratios. Performance comparisons with previous approaches show that the proposed method is more robust to occlusion with lower reductions in accuracy from occlusion of eyes or mouth.

Actinidia DRM1 : an intrinsically disordered protein whose mRNA expression is inversely correlated with spring budbreak in Kiwifruit

Intrinsically disordered proteins (IDPs) are a relatively recently defined class of proteins which, under native conditions, lack a unique tertiary structure whilst maintaining essential biological functions. Functional classification of IDPs have implicated such proteins as being involved in various physiological processes including transcription and translation regulation, signal transduction and protein modification. Actinidia DRM1 (Ade DORMANCY ASSOCIATED GENE 1), represents a robust dormancy marker whose mRNA transcript expression exhibits a strong inverse correlation with the onset of growth following periods of physiological dormancy. Bioinformatic analyses suggest that DRM1 is plant specific and highly conserved at both the nucleotide and protein levels. It is predicted to be an intrinsically disordered protein with two distinct highly conserved domains. Several Actinidia DRM1 homologues, which align into two distinct Actinidia-specific families, Type I and Type II, have been identified. No candidates for the Arabidopsis DRM1-Homologue (AtDRM2) an additional family member, has been identified in Actinidia.

Random projections on manifolds of symmetric positive definite matrices for image classification

Recent advances suggest that encoding images through Symmetric Positive Definite (SPD) matrices and then interpreting such matrices as points on Riemannian manifolds can lead to increased classification performance. Taking into account manifold geometry is typically done via (1) embedding the manifolds in tangent spaces, or (2) embedding into Reproducing Kernel Hilbert Spaces (RKHS). While embedding into tangent spaces allows the use of existing Euclidean-based learning algorithms, manifold shape is only approximated which can cause loss of discriminatory information. The RKHS approach retains more of the manifold structure, but may require non-trivial effort to kernelise Euclidean-based learning algorithms. In contrast to the above approaches, in this paper we offer a novel solution that allows SPD matrices to be used with unmodified Euclidean-based learning algorithms, with the true manifold shape well-preserved. Specifically, we propose to project SPD matrices using a set of random projection hyperplanes over RKHS into a random projection space, which leads to representing each matrix as a vector of projection coefficients. Experiments on face recognition, person re-identification and texture classification show that the proposed approach outperforms several recent methods, such as Tensor Sparse Coding, Histogram Plus Epitome, Riemannian Locality Preserving Projection and Relational Divergence Classification.

Image-guided sampling reveals increased stroma and lower glandular complexity in mammographically dense breast tissue

Mammographic density (MD) adjusted for age and body mass index (BMI) is a strong heritable breast cancer risk factor; however, its biological basis remains elusive. Previous studies assessed MD-associated histology using random sampling approaches, despite evidence that high and low MD areas exist within a breast and are negatively correlated with respect to one another. We have used an image-guided approach to sample high and low MD tissues from within individual breasts to examine the relationship between histology and degree of MD. Image-guided sampling was performed using two different methodologies on mastectomy tissues (n = 12): (1) sampling of high and low MD regions within a slice guided by bright (high MD) and dark (low MD) areas in a slice X-ray film; (2) sampling of high and low MD regions within a whole breast using a stereotactically guided vacuum-assisted core biopsy technique. Pairwise analysis accounting for potential confounders (i.e. age, BMI, menopausal status, etc.) provides appropriate power for analysis despite the small sample size. High MD tissues had higher stromal (P = 0.002) and lower fat (P = 0.002) compositions, but no evidence of difference in glandular areas (P = 0.084) compared to low MD tissues from the same breast. High MD regions had higher relative gland counts (P = 0.023), and a preponderance of Type I lobules in high MD compared to low MD regions was observed in 58% of subjects (n = 7), but did not achieve significance. These findings clarify the histologic nature of high MD tissue and support hypotheses regarding the biophysical impact of dense connective tissue on mammary malignancy. They also provide important terms of reference for ongoing analyses of the underlying genetics of MD.

A comprehensive analysis of parameter settings for novelty-biased cumulative gain

In the TREC Web Diversity track, novelty-biased cumulative gain (α-NDCG) is one of the official measures to assess retrieval performance of IR systems. The measure is characterised by a parameter, α, the effect of which has not been thoroughly investigated. We find that common settings of α, i.e. α=0.5, may prevent the measure from behaving as desired when evaluating result diversification. This is because it excessively penalises systems that cover many intents while it rewards those that redundantly cover only few intents. This issue is crucial since it highly influences systems at top ranks. We revisit our previously proposed threshold, suggesting α be set on a query-basis. The intuitiveness of the measure is then studied by examining actual rankings from TREC 09-10 Web track submissions. By varying α according to our query-based threshold, the discriminative power of α-NDCG is not harmed and in fact, our approach improves α-NDCG's robustness. Experimental results show that the threshold for α can turn the measure to be more intuitive than using its common settings.

A query-basis approach to parametrizing novelty-biased cumulative gain

Novelty-biased cumulative gain (α-NDCG) has become the de facto measure within the information retrieval (IR) community for evaluating retrieval systems in the context of sub-topic retrieval. Setting the incorrect value of parameter α in α-NDCG prevents the measure from behaving as desired in particular circumstances. In fact, when α is set according to common practice (i.e. α = 0.5), the measure favours systems that promote redundant relevant sub-topics rather than provide novel relevant ones. Recognising this characteristic of the measure is important because it affects the comparison and the ranking of retrieval systems. We propose an approach to overcome this problem by defining a safe threshold for the value of α on a query basis. Moreover, we study its impact on system rankings through a comprehensive simulation.

Shared generation of pseudo-random functions

In Crypto’95, Micali and Sidney proposed a method for shared generation of a pseudo-random function f(·) among n players in such a way that for all the inputs x, any u players can compute f(x) while t or fewer players fail to do so, where 0⩽trandom collection of functions, among the n players, each player gets a subset of S, in such a way that any u players together hold all the secret seeds in S while any t or fewer players will lack at least one element from S. The pseudo-random function is then computed as where fsi(·)'s are poly-random functions. One question raised by Micali and Sidney is how to distribute the secret seeds satisfying the above condition such that the number of seeds, d, is as small as possible. In this paper, we continue the work of Micali and Sidney. We first provide a general framework for shared generation of pseudo-random function using cumulative maps. We demonstrate that the Micali–Sidney scheme is a special case of this general construction. We then derive an upper and a lower bound for d. Finally we give a simple, yet efficient, approximation greedy algorithm for generating the secret seeds S in which d is close to the optimum by a factor of at most u ln 2.

Shared generation of pseudo-random functions with cumulative maps

In Crypto’95, Micali and Sidney proposed a method for shared generation of a pseudo-random function f(·) among n players in such a way that for all the inputs x, any u players can compute f(x) while t or fewer players fail to do so, where 0 ≤ t < u ≤ n. The idea behind the Micali-Sidney scheme is to generate and distribute secret seeds S = s1, . . . , sd of a poly-random collection of functions, among the n players, each player gets a subset of S, in such a way that any u players together hold all the secret seeds in S while any t or fewer players will lack at least one element from S. The pseudo-random function is then computed as where f s i (·)’s are poly-random functions. One question raised by Micali and Sidney is how to distribute the secret seeds satisfying the above condition such that the number of seeds, d, is as small as possible. In this paper, we continue the work of Micali and Sidney. We first provide a general framework for shared generation of pseudo-random function using cumulative maps. We demonstrate that the Micali-Sidney scheme is a special case of this general construction.We then derive an upper and a lower bound for d. Finally we give a simple, yet efficient, approximation greedy algorithm for generating the secret seeds S in which d is close to the optimum by a factor of at most u ln 2.

On-road driver sleepiness : what are Australian drivers experiences and awareness of sleepiness while driving?

Objectives: Driver sleepiness contributes substantially to road crash incidents. Simulator and on-road studies clearly reveal an impairing effect from sleepiness for driving ability. However, drivers might not appreciate the dangerousness of driving while sleepy and this could translate to their on-road driving behaviours. This study sought to determine drivers’ on-road experiences of sleepiness, their sleep habits, and personal awareness of the signs of sleepiness. Methods: Participants were a random selection of 92 drivers travelling on a major highway in the state of Queensland, Australia, who were stopped by Police as part of routine drink driving operations. Participants completed a brief questionnaire that included: demographic details, awareness and on-road experiences of sleepy driving, and sleep habits. A modified version of the Karolinska Sleepiness Scale (KSS) was used to assess subjective sleepiness during the last 15 minutes of driving. Results: Participants rating of subjective sleepiness was quite low with 90% reporting at or below 3 on the KSS. Participants were reasonably aware of the signs of sleepiness; with a number of these correlated with on-road experiences. The participants sleep debt correlated with their alertness (r = -.30) and the hours spent driving (r = .38). Conclusions: These results suggest that drivers had moderate or substantial experience of driving when sleepy and many were aware of the signs of sleepiness. As many of the participants reported driving long distances after suboptimal sleep durations, it is possible that their risk perception of the dangerousness of sleepy driving maybe erroneous.

Predictors of mental health in midlife and older women : results from the Australian Healthy Aging of Women Study

Purpose: To examine the extent to which socio-demographic characteristics, modifiable lifestyle factors and health status influence the mental health of midlife and older Australian women from the Australian Healthy Aging of Women (HOW) study. Methods: Data on health status, chronic disease and modifiable lifestyle factors were collected from a random sample of 340 women aged 40-65 years, residing in Queensland, Australia in 2011. Structural equation modelling (SEM) was used to measure the effect of a range of socio-demographic characteristics (marital status, age, income), modifiable lifestyle factors (caffeine intake, alcohol consumption, exercise, physical activity, sleep), and health markers (self-reported physical health, history of chronic illness) on the latent construct, mental health. Mental health was evaluated using the Medical Outcomes Study Short Form 12 (SF-12®) and the Center for Epidemiologic Studies Depression Scale (CES-D). Results: The model was a good fit for the data (χ2 = 40.166, df =312, p 0.125, CFI = 0.976, TLI = 0.950, RMSEA = 0.030, 90% CI = 0.000-0.053); the model suggested mental health was negatively influenced by sleep disturbance (β = -0.628), sedentary lifestyle (β = -0.137), having been diagnosed with one or more chronic illnesses (β = -0.203), and poor self-reported physical health (β = - 0.161). While mental health was associated with sleep, it was not correlated with many other lifestyle factors (BMI (β = -0.050), alcohol consumption (β = 0.079), or cigarette smoking (β = 0.008)) or background socio-demographic characteristics (age (β = 0.078), or income (β = -0.039)). Conclusion: While research suggests that it is important to engage in a range health promoting behaviours to preserve good health, we found that only sleep disturbance, physical health, chronic illness and level of physical activity predicted current mental health. However, while socio-demographic characteristics and modifiable lifestyle factors seemed to have little direct impact on mental health, they probably had an indirect effect.

Cost efficiency of Japanese steam power generation companies : a Bayesian comparison of random and fixed frontier models

This study analyses and compares the cost efficiency of Japanese steam power generation companies using the fixed and random Bayesian frontier models. We show that it is essential to account for heterogeneity in modelling the performance of energy companies. Results from the model estimation also indicate that restricting CO2 emissions can lead to a decrease in total cost. The study finally discusses the efficiency variations between the energy companies under analysis, and elaborates on the managerial and policy implications of the results.

Productivity growth and biased technological change in Japanese airports

In this paper, the productivities of Japanese airports over the period of 1987-2005 are analyzed using the Malmquist index, and technological bias is investigated. During this period, airports on average became less efficient and experienced technological regress. Our results indicate that the traditional growth accounting method, which assumes Hicks neutral technological change, is not appropriate for analyzing changes in productivity for Japanese airports.