Patents by Inventor Michael Hirsch
Michael Hirsch 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).
-
Publication number: 20190146801Abstract: A system for compressing an input data stream to create a compressed output data stream, comprising a memory for storing a hash table comprising hash entries each comprising a hash value of an associated subset of following data items of an input data stream and a pointer to a memory location of the associated subset. A processor coupled to the memory executes the following operations while instructing a SIMD engine to execute concurrently one or more of the operations for consecutive subsets: calculate the hash value for each subset, search the hash table for a match of each calculated hash value and update the hash table according to the match result. The processor then updates the compressed output data stream according to the match result and a comparison result depending on the match result and operations for the plurality of associated subsets to create the compressed output data stream.Type: ApplicationFiled: January 11, 2019Publication date: May 16, 2019Inventors: Michael HIRSCH, Yehonatan DAVID, Yair TOAFF
-
Patent number: 10282257Abstract: A computer program product for searching a repository of binary uninterpretted data, according to one embodiment, includes a computer readable storage medium having program instructions executable by a computer to cause the computer to perform a method comprising: analyzing, by the computer, segments of each of the repository and input data to determine a repository segment that is similar to an input segment, the analyzing including searching an index of representation values of the repository data for matching representation values of the input in a time independent of a size of the repository and linear in a size of the input data; and analyzing, by the computer, the similar repository segment with respect to the input segment to determine their common data sections while utilizing at least some of the matching representation values for data alignment, in a time linear in a size of the input segment.Type: GrantFiled: July 25, 2016Date of Patent: May 7, 2019Assignee: International Business Machines CorporationInventors: Lior Aronovich, Ron Asher, Eitan Bachmat, Haim Bitner, Michael Hirsch, Shmuel T. Klein
-
Patent number: 10227767Abstract: A flexible check valve for fluid-handling systems that prevents reverse flow but allows downstream flow of fluid comprises a dome that fits within a pipe and includes a concave surface. The flexible check valve further includes a flexible seat that fits within the pipe and includes a. convex surface. The flexible seat is deformable from a closed position, that prevents reverse flow, to an open position, that allows downstream flow, when an upstream pressure acts on the flexible seat and exceeds a downstream pressure and when, in the closed position, the concave surface of the dome is oriented downstream and the convex surface of the flexible seat is oriented upstream. A housing is connected to the dome and the flexible seat and is connectable to the pipe. A seal is formed between the concave surface and the convex surface when the flexible check valve is in the closed position.Type: GrantFiled: January 18, 2018Date of Patent: March 12, 2019Assignee: Tide Stop LLCInventor: Steven Michael Hirsch
-
Patent number: 10229131Abstract: For producing digest block segmentations based on reference segmentations in a data deduplication system using a processor device in a computing environment, digests are calculated for an input data chunk. Data matches and data mismatches are produced based on matching input digests with reference digests. Secondary digest block segmentations are obtained from similar reference intervals for each of the data mismatches and applied to the input data.Type: GrantFiled: July 15, 2013Date of Patent: March 12, 2019Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Shay H. Akirav, Lior Aronovich, Michael Hirsch, Yair Toaff
-
Publication number: 20180365284Abstract: A system for segmenting an input data stream, comprising a processor adapted to split an input data stream to a plurality of data sub-streams such that each of the plurality of data sub-streams has an overlapping portion with a consecutive data sub-stream of the plurality of data sub-streams, create concurrently a plurality of segmented data sub-streams by concurrently segmenting the plurality of data sub-streams each in one of a plurality of processing pipelines of the processor and join the plurality of segmented data sub-streams to create a segmented data stream by synchronizing a sequencing of each of the plurality of segmented data sub-streams according to one or more overlapping segments in the overlapping portion of each two consecutive data sub-streams of the plurality of data sub-streams.Type: ApplicationFiled: August 27, 2018Publication date: December 20, 2018Inventors: Michael HIRSCH, Yair TOAFF, Yehonatan DAVID
-
Publication number: 20180239010Abstract: A system for tracking position of objects in an industrial environment includes an interrogator, a transponder, and a processor. The interrogator transmits a signal and provides a first reference signal corresponding to the transmitted signal. The transponder provides a response signal. The interrogator receives the response signal and provides a second reference signal corresponding to the response signal. The processor determines a location of either the interrogator or the transponder, relative to the other, based on the two reference signals.Type: ApplicationFiled: April 23, 2018Publication date: August 23, 2018Applicant: Humatics CorporationInventors: David A. Mindell, Gregory L. Charvat, Michael Hirsch, James Campbell Kinsey, Matthew Ian Beane
-
Publication number: 20180230686Abstract: A flexible check valve for fluid-handling systems that prevents reverse flow but allows downstream flow of fluid comprises a dome that fits within a pipe and includes a concave surface. The flexible check valve further includes a flexible seat that fits within the pipe and includes a. convex surface. The flexible seat is deformable from a closed position, that prevents reverse flow, to an open position, that allows downstream flow, when an upstream pressure acts on the flexible seat and exceeds a downstream pressure and when, in the closed position, the concave surface of the dome is oriented downstream and the convex surface of the flexible seat is oriented upstream. A housing is connected to the dome and the flexible seat and is connectable to the pipe. A seal is formed between the concave surface and the convex surface when the flexible check valve is in the closed position.Type: ApplicationFiled: January 18, 2018Publication date: August 16, 2018Applicant: Tide Stop LLCInventor: Steven Michael Hirsch
-
Patent number: 10032254Abstract: A computer-implemented method for recovering a digital image (x) from a sequence of observed digital images (y1, . . . , yT), includes: obtaining an observed digital image (yt); estimating a point spread function (ft) based on the observed image (yt); estimating the recovered digital image (x), based on the estimated point spread function (ft) and the observed image (yt); and repeating the above steps. In order to correct optical aberrations of a lens, a point spread function of the lens may be used.Type: GrantFiled: September 28, 2011Date of Patent: July 24, 2018Assignee: Max-Planck-Gesellschaft zur Förderung der Wissenschaften e.V.Inventors: Stefan Harmeling, Michael Hirsch, Suvrit Sra, Bernhard Schölkopf, Christian J. Schuler
-
Publication number: 20180189001Abstract: Methods, computer systems, and computer program products for processing data a computing environment are provided. The computer environment for data deduplication storage receives a plurality of write operations for deduplication storage of the data. The data is buffered in a plurality of buffers with overflow temporarily stored to a memory hierarchy when the data received for deduplication storage is sequential or non sequential. The data is accumulated and updated in the plurality of buffers per a data structure, the data structure serving as a fragment map between the plurality of buffers and a plurality of user file locations. The data is restructured in the plurality of buffers to form a complete sequence of a required sequence size. The data is provided as at least one stream to a stream-based deduplication algorithm for processing and storage.Type: ApplicationFiled: February 14, 2018Publication date: July 5, 2018Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Shay H. AKIRAV, Ron EDELSTEIN, Michael HIRSCH, Ariel J. ISH-SHALOM, Liran LOYA, Itai TZUR
-
Publication number: 20180120313Abstract: The present invention relates to the use of receptor tyrosine kinase (RTK) oligomers as markers of RTK activation and signalling. Methods are described based upon determining the presence of RTK oligomers and/or determining the nanometre spatial separation between RTK molecules assembled as RTK oligomers at the cell surface. Such methods are directed to the monitoring of RTK activation in cells and the detection of mutations in RTKs. Methods are also described for determining prognosis for subjects having diseases characterised by aberrant RTK activation and for selecting subjects for treatment with RTK inhibitors.Type: ApplicationFiled: April 28, 2016Publication date: May 3, 2018Applicant: The Science and Technology Facilities CouncilInventors: Marisa Martin-Fernandez, Dave Clarke, Sarah Needham, Daniel Rolfe, Michael Hirsch
-
Publication number: 20180113643Abstract: Deduplicated data is packed into finite-sized containers. A similarity score is calculated between files that are similarly of the deduplicated data. The similarity score is used for grouping the similarly compared files of the deduplicated data into subsets for destaging each of the subsets from a deduplication system to one a finite-sized container. The similarity score is used for grouping the similarly compared files of the deduplicated data into subsets for destaging each of the subsets from a deduplication system to one of the finite-sized containers. An indication is received by a user of which of the similarly compared files are to be grouped into the subsets for destaging each of the subsets from a deduplication system to one of the finite-sized containers. Transitive closures are used for assisting with using the similarity score for grouping the similarly compared files of the deduplicated data into the sub sets.Type: ApplicationFiled: December 15, 2017Publication date: April 26, 2018Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Michael HIRSCH, Thorsten KRAUSE
-
Publication number: 20180095986Abstract: Input backup data is deduplicated with data of a synthetic backup previously constructed by a deduplication storage system. A synthetic backup is constructed by processing metadata instructions provided by a backup application. Deduplication digests are calculated based on the data of the synthetic backup and the deduplication digests are stored in a digests index. When new backup data is processed, deduplication digests of the new data are calculated and searched in the digests index. Matching digests of previously constructed synthetic backups are located in the digests index. Each of the located matching digest references stored data are included in the synthetic backup, and the stored data is similar to the input backup data. Data matches are found in the input backup data and data in the synthetic backup.Type: ApplicationFiled: November 17, 2017Publication date: April 5, 2018Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Lior ARONOVICH, Michael Hirsch, Yair Toaff
-
Patent number: 9933978Abstract: Methods, computer systems, and computer program products for processing data a computing environment are provided. The computer environment for data deduplication storage receives a plurality of write operations for deduplication storage of the data. The data is buffered in a plurality of buffers with overflow temporarily stored to a memory hierarchy when the data received for deduplication storage is sequential or non sequential. The data is accumulated and updated in the plurality of buffers per a data structure, the data structure serving as a fragment map between the plurality of buffers and a plurality of user file locations. The data is restructured in the plurality of buffers to form a complete sequence of a required sequence size. The data is provided as at least one stream to a stream-based deduplication algorithm for processing and storage.Type: GrantFiled: October 9, 2012Date of Patent: April 3, 2018Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Shay H. Akirav, Ron Edelstein, Michael Hirsch, Ariel J. Ish-Shalom, Liran Loya, Itai Tzur
-
Patent number: 9928248Abstract: For self-healing in a hash-based deduplication system using a processor device in a computing environment, deduplication digests of data and a corresponding list of the deduplication digests in a table of contents (TOC) are maintained for the self-healing of data that is lost or unreadable. The input data digests are compared to the TOC if directed to data that is lost or unreadable, and the input data digests are used to repair the one of lost and unreadable data.Type: GrantFiled: July 8, 2013Date of Patent: March 27, 2018Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Shay H. Akirav, Michael Hirsch
-
Publication number: 20180081898Abstract: Input backup data is deduplicated with data of a synthetic backup previously constructed by a deduplication storage system. A synthetic backup is constructed by processing metadata instructions provided by a backup application. Deduplication digests are calculated based on the data of the synthetic backup and the deduplication digests are stored in a digests index. When new backup data is processed, deduplication digests of the new data are calculated and searched in the digests index. Matching digests of previously constructed synthetic backups are located in the digests index. Each of the located matching digest references stored data are included in the synthetic backup, and the stored data is similar to the input backup data. Data matches are found in the input backup data and data in the synthetic backup.Type: ApplicationFiled: November 29, 2017Publication date: March 22, 2018Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Lior ARONOVICH, Michael HIRSCH, Yair TOAFF
-
Publication number: 20180060183Abstract: For adding cooperative file coloring protocols in a data deduplication system using a processor device in a computing environment, a preferred character is represented for file coloring in a file using a code selected from a multiplicity of codes that represent a variety of contexts. The original meaning of the preferred character is retained when representing the preferred character for the file coloring by the code selected from the multiplicity of codes. The file is deduplicated by the data deduplication system according to the file coloring that represents a source file of a backup application.Type: ApplicationFiled: October 24, 2017Publication date: March 1, 2018Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Christophe FAGIANO, Itzhack GOLDBERG, Michael HIRSCH, Frank KRICK, Neil SONDHI
-
Patent number: 9880771Abstract: Deduplicated data is packed into finite-sized containers. A similarity score is calculated between files that are similarly of the deduplicated data. The similarity score is used for grouping the similarly compared files of the deduplicated data into subsets for destaging each of the subsets from a deduplication system to one a finite-sized container.Type: GrantFiled: June 19, 2012Date of Patent: January 30, 2018Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Michael Hirsch, Thorsten Krause
-
Patent number: 9858286Abstract: Input backup data is deduplicated with data of a synthetic backup previously constructed by a deduplication storage system. A synthetic backup is constructed by processing metadata instructions provided by a backup application. Deduplication digests are calculated based on the data of the synthetic backup and the deduplication digests are stored in a digests index. When new backup data is processed, deduplication digests of the new data are calculated and searched in the digests index. Matching digests of previously constructed synthetic backups are located in the digests index. Each of the located matching digest references stored data are included in the synthetic backup, and the stored data is similar to the input backup data. Data matches are found in the input backup data and data in the synthetic backup.Type: GrantFiled: March 13, 2013Date of Patent: January 2, 2018Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Lior Aronovich, Michael Hirsch, Yair Toaff
-
Patent number: 9852145Abstract: A deduplication storage system and a backup application create a synthetic backup. Metadata instructions are provided to the deduplication storage system. Each of the metadata instructions specifies the data segment of an originating backup and a designated location of the data segment in the synthetic backup. A set of metadata instructions is transformed into a transformed set of metadata instructions.Type: GrantFiled: March 13, 2013Date of Patent: December 26, 2017Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Lior Aronovich, Michael Hirsch, Yair Toaff
-
Publication number: 20170344559Abstract: A system for segmenting an input data stream using vector processing, comprising a processor adapted to repeat the following steps throughout an input data stream to create a segmented data stream consisting a plurality of segments: apply a rolling sequence over a sequence of consecutive data items of an input data stream, the rolling sequence includes a subset of consecutive data items of the sequence, calculate concurrently a plurality of partial hash values each by one of a plurality of processing pipelines of the processor, each for a respective one of a plurality of partial rolling sequences each including evenly spaced data items of the subset, determine compliance of each of the plurality of partial hash values with one or more respective partial segmentation criteria and designate the sequence as a variable size segment when at least some of the partial hash values comply with the respective partial segmentation criteria.Type: ApplicationFiled: August 2, 2017Publication date: November 30, 2017Applicant: HUAWEI TECHNOLOGIES CO., LTD.Inventors: Yehonatan DAVID, Yair TOAFF, Michael HIRSCH