EPG monitoring of the probing behaviour of the common brown leafhopper Orosius orientalis on artificial diet and selected host plants

The common brown leafhopper Orosius orientalis (Hemiptera: Cicadellidae) is a polyphagous vector of a range of economically important pathogens, including phytoplasmas and viruses, which infect a diverse range of crops. Studies on the plant penetration behaviour by O. orientalis were conducted using the electrical penetration graph (EPG) technique to assist in the characterisation of pathogen acquisition and transmission. EPG waveforms representing different probing activities were acquired from adult O. orientalis probing in planta, using two host species, tobacco Nicotiana tabacum and bean Phaseolus vulgaris, and in vitro using a simple sucrose-based artificial diet. Five waveforms (O1–O5) were evident when O. orientalis fed on bean, whereas only four waveforms (O1–O4) and three waveforms (O1–O3) were observed when the leafhopper fed on tobacco and on the artificial diet, respectively. Both the mean duration of each waveform and waveform type differed markedly depending on the food substrate. Waveform O4 was not observed on the artificial diet and occurred relatively rarely on tobacco plants when compared with bean plants. Waveform O5 was only observed with leafhoppers probing on beans. The attributes of the waveforms and comparative analyses with previously published Hemipteran data are presented and discussed, but further characterisation studies will be needed to confirm our suggestions.

Bayesian hierarchical models in statistical quality control methods to improve healthcare in hospitals

Quality oriented management systems and methods have become the dominant business and governance paradigm. From this perspective, satisfying customers’ expectations by supplying reliable, good quality products and services is the key factor for an organization and even government. During recent decades, Statistical Quality Control (SQC) methods have been developed as the technical core of quality management and continuous improvement philosophy and now are being applied widely to improve the quality of products and services in industrial and business sectors. Recently SQC tools, in particular quality control charts, have been used in healthcare surveillance. In some cases, these tools have been modified and developed to better suit the health sector characteristics and needs. It seems that some of the work in the healthcare area has evolved independently of the development of industrial statistical process control methods. Therefore analysing and comparing paradigms and the characteristics of quality control charts and techniques across the different sectors presents some opportunities for transferring knowledge and future development in each sectors. Meanwhile considering capabilities of Bayesian approach particularly Bayesian hierarchical models and computational techniques in which all uncertainty are expressed as a structure of probability, facilitates decision making and cost-effectiveness analyses. Therefore, this research investigates the use of quality improvement cycle in a health vii setting using clinical data from a hospital. The need of clinical data for monitoring purposes is investigated in two aspects. A framework and appropriate tools from the industrial context are proposed and applied to evaluate and improve data quality in available datasets and data flow; then a data capturing algorithm using Bayesian decision making methods is developed to determine economical sample size for statistical analyses within the quality improvement cycle. Following ensuring clinical data quality, some characteristics of control charts in the health context including the necessity of monitoring attribute data and correlated quality characteristics are considered. To this end, multivariate control charts from an industrial context are adapted to monitor radiation delivered to patients undergoing diagnostic coronary angiogram and various risk-adjusted control charts are constructed and investigated in monitoring binary outcomes of clinical interventions as well as postintervention survival time. Meanwhile, adoption of a Bayesian approach is proposed as a new framework in estimation of change point following control chart’s signal. This estimate aims to facilitate root causes efforts in quality improvement cycle since it cuts the search for the potential causes of detected changes to a tighter time-frame prior to the signal. This approach enables us to obtain highly informative estimates for change point parameters since probability distribution based results are obtained. Using Bayesian hierarchical models and Markov chain Monte Carlo computational methods, Bayesian estimators of the time and the magnitude of various change scenarios including step change, linear trend and multiple change in a Poisson process are developed and investigated. The benefits of change point investigation is revisited and promoted in monitoring hospital outcomes where the developed Bayesian estimator reports the true time of the shifts, compared to priori known causes, detected by control charts in monitoring rate of excess usage of blood products and major adverse events during and after cardiac surgery in a local hospital. The development of the Bayesian change point estimators are then followed in a healthcare surveillances for processes in which pre-intervention characteristics of patients are viii affecting the outcomes. In this setting, at first, the Bayesian estimator is extended to capture the patient mix, covariates, through risk models underlying risk-adjusted control charts. Variations of the estimator are developed to estimate the true time of step changes and linear trends in odds ratio of intensive care unit outcomes in a local hospital. Secondly, the Bayesian estimator is extended to identify the time of a shift in mean survival time after a clinical intervention which is being monitored by riskadjusted survival time control charts. In this context, the survival time after a clinical intervention is also affected by patient mix and the survival function is constructed using survival prediction model. The simulation study undertaken in each research component and obtained results highly recommend the developed Bayesian estimators as a strong alternative in change point estimation within quality improvement cycle in healthcare surveillances as well as industrial and business contexts. The superiority of the proposed Bayesian framework and estimators are enhanced when probability quantification, flexibility and generalizability of the developed model are also considered. The empirical results and simulations indicate that the Bayesian estimators are a strong alternative in change point estimation within quality improvement cycle in healthcare surveillances. The superiority of the proposed Bayesian framework and estimators are enhanced when probability quantification, flexibility and generalizability of the developed model are also considered. The advantages of the Bayesian approach seen in general context of quality control may also be extended in the industrial and business domains where quality monitoring was initially developed.

