Generating context tree data based on a tailored data model

Information

  • Patent Grant
  • 11567918
  • Patent Number
    11,567,918
  • Date Filed
    Tuesday, May 21, 2019
    5 years ago
  • Date Issued
    Tuesday, January 31, 2023
    a year ago
  • CPC
    • G06F16/2246
    • G06F16/219
    • G06F16/245
    • G06F16/2428
    • G06F16/28
    • G06F16/288
  • Field of Search
    • CPC
    • G06F16/2246
    • G06F16/28
    • G06F16/219
    • G06F16/245
    • G06F16/288
    • G06F16/2428
  • International Classifications
    • G06F16/22
    • G06F16/28
    • G06F16/21
    • G06F16/245
    • G06F16/242
    • Disclaimer
      This patent is subject to a terminal disclaimer.
      Term Extension
      286
Abstract
A system for providing context tree based on data model is disclosed. The system comprises an interface, a processor, and a memory. The interface is configured to receive a data model entry point, and to receive one or more context filters. The processor is configured to determine context tree data based on the one or more context filters and the data model entry point from any context tree provider that has appropriate context tree information. The memory is coupled to the processor and is configured to provide the processor with instructions.
Description
BACKGROUND OF THE INVENTION

In a typical system, a consumer of the data model has to be aware of each and every aspect and manifestation of the data model based on the context of where and how the data models are used. The builder and run time consumer also need to know how to construct or interpret any data interchange schema. Further, a runtime consumer or client has to know how to find the values for any data referred to by a data model.





BRIEF DESCRIPTION OF THE DRAWINGS

Various embodiments of the invention are disclosed in the following detailed description and the accompanying drawings.



FIG. 1A is a block diagram illustrating an embodiment of a context tree locator.



FIG. 1B is a block diagram illustrating an embodiment of populating a context tree instance.



FIGS. 2A and 2B are block diagrams illustrating embodiments of context trees.



FIG. 3A is a block diagram illustrating an embodiment of a data model.



FIG. 3B is a block diagram illustrating an embodiment of a context tree instance.



FIG. 4A is a block diagram illustrating an embodiment of a data model.



FIG. 4B is a block diagram illustrating an embodiment of a context tree instance.



FIG. 4C is a block diagram illustrating an embodiment of a context tree instance.



FIG. 5 is a flow diagram illustrating an embodiment of a process for utilizing a context tree.



FIG. 6 is a flow diagram illustrating an embodiment of a process for building a context tree.



FIG. 7 is a flow diagram illustrating an embodiment of a process for determining context tree data.



FIG. 8 is a flow diagram illustrating an embodiment of a process for using a context tree during run time.



FIG. 9 is a flow diagram illustrating an embodiment of a process for determining a context tree instance.





DETAILED DESCRIPTION

The invention can be implemented in numerous ways, including as a process; an apparatus; a system; a composition of matter; a computer program product embodied on a computer readable storage medium; and/or a processor, such as a processor configured to execute instructions stored on and/or provided by a memory coupled to the processor. In this specification, these implementations, or any other form that the invention may take, may be referred to as techniques. In general, the order of the steps of disclosed processes may be altered within the scope of the invention. Unless stated otherwise, a component such as a processor or a memory described as being configured to perform a task may be implemented as a general component that is temporarily configured to perform the task at a given time or a specific component that is manufactured to perform the task. As used herein, the term ‘processor’ refers to one or more devices, circuits, and/or processing cores configured to process data, such as computer program instructions.


A detailed description of one or more embodiments of the invention is provided below along with accompanying figures that illustrate the principles of the invention. The invention is described in connection with such embodiments, but the invention is not limited to any embodiment. The scope of the invention is limited only by the claims and the invention encompasses numerous alternatives, modifications and equivalents. Numerous specific details are set forth in the following description in order to provide a thorough understanding of the invention. These details are provided for the purpose of example and the invention may be practiced according to the claims without some or all of these specific details. For the purpose of clarity, technical material that is known in the technical fields related to the invention has not been described in detail so that the invention is not unnecessarily obscured.


