The aim of this work is to construct a computational fluid dynamics model capable of simulating the quasitransient process of apheresis. To this end a Lagrangian-Eulerian model has been developed which tracks the blood particles within a delineated two-dimensional flow domain. Within the Eulerian method, the fluid flow conservation equations within the separator are solved. Taking the calculate...

The TRIμP facility, under construction at KVI, requires the production and separation of short-lived and rare isotopes. Direct reactions, fragmentation and fusionevaporation reactions in normal and inverse kinematics are foreseen to produce nuclides of interest with a variety of heavy-ion beams from the superconducting cyclotron AGOR. For this purpose, we have designed, constructed and commissi...

The Vertex Separator Problem (VSP) for a graph is to find the smallest collection of vertices whose removal breaks the graph into two disconnected subsets of roughly equal size. In a recent paper (Optimality Conditions For Maximizing a Function Over a Polyhedron, Mathematical Programming, 2013, doi: 10.1007/s10107-013-0644-1), the authors announced a new continuous bilinear quadratic programmin...

Given a graph G(V,E) and a set of vertices S ⊂ V , an S-flap is the set of vertices in a connected component of the graph induced on V \ S. A set S is a vertex separator if no S-flap has more than n/2 vertices. Lipton and Tarjan showed that every planar graph has a separator of size O( √ n). This was later generalized by Gilbert, Hutchinson and Tarjan to any graph embeddable on a surface of bou...

We describe a microfluidic device for on-chip chemical processing, such as staining, and subsequent washing of cells. The paper introduces "separator walls" to increase the on-chip incubation time and to improve the quality of washing. Cells of interest are concentrated into a treatment stream of chemical reagents at the first separator wall for extended on-chip incubation without causing exces...

The protein folding problem in the HP-model is NP-hard in both 2D and 3D [4, 6]. The problem is to put a sequence, consisting of two characters H and P, on a d-dimensional grid to have the maximal number of HH contacts. We design a 2 1− 1 d log n) time algorithm for ddimensional protein folding in the HP-model. In particular, our algorithm has O(2 √ n log ) and O(2 2 3 log ) computational time ...

We study acceleration methods for point-to-point shortest path and constrained shortest path computations in directed graphs, in particular in road and railroad networks. Our acceleration methods are allowed to use a preprocessing of the network data to create auxiliary information which is then used to speed-up shortest path queries. We focus on two methods based on Dijkstra’s algorithm for sh...

INTRODUCTION During adrenal venous sampling (AVS) procedure, radiologists administer a contrast agent via the catheter to visualize the proper catheter position. MATERIALS AND METHODS A patient with primary aldosteronism diagnostic-hypothesis was admitted for AVS. A venogram was performed to
confirm the catheter's position with 2mL of Iopamidol 300 mg/mL. Samples were collected with syringe c...

We study the problem of deleting the smallest set S of vertices (resp. edges) from a given graph G such that the induced subgraph (resp. subgraph) G \ S belongs to some class H. We consider the case where graphs in H have treewidth bounded by t, and give a general framework to obtain approximation algorithms for both vertex and edge-deletion settings from approximation algorithms for certain na...