Siemens Aktiengesellschaft

Siemens Healthcare Gmbh

Siemens Corporate Research, Inc.

Glenn A Meredith

R Bharat Rao

Christine Lorenz

Li Pan

Russell Greiner

A catheter () comprising a catheter tip () that is adapted to have deflection of an associated spring () detected by imaging techniques and to have that deflection be translated into an estimation of the tip () contact force.

Compressable catheter tip with image-based force sensing

A method for selecting the b-values for diffusion weighted magnetic resonance scans. The method includes: identifying a single reference slice within a volume of interest (VOI); progressively changing b-values over a plurality of scans of the reference slice wherein each one of the scans has a different b-value to obtain a plurality of diffusion weighted images; calculating ADC maps for combinations of b-values from the obtained plurality of diffusion weighted images; evaluating the calculated ADC maps; selecting from the evaluation optimal b-values; and using the selected b-values for subsequent scans.

b-value optimization for diffusion weighted magnetic resonance imaging

A computer system takes as input an initial fault hierarchy KB.sub.0 and a set of annotated session transcripts C={&lt;.pi..sub.j,r.sub.j &gt;} and is given a specified set of revision operators T={.theta..sub.i } where each .theta..sub.i .epsilon. T maps a fault hierarchy KB to a slightly different hierarchy .theta..sub.i (KB). The computer system uses T to hill climb from the initial fault hierarchy KB.sub.0, through successive hierarchies, KB.sub.1 . . . KB.sub.m, with successively higher empirical accuracies over C. At each stage, to go from a fault hierarchy KB.sub.k to its neighbor KB.sub.k+1, the computer system must evaluate KB.sub.k 's accuracy over C, as well as the accuracy of each KB' .epsilon. N(KB.sub.k). The computer system provides an efficient way of evaluating the accuracy of KB.sub.k, and each .theta..sub.i (KB.sub.k), towards determining which, if any, .theta..sub.i (KB.sub.k) is more accurate than KB.sub.k. It exploits a few key observations. First, as each transformation used to map one hierarchy to a related one performs only local changes to the hierarchy, it will have only minor and easily computed effects on any instance. Second, most transformations will have no effect on many instances. Finally, one can bound how much the accuracy score for a knowledge base can change based on any instance, which means branch-and-bound techniques can be used to avoid computing the accuracy scores for various hierarchies that cannot be optimal.

Growing community of inventors

Freehold, NJ, United States of America

Glenn A Meredith