A system for providing data model based context tree is disclosed. The system comprises an interface, a processor, and a memory. The interface (e.g., a context tree locator) is configured to receive a data model entry point, and to receive one or more context filters. The processor (e.g., a context tree provider) is configured to determine context tree data based on the one or more context filters and the data model entry point from any context tree provider that has appropriate context tree information. The memory is coupled to the processor and is configured to provide the processor with instructions.


In some embodiments, a context tree provider and the logic to construct a context tree are abstracted, so that a consumer can access a tailored context tree based on the data model. The appropriate data can thereby be used by any client or consumer via this tailored context tree. A context data provider could be used where appropriate to provide actual data values for any given instance of a context tree, and therefore each consumer does not need to be aware of how the values are retrieved. The validation framework that validates the expressions based on the context tree remains unchanged even with the introduction of newer data models.



FIG. 1A is a block diagram illustrating an embodiment of a context tree locator. In the example shown, context tree locator 100 receives a data model entry point and a context tree filter. Context tree locator 100 polls a plurality of context tree providers 102 to see if any context tree providers 102 have any data contributions for context tree 104. The data contributions for context tree 104 are based at least in part on the data model and the context tree filter. After context tree 104 is populated with nodes from context tree providers 102, context tree 104 is provided as an output from context tree locator 100. In some embodiments, a builder is used to build an expression that requires data of a type to be used—for example, an expression of an application or service of a software system is built using context tree 104. Context tree 104 is built based at least in part on a data model and a context tree filter, where the context tree filter indicates a tailored version of the data model for the context tree that is consumed or produced by the expression. In various embodiments, the tailored version of the data model—for example, an instance of a context tree—is tailored for the expression by the context tree filter (e.g., a context tree that removes elements of the data model, includes all elements of a data model, includes referred to or linked to elements of other data models, etc.). A data model entry point is indicated that corresponds to the data of the type. In some embodiments, more than one context tree filters are submitted as input. In some embodiments, filters are order and a higher order filter takes precedence in the event of a conflict.


In some embodiments, when additional builds for expressions require additional filters, a context tree filter is added appropriate for a new context. In some embodiments, when the context tree filter is added a corresponding context tree provider is added to provide data contributions appropriate for the added context tree filter and associated data model.


In some embodiments, builder time and run time know the data model and the context in which it is being used. The expressions constructed based on context tree are evaluated during runtime which also understands the data model and the context. In some embodiments, the context tree provider is an abstraction for each implementation to provide their contribution to the context tree structure based on the data model and context tree filter. In some embodiments, a validation framework understands the context tree and has inherent capability to validate the expressions based on the context tree. In some embodiments, the context tree enables a mechanism and abstraction between the data model and the consumers of the data model during both build time and run time, and provides a data exchange schema for various participants.



FIG. 1B is a block diagram illustrating an embodiment of populating a context tree instance. In the example shown, context tree instance 108 (e.g., an expression generated instance of a context tree) is referred to by a runtime system. Context tree instance 108 populates the data fields of the instance by polling context data providers 106. Context data providers 106 provide data to populate context tree instance 108 by retrieving data from a memory or repository as indicated by the context tree instance. For example, a context data provider (e.g., one of context data providers 106) understands a context tree (e.g., context tree instance 108) and the context and know how to fetch the data.



FIGS. 2A and 2B are block diagrams illustrating embodiments of context trees. In the example shown in FIG. 2A, business object “Customer” has two attributes “firstname” and “lastname”. If the context tree filter is “customer created event”, then the context tree is as shown in FIG. 2A. In the example shown in FIG. 2B, business object “Customer” has two attributes “firstname” and “lastname”. In some embodiments, the context tree filter indicates that the context tree include the two attributes of the object. If the context tree filter is “customer updated”, then the context tree is as shown in FIG. 2B. In some embodiments, the context tree filter indicates that the context tree includes a set of the two attributes of the updated object (e.g., customer first name and last name) and a copy of the previous object (e.g., customer previous first name and previous last name). The nodes for both customer and oldcustomer are available and visible, where oldcustomer has the old values of the customer before the update has occurred. Any expressions created from the context—for example, “event.old_customer.firstname==‘Joe’” will be understood during runtime by the expression validation and evaluation. In some embodiments, the validation framework looks at the expression and sees if it complies with the context tree hierarchy (e.g., the context tree includes the previous first name and previous last name—such as “event.old_customer.firstname” and “event.old_customer.lastname”, but is not based on the “customer updated” context tree filter—the validation will fail). In some embodiments, the validation framework determines whether the expression is consistent with the context tree; in the event that the expression and context tree are not consistent, then the validation framework indicates that the expression is not consistent with the context tree (e.g., validation fails); in the event that the expression and the context tree are consistent, then the validation framework indicates that the expression is consistent with the context tree (e.g., validation passes). In the event that the validation has failed (or has been indicated an inconsistency), then the expression is indicated to have a flaw and is not allowed to execute. In the event that the validation has passed (or has been indicated to be consistent), then the expression is indicated to not be flawed for the consistency check with the context tree and is allowed to execute.



