Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Abstract: Sentinel lymph node (SLN) excision is included in various cancer guidelines to identify microscopic metastatic disease. Although effective, SLN excision is an invasive procedure requiring radioactive tracing. Novel imaging approaches assessing SLN metastatic status could improve or replace conventional lymph node excision protocols. In our first-in-human study, we used noninvasive multispectral optoacoustic tomography (MSOT) to image SLNs ex vivo and in vivo in patients with melanoma, to determine metastatic status. MSOT significantly improved the tumor metastasis detection rate in excised SLN (506 SLNs from 214 melanoma patients) compared with the conventional EORTC (European Organisation for Research and Treatment of Cancer) Melanoma Group protocol (22.9% versus 14.2%). MSOT combined with the near-infrared fluorophore indocyanine green reliably visualized SLNs in vivo in 20 patients, up to 5-cm penetration and with 100% concordance with (99m)Tc-marked SLN lymphoscintigraphy. MSOT identified cancer-free SLNs in vivo and ex vivo without a single false negative (189 total lymph nodes), with 100% sensitivity and 48 to 62% specificity. Our findings indicate that a noninvasive, nonradioactive MSOT-based approach can identify and determine SLN status and confidently rule out the presence of metastasis. The study further demonstrates that optoacoustic imaging strategies can improve the identification of SLN metastasis as an alternative to current invasive SLN excision protocols.
    Type of Publication: Journal article published
    PubMed ID: 26659573
    Signatur Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    The VLDB journal 8 (2000), S. 156-177 
    ISSN: 0949-877X
    Keywords: Key words:Object identifier – Logical OID – Physical OID – Query processing – Pointer join – Functional join – Order-preserving join
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract. Inter-object references are one of the key concepts of object-relational and object-oriented database systems. In this work, we investigate alternative techniques to implement inter-object references and make the best use of them in query processing, i.e., in evaluating functional joins. We will give a comprehensive overview and performance evaluation of all known techniques for simple (single-valued) as well as multi-valued functional joins. Furthermore, we will describe special order-preserving\/ functional-join techniques that are particularly attractive for decision support queries that require ordered results. While most of the presentation of this paper is focused on object-relational and object-oriented database systems, some of the results can also be applied to plain relational databases because index nested-loop joins\/ along key/foreign-key relationships, as they are frequently found in relational databases, are just one particular way to execute a functional join.
    Type of Medium: Electronic Resource
    Signatur Availability
    BibTip Others were also interested in ...
  • 3
    ISSN: 0949-877X
    Keywords: Key words: Decision Support Systems – Query processing and optimization – Early sorting and partitioning – Hash joins and hash teams – Performance evaluation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract. Decision support queries typically involve several joins, a grouping with aggregation, and/or sorting of the result tuples. We propose two new classes of query evaluation algorithms that can be used to speed up the execution of such queries. The algorithms are based on (1) early sorting and (2) early partitioning– or a combination of both. The idea is to push the sorting and/or the partitioning to the leaves, i.e., the base relations, of the query evaluation plans (QEPs) and thereby avoid sorting or partitioning large intermediate results generated by the joins. Both early sorting and early partitioning are used in combination with hash-based algorithms for evaluating the join(s) and the grouping. To enable early sorting, the sort order generated at an early stage of the QEP is retained through an arbitrary number of so-called order-preserving hash joins. To make early partitioning applicable to a large class of decision support queries, we generalize the so-called hash teams proposed by Graefe et al. [GBC98]. Hash teams allow to perform several hash-based operations (join and grouping) on the same attribute in one pass without repartitioning intermediate results. Our generalization consists of indirectly partitioning the input data. Indirect partitioning means partitioning the input data on an attribute that is not directly needed for the next hash-based operation, and it involves the construction of bitmaps to approximate the partitioning for the attribute that is needed in the next hash-based operation. Our performance experiments show that such QEPs based on early sorting, early partitioning, or both in combination perform significantly better than conventional strategies for many common classes of decision support queries.
    Type of Medium: Electronic Resource
    Signatur Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...