Component modeling for SCADA network mapping

Supervisory Control and Data Acquisition systems (SCADA) are widely used to control critical infrastructure automatically. Capturing and analyzing packet-level traffic flowing through such a network is an essential requirement for problems such as legacy network mapping and fault detection. Within the framework of captured network traffic, we present a simple modeling technique, which supports the mapping of the SCADA network topology via traffic monitoring. By characterizing atomic network components in terms of their input-output topology and the relationship between their data traffic logs, we show that these modeling primitives have good compositional behaviour, which allows complex networks to be modeled. Finally, the predictions generated by our model are found to be in good agreement with experimentally obtained traffic.

Audio signalling as a backup communication channel for multi-robot systems

This paper presents a low-bandwidth multi-robot communication system designed to serve as a backup communication channel in the event a robot suffers a network device fault. While much research has been performed in the area of distributing network communication across multiple robots within a system, individual robots are still susceptible to hardware failure. In the past, such robots would simply be removed from service, and their tasks re-allocated to other members. However, there are times when a faulty robot might be crucial to a mission, or be able to contribute in a less communication intensive area. By allowing robots to encode and decode messages into unique sequences of DTMF symbols, called words, our system is able to facilitate continued low-bandwidth communication between robots without access to network communication. Our results have shown that the system is capable of permitting robots to negotiate task initiation and termination, and is flexible enough to permit a pair of robots to perform a simple turn taking task.

Cerebellar grey matter deficits in first-episode schizophrenia mapped using cortical pattern matching

Cerebellar dysfunction has been proposed to lead to “cognitive dysmetria” in schizophrenia via the cortico-cerebellar-thalamic-cortical circuit, contributing to a range of cognitive and clinical symptoms of the disorder. Here we investigated total cerebellar grey and white matter volumes and cerebellar regional grey matter abnormalities in 13 remitted first-episode schizophrenia patients with less than 2 years’ duration of illness. Patient data were compared to 13 pair-wise age, gender, and handedness-matched healthy volunteers using cortical pattern averaging on high-resolution magnetic resonance images. Total cerebellar volume and total grey matter volumes in first-episode schizophrenia patients did not differ from healthy control subjects, but total cerebellar white matter was increased and total grey to white matter ratios were reduced in patients. Four clusters of cerebellar grey matter reduction were identified: (i) in superior vermis; (ii) in the left lobuli VI; (iii) in right-inferior lobule IX, extending into left lobule IX; and (iv) bilaterally in the areas of lobuli III, peduncle and left flocculus. Grey matter deficits were particularly prominent in right lobuli III and IX, left flocculus and bilateral pedunculi. These cerebellar areas have been implicated in attention control, emotional regulation, social functioning, initiation of smooth pursuit eye movements, eye-blink conditioning, language processing, verbal memory, executive function and the processing of spatial and emotional information. Consistent with common clinical, cognitive, and pathophysiological signs of established illness, our findings demonstrate cerebellar pathology as early as in first-episode schizophrenia.

Exact parametric confidence intervals for Bland-Altman limits of agreement

Purpose The previous literature on Bland-Altman analysis only describes approximate methods for calculating confidence intervals for 95% Limits of Agreement (LoAs). This paper describes exact methods for calculating such confidence intervals, based on the assumption that differences in measurement pairs are normally distributed. Methods Two basic situations are considered for calculating LoA confidence intervals: the first where LoAs are considered individually (i.e. using one-sided tolerance factors for a normal distribution); and the second, where LoAs are considered as a pair (i.e. using two-sided tolerance factors for a normal distribution). Equations underlying the calculation of exact confidence limits are briefly outlined. Results To assist in determining confidence intervals for LoAs (considered individually and as a pair) tables of coefficients have been included for degrees of freedom between 1 and 1000. Numerical examples, showing the use of the tables for calculating confidence limits for Bland-Altman LoAs, have been provided. Conclusions Exact confidence intervals for LoAs can differ considerably from Bland and Altman’s approximate method, especially for sample sizes that are not large. There are better, more precise methods for calculating confidence intervals for LoAs than Bland and Altman’s approximate method, although even an approximate calculation of confidence intervals for LoAs is likely to be better than none at all. Reporting confidence limits for LoAs considered as a pair is appropriate for most situations, however there may be circumstances where it is appropriate to report confidence limits for LoAs considered individually.