Isopropyl 2,2-bis(4-bromophenyl)-2-hydroxyacetate

In the structure of the title compound C17H16Br2O3, which is a restricted commercial acaricide (common name bromopropylate), has two independent and conformationally similar molecules in the asymmetric unit [dihedral angle between the planes of the two phenyl rings in each, 68.7(4) and 77.4(5)deg]. The C-atoms of the isopropyl group of one of the molecules are disordered over two sites with occupancies of 0.638 and 0.362. Minor non-merohedral twinning was also present in the crystal. Intermolecular hydrogen-bonding interactions involving the hydroxy groups and carboxyl O-atom acceptors give separate centrosymmetric homodimers through cyclic hydrogen-bonding motifs [graph set R2/2(10)].

A virtual environment to simulate the experience of psychosis

Psychosis is a mental disorder that affects 1-2% of the population at some point in their lives. One of the main causes of psychosis is the mental illness schizophrenia. Sufferers of this illness often have terrifying symptoms such as hallucinations, delusions, and thought disorder. This project aims to develop a virtual environment to simulate the experience of psychosis, focusing on re-creating auditory and visual hallucinations. A model of a psychiatric ward was created and the psychosis simulation software was written to re-create the auditory and visual hallucinations of one particular patient. The patient was very impressed with the simulation, and commented that it effectively re-created the same emotions that she experienced on a day-to-day basis during her psychotic episodes. It is hoped that this work will result in a useful educational tool about schizophrenia, leading to improved training of clinicians, and fostering improved understanding and empathy toward sufferers of schizophrenia in the community, ultimately improving the quality of life and chances of recovery of patients.

4-(4-Nitrobenzyl)pyridinium 3-carboxy-4-hydroxybenzenesulfonate

In the title salt, C12H11N2O2+·C7H5O6S-, the dihedral angle between the benzene and pyridine rings in the 4-(4-nitrobenzyl)pyridinium cation is 82.7 (2)°. Within the anion there is an intramolecular hydroxy-O-HO(carboxylic acid) bond. In the crystal, the cation forms a single N+-HOsulfonate hydrogen bond with the anion. These cation-anion pairs interact through duplex anion carboxylic acid O-HOsulfonate hydrogen bonds, giving a centrosymmetric cyclic association [graph set R22(16)]. The crystals studied were non-merohedrally twinned.

4-Amino-N-(4,6-dimethylpyrimidin-2-yl)benzenesulfonamide--2-nitrobenzoic acid (1/1)

In the asymmetric unit of the title co-crystal, C12H14N4O2S·C7H5NO4, the sulfamethazine and 2-nitrobenzoic acid molecules form a heterodimer through intermolecular amide-carboxylic acid N-HO and carboxylic acid-pyrimidine O-HN hydrogen-bond pairs, giving a cyclic motif [graph set R22(8)]. The dihedral angle between the two aromatic ring systems in the sulfamethazine molecule is 88.96 (18)° and the nitro group of the acid is 50% rotationally disordered. Secondary aniline N-HOsulfone hydrogen-bonding associations give a two-dimensional structure lying parallel to the ab plane.

Spinning a sustainable yarn: assessing the claims of Australian companies’ eco-initiatives

In Australia, few fashion brands have intervened in the design of their products or the systems around their product to tackle environmental pollution and waste. Instead, support of charities (whether social or environmental) has become conflated with sustainability in the eyes of the public.However, three established Australian brands recently put forward initiatives which explicitly tackle the pre-consumer or post-consumer waste associated with their products. In 2011, Billabong, one of the largest surfwear companies in the world, developed a collection of board shorts made from recycled bottles that are also recyclable at end of life. The initiative has been promoted in partnership with Bob Marley’s son Rohan Marley, and the graphics of the board shorts reference the Rastafarian colours and make use of Marley’s song lyrics. In this way, the company has tapped into an aspect of surf culture linked to environmental activism, in which the natural world is venerated. Two mid-market initiatives, by Metalicus and Country Road, each have a social outcome that arguably aligns to the values of their middle-class consumer base. Metalicus is spear-heading a campaign for Australian garment manufacturers to donate their pre consumer waste – fabric off-cuts – to charity Open Family Australia to be manufactured into quilts for the homeless. Country Road has partnered with the Australian Red Cross to implement a recycling scheme in which consumers donate their old Country Road garments in exchange for a Country Road gift voucher. Both strategies, while tackling waste, tell an altruistic story in which the disadvantaged can benefit from the consumption habits of the middle-class. To varying degrees, the initiative chosen by each company feeds into the stories they tell about themselves and about the consumers who purchase their clothing. However, how can we assess the impact of these schemes on waste management in real terms, or indeed the worth of each scheme in the wider context of the fashion system? This paper will assess the claims made by the companies and analyse their efficacy, suggesting that a more nuanced assessment of green claims is required, in which ‘green’ comes in many tonal variations.