FIG. 3A is a block diagram illustrating an embodiment of a data model. In the example shown, the data model is a customer data model that includes data fields “Firstname” and “Lastname”. It also includes a relation to “Homeloan”. Homeloan has data fields that include “LoanID” and “Homeaddress”. In some embodiments, the Homeloan is a data model and the data fields are specified in the Homeloan data model. In some embodiments, the relation in a data model is a link or reference to another data model. In some embodiments, there are links or references to other data models. In some embodiments, a data model includes other relation like links that are specific to those data models. Also, a data model entry point 300 is shown to the data model (e.g., a pointer or other indicator enabling access to a data model).



FIG. 3B is a block diagram illustrating an embodiment of a context tree instance. In the example shown, context tree instance for customer shows only the data fields. In this case, as an example, a context tree locator was called with inputs of a data model entry point (e.g., entry point 300 of FIG. 3A) and a context tree filter. The context tree filter indicates that the context tree should include only the data fields “Firstname” and “Lastname”—Carl and Smith, respectively. The context tree instance data was populated by context data providers appropriately populating data fields of the instance.



FIG. 4A is a block diagram illustrating an embodiment of a data model. In the example shown, the data model is an employee data model that includes data fields “First name” and “Last name” and relations to “Manager”. “Manager” includes data fields of “First name” and “Last name”. Also shown is employee data model entry point, entry point 400.



FIG. 4B is a block diagram illustrating an embodiment of a context tree instance. In the example shown, context tree instance for employee shows data fields and relations. In this case, as an example, a context tree locator was called with inputs of a data model entry point (e.g., entry point 400 of FIG. 4A) and a context tree filter. The context tree filter indicates that the context tree should include the data fields “Firstname” and “Lastname”—Carl and Smith, respectively—and relations manager “David” and “Jones”. The context tree instance data was populated by context data providers appropriately populating data fields of the instance. Notice that in this case, a manager is also an employee. So, the context tree instance can be configured (e.g., by the context tree filter, by the expression, by the process, etc.) to show, in various embodiments, no relations, a first level of relations, a second level of relations, or n-levels of relations, up to the end of the relations, levels on request (e.g., from the process or expression), or any other appropriate levels. In various embodiments, links or references to other data models are not followed by context data providers, are followed to a first level of link or reference to populate a context tree instance, are followed to a second level of link or reference, are followed to n-levels of link or reference to populate a context tree instance, are up to an end of links or references, up to a requested level of links or references, or any other appropriate level.



FIG. 4C is a block diagram illustrating an embodiment of a context tree instance. In the example shown, context tree instance for employee shows data fields and relations. In this case, as an example, a context tree locator was called with inputs of a data model entry point (e.g., entry point 400 of FIG. 4A) and a context tree filter. The context tree filter indicates that the context tree should include the data fields “Firstname” and “Lastname”—Carl and Smith, respectively—and relations manager “David” and “Jones”, and relations manager of the manager “Paul” and “Honcho”.



FIG. 5 is a flow diagram illustrating an embodiment of a process for utilizing a context tree. In the example shown, in 500 a context tree is built for a specific data model type with a context tree filter. For example, a context tree is built for a specific data model type with a specific filter (e.g., a context tree for “customer” is built with filter “customer updated”). In 502, an expression is built based on the context tree is evaluated using context tree data providers. For example, a context tree instance is generated and populated.