Comparison of intraspecific genetic structure among related chironomids (Diptera) from New Zealand and Patagonia : disparity between potential and realized dispersal

Population genetic studies of freshwater invertebrate taxa in New Zealand and South America are currently few despite the geologically and climatically dynamic histories of these regions. The focus of our study was a comparison of the influence on realized dispersal of 2 closely related nonbiting midges (Chironomidae) of population fragmentation on these separated austral land masses. We used a 734-base pair (bp) fragment of cytochrome c oxidase subunit I (COI) to investigate intraspecific genetic structure in Naonella forsythi Boothroyd in New Zealand and Ferringtonia patagonica Edwards in Patagonia. We proposed hypotheses about their potential dispersal and, hence, expected patterns of genetic structure in these 2 species based on published patterns for the closely related Australian taxon Echinocladius martini Cranston. Genetic structure revealed for both N. forsythi and F. patagonica was characterized by several highly divergent (2.0–10.5%) lineages of late Miocene–Pliocene age within each taxon that were not geographically localized. Many were distributed widely. This pattern differed greatly from population structure in E. martini, which was typified by much greater endemicity of divergent genetic lineages. Nevertheless, diversification of lineages in all 3 taxa appeared to be temporally congruent with the onset of late Miocene glaciations in the southern hemisphere that may have driven fragmentation of suitable habitat, promoting isolation of populations and divergence in allopatry. We argue that differences in realized dispersal post-isolation may be the result of differing availability of suitable habitat in interglacial periods.

An open pit multistage mine production scheduling model for drilling, blasting and excavating operations

This paper proposes a new multi-resource multi-stage scheduling problem for optimising the open-pit drilling, blasting and excavating operations under equipment capacity constraints. The flow process is analysed based on the real-life data from an Australian iron ore mine site. The objective of the model is to maximise the throughput and minimise the total idle times of equipment at each stage. The following comprehensive mining attributes and constraints have been considered: types of equipment; operating capacities of equipment; ready times of equipment; speeds of equipment; block-sequence-dependent movement times of equipment; equipment-assignment-dependent operation times of blocks; distances between each pair of blocks; due windows of blocks; material properties of blocks; swell factors of blocks; and slope requirements of blocks. It is formulated by mixed integer programming and solved by ILOG-CPLEX optimiser. The proposed model is validated with extensive computational experiments to improve mine production efficiency at the operational level. The model also provides an intelligent decision support tool to account for the availability and usage of equipment units for drilling, blasting and excavating stages.

Robust clustering of multi-type relational data via a heterogeneous manifold ensemble

High-Order Co-Clustering (HOCC) methods have attracted high attention in recent years because of their ability to cluster multiple types of objects simultaneously using all available information. During the clustering process, HOCC methods exploit object co-occurrence information, i.e., inter-type relationships amongst different types of objects as well as object affinity information, i.e., intra-type relationships amongst the same types of objects. However, it is difficult to learn accurate intra-type relationships in the presence of noise and outliers. Existing HOCC methods consider the p nearest neighbours based on Euclidean distance for the intra-type relationships, which leads to incomplete and inaccurate intra-type relationships. In this paper, we propose a novel HOCC method that incorporates multiple subspace learning with a heterogeneous manifold ensemble to learn complete and accurate intra-type relationships. Multiple subspace learning reconstructs the similarity between any pair of objects that belong to the same subspace. The heterogeneous manifold ensemble is created based on two-types of intra-type relationships learnt using p-nearest-neighbour graph and multiple subspaces learning. Moreover, in order to make sure the robustness of clustering process, we introduce a sparse error matrix into matrix decomposition and develop a novel iterative algorithm. Empirical experiments show that the proposed method achieves improved results over the state-of-art HOCC methods for FScore and NMI.

