Inventors list

Assignees list

Classification tree browser

Top 100 Inventors

Top 100 Assignees


Das Gupta, US

Anshuman Das Gupta, Austin, TX US

Patent application numberDescriptionPublished
20120284461Methods and Apparatus for Storage and Translation of Entropy Encoded Software Embedded within a Memory Hierarchy - A system for translating compressed instructions to instructions in an executable format is described. A translation unit is configured to decompress compressed instructions into a native instruction format using X and Y indices accessed from a memory, a translation memory, and a program specified mix mask. A level 1 cache is configured to store the native instruction format for each compressed instruction. The memory may be configured as a paged instruction cache to store pages of compressed instructions intermixed with pages of uncompressed instructions. Methods of determining a mix mask for efficiently translating compressed instructions is also described. A genetic method uses pairs of mix masks as genes from a seed population of mix masks that are bred and may be mutated to produce pairs of offspring mix masks to update the seed population. A mix mask for efficiently translating compressed instructions is determined from the updated seed population.11-08-2012

Jaydip Das Gupta, Mayfiled, OH US

Patent application numberDescriptionPublished
20110135674Markers of XMRV Infection and Uses Thereof - The present invention relates generally to assays for the detection of Xenotropic Murine Leukemia Virus-related Retrovirus (“XMRV”) and diseases associated with XMRV infection. Additionally, the invention relates to specific XMRV antigens capable of inducing an immunogenic response as well as XMRV-related nucleic acids having significant diagnostic, screening, and therapeutic utilities.06-09-2011

Mithun Das Gupta, Cupertino, CA US

