Patents by Inventor Thomas E. Raffill
Thomas E. Raffill 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: 20200202078Abstract: Some embodiments of an efficient string search have been presented. In one embodiment, a string of bytes representing content written in a non-delimited language is received, wherein the content has been classified into a predetermined category. In a single pass through the string of bytes, a set of N-grams is searched for simultaneously. Statistical information on occurrences of the N-grams, if any, in the string of bytes is collected. In some embodiments, a model is generated based on the statistical information, where the model is usable by a content filter to classify content.Type: ApplicationFiled: October 29, 2019Publication date: June 25, 2020Inventors: Thomas E. Raffill, Shunhui Zhu, Roman Yanovsky, Boris Yanovsky, John Gmuender
-
Patent number: 10460041Abstract: Some embodiments of an efficient string search have been presented. In one embodiment, a string of bytes representing content written in a non-delimited language is received, wherein the content has been classified into a predetermined category. In a single pass through the string of bytes, a set of N-grams is searched for simultaneously. Statistical information on occurrences of the N-grams, if any, in the string of bytes is collected. In some embodiments, a model is generated based on the statistical information, where the model is usable by a content filter to classify content.Type: GrantFiled: January 10, 2017Date of Patent: October 29, 2019Assignee: SONICWALL INC.Inventors: Thomas E. Raffill, Shunhui Zhu, Roman Yanovsky, Boris Yanovsky, John Gmuender
-
Patent number: 10387455Abstract: Some embodiments of on-the-fly pattern recognition with configurable bounds have been presented. In one embodiment, a pattern matching engine is configured based on user input, which may include values of one or more user configurable bounds on searching. Then the configured pattern matching engine is used to search for a set of features in an incoming string. A set of scores is updated based on the presence of any of the features in the string while searching for the features. Each score may indicate a likelihood of the content of the string being in a category. The search is terminated if the end of the string is reached or if the user configurable bounds are met. After terminating the search, the scores are output.Type: GrantFiled: May 12, 2017Date of Patent: August 20, 2019Assignee: SONICWALL INC.Inventors: Thomas E. Raffill, Shunhui Zhu, Roman Yanovsky, Boris Yanovsky, John Gmuender
-
Publication number: 20170249377Abstract: Some embodiments of on-the-fly pattern recognition with configurable bounds have been presented. In one embodiment, a pattern matching engine is configured based on user input, which may include values of one or more user configurable bounds on searching. Then the configured pattern matching engine is used to search for a set of features in an incoming string. A set of scores is updated based on the presence of any of the features in the string while searching for the features. Each score may indicate a likelihood of the content of the string being in a category. The search is terminated if the end of the string is reached or if the user configurable bounds are met. After terminating the search, the scores are output.Type: ApplicationFiled: May 12, 2017Publication date: August 31, 2017Inventors: Thomas E. Raffill, Shunhui Zhu, Roman Yanovsky, Boris Yanovsky, John Gmuender
-
Publication number: 20170147565Abstract: Some embodiments of an efficient string search have been presented. In one embodiment, a string of bytes representing content written in a non-delimited language is received, wherein the content has been classified into a predetermined category. In a single pass through the string of bytes, a set of N-grams is searched for simultaneously. Statistical information on occurrences of the N-grams, if any, in the string of bytes is collected. In some embodiments, a model is generated based on the statistical information, where the model is usable by a content filter to classify content.Type: ApplicationFiled: January 10, 2017Publication date: May 25, 2017Inventors: Thomas E. Raffill, Shunhui Zhu, Roman Yanovsky, Boris Yanovsky, John Gmuender
-
Patent number: 9654446Abstract: Some embodiments of on-the-fly pattern recognition with configurable bounds have been presented. In one embodiment, a pattern matching engine is configured based on user input, which may include values of one or more user configurable bounds on searching. Then the configured pattern matching engine is used to search for a set of features in an incoming string. A set of scores is updated based on the presence of any of the features in the string while searching for the features. Each score may indicate a likelihood of the content of the string being in a category. The search is terminated if the end of the string is reached or if the user configurable bounds are met. After terminating the search, the scores are output.Type: GrantFiled: July 7, 2015Date of Patent: May 16, 2017Assignee: SONICWALL INC.Inventors: Thomas E. Raffill, Shunhui Zhu, Roman Yanovsky, Boris Yanovsky, John Gmuender
-
Patent number: 9542387Abstract: Some embodiments of an efficient string search have been presented. In one embodiment, a string of bytes representing content written in a non-delimited language is received, wherein the content has been classified into a predetermined category. In a single pass through the string of bytes, a set of N-grams is searched for simultaneously. Statistical information on occurrences of the N-grams, if any, in the string of bytes is collected. In some embodiments, a model is generated based on the statistical information, where the model is usable by a content filter to classify content.Type: GrantFiled: July 8, 2014Date of Patent: January 10, 2017Assignee: DELL SOFTWARE INC.Inventors: Thomas E. Raffill, Shunhui Zhu, Roman Yanovsky, Boris Yanovsky, John Gmuender
-
Publication number: 20150358286Abstract: Some embodiments of on-the-fly pattern recognition with configurable bounds have been presented. In one embodiment, a pattern matching engine is configured based on user input, which may include values of one or more user configurable bounds on searching. Then the configured pattern matching engine is used to search for a set of features in an incoming string. A set of scores is updated based on the presence of any of the features in the string while searching for the features. Each score may indicate a likelihood of the content of the string being in a category. The search is terminated if the end of the string is reached or if the user configurable bounds are met. After terminating the search, the scores are output.Type: ApplicationFiled: July 7, 2015Publication date: December 10, 2015Inventors: Thomas E. Raffill, Shunhui Zhu, Roman Yanovsky, Boris Yanovsky, John Gmuender
-
Patent number: 9075804Abstract: Some embodiments of on-the-fly pattern recognition with configurable bounds have been presented. In one embodiment, a pattern matching engine is configured based on user input, which may include values of one or more user configurable bounds on searching. Then the configured pattern matching engine is used to search for a set of features in an incoming string. A set of scores is updated based on the presence of any of the features in the string while searching for the features. Each score may indicate a likelihood of the content of the string being in a category. The search is terminated if the end of the string is reached or if the user configurable bounds are met. After terminating the search, the scores are output.Type: GrantFiled: November 17, 2014Date of Patent: July 7, 2015Assignee: Dell Software Inc.Inventors: Thomas E. Raffill, Shunhui Zhu, Roman Yanovsky, Boris Yanovsky, John Gmuender
-
Publication number: 20150074099Abstract: Some embodiments of on-the-fly pattern recognition with configurable bounds have been presented. In one embodiment, a pattern matching engine is configured based on user input, which may include values of one or more user configurable bounds on searching. Then the configured pattern matching engine is used to search for a set of features in an incoming string. A set of scores is updated based on the presence of any of the features in the string while searching for the features. Each score may indicate a likelihood of the content of the string being in a category. The search is terminated if the end of the string is reached or if the user configurable bounds are met. After terminating the search, the scores are output.Type: ApplicationFiled: November 17, 2014Publication date: March 12, 2015Inventors: Thomas E. Raffill, Shunhui Zhu, Roman Yanovsky, Boris Yanovsky, John Gmuender
-
Patent number: 8892587Abstract: Some embodiments of on-the-fly pattern recognition with configurable bounds have been presented. In one embodiment, a pattern matching engine is configured based on user input, which may include values of one or more user configurable bounds on searching. Then the configured pattern matching engine is used to search for a set of features in an incoming string. A set of scores is updated based on the presence of any of the features in the string while searching for the features. Each score may indicate a likelihood of the content of the string being in a category. The search is terminated if the end of the string is reached or if the user configurable bounds are met. After terminating the search, the scores are output.Type: GrantFiled: February 5, 2013Date of Patent: November 18, 2014Assignee: SonicWALL, Inc.Inventors: Thomas E. Raffill, Shunhui Zhu, Roman Yanovsky, Boris Yanovsky, John Gmuender
-
Publication number: 20140324415Abstract: Some embodiments of an efficient string search have been presented. In one embodiment, a string of bytes representing content written in a non-delimited language is received, wherein the content has been classified into a predetermined category. In a single pass through the string of bytes, a set of N-grams is searched for simultaneously. Statistical information on occurrences of the N-grams, if any, in the string of bytes is collected. In some embodiments, a model is generated based on the statistical information, where the model is usable by a content filter to classify content.Type: ApplicationFiled: July 8, 2014Publication date: October 30, 2014Inventors: Thomas E. Raffill, Shunhui Zhu, Roman Yanovsky, Boris Yanovsky, John Gmuender
-
Patent number: 8775164Abstract: Some embodiments of an efficient string search have been presented. In one embodiment, a string of bytes representing content written in a non-delimited language is received, wherein the content has been classified into a predetermined category. In a single pass through the string of bytes, a set of N-grams is searched for simultaneously. Statistical information on occurrences of the N-grams, if any, in the string of bytes is collected. In some embodiments, a model is generated based on the statistical information, where the model is usable by a content filter to classify content.Type: GrantFiled: August 22, 2013Date of Patent: July 8, 2014Assignee: SonicWALL, Inc.Inventors: Thomas E. Raffill, Shunhui Zhu, Roman Yanovsky, Boris Yanovsky, John Gmuender
-
Publication number: 20130339006Abstract: Some embodiments of an efficient string search have been presented. In one embodiment, a string of bytes representing content written in a non-delimited language is received, wherein the content has been classified into a predetermined category. In a single pass through the string of bytes, a set of N-grams is searched for simultaneously. Statistical information on occurrences of the N-grams, if any, in the string of bytes is collected. In some embodiments, a model is generated based on the statistical information, where the model is usable by a content filter to classify content.Type: ApplicationFiled: August 22, 2013Publication date: December 19, 2013Applicant: SonicWall, Inc.Inventors: Thomas E. Raffill, Shunhui Zhu, Roman Yanovsky, Boris Yanovsky, John Gmuender
-
Patent number: 8577669Abstract: Some embodiments of an efficient string search have been presented. In one embodiment, a string of bytes representing content written in a non-delimited language is received, wherein the content has been classified into a predetermined category. In a single pass through the string of bytes, a set of N-grams is searched for simultaneously. Statistical information on occurrences of the N-grams, if any, in the string of bytes is collected. In some embodiments, a model is generated based on the statistical information, where the model is usable by a content filter to classify content.Type: GrantFiled: December 22, 2011Date of Patent: November 5, 2013Assignee: SonicWALL, Inc.Inventors: Thomas E. Raffill, Shunhui Zhu, Roman Yanovsky, Boris Yanovsky, John Gmuender
-
Publication number: 20130275423Abstract: Some embodiments of on-the-fly pattern recognition with configurable bounds have been presented. In one embodiment, a pattern matching engine is configured based on user input, which may include values of one or more user configurable bounds on searching. Then the configured pattern matching engine is used to search for a set of features in an incoming string. A set of scores is updated based on the presence of any of the features in the string while searching for the features. Each score may indicate a likelihood of the content of the string being in a category. The search is terminated if the end of the string is reached or if the user configurable bounds are met. After terminating the search, the scores are output.Type: ApplicationFiled: February 5, 2013Publication date: October 17, 2013Inventors: Thomas E. Raffill, Shunhui Zhu, Roman Yanovsky, Boris Yanovsky, John Gmuender
-
Patent number: 8370374Abstract: Some embodiments of on-the-fly pattern recognition with configurable bounds have been presented. In one embodiment, a pattern matching engine is configured based on user input, which may include values of one or more user configurable bounds on searching. Then the configured pattern matching engine is used to search for a set of features in an incoming string. A set of scores is updated based on the presence of any of the features in the string while searching for the features. Each score may indicate a likelihood of the content of the string being in a category. The search is terminated if the end of the string is reached or if the user configurable bounds are met. After terminating the search, the scores are output.Type: GrantFiled: August 2, 2011Date of Patent: February 5, 2013Assignee: SonicWALL, Inc.Inventors: Thomas E. Raffill, Shunhui Zhu, Roman Yanovsky, Boris Yanovsky, John Gmuender
-
Patent number: 8086441Abstract: Some embodiments of an efficient string search have been presented. In one embodiment, a string of bytes representing content written in a non-delimited language is received, wherein the content has been classified into a predetermined category. In a single pass through the string of bytes, a set of N-grams is searched for simultaneously. Statistical information on occurrences of the N-grams, if any, in the string of bytes is collected. In some embodiments, a model is generated based on the statistical information, where the model is usable by a content filter to classify content.Type: GrantFiled: July 27, 2007Date of Patent: December 27, 2011Assignee: SonicWall, Inc.Inventors: Thomas E. Raffill, Shunhui Zhu, Roman Yanovsky, Boris Yanovsky, John Gmuender
-
Patent number: 7996415Abstract: Some embodiments of on-the-fly pattern recognition with configurable bounds have been presented. In one embodiment, a pattern matching engine is configured based on user input, which may include values of one or more user configurable bounds on searching. Then the configured pattern matching engine is used to search for a set of features in an incoming string. A set of scores is updated based on the presence of any of the features in the string while searching for the features. Each score may indicate a likelihood of the content of the string being in a category. The search is terminated if the end of the string is reached or if the user configurable bounds are met. After terminating the search, the scores are output.Type: GrantFiled: July 29, 2010Date of Patent: August 9, 2011Assignee: Sonicwall, Inc.Inventors: Thomas E. Raffill, Shunhui Zhu, Roman Yanovsky, Boris Yanovsky, John Gmuender
-
Patent number: 7917522Abstract: A training procedure for N-gram based statistical document classification has been disclosed. In one embodiment, a set of N-grams is selected out of a second set of N-grams, each of the N-grams having a sequence of N bytes, where N is an integer. Then a statistical content classification model is generated based on occurrences of the N-grams, if any, in a set of training documents and a set of validation documents. The statistical content classification model is provided to content filters to classify content.Type: GrantFiled: June 24, 2010Date of Patent: March 29, 2011Assignee: SonicWALL, Inc.Inventors: Thomas E. Raffill, Shunhui Zhu, Roman Yanovsky, Boris Yanovsky, John Gmuender