Fault Diagnostics for Internal Combustion Engines – Current and Future Techniques

The adoption of each new level of automotive emissions legislation often requires the introduction of additional emissions reduction techniques or the development of existing emissions control systems. This, in turn, usually requires the implementation of new sensors and hardware which must subsequently be monitored by the on-board fault detection systems. The reliable detection and diagnosis of faults in these systems or sensors, which result in the tailpipe emissions rising above the progressively lower failure thresholds, provides enormous challenges for OBD engineers. This paper gives a review of the field of fault detection and diagnostics as used in the automotive industry. Previous work is discussed and particular emphasis is placed on the various strategies and techniques employed. Methodologies such as state estimation, parity equations and parameter estimation are explained with their application within a physical model diagnostic structure. The utilization of symptoms and residuals in the diagnostic process is also discussed. These traditional physical model based diagnostics are investigated in terms of their limitations. The requirements from the OBD legislation are also addressed. Additionally, novel diagnostic techniques, such as principal component analysis (PCA) are also presented as a potential method of achieving the monitoring requirements of current and future OBD legislation.

Arsenate causes differential acute toxicity to two P-deprived genotypes of rice seedlings (Oryza sativa L.)

Significant genotypic difference in response to arsenate toxicity in rice (Oryza sativa) was investigated in root elongation, arsenate uptake kinetics, physiological and biochemical response and arsenic (As) speciation. Uptake kinetics data showed that P-deprived genotype 94D-54 had a little higher As uptake than P-deprived 94D-64, but the difference was not large enough to cause acute toxicity in P-deprived 94D-54. There was no difference in tissue P concentrations between the two genotypes under P deficient conditions. In addition, arsenic speciation in plant tissues (using high performance liquid chromatography-inductively coupled plasma mass spectrometry) was not different between P pretreatments and between genotypes. P-deprived genotype 94D-54 suffered much higher stress induced by arsenate toxicity than P-deprived genotype 94D-64, in terms of lipid peroxidation, tissue H2O2 concentrations and exosmosis of K, P and As. However, P-deprived 94D-54 also had higher overproduction of enzymatic antioxidants (with higher GPX, SOD, CAT) and NPT (non-protein thiols) than P-deprived 94D-64. It appeared that, the higher sensitivity of P-deprived 94D-54 to arsenate toxicity might cause the overproduction of NPT, thus leading to the depletion of GSH and to the accumulation of H2O2. The differential sensitivity of the two genotypes has major implications for breeding rice for As affected paddy soil.

Impact of Metric Selection on Wireless DeAuthentication DoS Attack Performance

DeAuthentication Denial of Service attacks in Public Access WiFi operate by exploiting the lack of authentication of management frames in the 802.11 protocol. Detection of these attacks rely almost exclusively on the selection of appropriate thresholds. In this work the authors demonstrate that there are additional, previously unconsidered, metrics which also influence DoS detection performance. A method of systematically tuning these metrics to optimal values is proposed which ensures that parameter choices are repeatable and verifiable.

Familial hypocalciuric hypercalcaemia as a differential diagnosis of hyperparathyroidism:studies in a large kindred and a review of surgical experience in the condition

We have studied 46 members of a large kindred with familial hypocalciuric hypercalcaemia (FHH) after a neck exploration failed to cure hypercalcaemia in an asymptomatic patient. Serum calcium, serum phosphate, plasma parathormone and vitamin D metabolites do not distinguish affected members from patients with hyperparathyroidism. Because of the continuing debate as to whether or not FHH is a variant of, or distinct from, hyperparathyroidism, we have carried out a review of surgical experience with subtotal parathyroidectomy in hyperparathyroidism secondary to parathyroid hyperplasia and in FHH. Whereas the procedure is successful in 90 per cent of the former cases only one case of FHH has been cured by it. This provides evidence for the two conditions being aetiologically distinct. Before patients with asymptomatic hypercalcaemia are referred for parathyroid surgery the calcium:creatinine clearance ratio should be measured using a 2 h urine sample collected after an overnight fast and a fasting blood sample. If this ratio is less than 0.01 then screening of first degree relations should be undertaken before any parathyroid surgery is performed. Unnecessary surgery can therefore be avoided.

The Forgiving Graph: a distributed data structure for low stretch under adversarial attack

We consider the problem of self-healing in peer-to-peer networks that are under repeated attack by an omniscient adversary. We assume that, over a sequence of rounds, an adversary either inserts a node with arbitrary connections or deletes an arbitrary node from the network. The network responds to each such change by quick “repairs,” which consist of adding or deleting a small number of edges. These repairs essentially preserve closeness of nodes after adversarial deletions, without increasing node degrees by too much, in the following sense. At any point in the algorithm, nodes v and w whose distance would have been l in the graph formed by considering only the adversarial insertions (not the adversarial deletions), will be at distance at most l log n in the actual graph, where n is the total number of vertices seen so far. Similarly, at any point, a node v whose degree would have been d in the graph with adversarial insertions only, will have degree at most 3d in the actual graph. Our distributed data structure, which we call the Forgiving Graph, has low latency and bandwidth requirements. The Forgiving Graph improves on the Forgiving Tree distributed data structure from Hayes et al. (2008) in the following ways: 1) it ensures low stretch over all pairs of nodes, while the Forgiving Tree only ensures low diameter increase; 2) it handles both node insertions and deletions, while the Forgiving Tree only handles deletions; 3) it requires only a very simple and minimal initialization phase, while the Forgiving Tree initially requires construction of a spanning tree of the network.

TGFβ and CCN2/CTGF mediate actin related gene expression by differential E2F1/CREB activation

