Prosecution Insights
Last updated: November 04, 2026
Application No. 18/850,576

METHODS AND DEVICES OF PROCESSING CYTOMETRIC DATA

Non-Final OA §101§102
Filed
Sep 25, 2024
Priority
Mar 29, 2022 — provisional 63/362,124 +1 more
Examiner
LAU, TUNG S
Art Unit
2857
Tech Center
2800 — Semiconductors & Electrical Systems
Assignee
Ahead Intelligence Ltd.
OA Round
1 (Non-Final)
83%
Grant Probability
Favorable
1-2
OA Rounds
9m
Est. Remaining
98%
With Interview

Examiner Intelligence

Grants 83% — above average
83%
Career Allowance Rate
962 granted / 1164 resolved
+14.6% vs TC avg
Strong +15% interview lift
Without
With
+15.3%
Interview Lift
resolved cases with interview
Typical timeline
2y 10m
Avg Prosecution
36 currently pending
Career history
1201
Total Applications
across all art units

Statute-Specific Performance

§101
24.6%
-15.4% vs TC avg
§103
27.2%
-12.8% vs TC avg
§102
26.8%
-13.2% vs TC avg
§112
15.9%
-24.1% vs TC avg
Black line = Tech Center average estimate • Based on career data from 1164 resolved cases

Office Action

