Evaluation of malacosporean life cycles through transmission studies

Myxozoans, belonging to the recently described Class Malacosporea, parasitise freshwater bryozoans during at least part of their life cycle, but no complete malacosporean life cycle is known to date. One of the 2 described malacosporeans is Tetracapsuloides bryosalmonae, the causative agent of salmonid proliferative kidney disease. The other is Buddenbrockia plumatellae, so far only found in freshwater bryozoans. Our investigations evaluated malacosporean life cycles, focusing on transmission from fish to bryozoan and from bryozoan to bryozoan. We exposed bryozoans to possible infection from: stages of T bryosalmonae in fish kidney and released in fish urine; spores of T bryosalmonae that had developed in bryozoan hosts; and spores and sac stages of B. plumatellae that had developed in bryozoans. Infections were never observed by microscopic examination of post-exposure, cultured bryozoans and none were detected by PCR after culture. Our consistent negative results are compelling: trials incorporated a broad range of parasite stages and potential hosts, and failure of transmission across trials cannot be ascribed to low spore concentrations or immature infective stages. The absence of evidence for bryozoan to bryozoan transmissions for both malacosporeans strongly indicates that such transmission is precluded in malacosporean life cycles. Overall, our results imply that there may be another malacosporean host which remains unidentified, although transmission from fish to bryozoans requires further investigation. However, the highly clonal life history of freshwater bryozoans is likely to allow both long-term persistence and spread of infection within bryozoan populations, precluding the requirement for regular transmission from an alternate host.

Nanosized polymetallic resorcinarene-based host assemblies that strongly bind fullerenes

Polymetallic nanodimensional assemblies have been prepared via metal directed assembly of dithiocarbamate functionalized cavitand structural frameworks with late transition metals (Ni, Pd, Cu, Au, Zn, and Cd). The coordination geometry about the metal centers is shown to dictate the architecture adopted. X-ray crystallographic studies confirm that square planar coordination geometries result in "cagelike" octanuclear complexes, whereas square-based pyramidal metal geometries favor hexanuclear "molecular loop" structures. Both classes of complex are sterically and electronically complementary to the fullerenes (C-60 and C-70). The strong binding of these guests occurred via favorable interactions with the sulfur atoms of multiple dithiocarbamate moieties of the hosts. In the case of the tetrameric copper(II) complexes, the lability of the copper(II)-dithiocarbamate bond enabled the fullerene guests to be encapsulated in the electron-rich cavity of the host, over time. The examination of the binding of fullerenes has been undertaken using spectroscopic and electrochemical methods, electrospray mass spectrometry, and molecular modeling.

Hierarchical composite regular parallel architecture

The design space of emerging heterogenous multi-core architectures with re-configurability element makes it feasible to design mixed fine-grained and coarse-grained parallel architectures. This paper presents a hierarchical composite array design which extends the curret design space of regular array design by combining a sequence of transformations. This technique is applied to derive a new design of a pipelined parallel regular array with different dataflow between phases of computation.

Efficient FPGA-based regular expression pattern matching

An approach to the automatic generation of efficient Field Programmable Gate Arrays (FPGAs) circuits for the Regular Expression-based (RegEx) Pattern Matching problems is presented. Using a novel design strategy, as proposed, circuits that are highly area-and-time-efficient can be automatically generated for arbitrary sets of regular expressions. This makes the technique suitable for applications that must handle very large sets of patterns at high speed, such as in the network security and intrusion detection application domains. We have combined several existing techniques to optimise our solution for such domains and proposed the way the whole process of dynamic generation of FPGAs for RegEX pattern matching could be automated efficiently.

Using the web graph to influence application behaviour

The Web's link structure (termed the Web Graph) is a richly connected set of Web pages. Current applications use this graph for indexing and information retrieval purposes. In contrast the relationship between Web Graph and application is reversed by letting the structure of the Web Graph influence the behaviour of an application. Presents a novel Web crawling agent, AlienBot, the output of which is orthogonally coupled to the enemy generation strategy of a computer game. The Web Graph guides AlienBot, causing it to generate a stochastic process. Shows the effectiveness of such unorthodox coupling to both the playability of the game and the heuristics of the Web crawler. In addition, presents the results of the sample of Web pages collected by the crawling process. In particular, shows: how AlienBot was able to identify the power law inherent in the link structure of the Web; that 61.74 per cent of Web pages use some form of scripting technology; that the size of the Web can be estimated at just over 5.2 billion pages; and that less than 7 per cent of Web pages fully comply with some variant of (X)HTML.

Largest connected component of a star graph with faulty vertices

In order to make a full evaluation of an interconnection network, it is essential to estimate the minimum size of a largest connected component of this network provided the faulty vertices in the network may break its connectedness. Star graphs are recognized as promising candidates for interconnection networks. This article addresses the size of a largest connected component of a faulty star graph. We prove that, in an n-star graph (n >= 3) with up to 2n-4 faulty vertices, all fault-free vertices but at most two form a connected component. Moreover, all fault-free vertices but exactly two form a connected component if and only if the set of all faulty vertices is equal to the neighbourhood of a pair of fault-free adjacent vertices. These results show that star graphs exhibit excellent fault-tolerant abilities in the sense that there exists a large functional network in a faulty star graph.

Compositional technique for synthesising multi-phase regular arrays

