PubMed Health⌕ Search

PubMed · 10098449

Scanning E-field sensor device for online measurements in annular phased-array systems.

Abstract

PURPOSE: A measurement device for noninvasive and simultaneous control of antennas during regional radiofrequency (rf) hyperthermia and, subsequently, the estimation of the power distribution in the interior of patients are essential preconditions for further technological progress. Aiming at this, the feasibility of an electro-optical electric field sensor was investigated during clinical rf hyperthermia. MATERIAL AND METHODS: The electro-optical electric field (E-field) sensor is based on lithiumniobate crystals and the Mach-Zehnder interferometer structure, and was tested in an earlier phantom study. For this study, a mechanical scanning device was developed allowing the registration of the E-field during clinical application. Data were recorded along a curve in the water bolus of the SIGMA 60 applicator of the annular phased-array system BSD-2000 (BSD Medical Corp., Salt Lake City, UT) close to the base points of the flat biconical dipole antennas. The results were compared with modeling calculations using the finite-difference time-domain (FDTD) method. For the latter, different antenna models were assumed. For systematic registration of the E-field curves in amplitude and phase, we employed an elliptical lamp phantom with fat-equivalent ring (filled with saline solution) and an elliptical polyacrylamide phantom with acrylic glass wall. Further measurements were carried out during the treatment of 5 patients with 20 hyperthermia treatments. RESULTS: Data of both phantom and patient measurements can be satisfactorily described by the FDTD method, if the antenna model is refined by taking into account the conical form of the dipoles and the special dielectric environment of the feeding point. Phase deviations can be entered ex posteriori for correction in the calculation algorithm. A comparison of amplifier power measurement (forward and backward power) and bolus E-field scans near the antenna base points demonstrates that E-field measurements between antennas and patient are a necessity for the appropriate characterization of antenna radiation properties. These measurements are sensitive to variations of the lossy medium in position and shape, and can be correctly predicted with current models. However, the differences between different patients are moderate and unspecific in both calculations and measurements, with fluctuations at maximum of 30 degrees in phases and 40% in amplitudes. CONCLUSIONS: The measurement method presented here turned out to be a practical tool for online registration of E-fields in phases and amplitudes along arbitrary curves in a water bolus or phantom. It can be utilized to evaluate antenna design and modeling calculations and leads, thus, to a better understanding of complicated multiantenna systems. In clinical routine, it can be employed as input for patient-specific hyperthermia planning and, finally, for the realization of online control with subsequent optimization of the power distribution in the patient.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

P Wust, J Berger, H Fähling, J Nadobny, J Gellermann, W Tilly, B Rau, K Petermann, R Felix. 1999-03-01. Scanning E-field sensor device for online measurements in annular phased-array systems.. https://doi.org/10.1016/s0360-3016(98)00490-8

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related citations

A note on a generalized single step theory for any number of hierarchical genomic matrices.

BACKGROUND: The Single Step algorithm allows combining information from genotyped and un-genotyped individuals, provided they are connected by a pedigree. However, current single step theory is limited to a single list of markers. RESULTS: We present a generalized single step (GSS) method that can accommodate any number of hierarchical molecular datasets (e.g. sequence, high and low density arrays) and pedigree, avoiding imputation. We prove that a similar efficient inversion algorithm exists. The method is recursive, starting with the highest marker density scenario. We illustrate the method with simulation and show that GSS can increase predictive accuracy compared to standard single step. R code is provided so that custom scenarios can be easily compared, either with simulated or real data. CONCLUSION: The method developed generalizes extant single step theory to any number of hierarchical molecular relationship matrices, broadening the scenarios where single step can be applied. A topic of particular interest can be ecology field data or human populations where pedigree is not available, but where samples sequenced and genotyped at different densities can exist. GSS can also be a useful tool to optimize allocation of genotyping and / or sequencing resources.

Algorithms↗

cgDist: Nucleotide-level distance calculation from cgMLST allelic profiles.

Bacterial genomic surveillance requires balancing computational efficiency with genetic resolution for effective cluster investigation. cgMLST distance calculations treat all allelic differences as equivalent units, obscuring nucleotide-level variation. Furthermore, single nucleotide polymorphism-based pipelines provide finer resolution at substantially higher computational cost, which limits their routine deployment in surveillance laboratories. We present cgDist, an algorithm that calculates nucleotide-level distances directly from cgMLST allelic profiles, providing finer resolution than allele-count distances by leveraging within-allele nucleotide variation. The cache architecture stores alignment statistics, enabling distance calculation modes without computation and supporting both dataset-specific and schema-complete cache generation. This design enables incremental surveillance analysis, with performance benefits as laboratories accumulate alignment data. cgDist functions as a precision 'zoom lens' for the investigation of clusters identified through initial cgMLST screening. Rather than restructuring population relationships, this targeted approach concentrates enhanced resolution where it is most informative. The algorithm ensures that cgDist distances are greater than or equal to corresponding cgMLST distances, preserving epidemiological interpretability while adding genetic discrimination. By increasing resolution within identified clusters, cgDist may also support outbreak investigation, a potential application that remains to be evaluated on outbreak-derived data.

Algorithms↗

Theseus: fast and optimal affine-gap sequence-to-graph alignment.

MOTIVATION: Sequence-to-graph alignment is a central problem in bioinformatics, with applications in multiple sequence alignment (MSA) and pangenome analysis, among others. However, current algorithms for optimal affine-gap alignment impose high memory and computational requirements, limiting their scalability to aligning long sequences to complex graphs. Practical solutions partially address this problem using heuristic strategies that ultimately trade off optimality for speed. RESULTS: This work presents Theseus, a novel, fast, and optimal affine-gap sequence-to-graph alignment algorithm. Theseus leverages similarities between genomic sequences to accelerate the alignment computation and reduces the overall memory requirements without compromising optimality. To that end, Theseus processes only a subset of the dynamic programming cells, using a sparse-data strategy that enables efficient sequence-to-graph alignment. Moreover, our algorithm supports optimal affine-gap alignment on arbitrary directed graphs, including those with cycles. We evaluate Theseus on two key problems: MSA and pangenome read mapping. For MSA, we compare it against SPOA, abPOA, and POASTA. Theseus is 1.6× to 17.6× faster than POASTA, and 7.3× faster, on average, than SPOA, both optimal aligners. Compared with abPOA, Theseus ensures optimality and scales to the largest problems. For pangenome read mapping, we benchmark Theseus against the alignment stage of the mapping tool vg map, along with the alignment kernels of SPOA, abPOA, and POASTA. Theseus outperforms the other methods, showing a 1.9× to 16.9× speedup on short reads. Moreover, Theseus is 1.5× to 36.3× faster than vg when aligning against synthetic cyclic graphs. AVAILABILITY AND IMPLEMENTATION: Theseus code and documentation are publicly available at https://github.com/albertjimenezbl/theseus-lib.

Algorithms↗