Licensed to sell : product placement in the James Bond film series

As one of the longest running franchises in cinema history, and with its well-established use of product placements, the James Bond film series provides an ideal framework within which to measure and catalogue the number and types of products used within a particular timeframe. This case study will draw upon extensive content analysis of the James Bond film series in order to chart the evolution of product placement across the franchise's 50 year history.

Systematics and biology of the iconic Australian scribbly gum moths Ogmograptis Meyrick (Lepidoptera: Bucculatricidae) and their unique insect-plant interaction

The larvae of particular Ogmograptis spp. produce distinctive scribbles on some smooth-barked Eucalyptus spp. which are a common feature on many ornamental and forest trees in Australia. However, although they are conspicuous in the environment the systematics and biology of the genus has been poorly studied. This has been addressed through detailed field and laboratory studies of their biology of three species (O. racemosa Horak sp. nov., O. fraxinoides Horak sp. nov., O. scribula Meyrick), in conjunction with a comprehensive taxonomic revision support by a molecular phylogeny utilising the mitochondrial Cox1 and nuclear 18S genes. In brief, eggs are laid in bark depressions and the first instar larvae bore into the bark to the level where the future cork cambium forms (the phellegen). Early instar larvae bore wide, arcing tracks in this layer before forming a tighter zig-zag shaped pattern. The second last instar turns and bores either closely parallel to the initial mine or doubles its width, along the zig-zag shaped mine. The final instar possesses legs and a spinneret (unlike the earlier instars) and feeds exclusively on callus tissue which forms within the zig-zag shaped mine formed by the previous instar, before emerging from the bark to pupate at the base of the tree. The scars of mines them become visible scribble following the shedding of bark. Sequence data confirm the placement of Ogmograptis within the Bucculatricidae, suggest that the larvae responsible for the ‘ghost scribbles’ (unpigmented, raised scars found on smooth-barked eucalypts) are members of the genus Tritymba, and support the morphology-based species groups proposed for Ogmograptis. The formerly monotypic genus Ogmograptis Meyrick is revised and divided into three species groups. Eleven new species are described: Ogmograptis fraxinoides Horak sp. nov., Ogmograptis racemosa Horak sp. nov. and Ogmograptis pilularis Horak sp. nov. forming the scribula group with Ogmograptis scribula Meyrick; Ogmograptis maxdayi Horak sp. nov., Ogmograptis barloworum Horak sp. nov., Ogmograptis paucidentatus Horak sp. nov., Ogmograptis rodens Horak sp. nov., Ogmograptis bignathifer Horak sp. nov. and Ogmograptis inornatus Horak sp. nov. as the maxdayi group; Ogmograptis bipunctatus Horak sp. nov., Ogmograptis pulcher Horak sp. nov., Ogmograptis triradiata (Turner) comb. nov. and Ogmograptis centrospila (Turner) comb. nov. as the triradiata group. Ogmograptis notosema (Meyrick) cannot be assigned to a species group as the holotype has not been located. Three unique synapomorphies, all derived from immatures, redefine the family Bucculatricidae, uniting Ogmograptis, Tritymba Meyrick (both Australian) and Leucoedemia Scoble & Scholtz (African) with Bucculatrix Zeller, which is the sister group of the southern hemisphere genera. The systematic history of Ogmograptis and the Bucculatricidae is discussed.

Inferring kangaroo phylogeny from incongruent nuclear and mitochondrial genes

The marsupial genus Macropus includes three subgenera, the familiar large grazing kangaroos and wallaroos of M. (Macropus) and M. (Osphranter), as well as the smaller mixed grazing/browsing wallabies of M. (Notamacropus). A recent study of five concatenated nuclear genes recommended subsuming the predominantly browsing Wallabia bicolor (swamp wallaby) into Macropus. To further examine this proposal we sequenced partial mitochondrial genomes for kangaroos and wallabies. These sequences strongly favour the morphological placement of W. bicolor as sister to Macropus, although place M. irma (black-gloved wallaby) within M. (Osphranter) rather than as expected, with M. (Notamacropus). Species tree estimation from separately analysed mitochondrial and nuclear genes favours retaining Macropus and Wallabia as separate genera. A simulation study finds that incomplete lineage sorting among nuclear genes is a plausible explanation for incongruence with the mitochondrial placement of W. bicolor, while mitochondrial introgression from a wallaroo into M. irma is the deepest such event identified in marsupials. Similar such coalescent simulations for interpreting gene tree conflicts will increase in both relevance and statistical power as species-level phylogenetics enters the genomic age. Ecological considerations in turn, hint at a role for selection in accelerating the fixation of introgressed or incompletely sorted loci. More generally the inclusion of the mitochondrial sequences substantially enhanced phylogenetic resolution. However, we caution that the evolutionary dynamics that enhance mitochondria as speciation indicators in the presence of incomplete lineage sorting may also render them especially susceptible to introgression.

