Abstract: A method is disclosed for generating pixel risk maps for diagnostic image reconstruction. The method produces uncertainty/variance maps by feeding into a trained encoder a short-scan image acquired from a medical imaging scan to generate latent code statistics including the mean ?y and variance ?y; selecting random samples based on the latent code statistics, z˜N(?y,?y2); feeding the random samples into a trained decoder to generate a pool of reconstructed images; and calculating, for each pixel of the pool of reconstructed images, the pixel mean and variance statistics across the pool of reconstructed images. The risk of each pixel may be calculated using the Stein's Unbiased Risk Estimator on the input density compensated data, that involves calculating the end-to-end divergence of the deep neural network.

Abstract: A method is disclosed for generating pixel risk maps for diagnostic image reconstruction. The method produces uncertainty/variance maps by feeding into a trained encoder a short-scan image acquired from a medical imaging scan to generate latent code statistics including the mean ?y and variance ?y; selecting random samples based on the latent code statistics, z˜N(?y,?y2); feeding the random samples into a trained decoder to generate a pool of reconstructed images; and calculating, for each pixel of the pool of reconstructed images, the pixel mean and variance statistics across the pool of reconstructed images. The risk of each pixel may be calculated using the Stein's Unbiased Risk Estimator on the input density compensated data, that involves calculating the end-to-end divergence of the deep neural network.

Abstract: Fast digital implementations of the second generation curvelet transform for use in data processing are disclosed. One such digital transformation is based on unequally-spaced fast Fourier transforms (USFFT) while another is based on the wrapping of specially selected Fourier samples. Both digital transformations return a table of digital curvelet coefficients indexed by a scale parameter, an orientation parameter, and a spatial location parameter. Both implementations are fast in the sense that they run in about O(n2 log n) flops for n by n Cartesian arrays or about O(N log N) flops for Cartesian arrays of size N=n3; in addition, they are also invertible, with rapid inversion algorithms of about the same complexity.

Abstract: The invention disclosed herein enables a collection of computers and associated communications infrastructure to offer a new communications process which allows information providers to broadcast information to a population of information consumers. The information may be targeted to those consumers who have a precisely formulated need for the information. This targeting may be based on information which is inaccessible to other communications protocols. The targeting also includes a time element. Information can be brought to the attention of the consumer precisely when it has become applicable, which may occur immediately upon receipt of the message, but may also occur long after the message arrives. The communications process may operate without intruding on consumers who do not exhibit the precisely-specified need for the information, and it may operate without compromising the security or privacy of the consumers who participate.

Abstract: The invention disclosed herein enables a collection of computers and associated communications infrastructure to offer a new communications process which allows information providers to broadcast information to a population of information consumers. The information may be targeted to those consumers who have a precisely formulated need for the information. This targeting may be based on information which is inaccessible to other communications protocols. The targeting also includes a time element. Information can be brought to the attention of the consumer precisely when it has become applicable, which may occur immediately upon receipt of the message, but may also occur long after the message arrives. The communications process may operate without intruding on consumers who do not exhibit the precisely-specified need for the information, and it may operate without compromising the security or privacy of the consumers who participate.

Abstract: Fast digital implementations of the second generation curvelet transform for use in data processing are disclosed. One such digital transformation is based on unequally-spaced fast Fourier transforms (USFFT) while another is based on the wrapping of specially selected Fourier samples. Both digital transformations return a table of digital curvelet coefficients indexed by a scale parameter, an orientation parameter, and a spatial location parameter. Both implementations are fast in the sense that they run in about O(n2 log n) flops for n by n Cartesian arrays or about O(N log N) flops for Cartesian arrays of size N=n3; in addition, they are also invertible, with rapid inversion algorithms of about the same complexity.

Abstract: The invention provides a method and apparatus for making reduced numbers of measurements compared to current practice and still give acceptable quality reconstructions of the object of interest. In one embodiment, a digital signal or image is approximated using significantly fewer measurements than with traditional measurement schemes. A component x of the signal or image can be represented as a vector with m entries; traditional approaches would make m measurements to determine the m entries. The disclosed technique makes measurements y comprising a vector with only n entries, where n is less than m. From these n measurements, the disclosed invention delivers an approximate reconstruction of the m-vector x. In another embodiment, special measurement matrices called CS-matrices are designed for use in connection with the embodiment described above.

Abstract: The present invention discloses methods for deconvolving and converting 1D mass spectra to 2D mass spectrum in order to obtain migration time centers and total intensities of the neutral mass envelopes of 2D spectra. The present invention also discloses devices that include a preparation/separation unit coupled to a mass spectrometer unit, and a computer unit capable of deconvolving mass spectra and calculating neutral mass envelopes.

Abstract: The invention disclosed herein enables a collection of computers and associated communications infrastructure to offer a new communications process which allows a requestor to receive configuration information of a computational device from a responder. The requestor first sends query documents that contain queries for configuration information of a computational device to the responder; the responder automatically collects the answers for the queries and sends a response document that contains the configuration information of the computational device to the requestor. The queries are written in a formal descriptive language which is transparent, safe for network evaluation, and extensible, and the configuration reader of the responder can parse the queries and automatically invoke a set of standard inspectors to obtain the corresponding configuration information.

Abstract: A console for an enterprise suite is disclosed. The enterprise suite addresses the increasingly complex problem of keeping critical systems updated, compatible, and free of security holes. It uses Fixlet® technology to identify vulnerable computers on the network and then allows authorized personnel to correct problems across any subset of the network with a few simple mouse-clicks. The enterprise suite helps keep the networked computers updated and properly patched, all from a central console which, along with supporting architectural enhancements, is the subject matter of this document. The invention allows rolling out a security patch in minutes instead of months, thus allowing an administrator to stay ahead of potential hacker attacks. The invention also makes it possible to track the progress of each computer as updates are applied, thus making it simple to gauge the level of compliance across the entire enterprise.

Abstract: A method of displaying capacity information relating to computer resources over a preselected period of time. The computer resource is connected to a communications network and the method includes collecting data relating to capacity of the resource by periodically sampling preselected resource elements at a preselected fixed interval to define a capacity variable for that resource. The periodic sampling takes place from a location on the network that is remote from the computer resource and over a period of time for the resource element. The capacity variable of the resource element is compared with capacity variable(s) collected immediately prior to said capacity variable. The capacity variable is stored, together with an associated timestamp, if said capacity variable falls outside a preselected margin of the average of the prior capacity variables.