FIG. 6 is a flow diagram illustrating an embodiment of a process for building a context tree. In some embodiments, the process of FIG. 6 is used to implement 500 of FIG. 5. In the example shown, a data model entry point is received. For example, the data model entry point is received via an interface. In 602, context filter(s) is/are received. For example, the context filter(s) is/are received via an interface. In 604, context tree is determined based on the context filter(s) and the data model entry point from any provider that has appropriate context tree information. For example, the provider is a context tree provider. In 606, the context tree is provided. For example, the context tree is provided via an interface.



FIG. 7 is a flow diagram illustrating an embodiment of a process for determining context tree data. In some embodiments, the process of FIG. 7 is used to implement 604 of FIG. 6. In the example shown, in 700 a first context tree provider is selected. In 702, it is determined whether there is any context tree information to provide. In the event that there is any context tree information to provide, in 706 context tree information from the provider is added and control passes to 704. In the event that there is not any context tree information to provide, in 704 it is determined whether there are more context tree providers. In the event that there are not any more context tree providers, the process ends. In the event that there are more context tree providers, a next contact tree provider is selected and control passes to 700.



FIG. 8 is a flow diagram illustrating an embodiment of a process for using a context tree during run time. In some embodiments, the process of FIG. 8 is used to implement 502 of FIG. 5. In the example shown, in 800 an indication is received to get data of a type. For example, an indication is received based on an expression built on the context tree. In 802, a context is received based at least in part on a client. In 804, a context tree instance is determined based on a data model associated with the data of the type and the context filter. In 806, the context tree instance is provided.



FIG. 9 is a flow diagram illustrating an embodiment of a process for determining a context tree instance. In some embodiments, the process of FIG. 9 is used to implement 804 of FIG. 8. In the example shown, in 900 a first context data provider is selected. In 902, it is determined whether there is any context tree data to provide. In the event that there is context data to provide, then in 906 context tree data is added from the provider. For example, the context tree data fields are filled with values received from the provider. Control passes to 904. In the event that there is no context data to provide, then in 904 it is determined whether there are more context data providers. In the event that there are no more context data providers, then the process ends. In the event that there are more context data providers, then in 908 select a next context data providers.


Although the foregoing embodiments have been described in some detail for purposes of clarity of understanding, the invention is not limited to the details provided. There are many alternative ways of implementing the invention. The disclosed embodiments are illustrative and not restrictive.