Energy efficient virtual machine placement in data centers

Electricity cost has become a major expense for running data centers and server consolidation using virtualization technology has been used as an important technology to improve the energy efficiency of data centers. In this research, a genetic algorithm and a simulation-annealing algorithm are proposed for the static virtual machine placement problem that considers the energy consumption in both the servers and the communication network, and a trading algorithm is proposed for dynamic virtual machine placement. Experimental results have shown that the proposed methods are more energy efficient than existing solutions.

Placement Trajectory : mapping the journeys of children and young people in out-of-home care

Significant problems confront our child protection out-of-home care system including: high costs; increasing numbers of children and young people entering and remaining in care longer; high frequency of placement movement; and, negative whole-of-life outcomes for children and young people who have exited care. National policy and research agendas recognise the importance of enhancing the evidence base in out-of-home care to inform the development of policy, programs and practice, and improve longitudinal outcomes of children and young people. The authors discuss the concept of placement trajectory as a framework for research and systems analysis in the out-of-home context. While not without limitations, the concept of placement trajectory is particularly useful in understanding the factors influencing placement movement and stability. Increasing the evidence base in this area can serve to enhance improved outcomes across the lifespan for children and young people in the out-of-home care system.

The efficacy of Aloe vera, tea tree oil and saliva as first aid treatment for partial thickness burn injuries

Many alternative therapies are used as first aid treatment for burns, despite limited evidence supporting their use. In this study, Aloe vera, saliva and a tea tree oil impregnated dressing (Burnaid) were applied as first aid to a porcine deep dermal contact burn, compared to a control of nothing. After burn creation, the treatments were applied for 20 min and the wounds observed at weekly dressing changes for 6 weeks. Results showed that the alternative treatments did significantly decrease subdermal temperature within the skin during the treatment period. However, they did not decrease the microflora or improve re-epithelialisation, scar strength, scar depth or cosmetic appearance of the scar and cannot be recommended for the first aid treatment of partial thickness burns.

A hybrid genetic algorithm for the energy-efficient virtual machine placement problem in data centers

Server consolidation using virtualization technology has become an important technology to improve the energy efficiency of data centers. Virtual machine placement is the key in the server consolidation technology. In the past few years, many approaches to the virtual machine placement have been proposed. However, existing virtual machine placement approaches consider the energy consumption by physical machines only, but do not consider the energy consumption in communication network, in a data center. However, the energy consumption in the communication network in a data center is not trivial, and therefore should be considered in the virtual machine placement. In our preliminary research, we have proposed a genetic algorithm for a new virtual machine placement problem that considers the energy consumption in both physical machines and the communication network in a data center. Aiming at improving the performance and efficiency of the genetic algorithm, this paper presents a hybrid genetic algorithm for the energy-efficient virtual machine placement problem. Experimental results show that the hybrid genetic algorithm significantly outperforms the original genetic algorithm, and that the hybrid genetic algorithm is scalable.

Supplementary information : weighted tree kernels for sequence analysis

Genomic sequences are fundamentally text documents, admitting various representations according to need and tokenization. Gene expression depends crucially on binding of enzymes to the DNA sequence at small, poorly conserved binding sites, limiting the utility of standard pattern search. However, one may exploit the regular syntactic structure of the enzyme's component proteins and the corresponding binding sites, framing the problem as one of detecting grammatically correct genomic phrases. In this paper we propose new kernels based on weighted tree structures, traversing the paths within them to capture the features which underpin the task. Experimentally, we and that these kernels provide performance comparable with state of the art approaches for this problem, while offering significant computational advantages over earlier methods. The methods proposed may be applied to a broad range of sequence or tree-structured data in molecular biology and other domains.