A framework for automated identification of attack scenarios on IT infrastructures

Due to increased complexity, scale, and functionality of information and telecommunication (IT) infrastructures, every day new exploits and vulnerabilities are discovered. These vulnerabilities are most of the time used by ma¬licious people to penetrate these IT infrastructures for mainly disrupting business or stealing intellectual pro¬perties. Current incidents prove that it is not sufficient anymore to perform manual security tests of the IT infra¬structure based on sporadic security audits. Instead net¬works should be continuously tested against possible attacks. In this paper we present current results and challenges towards realizing automated and scalable solutions to identify possible attack scenarios in an IT in¬frastructure. Namely, we define an extensible frame¬work which uses public vulnerability databases to identify pro¬bable multi-step attacks in an IT infrastructure, and pro¬vide recommendations in the form of patching strategies, topology changes, and configuration updates.

Kernel analysis on Grassmann manifolds for action recognition

Modelling video sequences by subspaces has recently shown promise for recognising human actions. Subspaces are able to accommodate the effects of various image variations and can capture the dynamic properties of actions. Subspaces form a non-Euclidean and curved Riemannian manifold known as a Grassmann manifold. Inference on manifold spaces usually is achieved by embedding the manifolds in higher dimensional Euclidean spaces. In this paper, we instead propose to embed the Grassmann manifolds into reproducing kernel Hilbert spaces and then tackle the problem of discriminant analysis on such manifolds. To achieve efficient machinery, we propose graph-based local discriminant analysis that utilises within-class and between-class similarity graphs to characterise intra-class compactness and inter-class separability, respectively. Experiments on KTH, UCF Sports, and Ballet datasets show that the proposed approach obtains marked improvements in discrimination accuracy in comparison to several state-of-the-art methods, such as the kernel version of affine hull image-set distance, tensor canonical correlation analysis, spatial-temporal words and hierarchy of discriminative space-time neighbourhood features.

Cutting on action : interference strategies in contemporary art practice

The domestication of creative software and hardware has been a significant factor in the recent proliferation of still and moving image creation. Booming numbers of amateur image-makers have the resources, skills and ambitions to create and distribute their work on a mass scale. At the same time, contemporary art seems increasingly dominated by ‘post-medium’ practices that adopt and adapt the representational techniques of mass culture, rather than overtly reject or oppose them. As a consequence of this network of forces, the field of image and video production is no longer the exclusive specialty of art and the mass media, and art may no longer be the most prominent watchdog of mass image culture. Intuitively and intentionally, contemporary artists are responding to these shifting conditions. From the position of a creative practitioner and researcher, this paper examines the strategies that contemporary artists use to engage with the changing relationships between image culture, lived experience and artistic practice. By examining the intersections between W.J.T. Mitchell’s detailed understanding of visual literacy and Jacques Derrida’s philosophical models of reading and writing, I identify ‘editing’ as a broad methodology that describes how practitioners creatively and critically engage with the field of still and moving images. My contention is that by emphasising the intersections of looking and making, ‘reading’ and ‘writing’, artists provide crucial jump cuts, pauses and distortions in the medley of our mediated experiences.

Detecting conversing groups of chatters : a model, algorithms, and tests

Chatrooms, for example Internet Relay Chat, are generally multi-user, multi-channel and multiserver chat-systems which run over the Internet and provide a protocol for real-time text-based conferencing between users all over the world. While a well-trained human observer is able to understand who is chatting with whom, there are no efficient and accurate automated tools to determine the groups of users conversing with each other. A precursor to analysing evolving cyber-social phenomena is to first determine what the conversations are and which groups of chatters are involved in each conversation. We consider this problem in this paper. We propose an algorithm to discover all groups of users that are engaged in conversation. Our algorithms are based on a statistical model of a chatroom that is founded on our experience with real chatrooms. Our approach does not require any semantic analysis of the conversations, rather it is based purely on the statistical information contained in the sequence of posts. We improve the accuracy by applying some graph algorithms to clean the statistical information. We present some experimental results which indicate that one can automatically determine the conversing groups in a chatroom, purely on the basis of statistical analysis.

Decentralized detector generation in cooperative intrusion detection system

