Patent application number | Description | Published |
20110119117 | GENERATION OF PRODUCTS IN CATALOGS FROM DIVERGENT LISTINGS - Methods and systems to generate product records in catalogs from divergent listings are provided. Example systems include a listings module to identify an immature product record corresponding to the item for sale. The listings module may determine, from one or more attributes of an item for sale described by the listing, that the item can be matched to an immature product record. A voting module may provide an interface including the first version of the immature product record and an option to select a first version or a second version of the immature product record matching the item. The voting module may further relate the selected version to the item for sale based on a selection by a user, and, in response, update a count of votes for the selected version. When the count of votes meets a threshold, the selected version may become the mature product record for inclusion in a catalog. | 05-19-2011 |
20110295658 | COLLECTING MEDIA DATA DESCRIPTIVE OF A PRODUCT - A crowd-sourcing system performs a method that includes generating a request that a user provide candidate media data to the crowd-sourcing system. The candidate media is descriptive of a product, and the request includes information about the product. The crowd-sourcing system transmits the request to a user system and receives the candidate media data from the user system. The crowd-sourcing system selects the candidate media data as stock media data for the product. The selection of the candidate media data may be based on a selection criterion, such as a grade of the candidate media data determined by the crowd-sourcing system. The crowd-sourcing system provides a reward to the user based on the selecting of the candidate media data as the stock media data for the product. | 12-01-2011 |
20130226681 | COLLECTING MEDIA DATA DESCRIPTIVE OF A PRODUCT - A crowd-sourcing system performs a method that includes generating a request that a user provide candidate media data to the crowd-sourcing system. The candidate media is descriptive of a product, and the request includes information about the product. The crowd-sourcing system transmits the request to a user system and receives the candidate media data from the user system. The crowd-sourcing system selects the candidate media data as stock media data for the product. The selection of the candidate media data may be based on a selection criterion, such as a grade of the candidate media data determined by the crowd-sourcing system. The crowd-sourcing system provides a reward to the user based on the selecting of the candidate media data as the stock media data for the product. | 08-29-2013 |
Patent application number | Description | Published |
20080255033 | Metallopeptide gamma-Melanocyte Stimulating Hormone Compounds - Metallopeptides with a sequence of a biologically active gamma-melanocyte stimulating hormone sequence of length n residues, wherein a residue including a nitrogen atom and sulfur atom each available for complexation to a metal ion is inserted at any position from between the two and three position to the C-terminus side of the n position, or alternatively is substituted for the residue at any position from the three position to the n position, with a metal ion complexed thereto, with any proline (Pro) residue which is either of the two residues on the immediately adjacent N-terminus side of the inserted or substituent residue comprising a nitrogen atom and sulfur atom available for complexation to a metal ion is substituted with a homolog. | 10-16-2008 |
20090069224 | Linear and Cyclic Melanocortin Receptor-Specific Peptidomimetics - Linear and cyclic peptidomimetics which bind to one or more melanocortin receptors are provided, which peptidomimetics include at least one ring-constrained amino acid surrogate of formula I: | 03-12-2009 |
20100035821 | Amide Linkage Cyclic Natriuretic Peptide Constructs - Cyclic constructs which bind to a natriuretic peptide receptor and include a plurality of amino acid residues, at least one amino acid surrogate of formula I: | 02-11-2010 |
20100075895 | Cyclic Natriuretic Peptide Constructs - Cyclic constructs with an N-terminus and a C-terminus which bind to a natriuretic peptide receptor and include a plurality of amino acid residues, at least one amino acid surrogate of formula I: | 03-25-2010 |
20110263818 | Peptidic Constructs with Amino Acid Surrogates - Peptidic constructs including at least one ring-constrained amino acid surrogate of formula I: | 10-27-2011 |
20130045928 | Uses of Natriuretic Peptide Constructs - Use of constructs which bind to one or more natriuretic peptide receptors and include a plurality of amino acid residues and at least one amino acid surrogate of formula I: | 02-21-2013 |
20130274207 | Uses of Natriuretic Peptide Constructs - Use of constructs which bind to one or more natriuretic peptide receptors and include a plurality of amino acid residues and at least one amino acid surrogate of formula I: | 10-17-2013 |
20140134163 | COMBINATION THERAPY WITH MDM2 AND EFGR INHIBITORS - Provided is a method of treating a proliferative disease, condition, or disorder in a subject by administering a combination of an inhibitor of p53 and MDM2 binding and an EGFR inhibitor. Various embodiments of the disclosed methods provide a synergistic anti-proliferative or anti-apoptotic effect compared to administration of one agent alone. | 05-15-2014 |
20150105412 | COMBINATION THERAPY WITH MDM2 AND EFGR INHIBITORS - Provided is a method of treating a proliferative disease, condition, or disorder in a subject by administering a combination of an inhibitor of p53 and MDM2 binding and an EGFR inhibitor. Various embodiments of the disclosed methods provide a synergistic anti-proliferative or anti-apoptotic effect compared to administration of one agent alone. | 04-16-2015 |
Patent application number | Description | Published |
20130249897 | ALTERNATE REDUCTION RATIOS AND THRESHOLD MECHANISMS FOR FRAMEBUFFER COMPRESSION - A method for compressing framebuffer data is presented. The method includes determining a reduction ratio for framebuffer data in a tile including multiple samples. The reduction ratio determined is independent of the sampling mode, where the sampling mode is the number of samples within each pixel in the tile. The method further includes comparing a first portion of the framebuffer data for each of the multiple samples to determine an equality comparison result and also comparing a second portion of the framebuffer data for each one of the multiple samples to compute per-channel differences for each one of the multiple samples and testing the per-channel differences against a threshold value to determine a threshold comparison result. Finally, the method comprises compressing the framebuffer data for the tile based on the reduction ratio, the equality comparison result and the threshold comparison result to produce output framebuffer data for the tile. | 09-26-2013 |
20140176568 | PROGRAMMABLE BLENDING IN MULTI-THREADED PROCESSING UNITS - A technique for efficiently rendering content reduces each complex blend mode to a series of basic blend operations. The series of basic blend operations are executed within a recirculating pipeline until a final blended value is computed. The recirculating pipeline is positioned within a color raster operations unit of a graphics processing unit for efficient access to image buffer data. | 06-26-2014 |
20140176579 | EFFICIENT SUPER-SAMPLING WITH PER-PIXEL SHADER THREADS - Techniques are disclosed for dispatching pixel information in a graphics processing pipeline. A fragment processing unit generates a pixel that includes multiple samples based on a first portion of a graphics primitive received by a first thread. The fragment processing unit calculates a first value for the first pixel, where the first value is calculated only once for the pixel. The fragment processing unit calculates a first set of values for the samples, where each value in the first set of values corresponds to a different sample and is calculated only once for the corresponding sample. The fragment processing unit combines the first value with each value in the first set of values to create a second set of values. The fragment processing unit creates one or more dispatch messages to store the second set of values in a set of output registers. One advantage of the disclosed techniques is that pixel shader programs perform per-sample operations with increased efficiency. | 06-26-2014 |
20140184601 | SYSTEM AND METHOD FOR FRAME BUFFER DECOMPRESSION AND/OR COMPRESSION - A system and method for decompressing compressed data (e.g., in a frame buffer) and optionally recompressing the data. The method includes determining a portion of an image to be accessed from a memory and sending a conditional read corresponding to the portion of the image. In response to the conditional read, an indicator operable to indicate that the portion of the image is uncompressed may be received. If the portion of the image is compressed, in response to the conditional read, compressed data corresponding to the portion of the image is received. In response to receiving the compressed data, the compressed data is uncompressed into uncompressed data. The uncompressed data may then be written to the memory corresponding to the portion of the image. The uncompressed data may then be in-place compressed for or during subsequent processing. | 07-03-2014 |
20140237187 | ADAPTIVE MULTILEVEL BINNING TO IMPROVE HIERARCHICAL CACHING - A device driver calculates a tile size for a plurality of cache memories in a cache hierarchy. The device driver calculates a storage capacity of a first cache memory. The device driver calculates a first tile size based on the storage capacity of the first cache memory and one or more additional characteristics. The device driver calculates a storage capacity of a second cache memory. The device driver calculates a second tile size based on the storage capacity of the second cache memory and one or more additional characteristics, where the second tile size is different than the first tile size. The device driver transmits the second tile size to a second coalescing binning unit. One advantage of the disclosed techniques is that data locality and cache memory hit rates are improved where tile size is optimized for each cache level in the cache hierarchy. | 08-21-2014 |
20140267224 | HANDLING POST-Z COVERAGE DATA IN RASTER OPERATIONS - Techniques are disclosed for storing post-z coverage data in a render target. A color raster operations (CROP) unit receives a coverage mask associated with a portion of a graphics primitive, where the graphics primitive intersects a pixel that includes a multiple samples, and the portion covers at least one sample. The CROP unit stores the coverage mask in a data field in the render target at a location associated with the pixel. One advantage of the disclosed techniques is that the GPU computes color and other pixel information only for visible fragments as determined by post-z coverage data. The GPU does not compute color and other pixel information for obscured fragments, thereby reducing overall power consumption and improving overall render performance. | 09-18-2014 |
Patent application number | Description | Published |
20140267318 | PIXEL SHADER BYPASS FOR LOW POWER GRAPHICS RENDERING - A computer-implemented method for drawing graphical objects within a graphics processing pipeline is disclosed. The method includes determining that a bypass mode for a first primitive is a no-bypass mode. The method further includes rasterizing the first primitive to generate a first set of rasterization results. The method further includes generating a first set of colors for the first set of rasterization results via a pixel shader unit. The method further includes rasterizing a second primitive to generate a second set of rasterization results. The method further includes generating a second set of colors for the second set of rasterization results without the pixel shader unit performing any processing operations on the second set of rasterization results. The method further includes transmitting the first set of pixel colors and the second set of pixel colors to a raster operations (ROP) unit for further processing. | 09-18-2014 |
20140267366 | TARGET INDEPENDENT RASTERIZATION WITH MULTIPLE COLOR SAMPLES - A graphics processing pipeline within a parallel processing unit (PPU) is configured to perform path rendering by generating a collection of graphics primitives that represent each path to be rendered. The graphics processing pipeline determines the coverage of each primitive at a number of stencil sample locations within each different pixel. Then, the graphics processing pipeline reduces the number of stencil samples down to a smaller number of color samples, for each pixel. The graphics processing pipeline is configured to modulate a given color sample associated with a given pixel based on the color values of any graphics primitives that cover the stencil samples from which the color sample was reduced. The final color of the pixel is determined by downsampling the color samples associated with the pixel. | 09-18-2014 |
20150049110 | RENDERING USING MULTIPLE RENDER TARGET SAMPLE MASKS - One embodiment sets forth a method for transforming 3-D images into 2-D rendered images using render target sample masks. A software application creates multiple render targets associated with a surface. For each render target, the software application also creates an associated render target sample mask configured to select one or more samples included in each pixel. Within the graphics pipeline, a pixel shader processes each pixel individually and outputs multiple render target-specific color values. For each render target, a ROP unit uses the associated render target sample mask to select covered samples included in the pixel. Subsequently, the ROP unit uses the render target-specific color value to update the selected samples in the render target, thereby achieving sample-level color granularity. Advantageously, by increasing the effective resolution using render target sample masks, the quality of the rendered image is improved without incurring the performance degradation associated with processing each sample individually. | 02-19-2015 |
20150097847 | MANAGING MEMORY REGIONS TO SUPPORT SPARSE MAPPINGS - One embodiment of the present invention includes a memory management unit (MMU) that is configured to manage sparse mappings. The MMU processes requests to translate virtual addresses to physical addresses based on page table entries (PTEs) that indicate a sparse status. If the MMU determines that the PTE does not include a mapping from a virtual address to a physical address, then the MMU responds to the request based on the sparse status. If the sparse status is active, then the MMU determines the physical address based on whether the type of the request is a write operation and, subsequently, generates an acknowledgement of the request. By contrast, if the sparse status is not active, then the MMU generates a page fault. Advantageously, the disclosed embodiments enable the computer system to manage sparse mappings without incurring the performance degradation associated with both page faults and conventional software-based sparse mapping management. | 04-09-2015 |
Patent application number | Description | Published |
20140218390 | MODULATED AND BLENDED ANTI-ALIASING - A system, method, and computer program product are provided for anti-aliasing. During a first processing pass of a plurality of graphics primitives, z data is computed for multiple samples of each pixel in an image to generate a multi-sample z buffer. During a second processing pass of the graphics primitives, computed color values corresponding to each pixel in a color buffer that stores one color value for each pixel are accumulated. | 08-07-2014 |
20140267315 | MULTI-SAMPLE SURFACE PROCESSING USING ONE SAMPLE - A system, method, and computer program product are provided for multi-sample processing. The multi-sample pixel data is received and an encoding state associated with the multi-sample pixel data is determined. Data for one sample of a multi-sample pixel and the encoding state are provided to a processing unit. The one sample of the multi-sample pixel is processed by the processing unit to generate processed data for the one sample that represents processed multi-sample pixel data for all samples of the multi-sample pixel or two or more samples of the multi-sample pixel. | 09-18-2014 |
20140267355 | SYSTEM, METHOD, AND COMPUTER PROGRAM PRODUCT FOR PROCESSING GRAPHICS DATA ASSOCIATED WITH SHADING - A system, method, and computer program product are provided for processing graphics data associated with shading. In operation, a first fragment is received. Further, the first fragment is shaded. While the first fragment is being shaded, a second fragment is received and it is determined whether at least one aspect of the second fragment conflicts with the first fragment. If it is determined that the at least one aspect of the second fragment does not conflict with the first fragment, the second fragment is shaded. If it is determined that the at least one aspect of the second fragment conflicts with the first fragment, information associated with the second fragment is stored, a third fragment is received, and the third fragment is shaded, if it is determined that at least one aspect of the third fragment does not conflict with the first fragment. | 09-18-2014 |
20140267356 | MULTI-SAMPLE SURFACE PROCESSING USING SAMPLE SUBSETS - A system, method, and computer program product are provided for multi-sample processing. The multi-sample pixel data is received and is analyzed to identify subsets of samples of a multi-sample pixel that have equal data, such that data for one sample in a subset represents multi-sample pixel data for all samples in the subset. An encoding state is generated that indicates which samples of the multi-sample pixel are included in each one of the subsets. | 09-18-2014 |
20150070380 | SYSTEM, METHOD, AND COMPUTER PROGRAM PRODUCT FOR USING COMPRESSION WITH PROGRAMMABLE SAMPLE LOCATIONS - A system, method, and computer program product are provided for using compression with programmable sample locations, where the compression is a function of the programmable sample locations. The method includes the steps of storing a first value specifying a programmed sample location within a pixel in a sample pattern table and storing, in a memory, geometric surface parameters corresponding to a first attribute at the programmed sample location within a first pixel of a display surface. An instruction to store a second value specifying the programmed sample location within the pixel in the sample pattern table is received. The attribute is reconstructed based on the geometric surface parameters and the first value. | 03-12-2015 |
20150070381 | SYSTEM, METHOD, AND COMPUTER PROGRAM PRODUCT FOR USING COMPRESSION WITH PROGRAMMABLE SAMPLE LOCATIONS - A system, method, and computer program product are provided for using compression with programmable sample locations, where the compression is a function of the programmable sample locations. The method includes the steps of storing a first value specifying a programmed sample location within a pixel in a first sample pattern table that is associated with a first display surface and storing, in a memory, geometric surface parameters corresponding to a first attribute at the programmed sample location within a first pixel of the first display surface. A second value specifying the programmed sample location within the pixel in a second sample pattern table that is associated with a second display surface is also stored and the first attribute is reconstructed based on the geometric surface parameters and the first value. | 03-12-2015 |
20150138228 | SYSTEM, METHOD, AND COMPUTER PROGRAM PRODUCT FOR IMPLEMENTING ANTI-ALIASING OPERATIONS USING A PROGRAMMABLE SAMPLE PATTERN TABLE - A system, method, and computer program product are provided for implementing anti-aliasing operations using a programmable sample pattern table. The method includes the steps of receiving an instruction that causes one or more values to be stored in one or more corresponding entries of the programmable sample pattern table and performing an anti-aliasing operation based on at least one value stored in the programmable sample pattern table. At least one value is selected from the programmable sample pattern table based on, at least in part, a location of one or more corresponding pixels. | 05-21-2015 |