Claims
  • 1. A system for providing context tree data, comprising: an interface which is a context tree locator configured to receive a data model entry point and at least one context filter,wherein the data model entry point is an indicator that enables access to a first data model and includes data of one or more types required by an expression or process,wherein the at least one context filter is configured to modify one or more elements of the first data model to provide a second data model that is different from the first data model, wherein the at least one context filter uses data from the data model entry point to provide a context tree that uses the second data model; andone or more hardware processors coupled to a memory containing instructions which when executed by the one or more hardware processors cause the one or more hardware processors to:poll a plurality of context tree providers to determine if any of the context tree providers have any contributions of context tree data;generate the context tree based on the at least one context filter, the data model entry point and the contributions of context tree data from the polled context tree providers, wherein the context tree has the second data model and includes data types of the data model entry point;provide to the expression or process one or more instances of the context tree which are populated with the contributions of context tree data received from the polled context tree providers.
  • 2. The system of claim 1, wherein to determine the context tree data from the plurality of context tree providers comprises: selecting a first context tree provider;determining whether there is context tree data to provide from the first context tree provider;in the event there is context tree data to provide from the first context tree provider, adding data from the first context tree provider to context tree data fields; andin the event there is no context tree data to provide from the first context tree provider, selecting a next context tree provider.
  • 3. The system of claim 1, wherein to determine the context tree data from the plurality of context tree providers comprises determining at least one of the plurality of context tree providers that comprise a data model that is consistent with the second data model required by the expression.
  • 4. The system of claim 1, wherein the one or more hardware processors are further configured to generate a context tree instance.
  • 5. The system of claim 1, wherein at least one context data provider follows a link or a reference to another data model associated with the one or more instances of the context tree.
  • 6. The system of claim 1, wherein at least one context data provider follows n-levels of links or references to other data models associated with the one or more instances of the context tree.
  • 7. The system of claim 1, wherein the context tree data is associated with a context tree.
  • 8. The system of claim 7, wherein the context tree is generated using a builder.
  • 9. The system of claim 8, wherein the process or the expression is executed using the context tree.
  • 10. The system of claim 1, wherein a context tree corresponding to the context tree data includes at least one attribute data field.
  • 11. The system of claim 1, wherein a context tree corresponding to the context tree data includes at least one relation data field.
  • 12. The system of claim 1, wherein determining context tree data includes omitting from the context tree data one or more elements that are in the first data model as indicated by the second data model, and wherein the one or more omitted elements include attributes or relations from the first data model.
  • 13. The system of claim 1, wherein determining context tree data includes including in the context tree data one or more elements that are not in the first data model as indicated by the second data model, and wherein the one or more included elements include attributes or relations from other data models that are referred to or linked to by the first data model.
  • 14. The system of claim 1, wherein the one or more hardware processors are further configured to validate an expression based at least in part on the context tree data.
  • 15. The system of claim 14, wherein validation comprises determining whether the expression is consistent with the context tree data.
  • 16. The system of claim 15, wherein in the event that the expression is not consistent with the context tree data, then it is indicated that the validation fails, and wherein in the event that the expression is consistent with the context tree data, then it is indicated that the validation passes.
  • 17. The system of claim 15, wherein the determining whether the expression is consistent with the context tree data comprises determining whether the expression complies with a context tree hierarchy.
  • 18. The system of claim 1, wherein the context tree data comprises data from a plurality of levels of a context tree hierarchy based on one or more relations among data from the plurality of levels of the context tree hierarchy.
  • 19. A method of providing context tree data, comprising: receiving, by one or more processors, a data model entry point and a context filter, wherein the data model entry point is an indicator that enables access to a first data model and includes data of one or more types required by an expression or process, and wherein the context filter is configured to modify one or more elements of the first data model to provide a second data model that is different from the first data model, wherein the context filter uses data from the data model entry point to provide a context tree that uses the second data model;polling, by the one or more processors, a plurality of context tree providers to determine if any of the context tree providers have any contributions of context tree data;generating, by the one or more processors, the context tree based on the context filter, the data model entry point and the contributions of context tree data from the polled context tree providers, wherein the context tree has the second data model and includes data types of the data model entry point;providing to the expression or process, by the one or more processors, one or more instances of the context tree which are populated with the contributions of context tree data received from the polled context tree providers.
  • 20. A non-transitory computer-readable storage medium storing instructions corresponding to computer program product for providing context tree data, wherein in the event that the instructions are executed by one or more hardware processors, the instructions cause the one or more hardware processors to: receive a data model entry point and a context filter, wherein the data model entry point is an indicator that enables access to a first data model and includes data of one or more types required by an expression or process, and wherein the context filter is configured to modify one or more elements of the first data model to provide a second data model that is different from the first data model, wherein the context filter uses data from the data model entry point to provide a context tree that uses the second data model;poll a plurality of context tree providers to determine if any of the context tree providers have any contributions of context tree data;generate the context tree based on the at least one context filter, the data model entry point and the contributions of context tree data from the polled context tree providers, wherein the context tree has the second data model and includes data types of the data model entry point;provide to the expression or process one or more instances of the context tree which are populated with the contributions of context tree data received from the polled context tree providers.
CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of, and claims a benefit of priority under 35 U.S.C. 120 of the filing date of U.S. patent application Ser. No. 15/221,426, filed Jul. 27, 2016, issued as U.S. Pat. No. 10,331,643, entitled “GENERATING CONTEXT TREE DATA BASED ON A TAILORED DATA MODEL,” which is a continuation of, and claims a benefit of priority under 35 U.S.C. 120 of the filing date of U.S. patent application Ser. No. 13/626,199, filed Sep. 25, 2012, now issued as U.S. Pat. No. 9,430,548, entitled “GENERATING CONTEXT TREE DATA BASED ON A TAILORED DATA MODEL”, the entire contents of which are hereby expressly incorporated by reference for all purposes.