A data mining based method for discovery of web services and their compositions

Due to the availability of huge number of web services, finding an appropriate Web service according to the requirements of a service consumer is still a challenge. Moreover, sometimes a single web service is unable to fully satisfy the requirements of the service consumer. In such cases, combinations of multiple inter-related web services can be utilised. This paper proposes a method that first utilises a semantic kernel model to find related services and then models these related Web services as nodes of a graph. An all-pair shortest-path algorithm is applied to find the best compositions of Web services that are semantically related to the service consumer requirement. The recommendation of individual and composite Web services composition for a service request is finally made. Empirical evaluation confirms that the proposed method significantly improves the accuracy of service discovery in comparison to traditional keyword-based discovery methods.

Is there a bone-nail specific entry point? automated fit quantification of tibial nail designs during the insertion for six different nail entry points

Intramedullary nailing is the standard fixation method for displaced diaphyseal fractures of tibia. Selection of the correct nail insertion point is important for axial alignment of bone fragments and to avoid iatrogenic fractures. However, the standard entry point (SEP) may not always optimise the bone-nail fit due to geometric variations of bones. This study aimed to investigate the optimal entry for a given bone-nail pair using the fit quantification software tool previously developed by the authors. The misfit was quantified for 20 bones with two nail designs (ETN and ETN-Proximal Bend) related to the SEP and 5 entry points which were 5 mm and 10 mm away from the SEP. The SEP was the optimal entry point for 50% of the bones used. For the remaining bones, the optimal entry point was located 5 mm away from the SEP, which improved the overall fit by 40% on average. However, entry points 10 mm away from the SEP doubled the misfit. The optimised bone-nail fit can be achieved through the SEP and within the range of a 5 mm radius, except posteriorly. The study results suggest that the optimal entry point should be selected by considering the fit during insertion and not only at the final position.

Real-time and interactive attacks on DNP3 critical infrastructure using Scapy

The Distributed Network Protocol v3.0 (DNP3) is one of the most widely used protocols, to control national infrastructure. Widely used interactive packet manipulation tools, such as Scapy, have not yet been augmented to parse and create DNP3 frames (Biondi 2014). In this paper we extend Scapy to include DNP3, thus allowing us to perform attacks on DNP3 in real-time. Our contribution builds on East et al. (2009), who proposed a range of possible attacks on DNP3. We implement several of these attacks to validate our DNP3 extension to Scapy, then executed the attacks on real world equipment. We present our results, showing that many of these theoretical attacks would be unsuccessful in an Ethernet-based network.

Plasmid DNA purification via the use of a dual affinity protein

Methods are presented for the production, affinity purification and analysis of plasmid DNA (pDNA). Batch fermentation is used for the production of the pDNA, and expanded bed chromatography, via the use of a dual affinity glutathione S-transferase (GST) fusion protein, is used for the capture and purification of the pDNA. The protein is composed of GST, which displays affinity for glutathione immobilized to a solid-phase adsorbent, fused to a zinc finger transcription factor, which displays affinity for a target 9-base pair sequence contained within the target pDNA. A Picogreen™ fluorescence assay and/or anx ethidium bromide agarose gel electrophoresis assay can be used to analyze the eluted pDNA.

Further development of discrete computational techniques for calculation of restricted diffusion propagators in porous media