§101 §102
The present application, filed on or after March 16, 2013, is being examined under the first inventor to file provisions of the AIA . 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 (i.e., changing from AIA to pre-AIA ) 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. (PBA) DETAILED ACTION Claims status Claims 1-20 are pending as the applicant filed on 09/25/2024. Citation of Relevant Prior Art The prior art made of record and not relied upon is considered pertinent to applicant’s disclosure. See MPEP 707.05. Although the prior art discloses several unclaimed, some claimed limitation. The closest Prior Art of record are considered to be defined by: MOTOYA (US 20180276527 A1) described processing method using a convolutional neural network, the neural network includes a convolution calculation unit that performs a convolution calculation by using a matrix vector product and a pooling calculation unit that performs a maximum value sampling calculation. A threshold value is set related to the matrix data for the convolution calculation, the matrix data is divided into a first and second halves based on the threshold value. The convolution calculation unit divides a first half convolution calculation by using the first half of the matrix data and a second half convolution calculation by using the second half of the matrix data into two and executes the calculations. The pooling calculation unit selects vector data to which the matrix vector product convolution calculation is to be performed in the second half convolution calculation, along with the maximum value sampling calculation. SCHOEN, CN 105070631 A, Date Published: 2015-11-18, CPC H 01 J 49/025 described a method of analyzing a sample by mass spectrometry, comprising the steps of: generating a stream of ions from the sample; delivering the ions to the inlet end of a multipole, the multipole defining a central longitudinal axis and first and second transverse axes; generating an electric field within the multipole, the electric field causing a subset of ions having a range of mass-to-charge values (m/z's) to be selectively transmitted to a distal end of the multipole along the central longitudinal axis, the range of m/z's of the transmitted ions being determined by at least one parameter of the electric field; progressively varying the at least one parameter of the electric field; acquiring a series of temporally-resolved ion images of ions selectively transmitted to the distal end of the multipole while the at least one parameter of the electric field is varied, each ion image containing information regarding the intensities of ions sensed at different locations on at least one transverse axis; and deconvolving data in the series of ion images to produce a mass spectrum. Claim Rejections - 35 USC § 101 35 U.S.C. 101 reads as follows: Whoever invents or discovers any new and useful process, machine, manufacture, or composition of matter, or any new and useful improvement thereof, may obtain a patent therefor, subject to the conditions and requirements of this title. Claims 1-20 are rejected under 35 U.S.C. 101 because the claimed invention is directed to a judicial exception (i.e., a law of nature, a natural phenomenon, or an abstract idea) without significantly more. Claim 1, Step 1 the claim is a process (or machine) (Yes), Step 2A Prong One, does the claim recite an abstract idea? current claim related to a method of processing cytometric data, comprising: dividing a first data matrix into a first plurality of first submatrices, the first data matrix indicative of a first plurality of properties of a first set of cells appears is an abstract idea of mental process (MPEP 2106.04(a)) or data gathering equivalent to mathematical concept or mathematical manipulation function (MPEP 2106.04 (a) (2) (concept need not be expressed in mathematical symbols, because "[w]ords used in a claim operating on data to solve a problem can serve the same purpose as a formula), (OR Mathematical Concepts and Mental Processes) Step 2A Prong One: Yes. Step 2A Prong Two, is the claim directed to an abstract idea? In other words, does claim recite additional elements that integrate the Judicial Exception into a practical application? the additional elements of encoding each of the first submatrices into one corresponding vector representation to acquire a first plurality of vector representations are recited at a high level of generality and merely amount to a particular field of use (see MPEP 2106.05(h)) and/or insignificant post-solution activity (MPEP 2106.05(g)), this does not integrate the Judicial Exception into a practical application, Step 2A Prong Two: NO. Step 2B, Does the claim recite additional element that amount to significantly more than the Judicial exception? the additional elements of aggregating the first plurality of vector representations into a first ensemble representation appears to be field of use (See MPEP 2106.05(h) and MPEP 2106.05(f)) and/or merely amounts to insignificant extra-solution output of the results (see MPEP 2106.05(g)) and therefore fails to integrate the abstract idea into a practical application or amount to significantly more. Step 2B: No. claim 1 not eligible. Claim 11, Step 1 the claim is a process (or machine) (Yes), Step 2A Prong One, does the claim recite an abstract idea? current claim related to a device of processing cytometric data, comprising: receiving a first data matrix indicative of a first plurality of properties of a first set of cells; by means of the processor, dividing the first data matrix into a first plurality of first submatrices appears is an abstract idea of mental process (MPEP 2106.04(a)) or data gathering equivalent to mathematical concept or mathematical manipulation function (MPEP 2106.04 (a) (2) (concept need not be expressed in mathematical symbols, because "[w]ords used in a claim operating on data to solve a problem can serve the same purpose as a formula), (OR Mathematical Concepts and Mental Processes) Step 2A Prong One: Yes. Step 2A Prong Two, is the claim directed to an abstract idea? In other words, does claim recite additional elements that integrate the Judicial Exception into a practical application? the additional elements of by means of the processor, encoding each of the first submatrices into one corresponding vector representation to acquire a first plurality of vector representations are recited at a high level of generality and merely amount to a particular field of use (see MPEP 2106.05(h)) and/or insignificant post-solution activity (MPEP 2106.05(g)), this does not integrate the Judicial Exception into a practical application, Step 2A Prong Two: NO. Step 2B, Does the claim recite additional element that amount to significantly more than the Judicial exception? the additional elements of a processor; and a memory coupled with the processor, wherein the processor executes computer-readable instructions stored in the memory to cause the device to perform operations, and the operations, by means of the processor, aggregating the first plurality of vector representations into a first ensemble representation appears to be field of use (See MPEP 2106.05(h) and MPEP 2106.05(f)) and/or merely amounts to insignificant extra-solution output of the results (see MPEP 2106.05(g)) and therefore fails to integrate the abstract idea into a practical application or amount to significantly more. Step 2B: No. claim 11 not eligible. Claim 2 related to dividing a second data matrix into a second plurality of second submatrices, the second data matrix indicative of a second plurality of properties of a second set of cells; encoding each of the second submatrices into one corresponding vector representation to acquire a second plurality of vector representations; aggregating the second plurality of vector representations into a second ensemble representation, its recites further data characterization and mathematical concepts that are part of the abstract idea, claim 2 not eligible. Claim 3 related to dividing a third data matrix into a third plurality of third submatrices, the third data matrix indicative of a third plurality of properties of a third set of cells; encoding each of the third submatrices into one corresponding vector representation to acquire a third plurality of vector representations; aggregating the third plurality of vector representations into a third ensemble representation; concatenating the first, second, and third ensemble representations to acquiring a concatenated representation; and classifying the cytometric data based on the concatenated representation, its recites further data characterization and mathematical concepts that are part of the abstract idea, claim 3 not eligible. Claim 4 related to encoding each of the first submatrices includes transposing each of the first submatrices, its recites further data characterization and mathematical concepts that are part of the abstract idea, claim 4 not eligible. Claim 5 related to each of the first submatrices is encoded into one corresponding vector representation based on at least one of: a Fisher Vector (FV) encoding method or a Vector of Locally Aggregated Descriptors (VLAD) encoding method, its recites further data characterization and mathematical concepts that are part of the abstract idea, claim 5 not eligible. Claim 6 related to applying a gradient updating function to at least one of: the FV encoding method or the VLAD encoding method, wherein a NetFV encoding network is derived by applying the gradient updating function to the FV encoding method, and wherein a NetVLAD encoding network is derived by applying the gradient updating function to the VLAD encoding method, its recites further data characterization and mathematical concepts that are part of the abstract idea, claim 6 not eligible. Claim 7 related to aggregating the first plurality of vector representations into the first ensemble representation includes aggregating the first plurality of vector representations based on feature dimensions of the first plurality of vector representations, its recites further data characterization and mathematical concepts that are part of the abstract idea, claim 7 not eligible. Claim 8 related to aggregating the first plurality of vector representations based on the feature dimensions includes performing at least one of following functions to each feature dimension of the first plurality of vector representations a majority voting function, a maximum pooling function, a mean pooling function, a stochastic pooling function, or a median pooling function, its recites further data characterization and mathematical concepts that are part of the abstract idea, claim 8 not eligible. Claim 9 related to the number of the feature dimensions of the first plurality of vector representations is associated with the number of the first plurality of properties, its recites further data characterization and mathematical concepts that are part of the abstract idea, claim 9 not eligible. Claim 10 related to the first data matrix is acquired from antibody-fluorescence measurements of the first set of cells, its recites further data characterization and mathematical concepts that are part of the abstract idea, claim 10 not eligible. Claim 12 related to receiving a second data matrix indicative of a second plurality of properties of a second set of cells; by means of the processor, dividing the second data matrix into a second plurality of second submatrices; by means of the processor, encoding each of the second submatrices into one corresponding vector representation to acquire a second plurality of vector representations; and by means of the processor, aggregating the second plurality of vector representations into a second ensemble representation, its recites further data characterization and mathematical concepts that are part of the abstract idea, claim 12 not eligible. Claim 13 related to receiving a third data matrix indicative of a third plurality of 58 properties of a third set of cells; by means of the processor, dividing the third data matrix into a third plurality of third submatrices; by means of the processor, encoding each of the third submatrices into one corresponding vector representation to acquire a third plurality of vector representations; by means of the processor, aggregating the third plurality of vector representations into a third ensemble representation; by means of the processor, concatenating the first, second, and third ensemble representations to acquire a concatenated representation; and by means of the processor, classifying the cytometric data based on the concatenated representation, its recites further data characterization and mathematical concepts that are part of the abstract idea, claim 13 not eligible. Claim 14 related to encoding each of the first submatrices includes transposing each of the first submatrices, its recites further data characterization and mathematical concepts that are part of the abstract idea, claim 14 not eligible. Claim 15 related to each of the first submatrices is encoded into one corresponding vector representation based on at least one of: a Fisher Vector (FV) encoding method or a Vector of Locally Aggregated Descriptors (VLAD) encoding method, its recites further data characterization and mathematical concepts that are part of the abstract idea, claim 15 not eligible. Claim 16 related to applying a gradient updating function to at least one of: the FV encoding method or the VLAD encoding method, wherein a NetFV encoding network is derived by applying the gradient updating function to the FV encoding method, and wherein a NetVLAD encoding network is derived by applying the gradient updating function to the VLAD encoding method, its recites further data characterization and mathematical concepts that are part of the abstract idea, claim 16 not eligible. Claim 17 related to aggregating the first plurality of vector representations into the first ensemble representation includes aggregating the first plurality of vector representations based on feature dimensions of the first plurality of vector representations, its recites further data characterization and mathematical concepts that are part of the abstract idea, claim 17 not eligible. Claim18 related to aggregating the first plurality of vector representations based on the feature dimensions includes performing at least one of following functions to each feature dimension of the first plurality of vector representations: a majority voting function, a maximum pooling function, a mean pooling function, a stochastic pooling function, or a median pooling function, its recites further data characterization and mathematical concepts that are part of the abstract idea, claim 18 not eligible. Claim 19 related to the number of the feature dimensions of the first plurality of vector representations is associated with the number of the first plurality of properties, its recites further data characterization and mathematical concepts that are part of the abstract idea, claim 19 not eligible. Claim 20 related to the first data matrix is acquired from antibody-fluorescence measurements of the first set of cells, its recites further data characterization and mathematical concepts that are part of the abstract idea, claim 20 not eligible. Claim Rejections - 35 USC § 102 The following is a quotation of the appropriate paragraphs of 35 U.S.C. 102 that form the basis for the rejections under this section made in this Office action: A person shall be entitled to a patent unless – (a)(1) the claimed invention was patented, described in a printed publication, or in public use, on sale, or otherwise available to the public before the effective filing date of the claimed invention. Claim(s) 1-20 are rejected under 35 U.S.C. 102 (a) (1) as being by Kitajima (US 20200279190 A1, Date Published: 2020-09-03, CPC G06N 20/00). Regarding claim 1: Kitajima described a method of processing cytometric data, comprising: dividing a first data matrix into a first plurality of first submatrices (0083, probability matrix P is divided into an upper-left submatrix P.sub.LL,), the first data matrix indicative of a first plurality of properties of a first set of cells (0083, upper-left submatrix P.sub.LL); encoding each of the first submatrices into one corresponding vector representation to acquire a first plurality of vector representations (0083, upper-left submatrix P.sub.LL can be represent by vector); and aggregating the first plurality of vector representations into a first ensemble representation (0083, Matrix P, 0084-0085, reduce transition). Regarding claim 11: Kitajima described a device of processing cytometric data, comprising: a processor; and a memory coupled with the processor, wherein the processor executes computer-readable instructions stored in the memory to cause the device to perform operations, and the operations (0007, use computer) comprise: receiving a first data matrix indicative of a first plurality of properties of a first set of cells (0083, probability matrix P is divided into an upper-left submatrix P.sub.LL,); by means of the processor, dividing the first data matrix into a first plurality of first submatrices (0083, probability matrix P is divided into an upper-left submatrix P.sub.LL,); by means of the processor, encoding each of the first submatrices into one corresponding vector representation to acquire a first plurality of vector representations (0083, upper-left submatrix P.sub.LL can be represent by vector); and by means of the processor, aggregating the first plurality of vector representations into a first ensemble representation (0083, Matrix P, 0084-0085, reduce transition). Regarding claim 2, Kitajima further described dividing a second data matrix into a second plurality of second submatrices, the second data matrix indicative of a second plurality of properties of a second set of cells; encoding each of the second submatrices into one corresponding vector representation to acquire a second plurality of vector representations; aggregating the second plurality of vector representations into a second ensemble representation (0083, an upper-right submatrix P.sub.LU). Regarding claim 3, Kitajima further described dividing a third data matrix into a third plurality of third submatrices, the third data matrix indicative of a third plurality of properties of a third set of cells; encoding each of the third submatrices into one corresponding vector representation to acquire a third plurality of vector representations; aggregating the third plurality of vector representations into a third ensemble representation; concatenating the first, second, and third ensemble representations to acquiring a concatenated representation; and classifying the cytometric data based on the concatenated representation (0083, an lower-left submatrix P.sub.LU). Regarding claim 4, Kitajima further described encoding each of the first submatrices includes transposing each of the first submatrices (0083, matrix P). Regarding claim 5, Kitajima further described each of the first submatrices is encoded into one corresponding vector representation based on at least one of: a Fisher Vector (FV) encoding method or a Vector of Locally Aggregated Descriptors (VLAD) encoding method (0084, local aggregated processing, P.sub.LU is replaceable with a zero matrix O with all the elements being 0 ). Regarding claim 6, Kitajima further described applying a gradient updating function to at least one of: the FV encoding method or the VLAD encoding method, wherein a NetFV encoding network is derived by applying the gradient updating function to the FV encoding method, and wherein a NetVLAD encoding network is derived by applying the gradient updating function to the VLAD encoding method (0084, P.sub.UU is of size u rows by u columns.). Regarding claim 7, Kitajima further described aggregating the first plurality of vector representations into the first ensemble representation includes aggregating the first plurality of vector representations based on feature dimensions of the first plurality of vector representations (0085, equation 10, 11). Regarding claim 8, Kitajima further described aggregating the first plurality of vector representations based on the feature dimensions includes performing at least one of following functions to each feature dimension of the first plurality of vector representations: a majority voting function (0085, equation 10, 11), a maximum pooling function, a mean pooling function, a stochastic pooling function, or a median pooling function. Regarding claim 9, Kitajima further described the number of the feature dimensions of the first plurality of vector representations is associated with the number of the first plurality of properties (0085, equation 11, t-1 term ). Regarding claim 10, Kitajima further described wherein the first data matrix is acquired from antibody-fluorescence measurements of the first set of cells (00187, can apply to any technology use with no limitation). Regarding claim 12, Kitajima further described receiving a second data matrix indicative of a second plurality of properties of a second set of cells; by means of the processor, dividing the second data matrix into a second plurality of second submatrices; by means of the processor, encoding each of the second submatrices into one corresponding vector representation to acquire a second plurality of vector representations; and by means of the processor, aggregating the second plurality of vector representations into a second ensemble representation (0007, use computer , 0083, an upper-right submatrix P.sub.LU). Regarding claim 13, Kitajima further described receiving a third data matrix indicative of a third plurality of properties of a third set of cells; by means of the processor, dividing the third data matrix into a third plurality of third submatrices; by means of the processor, encoding each of the third submatrices into one corresponding vector representation to acquire a third plurality of vector representations; by means of the processor, aggregating the third plurality of vector representations into a third ensemble representation; by means of the processor, concatenating the first, second, and third ensemble representations to acquire a concatenated representation; and by means of the processor, classifying the cytometric data based on the concatenated representation (0007, use computer , 0083, an lower-left submatrix P.sub.LU). Regarding claim 14, Kitajima further described encoding each of the first submatrices includes transposing each of the first submatrices (0083, matrix P). Regarding claim 15, Kitajima further described each of the first submatrices is encoded into one corresponding vector representation based on at least one of: a Fisher Vector (FV) encoding method or a Vector of Locally Aggregated Descriptors (VLAD) encoding method (0084, local aggregated processing, P.sub.LU is replaceable with a zero matrix O with all the elements being 0 ). Regarding claim 16, Kitajima further described applying a gradient updating function to at least one of: the FV encoding method or the VLAD encoding method, wherein a NetFV encoding network is derived by applying the gradient updating function to the FV encoding method, and wherein a NetVLAD encoding network is derived by applying the gradient updating function to the VLAD encoding method (0084, P.sub.UU is of size u rows by u columns.). Regarding claim 17, Kitajima further described aggregating the first plurality of vector representations into the first ensemble representation includes aggregating the first plurality of vector representations based on feature dimensions of the first plurality of vector representations (0085, equation 10, 11). Regarding claim 18, Kitajima further described aggregating the first plurality of vector representations based on the feature dimensions includes performing at least one of following functions to each feature dimension of the first plurality of vector representations: a majority voting function (0085, equation 10, 11), a maximum pooling function, a mean pooling function, a stochastic pooling function, or a median pooling function. . Regarding claim 19, Kitajima further described the number of the feature dimensions of the first plurality of vector representations is associated with the number of the first plurality of properties (0085, equation 11, t-1 term ). Regarding claim 20, Kitajima further described the first data matrix is acquired from antibody-fluorescence measurements of the first set of cells (00187, can apply to any technology use with no limitation). Note: Preamble not likely to be limit the claim: When the body of the claim following the preamble is a self-contained description of the structure and does not depend on the preamble for completeness, the preamble does not usually limit the claim Kropa v. Robie 88, USPQ at 480-481; Rowe 42 USPQ2d at 1553 and IMS techonolgy Inc v. Hass automation Inc., 54 USPQ2d 1129-1137 (Fed Cir. 2000) (which is true in this case) Contact information 5. Any inquiry concerning this communication or earlier communications from the examiner should be directed to Tung Lau whose telephone number is (571)272-2274, email is Tungs.lau@uspto.gov. The examiner can normally be reached on Tuesday-Friday 7:00 AM-5:00 PM 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, TURNER SHELBY, can be reached on 571-272-6334. 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 https://ppair-my.uspto.gov/pair/PrivatePair. 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. /TUNG S LAU/Primary Examiner, Art Unit 2857 Technology Center 2800 October 23, 2026
Read full office action

Prosecution Timeline

Sep 25, 2024
Application Filed
Oct 27, 2026
Non-Final Rejection mailed — §101, §102 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12784877
METHODS AND DEVICES FOR DETERMINING BONDS IN PARTICLE TRAJECTORIES
3y 6m to grant Granted Nov 03, 2026
Patent 12782525
TIME-OF-FLIGHT MEASUREMENT METHOD, APPARATUS, AND SYSTEM
3y 10m to grant Granted Nov 03, 2026
Patent 12782455
BATTERY DIAGNOSTIC SYSTEM
3y 3m to grant Granted Nov 03, 2026
Patent 12768869
METHOD FOR PROCESSING ANISOTROPIC MAGNETIZED PLASMA MEDIUM AND SYSTEM THEREOF
2y 11m to grant Granted Oct 20, 2026
Patent 12769279
APPARATUS FOR DETERMINING THE ACTUAL STATE AND/OR THE REMAINING SERVICE LIFE OF STRUCTURAL COMPONENTS OF A WORK MACHINE
2y 11m to grant Granted Oct 20, 2026
Study what changed to get past this examiner. Based on 5 most recent grants.

Strategy Recommendation AI-generated — please review before filing

Get a prosecution strategy drawn from examiner precedents, rejection analysis, and claim mapping.
Typically takes 5-10 seconds — AI-generated, attorney review required before filing

Prosecution Projections

1-2
Expected OA Rounds
83%
Grant Probability
98%
With Interview (+15.3%)
2y 10m (~9m remaining)
Median Time to Grant
Low
PTA Risk
Based on 1164 resolved cases by this examiner. Grant probability derived from career allowance rate.

Sign in with your work email

Enter your email to receive a magic link. No password needed.

Personal email addresses (Gmail, Yahoo, etc.) are not accepted.

Free tier: 3 strategy analyses per month