`
`
`UNITED STATES PATENT AND TRADEMARK OFFICE
`
`____________
`
`BEFORE THE PATENT TRIAL AND APPEAL BOARD
`
` ____________
`
`UBISOFT, INC. AND SQUARE ENIX, INC.,
`Petitioners
`
`v.
`
`UNILOC USA, INC. AND UNILOC LUXEMBOURG, S.A.,
`Patent Owners.
`
`____________
`
`Case No. IPR2017-01291
`U.S. Patent No. 6,728,766
` ____________
`
`
`
`
`
`PETITIONERS’ REQUEST FOR REHEARING
`UNDER 37 C.F.R. § 42.71(D)
`
`
`
`TABLE OF CONTENTS
`
`INTRODUCTION ............................................................................................... 1
`I.
`II. APPLICABLE STANDARDS .......................................................................... 5
`III. ARGUMENT .................................................................................................... 7
`IV. CONCLUSION ............................................................................................... 12
`
`
`
`
`
`I.
`
`INTRODUCTION
`
`In response to the Decision of Partial Institution of Inter Partes Review
`
`entered November 1, 2017, (Paper 9, hereinafter “Decision”) and pursuant to 37
`
`C.F.R. § 42.71(d), Ubisoft, Inc. and Square Enix, Inc. (“Petitioners”) hereby
`
`respectfully request the Patent Trial and Appeal Board (“Board”) reconsider its
`
`decision denying institution for inter partes review of claims 7, 9, 13, and 15 of
`
`U.S. Patent No. 6,728,766 (EX1001, “the ‘766 Patent”).
`
`The grounds of invalidity raised by Petitioners in the Petition (Paper 1,
`
`hereinafter “Petition”) are based on U.S. Patent 5,758,069 (“Olsen”). Decision at 4.
`
`The Board instituted inter partes review of the two challenged method claims
`
`(claims 1 and 3) of the ‘766 Patent in view of Olsen, finding that “the Petition
`
`reasonably maps the limitations of claims 1 and 3 to pertinent disclosures in Olsen.”
`
`Decision at 14-16). The Decision references the “Petitioner’s Overall Contentions”
`
`section as support for institution, noting that “Olsen describes methods and
`
`apparatus for licensing software in a network environment, where a distributed
`
`database stores license information among several servers.” Decision at 10; see
`
`also id. at 15-16.
`
`However, the Decision denied institution of claims drafted in means-plus-
`
`function format based on the Board’s construction of the “means for maintaining
`
`license management policy information” limitation recited in claims 7 and similar
`
`1
`
`
`
`“computer readable program code means for maintaining” limitation recited in
`
`claim 13 (collectively, the “means for maintaining” limitations). Decision at 16-18.
`
`The “means for maintaining” limitations are as follows:
`
`• Claim 7: means for maintaining license management policy
`
`information for a plurality of application programs at a license
`
`management server, the license management policy information
`
`including at least one of a user identity based policy, an
`
`administrator policy override definition or a user policy override
`
`definition;
`
`• Claim 13: computer readable program code means for maintaining
`
`license management policy
`
`information for a plurality of
`
`application programs at a license management server, the license
`
`management policy information including at least one of a user
`
`identity based policy, an administrator policy override definition or
`
`a user policy override definition
`
`As to these claims, the Petition proposed that the corresponding structure be
`
`construed as “a database and equivalents thereof.” Petition at 3; Decision at 6. At
`
`the urging of Patent Owners, the Board disagreed with Petitioners’ proposed
`
`construction, and construed the “means for maintaining” limitations to require the
`
`following corresponding structure:
`
`2
`
`
`
`a processor programmed to carry out the algorithms for maintaining
`
`license management policy information for a plurality of application
`
`programs at a license management server, where the algorithms are
`
`setting policies such as limiting the number of users, whether crossing
`
`the limit of users is allowed or not, and how users are counted.
`
`Decision at 6-8, 16. The Board determined that the Petition did not show how
`
`Olsen met this construction, and denied institution on this basis. Decision at 17
`
`(“Petitioner fails to show how the Olsen database is the required processor
`
`programmed to carry out the specified algorithms”).
`
`Petitioners respectfully request rehearing of the Decision as to the
`
`construction of the “means for maintaining” limitations found in claims 7 and 13,
`
`as the Board’s construction does not identify algorithmic structure that is clearly
`
`linked to the recited function. Specifically, the Board’s construction appears to
`
`have overlooked or misapprehended the disclosure of the ‘766 Patent, as the
`
`specification does not disclose – and the Board’s construction does not identify –
`
`any actual algorithmic structure. The Board’s construction appears to require a
`
`“processor to carry out algorithms” that are “setting policies,” but does not identify
`
`any actual steps or instructions that could constitute an “algorithm” or how such an
`
`“algorithm” would set the required policies. Decision at 6-8. Thus, at best, the
`
`construction merely restates functional steps recited in the claim language, but
`
`3
`
`
`
`does not provide any algorithm or algorithmic structure for how license
`
`management information is actually maintained.
`
`Petitioners submit
`
`that
`
`the Board’s construction does not
`
`identify
`
`corresponding structure that is clearly linked to the recited function, and thus
`
`would render the claims invalid as indefinite. Petitioners submit that their
`
`proposed structure, “a database and equivalents thereof,” is the only structure that
`
`is clearly linked to the claimed function that does not render the claims indefinite,
`
`and that Olsen discloses this proposed structure.1 On this basis, Petitioners request
`
`reconsideration.
`
`1
`Petitioners note that their proposed construction, “a database and equivalents
`
`thereof,” is disclosed in the specification of the ‘766 Patent and is clearly linked to
`
`the function recited in the “means for maintaining” limitations. Petition at 3, citing
`
`EX1001 at 12:50-52 (“server system 22 stores license use management policy
`
`information in a hierarchial centralized preference database 208”), 5:40-42. The
`
`Petition makes clear that Petitioners’ proposed constructions were “not a waiver of
`
`any argument in any litigation that claim terms in the ‘766 Patent are indefinite or
`
`otherwise invalid or unpatentable.” Petition at 2-3. Moreover, Petitioners could
`
`not have raised indefiniteness challenges in the Petition. See Cuozzo Speed Techs.
`
`v. Lee, 579 U.S. –, slip op. at 11 (2016) (“nor does our interpretation enable the
`
`agency to act outside its statutory limits by, for example, canceling a patent claim
`
`4
`
`
`
`This request is timely under 37 C.F.R. §42.71(d)(1) because it was filed
`
`within 14 days of the Board’s decision to institute a trial as to at least one ground
`
`of unpatentability asserted in the Petition on the ‘766 Patent.
`
`II. APPLICABLE STANDARDS
`
`“A party dissatisfied with a decision may file a request for rehearing,
`
`without prior authorization from the Board.” 37 C.F.R. §42.71(d). “The request
`
`must specifically identify all matters the party believes the Board misapprehended
`
`or overlooked, and the place where each matter was previously addressed in a
`
`motion, an opposition, or a reply.” Id. The Board reviews a decision for an abuse
`
`of discretion. 37 C.F.R. §42.71(c).
`
`Claim construction is a question of law. Markman v. Westview Instruments,
`
`52 F.3d 967, 976 (Fed. Cir. 1995) (en banc), aff’d, 517 U.S. 370 (1996). In an
`
`inter partes review, claim terms in an unexpired patent are interpreted according to
`
`their broadest reasonable construction in light of the specification of the patent in
`
`which they appear. 37 C.F.R. § 42.100(b); Cuozzo Speed Techs., LLC v. Lee, 136
`
`S.Ct. 2131, 2142 -46 (2016). Consistent with that standard, claim terms are also
`
`given their ordinary and customary meaning, as would be understood by one of
`
`ordinary skill in the art in the context of the entire disclosure. See In re Translogic
`
`for ‘indefiniteness under §112’ in inter partes review”); 35 U.S.C. § 311(b).
`
`
`
`5
`
`
`
`Tech. Inc., 504 F.3d 1249, 1257 (Fed. Cir. 2007).
`
`In the context of means-plus-function limitations, claim construction
`
`requires first defining the particular function of the limitation and then identifying
`
`the corresponding structure for that function in the specification. Golight Inc. v.
`
`Wal-Mart Stores Inc., 355 F.3d 1327, 1333-34 (Fed. Cir. 2004). The function is
`
`construed to “include the limitations contained in the claim language, and only
`
`those limitations.” Cardiac Pacemakers, Inc. v. St. Jude Med., Inc., 296 F.3d
`
`1106, 1113 (Fed. Cir. 2002). Once the function is properly identified, the next
`
`inquiry is “what structure, if any, disclosed in the specification corresponds to the
`
`claimed function.” Cardiac Pacemakers, 296 F.3d at 1113. “[W]hen a patentee
`
`invokes means-plus-function claiming to recite a software function, it accedes to
`
`the reciprocal obligation of disclosing a sufficient algorithm as corresponding
`
`structure.” EON Corp. IP Holdings LLC v. AT&T Mobility, LLC, 785 F.3d 616,
`
`623 (Fed. Cir. 2015); Ergo Licensing LLC v. CareFusion 303, Inc., 673 F.3d 1361,
`
`1364-65 (Fed. Cir. 2012); WMS Gaming Inc. v. Int’l Gaming Tech., 184 F.3d 1339,
`
`1348- 49 (Fed. Cir. 1999). In the absence of such an algorithm, the claim is
`
`indefinite. Ergo Licensing, 673 F.3d at 1365.
`
`
`
`
`
`6
`
`
`
`III. ARGUMENT
`Petitioners request reconsideration of the decision not to institute inter
`
`partes review on claims 7, 9, 13, and 15 challenged in the Petition because the
`
`Decision misapprehends or overlooks the construction of the “means for
`
`maintaining” limitations included in those claims.
`
`Claim Language
`
`Function
`
`maintaining license
`management policy
`information for a plurality
`of application programs at
`a license management
`server, the license
`management policy
`information including at
`least one of a user identity
`based policy, an
`administrator policy
`override definition or a
`user policy override
`definition
`
`[computer readable
`program code] means for
`maintaining license
`management policy
`information for a plurality
`of application programs at
`a license management
`server, the license
`management policy
`information including at
`least one of a user identity
`based policy, an
`administrator policy
`override definition or a
`user policy override
`definition
`
`
`
`Board’s Construction of
`Corresponding
`Structure
`a processor programmed
`to carry out the algorithms
`for maintaining license
`management policy
`information for a plurality
`of application programs at
`a license management
`server, where the
`algorithms are setting
`policies such as limiting
`the number of users,
`whether crossing the limit
`of users is allowed or not,
`and how users are counted
`
`
`The Board, in construing the “means for maintaining” limitations to require
`
`a “processor programmed to carry out the algorithms for maintaining license
`
`management policy information,” appears to have misapprehended and/or
`
`overlooked that the claims do not specify, and the ‘766 Patent does not describe,
`
`7
`
`
`
`any algorithm or instructions for how license management policy information is to
`
`be maintained at a server. The only reference to “maintaining” license
`
`management policy information in the specification is found at 5:40-42 of
`
`EX1001, which merely re-states a portion of the function recited in the claims:
`
`“License management policy information for a plurality of application programs is
`
`maintained at a license management server.” This statement is not, itself, an
`
`algorithm or other instructions by which license management policy information is
`
`maintained, as it does not explain how such information is maintained or provide
`
`any algorithm for doing so.
`
`Patent Owner and the Board cite to 7:26-39 of the ‘766 Patent to show that
`
`the corresponding structure for the means for maintaining limitation includes, at a
`
`minimum, a processor executing algorithms for performing the function.
`
`Petitioners respectfully suggest that the Board appears to have misapprehended
`
`and/or overlooked the fact that 7:26-39 of the ‘766 Patent merely refers to “the
`
`flowcharts of FIGS. 2 through 5,” and states that “each block of the flowchart
`
`illustrations, and combinations of blocks in the flowchart illustrations, can be
`
`implemented by computer program instructions.” EX1001 at 7:26-39 (emphasis
`
`added). But the actual “computer program instructions” are never disclosed in the
`
`‘766 Patent, and nothing in this portion of the specification describes any algorithm
`
`or actual instructions to be implemented by the computer. Petitioners also contend
`
`8
`
`
`
`that this disclosure is not specifically or clearly linked to the “means for
`
`maintaining” limitation. Similarly, the flowcharts of FIGS. 2 through 5 that are
`
`referenced in this portion of the specification also are not related to the “means for
`
`maintaining” limitation. See, e.g., EX1001 at 6:10-28.
`
`The Board also found that 12:37-46 of the ‘766 Patent discloses “algorithms
`
`for maintaining license management policy information.” Decision at 8. This
`
`portion of the specification states:
`
`One further aspect of a managed application environment according to
`the present invention is the ability to provide for license use
`management. License use management involves controlling how
`many users can use a particular application. License use, according to
`the present invention, is managed by setting certain policies, such as
`the limit of the number of users, whether crossing the limit of users is
`allowed or not and how users are counted (simultaneous number
`logged on, total number of clients that can use the application, and so
`on).
`
`EX1001 at 12:37-46. The Board appears to have misapprehended and/or
`
`overlooked the fact that 12:37-46 merely provides exemplary types of “license
`
`use” information, but does not provide any algorithm or instructions for “setting
`
`policies” to which the license use information may apply. The very fact that the
`
`‘766 Patent provides no disclosure of an algorithm, instructions, or steps for setting
`
`9
`
`
`
`license management policy information renders the Board’s construction of the
`
`“means for maintaining” limitation indefinite.
`
`The ‘766 Patent simply does not provide any disclosure regarding the way a
`
`server would be programmed to maintain license management policy information –
`
`i.e., “at least one of a user identity based policy, an administrator policy override
`
`definition or a user policy override definition.” For example, the ‘766 Patent
`
`provides no disclosure regarding how the license management server is
`
`programmed to set, install, accept, modify, delete, configure, or otherwise maintain
`
`any of these policies (i.e., user identity based policy, administrator policy override
`
`definition, user policy override definition). The ‘766 Patent also provides no
`
`disclosure regarding the difference between a “user identify based policy,” an
`
`“administrator policy override definition,” or a “user policy override definition”
`
`and how a user, software developer, and/or administrator would set any such
`
`policies or whether or not the policies need to be set prior to use of the licensing
`
`system.
`
`Accordingly, Petitioners contend that the ‘766 Patent fails to disclose an
`
`algorithm that shows how to “maintain [ ] license management policy information
`
`for a plurality of application programs at a license management server, the license
`
`management policy information including at least one of a user identity based
`
`policy, an administrator policy override definition or a user policy override
`
`10
`
`
`
`definition” as recited in the claim. It would not be apparent to one of ordinary skill
`
`in the art how to achieve the recited function for the “means for maintaining”
`
`limitation using a particular structure, as one of ordinary skill in the art would not
`
`know from the specification of the ‘766 Patent which specific algorithms were
`
`covered by the patent, and which were not. Petitioners further submit that a
`
`construction that requires “algorithm” for performing the function – without
`
`specifying the actual algorithm disclosed in the specification – is legally improper.
`
`WMS Gaming, 184 F.3d at 1349 (“In a means-plus-function claim in which the
`
`disclosed structure is a computer, or microprocessor, programmed to carry out an
`
`algorithm, the disclosed structure is not the general purpose computer, but rather
`
`the special purpose computer programmed to perform the disclosed algorithm.”);
`
`Aristocrat, 521 F.3d at 1336-37 (rejecting argument that “even if there is no
`
`disclosure of an algorithm in the patent, the disclosure of a microprocessor with
`
`‘appropriate programming’ is a sufficient disclosure of structure,” and finding
`
`claim indefinite because “there was no algorithm at all disclosed in the
`
`specification”).2
`
`2 See also Harris Corp. v. Ericsson, Inc., 417 F.3d 1241, 1253 (Fed. Cir.
`
`2005) (“the corresponding structure is the algorithm”); id. at 1249 (“[T]he
`
`corresponding structure for a §112 ¶6 claim for a computer-implemented function
`
`is the algorithm disclosed in the specification.”).
`
`11
`
`
`
`
`
`In light of the lacking disclosure in the ‘766 Patent regarding the “means for
`
`maintaining” limitation, Petitioners proposed the only structure that is clearly
`
`linked to the claimed function that does not render the claims indefinite: “a
`
`database and equivalents thereof.” There is no dispute that Olsen discloses this
`
`structure. See, e.g., Decision at 12-13 (referencing “Olsen’s database 112” and
`
`“LSP 110”); 16-17. Accordingly, Petitioners hereby request reconsideration of the
`
`Decision, and request that the Board institute inter partes review of claims 7, 9, 13,
`
`and 15 of the ‘766 Patent.
`
`IV. CONCLUSION
`In view of the foregoing, Petitioners respectfully request that the Board
`
`reconsider its Decision and institute inter partes review of claims 7, 9, 13, and 15
`
`of the ‘766 Patent.
`
`Date: November 15, 2017
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`Respectfully submitted,
`ERISE IP, P.A.
`
`
`
`
`
`
`BY: /s/ Eric A. Buresh
`
`
`Eric A. Buresh, Reg. No. 50,394
`Counsel for Petitioners
`
`
`
`12
`
`
`
`
`Pursuant to 37 C.F.R. §§ 42.6(e), the undersigned certifies that on November
`15, 2017, a true and correct copy of this PETITIONERS’ REQUEST FOR
`REHEARING UNDER 37 C.F.R. § 42.71(d) was served on the counsel for Patent
`Owner by electronic means.
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`BY:
`
`
`CERTIFICATE OF SERVICE ON PATENT OWNER
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`ERISE IP, P.A.
`
`
`
`
`
`
` /s/ Mark C. Lang
`
`
`Eric A. Buresh, Reg. No. 50,394
`Mark C. Lang, Reg. No. 55,356
`Kathleen D. Fitterling, Reg. No. 62,950
`6201 College Blvd., Suite 300
`Overland Park, KS 66211
`P: (913) 777-5600
`F: (913) 777-5601
`eric.buresh@eriseip.com
`mark.lang@eriseip.com
`kathleen.fitterling@eriseip.com
`
`ATTORNEYS FOR PETITIONERS
`
`
`
`