Patents by Inventor Frederick Sturm
Frederick Sturm 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: 20240135449Abstract: An illustrative computing device may include a processor and a non-transitory memory device for storing a data structure capable of being compressed, where the data structure includes a plurality of data elements and each of the plurality of data elements includes a date field and a quantity field. The computing device may process instructions to arrange the plurality of data elements in a consecutive series in date order based on a value stored in the date field of each data element, determine whether a gap appears in the consecutive series of data elements based on a value stored in the quantity field of each element, remove the determined gaps in each of the data elements, and repeat the determining and removing steps until a predetermined criterion has been reached.Type: ApplicationFiled: October 12, 2023Publication date: April 25, 2024Applicant: Chicago Mercantile Exchange Inc.Inventors: Suzanne Sprague, Sean Downey, Robert Taylor, Dhiraj Bawadhankar, Stephen Hurst, Matthew Simpson, Frederick Sturm
-
Publication number: 20240013298Abstract: A computer implemented method for assigning values to objects includes receiving a plurality of values for each of a plurality of base objects including a first and second base object; receiving a plurality of values for a first composite object associated with the first and second base objects; generating and storing in the memory a solution set including combinations of values of the first and second base objects; for each combination in the solution set, generating first transaction results by computing transactions between the values of the first and second base objects; comparing each of the first transaction results to a first range of values including the values of the first composite object; and removing, from the solution set and from the memory, the combinations of the values of the first and second base objects corresponding to the first transaction results that are outside of the first range of values.Type: ApplicationFiled: September 25, 2023Publication date: January 11, 2024Applicant: Chicago Mercantile Exchange Inc.Inventors: David Bixby, Frederick Sturm, Edmund Carey, Sten Anderson, Vivek Kondaveeti, Thomas Lord
-
Patent number: 11861710Abstract: An illustrative computing device may include a processor and a non-transitory memory device for storing a data structure capable of being compressed, where the data structure includes a plurality of data elements and each of the plurality of data elements includes a date field and a quantity field. The computing device may process instructions to arrange the plurality of data elements in a consecutive series in date order based on a value stored in the date field of each data element, determine whether a gap appears in the consecutive series of data elements based on a value stored in the quantity field of each element, remove the determined gaps in each of the data elements, and repeat the determining and removing steps until a predetermined criterion has been reached.Type: GrantFiled: February 7, 2023Date of Patent: January 2, 2024Assignee: Chicago Mercantile Exchange Inc.Inventors: Suzanne Sprague, Sean Downey, Robert Taylor, Dhiraj Bawadhankar, Stephen Hurst, Matthew Simpson, Frederick Sturm
-
Patent number: 11803911Abstract: A computer implemented method for assigning values to objects includes receiving a plurality of values for each of a plurality of base objects including a first and second base object; receiving a plurality of values for a first composite object associated with the first and second base objects; generating and storing in the memory a solution set including combinations of values of the first and second base objects; for each combination in the solution set, generating first transaction results by computing transactions between the values of the first and second base objects; comparing each of the first transaction results to a first range of values including the values of the first composite object; and removing, from the solution set and from the memory, the combinations of the values of the first and second base objects corresponding to the first transaction results that are outside of the first range of values.Type: GrantFiled: November 12, 2021Date of Patent: October 31, 2023Assignee: Chicago Mercantile Exchange Inc.Inventors: David Bixby, Frederick Sturm, Edmund Carey, Sten Anderson, Vivek Kondaveeti, Thomas Lord
-
Publication number: 20230177606Abstract: An illustrative computing device may include a processor and a non-transitory memory device for storing a data structure capable of being compressed, where the data structure includes a plurality of data elements and each of the plurality of data elements includes a date field and a quantity field. The computing device may process instructions to arrange the plurality of data elements in a consecutive series in date order based on a value stored in the date field of each data element, determine whether a gap appears in the consecutive series of data elements based on a value stored in the quantity field of each element, remove the determined gaps in each of the data elements, and repeat the determining and removing steps until a predetermined criterion has been reached.Type: ApplicationFiled: February 7, 2023Publication date: June 8, 2023Applicant: Chicago Mercantile Exchange Inc.Inventors: Suzanne Sprague, Sean Downey, Robert Taylor, Dhiraj Bawadhankar, Stephen Hurst, Matthew Simpson, Frederick Sturm
-
Patent number: 11605130Abstract: An illustrative computing device may include a processor and a non-transitory memory device for storing a data structure capable of being compressed, where the data structure includes a plurality of data elements and each of the plurality of data elements includes a date field and a quantity field. The computing device may process instructions to arrange the plurality of data elements in a consecutive series in date order based on a value stored in the date field of each data element, determine whether a gap appears in the consecutive series of data elements based on a value stored in the quantity field of each element, remove the determined gaps in each of the data elements, and repeat the determining and removing steps until a predetermined criterion has been reached.Type: GrantFiled: January 12, 2022Date of Patent: March 14, 2023Assignee: Chicago Mercantile Exchange Inc.Inventors: Suzanne Sprague, Sean Downey, Robert Taylor, Dhiraj Bawadhankar, Stephen Hurst, Matthew Simpson, Frederick Sturm
-
Publication number: 20220138851Abstract: An illustrative computing device may include a processor and a non-transitory memory device for storing a data structure capable of being compressed, where the data structure includes a plurality of data elements and each of the plurality of data elements includes a date field and a quantity field. The computing device may process instructions to arrange the plurality of data elements in a consecutive series in date order based on a value stored in the date field of each data element, determine whether a gap appears in the consecutive series of data elements based on a value stored in the quantity field of each element, remove the determined gaps in each of the data elements, and repeat the determining and removing steps until a predetermined criterion has been reached.Type: ApplicationFiled: January 12, 2022Publication date: May 5, 2022Applicant: Chicago Mercantile Exchange Inc.Inventors: Suzanne Sprague, Sean Downey, Robert Taylor, Dhiraj Bawadhankar, Stephen Hurst, Matthew Simpson, Frederick Sturm
-
Publication number: 20220076338Abstract: A computer implemented method for assigning values to objects includes receiving a plurality of values for each of a plurality of base objects including a first and second base object; receiving a plurality of values for a first composite object associated with the first and second base objects; generating and storing in the memory a solution set including combinations of values of the first and second base objects; for each combination in the solution set, generating first transaction results by computing transactions between the values of the first and second base objects; comparing each of the first transaction results to a first range of values including the values of the first composite object; and removing, from the solution set and from the memory, the combinations of the values of the first and second base objects corresponding to the first transaction results that are outside of the first range of values.Type: ApplicationFiled: November 12, 2021Publication date: March 10, 2022Applicant: Chicago Mercantile Exchange Inc.Inventors: David Bixby, Frederick Sturm, Edmund Carey, Sten Anderson, Vivek Kondaveeti, Thomas Lord
-
Patent number: 11270377Abstract: An illustrative computing device may include a processor and a non-transitory memory device for storing a data structure capable of being compressed, where the data structure includes a plurality of data elements and each of the plurality of data elements includes a date field and a quantity field. The computing device may process instructions to arrange the plurality of data elements in a consecutive series in date order based on a value stored in the date field of each data element, determine whether a gap appears in the consecutive series of data elements based on a value stored in the quantity field of each element, remove the determined gaps in each of the data elements, and repeat the determining and removing steps until a predetermined criterion has been reached.Type: GrantFiled: October 18, 2016Date of Patent: March 8, 2022Assignee: Chicago Mercantile Exchange Inc.Inventors: Suzanne Sprague, Sean Downey, Robert Taylor, Dhiraj Bawadhankar, Stephen Hurst, Matthew Simpson, Frederick Sturm
-
Patent number: 11205224Abstract: A computer implemented method for assigning values to objects includes receiving a plurality of values for each of a plurality of base objects including a first and second base object; receiving a plurality of values for a first composite object associated with the first and second base objects; generating and storing in the memory a solution set including combinations of values of the first and second base objects; for each combination in the solution set, generating first transaction results by computing transactions between the values of the first and second base objects; comparing each of the first transaction results to a first range of values including the values of the first composite object; and removing, from the solution set and from the memory, the combinations of the values of the first and second base objects corresponding to the first transaction results that are outside of the first range of values.Type: GrantFiled: August 8, 2019Date of Patent: December 21, 2021Assignee: Chicago Mercantile Exchange Inc.Inventors: David Bixby, Frederick Sturm, Edmund Carey, Sten Anderson, Vivek Kondaveeti, Thomas Lord
-
Publication number: 20210217090Abstract: The disclosed embodiments relate to an exchange computing system which selectively prematurely expires financial instruments in order to finally settle them and remove them from the computing system. In particular, the disclosed embodiments recognize that during the pendency of a futures contract between first available trade date and the expiration, the exchange computing system must facilitate trading thereof by tracking traders positions, providing regular pricing data as well as transacting trades therefore. This consumes exchange resource especially given the number of products offered and the extended length of term for some. Accordingly where contracts can be settled early and thereby removed from being transacted, exchange resources may be conserved.Type: ApplicationFiled: March 31, 2021Publication date: July 15, 2021Applicant: Chicago Mercantile Exchange Inc.Inventors: Agha Irtaza Mirza, Edmund Carey, Frederick Sturm
-
Patent number: 10997656Abstract: The disclosed embodiments relate to an exchange computing system which selectively prematurely expires financial instruments in order to finally settle them and remove them from the computing system. In particular, the disclosed embodiments recognize that during the pendency of a futures contract between first available trade date and the expiration, the exchange computing system must facilitate trading thereof by tracking traders positions, providing regular pricing data as well as transacting trades therefore. This consumes exchange resource especially given the number of products offered and the extended length of term for some. Accordingly where contracts can be settled early and thereby removed from being transacted, exchange resources may be conserved.Type: GrantFiled: April 23, 2018Date of Patent: May 4, 2021Assignee: Chicago Mercantile Exchange Inc.Inventors: Agha Irtaza Mirza, Edmund Carey, Frederick Sturm
-
Publication number: 20210056635Abstract: The disclosed embodiments relate to automated generation of objective data for use in computing a forward interest rate for a future time period subsequent to a current date, as well as post validation thereof. Periodic sample sets of the prices of actual completed trades between anonymized parties of each of a set of interest rate futures contracts having consecutive expiration months which collectively include the selected future time period are obtained from an anonymized electronic trading system. The prices of current best offers to buy/sell each of those contracts are also randomly obtained. Each sample set, along with the randomly selected prices, is then processed to identify a subset thereof which are consistent with a relationship between the underlying interest rate of the set of contracts and time period covered thereby.Type: ApplicationFiled: August 18, 2020Publication date: February 25, 2021Applicant: Chicago Mercantile Exchange Inc.Inventors: Mark Andrew Rogerson, Edmund Bowering Carey, David Edward Bixby, JR., Frederick Sturm, Gavin Keith Lee, Agha Irtaza Mirza
-
Patent number: 10657587Abstract: The disclosed embodiments relate to determining a listing date, an expiration date and the cash settlement price of a futures contract, i.e. a Treasury Futures, for the delivery of the most recently issued, referred to as an on-the-run, US treasury Note of a particular maturity by reference to the U.S. Treasury Auction cycle and the difference between a resultant industry surveyed swap rate and a resultant industry surveyed swap spread of the respective tenors (time remaining until maturity) of the on-the-run treasury futures.Type: GrantFiled: July 30, 2013Date of Patent: May 19, 2020Assignee: Chicago Mercantile Exchange Inc.Inventors: James Boudreault, John Wiley, Frederick Sturm, Jonathan Kronstein, Suzanne Spain, Peter Barker
-
Publication number: 20190362425Abstract: A computer implemented method for assigning values to objects includes receiving a plurality of values for each of a plurality of base objects including a first and second base object; receiving a plurality of values for a first composite object associated with the first and second base objects; generating and storing in the memory a solution set including combinations of values of the first and second base objects; for each combination in the solution set, generating first transaction results by computing transactions between the values of the first and second base objects; comparing each of the first transaction results to a first range of values including the values of the first composite object; and removing, from the solution set and from the memory, the combinations of the values of the first and second base objects corresponding to the first transaction results that are outside of the first range of values.Type: ApplicationFiled: August 8, 2019Publication date: November 28, 2019Applicant: Chicago Mercantile Exchange Inc.Inventors: David Bixby, Frederick Sturm, Edmund Carey, Sten Anderson, Vivek Kondaveeti, Thomas Lord
-
Patent number: 10430881Abstract: A computer implemented method for assigning values to objects includes receiving a plurality of values for each of a plurality of base objects including a first and second base object; receiving a plurality of values for a first composite object associated with the first and second base objects; generating and storing in the memory a solution set including combinations of values of the first and second base objects; for each combination in the solution set, generating first transaction results by computing transactions between the values of the first and second base objects; comparing each of the first transaction results to a first range of values including the values of the first composite object; and removing, from the solution set and from the memory, the combinations of the values of the first and second base objects corresponding to the first transaction results that are outside of the first range of values.Type: GrantFiled: January 19, 2016Date of Patent: October 1, 2019Assignee: Chicago Mercantile Exchange Inc.Inventors: David Bixby, Frederick Sturm, Edmund Carey, Sten Anderson, Vivek Kondaveeti, Thomas Lord
-
Publication number: 20190172131Abstract: The disclosed embodiments relate to an exchange computing system which selectively prematurely expires financial instruments in order to finally settle them and remove them from the computing system. In particular, the disclosed embodiments recognize that during the pendency of a futures contract between first available trade date and the expiration, the exchange computing system must facilitate trading thereof by tracking traders positions, providing regular pricing data as well as transacting trades therefore. This consumes exchange resource especially given the number of products offered and the extended length of term for some. Accordingly where contracts can be settled early and thereby removed from being transacted, exchange resources may be conserved.Type: ApplicationFiled: April 23, 2018Publication date: June 6, 2019Inventors: Agha Irtaza Mirza, Edmund Carey, Frederick Sturm
-
Publication number: 20170206600Abstract: A computer implemented method for assigning values to objects includes receiving a plurality of values for each of a plurality of base objects including a first and second base object; receiving a plurality of values for a first composite object associated with the first and second base objects; generating and storing in the memory a solution set including combinations of values of the first and second base objects; for each combination in the solution set, generating first transaction results by computing transactions between the values of the first and second base objects; comparing each of the first transaction results to a first range of values including the values of the first composite object; and removing, from the solution set and from the memory, the combinations of the values of the first and second base objects corresponding to the first transaction results that are outside of the first range of values.Type: ApplicationFiled: January 19, 2016Publication date: July 20, 2017Inventors: David Bixby, Frederick Sturm, Edmund Carey, Sten Anderson, Vivek Kondaveeti, Thomas Lord
-
Publication number: 20160019643Abstract: Stored invoice swap spread (IVSP) parameters may indicate that an IVSP conforming to the IVSP parameters includes a futures contract leg conforming to futures contract parameters and an interest rate swap (IRS) leg conforming to IRS parameters. A yield may be calculated based on an invoice price for a delivered debt instrument corresponding to a futures contract leg of an executed IVSP conforming to the IVSP parameters and based on the terms of the delivered debt instrument. A fixed rate for an IRS leg of the executed IVSP may be calculated based on the IRS parameters, the yield, and a price of the executed IVSP. Fixed rate payment dates for the IRS leg of the executed IVSP may be determined based on the IRS parameters and the terms of the delivered debt instrument.Type: ApplicationFiled: July 18, 2014Publication date: January 21, 2016Inventors: John Labuszewski, Frederick Sturm, James Boudreault, Jonathan Kronstein, Daniel Grombacher, Agha Irtaza Mirza
-
Publication number: 20160019644Abstract: The disclosed embodiments relate to systems and methods that match or allocate an incoming order to trade with a plurality of resting orders. Order book data indicative of the resting orders is obtained. An allocation priority listing of the plurality of resting orders is determined based on the order book data. The allocation priority listing prioritizes the plurality of resting orders by order price, and further prioritizes by order size those of the plurality of resting orders having an identical order price. A volume of the incoming order is allocated in accordance with the allocation priority listing by proceeding sequentially through the plurality of resting orders starting with the respective resting order listed first in the allocation priority listing. A successive resting order in the allocation priority listing is not filled until the respective resting order currently being filled is either filled completely or a fill limit is met.Type: ApplicationFiled: July 18, 2014Publication date: January 21, 2016Inventors: James Boudreault, Jonathan Kronstein, Daniel Grombacher, Frederick Sturm, John Labuszewski