Patents by Inventor Kwame Gyang
Kwame Gyang 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: 20230334564Abstract: A variety of embodiments for hardware-accelerating the processing of financial market depth data are disclosed. A coprocessor, which may be resident in a ticker plant, can be configured to update order books and price books based on financial market depth data at extremely low latency. Such a coprocessor can also be configured to enrich a stream of limit order events pertaining to financial instruments with data from a plurality of updated order and price books.Type: ApplicationFiled: June 8, 2023Publication date: October 19, 2023Inventors: David E. Taylor, Scott Parsons, Jeremy Walter Whatley, Richard Bradley, Kwame Gyang, Michael DeWulf
-
Patent number: 11676206Abstract: A variety of embodiments for hardware-accelerating the processing of financial market depth data are disclosed. A coprocessor, which may be resident in a ticker plant, can be configured to update order books and price books based on financial market depth data at extremely low latency. Such a coprocessor can also be configured to enrich a stream of limit order events pertaining to financial instruments with data from a plurality of updated order and price books.Type: GrantFiled: February 22, 2021Date of Patent: June 13, 2023Assignee: Exegy IncorporatedInventors: David E. Taylor, Scott Parsons, Jeremy Walter Whatley, Richard Bradley, Kwame Gyang, Michael DeWulf
-
Publication number: 20210304848Abstract: Apparatuses and methods are disclosed for comparing a first biosequence string with a second biosequence string to assess similarity between those biosequence strings. For example, a field programmable gate array (FPGA) can be used to (1) detect substrings of the second biosequence string that are matches to substrings of the first biosequence string, and (2) map the detected substrings of the second biosequence string to corresponding positions in the first biosequence string where the detected substrings are located based on a data structure that links substrings of the first biosequence string to positions in the first biosequence string where the substrings of the first biosequence string are located. These operations can be used to seed an alignment between the first and second biosequence strings that permits comparisons to be performed over longer substrings of the first and second biosequence strings so that similarities between those longer substrings can be quantified.Type: ApplicationFiled: March 23, 2021Publication date: September 30, 2021Inventors: Jeremy Daniel Buhler, Roger Dean Chamberlain, Mark Allen Franklin, Kwame Gyang, Arpith Chacko Jacob, Praveen Krishnamurthy, Joseph Marion Lancaster
-
Publication number: 20210174445Abstract: Method and Apparatus for High-Speed Processing of Financial Market Depth Data A variety of embodiments for hardware-accelerating the processing of financial market depth data are disclosed. A coprocessor, which may be resident in a ticker plant, can be configured to update order books and price books based on financial market depth data at extremely low latency. Such a coprocessor can also be configured to enrich a stream of limit order events pertaining to financial instruments with data from a plurality of updated order and price books.Type: ApplicationFiled: February 22, 2021Publication date: June 10, 2021Inventors: David E. Taylor, Scott Parsons, Jeremy Walter Whatley, Richard Bradley, Kwame Gyang, Michael DeWulf
-
Patent number: 10957423Abstract: Apparatuses and methods are disclosed for comparing a first biosequence string with a second biosequence string to assess similarity between those biosequence strings. For example, a field programmable gate array (FPGA) can be used to (1) detect substrings of the second biosequence string that are matches to substrings of the first biosequence string, and (2) map the detected substrings of the second biosequence string to corresponding positions in the first biosequence string where the detected substrings are located based on a data structure that links substrings of the first biosequence string to positions in the first biosequence string where the substrings of the first biosequence string are located. These operations can be used to seed an alignment between the first and second biosequence strings that permits comparisons to be performed over longer substrings of the first and second biosequence strings so that similarities between those longer substrings can be quantified.Type: GrantFiled: February 28, 2020Date of Patent: March 23, 2021Assignee: WASHINGTON UNIVERSITYInventors: Jeremy Daniel Buhler, Roger Dean Chamberlain, Mark Allen Franklin, Kwame Gyang, Arpith Chacko Jacob, Praveen Krishnamurthy, Joseph Marion Lancaster
-
Patent number: 10929930Abstract: A variety of embodiments for hardware-accelerating the processing of financial market depth data are disclosed. A coprocessor, which may be resident in a ticker plant, can be configured to update order books based on financial market depth data at extremely low latency. Such a coprocessor can also be configured to enrich a stream of limit order events pertaining to financial instruments with data from a plurality of updated order books.Type: GrantFiled: August 24, 2018Date of Patent: February 23, 2021Assignee: IP Reservoir, LLCInventors: David E. Taylor, Scott Parsons, Jeremy Walter Whatley, Richard Bradley, Kwame Gyang, Michael DeWulf
-
Publication number: 20200251185Abstract: Apparatuses and methods are disclosed for comparing a first biosequence string with a second biosequence string to assess similarity between those biosequence strings. For example, a field programmable gate array (FPGA) can be used to (1) detect substrings of the second biosequence string that are matches to substrings of the first biosequence string, and (2) map the detected substrings of the second biosequence string to corresponding positions in the first biosequence string where the detected substrings are located based on a data structure that links substrings of the first biosequence string to positions in the first biosequence string where the substrings of the first biosequence string are located. These operations can be used to seed an alignment between the first and second biosequence strings that permits comparisons to be performed over longer substrings of the first and second biosequence strings so that similarities between those longer substrings can be quantified.Type: ApplicationFiled: February 28, 2020Publication date: August 6, 2020Inventors: Jeremy Daniel Buhler, Roger Dean Chamberlain, Mark Allen Franklin, Kwame Gyang, Arpith Chacko Jacob, Praveen Krishnamurthy, Joseph Marion Lancaster
-
Patent number: 10580518Abstract: A system and method for performing similarity searching is disclosed wherein programmable logic devices such as field programmable gate arrays (FPGAs) can be used to implement Bloom filters for identifying possible matches between a query and data. The Bloom filters can be implemented in a parallel architecture where the different parallel Bloom filters share access to the same memory units. Further, a hash table may be generated to map a set of strings to keys. In other examples, the hash table may be used to map a set of substrings to a position in a larger string.Type: GrantFiled: January 11, 2017Date of Patent: March 3, 2020Assignee: WASHINGTON UNIVERSITYInventors: Jeremy Daniel Buhler, Roger Dean Chamberlain, Mark Allen Franklin, Kwame Gyang, Arpith Chacko Jacob, Praveen Krishnamurthy, Joseph Marion Lancaster
-
Publication number: 20180365766Abstract: A variety of embodiments for hardware-accelerating the processing of financial market depth data are disclosed. A coprocessor, which may be resident in a ticker plant, can be configured to update order books based on financial market depth data at extremely low latency. Such a coprocessor can also be configured to enrich a stream of limit order events pertaining to financial instruments with data from a plurality of updated order books.Type: ApplicationFiled: August 24, 2018Publication date: December 20, 2018Inventors: David E. Taylor, Scott Parsons, Jeremy Walter Whatley, Richard Bradley, Kwame Gyang, Michael DeWulf
-
Patent number: 10062115Abstract: A variety of embodiments for hardware-accelerating the processing of financial market depth data are disclosed. A coprocessor, which may be resident in a ticker plant, can be configured to update order books based on financial market depth data at extremely low latency. Such a coprocessor can also be configured to enrich a stream of limit order events pertaining to financial instruments with data from a plurality of updated order books.Type: GrantFiled: June 26, 2014Date of Patent: August 28, 2018Assignee: IP Reservoir, LLCInventors: David E. Taylor, Scott Parsons, Jeremy Walter Whatley, Richard Bradley, Kwame Gyang, Michael DeWulf
-
Publication number: 20170124255Abstract: A system and method for performing similarity searching is disclosed wherein programmable logic devices such as field programmable gate arrays (FPGAs) can be used to implement Bloom filters for identifying possible matches between a query and data. The Bloom filters can be implemented in a parallel architecture where the different parallel Bloom filters share access to the same memory units. Further, a hash table may be generated to map a set of strings to keys. In other examples, the hash table may be used to map a set of substrings to a position in a larger string.Type: ApplicationFiled: January 11, 2017Publication date: May 4, 2017Inventors: Jeremy Daniel Buhler, Roger Dean Chamberlain, Mark Allen Franklin, Kwame Gyang, Arpith Chacko Jacob, Praveen Krishnamurthy, Joseph Marion Lancaster
-
Patent number: 9547680Abstract: A system and method for performing similarity searching is disclosed wherein programmable logic devices such as field programmable gate arrays (FPGAs) can be used to implement Bloom filters for identifying possible matches between a query and data. The Bloom filters can be implemented in a parallel architecture where the different parallel Bloom filters share access to the same memory units.Type: GrantFiled: August 19, 2013Date of Patent: January 17, 2017Assignee: Washington UniversityInventors: Jeremy Daniel Buhler, Roger Dean Chamberlain, Mark Allen Franklin, Kwame Gyang, Arpith Chacko Jacob, Praveen Krishnamurthy, Joseph Marion Lancaster
-
Publication number: 20140310148Abstract: A variety of embodiments for hardware-accelerating the processing of financial market depth data are disclosed. A coprocessor, which may be resident in a ticker plant, can be configured to update order books based on financial market depth data at extremely low latency. Such a coprocessor can also be configured to enrich a stream of limit order events pertaining to financial instruments with data from a plurality of updated order books.Type: ApplicationFiled: June 26, 2014Publication date: October 16, 2014Inventors: David E. Taylor, Scott Parsons, Jeremy Walter Whatley, Richard Bradley, Kwame Gyang, Michael DeWulf
-
Patent number: 8768805Abstract: A variety of embodiments for hardware-accelerating the processing of financial market depth data are disclosed. A coprocessor, which may be resident in a ticker plant, can be configured to update order books based on financial market depth data at extremely low latency. Such a coprocessor can also be configured to enrich a stream of limit order events pertaining to financial instruments with data from a plurality of updated order books.Type: GrantFiled: June 7, 2011Date of Patent: July 1, 2014Assignee: IP Reservoir, LLCInventors: David E. Taylor, Scott Parsons, Jeremy Walter Whatley, Richard Bradley, Kwame Gyang, Michael DeWulf
-
Patent number: 8762249Abstract: A variety of embodiments for hardware-accelerating the processing of financial market depth data are disclosed. A coprocessor, which may be resident in a ticker plant, can be configured to update order books based on financial market depth data at extremely low latency. Such a coprocessor can also be configured to generate a quote event in response to a limit order event being determined to modify the top of an order book.Type: GrantFiled: June 7, 2011Date of Patent: June 24, 2014Assignee: IP Reservoir, LLCInventors: David E. Taylor, Scott Parsons, Jeremy Walter Whatley, Richard Bradley, Kwame Gyang, Michael DeWulf
-
Publication number: 20140067830Abstract: A system and method for performing similarity searching is disclosed wherein programmable logic devices such as field programmable gate arrays (FPGAs) can be used to implement Bloom filters for identifying possible matches between a query and data. The Bloom filters can be implemented in a parallel architecture where the different parallel Bloom filters share access to the same memory units.Type: ApplicationFiled: August 19, 2013Publication date: March 6, 2014Inventors: Jeremy Daniel Buhler, Roger Dean Chamberlain, Mark Allen Franklin, Kwame Gyang, Arpith Chacko Jacob, Praveen Krishnamurthy, Joseph Marion Lancaster
-
Patent number: 8515682Abstract: A system and method for performing similarity searching is disclosed. This includes a programmable logic device configured to include a pipeline that comprises a matching stage, the matching stage being configured to receive a data stream comprising a plurality of possible matches between a plurality of data strings and a plurality of substrings of a query string. The pipeline may further include an ungapped extension prefilter stage located downstream from the matching stage, the prefilter stage being configured to shift through pattern matches between the data strings and the plurality of substrings of a query string and provide a score so that only pattern matches that exceed a user defined score will pass downstream from the prefilter stage. The matching stage may include at least one Bloom filter.Type: GrantFiled: March 11, 2011Date of Patent: August 20, 2013Assignee: Washington UniversityInventors: Jeremy Daniel Buhler, Roger Dean Chamberlain, Mark Allen Franklin, Kwame Gyang, Arpith Chacko Jacob, Praveen Krishnamurthy, Joseph Marion Lancaster
-
Publication number: 20120095893Abstract: A variety of embodiments for hardware-accelerating the processing of financial market depth data are disclosed. A coprocessor, which may be resident in a ticker plant, can be configured to update order books based on financial market depth data at extremely low latency. Such a coprocessor can also be configured to enrich a stream of limit order events pertaining to financial instruments with data from a plurality of updated order books.Type: ApplicationFiled: December 14, 2009Publication date: April 19, 2012Applicant: Exegy IncorporatedInventors: David E. Taylor, Scott Parsons, Jeremy Walter Whatley, Richard Bradley, Kwame Gyang, Michael Dewulf
-
Publication number: 20120089497Abstract: A variety of embodiments for hardware-accelerating the processing of financial market depth data are disclosed. A coprocessor, which may be resident in a ticker plant, can be configured to update order books based on financial market depth data at extremely low latency. Such a coprocessor can also be configured to generate a quote event in response to a limit order event being determined to modify the top of an order book.Type: ApplicationFiled: June 7, 2011Publication date: April 12, 2012Applicant: EXEGY INCORPORATEDInventors: David E. Taylor, Scott Parsons, Jeremy Walter Whatley, Richard Bradley, Kwame Gyang, Michael DeWulf
-
Publication number: 20120089496Abstract: A variety of embodiments for hardware-accelerating the processing of financial market depth data are disclosed. A coprocessor, which may be resident in a ticker plant, can be configured to update order books based on financial market depth data at extremely low latency. Such a coprocessor can also be configured to enrich a stream of limit order events pertaining to financial instruments with data from a plurality of updated order books.Type: ApplicationFiled: June 7, 2011Publication date: April 12, 2012Applicant: EXEGY INCORPORATEDInventors: David E. Taylor, Scott Parsons, Jeremy Walter Whatley, Richard Bradley, Kwame Gyang, Michael DeWulf