In the first patent claim consider also using the phrase “transforming data X into data Y.”
Limitations Summary
• If It Can Be Tied To A Machine, Use A
Component Of The Machine In Each Step
• If It Represents A Physical Object, Display It
• If It Cannot Be Tied To A Machine And Does
Not Represent A Physical Object, Use Software
Modules From here. Look at this.
Preambles:
(not allowed) Gutta - A computerized method performed by a data processor for recommending one or more available items to a target user, comprising the steps of:
(ALLOWED) Bo Li - A computer program product, comprising a computer usable medium having a computer readable program code embodied therein, said computer readable program code adapted to be executed to implement a method for generating a report, said method comprising
(not allowed) Cornea-Hasegan - A computer readable media including program instructions which when executed by a processor cause the processor to perform the following:
Suggested examples:
Barnes Claim 1 Tied To A Machine
• Claim 1. A fault identification method that
comprises:
• obtaining seismic data using a seismic detector;
• recording the seismic data on a record medium;reading the seismic data from the record medium
using a computer; and
• for each of multiple positions of an analysis
window in the seismic data, determining a
planarity value for discontinuities in the analysis
window using the computer.
Barnes Claim 32 (In Indep. Form)
Representing A Physical Object
• Claim 32. A fault identification method that
comprises:
• determining discontinuity values from seismic
data;
• applying principal component analysis to the
discontinuity values to identify faults that
represent rock layer features associated with
hydrocarbons; and
• displaying the identified faults in a vertical slice
view to allow a user to specify subregions of the
seismic data for examination.
Comiskey Claim 17 As A Method Claim
• A method for mandatory arbitration resolution regarding one
or more unilateral documents comprising:
• providing a system, wherein the system comprises distinct
software modules embodied on a computer‐readable
medium, , wherein the distinct software modules comprise a
registration module, an arbitration module, an arbitration
resolution module, and an arbitrator database access module;
• enrolling a person who is executing and one or more
unilateral documents associated with the person in a
mandatory arbitration system at a time prior to or as of the
time of creation of or execution of the one or more unilateral
documents using the registration module; …
• A computer program product, comprising a computer usable
medium having a computer readable program code embodied
therein, said computer readable program code adapted to be
executed to implement a method for mandatory arbitration
resolution regarding one or more unilateral documents comprising:
• providing a system, wherein the system comprises distinct
software modules embodied on a computer‐readable medium, ,
wherein the distinct software modules comprise a registration
module, an arbitration module, an arbitration resolution module,
and an arbitrator database access module;
• enrolling a person who is executing and one or more unilateral
documents associated with the person in a mandatory arbitration
system at a time prior to or as of the time of creation of or
execution of the one or more unilateral documents using the
registration module; …
Suggestion--tie each step into the computer.
From in re Gutta, commentary
"Here is one interesting part of the decision, however: "Regarding claim 1, the step of “displaying” need not be performed by
any particular structure. It may be accomplished simply by writing the
resulting score on a piece of paper. A conclusion that such post-solution
activity is sufficient to impart patentability to a claim involving the solving
of a mathematical algorithm would exalt form over substance."
("wherein said process takes place in a structure, wherein said structure includes a furnace or air conditioner for modulating air temperature" -- look, the method is tied to a particular machine!!). Suggestion
Rejected in re Gutta claim
1. A computerized method performed by a data processor for
recommending one or more available items to a target user,
comprising the steps of:
obtaining a history of selecting one or more available items by
at least one third party;
partitioning a third party selection history into a plurality of
clusters, wherein each cluster contains items that are closer to
the mean of the cluster than any other cluster from among the
plurality of clusters,
modifying a target user's history of selecting said one or more
available items with one or more third party clusters to produce
a modified target user's history;
processing the modified target user's history to generate a target
user profile, wherein the modified target user's history
characterizes preferences of the target user as modified to
reflect preferences of the third party;
generating a recommendation score for at least one of said
available items based on said target user's profile; and
displaying the recommendation score to the target user.
The BPAI said that the displaying step could be performed by a human writing down the answer on a piece of paper, so tie the dispaying directly into the processor, or something.
http://www.uspto.gov/web/offices/pac/dapp/opla/documents/bilski_guidance_memo.pdf
Bilski USPTO rules link
From the Rules:
There are two corollaries to the machine-or-transformation test. First, a mere field-of-use limitation is generally insufficient to render an otherwise ineligible method claim patent- eligible. This means the machine or transformation must impose meaningful limits on the method claim's scope to pass the test. Second, insignificant extra-solution activity will not transform an unpatentable principle into a patentable process. This means reciting a specific machine or a particular transformation of a specific article in an insignificant step, such a data gathering or outputting, is not sufficient to pass the test.
The machine-or-transformation test is a two-branched inquiry; an applicant may show that a process claim satisfies § 101 either by showing that his claim is tied to a particular machine, or by showing that his claim transforms an article. See Benson, 409 U.S. at 70. Certain considerations are applicable to analysis under either branch. First, as illustrated by Benson . . . the use of a specific machine or transformation of an article must impose meaningful limits on the claim’s scope to impart patent-eligibility. See Benson, 409 U.S. at 71-72. Second, the involvement of the machine or transformation in the claimed process must not merely be insignificant extra-solution activity. See Flook, 437 U.S. at 590.
In re Bilski, 545 F.3d 943, 961-62 (Fed. Cir. 2008).
Rule???? Under Bilski, the patentability test has a very context-sensitive angle in order to conclude whether a step is integral to the invention or if it is extra-solution.
Suggested by a commentor at Patent Hawk:
Claims, below, invalid under 101 re Bilski.
1. A method for optimizing a query in a relational database management system, the method comprising:
evaluating the query to determine whether a sub-expression of the query is being joined to itself and whether a predicate of the query comprises an equality test between a same column of the sub-expression;
determining whether a first row set producible from a first set of references of the query to the sub-expression is subsumed by a second row set producible from a second set of references of the query to the subexpression; and
reforming the query to eliminate the joining of the sub-expression to itself based on evaluation of the query and determination of whether the first row set is subsumed by the second row set.
Suggestion 1: add "said method being implemented by a digital machine and comprising:" the reasoning being that a "digital machine" is a "particular machine."
Suggestion is to reformulate as follows:
1. A method for optimizing a query for a relational database management system, the method comprising:
receiving the query in a computer system implementing an optimization algorithm, the optimization algorithm:
evaluating the query to determine: whether a sub-expression of the query is being joined to itself and whether a predicate of the query comprises an equality test between a same column of the sub-expression;
determining whether a first row set producible from a first set of references of the query to the sub-expression is subsumed by a second row set producible from a second set of references of the query to the subexpression; and
reforming the query to eliminate the joining of the sub-expression to itself based on: (i) evaluation of the query, and (ii) determination of whether the first row set is subsumed by the second row set.
Fed. Circuit case law that may come in hand
There is one further rationale used by both the board and the examiner, namely, that the provision of new signals to be stored by the computer does not make it a new machine, i.e. it is structurally the same, no matter how new, useful and unobvious the result. . . . To this question we say that if a machine is programmed in a certain new and unobvious way, it is physically different from the machine without that program; its memory elements are differently arranged. The fact that these physical changes are invisible to the eye should not tempt us to conclude that the machine has not been changed. Bernhart, 417 F.2d at 1400.
(1) For a machine implementation, that issue was not decided by the CAFC; and
(2) For a transformation, it must be central to the purpose of the claimed process and the electronic transformation of the data itself into a visual depiction was sufficient in Abele.
Fundamentally, one can maybe look to the EP's handling of software claims related to "technical effect" that goes beyond the normal physical interactions between the program and the computer, as a guide. See, http://www.epo.org/patents/law/legal-texts/html/guiex/e/c_iv_2_3_6.htm
Maybe?
(from patentlyo comments - Jim)
Claim 1 recited
(GL- not 101 patentable subject matter) 1. A computerized method comprising:
inputting multiple extensible Markup Language (XML) documents;
creating a data representation of said multiple XML documents; and
reducing redundancy across said multiple XML documents via a fixed set of tables.
According to the BPAI,
[T]he recited method, while being computerized, is not tied to a particular machine for executing the claimed steps. We find that the computerized recitation purports to a general purpose processor (Fig. 2.), as opposed to a particular computer specifically programmed for executing the steps of the claimed method [271 Note: what's the difference?]. Next, while it can be argued that the creating step transforms the input XML documents into represented data (i.e. a different state), we find that the documents are not an article (i.e. physical entities). Rather, they are mere data that represent such entities. Similarly, while it can be argued that the redundancy reducing step transforms the XML documents into a smaller set of the documents, they are not an article being transformed.
However, a related apparatus claim recited
(gl-patentable subject matter) 25. An apparatus comprising:
means for creating a graph based data structure representing multiple standard XML tree structures;
means for transforming said graph based data structure to a fixed set of tables; and
means for using said fixed set of tables.
Here, the BPAI found the language rendered statutory subject matter into the claim:
Appellants argue that the recited apparatus refers to the general purpose computer depicted in Figure 2. (App. Br. 33.) Further, Appellants submit that the different means recited in the claim correspond to the different modules in the computer for performing the recited functions. (Id. at 12.) We find that since the claim recites a physical apparatus with physical modules for transforming a data structure into a fixed set of tables, it is not a directed to an abstract idea. Therefore, Appellants have shown that the Examiner erred in finding that claim 25 is directed to an abstract idea. Thus, we will not sustain this rejection.
Apparently, the Board did not see fit to explain why a "computerized method" to a "general purpose computer" is nonstatutory, while an "apparatus" directed to the same general purpose computer is. The implication here is that, if the method claim recited the computer, the claims would be statutory. However, other BPAI precedent (Ex parte Gutta) states that this would not be enough.
From BPAI opinion here. Application here.
No comments:
Post a Comment