Optimal distributed generation placement in radial distribution systems

Distributed generation (DG) resources are commonly used in the electric systems to obtain minimum line losses, as one of the benefits of DG, in radial distribution systems. Studies have shown the importance of appropriate selection of location and size of DGs. This paper proposes an analytical method for solving optimal distributed generation placement (ODGP) problem to minimize line losses in radial distribution systems using loss sensitivity factor (LSF) based on bus-injection to branch-current (BIBC) matrix. The proposed method is formulated and tested on 12 and 34 bus radial distribution systems. The classical grid search algorithm based on successive load flows is employed to validate the results. The main advantages of the proposed method as compared with the other conventional methods are the robustness and no need to calculate and invert large admittance or Jacobian matrices. Therefore, the simulation time and the amount of computer memory, required for processing data especially for the large systems, decreases.

Accurate placement of a pelvic binder improves reduction of unstable fractures of the pelvic ring

The aim of this study was to assess the accuracy of placement of pelvic binders and to determine whether circumferential compression at the level of the greater trochanters is the best method of reducing a symphyseal diastasis. Patients were identified by a retrospective review of all pelvic radiographs performed at a military hospital over a period of 30 months. We analysed any pelvic radiograph on which the buckle of the pelvic binder was clearly visible. The patients were divided into groups according to the position of the buckle in relation to the greater trochanters: high, trochanteric or low. Reduction of the symphyseal diastasis was measured in a subgroup of patients with an open-book fracture, which consisted of an injury to the symphysis and disruption of the posterior pelvic arch (AO/OTA 61-B/C). We identified 172 radiographs with a visible pelvic binder. Five cases were excluded due to inadequate radiographs. In 83 (50%) the binder was positioned at the level of the greater trochanters. A high position was the most common site of inaccurate placement, occurring in 65 (39%). Seventeen patients were identified as a subgroup to assess the effect of the position of the binder on reduction of the diastasis. The mean gap was 2.8 times greater (mean difference 22 mm) in the high group compared with the trochanteric group (p < 0.01). Application of a pelvic binder above the level of the greater trochanters is common and is an inadequate method of reducing pelvic fractures and is likely to delay cardiovascular recovery in these seriously injured patients.

A more efficient and effective heuristic algorithm for the MapReduce placement problem in cloud computing

The placement of the mappers and reducers on the machines directly affects the performance and cost of the MapReduce computation in cloud computing. From the computational point of view, the mappers/reducers placement problem is a generalization of the classical bin packing problem, which is NP-complete. Thus, in this paper we propose a new heuristic algorithm for the mappers/reducers placement problem in cloud computing and evaluate it by comparing with other several heuristics on solution quality and computation time by solving a set of test problems with various characteristics. The computational results show that our heuristic algorithm is much more efficient than the other heuristics. Also, we verify the effectiveness of our heuristic algorithm by comparing the mapper/reducer placement for a benchmark problem generated by our heuristic algorithm with a conventional mapper/reducer placement. The comparison results show that the computation using our mapper/reducer placement is much cheaper while still satisfying the computation deadline.

A new grouping genetic algorithm for the MapReduce placement problem in cloud computing

MapReduce is a computation model for processing large data sets in parallel on large clusters of machines, in a reliable, fault-tolerant manner. A MapReduce computation is broken down into a number of map tasks and reduce tasks, which are performed by so called mappers and reducers, respectively. The placement of the mappers and reducers on the machines directly affects the performance and cost of the MapReduce computation. From the computational point of view, the mappers/reducers placement problem is a generation of the classical bin packing problem, which is NPcomplete. Thus, in this paper we propose a new grouping genetic algorithm for the mappers/reducers placement problem in cloud computing. Compared with the original one, our grouping genetic algorithm uses an innovative coding scheme and also eliminates the inversion operator which is an essential operator in the original grouping genetic algorithm. The new grouping genetic algorithm is evaluated by experiments and the experimental results show that it is much more efficient than four popular algorithms for the problem, including the original grouping genetic algorithm.