In search of the tendon holy grail : predictable clinical outcomes

What is your first reaction when you find out your next patient has a long-term tendinopathy? I suspect you want to hide or get an urgent phone call that drags you away from the practice. You know that the person will have tried multiple interventions, probably had several injections, read all the literature about treatments for tendinopathy on the internet and want an immediate and lifelong cure. You also know that your assessment will take well into your next patient’s time allotment and even then it will remain difficult to prioritise treatments and to explain the rationale behind your plan to the patient. Even as a tendon researcher and part-time clinician whose practice consists solely of tendinopathy patients, my reactions to chronic tendinopathy patients are similar.

An evaluation of Sea Search as a citizen science programme in Marine Protected Areas

Citizen science involves collaboration between multi-sector agencies and the public to address a natural resource management issue. The Sea Search citizen science programme involves community groups in monitoring and collecting subtidal rocky reef and intertidal rocky shore data in Victorian Marine Protected Areas (MPAs), Australia. In this study we compared volunteer and scientifically collected data and the volunteer motivation for participation in the Sea Search programme. Intertidal rocky shore volunteer-collected data was found to be typically comparable to data collected by scientists for species richness and diversity measures. For subtidal monitoring there was also no significant difference for species richness recorded by scientists and volunteers. However, low statistical power suggest only large changes could be detected due to reduced data replication. Generally volunteers recorded lower species diversity for biological groups compared to scientists, albeit not significant. Species abundance measures for algae species were significantly different between volunteers and scientists. These results suggest difficulty in identification and abundance measurements by volunteers and the need for additional training requirements necessary for surveying algae assemblages. The subtidal monitoring results also highlight the difficulties of collecting data in exposed rocky reef habitats with weather conditions and volunteer diver availability constraining sampling effort. The prime motivation for volunteer participation in Sea Search was to assist with scientific research followed closely by wanting to work close to nature. This study revealed two important themes for volunteer engagement in Sea Search: 1) volunteer training and participation and, 2) usability of volunteer collected data for MPA managers. Volunteer-collected data through the Sea Search citizen science programme has the potential to provide useable data to assist in informed management practices of Victoria’s MPAs, but requires the support and commitment from all partners involved.

Black and white : in search of an ‘apt’ response to Indigenous writing

‘The good editor,’ suggests Thomas McCormack in his Fiction Editor, the Novel and the Novelist, ‘reads, and … responds aptly’ to the writer’s work, ‘where “aptly” means “as the ideal appropriate reader would”.’ McCormack develops an argument that encompasses the dual ideas of sensibility and craft as essential characteristics of the fiction editor. But at an historical juncture that has seen increasing interest in the publication of Indigenous writing, and when Indigenous writers themselves may envisage a multiplicity of readers (writing, for instance, for family and community, and to educate a wider white audience), who is the ‘ideal appropriate reader’ for the literary works of the current generation of Australian Indigenous writers? And what should the work of this ‘good editor’ be when engaging with the text of an Indigenous writer? This paper examines such questions using the work of Margaret McDonell and Jennifer Jones, among others, to explore ways in which non-Indigenous editors may apply aspects of McCormack’s ‘apt response’ to the editing of Indigenous texts.

A trilogy on discontinuous innovation. Part I : search

In this article we discuss the concept of Discontinuous Innovation (DI) and how it differs from incremental (or steady-state) innovation. We propose a model to conceptualise the different aspects of DI and discuss the complex nature of the DI process through an investigation of previous literature, and propose a sequence of articles roughly following the key components as described in the conceptual model, beginning with aspects of ‘search’. We then describe an on-going multi-national action research program established to investigate DI through the development of learning networks of firms in several European nations and Australia. The research progress to date is outlined and initial results of analysis on both quantitative and qualitative data collected thus far is used to explore how companies go about searching for clues or ideas about potential discontinuous innovations, which may either create competitive advantage for, or threaten the survival of the business. Key outcomes of the research to date include the identification of the most common search strategies within the participating companies and some descriptive analysis on just how these strategies are implemented in targeted firms. Finally we describe the proposed future research program and the two papers to follow completing the planned three part series on Discontinuous Innovation.

Asset-selling problem with an uncertain deadline, quitting offer, and search skipping option

This paper presents a discrete-time sequential stochastic asset-selling problem with an infinite planning horizon, where the process of selling the asset may reach a deadline at any point in time with a probability. It is assumed that a quitting offer is available at every point in time and search skipping is permitted. Thus, decisions must be made as to whether or not to accept the quitting offer, to accept an appearing buyer’s offer, and to conduct a search for a buyer. The main purpose of this paper is to clarify the properties of the optimal decision rules in relation to the model’s parameters.

Malware variant detection using similarity search over sets of control flow graphs

Static detection of polymorphic malware variants plays an important role to improve system security. Control flow has shown to be an effective characteristic that represents polymorphic malware instances. In our research, we propose a similarity search of malware using novel distance metrics of malware signatures. We describe a malware signature by the set of control flow graphs the malware contains. We propose two approaches and use the first to perform pre-filtering. Firstly, we use a distance metric based on the distance between feature vectors. The feature vector is a decomposition of the set of graphs into either fixed size k-sub graphs, or q-gram strings of the high-level source after decompilation. We also propose a more effective but less computationally efficient distance metric based on the minimum matching distance. The minimum matching distance uses the string edit distances between programs' decompiled flow graphs, and the linear sum assignment problem to construct a minimum sum weight matching between two sets of graphs. We implement the distance metrics in a complete malware variant detection system. The evaluation shows that our approach is highly effective in terms of a limited false positive rate and our system detects more malware variants when compared to the detection rates of other algorithms.

Radio tuning search old style SFX

A sound recording of a very old, large radio/record player with fabulous speakers and vintage sound.

Efficient subwindow search with submodular score functions

Subwindow search aims to find the optimal subimage which maximizes the score function of an object to be detected. After the development of the branch and bound (B&B) method called Efficient Subwindow Search (ESS), several algorithms (IESS [2], AESS [2], ARCS [3]) have been proposed to improve the performance of ESS. For nn images, IESS's time complexity is bounded by O(n³) which is better than ESS, but only applicable to linear score functions. Other work shows that Monge properties can hold in subwindow search and can be used to speed up the search to O(n³), but only applies to certain types of score functions. In this paper we explore the connection between submodular functions and the Monge property, and prove that sub-modular score functions can be used to achieve O(n³) time complexity for object detection. The time complexity can be further improved to be sub-cubic by applying B&B methods on row interval only, when the score function has a multivariate submodular bound function. Conditions for sub-modularity of common non-linear score functions and multivariate submodularity of their bound functions are also provided, and experiments are provided to compare the proposed approach against ESS and ARCS for object detection with some nonlinear score functions.