We describe a high-level design method to synthesize multi-phase regular arrays. The method is based on deriving component designs using classical regular (or systolic) array synthesis techniques and composing these separately evolved component design into a unified global design. Similarity transformations ar e applied to component designs in the composition stage in order to align data ow between the phases of the computations. Three transformations are considered: rotation, re ection and translation. The technique is aimed at the design of hardware components for high-throughput embedded systems applications and we demonstrate this by deriving a multi-phase regular array for the 2-D DCT algorithm which is widely used in many vide ocommunications applications.

Strongly nucleophilic RhI centre in square-planar complexes with terdentate (κ3) 2,2′:6′,2′′-terpyridine ligands: crystallographic, electrochemical and density functional theoretical studies

Rh-I-terpyridine complexes have been unambiguously formed for the first time. The 2,21:6',2"-terpyridine (tpy), 4'-chloro-2,2':6',2"-terpyridine (4'-Cl-tpy) and 4'-(tert-butyldimethylsilyl-ortho-carboranyl)-2,2':6',2"-terpyridine (carboranyl-tpy) ligands were used for successful syntheses and characterisation of the corresponding Rh-I complexes with halide coligands, [Rh(X)(4'-Y-terpyridine)] (X = Cl, Y = H, Cl, carboranyl; X = Br, Y = H). All four neutral Rh-tpy complexes are square planar, with Rh-X bonds in the plane of the 4'-Y-terpyridine ligands. Full characterisation of these dark blue, highly air-sensitive compounds was hampered by their poor solubility in various organic solvents. This is mainly due to the formation of pi-stacked aggregates, as evidenced by the crystal structure of [Rh(Cl)(tpy)]; in addition, [Rh(Cl)(carboranyl-tpy)] merely forms discrete dimers. The (bonding) properties of the novel Rh-I-terpyridine complexes have been studied with single-crystal X-ray diffraction, (time-dependent) density functional theoretical (DFT) calculations, far-infrared spectroscopy, electronic absorption spectroscopy and cyclic voltammetry. From DFT calculations, the HOMO of the studied Rh-I-terpyridine complexes involves predominantly the metal centre, while the LUMO resides on the terpyridine ligand. Absorption bands of the studied complexes in the visible region (400-900 nm) can be assigned to MLCT and MLCT/XLCT transitions. The relatively low oxidation potentials of [Rh(X)(tpy)] (X = Cl, Br) point to a high electron density on the metal centre. This makes the Rh-I-terpyridine complexes strongly nucleophilic and (potentially) highly reactive towards various (small) substrate molecules containing carbon-halide bonds.

A simple method of calculating eigenvalues and resonances in domains with infinite regular ends

A new approach is presented for the solution of spectral problems on infinite domains with regular ends, which avoids the need to solve boundary-value problems for many trial values of the spectral parameter. We present numerical results both for eigenvalues and for resonances, comparing with results reported by Aslanyan, Parnovski and Vassiliev.

Improving aircraft maintenance, repair, and overhaul: A novel text mining approach

Aircraft Maintenance, Repair and Overhaul (MRO) feedback commonly includes an engineer’s complex text-based inspection report. Capturing and normalizing the content of these textual descriptions is vital to cost and quality benchmarking, and provides information to facilitate continuous improvement of MRO process and analytics. As data analysis and mining tools requires highly normalized data, raw textual data is inadequate. This paper offers a textual-mining solution to efficiently analyse bulk textual feedback data. Despite replacement of the same parts and/or sub-parts, the actual service cost for the same repair is often distinctly different from similar previously jobs. Regular expression algorithms were incorporated with an aircraft MRO glossary dictionary in order to help provide additional information concerning the reason for cost variation. Professional terms and conventions were included within the dictionary to avoid ambiguity and improve the outcome of the result. Testing results show that most descriptive inspection reports can be appropriately interpreted, allowing extraction of highly normalized data. This additional normalized data strongly supports data analysis and data mining, whilst also increasing the accuracy of future quotation costing. This solution has been effectively used by a large aircraft MRO agency with positive results.

Development of a semantic graph-based scene description

Software representations of scenes, i.e. the modelling of objects in space, are used in many application domains. Current modelling and scene description standards focus on visualisation dimensions, and are intrinsically limited by their dependence upon their semantic interpretation and contextual application by humans. In this paper we propose the need for an open, extensible and semantically rich modelling language, which facilitates a machine-readable semantic structure. We critically review existing standards and techniques, and highlight a need for a semantically focussed scene description language. Based on this defined need we propose a preliminary solution, based on hypergraph theory, and reflect on application domains.

Processing of regular and irregular past tense morphology in highly proficient second language learners of English: a self-paced reading study

Dual-system models suggest that English past tense morphology involves two processing routes: rule application for regular verbs and memory retrieval for irregular verbs (Pinker, 1999). In second language (L2) processing research, Ullman (2001a) suggested that both verb types are retrieved from memory, but more recently Clahsen and Felser (2006) and Ullman (2004) argued that past tense rule application can be automatised with experience by L2 learners. To address this controversy, we tested highly proficient Greek-English learners with naturalistic or classroom L2 exposure compared to native English speakers in a self-paced reading task involving past tense forms embedded in plausible sentences. Our results suggest that, irrespective to the type of exposure, proficient L2 learners of extended L2 exposure apply rule-based processing.