US Referenced Citations (135)
Number Name Date Kind
5537618 Boulton et al. Jul 1996 A
6028602 Weidenfeller Feb 2000 A
6154750 Roberge Nov 2000 A
6513059 Gupta et al. Jan 2003 B1
6564251 Katariya et al. May 2003 B2
6750883 Parupudi et al. Jun 2004 B1
6976211 Lection et al. Dec 2005 B2
7076243 Parupudi et al. Jul 2006 B2
7165080 Kotcheff et al. Jan 2007 B2
7483944 Parupudi et al. Jan 2009 B2
7624009 Seroussi et al. Nov 2009 B2
7734625 Weinberg et al. Jun 2010 B2
7814110 Anelle et al. Oct 2010 B2
7844640 Bender Nov 2010 B2
7899833 Stevens et al. Mar 2011 B2
7917815 Rapp et al. Mar 2011 B2
7991788 Dettinger Aug 2011 B2
8015541 Srinivasan et al. Sep 2011 B1
8028239 Al-Hilali Sep 2011 B1
8230384 Krishnan et al. Jul 2012 B1
8261194 Billiard Sep 2012 B2
8280873 Brewer et al. Oct 2012 B1
8290966 Vignet Oct 2012 B2
8635594 Krishnan et al. Jan 2014 B1
8670544 Tovino Mar 2014 B2
8849870 Sathish Sep 2014 B2
8874593 Unger et al. Oct 2014 B2
9285800 Plache et al. Mar 2016 B2
9430548 Jakumar et al. Aug 2016 B1
9760067 Havlena Sep 2017 B2
10331643 Jakumar et al. Jun 2019 B2
20010003455 Grobler Jun 2001 A1
20010049671 Joerg Dec 2001 A1
20020059003 Ruth et al. May 2002 A1
20020107828 Harvey Aug 2002 A1
20020116454 Dyla et al. Aug 2002 A1
20020123986 Leathers Sep 2002 A1
20030061015 Ben-Gal et al. Mar 2003 A1
20030069737 Koubenski et al. Apr 2003 A1
20030132853 Ebert Jul 2003 A1
20030139968 Ebert Jul 2003 A1
20030212698 Mani et al. Nov 2003 A1
20040059802 Jacquemot et al. Mar 2004 A1
20040060003 Mani et al. Mar 2004 A1
20040060004 Mani et al. Mar 2004 A1
20040111389 Pudipeddi et al. Jun 2004 A1
20040158455 Spivack et al. Aug 2004 A1
20040158575 Jacquemot et al. Aug 2004 A1
20040230557 Bales Nov 2004 A1
20040230947 Bales Nov 2004 A1
20040260695 Brili Dec 2004 A1
20040268295 Culter Dec 2004 A1
20050020307 Parupudi Jan 2005 A1
20050022129 Borenstein et al. Jan 2005 A1
20050131927 Fildebrandt et al. Jun 2005 A1
20050268277 Reeder et al. Dec 2005 A1
20060069717 Mamou et al. Mar 2006 A1
20060031118 Morris et al. Apr 2006 A1
20060074879 Covington et al. Apr 2006 A1
20060100797 Poorman et al. May 2006 A1
20060294089 Devost et al. Dec 2006 A1
20070035398 Vesel Feb 2007 A1
20070038601 Guha Feb 2007 A1
20070050343 Siddaramappa et al. Mar 2007 A1
20070050708 Gupta et al. Mar 2007 A1
20070075995 Reichard Apr 2007 A1
20070079257 Vignet Apr 2007 A1
20070083933 Venkatapathy et al. Apr 2007 A1
20070094060 Apps et al. Apr 2007 A1
20070226187 Beatty Sep 2007 A1
20070234277 Lei et al. Oct 2007 A1
20070239508 Fazal et al. Oct 2007 A1
20070290815 Delis Dec 2007 A1
20080016182 Sathish et al. Jan 2008 A1
20080077613 Hay Mar 2008 A1
20080120129 Seubert May 2008 A1
20080126027 Altenhofen May 2008 A1
20080133586 Sathish et al. Jun 2008 A1
20080148231 Weber Jun 2008 A1
20080155432 Anelle et al. Jun 2008 A1
20080294596 Xiong et al. Nov 2008 A1
20090024426 Chang et al. Jan 2009 A1
20090037832 Falchuk et al. Feb 2009 A1
20090063213 Benayon et al. Mar 2009 A1
20090089078 Bursey Apr 2009 A1
20090089740 Crisman Apr 2009 A1
20090106732 Hanson et al. Apr 2009 A1
20090112922 Barinaga Apr 2009 A1
20090157587 Lim et al. Jun 2009 A1
20090172602 Chusing et al. Jul 2009 A1
20090172648 Gerginov et al. Jul 2009 A1
20090187552 Pinel Jul 2009 A1
20090222789 Frank et al. Sep 2009 A1
20090222793 Frank et al. Sep 2009 A1
20090222795 Frank et al. Sep 2009 A1
20090254574 De et al. Oct 2009 A1
20090282385 Boland et al. Nov 2009 A1
20090287670 Hou et al. Nov 2009 A1
20090300646 Wagner et al. Dec 2009 A1
20090322756 Robertson et al. Dec 2009 A1
20100058113 Rapp et al. Mar 2010 A1
20100153149 Prigge Jun 2010 A1
20100153150 Prigge Jun 2010 A1
20100161101 Pouyez et al. Jun 2010 A1
20110060424 Havlena Mar 2011 A1
20110083162 Sathish Apr 2011 A1
20110093815 Gobeil Apr 2011 A1
20110093818 Sathish Apr 2011 A1
20110125743 Immonen May 2011 A1
20110153624 Aigner et al. Jun 2011 A1
20110225526 Baret et al. Sep 2011 A1
20110131049 Sathish Dec 2011 A1
20120016880 Abrahams Jan 2012 A1
20120041979 Lee Feb 2012 A1
20120054226 Cao et al. Mar 2012 A1
20120095734 Moll Apr 2012 A1
20120233533 Yucel Sep 2012 A1
20120246105 James Sep 2012 A1
20120266074 Bhoovaraghavan et al. Oct 2012 A1
20120323956 Dumitru et al. Dec 2012 A1
20130024508 Sathish et al. Jan 2013 A1
20130041914 Hadlock et al. Feb 2013 A1
20130061161 Schwartz et al. Mar 2013 A1
20130080641 Lui et al. Mar 2013 A1
20130086040 Patadia et al. Apr 2013 A1
20130159036 Keil Jun 2013 A1
20130159063 Fessler et al. Jun 2013 A1
20130159964 Szpak Jun 2013 A1
20130173657 James et al. Jul 2013 A1
20130187953 Matsumura et al. Jul 2013 A1
20140006868 Grey et al. Jan 2014 A1
20140033089 Nos et al. Jan 2014 A1
20140046694 White Feb 2014 A1
20140359422 Bassett, Jr. et al. Dec 2014 A1
20160335301 Jakumar et al. Nov 2016 A1
Non-Patent Literature Citations (8)
Entry
Office Action issued for U.S. Appl. No. 13/626,199, dated Nov. 19, 2013, 21 pages.
Office Action issued for U.S. Appl. No. 13/626,199, dated Apr. 2, 2015, 18 pages.
Office Action issued for U.S. Appl. No. 13/626,199, dated Nov. 16, 2015, 28 pages.
Nguyen et al., “Context Tree Maximizing Reinforcement Learning”, In Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, pp. 1075-1082, 2012.
Notice of Allowance issued for U.S. Appl. No. 13/626,199, dated May 5, 2016, 20 pages.
Office Action issued for U.S. Appl. No. 15/221,426, dated Apr. 16, 2018, 30 pages.
Office Action issued for U.S. Appl. No. 15/221,426, dated Sep. 26, 2018, 27 pages.
Notice of Allowance issued for U.S. Appl. No. 15/221,426, dated Feb. 5, 2019, 19 pages.
Related Publications (1)
Number Date Country
20190272263 A1 Sep 2019 US
Continuations (2)
Number Date Country
Parent 15221426 Jul 2016 US
Child 16418479 US
Parent 13626199 Sep 2012 US
Child 15221426 US