- Asetek Danmark A/S v. Coolit Systems, Inc.Some claims unpatentablePTAB · Oct 12, 2021 · IPR2020-00825 · APJ Scott C Moore · IPR · Final written decision
Claims 1, 2, 4, 5, and 9 are unpatentable over Bezama or Bezama and Chiang; claims 13–15 were not shown unpatentable over Kang or Anderson.
RulingsFinal written decision- Disclosure Requirements (§112) › Written description (Ariad)Not entitled to earlier dateDecided for petitioner
“the 2007 Provisional describes the material of which plate 240 is made, much less indicates that the inventor had possession of an invention including a manifold body (i.e., plate 240) defining a pair of compliant surfaces. See generally Ex. 1005.” slip op. at 24
- Novelty / Anticipation (§102) › Anticipation standard (single reference, every element)UnpatentableUnpatentable
“Bezama discloses all limitations of claims 1 and 9. See Pet. 23–39; Ex. 1003 ¶¶ 65–86. Patent Owner’s attempt to disqualify Bezama as prior art fails because claims 1 and 9 are not entitled to a priority date earlier than July 27, 2011. See supra § II.E. On this record, and considering all of the evidence and arguments put forth by the parties, we find that Petitioner has shown by a preponderance of the evidence that claims 1 and 9 are unpatentable as anticipated by Bezama. G.” slip op. at 31
- Obviousness (§103) › Motivation to combine / reasonable expectation of successMotivation foundUnpatentable
“teach or suggest each limitation recited in claims 2, 4, and 5, and these contentions are supported by testimony from Dr. Tilton. See Pet. 54–66; Ex. 1003 ¶¶ 114–137. Petitioner additionally identifies rationales for why a person of ordinary skill in the art would have had reason to combine the teachings of Bezama and Chiang to arrive at the inventions recited in those claims. See id.” slip op. at 31
- Expert testimonyPatent owner expert creditedPetitioner expert discountedDecided for patent owner
“bifurcated flow limitation of claim 13. Resp. 46–52. In particular, Patent Owner asserts, with support from Dr. Pokharna, that the fluid entering any of Kang’s inlet channels 44 would mix with fluid from adjacent inlet channels, and that the bulk of the fluid from any inlet channel would exit through adjacent outlet channels, rather than traveling to the outer-most outlet channels as Petitioner suggests. Id. at 47–48; Ex. 2038 ¶¶ 105–114. Patent Owner’s argument is persuasive and supported by well-reasoned testimony from Dr. Pokharna. For example, Dr. Pokharna correctly points out that Dr. Tilton has admitted that microchannels have high flow resistance. Ex. 2038 ¶ 112 (citing Ex. 1003 ¶ 158). We agree with Dr. Pokharna that because of this high flow resistance, fluid entering a microchannel through any inlet channel 44 would tend to exit through the path of least resistance (i.e., the nearest outlet channel 47) rather than traveling to each end of the microchannel and exiting through the most distant outlets. See id. ¶ 112. contention that in Kang that the bulk of any fluid entering a microchannel would exit through the closest outlet channel 47. See Reply 17–18. Instead, Petitioner contends that at least some portion of the fluid will reach each end of the microchannel. See id. This argument is not persuasive because claim 13 recites that the flow that enters each channel through the one aperture “bifurcates into two sub flows,” and requires that each of the recited outlet regions receives “one of the two sub flows” or “the other of the two sub flows.” This claim language is not satisfied by an outlet region that receives only a portion of one of the two recited sub flows. Claim 13 requires that each outlet region receive one of the same two sub flows that originally entered the microchannel. See also Ex. 2038 ¶ 108. Petitioner neither proposes a claim construction that would encompass such an embodiment, nor offers any persuasive evidence that a POSITA would read claim 13 to encompass such an embodiment. Accordingly, on this record, we are not persuaded by a preponderance of the evidence that Kang teaches or suggests a flow of heat exchange fluid that is bifurcated into two sub flows within each of the microchannels, wherein each of these two sub flows is received by one of the two outlet regions adjacent to the opposing ends of the microchannels, in the manner required by claim 13.” slip op. at 36
Patent outcomesUS 10,274,266 mixed§ 102 anticipation§ 103 obviousness§ 112 disclosurecites Phillips · KSR · GrahamPatents in suitUS 10,274,266 - Qualcomm Inc. v. Bandspeed, Inc.Some claims unpatentablePTAB · Sep 7, 2016 · IPR2015-01580 · APJ Patrick M Boucher · IPR · Final written decision
Claims 5, 6, 8, 17, 18, and 20 are unpatentable; claims 7 and 19 were not shown unpatentable because Cuffaro does not disclose a specified number of votes and the obviousness testimony was insufficient.
RulingsFinal written decision- PTAB / AIA Trials › Joinder §315(c) / SAS all-or-nothingJoinder, grantedGranted
“After institution, Qualcomm Inc. filed substantially the same petition in IPR2015-01580 (IPR2015-01580, Paper 1), together with a Motion for Joinder of IPR2015-01580 with the instant proceeding (IPR2015-01580, Paper 2). On September 17, 2015, we granted a motion to terminate this proceeding with respect to MediaTek Inc. and MediaTek USA, Inc., but not as to Patent Owner, leaving only Patent Owner as a party to the proceeding. Paper 22. On November 16, 2015, we granted Qualcomm Inc.’s Motion for Joinder, joining Qualcomm Inc. to the instant proceeding. Paper 23. Qualcomm Inc. (“Petitioner”) is now the sole petitioner.” slip op. at 2
- Claim Construction › Functional claiming / §112(f) means-plus-function › Whether §112(f) applies (Williamson, nonce words)§112(f) appliesTerm construed petitioner constructionDecided for petitioner
“phrase “means for . . . .” Petitioner construes these terms in accordance with 35 U.S.C. § 112 ¶ 6, identifying an algorithm described in the specification corresponding to each “means” limitation. Pet. 7–9 (citing Ex. 1001, col. 8, l. 8–38, col. 8, ll. 49–col. 9, l. 16, col. 19, l. 25–col. 20, l. 67). Petitioner identifies a general purpose computer, processor 704 in Figure 7, as structure for “executing the instructions associated with the corresponding function” recited in each “means limitation,” except for the “means fro [sic] the first participant to communicate . . .” recited in claims 5 and 20. Pet. 7–9 (citing Ex. 1001, Fig. 7, col. 25, ll. 13–18). For the “means fro [sic] the first participant to communicate” limitation, Petitioner identifies transceiver 216, shown in Figure 2, reproduced supra. Pet. 9 (citing Ex. 1001, Fig. 2, col. 9, ll. 54–59). Patent Owner does not contest these identifications. We agree with Petitioner’s identifications and adopt them as our constructions of the means-plus-function limitations. Specifically, as to those means-plus-function limitations that correspond to processor 704 in Figure 7, Petitioner identifies in its claim chart the algorithm described in the specification for performing each function of these means. Pet. 8–9; See also Function Media, L.L.C. v. Google, Inc., 708 F.3d 1310, 1318 (Fed. Cir. 2013) (“When dealing with a ‘special purpose computer-implemented means-plus-function limitation,’ [the Federal Circuit] require[s] the specification to disclose the algorithm for performing the function.”); Blackboard, Inc. v. Desire2Learn, Inc., 574 F.3d 1371, 1384 (Fed. Cir. 2009) (“[W]hen a computer is referenced as support for a function in a means-plus-function claim, there must be some explanation of how the computer performs the claimed function.”).” slip op. at 8
- Claim Construction › Intrinsic evidence (Phillips canons) › Plain and ordinary meaning to a POSITATerm construed petitioner constructionDecided for petitioner
“We are not persuaded by this reasoning. As Petitioner observes, the embodiments of the ’624 patent identified by Patent Owner are characterized as “examples,” and a person of ordinary skill “would understand that the example scenarios of the specification are not necessarily limiting on the claims.” Reply 3 (citing Ding Supp. Decl. ¶ 6). In addition, Petitioner notes that claim language in related patents owned by Patent Owner explicitly refers to participants, evidencing Patent Owner’s understanding “how to expressly create participant-specific voting requirements in claims.” Id. at 3. At the oral hearing, Patent Owner suggested that explicit reference to participants in such other claim language “was because it wanted to clarify that each participant got a single vote,” and explained its position that, in the claims at issue in this proceeding, “participant is implicit in the claim language as it is.” Tr. 78:16–25. But the claims are directed to a “communications apparatus,” and recite “votes” in the context of what the “particular communications channel” “receives.” Nothing within the structure of the claims requires resolving the origin of such votes. Furthermore, Patent Owner’s proposed construction is inconsistent with the construction it agreed to before the district court in the Qualcomm Litigation. In that litigation, the parties agreed that the term “vote” should be construed as “a binary expression (to use or not to use),” a construction that makes no reference to the origin of the “vote” as from a participant or otherwise. Ex. 1014, 6. We see no compelling reason to excuse the inconsistency by adopting a narrower construction when the Board applies a claim-construction standard (broadest reasonable interpretation) that could only result in the same or a broader construction. See Amazon.com, Inc. v. Barnesandnoble.com, Inc., 239 F.3d 1343, 1351 (Fed. Cir. 2001) (“A patent may not, like a ‘nose of wax,’ be twisted one way to avoid anticipation and another to find infringement.” (quoting Sterner Lighting, Inc. v. Allied Elec. Supply, Inc., 431 F.2d 539, 544 (5th Cir. 1970))). Accordingly, we construe “votes to use a particular communications channel” as “expressions of preference for using the particular communications channel.”” slip op. at 10
- Novelty / Anticipation (§102) › Anticipation standard (single reference, every element)UnpatentableUnpatentable
“Patent Owner responds that “the Gerten device is not capable of and expressly teaches away from performing this functionality.” PO Resp. 15 (citing Melendez Decl. ¶ 33). Patent Owner contends that “Gerten’s disclosure is directed toward eliminating channels for use in an entire piconet as opposed to eliminating channels for use by certain participants within a piconet.” Id. at 16 (emphasis added). Patent Owner argues that Gerten does not disclose a selection kernel capable of maintaining synchronization between a master and more than one slave in a piconet, with the master and one slave using a default set of channels while the same master and a different slave use a different set of channels. Id. We are not persuaded that the absence of a specific teaching of such a selection kernel supports the conclusion that one of skill in the art would understand Gerten to function in the manner Patent Owner suggests. In this instance, Petitioner refers to two embodiments of Gerten “in which a first participant communicates with a second participant via a normal sequence and with another participant via an adaptive hopping sequence.” Reply 5. First, Figure 3 of Gerten is reproduced below. Figure 3 illustrates “methodology for determining and communicating channels to be avoided to a remote device.” Ex. 1003, col. 2, ll. 4–6. As illustrated in the drawing, a master unit performs a discovery process (block 110) upon connecting with a new slave unit. Ding Decl. ¶¶ 60, 64. If the slave unit is capable of using interference avoidance, the master unit begins the process of determining a modified set of channels for use (block 120). Id. ¶ 45. If a second slave unable to use interference avoidance enters the piconet, standard frequency hopping is used. Supp. Ding Decl. ¶ 9. Under Patent Owner’s characterization of Gerten, entry of the second slave into the network would require the first slave necessarily to revert back to the default hopping sequence. Id. ¶ 10. But this would undermine the stated benefits of Gerten, which explicitly discloses: The above process can be applied to a Bluetooth example and includes identification of a Bluetooth device’s ability to support interference avoidance, the measurements of signal strength on all channels and identification of which channel should not be used without violating the FCC rules, a method of modifying the Bluetooth hop sequence so that it will avoid channels containing strong or fixed interferers while still supporting standard Bluetooth hopping with other non-enabled members of the piconet and a method of relating necessary interference avoidance information to the remote Bluetooth devices. Ex. 1003, col. 4, l. 66–col. 5, l. 9 (emphasis added).” slip op. at 17
Patent outcomesUS 7,477,624 mixedClaim construction§ 102 anticipation§ 103 obviousnessPatents in suitUS 7,477,624 - Samsung Electronics Co., Ltd. / Samsung Electronics America, Inc. et al. v. Straight Path IP Group, Inc.Some claims unpatentablePTAB · Mar 4, 2016 · IPR2015-01011 · APJ Kalyan K Deshpande · IPR · Final written decision
Claims 1, 2, 5, and 10 of the ’469 patent are unpatentable; the remaining challenged claims were not shown unpatentable because the cited art did not establish current network connection status.
RulingsFinal written decision- Claim Construction › Intrinsic evidence (Phillips canons) › Plain and ordinary meaning to a POSITATerm construed board ownDecided for patent owner
“connected to the computer network” has a facially clear meaning, that “the query transmitted to the server seeks to determine whether the second unit is connected at that time, i.e., connected at the time that the query is sent.” Straight Path, 806 F.3d at 1360.11 The Federal Circuit held that the query asks “whether the device ‘is’ connected, not whether it was connected or whether it is still registered as being connected even if that registration information is no longer accurate.” Id. The Federal Circuit further explained that “[i]t is not a reasonable interpretation of the claim language . . . to say that it is satisfied by a query that asks only for registration information, regardless of its current accuracy.” Id. The Federal Circuit explained, “[w]hen claim language has as plain a meaning on an issue as the language does here, leaving no genuine uncertainties on interpretive questions relevant to the case, it is particularly difficult to conclude that the specification reasonably supports a different meaning. The specification plays a more limited role than in the common situation where claim terms are uncertain in meaning in relevant respects.” Id. at 1361. Accordingly, the Federal Circuit construed the limitation “is connected to the computer network” as “is connected to the computer network at the time the query is transmitted to the server.” Id. at 1363. 11 Petitioner argues that the relevant specifications do not include an embodiment that “‘guarantees’ or ‘ensures’ the availability of the second process at any given point in time” and the file histories of the challenged patents “expressly reject[] the notion that the claims contain any guarantee of perfect accuracy.” Addʼl Br. 6. In Straight Path, the Federal Circuit did not offer a view as to the sufficiency of the written description or enablement based on the claim construction provided by the Federal Circuit because “written-description and enablement challenges were not, and could not have been, part of the inter parties review.” Straight Path, 806 F.3d at 1363. We similarly do not offer any determination as to whether this claim construction is supported by the specifications of the ʼ704 patent, ʼ469 patent, and the ʼ121 patent. Petitioner and Patent Owner argue that the limitations “on-line status” and “is accessible” have the same meaning as “is connected to the computer network.” See 66 Pet. 24–30; 66 PO Resp. 32‒35; 67 Pet. 25–31; 67 PO Resp. 30‒34; 68 Pet. 24–29; 68 PO Resp. 36‒42. Similar to “is connected to a computer network,” the “on-line status” and “is accessible” of the second process are recited in the present tense, and, therefore must be determined at the time of the querying whether the second process “is accessible” or selecting of the process having an “on-line status.” Therefore, we construe “on-line status” and “is accessible” as having the same meaning as “is connected to the computer network.”” slip op. at 11
- Obviousness (§103) › Graham factors (scope of art, differences, level of skill)Not shown unpatentableNot shown unpatentable
“and NetBIOS fail to determine whether a computer or process is connected to the computer network. PO Resp. 35, 49–51. In view of our construction of this claim limitation, we agree with Patent Owner. Microsoft Manual discloses that once a computer is registered with the WINS server (which is a NetBIOS Name Server (NBNS)) as active and on-line, the WINS server maintains a database of names and addresses as active and on-line by (1) releasing names once a computer is shut down properly and (2) requiring a renewal time period in which a computer must reregister. Ex. 1012, 62– 63, 68–69. Microsoft Manual discloses that in response to User Datagram Protocol (UDP) name queries, “a mapping in the database does not ensure that the related device is currently running.” Id. at 68. Microsoft Manual further explains that a “local WINS database should periodically be cleared of released entries and old entries that were registered at another WINS server but did not get removed from this WINS database for some reason.” Id. at 150. In other words, Microsoft Manual discloses that the WINS database may include entries of computers that are not currently connected to the WINS network. Accordingly, a query to as to whether a second process “is connected to the computer network” in Microsoft Manual will not determine whether the second process is connected to the WINS network at the time that the query is transmitted to the server. As discussed above in our claim construction analysis above (see Section I.E.1), a query as to whether a process “is connected to a computer network” or has an “on-line” status asks “whether the device ‘is’ connected, not whether it was connected or whether it is still registered as being connected even if that registration information is no longer accurate. It is not a reasonable interpretation of the claim language . . . to say that it is satisfied by a query that asks only for registration information, regardless of its current accuracy.” Straight Path, 806 F.3d at 1360. Microsoft Manual discloses that the WINS server has information that a process “was” connected to the computer network, and that information may no longer be accurate. See Ex. 1012, 68, 150. As such, we determine that Microsoft Manual does not disclose the claimed “is connected to the computer network,” “on-line status,” or “is accessible,” as construed herein.” slip op. at 19
- PTAB / AIA Trials › Joinder §315(c) / SAS all-or-nothingJoinder, grantedGranted
“and AVAYA, Inc. (“AVAYA”) filed three Petitions and Motions to Join the IPR2014-01366, IPR2014-01367, and IPR2014-01368 proceedings. IPR2015-01011, Papers 2, 4; IPR2015-01007, Papers 3, 4; IPR2015-01006, Papers 2, 4. We granted these motions and joined Samsung, Cisco, and AVAYA (collectively, “Petitioner”) to these inter partes reviews. 66 Paper 26; 67 Paper 23; 68 Paper 25.” slip op. at 3
Patent outcomesUS 6,108,704 mixedClaim construction§ 103 obviousnesscites PhillipsPatents in suitUS 6,108,704 - Samsung Electronics Co., Ltd. / Samsung Electronics America, Inc. et al. v. Straight Path IP Group, Inc.Some claims unpatentablePTAB · Mar 4, 2016 · IPR2015-01007 · APJ Kalyan K Deshpande · IPR · Final written decision
Claims 1, 2, 5, and 10 of the ’469 patent were held unpatentable; the remaining challenged claims were not shown unpatentable because the cited art did not establish current network connection status.
RulingsFinal written decision- BurdenFwd mixedMixed
“and NetBIOS fail to determine whether a computer or process is connected to the computer network. PO Resp. 35, 49–51. In view of our construction of this claim limitation, we agree with Patent Owner. Microsoft Manual discloses that once a computer is registered with the WINS server (which is a NetBIOS Name Server (NBNS)) as active and on-line, the WINS server maintains a database of names and addresses as active and on-line by (1) releasing names once a computer is shut down properly and (2) requiring a renewal time period in which a computer must reregister. Ex. 1012, 62– 63, 68–69. Microsoft Manual discloses that in response to User Datagram Protocol (UDP) name queries, “a mapping in the database does not ensure that the related device is currently running.” Id. at 68. Microsoft Manual further explains that a “local WINS database should periodically be cleared of released entries and old entries that were registered at another WINS server but did not get removed from this WINS database for some reason.” Id. at 150. In other words, Microsoft Manual discloses that the WINS database may include entries of computers that are not currently connected to the WINS network. Accordingly, a query to as to whether a second process “is connected to the computer network” in Microsoft Manual will not determine whether the second process is connected to the WINS network at the time that the query is transmitted to the server. As discussed above in our claim construction analysis above (see Section I.E.1), a query as to whether a process “is connected to a computer network” or has an “on-line” status asks “whether the device ‘is’ connected, not whether it was connected or whether it is still registered as being connected even if that registration information is no longer accurate. It is not a reasonable interpretation of the claim language . . . to say that it is satisfied by a query that asks only for registration information, regardless of its current accuracy.” Straight Path, 806 F.3d at 1360. Microsoft Manual discloses that the WINS server has information that a process “was” connected to the computer network, and that information may no longer be accurate. See Ex. 1012, 68, 150. As such, we determine that Microsoft Manual does not disclose the claimed “is connected to the computer network,” “on-line status,” or “is accessible,” as construed herein.” slip op. at 19
- Claim Construction › Intrinsic evidence (Phillips canons) › Plain and ordinary meaning to a POSITATerm construed petitioner constructionDecided for petitioner
“In Ancora Techs., the Federal Circuit explained that “[t]he ordinary meaning of the word ‘program’ in the computer context encompasses both operating systems and the applications that run on them (as well as other types of computer programs)” and “‘to a computer programmer’ a program is merely a ‘set of instructions’ for a computer.” Ancora Techs., Inc. v. Apple, Inc., 744 F.3d 732, 734 (Fed. Cir. 2014). Applying this guidance to the case before us, we agree with Petitioner and construe the term “process” to mean “a running instance of a computer program or application,” where a “computer program” is a set of instructions for a computer that encompasses both operating systems and the applications that run on them. We further note that the ʼ704, ʼ469, and ʼ121 patent specifications interchange the terms “process” and “processing unit.” For example, the specifications explain that a first “processing unit” is “established in the database [] as an active on-line party.” Ex. 1001, 5:29–34. The claims recite the term “process.” Accordingly, our construction is also consistent with the specifications, such that a “process” includes a “processing unit” that is running a program (operating system) or application.” slip op. at 14
- Obviousness (§103) › Motivation to combine / reasonable expectation of successMotivation foundReasonable expectation foundUnpatentable
“Petitioner contends that “WINS is an implementation of NetBIOS” and, therefore, Petitioner contends that “one having skill in the art would have known about and been motivated to combine Microsoft Manual with NetBIOS.” Id. at 34 (citing 67 Ex. 1004 ¶¶ 88–89). We are persuaded by Petitioner that the combination is reasonable because Microsoft Manual demonstrates that Microsoft TCP/IP has combined the elements of NetBIOS and Microsoft Manual in the same manner in which Petitioner proposes to combine NetBIOS and Microsoft Manual. See 67 Ex. 1012, 3, 11. Microsoft Manual discloses that Microsoft TCP/IP for Windows NT provides support for application interfaces, including NetBIOS for establishing logical names and sessions on the network. Id. at 11. Microsoft Manual describes that “[w]hen WINS servers are in place on the network, NetBIOS over TCP/IP resolves names on a client computer by communication with the WINS server.” 67 Pet. 34 (quoting 67 Ex. 1012, 62). We are persuaded that Microsoft TCP/IP for Windows NT utilizes NetBIOS features for name resolution, as disclosed by Microsoft Manual, and a person with ordinary skill in the art would have readily combined the disclosures of Microsoft Manual and Microsoft Manual.” slip op. at 25
- Obviousness (§103) › Graham factors (scope of art, differences, level of skill)Not shown unpatentableNot shown unpatentable
“and NetBIOS fail to determine whether a computer or process is connected to the computer network. PO Resp. 35, 49–51. In view of our construction of this claim limitation, we agree with Patent Owner. Microsoft Manual discloses that once a computer is registered with the WINS server (which is a NetBIOS Name Server (NBNS)) as active and on-line, the WINS server maintains a database of names and addresses as active and on-line by (1) releasing names once a computer is shut down properly and (2) requiring a renewal time period in which a computer must reregister. Ex. 1012, 62– 63, 68–69. Microsoft Manual discloses that in response to User Datagram Protocol (UDP) name queries, “a mapping in the database does not ensure that the related device is currently running.” Id. at 68. Microsoft Manual further explains that a “local WINS database should periodically be cleared of released entries and old entries that were registered at another WINS server but did not get removed from this WINS database for some reason.” Id. at 150. In other words, Microsoft Manual discloses that the WINS database may include entries of computers that are not currently connected to the WINS network. Accordingly, a query to as to whether a second process “is connected to the computer network” in Microsoft Manual will not determine whether the second process is connected to the WINS network at the time that the query is transmitted to the server. As discussed above in our claim construction analysis above (see Section I.E.1), a query as to whether a process “is connected to a computer network” or has an “on-line” status asks “whether the device ‘is’ connected, not whether it was connected or whether it is still registered as being connected even if that registration information is no longer accurate. It is not a reasonable interpretation of the claim language . . . to say that it is satisfied by a query that asks only for registration information, regardless of its current accuracy.” Straight Path, 806 F.3d at 1360. Microsoft Manual discloses that the WINS server has information that a process “was” connected to the computer network, and that information may no longer be accurate. See Ex. 1012, 68, 150. As such, we determine that Microsoft Manual does not disclose the claimed “is connected to the computer network,” “on-line status,” or “is accessible,” as construed herein. Similarly, NetBIOS discloses a registration process for resources or nodes to receive a unique name by registering a name. Ex. 1014, 379. During a name query (discovery), a datagram is sent requesting the name and address of another resource. Id. at 396. The NBNS maintains a database of resource names through explicit name deletion, where the node specifies a deletion function and implicit name deletion, which occurs when a node ceases operation. Id. at 379. NetBIOS explains that implicit name deletion “is a frequent occurrence.” Id. Implicit name deletion is managed by assigning nodes a specified lifetime for registered names, where a name is silently released if a node fails to refresh the registered name before the lifetime expires. Id. NetBIOS further discloses a mechanism where the NBNS may correct the information stored after an incorrect response is provided to a requesting node. See id. at 409. However, similar to Microsoft Manual, NetBIOS discloses that the information stored by the NBNS may be incorrect, and, therefore, will not determine whether a second process is connected to the computer network at the time that the query is transmitted to the server. Therefore, NetBIOS also does not disclose the claimed “is connected to the computer network,” “on-line status,” or “is accessible.” Given that the combination of Microsoft Manual and NetBIOS fails to teach or suggest the claims as construed, we need not reach the remaining arguments presented by Petitioner and Patent Owner.” slip op. at 19
Patent outcomesUS 6,009,469 mixedClaim construction§ 103 obviousnesscites PhillipsPatents in suitUS 6,009,469
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.