We consider Cooperative Intrusion Detection System (CIDS) which is a distributed AIS-based (Artificial Immune System) IDS where nodes collaborate over a peer-to-peer overlay network. The AIS uses the negative selection algorithm for the selection of detectors (e.g., vectors of features such as CPU utilization, memory usage and network activity). For better detection performance, selection of all possible detectors for a node is desirable but it may not be feasible due to storage and computational overheads. Limiting the number of detectors on the other hand comes with the danger of missing attacks. We present a scheme for the controlled and decentralized division of detector sets where each IDS is assigned to a region of the feature space. We investigate the trade-off between scalability and robustness of detector sets. We address the problem of self-organization in CIDS so that each node generates a distinct set of the detectors to maximize the coverage of the feature space while pairs of nodes exchange their detector sets to provide a controlled level of redundancy. Our contribution is twofold. First, we use Symmetric Balanced Incomplete Block Design, Generalized Quadrangles and Ramanujan Expander Graph based deterministic techniques from combinatorial design theory and graph theory to decide how many and which detectors are exchanged between which pair of IDS nodes. Second, we use a classical epidemic model (SIR model) to show how properties from deterministic techniques can help us to reduce the attack spread rate.

Optimally increasing secure connectivity in multihop wireless ad hoc networks

We consider the problem of how to maximize secure connectivity of multi-hop wireless ad hoc networks after deployment. Two approaches, based on graph augmentation problems with nonlinear edge costs, are formulated. The first one is based on establishing a secret key using only the links that are already secured by secret keys. This problem is in NP-hard and does not accept polynomial time approximation scheme PTAS since minimum cutsets to be augmented do not admit constant costs. The second one is based of increasing the power level between a pair of nodes that has a secret key to enable them physically connect. This problem can be formulated as the optimal key establishment problem with interference constraints with bi-objectives: (i) maximizing the concurrent key establishment flow, (ii) minimizing the cost. We show that both problems are NP-hard and MAX-SNP (i.e., it is NP-hard to approximate them within a factor of 1 + e for e > 0 ) with a reduction to MAX3SAT problem. Thus, we design and implement a fully distributed algorithm for authenticated key establishment in wireless sensor networks where each sensor knows only its one- hop neighborhood. Our witness based approaches find witnesses in multi-hop neighborhood to authenticate the key establishment between two sensor nodes which do not share a key and which are not connected through a secure path.

Design and analysis of key management schemes for distributed wireless sensor networks

Secure communications in distributed Wireless Sensor Networks (WSN) operating under adversarial conditions necessitate efficient key management schemes. In the absence of a priori knowledge of post-deployment network configuration and due to limited resources at sensor nodes, key management schemes cannot be based on post-deployment computations. Instead, a list of keys, called a key-chain, is distributed to each sensor node before the deployment. For secure communication, either two nodes should have a key in common in their key-chains, or they should establish a key through a secure-path on which every link is secured with a key. We first provide a comparative survey of well known key management solutions for WSN. Probabilistic, deterministic and hybrid key management solutions are presented, and they are compared based on their security properties and re-source usage. We provide a taxonomy of solutions, and identify trade-offs in them to conclude that there is no one size-fits-all solution. Second, we design and analyze deterministic and hybrid techniques to distribute pair-wise keys to sensor nodes before the deployment. We present novel deterministic and hybrid approaches based on combinatorial design theory and graph theory for deciding how many and which keys to assign to each key-chain before the sensor network deployment. Performance and security of the proposed schemes are studied both analytically and computationally. Third, we address the key establishment problem in WSN which requires key agreement algorithms without authentication are executed over a secure-path. The length of the secure-path impacts the power consumption and the initialization delay for a WSN before it becomes operational. We formulate the key establishment problem as a constrained bi-objective optimization problem, break it into two sub-problems, and show that they are both NP-Hard and MAX-SNP-Hard. Having established inapproximability results, we focus on addressing the authentication problem that prevents key agreement algorithms to be used directly over a wireless link. We present a fully distributed algorithm where each pair of nodes can establish a key with authentication by using their neighbors as the witnesses.

Visualising security incidents through event aggregation

Extracting and aggregating the relevant event records relating to an identified security incident from the multitude of heterogeneous logs in an enterprise network is a difficult challenge. Presenting the information in a meaningful way is an additional challenge. This paper looks at solutions to this problem by first identifying three main transforms; log collection, correlation, and visual transformation. Having identified that the CEE project will address the first transform, this paper focuses on the second, while the third is left for future work. To aggregate by correlating event records we demonstrate the use of two correlation methods, simple and composite. These make use of a defined mapping schema and confidence values to dynamically query the normalised dataset and to constrain result events to within a time window. Doing so improves the quality of results, required for the iterative re-querying process being undertaken. Final results of the process are output as nodes and edges suitable for presentation as a network graph.