Patents by Inventor Mark Manasse
Mark Manasse has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 11615261Abstract: The disclosed systems and methods include pre-calculation, per object, of object feature bin values, for identifying close matches between objects, such as text documents, that have numerous weighted features, such as specific-length word sequences. Predetermined feature weights get scaled with two or more selected adjacent scaling factors, and randomly rounded. The expanded set of weighted features of an object gets min-hashed into a predetermined number of feature bins. For each feature that qualifies to be inserted by min-hashing into a particular feature bin, and across successive feature bins, the expanded set of weighted features get min-hashed and circularly smeared into the predetermined number of feature bins. Completed pre-calculated sets of feature bin values for each scaling of the object, together with the scaling factor, are stored for use in comparing sampled features of the object with sampled features of other objects by calculating an estimated Jaccard similarity index.Type: GrantFiled: September 23, 2019Date of Patent: March 28, 2023Assignee: Salesforce, Inc.Inventor: Mark Manasse
-
Patent number: 11336627Abstract: According to an implementation of the disclosure, a computing device may record substantially all the network traffic being transported over a first node of a network over a period of time. The computing device may receive an authenticated request from a forensics system that includes access criteria. The first computing device may determine a relevant encrypted and unencrypted portion of the network traffic based on the access criteria. Based on unencrypted portion, the computing device may recalculate an encryption key applicable to the encrypted portion. The computing device may then replicate the relevant portion and the encryption key to the forensics system for forensic analysis.Type: GrantFiled: July 16, 2019Date of Patent: May 17, 2022Assignee: Salesforce, Inc.Inventors: Mark Manasse, Amit Limaye
-
Patent number: 10713592Abstract: The disclosed systems and methods include pre-calculation, per object, of object feature bin values, for identifying close matches between objects, such as text documents, that have numerous weighted features, such as specific-length word sequences. Predetermined feature weights get scaled with two or more selected adjacent scaling factors, and randomly rounded. The expanded set of weighted features of an object gets min-hashed into a predetermined number of feature bins. For each feature that qualifies to be inserted by min-hashing into a particular feature bin, and across successive feature bins, the expanded set of weighted features get min-hashed and circularly smeared into the predetermined number of feature bins. Completed pre-calculated sets of feature bin values for each scaling of the object, together with the scaling factor, are stored for use in comparing sampled features of the object with sampled features of other objects by calculating an estimated Jaccard similarity index.Type: GrantFiled: October 31, 2016Date of Patent: July 14, 2020Assignee: salesforce.com, inc.Inventor: Mark Manasse
-
Publication number: 20200053124Abstract: According to an implementation of the disclosure, a computing device may record substantially all the network traffic being transported over a first node of a network over a period of time. The computing device may receive an authenticated request from a forensics system that includes access criteria. The first computing device may determine a relevant encrypted and unencrypted portion of the network traffic based on the access criteria. Based on unencrypted portion, the computing device may recalculate an encryption key applicable to the encrypted portion. The computing device may then replicate the relevant portion and the encryption key to the forensics system for forensic analysis.Type: ApplicationFiled: July 16, 2019Publication date: February 13, 2020Inventors: Mark Manasse, Amit Limaye
-
Publication number: 20200019814Abstract: The disclosed systems and methods include pre-calculation, per object, of object feature bin values, for identifying close matches between objects, such as text documents, that have numerous weighted features, such as specific-length word sequences. Predetermined feature weights get scaled with two or more selected adjacent scaling factors, and randomly rounded. The expanded set of weighted features of an object gets min-hashed into a predetermined number of feature bins. For each feature that qualifies to be inserted by min-hashing into a particular feature bin, and across successive feature bins, the expanded set of weighted features get min-hashed and circularly smeared into the predetermined number of feature bins. Completed pre-calculated sets of feature bin values for each scaling of the object, together with the scaling factor, are stored for use in comparing sampled features of the object with sampled features of other objects by calculating an estimated Jaccard similarity index.Type: ApplicationFiled: September 23, 2019Publication date: January 16, 2020Inventor: Mark Manasse
-
Patent number: 10460203Abstract: The disclosed systems and methods include pre-calculation, per object, of object feature bin values, for identifying close matches between objects, such as text documents, that have numerous weighted features, such as specific-length word sequences. Predetermined feature weights get scaled with two or more selected adjacent scaling factors, and randomly rounded. The expanded set of weighted features of an object gets min-hashed into a predetermined number of feature bins. For each feature that qualifies to be inserted by min-hashing into a particular feature bin, and across successive feature bins, the expanded set of weighted features get min-hashed and circularly smeared into the predetermined number of feature bins. Completed pre-calculated sets of feature bin values for each scaling of the object, together with the scaling factor, are stored for use in comparing sampled features of the object with sampled features of other objects by calculating an estimated Jaccard similarity index.Type: GrantFiled: October 31, 2016Date of Patent: October 29, 2019Assignee: salesforce.com, inc.Inventor: Mark Manasse
-
Patent number: 10397274Abstract: According to an implementation of the disclosure, a computing device may record substantially all the network traffic being transported over a first node of a network over a period of time. The computing device may receive an authenticated request from a forensics system that includes access criteria. The first computing device may determine a relevant encrypted and unencrypted portion of the network traffic based on the access criteria. Based on unencrypted portion, the computing device may recalculate an encryption key applicable to the encrypted portion. The computing device may then replicate the relevant portion and the encryption key to the forensics system for forensic analysis.Type: GrantFiled: February 1, 2017Date of Patent: August 27, 2019Assignee: salesforce.com, inc.Inventors: Mark Manasse, Amit Limaye
-
Patent number: 10203889Abstract: The technology disclosed includes access to content and encryption key rotation in a multi-generational file system that has a first tier file, and automatically initializes a second tier file accessible using a same path and file name as the first tier file. The disclosed technology includes copying forward blocks of data from the first tier file to the second tier file, and prior to completion of the copying forward, responding to an access request by accessing the second tier file by providing data available from the second tier file that has been copied forward and by following links associated with the holes to access blocks in the first tier file to provide data from the first tier file. The first tier files are encrypted using a first encryption key; and applying a second encryption key to encrypt data in the second tier files during the copying forward and write access.Type: GrantFiled: May 31, 2016Date of Patent: February 12, 2019Assignee: salesforce.com, inc.Inventor: Mark Manasse
-
Publication number: 20180219913Abstract: According to an implementation of the disclosure, a computing device may record substantially all the network traffic being transported over a first node of a network over a period of time. The computing device may receive an authenticated request from a forensics system that includes access criteria. The first computing device may determine a relevant encrypted and unencrypted portion of the network traffic based on the access criteria. Based on unencrypted portion, the computing device may recalculate an encryption key applicable to the encrypted portion. The computing device may then replicate the relevant portion and the encryption key to the forensics system for forensic analysis.Type: ApplicationFiled: February 1, 2017Publication date: August 2, 2018Inventors: Mark Manasse, Amit Limaye
-
Patent number: 10019383Abstract: Disclosed technology includes access to rotatable-key-encrypted content in a multi-tier disk partition system, with a first-tier-track, and initializing a second-tier-track accessible using the same block designator. A stack of bit vectors, stored in SSD memory, represents tier-tracks and a bit flag indicates whether a respective tier-track holds currently-active data or another bit vector needs to be consulted for access to a predecessor of the tier-track. Copying forward of data from the first-tier-track to the second-tier-track, as-scheduled or in response to an authorized write access to the second-tier-track includes, prior to completion, responding to an access request by providing data from the second-tier-track that has been copied forward and following mappings associated with the flag sets to provide data from the first-tier-track.Type: GrantFiled: November 30, 2016Date of Patent: July 10, 2018Assignee: salesforce.com, inc.Inventor: Mark Manasse
-
Publication number: 20180150412Abstract: Disclosed technology includes access to rotatable-key-encrypted content in a multi-tier disk partition system, with a first-tier-track, and initializing a second-tier-track accessible using the same block designator. A stack of bit vectors, stored in SSD memory, represents tier-tracks and a bit flag indicates whether a respective tier-track holds currently-active data or another bit vector needs to be consulted for access to a predecessor of the tier-track. Copying forward of data from the first-tier-track to the second-tier-track, as-scheduled or in response to an authorized write access to the second-tier-track includes, prior to completion, responding to an access request by providing data from the second-tier-track that has been copied forward and following mappings associated with the flag sets to provide data from the first-tier-track.Type: ApplicationFiled: November 30, 2016Publication date: May 31, 2018Applicant: salesforce.com, inc.Inventor: Mark MANASSE
-
Publication number: 20180121820Abstract: The disclosed systems and methods include pre-calculation, per object, of object feature bin values, for identifying close matches between objects, such as text documents, that have numerous weighted features, such as specific-length word sequences. Predetermined feature weights get scaled with two or more selected adjacent scaling factors, and randomly rounded. The expanded set of weighted features of an object gets min-hashed into a predetermined number of feature bins. For each feature that qualifies to be inserted by min-hashing into a particular feature bin, and across successive feature bins, the expanded set of weighted features get min-hashed and circularly smeared into the predetermined number of feature bins. Completed pre-calculated sets of feature bin values for each scaling of the object, together with the scaling factor, are stored for use in comparing sampled features of the object with sampled features of other objects by calculating an estimated Jaccard similarity index.Type: ApplicationFiled: October 31, 2016Publication date: May 3, 2018Applicant: salesforce.com, inc.Inventor: Mark MANASSE
-
Publication number: 20180121819Abstract: The disclosed systems and methods include pre-calculation, per object, of object feature bin values, for identifying close matches between objects, such as text documents, that have numerous weighted features, such as specific-length word sequences. Predetermined feature weights get scaled with two or more selected adjacent scaling factors, and randomly rounded. The expanded set of weighted features of an object gets min-hashed into a predetermined number of feature bins. For each feature that qualifies to be inserted by min-hashing into a particular feature bin, and across successive feature bins, the expanded set of weighted features get min-hashed and circularly smeared into the predetermined number of feature bins. Completed pre-calculated sets of feature bin values for each scaling of the object, together with the scaling factor, are stored for use in comparing sampled features of the object with sampled features of other objects by calculating an estimated Jaccard similarity index.Type: ApplicationFiled: October 31, 2016Publication date: May 3, 2018Applicant: salesforce.com, inc.Inventor: Mark MANASSE
-
Patent number: 9928136Abstract: A codeword is generated from a message. One or more anchor values are appended to the codeword at predetermined anchor positions. Before the codeword is stored in a memory block, the locations and values of stuck cells in the memory block are determined. Based on the values and positions of the stuck cells, the values of the codeword are remapped so that values of the codeword that are the same as the values of the stuck cells are placed at the positions of the stuck cells. The remapped codeword is stored in the memory block. When the message is later read, the original codeword can be recovered from the remapped codeword based on the locations of the anchor values in the remapped codeword.Type: GrantFiled: February 1, 2016Date of Patent: March 27, 2018Assignee: Microsoft Technology Licensing, LLCInventors: John D. Davis, Parikshit Gopalan, Mark Manasse, Karin Strauss, Sergey Yekhanin
-
Publication number: 20170285978Abstract: The technology disclosed includes access to content and encryption key rotation in a multi-generational file system that has a first tier file, and automatically initializes a second tier file accessible using a same path and file name as the first tier file. The disclosed technology includes copying forward blocks of data from the first tier file to the second tier file, and prior to completion of the copying forward, responding to an access request by accessing the second tier file by providing data available from the second tier file that has been copied forward and by following links associated with the holes to access blocks in the first tier file to provide data from the first tier file. The first tier files are encrypted using a first encryption key; and applying a second encryption key to encrypt data in the second tier files during the copying forward and write access.Type: ApplicationFiled: May 31, 2016Publication date: October 5, 2017Applicant: salesforce.com, inc.Inventor: Mark MANASSE
-
Publication number: 20160170830Abstract: A codeword is generated from a message. One or more anchor values are appended to the codeword at predetermined anchor positions. Before the codeword is stored in a memory block, the locations and values of stuck cells in the memory block are determined. Based on the values and positions of the stuck cells, the values of the codeword are remapped so that values of the codeword that are the same as the values of the stuck cells are placed at the positions of the stuck cells. The remapped codeword is stored in the memory block. When the message is later read, the original codeword can be recovered from the remapped codeword based on the locations of the anchor values in the remapped codeword.Type: ApplicationFiled: February 1, 2016Publication date: June 16, 2016Inventors: John D. Davis, Parikshit Gopalan, Mark Manasse, Karin Strauss, Sergey Yekhanin
-
Patent number: 9280417Abstract: A codeword is generated from a message. One or more anchor values are appended to the codeword at predetermined anchor positions. Before the codeword is stored in a memory block, the locations and values of stuck cells in the memory block are determined. Based on the values and positions of the stuck cells, the values of the codeword are remapped so that values of the codeword that are the same as the values of the stuck cells are placed at the positions of the stuck cells. The remapped codeword is stored in the memory block. When the message is later read, the original codeword can be recovered from the remapped codeword based on the locations of the anchor values in the remapped codeword.Type: GrantFiled: May 21, 2013Date of Patent: March 8, 2016Assignee: Microsoft Technology Licensing, LLCInventors: John D. Davis, Parikshit Gopalan, Mark Manasse, Karin Strauss, Sergey Yekhanin
-
Publication number: 20140351501Abstract: A codeword is generated from a message. One or more anchor values are appended to the codeword at predetermined anchor positions. Before the codeword is stored in a memory block, the locations and values of stuck cells in the memory block are determined. Based on the values and positions of the stuck cells, the values of the codeword are remapped so that values of the codeword that are the same as the values of the stuck cells are placed at the positions of the stuck cells. The remapped codeword is stored in the memory block. When the message is later read, the original codeword can be recovered from the remapped codeword based on the locations of the anchor values in the remapped codeword.Type: ApplicationFiled: May 21, 2013Publication date: November 27, 2014Applicant: Microsoft CorporationInventors: John D. Davis, Parikshit Gopalan, Mark Manasse, Karin Strauss, Sergey Yekhanin
-
Publication number: 20070234005Abstract: Hash tables comprising load factors of up to and above 97% are disclosed. The hash tables may be associated with three or more hash functions, each hash function being applied to a key to identify a location in a hash table. The load factor of a hash table may be increased, obviating any need to increase the size of the hash table to accommodate more insertions. Such increase in load factor may be accomplished by a combination of increasing the number of cells per bucket in a hash table and increasing the number of hash functions associated with the hash table.Type: ApplicationFiled: March 29, 2006Publication date: October 4, 2007Applicant: Microsoft CorporationInventors: Ulfar Erlingsson, Mark Manasse, Frank McSherry, Abraham Flaxman
-
Publication number: 20070091500Abstract: An implementation of a disk drive with improved efficiency where a read head supported by a first positioning component is provided and a write head supported by a second positioning component is also provided. By positioning the write head behind the read head at a predetermined angle, the disk drive can execute a “read-before-write” or “read-modify-by-XOR-write ” operation by before the platter has rotated a full revolution.Type: ApplicationFiled: October 21, 2005Publication date: April 26, 2007Applicant: Microsoft CorporationInventor: Mark Manasse