Notice of Pre-AIA or AIA Status
The present application, filed on or after March 16, 2013, is being examined under the first inventor to file provisions of the AIA .
DETAILED ACTION
Applicant’s Application filed on 03/07/2025 has been reviewed.
Claims 1-13, 30-46 have been examined.
Claims 14-29 and 47-58 have been canceled.
Notice of Pre-AIA or AIA Status
In the event the determination of the status of the application as subject to AIA 35 U.S.C. 102 and 103 (or as subject to pre-AIA 35 U.S.C. 102 and 103) is incorrect, any correction of the statutory basis for the rejection will not be considered a new ground of rejection if the prior art relied upon, and the rationale supporting the rejection, would be the same under either status.
Double Patenting
The nonstatutory double patenting rejection is based on a judicially created doctrine grounded in public policy (a policy reflected in the statute) so as to prevent the unjustified or improper timewise extension of the “right to exclude” granted by a patent and to prevent possible harassment by multiple assignees. A nonstatutory double patenting rejection is appropriate where the claims at issue are not identical, but at least one examined application claim is not patentably distinct from the reference claim(s) because the examined application claim is either anticipated by, or would have been obvious over, the reference claim(s). See, e.g., In re Berg, 140 F.3d 1428, 46 USPQ2d 1226 (Fed. Cir. 1998); In re Goodman, 11 F.3d 1046, 29 USPQ2d 2010 (Fed. Cir. 1993); In re Longi, 759 F.2d 887, 225 USPQ 645 (Fed. Cir. 1985); In re Van Ornum, 686 F.2d 937, 214 USPQ 761 (CCPA 1982); In re Vogel, 422 F.2d 438, 164 USPQ 619 (CCPA 1970); and In re Thorington, 418 F.2d 528, 163 USPQ 644 (CCPA 1969).
A timely filed terminal disclaimer in compliance with 37 CFR 1.321(c) or 1.321(d) may be used to overcome an actual or provisional rejection based on a nonstatutory double patenting ground provided the reference application or patent either is shown to be commonly owned with this application, or claims an invention made as a result of activities undertaken within the scope of a joint research agreement. See MPEP § 717.02 for applications subject to examination under the first inventor to file provisions of the AIA as explained in MPEP § 2159. See MPEP §§ 706.02(l)(1) - 706.02(l)(3) for applications not subject to examination under the first inventor to file provisions of the AIA . A terminal disclaimer must be signed in compliance with 37 CFR 1.321(b).
The USPTO Internet website contains terminal disclaimer forms which may be used. Please visit www.uspto.gov/forms/. The filing date of the application in which the form is filed determines what form (e.g., PTO/SB/25, PTO/SB/26, PTO/AIA /25, or PTO/AIA /26) should be used. A web-based eTerminal Disclaimer may be filled out completely online using web-screens. An eTerminal Disclaimer that meets all requirements is auto-processed and approved immediately upon submission. For more information about eTerminal Disclaimers, refer to http://www.uspto.gov/patents/process/file/efs/guidance/eTD-info-I.jsp.
Claims 1-13, 30-46 are rejected on the ground of nonstatutory obviousness-type double patenting as being unpatentable over claims 1-32, of U.S. Patent No. 12386899. Although the conflicting claims are not identical, they are not patentably distinct from each other because the claimed features of the claims 1-32 of the Patent No. 12386899 can also be interpreted as claimed features as claimed in the claims 1-13, 30-46 of the present application.
Further, it would have been obvious to a person of ordinary skill in the art at the time the invention was made to modify or to omit the additional elements of claims 1-32 of the Patent No. 12386899 to arrive at the claims 1-13, 30-46 of the instant application because the person would have realized that the remaining element would perform the same functions as before. “Omission of element and its function in combination is obvious expedient if the remaining elements perform same functions as before.” See In re Karlson (CCPA) 136 USPQ 184, decide Jan 16, 1963, Appl. No. 6857, U. S. Court of Customs and Patent Appeals.
Claim comparison: Claimed subject matter are in paralleled for the purpose of comparison
Present Application
U.S. Patent No. 12386899
1. (Currently Amended) A method for access management in an executable graph-based model, the executable graph-based model comprising a plurality of nodes and an overlay structure comprising processing logic, the overlay structure associated with one or more executable nodes of the plurality of nodes, the method comprising: determining, by processing circuitry, a first node group of the executable graph- based model, the first node group comprising at least one node, wherein the first node group has private scope; associating, by the processing circuitry, a first contract with the first node group such that the first contract is configured to act as a proxy for one or more nodes within the first node group in relation to requests from outside the first node group, wherein the first node group comprises at least one of a group comprising:(ii) public node having public scope such that the public node is not accessible from outside of the first node group and the first contract acts as a proxy for the public node in relation to requests from outside of the first node group, ii) a private node having private scope such that the private node is not accessible from outside of the first node group, and (iii)a protected node having protected scope such that the protected node is only accessible to nodes outside of the first node group which are inherited from the protected node and nodes within a second node group which is inherited from the first node group; receiving, by the processing circuitry, a stimulus and a context associated therewith, wherein the stimulus is associated with the first contract; in response to the stimulus being received, mapping, by the processing circuitry, the stimulus to the first contract to determine an access response; and processing, by the processing circuitry, the stimulus based on the access response.
2. (Original) The method of claim 1 wherein the first contract is a node of the executable graph-based model.
3. (Original) The method of claim 2 wherein the first contract is an executable node of the executable graph-based model, the executable node comprising a first overlay.
4. (Original) The method of claim 3 wherein the first overlay includes processing logic operable to define one or more security privileges of the first contract, the one or more security privileges of the first contract including a list of users that have permission to access the first contract.
5. (Currently Amended) The method of claim 4 wherein the one or more security privileges of the first contract include a list of one or more access rights for users permitted to access the first contract.
6. (Currently Amended) The method of claim 4 wherein the access response is determined according to the one or more security privileges of the first contract and the context associated with the stimulus.
7. (Original) The method of claim 6 wherein the access response comprises a rejection notification when the access response is indicative of access to the first contract being denied based on the context.
8. (Original) The method of claim 6 wherein the access response comprises an acceptance notification when the access response is indicative of access to the first contract being approved based on the context.
9. (Original) The method of claim 8 wherein the step of processing the stimulus further comprises: when the access response comprises the acceptance notification, providing, by the processing circuitry, access to the first contract.
10. (Original) The method of claim 9 further comprising: generating, by the processing circuitry, an outcome in accordance with access to the first contract being provided; and outputting, by the processing circuitry, the outcome.
11. (Original) The method of claim 1 wherein each node in the executable graph-based model comprises a scope of a predetermined plurality of scopes.
12. (Original) The method of claim 11 wherein one or more nodes in the executable graph-based model comprise one or more attributes each having a corresponding scope of the predetermined plurality of scopes.
13. (Original) The method of claim 11 wherein the predetermined plurality of scopes includes public scope, private scope, and protected scope.
30. (Currently Amended) The method of claim 1 wherein the first node group comprises the public node, and wherein the public node comprises comprising at least one public attribute having public scope such that the first contract is configured to act as a proxy for the at least one public attribute of the public node.
31. (Original) The method of claim 30 wherein the first contract comprises a proxy attribute mapped to the at least one public attribute of the public node via a respective node attribute mapping.
32. (Original) The method of claim 30 wherein the public node comprises a plurality of attributes such that the at least one public attribute associated with the first contract is part of a subset of the plurality of attributes.
33. (Original) The method of claim 30 wherein the at least one public attribute is accessible to nodes within the first node group.
34. (Currently Amended) The method of claim 1 wherein the first node group comprises the public node, and wherein the public node comprises comprising at least one protected attribute having protected scope such that the at least one protected attribute is only accessible to the public node and nodes which are inherited from the public node.
35. (Currently Amended) The method of claim 1 wherein the first node group comprises the private node, and wherein the private node comprises comprising at least one public attribute having public scope such that the at least one public attribute is only accessible to nodes within the first node group.
36. (Currently Amended) The method of claim 1 wherein the first node group comprises the private node, and wherein the private node comprises comprising at least one protected attribute having protected scope such that the at least one protected attribute is only accessible to the private node and nodes within the first node group which are inherited from the private node.
37. (Currently Amended) The method of claim 1 wherein the first node group comprises the protected node, and wherein the protected node comprises comprising at least one public attribute having public scope such that the at least one public attribute is only accessible to nodes within the first node group and nodes inherited from the protected node.
38. (Currently Amended) The method of claim 1 wherein the first node group comprises the protected node, and wherein the protected node comprises comprising at least one protected attribute having protected scope such that the at least one protected attribute is only accessible to the protected node and nodes which are inherited from the protected node.
39. (Original) The method of claim 1 wherein the first node group comprises a node comprising at least one private attribute having private scope such that the at least one private attribute is not accessible from outside of the node.
40. (Currently Amended) The method of claim 1 wherein the first node group comprises a second contract associated with the second node group.
41. (Original) The method of claim 40 wherein the first contract is configured to act as a proxy for the second contract in relation to requests from outside the first node group.
42. (Original) The method of claim 1 wherein the first contract comprises a contract behavior.
43. (Original) The method of claim 1 wherein the first node group is a container comprising an aggregation of nodes.
44. (Original) The method of claim 1 wherein the first node group is a graph comprising a hierarchical structure of nodes.
Claims 45, 46.
1. A method for access management in an executable graph-based model, the executable graph-based model comprising a plurality of nodes and an overlay structure comprising processing logic, the overlay structure associated with one or more executable nodes of the plurality of nodes, the method comprising: determining, by processing circuitry, a first node group of the executable graph-based model, the first node group comprising at least one node, wherein the first node group has public scope; associating, by the processing circuitry, a first contract with the first node group such that the first contract is configured to act as a proxy for one or more nodes within the first node group in relation to requests from outside the first node group, wherein the first node group comprises at least one of a group comprising: (i) a private node having private scope such that the private node is not accessible from outside of the first node group, and (ii) a protected node having protected scope such that the protected node is only accessible to nodes inherited from the protected node and nodes within a second node group which is inherited from the first node group; receiving, by the processing circuitry, a stimulus and a context associated therewith, wherein the stimulus is associated with the first contract; in response to the stimulus being received, mapping, by the processing circuitry, the stimulus to the first contract to determine an access response; and processing, by the processing circuitry, the stimulus based on the access response.
16. The method of claim 1 wherein the first node group further comprises a public node comprising at least one public attribute having public scope such that the first contract is configured to act as a proxy for the at least one public attribute of the public node.
17. The method of claim 16 wherein the first contract comprises a proxy attribute mapped to the at least one public attribute of the public node via a respective node attribute mapping.
2. The method of claim 1 wherein the first contract is a node of the executable graph-based model.
3. The method of claim 2 wherein the first contract is an executable node of the executable graph-based model, the executable node comprising a first overlay.
4. The method of claim 3 wherein the first overlay includes processing logic operable to define one or more security privileges of the first contract, the one or more security privileges of the first contract including a list of users that have permission to access the first contract.
5. The method of claim 4 wherein the one or more security privileges of the first contract include a list of one or more access rights for users permitted to access the first contract.
6. The method of claim 4 wherein the access response is determined according to the one or more security privileges of the first contract and the context associated with the stimulus.
7. The method of claim 6 wherein the access response comprises a rejection notification when the access response is indicative of access to the first contract being denied based on the context.
8. The method of claim 6 wherein the access response comprises an acceptance notification when the access response is indicative of access to the first contract being approved based on the context.
9. The method of claim 8 wherein the step of processing the stimulus further comprises: when the access response comprises the acceptance notification, providing, by the processing circuitry, access to the first contract.
10. The method of claim 9 further comprising: generating, by the processing circuitry, an outcome in accordance with access to the first contract being provided; and outputting, by the processing circuitry, the outcome.
11. The method of claim 1 wherein each node in the executable graph-based model comprises a scope of a predetermined plurality of scopes.
12. The method of claim 11 wherein one or more nodes in the executable graph-based model comprise one or more attributes each having a corresponding scope of the predetermined plurality of scopes.
13. The method of claim 11 wherein the predetermined plurality of scopes include public scope, private scope, and protected scope.
16. The method of claim 1 wherein the first node group further comprises a public node comprising at least one public attribute having public scope such that the first contract is configured to act as a proxy for the at least one public attribute of the public node.
17. The method of claim 16 wherein the first contract comprises a proxy attribute mapped to the at least one public attribute of the public node via a respective node attribute mapping.
18. The method of claim 16 wherein the public node comprises a plurality of attributes such that the at least one public attribute associated with the first contract is part of a subset of the plurality of attributes.
19. The method of claim 16 wherein the at least one public attribute is accessible to nodes within the first node group.
20. The method of claim 1 wherein the first node group further comprises a public node comprising at least one protected attribute having protected scope such that the at least one protected attribute is only accessible to the public node and nodes which are inherited from the public node.
21. The method of claim 1 wherein the first node group comprises the private node, and wherein the private node comprises at least one public attribute having public scope such that the at least one public attribute is only accessible to nodes within the first node group.
22. The method of claim 1 wherein the first node group comprises the private node, and wherein the private node comprises at least one protected attribute having protected scope such that the at least one protected attribute is only accessible to the private node and nodes within the first node group which are inherited from the private node.
23. The method of claim 1 wherein the first node group comprises the protected node, and wherein the protected node comprises at least one public attribute having public scope such that the at least one public attribute is only accessible to nodes within the first node group and nodes inherited from the protected node.
24. The method of claim 1 wherein the first node group comprises the protected node, and wherein the protected node comprises at least one protected attribute having protected scope such that the at least one protected attribute is only accessible to the protected node and nodes which are inherited from the protected node.
25. The method of claim 1 wherein the first node group comprises a node comprising at least one private attribute having private scope such that the at least one private attribute is not accessible from outside of the node.
26. The method of claim 1 wherein the first node group comprises a second contract associated with the second node group.
27. The method of claim 26 wherein the first contract is configured to act as a proxy for the second contract in relation to requests from outside the first node group.
28. The method of claim 1 wherein the first contract comprises a contract behavior.
29. The method of claim 1 wherein the first node group is a container comprising an aggregation of nodes.
30. The method of claim 1 wherein the first node group is a graph comprising a hierarchical structure of nodes.
Claim 1+16+17.
Conclusion
The prior art made of record and not relied upon is considered pertinent to applicant's disclosure.
U.S. Patent Application Publication No. 20220292092 to Brown et al. teaches a computing system for querying multiple data sources and a method therefor is provided. The computing system may comprise one or more nodes in communication with at least one data source of the multiple data sources to access data therefrom. The computing system may further comprise a second node in communication with the one or more nodes. The second node may be configured to receive a query instance and process the query instance to generate one or more relational query instances. The one or more relational query instances may be distributed among the one or more nodes to extract data from the at least one data source in communication therewith corresponding to the respective one or more relational query instances. The second node may be further configured to receive extracted data from each of the one or more nodes queried. The second node may be further configured to aggregate the extracted data…[0057]… Further, the application sub-net 306 may include a graph database 338 for providing metadata for processing the query (e.g., a semantic service may be used with a graph database for metadata or a graph database that stores metadata from the semantic service—the semantic service may be part of an NLP system). As shown, the application EQB node 330 may communicate directly with the graph database 338 and the client application 336 in processing the query. Further, the client application 336 may communicate with the graph database 338 in processing the query.[0061] The query base system 400 may also include an application client 410 to receive a query instance such as from a user (also, sometimes referred to as a user query). The query base system 400 may further include a graph database 412 that may contain metadata (e.g., ontology metadata for semantic functionality) for processing the user query. The graph database 412 may be used for semantic layer to interpret the query instance (e.g., natural language query instance). The master client node 406 may be configured to interact with the application client 410 as well as with the graph database 412… [0062] Further, the server node 408 may be configured to optimize the one or more relational query instances to distribute among one or more of the data sources 404 in communication therewith (e.g., optimize may mean use of statistics, histogram, and/or rules to find an optimal plan for distribution and execution of the relational query instances). The server node 408 may include proxy tables 416 and local cache tables 418. The proxy tables 416 (e.g., proxy tables/views) and the local cache tables 418 may include information to build a query plan for distribution of the relational query instances among one or more of the data sources 404….
U.S. Patent Application Publication No. 20220210061 to Simu et al. teaches systems, apparatus, devices, computer program products, and methods implementing aspects of a decentralized content fabric. In some implementations, one or more processors are configured to provide fabric nodes of an overlay network, including one or more fabric nodes that receive a client's request to access digital content on the overlay network. The request includes an authorization token digitally signed by or on behalf of a user of the client. The fabric node(s) extract a user identifier (ID) from the authorization token, then determine that one or more rules maintained on the overlay network are satisfied. The one or more rules condition access to the digital content upon the extracted user ID matching an ID associated with an owner of a digital instrument. The digital instrument, which can be a non-fungible token, is stored in a blockchain ledger as a unique representation of the digital content.
U.S. Patent Application Publication No. 20210390141 to Jacob et al. teaches data science and data analysis, computer software and systems, and wired and wireless network communications to provide an interface between repositories of disparate datasets and computing machine-based entities that seek access to the datasets, and, more specifically, to a computing and data storage platform that facilitates consolidation of one or more datasets, whereby a collaborative data layer and associated logic facilitate, for example, efficient access to, and implementation of, collaborative datasets. In some examples, a system may include an atomized workflow loader configured to receive an atomized dataset to load into a data store, and to determine resource requirements data to describe at least one resource requirement. The atomized workflow loader may be further configured to select a data store type based on a resource requirement, and perform a load operation of the atomized dataset as a function of the data store type.
U.S. Patent Application Publication No. 20180246988 to Johnson et al. teaches a database framework for representing complex heterogeneous characteristics of processes, systems, and systems of systems that feature many to many interrelationships. The homoiconic graph framework takes the form of an executable graph database, which is often faster for associative data sets, and maps more directly to object-oriented computer applications for large-scale operations. The invention provides a method to execute the graph database, in that the graph comprises nodes that are both data fragments and executable components. The graph is characterized as one or more homoiconic or executable graph frameworks, to distinguish this unique feature from the concept of a graph database, which generally is a repository of connected data only… [0012] The present invention includes a method for processing information, comprising: transforming the information into one or more homoiconic, reflective directed acyclic graphs, wherein the information comprises data and executable instructions embodied as entities; providing a user with a way to create one or more nodes in the one or more graphs, wherein the one or more nodes each have a set of executable instructions associated with them; providing the user with a way to connect a first graph of the one or more graphs to a second graph of the one or more graphs; providing the user with a way to assign the one or more nodes of the one or more graphs, using globally unique identifiers and strict rules, as apex nodes, top nodes, structure nodes, or leaf nodes; providing the user with a way to link the one or more nodes to each other using entity links and one or more of tree, plexus, or fabric structures; providing the user with a way to discover the capability of each of the nodes to connect with other nodes using discoverable entity interfaces and to connect nodes with other nodes using ephemeral entity links; providing the user with a way to execute the instructions associated with the one or more nodes, thereby processing the information; and displaying the results of executing the complex system in a form viewable by the user.
Contact Information
Any inquiry concerning this communication or earlier communications from the examiner should be directed to ANHTAI V TRAN whose telephone number is (571)270-5129. The examiner can normally be reached on Monday through Thursday from 8:00 AM to 4:00 PM.
Examiner interviews are available via telephone, in-person, and video conferencing using a USPTO supplied web-based collaboration tool. To schedule an interview, applicant is encouraged to use the USPTO Automated Interview Request (AIR) at http://www.uspto.gov/interviewpractice.
If attempts to reach the examiner by telephone are unsuccessful, the examiner’s supervisor, Charles Rones can be reached on (571)272-4085. The fax phone number for the organization where this application or proceeding is assigned is 571-273-8300.
Information regarding the status of an application may be obtained from the Patent Application Information Retrieval (PAIR) system. Status information for published applications may be obtained from either Private PAIR or Public PAIR. Status information for unpublished applications is available through Private PAIR only. For more information about the PAIR system, see http://pair-direct.uspto.gov. Should you have questions on access to the Private PAIR system, contact the Electronic Business Center (EBC) at 866-217-9197 (toll-free). If you would like assistance from a USPTO Customer Service Representative or access to the automated information system, call 800-786-9199 (IN USA OR CANADA) or 571-272-1000.
/ANHTAI V TRAN/Primary Examiner, Art Unit 2168