A graph has linear clique-width at most k if it has a clique-width expression using at most k labels such that every disjoint union operation has an operand which is a single vertex graph. We give the first characterisation of graphs of linear clique-width at most 3, and we give the first polynomial-time recognition algorithm for graphs of linear clique-width at most 3. In addition, we present ...

Flow cytometry was evaluated for the first time microbiological characterisation of samples collected from surfaces stone and mortar sculptures. The study carried out on outdoor sculptures located in district Porto (Portugal), which were using swabs poly(2-hydroxyethylmethacrylate) (poly(HEMA)) cryogels as non-invasive sampling methods. use poly(HEMA) tested an alternative to swabbing due diffi...

A theory of timewise re nement is presented This allows the translation of speci cations and proofs of correctness between semantic models permitting each stage in the veri cation of a system to take place at the appropriate level of abstraction The theory is presented within the context of CSP A denotational characterisation of re nement is given in terms of relations between behaviours at di ...

The reachability graph of a Petri net is a labelled transition system that can have a very complex structure. A characterisation of reachability graphs of Petri nets with only two transitions gives insight into typical structures that also might occur with arbitrarily large nets. An important means for such a characterisation is region theory, which allows to draw conclusions from cycles occurr...

We provide a constructive characterisation of circuits in the simple (2, 2)sparsity matroid. A circuit is a simple graph G = (V,E) with |E| = 2|V | − 1 and the number of edges induced by any X ( V is at most 2|X| − 2. Insisting on simplicity results in the Henneberg operation being enough only when the graph is sufficiently connected. Thus we introduce 3 different sum operations to complete the...

The Museo Nazionale della Scienza e Tecnologia “Leonardo da Vinci” in Milan is exposing two pairs of canal lock gates, used to control the water flow system, whose design appears Leonardo’s Codex Atlanticus. wood present gates has been deeply characterised by mean a multidisciplinary investigation involving i) DNA barcoding fragments; ii) microbial community characterisation, and iii) chemical ...

With the rapid growth of sequence databases, there is an increasing need for reliable functional characterisation and annotation of newly predicted proteins. To cope with such large data volumes, faster and more effective means of protein sequence characterisation and annotation are required. One promising approach is automatic large-scale functional characterisation and annotation, which is ge...

Clique-width of graphs is defined algebraically through operations on graphs with vertex labels. We characterise the clique-width in a combinatorial way by means of partitions of the vertex set, using trees of nested partitions where partitions are ordered bottom-up by refinement. We show that the correspondences in both directions, between combinatorial partition trees and algebraic terms, pre...

In-situ three terminal electron field emission characterisation of an isolated multiwalled carbon nanotube has been performed. Both anode and gate electrodes are attached to high precision piezo-drivers allowing for the characterisation of single emitters. All measurements are performed in a scanning electron microscope allowing accurate knowledge of the local environment of the nanotube to be ...

We present a characterisation of conjugacy in Thompson’s group using the natural action of F on the interval [0, 1]. This characterisation completes the program begun by Brin and Squier [BS01]. Our characterisation also provides another solution to the conjugacy problem in Thompson’s group which was first solved by Guba and Sapir using diagram groups [GS97]. A number of other solutions exist du...