Dataset Information

Optimal Halbach Configuration for Flow-through Immunomagnetic CTC Enrichment.

ABSTRACT: Due to the low frequency of circulating tumor cells (CTC), the standard CellSearch method of enumeration and isolation using a single tube of blood is insufficient to measure treatment effects consistently, or to steer personalized therapy. Using diagnostic leukapheresis this sample size can be increased; however, this also calls for a suitable new method to process larger sample inputs. In order to achieve this, we have optimized the immunomagnetic enrichment process using a flow-through magnetophoretic system. An overview of the major forces involved in magnetophoretic separation is provided and the model used for optimizing the magnetic configuration in flow through immunomagnetic enrichment is presented. The optimal Halbach array element size was calculated and both optimal and non-optimal arrays were built and tested using anti-EpCAM ferrofluid in combination with cell lines of varying EpCAM antigen expression. Experimentally measured distributions of the magnetic moment of the cell lines used for comparison were combined with predicted recoveries and fit to the experimental data. Resulting predictions agree with measured data within measurement uncertainty. The presented method can be used not only to optimize magnetophoretic separation using a variety of flow configurations but could also be adapted to optimize other (static) magnetic separation techniques.

SUBMITTER: Stevens M

PROVIDER: S-EPMC8229094 | biostudies-literature |

REPOSITORIES: biostudies-literature

ACCESS DATA

Similar Datasets

Project description:ObjectiveThe objectives of this paper are to 1) construct a new network model compatible with distributed computation, 2) construct the full optimal power flow (OPF) in a distributed fashion so that an effective, non-inferior solution can be found, and 3) develop a scalable algorithm that guarantees the convergence to a local minimum.Existing challengesDue to the nonconvexity of the problem, the search for a solution to OPF problems is not scalable, which makes the OPF highly limited for the system operation of large-scale real-world power grids-"the curse of dimensionality". The recent attempts at distributed computation aim for a scalable and efficient algorithm by reducing the computational cost per iteration in exchange of increased communication costs.MotivationA new network model allows for efficient computation without increasing communication costs. With the network model, recent advancements in distributed computation make it possible to develop an efficient and scalable algorithm suitable for large-scale OPF optimizations.MethodsWe propose a new network model in which all nodes are directly connected to the center node to keep the communication costs manageable. Based on the network model, we suggest a nodal distributed algorithm and direct communication to all nodes through the center node. We demonstrate that the suggested algorithm converges to a local minimum rather than a point, satisfying the first optimality condition.ResultsThe proposed algorithm identifies solutions to OPF problems in various IEEE model systems. The solutions are identical to those using a centrally optimized and heuristic approach. The computation time at each node does not depend on the system size, and Niter does not increase significantly with the system size.ConclusionOur proposed network model is a star network for maintaining the shortest node-to-node distances to allow a linear information exchange. The proposed algorithm guarantees the convergence to a local minimum rather than a maximum or a saddle point, and it maintains computational efficiency for a large-scale OPF, scalable algorithm.

Dataset Information

Optimal Halbach Configuration for Flow-through Immunomagnetic CTC Enrichment.

Similar Datasets

OmicsDI is part of the ELIXIR infrastructure

Tweets