CCN2/CTGF is an established effector of TGFß driven responses in diabetic nephropathy. We have identified an interaction between CCN2 and TGFß leading to altered phenotypic differentiation and inhibited cellular migration. Here we determine the gene expression profile associated with this phenotype and define a transcriptional basis for differential actin related gene expression and cytoskeletal function.

Acquired differential regulation of caspase-8 in cisplatin-resistant non-small-cell lung cancer

Failure to efficiently induce apoptosis contributes to cisplatin resistance in non-small-cell lung cancer (NSCLC). Although BCL-2-associated X protein (BAX) and BCL-2 antagonist killer (BAK) are critical regulators of the mitochondrial apoptosis pathway, their requirement has not been robustly established in relation to cisplatin. Here, we show that cisplatin can efficiently bypass mitochondrial apoptosis block caused by loss of BAX and BAK, via activation of the extrinsic death receptor pathway in some model cell lines. Apoptosis resistance following cisplatin can only be observed when both extrinsic and intrinsic pathways are blocked, consistent with redundancy between mitochondrial and death receptor pathways in cisplatin-induced apoptosis. In H460 NSCLC cells, caspase-8 cleavage was shown to be induced by cisplatin and is dependent on death receptor 4, death receptor 5, Fas-associated protein with death domain, acid sphingomyelinase and ceramide synthesis. In contrast, cisplatin-resistant cells fail to activate caspase-8 via this pathway despite conserving sensitivity to death ligand-driven activation. Accordingly, caspase-8 activation block acquired during cisplatin resistance, can be bypassed by death receptor agonism. © 2012 Macmillan Publishers Limited

Man-in-the-Middle Attack Test-bed Investigating Cyber-security Vulnerabilities in Smart Grid SCADA Systems

The increased complexity and interconnectivity of Supervisory Control and Data Acquisition (SCADA) systems in the Smart Grid has exposed them to a wide range of cyber-security issues, and there are a multitude of potential access points for cyber attackers. This paper presents a SCADA-specific cyber-security test-bed which contains SCADA software and communication infrastructure. This test-bed is used to investigate an Address Resolution Protocol (ARP) spoofing based man-in-the-middle attack. Finally, the paper proposes a future work plan which focuses on applying intrusion detection and prevention technology to address cyber-security issues in SCADA systems.

Fault Location on a Distribution Network Using a Decentralised Analysis Process

A reduction in the time required to locate and restore faults on a utility's distribution network improves the customer minutes lost (CML) measurement and hence brings direct cost savings to the operating company. The traditional approach to fault location involves fault impedance determination from high volume waveform files dispatched across a communications channel to a central location for processing and analysis. This paper examines an alternative scheme where data processing is undertaken locally within a recording instrument thus reducing the volume of data to be transmitted. Processed event fault reports may be emailed to relevant operational staff for the timely repair and restoration of the line.

Differential expression of liver fluke β-tubulin isotypes at selected life cycle stages

We have shown that Fasciola hepatica expresses at least six ß-tubulins in the adult stage of its life cycle, designated F.hep-ß-tub1-6 (Ryan et al., 2008). Here we show that different complements of tubulin isotypes are expressed in different tissues and at different life cycle stages; this information may inform the search for novel anthelmintics. The predominant (as judged by quantitative PCR) isotype transcribed at the adult stage was F.hep-ß-tub1 and immunolocalisation studies revealed that this isotype occurred mainly in mature spermatozoa and vitelline follicles. Quantitative PCR indicated that changes occurred in the transcription levels of ß-tubulin isotypes at certain life cycle stages and may be of importance in the efficacy of benzimidazole-based anthelmintic drugs, but there were no significant differences between the triclabendazole (TCBZ)-susceptible Leon isolate and the TCBZ-resistant Oberon isolate in the transcription levels of each of the isotypes. When three well-characterised isolates with differing susceptibilities to TCBZ were compared, only one amino acid change resulting from a homozygous coding sequence difference (Gly269Ser) in isotype 4 was observed. However, this change was not predicted to alter the overall structure of the protein. In conclusion, these findings indicate that there is tissue-specific expression of tubulin isotypes in the liver fluke but the development of resistance to TCBZ is not associated with changes in its presumed target molecule.

The Forgiving Graph:A distributed data structure for low stretch under adversarial attack

We consider the problem of self-healing in peer-to-peer networks that are under repeated attack by an omniscient adversary. We assume that, over a sequence of rounds, an adversary either inserts a node with arbitrary connections or deletes an arbitrary node from the network. The network responds to each such change by quick "repairs," which consist of adding or deleting a small number of edges. These repairs essentially preserve closeness of nodes after adversarial deletions,without increasing node degrees by too much, in the following sense. At any point in the algorithm, nodes v and w whose distance would have been - in the graph formed by considering only the adversarial insertions (not the adversarial deletions), will be at distance at most - log n in the actual graph, where n is the total number of vertices seen so far. Similarly, at any point, a node v whose degreewould have been d in the graph with adversarial insertions only, will have degree at most 3d in the actual graph. Our distributed data structure, which we call the Forgiving Graph, has low latency and bandwidth requirements. The Forgiving Graph improves on the Forgiving Tree distributed data structure from Hayes et al. (2008) in the following ways: 1) it ensures low stretch over all pairs of nodes, while the Forgiving Tree only ensures low diameter increase; 2) it handles both node insertions and deletions, while the Forgiving Tree only handles deletions; 3) it requires only a very simple and minimal initialization phase, while the Forgiving Tree initially requires construction of a spanning tree of the network. © Springer-Verlag 2012.