- Applied Materials, Inc. v. Ocean Semiconductor LLCAll claims unpatentablePTAB · Feb 7, 2023 · IPR2022-00680 · APJ Miriam L Quinn · IPR · Final written decision
Claims 1–22 of the ’248 patent and claims 1–25 and 33–53 of the ’305 patent are unpatentable as obvious over Schulze and Gupta.
RulingsFinal written decision- Strike new argumentNew argument disregardedNew argument consideredGranted in part
“Petitioner an opportunity to respond raises concerns as to whether we should consider it. The issue of enablement is a mixed issue of law and fact, where underlying facts may be necessary to support such a conclusion. Minn. Mining & Mfg. Co. v. Chemque, Inc., 303 F.3d 1294, 1301 (Fed. Cir. 2002). The lack of evidence for the proposition that the art is not enabled and the further lack of an opportunity for rebuttal argument make this issue one that is not fully developed on the full record before us, and particularly because it was raised too late. Thus, we agree with Petitioner that this is an issue on” slip op. at 98
- Skill levelOther
“E. Level of Ordinary Skill in the Art Petitioner contends that a person having ordinary skill in the art” slip op. at 13
- Claim Construction › Intrinsic evidence (Phillips canons) › Preamble limiting or notPreamble not limitingDecided for petitioner
“A. Whether the preamble is limiting The standard that governs the significance of the “preamble” in claim” slip op. at 15
- Obviousness (§103) › Motivation to combine / reasonable expectation of successMotivation foundReasonable expectation foundDecided for petitioner
“monitoring and assessment system that is suitable for implementing the local scheduler and related data structures disclosed in Gupta, which is implemented in software. Id. ¶ 125. The need for a scheduler that works as a local optimizer is evidenced by the recognition in Gupta’s disclosure of real-time scheduling decisions, which are advantageous for dealing with unexpected or unplanned events in a manufacturing process. Id. ¶ 121 (citing Ex. 1008, 30:19−20). Further, the local optimization scheme would have been desirable for devising scheduling strategies for specific machines, resulting in a reduction of re-engineering efforts each time a new machine is added to the process flow. Id. ¶ 119. Because Gupta focuses on a specific machine and the strategy devised for each machine, the decision-making is simplified as it focuses on optimizing each machine and not re-programming the entire process flow for the factory. Id. ¶¶ 116−118. As stated above, the enhancement of using Gupta’s local optimizer stems from the recognition that global process flow scheduling was an NP-hard program of extensive computing costs; yet, Gupta solved for it by reducing the computational costs of scheduling through optimizing local machines, rather than performing global factory calculations each time an event occurs. Id. ¶¶ 114−116; Ex. 1008, 8:48−55, 13:22−34; 13:43−48; 14:6−11. The testimony of Dr. Shanfield is persuasive and supported by the facts, and we credit it accordingly. Dr. Shanfield regarding the expectation of success is supported by the facts and we credit it accordingly. Dr. Shanfield opines that Schulze’s system is specifically designed to monitor the state of the equipment and to provide notification of events like machine operation status transitions. 1342 Shanfield Decl. ¶ 123. Gupta’s local optimization scheme is driven by events like those that Schulze captures. Id. Gupta provides additional events that are useful for Schulze’s factory, such as machine loads and unloads. Id. Thus, we agree that Schulze’s system is particularly suitable for Gupta’s local optimization scheme. And according to Dr. Shanfield, the implementation of Gupta’s scheduler (together with its database and its related data structures) would be suitable for implementation in the computer of Schulze (automated monitoring and assessment system 107) because they are both software compatible. Id. ¶¶ 124−125. Once Gupta’s scheduler is implemented in Schulze’s computer, there are no changes to the functions performed by Schulze’s semiconductor fabrication system or Gupta’s local optimization scheme. Id. ¶ 127. The implementation would require adjustments to the local scheduler program, so that it can interpret and interact with the messages generated by the equipment and MES of Schulze. Id. However, Dr. Shanfield testifies that, “[b]ased on my industry experience, such routine adjustments to the local scheduler software involve tasks like making one-time inputs identifying status flags for each equipment module being characterized, and are well within the ordinary skill of a POSA.” Id. None of these tasks would have required special techniques or extraordinary skill given the well-known components and standards used in the Schulze and Gupta implementations. Id. ¶ 128.” slip op. at 57
Patent outcomesUS 6,907,305 unpatentableClaim construction§ 103 obviousnesscites Phillips · KSRPatents in suitUS 6,907,305 - Applied Materials, Inc. v. Ocean Semiconductor LLCAll claims unpatentablePTAB · Feb 7, 2023 · IPR2021-01344 · APJ Miriam L Quinn · IPR · Final written decision
Claims 1–22 of the ’248 patent and claims 1–25 and 33–53 of the ’305 patent are unpatentable as obvious over Schulze and Gupta.
RulingsFinal written decision- Claim Construction › Intrinsic evidence (Phillips canons) › Preamble limiting or notPreamble not limitingDecided for petitioner
“A. Whether the preamble is limiting The standard that governs the significance of the “preamble” in claim” slip op. at 15
- Claim Construction › Threshold & procedure › Whether a term needs construction (O2 Micro)Term construed board ownOther
“the “software scheduling agent” broadly as being “capable of reactively scheduling appointments for activities in the process flow responsive to an automatic detection and notification of a plurality of predetermined events.” Ex. 1001, 32:7−11; Ex. 1001, 43:48−50, 44:54−58 (claim 44 of the ’305 patent recites similar language except it requires scheduling appointments for processing the work pieces through the process stations, instead of for activities in the process flow). Again, this language is agnostic as to which manufacturing domain entity the software scheduling agent is monitoring and scheduling for. For instance, an MSA receives any changes that occur to a particular machine. Ex. 1001, 7:61−62. If the availability of the machine changes, the MSA subscribed to monitor for notifications from that specific machine receives an alert and reacts appropriately. Id. at 7:62−67. Likewise, the change of an appointment for processing a lot causes a notification for the corresponding lot scheduling agent, which will then change its calendar accordingly. Id. at 9:51−59. Regardless of whether it is a machine or a lot, the claimed software scheduling agent is notified of an event, and then reactively schedules an appointment for a corresponding manufacturing entity domain in response to the event. It is therefore” slip op. at 29
- Obviousness (§103) › Motivation to combine / reasonable expectation of successMotivation foundReasonable expectation foundDecided for petitioner
“monitoring and assessment system that is suitable for implementing the local scheduler and related data structures disclosed in Gupta, which is implemented in software. Id. ¶ 125. The need for a scheduler that works as a local optimizer is evidenced by the recognition in Gupta’s disclosure of real-time scheduling decisions, which are advantageous for dealing with unexpected or unplanned events in a manufacturing process. Id. ¶ 121 (citing Ex. 1008, 30:19−20). Further, the local optimization scheme would have been desirable for devising scheduling strategies for specific machines, resulting in a reduction of re-engineering efforts each time a new machine is added to the process flow. Id. ¶ 119. Because Gupta focuses on a specific machine and the strategy devised for each machine, the decision-making is simplified as it focuses on optimizing each machine and not re-programming the entire process flow for the factory. Id. ¶¶ 116−118. As stated above, the enhancement of using Gupta’s local optimizer stems from the recognition that global process flow scheduling was an NP-hard program of extensive computing costs; yet, Gupta solved for it by reducing the computational costs of scheduling through optimizing local machines, rather than performing global factory calculations each time an event occurs. Id. ¶¶ 114−116; Ex. 1008, 8:48−55, 13:22−34; 13:43−48; 14:6−11. The testimony of Dr. Shanfield is persuasive and supported by the facts, and we credit it accordingly. Dr. Shanfield regarding the expectation of success is supported by the facts and we credit it accordingly. Dr. Shanfield opines that Schulze’s system is specifically designed to monitor the state of the equipment and to provide notification of events like machine operation status transitions. 1342 Shanfield Decl. ¶ 123. Gupta’s local optimization scheme is driven by events like those that Schulze captures. Id. Gupta provides additional events that are useful for Schulze’s factory, such as machine loads and unloads. Id. Thus, we agree that Schulze’s system is particularly suitable for Gupta’s local optimization scheme. And according to Dr. Shanfield, the implementation of Gupta’s scheduler (together with its database and its related data structures) would be suitable for implementation in the computer of Schulze (automated monitoring and assessment system 107) because they are both software compatible. Id. ¶¶ 124−125. Once Gupta’s scheduler is implemented in Schulze’s computer, there are no changes to the functions performed by Schulze’s semiconductor fabrication system or Gupta’s local optimization scheme. Id. ¶ 127. The implementation would require adjustments to the local scheduler program, so that it can interpret and interact with the messages generated by the equipment and MES of Schulze. Id. However, Dr. Shanfield testifies that, “[b]ased on my industry experience, such routine adjustments to the local scheduler software involve tasks like making one-time inputs identifying status flags for each equipment module being characterized, and are well within the ordinary skill of a POSA.” Id. None of these tasks would have required special techniques or extraordinary skill given the well-known components and standards used in the Schulze and Gupta implementations. Id. ¶ 128.” slip op. at 57
- Strike new argumentNew argument disregardedNew argument consideredGranted in part
“Petitioner an opportunity to respond raises concerns as to whether we should consider it. The issue of enablement is a mixed issue of law and fact, where underlying facts may be necessary to support such a conclusion. Minn. Mining & Mfg. Co. v. Chemque, Inc., 303 F.3d 1294, 1301 (Fed. Cir. 2002). The lack of evidence for the proposition that the art is not enabled and the further lack of an opportunity for rebuttal argument make this issue one that is not fully developed on the full record before us, and particularly because it was raised too late. Thus, we agree with Petitioner that this is an issue on” slip op. at 98
Patent outcomesUS 6,907,305 unpatentableClaim construction§ 103 obviousnesscites Phillips · KSRPatents in suitUS 6,907,305 - Applied Materials, Inc. v. Ocean Semiconductor LLCAll claims unpatentablePTAB · Feb 7, 2023 · IPR2021-01342 · APJ Miriam L Quinn · IPR · Final written decision
Claims 1–22 of the ’248 patent and claims 1–25 and 33–53 of the ’305 patent are unpatentable as obvious over Schulze and Gupta.
RulingsFinal written decision- Expert testimonyPetitioner expert creditedDecided for petitioner
“monitoring and assessment system that is suitable for implementing the local scheduler and related data structures disclosed in Gupta, which is implemented in software. Id. ¶ 125. The need for a scheduler that works as a local optimizer is evidenced by the recognition in Gupta’s disclosure of real-time scheduling decisions, which are advantageous for dealing with unexpected or unplanned events in a manufacturing process. Id. ¶ 121 (citing Ex. 1008, 30:19−20). Further, the local optimization scheme would have been desirable for devising scheduling strategies for specific machines, resulting in a reduction of re-engineering efforts each time a new machine is added to the process flow. Id. ¶ 119. Because Gupta focuses on a specific machine and the strategy devised for each machine, the decision-making is simplified as it focuses on optimizing each machine and not re-programming the entire process flow for the factory. Id. ¶¶ 116−118. As stated above, the enhancement of using Gupta’s local optimizer stems from the recognition that global process flow scheduling was an NP-hard program of extensive computing costs; yet, Gupta solved for it by reducing the computational costs of scheduling through optimizing local machines, rather than performing global factory calculations each time an event occurs. Id. ¶¶ 114−116; Ex. 1008, 8:48−55, 13:22−34; 13:43−48; 14:6−11. The testimony of Dr. Shanfield is persuasive and supported by the facts, and we credit it accordingly. Dr. Shanfield regarding the expectation of success is supported by the facts and we credit it accordingly. Dr. Shanfield opines that Schulze’s system is specifically designed to monitor the state of the equipment and to provide notification of events like machine operation status transitions. 1342 Shanfield Decl. ¶ 123. Gupta’s local optimization scheme is driven by events like those that Schulze captures. Id. Gupta provides additional events that are useful for Schulze’s factory, such as machine loads and unloads. Id. Thus, we agree that Schulze’s system is particularly suitable for Gupta’s local optimization scheme. And according to Dr. Shanfield, the implementation of Gupta’s scheduler (together with its database and its related data structures) would be suitable for implementation in the computer of Schulze (automated monitoring and assessment system 107) because they are both software compatible. Id. ¶¶ 124−125. Once Gupta’s scheduler is implemented in Schulze’s computer, there are no changes to the functions performed by Schulze’s semiconductor fabrication system or Gupta’s local optimization scheme. Id. ¶ 127. The implementation would require adjustments to the local scheduler program, so that it can interpret and interact with the messages generated by the equipment and MES of Schulze. Id. However, Dr. Shanfield testifies that, “[b]ased on my industry experience, such routine adjustments to the local scheduler software involve tasks like making one-time inputs identifying status flags for each equipment module being characterized, and are well within the ordinary skill of a POSA.” Id. None of these tasks would have required special techniques or extraordinary skill given the well-known components and standards used in the Schulze and Gupta implementations. Id. ¶ 128.” slip op. at 57
- Strike new argumentNew argument disregardedNew argument consideredGranted in part
“Petitioner an opportunity to respond raises concerns as to whether we should consider it. The issue of enablement is a mixed issue of law and fact, where underlying facts may be necessary to support such a conclusion. Minn. Mining & Mfg. Co. v. Chemque, Inc., 303 F.3d 1294, 1301 (Fed. Cir. 2002). The lack of evidence for the proposition that the art is not enabled and the further lack of an opportunity for rebuttal argument make this issue one that is not fully developed on the full record before us, and particularly because it was raised too late. Thus, we agree with Petitioner that this is an issue on” slip op. at 98
- Claim Construction › Intrinsic evidence (Phillips canons) › Preamble limiting or notPreamble not limitingDecided for petitioner
“A. Whether the preamble is limiting The standard that governs the significance of the “preamble” in claim” slip op. at 15
- Obviousness (§103) › Motivation to combine / reasonable expectation of successMotivation foundReasonable expectation foundUnpatentable
“monitoring and assessment system that is suitable for implementing the local scheduler and related data structures disclosed in Gupta, which is implemented in software. Id. ¶ 125. The need for a scheduler that works as a local optimizer is evidenced by the recognition in Gupta’s disclosure of real-time scheduling decisions, which are advantageous for dealing with unexpected or unplanned events in a manufacturing process. Id. ¶ 121 (citing Ex. 1008, 30:19−20). Further, the local optimization scheme would have been desirable for devising scheduling strategies for specific machines, resulting in a reduction of re-engineering efforts each time a new machine is added to the process flow. Id. ¶ 119. Because Gupta focuses on a specific machine and the strategy devised for each machine, the decision-making is simplified as it focuses on optimizing each machine and not re-programming the entire process flow for the factory. Id. ¶¶ 116−118. As stated above, the enhancement of using Gupta’s local optimizer stems from the recognition that global process flow scheduling was an NP-hard program of extensive computing costs; yet, Gupta solved for it by reducing the computational costs of scheduling through optimizing local machines, rather than performing global factory calculations each time an event occurs. Id. ¶¶ 114−116; Ex. 1008, 8:48−55, 13:22−34; 13:43−48; 14:6−11. The testimony of Dr. Shanfield is persuasive and supported by the facts, and we credit it accordingly. Dr. Shanfield regarding the expectation of success is supported by the facts and we credit it accordingly. Dr. Shanfield opines that Schulze’s system is specifically designed to monitor the state of the equipment and to provide notification of events like machine operation status transitions. 1342 Shanfield Decl. ¶ 123. Gupta’s local optimization scheme is driven by events like those that Schulze captures. Id. Gupta provides additional events that are useful for Schulze’s factory, such as machine loads and unloads. Id. Thus, we agree that Schulze’s system is particularly suitable for Gupta’s local optimization scheme. And according to Dr. Shanfield, the implementation of Gupta’s scheduler (together with its database and its related data structures) would be suitable for implementation in the computer of Schulze (automated monitoring and assessment system 107) because they are both software compatible. Id. ¶¶ 124−125. Once Gupta’s scheduler is implemented in Schulze’s computer, there are no changes to the functions performed by Schulze’s semiconductor fabrication system or Gupta’s local optimization scheme. Id. ¶ 127. The implementation would require adjustments to the local scheduler program, so that it can interpret and interact with the messages generated by the equipment and MES of Schulze. Id. However, Dr. Shanfield testifies that, “[b]ased on my industry experience, such routine adjustments to the local scheduler software involve tasks like making one-time inputs identifying status flags for each equipment module being characterized, and are well within the ordinary skill of a POSA.” Id. None of these tasks would have required special techniques or extraordinary skill given the well-known components and standards used in the Schulze and Gupta implementations. Id. ¶ 128.” slip op. at 57
Patent outcomesUS 6,968,248 unpatentableClaim construction§ 103 obviousnesscites Phillips · KSRPatents in suitUS 6,968,248 - Applied Materials, Inc. v. Ocean Semiconductor LLCAll claims unpatentablePTAB · Feb 7, 2023 · IPR2021-01339 · APJ David Cotta · IPR · Final written decision
Claims 1–16, 18–26, and 28–31 are unpatentable: claims 1, 2, 6, 9–13, 18, 19, 21–23, 28, and 29 are anticipated by Brcka; the remaining challenged claims are obvious over Brcka.
RulingsFinal written decision- Skill levelSkill level petitioner adoptedDecided for petitioner
“Petitioner’s proposal is generally consistent with the level of skill reflected in the specification and the cited prior art. See Okajima v. Bourdeau, 261 F.3d 1350, 1355 (Fed. Cir. 2001) (explaining that specific findings regarding ordinary skill level are not required “where the prior art itself reflects an appropriate level and a need for testimony is not shown”) 6 Patent Owner does not present objective indicia of nonobviousness in this case. See generally, PO Resp. 9 (quoting Litton Indus. Prods., Inc. v. Solid State Sys. Corp., 755 F.2d 158, 163 (Fed. Cir. 1985)). And we agree with Patent Owner that “additional education can compensate for less work experience and vice versa.” Accordingly, we adopt Petitioner’s proposed definition of the POSA level with the additional clarification proposed by Patent Owner.” slip op. at 9
- Claim Construction › Threshold & procedure › Whether a term needs construction (O2 Micro)No construction neededOther
“Petitioner does not identify any claim terms that require construction. Pet. 18. Patent Owner does not dispute Petitioner’s assertion that no claim terms require construction. PO Resp. 16–17. We do not find it necessary to construe the claims in order to resolve this case. See Nidec Motor Corp. v. Zhongshan Broad Ocean Motor Co. Ltd., 868 F.3d 1013, 1017 (Fed. Cir. 2017) (“[W]e need only construe terms ‘that are in controversy, and only to the extent necessary to resolve the controversy’” (quoting Vivid Techs., Inc. v. Am. Sci. & Eng’g, Inc., 200 F.3d 795, 803 (Fed. Cir. 1999))); Wellman, Inc. v. Eastman Chem. Co., 642 F.3d 1355, 1361 (Fed. Cir. 2011) (“[C]laim terms need only be construed ‘to the extent necessary to resolve the controversy’”).” slip op. at 10
- Expert testimonyPetitioner expert creditedDecided for petitioner
“The implicit premise of Patent Owner’s argument is that Brcka discloses only failures and thus does not disclose “fault detection.” However, we credit the testimony of Dr. Shanfield that “[g]enerally you always need a fault to have a failure occur. So when there is a failure, a fault has occurred.” Ex. 2003, 74:6–11; see also Ex. 1003 ¶ 37 (“A fault is an abnormal tool condition, such as when a parameter strays beyond its acceptable boundary. Faults may lead to failure, which is the ‘termination of the ability of an item to perform a required function.’”) (internal citation omitted), 81 (“Machine failure, though, means that a fault condition existed requiring termination of the machine function upon the wafer.”). Thus, Brcka’s disclosure of analyzing machine failures is also, necessarily, a disclosure of a analyzing a fault. Accordingly, we find that Petitioner has established, by a preponderance of the evidence, that Brcka discloses “performing in a computer a fault detection analysis relating to processing of a workpiece.”” slip op. at 20
- Novelty / Anticipation (§102) › Anticipation standard (single reference, every element)UnpatentableUnpatentable
“Petitioner cites to the embodiment depicted in Brcka’s Figure 4 as illustrating Brcka’s “fault detection analysis.” Pet. 32–33; see also Ex. 1003 ¶¶ 72–73. Figure 4 is a “flow diagram demonstrating operation of a learning system and [a] neural network model designed in accordance with at least one embodiment of [Brcka’s] invention.” Ex. 1005 ¶ 44. In step 415 of the operation disclosed in Figure 4, “a determination is made whether maintenance has been performed or a machine failure has occurred.” Id. ¶ 44, Fig. 4. If either of these things has happened, “a new reward value is calculated.” Id. In step 440, “a determination is made whether maintenance is needed.” Id. ¶ 45, Fig. 4. Thus, Brcka determines whether a failure has occurred, accounts for this determination by assigning a “reward value” (Fig. 4, step 425), and then decides whether maintenance is needed. On this record, the analysis reflected in these steps qualifies as a “fault detection analysis.” We recognize that Brcka’s fault detection analysis is used in a method that includes a predictive component. But, we do not find anything in the language of claim 1 that precludes performing the fault detection analysis as part of a predictive model. Indeed, the claim language requires only “performing . . . a fault detection analysis.” Moreover, the “fault detection” itself (i.e., Brcka’s step 415), as opposed to the analysis of the detected fault, is backward-looking, not predictive; it determines “whether . . . a machine failure has occurred.” Id. ¶ 44 (emphasis added).” slip op. at 16
Patent outcomesUS 8,676,538 unpatentableClaim construction§ 102 anticipation§ 103 obviousnesscites KSR · GrahamPatents in suitUS 8,676,538 - PTAB · Aug 12, 2020 · PGR2019-00032 · APJ David Cotta · PGR · Final written decision
The Board granted cancellation of claim 8 and denied entry of substitute claim 11 because Petitioner showed it would have been obvious over Omura, Tsuji, and the knowledge of a person of ordinary skill.
RulingsFinal written decision- Skill levelSkill level patent owner adoptedDecided for patent owner
“In our Institution Decision, we agreed with the position Patent Owners took in their Preliminary Response – i.e, that the focus of the challenged claims was enzyme-based biosensors and thus the POSA would have more than just a familiarity with enzyme-based biosensors and protein chemistry. Inst. Dec. 8–9. Accordingly, based on the record before us at the time, we accepted the definition provided in Patent Owners’ Preliminary Response, which was consistent with the level of skill reflected in the asserted prior art references and in the specification of the ‘987 patent. See Okajima v. Bourdeau, 261 F.3d 1350, 1355 (Fed. Cir. 2001) (the prior art itself can reflect the appropriate level of ordinary skill in the art). Neither party challenges the identification of the POSA set forth in our Institution Decision. See generally, R. Mot.; Opp.; Reply; Sur-reply. Additionally, we find that the fully developed trial record supports the POSA identification we made in our Institution Decision. Accordingly, in this decision, we apply the identification of the POSA set forth in our Institution Decision. Inst. Dec. 9.” slip op. at 9
- Claim Construction › Threshold & procedure › Whether a term needs construction (O2 Micro)No construction neededOther
“Only those terms that are in controversy need be construed, and only to the extent necessary to resolve the controversy. See Nidec Motor Corp. v. Zhongshan Broad Ocean Motor Co., 868 F.3d 1013, 1017 (Fed. Cir. 2017) (citing Vivid Techs., Inc. v. Am. Sci. & Eng’g, Inc., 200 F.3d 795, 803 (Fed. Cir. 1999)). For purposes of this decision, we need not expressly construe any claim terms.” slip op. at 10
- PTAB / AIA Trials › Motions to amend / substitute claimsMotion to amend granted in partGranted in part
“first, substitute claim 11 would have been obvious over Omura in view of the knowledge of the POSA, and second, substitute claim 11 would have been obvious over the combination of Omura and Tsuji in view of the knowledge of the POSA. Opp. 7–24. We have considered the question of patentability in view of all the evidence and arguments presented in this proceeding. Based on the record developed during this proceeding, we determine that Petitioner has shown by a preponderance of the evidence that substitute claim 11 would have been obvious over the combination of Omura, Tsuji, and the knowledge of the POSA. Because Petitioner has proven that substitute claim 11 would have been obvious, as discussed in detail below, we do not consider whether Patent Owners’ motion otherwise complies with the statutory and regulatory requirements for a motion to amend. See, 35 U.S.C. § 326(d)(1)(B) (requiring that the amendment propose a “reasonable number of substitute claims” and requiring that the substitute claims do “not enlarge the scope of the claims of the patent or introduce new matter”); 37 C.F.R. § 42.221 (additionally providing, inter alia, that a motion to amend “may be denied where . . . [t]he amendment does not respond to a ground of unpatentability involved in the trial”). Similarly, because we have determined that substitute claim 11 would have been obvious over the combination of Omura, Tsuji, and the knowledge of the POSA, as discussed in detail below, we do not reach the question of whether substitute claim 11 would also have been obvious over only Omura in view of knowledge of the POSA.” slip op. at 11
- Obviousness (§103) › Motivation to combine / reasonable expectation of successMotivation foundReasonable expectation foundUnpatentable
“includes “research experience and/or knowledge in enzymology . . . and biosensors,” we agree with Petitioner that it would have been obvious to a POSA to substitute FAD-conjugated glucose dehydrogenase derived from the claimed strain of Aspergillus oryzae for FAD-conjugated glucose dehydrogenase derived from Aspergillus terreus as disclosed in Omura.” slip op. at 18
Claim construction§ 103 obviousnesscites KSR · GrahamPatents in suitUS 9,976,125
Holdings, summaries, rulings, issues, outcomes, winners and claim constructions shown for a decision were generated by a large language model reading the opinion. They are a guide to the decision, not the decision. Confirm every one against the court's own text before relying on it. Outcomes read from the patent owner’s side. Party names are extracted from the decision and are missing on about 900 short Director denials and scans, which carry the trial number instead.