Inertial focusing of microparticles,bacteria, and blood in serpentine glass channels

Early detection of pathogenic microorganisms is pivotal to diagnosis and prevention of health and safety crises. Standard methods for pathogen detection often rely on lengthy culturing procedures, confirmed by biochemical assays, leading to >24 h for a diagnosis. The main challenge for pathogen detection is their low concentration within complex matrices. Detection of blood-borne pathogens via techniques such as PCR requires an initial positive blood culture and removal of inhibitory blood components, reducing its potential as a diagnostic tool. Among different label-free microfluidic techniques, inertial focusing on microscale channels holds great promise for automation, parallelization, and passive continuous separation of particles and cells. This work presents inertial microfluidic manipulation of small particles and cells (1–10 μm) in curved serpentine glass channels etched at different depths (deep and shallow designs) that can be exploited for (1) bacteria preconcentration from biological samples and (2) bacteria-blood cell separation. In our shallow device, the ability to focus Escherichia coli into the channel side streams with high recovery (89% at 2.2× preconcentration factor) could be applied for bacteria preconcentration in urine for diagnosis of urinary tract infections. Relying on differential equilibrium positions of red blood cells and E. coli inside the deep device, 97% red blood cells were depleted from 1:50 diluted blood with 54% E. coli recovered at a throughput of 0.7 mL/min. Parallelization of such devices could process relevant volumes of 7 mL whole blood in 10 min, allowing faster sample preparation for downstream molecular diagnostics of bacteria present in bloodstream.     

Photocatalytic Water Oxidation by a Pyrochlore Oxide upon Irradiation with Visible Light: Rhodium Substitution Into Yttrium Titanate

A stable visible‐light‐driven photocatalyst (λ≥450 nm) for water oxidation is reported. Rhodium substitution into the pyrochlore Y₂Ti₂O₇ is demonstrated by monitoring Vegard′s law evolution of the unit‐cell parameters with changing rhodium content, to a maximum content of 3 % dopant. Substitution renders the solid solutions visible‐light active. The overall rate of oxygen evolution is comparable to WO₃ but with superior light‐harvesting and surface‐area‐normalized turnover rates, making Y₂Ti_1.94Rh_0.06O₇ an excellent candidate for use in a Z‐scheme water‐splitting system.     

Generalized markushevich bases

Conditions for the embedding of a Banach space as a dense subspace of a continuous function space are studied. Necessary and sufficient conditions for a Banach space to be isomorphic to aP ₁ space are found.     

Studies of a TEA CO2 laser with a cylindrical mirror unstable resonator

We describe the results of a study of a TEA CO₂ laser using a strip cylindrical unstable resonator which produces an output beam with suitable characteristics for producing a high quality line focus. Using this technique an irradiance of ?10⁹W cm^-2 over a 5 cm long line focus has been achieved.     

Path coupling without contraction

Path coupling is a useful technique for simplifying the analysis of a coupling of a Markov chain. Rather than defining and analysing the coupling on every pair in Ω×Ω, where Ω is the state space of the Markov chain, analysis is done on a smaller set SΩ×Ω. If the coefficient of contraction β is strictly less than one, no further analysis is needed in order to show rapid mixing. However, if β=1 then analysis (of the variance) is still required for all pairs in Ω×Ω. In this paper we present a new approach which shows rapid mixing in the case β=1 with a further condition which only needs to be checked for pairs in S, greatly simplifying the work involved. We also present a technique applicable when β=1 and our condition is not met.     

On the complexity of partitioning graphs into connected subgraphs

This paper is mainly concerned with the computational complexity of determining whether or not the vertices of a graph can be partitioned into equal sized subsets so that each subset induces a particular type of graph. Many of the NP-completeness results are for planar graphs. These are proved using a planar version of 3-dimensional matching.     

Excimer laser polymer ablation: twenty years on

Research and development in excimer laser polymer ablation has been actively pursued for some twenty years, driven by interest in the basic science as well as by numerous applications that have emerged for this high-resolution technique for material removal. This paper reviews some of the basic mechanistic aspects of the UV laser–polymer interaction as a prelude to dealing with practical matters related to polymer processing by ablation. Applications in micro-machining and potential areas for future research are briefly covered. Received: 7 October 2002 / Accepted: 8 February 2003 / Published online: 28 May 2003 RID="*" ID="*"Corresponding author. Fax: +44-1482/465-606, E-mail: p.e.dyer@hull.ac.uk     

On patching algorithms for random asymmetric travelling salesman problems

Let the arc-lengthsL _ij of a complete digraph onn vertices be independent uniform [0, 1] random variables. We consider the patching algorithm of Karp and Steele for the travelling salesman problem on such a digraph and give modifications which tighten the expected error. We extend these ideas to thek-person travelling salesman problem and also consider the case where cities can be visited more than once.     

Edge searching weighted graphs

In traditional edge searching one tries to clean all of the edges in a graph employing the least number of searchers. It is assumed that each edge of the graph initially has a weight equal to one. In this paper we modify the problem and introduce the Weighted Edge Searching Problem by considering graphs with arbitrary positive integer weights assigned to its edges. We give bounds on the weighted search number in terms of related graph parameters including pathwidth. We characterize the graphs for which two searchers are sufficient to clear all edges. We show that for every weighted graph the minimum number of searchers needed for a not-necessarily-monotonic weighted edge search strategy is enough for a monotonic weighted edge search strategy, where each edge is cleaned only once. This result proves the NP-completeness of the problem.     

Development of a Synthetic Route to Unsymmetrical Triphosphine Ligands and an Investigation of Their Coordination Chemistry with Nickel and Palladium

Chiral tridentate phosphines, R(2)P(CH(2))(3)PPh(CH(2))(2)PPh(2) where R = C(6)H(5), p-ClC(6)H(4), and p-FC(6)H(4), can be prepared from simple starting materials, (R(3)P, I(CH(2))(3)I, and Ph(2)P(CH(2))(2)PPh(2)), in a few stages involving phosphonium salts and phosphine oxides as intermediates. Crystalline diamagnetic complexes of nickel(II) and palladium(II) have been isolated. In solution these show first-order 12 line (31)P NMR spectra consistent with three nonequivalent phosphorus nuclei coupled to one another in a square planar geometry. A single X-ray crystallographic study of NiI(2){P(CH(2))(3)PPh(CH(2))(2)PPh(2)} showed that this was square pyramidal in the solid state with a weakly held apical iodo ligand.