Magnetic resonance is a well-established tool for structural characterisation of porous media. Features of pore-space morphology can be inferred from NMR diffusion-diffraction plots or the time-dependence of the apparent diffusion coefficient. Diffusion NMR signal attenuation can be computed from the restricted diffusion propagator, which describes the distribution of diffusing particles for a given starting position and diffusion time. We present two techniques for efficient evaluation of restricted diffusion propagators for use in NMR porous-media characterisation. The first is the Lattice Path Count (LPC). Its physical essence is that the restricted diffusion propagator connecting points A and B in time t is proportional to the number of distinct length-t paths from A to B. By using a discrete lattice, the number of such paths can be counted exactly. The second technique is the Markov transition matrix (MTM). The matrix represents the probabilities of jumps between every pair of lattice nodes within a single timestep. The propagator for an arbitrary diffusion time can be calculated as the appropriate matrix power. For periodic geometries, the transition matrix needs to be defined only for a single unit cell. This makes MTM ideally suited for periodic systems. Both LPC and MTM are closely related to existing computational techniques: LPC, to combinatorial techniques; and MTM, to the Fokker-Planck master equation. The relationship between LPC, MTM and other computational techniques is briefly discussed in the paper. Both LPC and MTM perform favourably compared to Monte Carlo sampling, yielding highly accurate and almost noiseless restricted diffusion propagators. Initial tests indicate that their computational performance is comparable to that of finite element methods. Both LPC and MTM can be applied to complicated pore-space geometries with no analytic solution. We discuss the new methods in the context of diffusion propagator calculation in porous materials and model biological tissues.

DS-VBF : dual sink vector-based routing protocol for underwater wireless sensor network

Underwater wireless sensor networks (UWSNs) have become the seat of researchers' attention recently due to their proficiency to explore underwater areas and design different applications for marine discovery and oceanic surveillance. One of the main objectives of each deployed underwater network is discovering the optimized path over sensor nodes to transmit the monitored data to onshore station. The process of transmitting data consumes energy of each node, while energy is limited in UWSNs. So energy efficiency is a challenge in underwater wireless sensor network. Dual sinks vector based forwarding (DS-VBF) takes both residual energy and location information into consideration as priority factors to discover an optimized routing path to save energy in underwater networks. The modified routing protocol employs dual sinks on the water surface which improves network lifetime. According to deployment of dual sinks, packet delivery ratio and the average end to end delay are enhanced. Based on our simulation results in comparison with VBF, average end to end delay reduced more than 80%, remaining energy increased 10%, and the increment of packet reception ratio was about 70%.

Suppressed thermal conductivity of bilayer graphene with vacancy-initiated linkages

Through larger-scale molecular dynamics simulations, we investigated the impacts from vacancy-initiated linkages on the thermal conductivity of bilayer graphene sheets (of size L × W = 24.5 nm × 3.7 nm). Three different interlayer linkages, including divacancy bridging, “spiro” interstitial bridging and Frenkel pair defects, are considered. It is found that the presence of interlayer linkages induces a significant degradation in the thermal conductivity of the bilayer graphene sheet. The degradation is strongly dependent on the interlayer linkage type, concentration and location. More importantly, the linkages that contain vacancies lead to more severe suppression of the thermal conductivity, in agreement with theoretical predictions that vacancies induce strong phonon scattering. Our finding provides useful guidelines for the application of multilayer graphene sheets in practical thermal management.

Practical attack on NLM-MAC scheme

The NLM stream cipher designed by Hoon Jae Lee, Sang Min Sung, Hyeong Rag Kim is a strengthened version of the LM summation generator that combines linear and non-linear feedback shift registers. In recent works, the NLM cipher has been used for message authentication in lightweight communication over wireless sensor networks and for RFID authentication protocols. The work analyses the security of the NLM stream cipher and the NLM-MAC scheme that is built on the top of the NLM cipher. We first show that the NLM cipher suffers from two major weaknesses that lead to key recovery and forgery attacks. We prove the internal state of the NLM cipher can be recovered with time complexity about nlog7×2, where the total length of internal state is 2⋅n+22⋅n+2 bits. The attack needs about n2n2 key-stream bits. We also show adversary is able to forge any MAC tag very efficiently by having only one pair (MAC tag, ciphertext). The proposed attacks are practical and break the scheme with a negligible error probability.