Patent application number | Description | Published |
20090069890 | STREAMLINED DELIVERY SYSTEM FOR IN SITU DEPLOYMENT OF CARDIAC VALVE PROSTHESES - A system for implanting a heart valve prosthesis in a patient's heart includes a balloon expandable, tissue, stented heart valve and a transfemoral valve delivery device for delivering the stented heart valve to a target site in the patient's heart. The delivery device includes an inflation balloon module for expanding the stented heart valve prosthesis, markers on to assist in location of the delivery device at an appropriate location; and a streamlined cap. | 03-12-2009 |
20090099653 | EXPANDABLE VALVE PROSTHESIS WITH SEALING MECHANISM - A prosthetic heart valve includes at least one sealing member. The sealing member is adapted to conform to any surface irregularities found on the inner surface of the valve annulus, including any calcium deposits formed on the valve leaflets. The sealing member can be self-expanding or non-expanding. When deployed, the sealing member is adapted to create a blood tight seal between the prosthetic heart valve and the inner surface of the valve annulus thereby minimizing and/or eliminating perivalvular leakage at the implantation site. | 04-16-2009 |
20090105794 | MICROPROCESSOR CONTROLLED DELIVERY SYSTEM FOR CARDIAC VALVE PROSTHESIS - An instrument for deploying a cardiac valve prosthesis, including a plurality of radially expandable portions, at an implantation site, includes a plurality of deployment elements each independently operable to obtain the radial expansion of a radially expandable portion of the valve prosthesis. The instrument includes a microprocessor configured to processes signals from one or more sensors and to optimize deployment of the valve prosthesis. | 04-23-2009 |
20090287296 | ATRAUMATIC PROSTHETIC HEART VALVE PROSTHESIS - An atraumatic heart valve prosthesis includes a prosthetic valve coupled to an expandable anchoring structure including a outflow portion configured to taper inwardly in a distal direction towards a central axis of the prosthesis. By this configuration, the distal end of the anchoring structure imparts less force upon the vessel wall (e.g., the aortic tunica intima) during continued expansion and contraction of the heart. The expandable anchoring structure can be balloon expandable or self-expanding. | 11-19-2009 |
20100076376 | SURGICAL TOOL FOR VASCULAR EXPOSURE AND ACCESS - A tool for facilitating access to the inside of a vessel and/or surgery on a vessel or an organ connected to the vessel. The vessel has a proximal end and a distal end, while the tool has a substantially cylindrical band and an arm. The band has a deployed configuration capable of opening the proximal portion of the vessel. The arm is connected to the band and has a deployed configuration capable of at least partially flattening the distal end of the vessel to improve the view inside the vessel. When deployed in a vessel, the tool holds the vessel in an open configuration and provides the physician with a surgical operating field, and the ability to pass a prosthesis through said tool and in a desired location within an organ. | 03-25-2010 |
20120303048 | TRANSAPICAL VALVE REPLACEMENT - Techniques for reaching the interior of the heart, such as for aortic valve replacement, can combine elements of percutaneous implantation methods and elements of surgical implantation methods. In some instances, aortic valve replacement may include a dual transapical approach in which a transfemoral approach is used to reach the apex of the patient's heart from inside the left ventricle while a minimally invasive surgical procedure provides access to the exterior of the apex via an intercostal approach. | 11-29-2012 |
Patent application number | Description | Published |
20100064141 | EFFICIENT ALGORITHM FOR FINDING CANDIDATE OBJECTS FOR REMOTE DIFFERENTIAL COMPRESSION - The present invention finds candidate objects for remote differential compression. Objects are updated between two or more computing devices using remote differential compression (RDC) techniques such that required data transfers are minimized. An algorithm provides enhanced efficiencies for allowing the receiver to locate a set of objects that are similar to the object that needs to be transferred from the sender. Once this set of similar objects has been found, the receiver may reuse any chunks from these objects during the RDC algorithm. | 03-11-2010 |
20120213313 | ESTIMATING DOCUMENT SIMILARITY USING BIT-STRINGS - Each of a plurality of documents is divided into samples. Small bit-strings are generated for selected samples from each of the documents and used to create a sketch for each document. Because the bit-strings are small (e.g., only one, two, or three bits in length), the generated sketches are smaller than the sketches generated using previous methods for generating sketches, and therefore use less storage space. The generated sketches are compared to determine documents that are near-duplicates of one another. | 08-23-2012 |
20120259897 | DETERMINATION OF LANDMARKS - Hash values corresponding to a file are processed in windows to determine a minimum hash value for each window. Each window may begin at a minimum hash value determined for a previous window and end after a fixed number of hash values. If a hash value is less than a threshold hash value, it is added to a buffer that is used to store the hash values in sorted order for a current window. If a hash value is greater than the threshold, it is added to another buffer whose hash values are not stored in sorted order. At the end of the current window, the minimum hash value in the first buffer is selected as the landmark for the window. If the first buffer is empty, then the hash values in the other buffer are sorted and the minimum hash value is selected as the landmark for the window. | 10-11-2012 |
20140101366 | WRITING MEMORY BLOCKS USING CODEWORDS - A generator matrix is provided to generate codewords from messages of write operations. Rather than generate a codeword using the entire generator matrix, some number of bits of the codeword are determined to be, or designated as, stuck bits. One or more submatrices of the generator matrix are determined based on the columns of the generator matrix that correspond to the stuck bits. The submatrices are used to generate the codeword from the message, and only the bits of the codeword that are not the stuck bits are written to a memory block. By designating one or more bits as stuck bits, the operating life of the bits is increased. Some of the submatrices of the generator matrix may be pre-computed for different stuck bit combinations. The pre-computed submatrices may be used to generate the codewords, thereby increasing the performance of write operations. | 04-10-2014 |
20150310102 | GENERATING UNWEIGHTED SAMPLES FROM WEIGHTED FEATURES - Weighted features associated with a document are scaled using scales to generate a set of unweighted elements for each scale. A sketch is generated for each scale by sampling the unweighted elements generated for the scale. The scales are chosen based on a selected cutoff factor so that documents that have a similarity that is less than the cutoff factor might have no scales in common, while documents that have a similarity that is greater than the cutoff factor will have at sufficiently many but at least one scale in common. The similarity of these documents can be estimated using the sketches associated with each of the documents for the common scales. | 10-29-2015 |
Patent application number | Description | Published |
20080235201 | Consistent weighted sampling of multisets and distributions - Techniques are provided that identify near-duplicate items in large collections of items. A list of (value, frequency) pairs is received, and a sample (value, instance) is returned. The value is chosen from the values of the first list, and the instance is a value less than frequency, in such a way that the probability of selecting the same sample from two lists is equal to the similarity of the two lists. | 09-25-2008 |
20090132571 | EFFICIENT USE OF RANDOMNESS IN MIN-HASHING - Documents that are near-duplicates may be determined using techniques such as min-hashing. Randomness that is used in these techniques may be based on sequences of bits. The sequences of bits may be generated from a string of bits, with the sequences determined by parsing the string at each occurrence of a particular value, such as the value “1”. | 05-21-2009 |
20100070511 | REDUCING USE OF RANDOMNESS IN CONSISTENT UNIFORM HASHING - Documents that are near-duplicates may be determined using techniques involving consistent uniform hashing. A biased bit may be placed in the leading position of a sequence of bits that may be generated and subsequently used in comparison techniques to determine near-duplicate documents. Unbiased bits may be used in subsequent positions of the sequence of bits, after the biased bit, for use in comparison techniques. Samples may be used collectively, as opposed to individually, in the generation of biased bits. Sequences of bits may thus be produced not on a single sample basis, but for multiple samples, thereby amortizing the cost of generating randomness for the samples. Less than one bit of randomness per sample may be used. | 03-18-2010 |
20150033064 | SELF-IDENTIFYING MEMORY ERRORS - A memory region can durably self-identify as being faulty when read. Information that would have been assigned to the faulty memory region can be assigned to another of that sized region in memory using a replacement encoding technique. For phase change memory, at least two fault states can be provided for durably self-identifying a faulty memory region; one state at a highest resistance range and the other state at a lowest resistance range. Replacement cells can be used to shift or assign data when a self-identifying memory fault is present. A memory controller and memory module, alone or in combination may manage replacement cell use and facilitate driving a newly discovered faulty cell to a fault state if the faulty cell is not already at the fault state. | 01-29-2015 |
20150378821 | EXTENDED LIFETIME MEMORY - A memory controller can include an error correction module for extended lifetime memory that tracks at least one sized block of non-fault consecutive bits within the disabled page as spare blocks and reuses the spare blocks from the disabled pages as an error correction resource for active blocks. The active blocks can store data, data and metadata, or metadata only (e.g., error correction metadata). A method for extended lifetime memory can include, for an active block of metadata containing at least one fault, using at least one spare block to correct the data of the active block. For an active block of data containing at least one fault, the data can be initially corrected via XOR correction with a first spare block and then ultimately corrected via XOR correction with a second spare block. | 12-31-2015 |