Patent application numberDescriptionPublished
20100299379Non-Negative Matrix Factorization as a Feature Selection Tool for Maximum Margin Classifiers - Non-negative matrix factorization, NMF, is combined with identification of a maximum margin classifier by minimizing a cost function that contains a generative component and the discriminative component. The relative weighting between the generative component and the discriminative component are adjusting during subsequent iterations such that initially, when confidence is low, the generative model is favored. But as the iterations proceed, confidence increases and the weight of the discriminative component is steadily increased until it is of equal weight as the generative model. Preferably, the cost function to be minimized is:11-25-2010
20110191400L1 Projections with Box Constraints - Similarities between simplex projection with upper bounds and L08-04-2011
20110194690Data Adaptive Message Embedding For Visible Watermarking - A watermarking system uses distinct bit patterns to identify a logic 0, a logic 1, and a marker bit, which demarcates segments of logic bit information. Marker bits, which are printed on both foreground and background areas of an image, outline message blocks. In message extraction, a preprocessing step removes any white boarders, identifies the best defined corner of a message block, crops the image, and rotates the image to place the identified corner at the top-left corner. Message extraction scans the rotated image in window segments of increasing size during multiple cycles. During each cycle, if a bit pattern cannot be identified as a data bit, then the size of the examined bit area is increased and rechecked to see it specifically is a marker bit. If no bit information can be definitively identified, then it is assigned a logic bit value based on a 50% random assignment.08-11-2011
20110194725Novel Bit Pattern Design For Visible Watermarking - A watermarking system uses distinct bit patterns to identify a logic 0, a logic 1, and a marker bit, which demarcates segments of logic bit information. Marker bits, which are printed on both foreground and background areas of an image, outline message blocks. In message extraction, a preprocessing step removes any white boarders, identifies the best defined corner of a message block, crops the image, and rotates the image to place the identified corner at the top-left corner. Message extraction scans the rotated image in window segments of increasing size during multiple cycles. During each cycle, if a bit pattern cannot be identified as a data bit, then the size of the examined bit area is increased and rechecked to see it specifically is a marker bit. If no bit information can be definitively identified, then it is assigned a logic bit value based on a 50% random assignment.08-11-2011
20110194726Embedded Message Extraction For Visible Watermarking - A watermarking system uses distinct bit patterns to identify a logic 0, a logic 1, and a marker bit, which demarcates segments of logic bit information. Marker bits, which are printed on both foreground and background areas of an image, outline message blocks. In message extraction, a preprocessing step removes any white boarders, identifies the best defined corner of a message block, crops the image, and rotates the image to place the identified corner at the top-left corner. Message extraction scans the rotated image in window segments of increasing size during multiple cycles. During each cycle, if a bit pattern cannot be identified as a data bit, then the size of the examined bit area is increased and rechecked to see it specifically is a marker bit. If no bit information can be definitively identified, then it is assigned a logic bit value based on a 50% random assignment.08-11-2011
20110200269Fast Approximation For Bilateral Filter - Multiple filters of a bilateral filter are decoupled to form into multple linear filtering operations, which permits faster processing. The bilateral filter is re-presented as an approximate bilateral filter, and subjected to a logarithm whose resultant components are further subjected to a series of Jensen approximations. The errors resulting from each Jensen approximation are collected into a single cumulative error factor, and it is then shown that the cumulative error may be ignored without adversed affect to the result. Thus, the original bilateral filter may be implemented as log(y08-18-2011
20110243428Bi-Affinity Filter: A Bilateral Type Filter for Color Images - An edge preserving filter that works on the principle of matting affinity allows a better representation of the range filter term in bilateral class filters. The definition of the affinity term can be relaxed to suit different applications. An approximate bi-affinity filter whose output is shown to be very similar to the traditional bilateral filter is defined. The present technique has the added advantage that no color space changes are required and hence an input image can be handled in its original color space. This is a big benefit over the traditional bilateral filter, which needs conversion to perception based spaces, such as CIELAB, to generate results close to the present invention. The full bi-affinity filter preserves very minute details of the input image, and thus permits an enhanced zooming functionality.10-06-2011
20120008862Bi-Affinity Filter: A Bilateral Type Filter for Color Images - Application of an image filtering algorithm, which defines an algorithm window within which a center pixel is processed relative to the other pixels within the algorithm window, is improved by use of an extended window larger than and encompassing the algorithm window. This approached is applied with an edge preserving filter that works on the principle of matting affinity and allows a better representation of the range filter term in bilateral class filters. An approximate bi-affinity filter whose output is shown to be very similar to the traditional bilateral filter is defined. The present technique has the added advantage that no color space changes are required and hence an input image can be handled in its original color space.01-12-2012
20120041725Supervised Nonnegative Matrix Factorization - Graph embedding is incorporated into nonnegative matrix factorization, NMF, while using the original formulation of graph embedding. Negative values are permitted in the definition of graph embedding without violating the nonnegative requirement of NMF. The factorized matrices of NMF are found by an iterative process.02-16-2012
20120041905Supervised Nonnegative Matrix Factorization - Supervised nonnegative matrix factorization (SNMF) generates a descriptive part-based representation of data, based on the concept of nonnegative matrix factorization (NMF) aided by the discriminative concept of graph embedding. An iterative procedure that optimizes suggested formulation based on Pareto optimization is presented. The present formulation removes any dependence on combined optimization schemes. Analytical and empirical evidence is presented to show that SNMF has advantages over popular subspace learning techniques as well as current state-of-the-art techniques.02-16-2012
20120041906Supervised Nonnegative Matrix Factorization - Supervised kernel nonnegative matrix factorization generates a descriptive part-based representation of data, based on the concept of kernel nonnegative matrix factorization (kernel NMF) aided by the discriminative concept of graph embedding. An iterative procedure that optimizes suggested formulation based on Pareto optimization is presented. The present formulation removes any dependence on combined optimization schemes.02-16-2012

Patent applications by Mithun Das Gupta, Cupertino, CA US

Tapas K. Das Gupta, River Forest, IL US

Patent application numberDescriptionPublished
20080213185Transport agents for crossing the blood-brain barrier and into brain cancer cells, and methods of use thereof - The present invention discloses methods and materials for delivering a cargo compound into a brain cancer cell and/or across the blood-brain barrier. Delivery of the cargo compound is accomplished by the use of protein transport peptides derived from Neisseria outer membrane proteins, such as Laz. The invention also provides synthetic transit peptides comprised of the pentapeptide AAEAP. The invention further discloses methods for treating cancer, and specifically brain cancer, as well as other brain-related conditions. Further, the invention provides methods of imaging and diagnosing cancer, particular brain cancer.09-04-2008
20090137468CYTOTOXIC FACTORS FOR MODULATING CELL DEATH - Cytotoxic factors having use in modulating cell death, and their use in methods of treating necrosis or apoptosis-related conditions are disclosed. The invention also relates to methods for identifying active agents useful in treating conditions related to cell death. The present inventors have found that different pathogens produce different cytotoxic factor(s) having anticancer activity. The substantially pure cytotoxic factors can be used in a method of treating an infectious disease or a cancer.05-28-2009
20090286719MODIFICATION OF CUPREDOXIN DERIVED PEPTIDES AND METHODS OF USE THEREOF - The present invention provides modified cupredoxin derived peptides with pharmacologic activity that have improved pharmacokinetic properties, and methods to use them to treat mammals suffering from various conditions related to the pharmacologic activities. Modifications of the cupredoxin derived peptides include amino acid sequence variants and structural derivations that increase the plasma half-life of the peptide, increase the specific activity of the pharmacologic activity, decrease immunogenicity, and decrease the biotransformation of the peptides. The modified cupredoxin derived peptides can be used in methods to treat mammals for cancer, conditions related to inappropriate angiogenesis, viral and bacterial infections, and specifically HIV and malaria, conditions related to ephrin signaling, and to deliver cargo compounds, including diagnostic compounds, to cancer cell11-19-2009
20100008919COMPOSITIONS AND METHODS TO CONTROL ANGIOGENESIS WITH CUPREDOXINS - The present invention relates to compositions comprising cupredoxins, and their use to inhibit angiogenesis in mammalian cells, tissues, and animals, and particularly the angiogenesis that accompanies tumor development and particularly in humans. Specifically, the present invention relates to compositions comprising the cupredoxin(s), and or peptides that are variants, derivatives or structural equivalents of cupredoxins, which retain the ability to inhibit angiogenesis in mammalian cells, tissues or animals. These compositions may be peptides or pharmaceutical compositions, among others. The compositions of the invention may be used to treat any pathological condition that has as a symptom or cause, inappropriate angiogenesis, and particularly inappropriate angiogenesis related to tumor development.01-14-2010
20100093057COMPOSITIONS AND METHODS TO PREVENT CANCER BY STABILIZING P53 THROUGH NON MDM2-MEDIATED PATHWAYS - The present invention relates to compositions and methods comprising chemopreventive agents that may be cupredoxin(s) or variants, derivatives and structural equivalents of cupredoxins, and at least one other chemopreventive agent. Specifically, these compositions may comprise azurin from 04-15-2010
20100278937COMPOSITIONS AND METHODS TO PREVENT AND/OR TREAT CANCER WITH PA-CARD - The present invention relates to methods and materials for killing cancer cells with proteins derived from bacteria. The invention specifically relates to Azurin, Laz, Pa-CARD, and fusion proteins Azu-H.8 and H.8-Azu, and their use in killing leukemia cells and/or ovarian cancer cells.11-04-2010
20110077387TRANSPORT AGENTS FOR CROSSING THE BLOOD-BRAIN BARRIER AND INTO BRAIN CANCER CELLS, AND METHODS OF USE THEREOF - The present invention discloses methods and materials for delivering a cargo compound into a brain cancer cell and/or across the blood-brain barrier. Delivery of the cargo compound is accomplished by the use of protein transport peptides derived from 03-31-2011
20120196805COMPOSITIONS AND METHODS TO CONTROL ANGIOGENESIS WITH CUPREDOXINS - The present invention relates to compositions comprising cupredoxins, and their use to inhibit angiogenesis in mammalian cells, tissues, and animals, and particularly the angiogenesis that accompanies tumor development and particularly in humans. Specifically, the present invention relates to compositions comprising the cupredoxin(s), and or peptides that are variants, derivatives or structural equivalents of cupredoxins, which retain the ability to inhibit angiogenesis in mammalian cells, tissues or animals. These compositions may be peptides or pharmaceutical compositions, among others. The compositions of the invention may be used to treat any pathological condition that has as a symptom or cause, inappropriate angiogenesis, and particularly inappropriate angiogenesis related to tumor development.08-02-2012

Patent applications by Tapas K. Das Gupta, River Forest, IL US