DETAILED ACTION
Notice of Pre-AIA or AIA Status
1. The present application, filed on or after March 16, 2013, is being examined under the first inventor to file provisions of the AIA .
Response to Amendment
2. Applicant's response filed 02 September 2025 has been considered and entered. Accordingly, claims 2-21 are pending in this application. Claims 2-21 are newly added; and claim 1 is cancelled.
Drawings
3. The drawings filed on 07/14/2025 are accepted by the examiner.
Information Disclosure Statement
4. The information disclosure statement (IDS) submitted on September 02, 2025, is in compliance with the provisions of 37 CFR 1.97. Accordingly, the information disclosure statement is being considered by the examiner.
Abstract
5. Applicant is reminded of the proper language and format for an abstract of the disclosure.
The abstract should be in narrative form and generally limited to a single paragraph on a separate sheet within the range of 50 to 150 words in length. The abstract should describe the disclosure sufficiently to assist readers in deciding whether there is a need for consulting the full patent text for details.
The language should be clear and concise and should not repeat information given in the title. It should avoid using phrases which can be implied, such as, “The disclosure concerns,” “The disclosure defined by this invention,” “The disclosure describes,” etc. In addition, the form and legal phraseology often used in patent claims, such as “means” and “said,” should be avoided.
The abstract contains the legal term “embodiment” and that it should be removed. It is suggested to add “aspect” instead of “embodiment”.
Double Patenting
6. 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 conflicting claims 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); 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 nonstatutory double patenting provided the reference application or patent either is shown to be commonly owned with the examined 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 § 2146 et seq. 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 filing of a terminal disclaimer by itself is not a complete reply to a nonstatutory double patenting (NSDP) rejection. A complete reply requires that the terminal disclaimer be accompanied by a reply requesting reconsideration of the prior Office action. Even where the NSDP rejection is provisional the reply must be complete. See MPEP § 804, subsection I.B.1. For a reply to a non-final Office action, see 37 CFR 1.111(a). For a reply to final Office action, see 37 CFR 1.113(c). A request for reconsideration while not provided for in 37 CFR 1.113(c) may be filed after final for consideration. See MPEP §§ 706.07(e) and 714.13.
The USPTO Internet website contains terminal disclaimer forms which may be used. Please visit www.uspto.gov/patent/patents-forms. The actual 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 www.uspto.gov/patents/apply/applying-online/eterminal-disclaimer.
7. Claims 2-21 are rejected on the ground of nonstatutory double patenting as being unpatentable over claims 1-3 and 5-20 of U.S. Patent No. 12360985. The subject matter claimed in the instant application is fully disclosed in the U.S. Patent No. 12360985 and is covered by the U.S. Patent No. 12360985 and the application are claiming common subject matter, as follows:
Instant Application - 19/268,706
U.S. Patent No. 12360985
2. (New) A method, comprising: receiving a set of change requests to one or more assets corresponding to one or more objects in a scene, the set of change requests corresponding to computations to be performed at least partially in parallel for the one or more assets; updating the one or more assets using a hash map associated with the computations by serially processing the set of change requests for individual entries in the hash map; and rendering a visualization of the scene depicting the one or more objects using the one or more updated assets.
1. A computer-implemented method, comprising: receiving a set of change requests for data in a dataset of assets, two or more change requests from the set of change requests received corresponding to computations to be performed at least partially in parallel for at least one asset of the dataset of assets; aggregating the two or more change requests, which comprise an indication of at least one change attempt, using a hash map associated with the computations; and updating the dataset of assets using the hash map by serially iterating through the two or more change requests for individual entries in the hash map.
3. (New) The method of claim 2, wherein at least one change request of the set of change requests is associated with environmental lighting for images depicting at least a portion of the scene and wherein the updating of the one or more assets further comprises: generating lighting information and a set of linked lists representing the set of change requests; and processing the set of linked lists to commit at least one change corresponding to the at least one change request to the hash map.
2. The computer-implemented method of claim 1, wherein the data is associated with environmental lighting for images and wherein the updating of the dataset of assets further comprises: generating lighting information and a set of linked lists of the set of change requests; and processing the set of linked lists to commit changes to the hash map.
4. (New) The method of claim 3, wherein the updating of the one or more assets further comprises: propagating the at least one change to the hash map to represent a coarse level of detail (LOD) in the hash map.
3. The computer-implemented method of claim 2, wherein the updating of the dataset of assets further comprises: propagating the changes to represent a coarse level of detail (LOD) in the hash map.
5. (New) The method of claim 2, further comprising aggregating the set of change requests, collectively representative of an indication of at least one change attempt, using a hash map associated with the computations.
1. A computer-implemented method, comprising: receiving a set of change requests for data in a dataset of assets, two or more change requests from the set of change requests received corresponding to computations to be performed at least partially in parallel for at least one asset of the dataset of assets; aggregating the two or more change requests, which comprise an indication of at least one change attempt, using a hash map associated with the computations; and updating the dataset of assets using the hash map by serially iterating through the two or more change requests for individual entries in the hash map.
6. (New) The method of claim 2, further comprising: generating a linked list representative of the set of change requests for the individual entries in the hash map, wherein the linked list comprises at least one index of related change requests of the set of change requests.
5. The computer-implemented method of claim 1, further comprising: generating a linked list of the two or more change requests for the individual entries in the hash map, wherein the linked list comprises indices of related change requests of the set of change requests.
7. (New) The method of claim 2, wherein the one or more assets represents world-space data.
6. The computer-implemented method of claim 1, wherein the dataset represents world-space data.
8. (New) The method of claim 7, wherein the world-space data is associated with environmental lighting for one or more images depicting at least a portion of the scene and the method further comprises: determining the set of change requests based at least in part on simulating light transport for a specified point of view of a virtual camera corresponding to a viewpoint of at least one image of the one or more images.
7. The computer-implemented method of claim 6, wherein the data is associated with environmental lighting for images and the computer-implemented method further comprises: determining the set of change requests based at least in part on simulating light transport for a specified point of view of a virtual camera which is responsible for generating at least one of the images.
9. (New) The method of claim 7, wherein the individual entries in the hash map correspond to cells comprised of the world-space data visible at one or more pixel locations.
8. The computer-implemented method of claim 6, wherein the individual entries in the hash map correspond to cells comprised of the world-space data visible through one or more pixel locations.
10. (New) The method of claim 2, wherein the one or more assets is generated using multiple parallel threads for at least one application of a group of applications comprising: an application implemented using a control system for an autonomous or semi- autonomous machine; an application implemented using a perception system for an autonomous or semi- autonomous machine; an application for performing simulation operations; an application for performing digital twin operations; an application for performing light transport simulation; an application for performing collaborative content creation for 3D assets; an application for performing deep learning operations; an application implemented using an edge device; an application for generating or presenting at least one of virtual reality content, augmented reality content, or mixed reality content; an application implemented using a robot; an application for performing conversational AI operations; an application for generating synthetic data; an application incorporating one or more virtual machines (VMs);an application implemented at least partially in a data center; or an application implemented at least partially using cloud computing resources.
9. The computer-implemented method of claim 1, where the dataset of assets is generated using multiple parallel threads for at least one application of a group of applications comprising: an application implemented using a control system for an autonomous or semi-autonomous machine; an application implemented using a perception system for an autonomous or semi-autonomous machine; an application for performing simulation operations; an application for performing digital twin operations; an application for performing light transport simulation; an application for performing collaborative content creation for 3D assets; an application for performing deep learning operations; an application implemented using an edge device; an application for generating or presenting at least one of virtual reality content, augmented reality content, or mixed reality content; an application implemented using a robot; an application for performing conversational AI operations; an application for generating synthetic data; an application incorporating one or more virtual machines (VMs); an application implemented at least partially in a data center; or an application implemented at least partially using cloud computing resources.
11. (New) The method of claim 2, wherein one or more of the individual entries comprises at least one unsigned integer checksum value and at least one unsigned integer.
10. The computer-implemented method of claim 1, wherein one or more of the individual entries comprises at least one unsigned integer checksum value and at least one unsigned integer.
12. (New) A system, comprising: one or more processors to: receive a set of change requests to one or more assets corresponding to one or more objects in a scene, the set of change requests received corresponding to computations to be performed at least partially in parallel for the one or more assets; update the one or more assets using a hash map associated with the computations by serially processing the set of change requests for individual entries in the hash map; and render a visualization of the scene depicting the one or more objects using the one or more updated assets.
16. A system, comprising: one or more processors to update a dataset of assets using a hash map by serially iterating through two or more change requests for data in the dataset of assets, wherein the two or more change requests comprise an indication of at least one change attempt and are aggregated based in part on being associated with computations to be performed at least partially in parallel for at least one asset in a dataset of assets.
13. (New) The system of claim 12, wherein at least one change request of the set of change requests is associated with environmental lighting for images depicting at least a portion of the scene and wherein the one or more processors are further to: generate lighting information and a set of linked lists of the set representing change requests, as part of the updating of the one or more assets; and process the set of linked lists to commit at least one change corresponding to the at least one change request to the hash map.
17. The system of claim 16, wherein the data is associated with environmental lighting for images and wherein the one or more processors are further to: generate lighting information and a set of linked lists of the set of change requests, as part of the updating of the dataset of assets; and process the set of linked lists to commit changes to the hash map.
14. (New) The system of claim 13, wherein the one or more processors are further to: propagate the at least one change to represent a coarse level of detail (LOD) in the hash map.
18. The system of claim 17, wherein the one or more processors are further to: propagate the changes to represent a coarse level of detail (LOD) in the hash map.
15. (New) The system of claim 12, wherein the individual entries in the hash map comprise a checksum value to identify colliding or unrelated points associated with a mapping of same entries.
19. The system of claim 16, wherein individual entries in the hash map comprise a checksum value to identify colliding or unrelated points associated with a mapping of same entries.
16. (New) The system of claim 12, wherein the one or more processors are further to: generate a linked list representative of the set of change requests for the individual entries in the hash map, wherein the linked list comprises at least one index of related change requests of the set of change requests.
20. The system of claim 16, wherein the one or more processors are further to: generate a linked list of the two or more change requests for individual entries in the hash map, wherein the linked list comprises indices of related change requests of the set of change requests.
17. (New) A processor comprising one or more logical units to render a visualization of a scene depicting one or more objects based on a set of change requests for one or more assets corresponding to the one or more objects, the set of change requests corresponding to computations to be performed at least partially in parallel for the one or more assets, the one or more assets being updated in a hash map being associated with the computations by serially processing the set of change requests for individual entries in the hash map.
11. A processor, comprising: one or more circuits to: receive a set of change requests for data in a dataset of assets, two or more change requests from the set of change requests received corresponding to computations to be performed at least partially in parallel for at least one asset of the dataset of assets; aggregate the two or more change requests, which comprise an indication of at least one change attempt, using a hash map associated with the computations; and update the dataset of assets using the hash map by serially iterating through the two or more change requests for individual entries in the hash map.
18. (New) The processor of claim 17, wherein the one or more logical units are further to: generate lighting information and a set of linked lists of the set of change requests, as part of the updating of the one or more assets; and process the set of linked lists to commit changes to the hash map.
12. The processor of claim 11, wherein the data is associated with environmental lighting for images and wherein the one or more circuits are further to: generate lighting information and a set of linked lists of the set of change requests, as part of the updating of the dataset of assets; and process the set of linked lists to commit changes to the hash map.
19. (New) The processor of claim 18, wherein the one or more processors are further to: propagate the changes to represent a coarse level of detail (LOD) in the hash map.
13. The processor of claim 12, wherein the one or more circuits are further to: propagate the changes to represent a coarse level of detail (LOD) in the hash map.
20. (New) The processor of claim 17, wherein the individual entries in the hash map comprise a checksum value to identify colliding or unrelated points associated with a mapping of same entries.
14. The processor of claim 11, wherein the individual entries in the hash map comprise a checksum value to identify colliding or unrelated points associated with a mapping of same entries.
21. (New) The processor of claim 17, wherein the one or more processors are further to: generate a linked list representative of the set of change requests for the individual entries in the hash map, wherein the linked list comprises at least one index of related change requests of the set of change requests.
15. The processor of claim 11, wherein the one or more circuits are further to: generate a linked list of the two or more change requests for the individual entries in the hash map, wherein the linked list comprises indices of related change requests of the set of change requests.
Noted, 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-3 and 5-20 of U.S. Patent No. 12360985 to arrive at the claims 2-21 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.
The remaining claims are rejected for fully incorporating the deficiencies of the base claim(s) from which they depend.
8. Claims 2-21 are rejected on the ground of nonstatutory double patenting as being unpatentable over claims 1, 6, 8-11 and 15-16 of U.S. Patent No. 12013844. The subject matter claimed in the instant application is fully disclosed in the U.S. Patent No. 12013844 and is covered by the U.S. Patent No. 12013844 and the application are claiming common subject matter, as follows:
Instant Application - 19/268,706
U.S. Patent No. 12013844
2. (New) A method, comprising: receiving a set of change requests to one or more assets corresponding to one or more objects in a scene, the set of change requests corresponding to computations to be performed at least partially in parallel for the one or more assets; updating the one or more assets using a hash map associated with the computations by serially processing the set of change requests for individual entries in the hash map; and rendering a visualization of the scene depicting the one or more objects using the one or more updated assets.
1. (Previously Presented) A computer-implemented method, comprising: receiving a set of change requests for data in a dataset, the change requests received over a set of parallel threads of execution; storing information for the change requests to a buffer, the information including indices of the change requests and one or more values representing at least one other attempt at modifying individual entries in a hash map corresponding to the change requests; and iterating through one or more of the change requests for the individual entries in the hash map using single threads of execution to update the hash map.
5. (New) The method of claim 2, further comprising aggregating the set of change requests, collectively representative of an indication of at least one change attempt, using a hash map associated with the computations.
1. (Previously Presented) A computer-implemented method, comprising: receiving a set of change requests for data in a dataset, the change requests received over a set of parallel threads of execution; storing information for the change requests to a buffer, the information including indices of the change requests and one or more values representing at least one other attempt at modifying individual entries in a hash map corresponding to the change requests; and iterating through one or more of the change requests for the individual entries in the hash map using single threads of execution to update the hash map.
7. (New) The method of claim 2, wherein the one or more assets represents world-space data.
6. (Previously Presented) The computer-implemented method of claim 1, wherein the dataset represents world-space data.
9. (New) The method of claim 7, wherein the individual entries in the hash map correspond to cells comprised of the world-space data visible at one or more pixel locations.
8. (Previously Presented) The computer-implemented method of The computer-implemented method of wherein individual entries in the hash map correspond to cells comprised of the world-space data visible through one or more pixel locations.
10. (New) The method of claim 2, wherein the one or more assets is generated using multiple parallel threads for at least one application of a group of applications comprising: an application implemented using a control system for an autonomous or semi- autonomous machine; an application implemented using a perception system for an autonomous or semi- autonomous machine; an application for performing simulation operations; an application for performing digital twin operations; an application for performing light transport simulation; an application for performing collaborative content creation for 3D assets; an application for performing deep learning operations; an application implemented using an edge device; an application for generating or presenting at least one of virtual reality content, augmented reality content, or mixed reality content; an application implemented using a robot; an application for performing conversational AI operations; an application for generating synthetic data; an application incorporating one or more virtual machines (VMs);an application implemented at least partially in a data center; or an application implemented at least partially using cloud computing resources.
9. (Previously Presented) The computer-implemented method of claim 1, where the dataset is generated using multiple parallel threads for at least one application of a group of applications comprising: an application implemented using a control system for an autonomous or semi- autonomous machine; an application implemented using a perception system for an autonomous or semi-autonomous machine; an application for performing simulation operations; an application for performing digital twin operations; an application for performing light transport simulation; an application for performing collaborative content creation for 3D assets; an application for performing deep learning operations; an application implemented using an edge device; an application for generating or presenting at least one of virtual reality content, augmented reality content, or mixed reality content; an application implemented using a robot; an application for performing conversational Al operations; an application for generating synthetic data; an application incorporating one or more virtual machines (VMs); an application implemented at least partially in a data center; or an application implemented at least partially using cloud computing resources.
11. (New) The method of claim 2, wherein one or more of the individual entries comprises at least one unsigned integer checksum value and at least one unsigned integer.
10. (Previously Presented) The computer-implemented method of The computer-implemented method of wherein one or more of the individual entries each contain at least one unsigned integer checksum value and at least one unsigned integer representing the one or more values, and the updating the one or more values is based on the indices stored in the buffer.
12. (New) A system, comprising: one or more processors to: receive a set of change requests to one or more assets corresponding to one or more objects in a scene, the set of change requests received corresponding to computations to be performed at least partially in parallel for the one or more assets; update the one or more assets using a hash map associated with the computations by serially processing the set of change requests for individual entries in the hash map; and render a visualization of the scene depicting the one or more objects using the one or more updated assets.
16. (Previously Presented) A system, comprising: one or more processors to iterate through change requests, received over a set of parallel threads of execution, for individual entries in a hash map using single threads of execution to update the hash map based at least in part on one or more values representing at least one attempt at modifying individual entries in the hash map corresponding to the change requests.
15. (New) The system of claim 12, wherein the individual entries in the hash map comprise a checksum value to identify colliding or unrelated points associated with a mapping of same entries.
15. (Previously Presented) The processor of claim 11, wherein the individual entries contain at least one unsigned integer checksum value and at least one unsigned integer representing the one or more values and updating the one or more values based on the indices stored in the buffer.
17. (New) A processor comprising one or more logical units to render a visualization of a scene depicting one or more objects based on a set of change requests for one or more assets corresponding to the one or more objects, the set of change requests corresponding to computations to be performed at least partially in parallel for the one or more assets, the one or more assets being updated in a hash map being associated with the computations by serially processing the set of change requests for individual entries in the hash map.
11. (Previously Presented) A processor, comprising: one or more circuits to: receive a set of change requests for data in a dataset, the change requests received over a set of parallel threads of execution; store information for the change requests to a buffer, the information including indices of the change requests and one or more values representing at least one other attempt at modifying individual entries in a hash map corresponding to the change requests; and iterate through one or more of the change requests for the individual entries in the hash map using single threads of execution to update the hash map.
20. (New) The processor of claim 17, wherein the individual entries in the hash map comprise a checksum value to identify colliding or unrelated points associated with a mapping of same entries.
15. (Previously Presented) The processor of claim 11, wherein the individual entries contain at least one unsigned integer checksum value and at least one unsigned integer representing the one or more values and updating the one or more values based on the indices stored in the buffer.
Noted, 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, 6, 8-11 and 15-16 of U.S. Patent No. 12013844 to arrive at the claims 2-21 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.
The remaining claims are rejected for fully incorporating the deficiencies of the base claim(s) from which they depend.
9. Claims 2-21 are rejected on the ground of nonstatutory double patenting as being unpatentable over claims 1, 3-4 and 11 of U.S. Patent No. 11609899. The subject matter claimed in the instant application is fully disclosed in the U.S. Patent No. 11609899 and is covered by the U.S. Patent No. 11609899 and the application are claiming common subject matter, as follows:
Instant Application – 19/268,706
U.S. Patent No. 11609899
2. (New) A method, comprising: receiving a set of change requests to one or more assets corresponding to one or more objects in a scene, the set of change requests corresponding to computations to be performed at least partially in parallel for the one or more assets; updating the one or more assets using a hash map associated with the computations by serially processing the set of change requests for individual entries in the hash map; and rendering a visualization of the scene depicting the one or more objects using the one or more updated assets.
1. (Previously Presented) A computer-implemented method, comprising: receiving a set of change requests for data in a dataset, the change requests received over a set of parallel threads of execution; storing information for the change requests to a buffer; determining, for individual entries in a hash map representing the dataset, the change requests that correspond to the individual entries, wherein multiple change requests are enabled to correspond to one of the individual entries; fetching, from the buffer, the information for the change requests determined to correspond to the individual entries in the hash map; and iterating through the change requests corresponding to the individual entries in the hash map using single threads of execution for the individual entries in order to update at least a subset of the individual entries.
7. (New) The method of claim 2, wherein the one or more assets represents world-space data.
3. (Original) The computer-implemented method of claim 1, wherein the dataset represents world-space data.
9. (New) The method of claim 7, wherein the individual entries in the hash map correspond to cells comprised of the world-space data visible at one or more pixel locations.
4. (Original) The computer-implemented method of claim 3, wherein individual entries in the hash map correspond to cells comprised of the world-space data visible through one or more pixel locations.
12. (New) A system, comprising: one or more processors to: receive a set of change requests to one or more assets corresponding to one or more objects in a scene, the set of change requests received corresponding to computations to be performed at least partially in parallel for the one or more assets; update the one or more assets using a hash map associated with the computations by serially processing the set of change requests for individual entries in the hash map; and render a visualization of the scene depicting the one or more objects using the one or more updated assets.
11. (Previously Presented) A system, comprising: one or more processors; and memory including instructions that, when executed by the one or more processors, cause the system to: receive a set of change requests received over a set of parallel threads of execution; store information for the change requests to a buffer; determine, for individual entries in a hash map representing an environment, the change requests that correspond to the individual entries, wherein multiple change requests are enabled to correspond to one of the individual entries; fetch, from the buffer, the information for the change requests corresponding to the individual entries in the hash map; and iterate through the change requests corresponding to the individual entries in the hash map using single threads of execution for the individual entries in order to update at least a subset of the individual entries.
17. (New) A processor comprising one or more logical units to render a visualization of a scene depicting one or more objects based on a set of change requests for one or more assets corresponding to the one or more objects, the set of change requests corresponding to computations to be performed at least partially in parallel for the one or more assets, the one or more assets being updated in a hash map being associated with the computations by serially processing the set of change requests for individual entries in the hash map.
11. (Previously Presented) A system, comprising: one or more processors; and memory including instructions that, when executed by the one or more processors, cause the system to: receive a set of change requests received over a set of parallel threads of execution; store information for the change requests to a buffer; determine, for individual entries in a hash map representing an environment, the change requests that correspond to the individual entries, wherein multiple change requests are enabled to correspond to one of the individual entries; fetch, from the buffer, the information for the change requests corresponding to the individual entries in the hash map; and iterate through the change requests corresponding to the individual entries in the hash map using single threads of execution for the individual entries in order to update at least a subset of the individual entries.
Noted, 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, 3-4 and 11 of U.S. Patent No. 11609899 to arrive at the claims 2-21 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.
The remaining claims are rejected for fully incorporating the deficiencies of the base claim(s) from which they depend.
Conclusion
10. The prior art made of record and not relied upon is considered pertinent to applicant's disclosure.
Baker et al. (US 2019/0065542 A1) teaches parallel processing of database logs to provide change tracking features.
Levy et al. (US 2017/0046412 A1) teaches querying and updating entries in a database.
Bensberg et al. (US 2013/0138628 A1) teaches providing a relational data join operation in parallel computing environments.
Harding, JR. et al. (US 2019/0018855 A1) teaches performing hash joins using parallel processing.
11. Any inquiry concerning this communication or earlier communications from the examiner should be directed to MOHAMMAD SOLAIMAN BHUYAN whose telephone number is (571)272-7843. The examiner can normally be reached on Monday - Friday 9:00am-5:00pm EST.
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.
/Mohammad S Bhuyan/Examiner, Art Unit 2168
/DEBBIE M LE/Primary Examiner, Art Unit 2168
August 19, 2026
Prosecution Insights