IP Library Granted Patent US 12,699,732
Granted Patent B2
US 12,699,732 · App. 16/663,623 · Granted Aug 4, 2026

Systems and methods for mapping a building schema into a graph data schema

Inventors: Vish Ramamurti (San Leandro, CA); Zhongyi Jin (Santa Clara, CA); Young M. Lee (Old Westbury, NY); Youngchoon Park (Brookfield, WI); Sudhi R. Sinha (Milwaukee, WI); Jason B. Koh (Milwaukee, WI); Simin Zhou (Santa Clara, CA)
Assignee: TYCO FIRE & SECURITY GMBH
G06F16/9024G06F9/451G06F16/212
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,699,732
App. No.
16/663,623
Granted
Aug 4, 2026
Kind
B2
Abstract

A building schema mapping system, the system including one or more memory devices configured to store instructions, that, when executed by one or more processors, cause the one or more processors to receive strings in a first schema, each string representing at least one of a point, building equipment, or a building space, extract relationships from the strings, each relationship of the relationships indicating a particular relationship between a first string of the strings and a second string of the strings, label each of the strings based on characters of each of the strings, and generate a graph data structure of a second schema based on the relationships and the label of each of the strings.

Claims (73)

1 . A building schema mapping system, the building schema mapping system comprising one or more memory devices configured to store instructions, that, when executed by one or more processors, cause the one or more processors to:

receive a plurality of strings in a first schema, each string representing at least one of a point, building equipment, or a building space;

extract a plurality of relationships from the plurality of strings by applying a plurality of extraction rules that define the plurality of relationships to the plurality of strings, each relationship of the plurality of relationships indicating a particular relationship between a first string of the plurality of strings and a second string of the plurality of strings;

generate, based on the plurality of strings, a tree structure comprising a plurality of levels representing a plurality of sub-strings of the plurality of strings, a plurality of top levels of the plurality of levels representing common sub-strings across two or more of the plurality of strings, one or more bottom levels of the plurality of levels representing one or more unique sub-strings of the plurality of strings, wherein a common sub-string of the common sub-strings is represented in the tree structure by a single top level of the plurality of top levels;

label the plurality of sub-strings of the plurality of levels of the tree structure by assigning a tag-set to a sub-string of the plurality of sub-strings based on tags identified for the sub-string, the tag-set comprising a group of tags describing an entity indicated by the sub-string; and

generate a graph data structure of a second schema based on the plurality of relationships and a label of each of the plurality of strings, wherein one label is based on the tag-set of the sub-string.

2 . The building schema mapping system of claim 1 , wherein the instructions cause the one or more processors to:

receive a naming convention from an external system, the naming convention indicating a mapping between a particular character or a particular character group and a tag of a predefined set of tags;

generate or update a dictionary, the dictionary comprising the mapping between the particular character or the particular character group and the tag of the predefined set of tags; and

label each of the plurality of strings based on characters of each of the plurality of strings with the dictionary by matching the characters of each of the plurality of strings to dictionary characters of the predefined set of tags.

3 . The building schema mapping system of claim 1 , wherein the instructions cause the one or more processors to:

assign an index value to each character of each of the plurality of strings;

determine a beginning index values, one or more middle index values, and an ending index value for one or more groups of characters of each of the plurality of strings, the one or more groups of characters associated with a tag of a set of predefined tags; and

assign a particular beginning index value and one or more particular middle index values to the tag.

4 . The building schema mapping system of claim 1 , wherein the plurality of strings are at least one of sub-string sections of a single string or are each a separate string.

5 . The building schema mapping system of claim 1 , wherein the instructions cause the one or more processors to label each of the plurality of strings based on characters of each of the plurality of strings by:

assigning groups of characters of each of the plurality of strings a particular tag of a predefined set of tags; and

assigning each of the plurality of strings a particular tag-set of a predefined set of tag-sets based on the particular tag assigned to the groups of characters of each of the plurality of strings.

6 . The building schema mapping system of claim 5 , wherein the instructions cause the one or more processors to:

generate a type relationship for each of the plurality of strings, the type relationship relating each of the plurality of strings to the tag-set assigned to each of the plurality of strings; and

generate the graph data structure further based on the type relationship of each of the plurality of strings and the tag-set assigned to each of the plurality of strings.

7 . The building schema mapping system of claim 1 , wherein the instructions cause the one or more processors to generate the tree structure by:

identifying a root sub-string common across all of the plurality of strings and one or more first leaf sub-strings common across two or more of the plurality of strings, and one or more second leaf sub-strings unique to each of the plurality of strings; and

generating the tree structure with the root sub-string, the one or more first leaf sub-strings, and the one or more second leaf sub-strings, wherein the tree structure comprises a plurality of branches across the root sub-string, the one or more first leaf sub-strings, and the one or more second leaf sub-strings, wherein each branch of the plurality of branches represents one string of the plurality of strings.

8 . The building schema mapping system of claim 7 , wherein the instructions cause the one or more processors to label each of the plurality of strings based on the tree structure by labeling leaf characters of the root sub-string, the one or more first leaf sub-strings, and the one or more second leaf sub-strings by labeling from the root sub-string to the one or more second leaf sub-strings according to a hierarchy of the tree structure.

9 . The building schema mapping system of claim 1 , wherein the instructions cause the one or more processors to:

assign, for one string of the plurality of strings, each of a plurality of character groups a tag;

identify one or more unknown character groups of the one string;

generate a user interface and cause the user interface to include an indication of the one or more unknown character groups; and

receive an input from a user via the user interface, the input indicating a manually assigned tag to each of the one or more unknown character groups.

10 . The building schema mapping system of claim 9 , wherein the instructions cause the user interface to include one or more suggested tags, wherein the input received from the user is a selection of one of the one or more suggested tags or is a manually defined tag.

11 . The building schema mapping system of claim 1 , wherein the instructions cause the one or more processors to:

assign, for one string of the plurality of strings, a plurality of tags, wherein each of a plurality of character groups is assigned one tag;

generate a user interface and cause the user interface to include an indication of the plurality of tags; and

receive an input from a user via the user interface, the input indicating an assigned tag-set to the one string.

12 . The building schema mapping system of claim 11 , wherein the instructions cause the user interface to include one or more suggested tag-sets, wherein the input received from the user is a selection of one of the one or more suggested tag-sets or is a manually defined tag-set.

13 . The building schema mapping system of claim 1 , wherein the instructions cause the one or more processors to:

label the plurality of strings by identifying an amount of characters of each of the plurality of strings and comparing the amount of characters to a threshold.

14 . The building schema mapping system of claim 1 , wherein the instructions cause the one or more processors to:

label the plurality of strings by assigning a plurality of tags to the string based on characters of the string; and

assign the tag-set to the string based on the plurality of tags.

15 . A method of building schema mapping, the method comprising:

receiving, by a processing circuit, a plurality of strings in a first schema, each string representing at least one of a point, building equipment, or a building space;

extracting, by the processing circuit, a plurality of relationships from the plurality of strings by applying a plurality of extraction rules that define the plurality of relationships to the plurality of strings, each relationship of the plurality of relationships indicating a particular relationship between a first string of the plurality of strings and a second string of the plurality of strings;

generating, by the processing circuit based on the plurality of strings, a tree structure comprising a plurality of levels representing a plurality of sub-strings of the plurality of strings, a plurality of top levels of the plurality of levels representing common sub-strings across two or more of the plurality of strings, one or more bottom levels of the plurality of levels representing one or more unique sub-strings of the plurality of strings, wherein a common sub-string of the common sub-strings is represented in the tree structure by a single top level of the plurality of top levels;

labeling, by the processing circuit, the plurality of sub-strings of the plurality of strings according to the plurality of levels of the tree structure by assigning a tag-set to a sub-string of the plurality of sub-strings based on tags identified for the sub-string, the tag-set comprising a group of tags describing an entity indicated by the sub-string; and

generating, by the processing circuit, a graph data structure of a second schema based on the plurality of relationships and a label of each of the plurality of strings, wherein one label is based on the tag-set of the sub-string.

16 . The method of claim 15 , further comprising:

receiving, by the processing circuit, a naming convention from an external system, the naming convention indicating a mapping between a particular character or a particular character group and a tag of a predefined set of tags;

generating or updating, by the processing circuit, a dictionary, the dictionary comprising the mapping between the particular character or the particular character group and the tag of the predefined set of tags; and

labeling, by the processing circuit, each of the plurality of strings based on characters of each of the plurality of strings with the dictionary by matching the characters of each of the plurality of strings to dictionary characters of the predefined set of tags.

17 . The method of claim 15 , further comprising:

assigning, by the processing circuit, an index value to each character of each of the plurality of strings;

determining, by the processing circuit, a beginning index values, one or more middle index values, and an ending index value for one or more groups of characters of each of the plurality of strings, the one or more groups of characters associated with a tag of a set of predefined tags; and

assigning, by the processing circuit, a particular beginning index value and one or more particular middle index values the tag.

18 . The method of claim 15 , wherein the plurality of strings are at least one of sub-string sections of a single string or are each a separate string.

19 . The method of claim 15 , wherein labeling, by the processing circuit, each of the plurality of strings based on characters of each of the plurality of strings comprises:

assigning groups of characters of each of the plurality of strings a particular tag of a predefined set of tags; and

assigning each of the plurality of strings a particular tag-set of a predefined set of tag-sets based on the particular tag assigned to the groups of characters of each of the plurality of strings.

20 . The method of claim 19 , further comprising:

generating, by the processing circuit, a type relationship for each of the plurality of strings, the type relationship relating each of the plurality of strings to the tag-set assigned to each of the plurality of strings; and

generating, by the processing circuit, the graph data structure further based on the type relationship of each of the plurality of strings and the tag-set assigned to each of the plurality of strings.

21 . A building system, the building system comprising:

a building management system, the building management system comprising one or more memory devices configured to store instructions, that, when executed by one or more processors, cause the one or more processors to operate one or more pieces of building equipment based on a plurality of strings of a first schema; and

a building schema mapping system comprising one or more memory devices and one or more processors, the building schema mapping system configured to:

receive the plurality of strings from the building management system, each string representing at least one of a point, building equipment, or a building space;

extract a plurality of relationships from the plurality of strings by applying a plurality of extraction rules that define the plurality of relationships to the plurality of strings, each relationship of the plurality of relationships indicating a particular relationship between a first string of the plurality of strings and a second string of the plurality of strings;

generate, based on the plurality of strings, a tree structure comprising a plurality of levels representing a plurality of sub-strings of the plurality of strings, a plurality of top levels of the plurality of levels representing common sub-strings across two or more of the plurality of strings, one or more bottom levels of the plurality of levels representing one or more unique sub-strings of the plurality of strings, where a common sub-string of the common sub-strings is represented in the tree structure by a single top level of the plurality of top levels;

label the plurality of sub-strings of the plurality of levels of the tree structure by assigning a tag-set to a sub-string of the plurality of sub-strings based on tags identified for the sub-string, the tag-set comprising a group of tags describing an entity indicated by the sub-string; and

generate a graph data structure of a second schema based on the plurality of relationships and a label of each of the plurality of strings, wherein one label is based on the tag-set of the sub-string.

22 . The building system of claim 21 , wherein the building schema mapping system is configured to label each of the plurality of strings based on characters of each of the plurality of strings by:

assigning groups of characters of each of the plurality of strings a particular tag of a predefined set of tags; and

assigning each of the plurality of strings a particular tag-set of a predefined set of tag-sets based on the particular tag assigned to the groups of characters of each of the plurality of strings.

Assignments (4)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Apr 9, 2024
From: JOHNSON CONTROLS TYCO IP HOLDINGS LLP
To: TYCO FIRE & SECURITY GMBH
Reel/Frame 067056/0552 →
NUNC PRO TUNC ASSIGNMENT Recorded Feb 4, 2022
From: JOHNSON CONTROLS TECHNOLOGY COMPANY
To: JOHNSON CONTROLS TYCO IP HOLDINGS LLP
Reel/Frame 058959/0764 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 15, 2020
From: RAMAMURTI, VISH; JIN, ZHONGYI; LEE, YOUNG M.; PARK, YOUNGCHOON; KOH, JASON B.; ZHOU, SIMIN
To: JOHNSON CONTROLS TECHNOLOGY COMPANY
Reel/Frame 052941/0465 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Mar 20, 2020
From: SINHA, SUDHI R.
To: JOHNSON CONTROLS TECHNOLOGY COMPANY
Reel/Frame 052201/0400 →
Continuity (2)
Provisional Application 62751378 · Oct 26, 2018
Related Publication 20200133978A1 · Apr 30, 2020
References Cited (400)
US 5301109A · Landauer et al. · 1994 [cited by applicant]
US 5446677A · Jensen et al. · 1995 [cited by applicant]
US 5581478A · Cruse et al. · 1996 [cited by applicant]
US 5812962A · Kovac · 1998 [cited by applicant]
US 5960381A · Singers et al. · 1999 [cited by applicant]
US 5973662A · Singers et al. · 1999 [cited by applicant]
US 6014612A · Larson et al. · 2000 [cited by applicant]
US 6031547A · Kennedy · 2000 [cited by applicant]
US 6134511A · Subbarao · 2000 [cited by applicant]
US 6157943A · Meyer · 2000 [cited by applicant]
US 6240326B1 · Gloudeman et al. · 2001 [cited by applicant]
US 6285966B1 · Brown et al. · 2001 [cited by applicant]
US 6363422B1 · Hunter et al. · 2002 [cited by applicant]
US 6385510B1 · Hoog et al. · 2002 [cited by applicant]
US 6389331B1 · Jensen et al. · 2002 [cited by applicant]
US 6401027B1 · Xu et al. · 2002 [cited by applicant]
US 6437691B1 · Sandelman et al. · 2002 [cited by applicant]
US 6477518B1 · Li et al. · 2002 [cited by applicant]
US 6487457B1 · Hull et al. · 2002 [cited by applicant]
US 6493755B1 · Hansen et al. · 2002 [cited by applicant]
US 6577323B1 · Jamieson et al. · 2003 [cited by applicant]
US 6626366B2 · Kayahara et al. · 2003 [cited by applicant]
US 6646660B1 · Patty · 2003 [cited by applicant]
US 6704016B1 · Oliver et al. · 2004 [cited by applicant]
US 6732540B2 · Sugihara et al. · 2004 [cited by applicant]
US 6764019B1 · Kayahara et al. · 2004 [cited by applicant]
US 6782385B2 · Natsumeda et al. · 2004 [cited by applicant]
US 6813532B2 · Eryurek et al. · 2004 [cited by applicant]
US 6816811B2 · Seem · 2004 [cited by applicant]
US 6823680B2 · Jayanth · 2004 [cited by applicant]
US 6826454B2 · Sulfstede · 2004 [cited by applicant]
US 6865511B2 · Frerichs et al. · 2005 [cited by applicant]
US 6925338B2 · Eryurek et al. · 2005 [cited by applicant]
US 6986138B1 · Sakaguchi et al. · 2006 [cited by applicant]
US 7031880B1 · Seem et al. · 2006 [cited by applicant]
US 7401057B2 · Eder · 2008 [cited by applicant]
US 7552467B2 · Lindsay · 2009 [cited by applicant]
US 7627544B2 · Chkodrov et al. · 2009 [cited by applicant]
US 7818249B2 · Lovejoy et al. · 2010 [cited by applicant]
US 7889051B1 · Billig et al. · 2011 [cited by applicant]
US 7996488B1 · Casabella et al. · 2011 [cited by applicant]
US 8078330B2 · Brickfield et al. · 2011 [cited by applicant]
US 8104044B1 · Scofield et al. · 2012 [cited by applicant]
US 8229470B1 · Ranjan et al. · 2012 [cited by applicant]
US 8280723B1 · Laaser · 2012 [cited by examiner]
US 8401991B2 · Wu et al. · 2013 [cited by applicant]
US 8495745B1 · Schrecker et al. · 2013 [cited by applicant]
US 8516016B2 · Park et al. · 2013 [cited by applicant]
US 8532808B2 · Drees et al. · 2013 [cited by applicant]
US 8532839B2 · Drees et al. · 2013 [cited by applicant]
US 8600556B2 · Nesler et al. · 2013 [cited by applicant]
US 8635182B2 · Mackay · 2014 [cited by applicant]
US 8682921B2 · Park et al. · 2014 [cited by applicant]
US 8731724B2 · Drees et al. · 2014 [cited by applicant]
US 8737334B2 · Ahn et al. · 2014 [cited by applicant]
US 8738334B2 · Jiang et al. · 2014 [cited by applicant]
US 8751487B2 · Byrne et al. · 2014 [cited by applicant]
US 8788097B2 · Drees et al. · 2014 [cited by applicant]
US 8805995B1 · Oliver · 2014 [cited by applicant]
US 8843238B2 · Wenzel et al. · 2014 [cited by applicant]
US 8874071B2 · Sherman et al. · 2014 [cited by applicant]
US 8941465B2 · Pineau et al. · 2015 [cited by applicant]
US 8990127B2 · Taylor · 2015 [cited by applicant]
US 9070113B2 · Shafiee et al. · 2015 [cited by applicant]
US 9116978B2 · Park et al. · 2015 [cited by applicant]
US 9185095B1 · Moritz et al. · 2015 [cited by applicant]
US 9189527B2 · Park et al. · 2015 [cited by applicant]
US 9196009B2 · Drees et al. · 2015 [cited by applicant]
US 9229966B2 · Aymeloglu et al. · 2016 [cited by applicant]
US 9286582B2 · Drees et al. · 2016 [cited by applicant]
US 9311807B2 · Schultz et al. · 2016 [cited by applicant]
US 9344751B1 · Ream et al. · 2016 [cited by applicant]
US 9354968B2 · Wenzel et al. · 2016 [cited by applicant]
US 9411327B2 · Park · 2016 [cited by applicant]
US 9507686B2 · Horn et al. · 2016 [cited by applicant]
US 9524594B2 · Ouyang et al. · 2016 [cited by applicant]
US 9558196B2 · Johnston et al. · 2017 [cited by applicant]
US 9652813B2 · Gifford et al. · 2017 [cited by applicant]
US 9753455B2 · Drees · 2017 [cited by applicant]
US 9767409B1 · Makhijani · 2017 [cited by examiner]
US 9811249B2 · Chen et al. · 2017 [cited by applicant]
US 9838844B2 · Emeis et al. · 2017 [cited by applicant]
US 9886478B2 · Mukherjee · 2018 [cited by applicant]
US 9948359B2 · Horton · 2018 [cited by applicant]
US 10055114B2 · Shah et al. · 2018 [cited by applicant]
US 10055206B2 · Park et al. · 2018 [cited by applicant]
US 10116461B2 · Fairweather et al. · 2018 [cited by applicant]
US 10169454B2 · Ait-Mokhtar et al. · 2019 [cited by applicant]
US 10171297B2 · Stewart et al. · 2019 [cited by applicant]
US 10171586B2 · Shaashua et al. · 2019 [cited by applicant]
US 10187258B2 · Nagesh et al. · 2019 [cited by applicant]
US 10417451B2 · Park et al. · 2019 [cited by applicant]
US 10514963B2 · Shrivastava et al. · 2019 [cited by applicant]
US 10515098B2 · Park et al. · 2019 [cited by applicant]
US 10534326B2 · Sridharan et al. · 2020 [cited by applicant]
US 10536295B2 · Fairweather et al. · 2020 [cited by applicant]
US 10564993B2 · Deutsch et al. · 2020 [cited by applicant]
US 10705492B2 · Harvey · 2020 [cited by applicant]
US 10708078B2 · Harvey · 2020 [cited by applicant]
US 10760815B2 · Janakiraman et al. · 2020 [cited by applicant]
US 10762475B2 · Song et al. · 2020 [cited by applicant]
US 10824120B2 · Ahmed · 2020 [cited by applicant]
US 10845771B2 · Harvey · 2020 [cited by applicant]
US 10854194B2 · Park et al. · 2020 [cited by applicant]
US 10862928B1 · Badawy et al. · 2020 [cited by applicant]
US 10921760B2 · Harvey · 2021 [cited by applicant]
US 10921972B2 · Park et al. · 2021 [cited by applicant]
US 10969133B2 · Harvey · 2021 [cited by applicant]
US 10976068B2 · Hallendy et al. · 2021 [cited by applicant]
US 10986121B2 · Stockdale et al. · 2021 [cited by applicant]
US 11016998B2 · Park et al. · 2021 [cited by applicant]
US 11024292B2 · Park et al. · 2021 [cited by applicant]
US 11038709B2 · Park et al. · 2021 [cited by applicant]
US 11041650B2 · Li et al. · 2021 [cited by applicant]
US 11054796B2 · Holaso · 2021 [cited by applicant]
US 11070390B2 · Park et al. · 2021 [cited by applicant]
US 11073976B2 · Park et al. · 2021 [cited by applicant]
US 11108587B2 · Park et al. · 2021 [cited by applicant]
US 11113295B2 · Park et al. · 2021 [cited by applicant]
US 11229138B1 · Harvey et al. · 2022 [cited by applicant]
US 11314726B2 · Park et al. · 2022 [cited by applicant]
US 11314788B2 · Park et al. · 2022 [cited by applicant]
US 11556105B2 · Cooley et al. · 2023 [cited by applicant]
US 11561522B2 · Cooley et al. · 2023 [cited by applicant]
US 11561523B2 · Cooley et al. · 2023 [cited by applicant]
US 11573551B2 · Cooley et al. · 2023 [cited by applicant]
US 11586167B2 · Cooley et al. · 2023 [cited by applicant]
US 20020010562A1 · Schleiss et al. · 2002 [cited by applicant]
US 20020016639A1 · Smith et al. · 2002 [cited by applicant]
US 20020059229A1 · Natsumeda et al. · 2002 [cited by applicant]
US 20020123864A1 · Eryurek et al. · 2002 [cited by applicant]
US 20020147506A1 · Eryurek et al. · 2002 [cited by applicant]
US 20020177909A1 · Fu et al. · 2002 [cited by applicant]
US 20030005486A1 · Ridolfo et al. · 2003 [cited by applicant]
US 20030014130A1 · Grumelart · 2003 [cited by applicant]
US 20030073432A1 · Meade, II · 2003 [cited by applicant]
US 20030074640A1 · Mandell et al. · 2003 [cited by applicant]
US 20030158704A1 · Triginai et al. · 2003 [cited by applicant]
US 20030171851A1 · Brickfield et al. · 2003 [cited by applicant]
US 20030200059A1 · Ignatowski et al. · 2003 [cited by applicant]
US 20040021679A1 · Chapman et al. · 2004 [cited by applicant]
US 20040068390A1 · Saunders · 2004 [cited by applicant]
US 20040128314A1 · Katibah et al. · 2004 [cited by applicant]
US 20040133314A1 · Ehlers et al. · 2004 [cited by applicant]
US 20040199360A1 · Friman et al. · 2004 [cited by applicant]
US 20050055308A1 · Meyer et al. · 2005 [cited by applicant]
US 20050108262A1 · Fawcett et al. · 2005 [cited by applicant]
US 20050154494A1 · Ahmed · 2005 [cited by applicant]
US 20050278703A1 · Lo et al. · 2005 [cited by applicant]
US 20050283337A1 · Sayal · 2005 [cited by applicant]
US 20060062468A1 · Xu et al. · 2006 [cited by applicant]
US 20060095521A1 · Patinkin · 2006 [cited by applicant]
US 20060140207A1 · Eschbach et al. · 2006 [cited by applicant]
US 20060167667A1 · Maturana et al. · 2006 [cited by applicant]
US 20060184479A1 · Levine · 2006 [cited by applicant]
US 20060200476A1 · Gottumukkala et al. · 2006 [cited by applicant]
US 20060248523A1 · Berg · 2006 [cited by examiner]
US 20060253205A1 · Gardiner · 2006 [cited by applicant]
US 20060265751A1 · Cosquer et al. · 2006 [cited by applicant]
US 20060271589A1 · Horowitz et al. · 2006 [cited by applicant]
US 20070028179A1 · Levin et al. · 2007 [cited by applicant]
US 20070067062A1 · Mairs et al. · 2007 [cited by applicant]
US 20070203693A1 · Estes · 2007 [cited by applicant]
US 20070261062A1 · Bansal et al. · 2007 [cited by applicant]
US 20070273497A1 · Kuroda et al. · 2007 [cited by applicant]
US 20070273610A1 · Baillot · 2007 [cited by applicant]
US 20080034425A1 · Overcash et al. · 2008 [cited by applicant]
US 20080094230A1 · Mock et al. · 2008 [cited by applicant]
US 20080097816A1 · Freire et al. · 2008 [cited by applicant]
US 20080186160A1 · Kim et al. · 2008 [cited by applicant]
US 20080249756A1 · Chaisuparasmikul · 2008 [cited by applicant]
US 20080252723A1 · Park · 2008 [cited by applicant]
US 20080281472A1 · Podgorny et al. · 2008 [cited by applicant]
US 20080282198A1 · Brooks · 2008 [cited by examiner]
US 20090195349A1 · Frader-Thompson et al. · 2009 [cited by applicant]
US 20100045439A1 · Tak et al. · 2010 [cited by applicant]
US 20100058248A1 · Park · 2010 [cited by applicant]
US 20100131533A1 · Ortiz · 2010 [cited by applicant]
US 20100274366A1 · Fata et al. · 2010 [cited by applicant]
US 20100281387A1 · Holland et al. · 2010 [cited by applicant]
US 20100286937A1 · Hedley et al. · 2010 [cited by applicant]
US 20100287130A1 · Guralnik et al. · 2010 [cited by applicant]
US 20100324962A1 · Nesler et al. · 2010 [cited by applicant]
US 20110015802A1 · Imes · 2011 [cited by applicant]
US 20110047418A1 · Drees et al. · 2011 [cited by applicant]
US 20110061015A1 · Drees et al. · 2011 [cited by applicant]
US 20110071685A1 · Huneycutt et al. · 2011 [cited by applicant]
US 20110077950A1 · Hughston · 2011 [cited by applicant]
US 20110087650A1 · Mackay et al. · 2011 [cited by applicant]
US 20110087988A1 · Ray et al. · 2011 [cited by applicant]
US 20110088000A1 · Mackay · 2011 [cited by applicant]
US 20110125737A1 · Pothering et al. · 2011 [cited by applicant]
US 20110137853A1 · Mackay · 2011 [cited by applicant]
US 20110153603A1 · Adiba et al. · 2011 [cited by applicant]
US 20110154363A1 · Karmarkar · 2011 [cited by applicant]
US 20110157357A1 · Weisensale et al. · 2011 [cited by applicant]
US 20110178977A1 · Drees · 2011 [cited by applicant]
US 20110191343A1 · Heaton et al. · 2011 [cited by applicant]
US 20110205022A1 · Cavallaro et al. · 2011 [cited by applicant]
US 20110218777A1 · Chen et al. · 2011 [cited by applicant]
US 20120011126A1 · Park et al. · 2012 [cited by applicant]
US 20120011141A1 · Park et al. · 2012 [cited by applicant]
US 20120022698A1 · Mackay · 2012 [cited by examiner]
US 20120062577A1 · Nixon · 2012 [cited by applicant]
US 20120064923A1 · Imes et al. · 2012 [cited by applicant]
US 20120083930A1 · Ilic et al. · 2012 [cited by applicant]
US 20120100825A1 · Sherman et al. · 2012 [cited by applicant]
US 20120101637A1 · Imes et al. · 2012 [cited by applicant]
US 20120135759A1 · Imes et al. · 2012 [cited by applicant]
US 20120136485A1 · Weber et al. · 2012 [cited by applicant]
US 20120158633A1 · Eder · 2012 [cited by applicant]
US 20120259583A1 · Noboa et al. · 2012 [cited by applicant]
US 20120272228A1 · Marndi et al. · 2012 [cited by applicant]
US 20120278051A1 · Jiang et al. · 2012 [cited by applicant]
US 20120284377A1 · Von Stein et al. · 2012 [cited by applicant]
US 20120296451A1 · Kaps et al. · 2012 [cited by applicant]
US 20130007063A1 · Kalra et al. · 2013 [cited by applicant]
US 20130038430A1 · Blower et al. · 2013 [cited by applicant]
US 20130038707A1 · Cunningham et al. · 2013 [cited by applicant]
US 20130060820A1 · Bulusu et al. · 2013 [cited by applicant]
US 20130086497A1 · Ambuhl et al. · 2013 [cited by applicant]
US 20130097706A1 · Titonis et al. · 2013 [cited by applicant]
US 20130103221A1 · Raman et al. · 2013 [cited by applicant]
US 20130167035A1 · Imes et al. · 2013 [cited by applicant]
US 20130170710A1 · Kuoch et al. · 2013 [cited by applicant]
US 20130173062A1 · Koenig-Richardson · 2013 [cited by applicant]
US 20130204836A1 · Choi et al. · 2013 [cited by applicant]
US 20130246916A1 · Reimann et al. · 2013 [cited by applicant]
US 20130247205A1 · Schrecker et al. · 2013 [cited by applicant]
US 20130262035A1 · Mills · 2013 [cited by applicant]
US 20130275174A1 · Bennett et al. · 2013 [cited by applicant]
US 20130275908A1 · Reichard · 2013 [cited by applicant]
US 20130297050A1 · Reichard et al. · 2013 [cited by applicant]
US 20130298244A1 · Kumar et al. · 2013 [cited by applicant]
US 20130331995A1 · Rosen · 2013 [cited by applicant]
US 20130338970A1 · Reghetti · 2013 [cited by applicant]
US 20140032506A1 · Hoey et al. · 2014 [cited by applicant]
US 20140059483A1 · Mairs et al. · 2014 [cited by applicant]
US 20140081652A1 · Klindworth · 2014 [cited by applicant]
US 20140135952A1 · Maehara · 2014 [cited by applicant]
US 20140152651A1 · Chen et al. · 2014 [cited by applicant]
US 20140172184A1 · Schmidt et al. · 2014 [cited by applicant]
US 20140189861A1 · Gupta et al. · 2014 [cited by applicant]
US 20140207282A1 · Angle et al. · 2014 [cited by applicant]
US 20140249797A1 · Liu et al. · 2014 [cited by applicant]
US 20140258052A1 · Khuti et al. · 2014 [cited by applicant]
US 20140269614A1 · Maguire et al. · 2014 [cited by applicant]
US 20140277765A1 · Karimi et al. · 2014 [cited by applicant]
US 20140278461A1 · Artz · 2014 [cited by applicant]
US 20140327555A1 · Sager et al. · 2014 [cited by applicant]
US 20150019174A1 · Kiff et al. · 2015 [cited by applicant]
US 20150042240A1 · Aggarwal et al. · 2015 [cited by applicant]
US 20150105917A1 · Sasaki et al. · 2015 [cited by applicant]
US 20150145468A1 · Ma et al. · 2015 [cited by applicant]
US 20150156031A1 · Fadell et al. · 2015 [cited by applicant]
US 20150168931A1 · Jin · 2015 [cited by applicant]
US 20150172300A1 · Cochenour · 2015 [cited by applicant]
US 20150178421A1 · Borrelli et al. · 2015 [cited by applicant]
US 20150185261A1 · Frader-Thompson et al. · 2015 [cited by applicant]
US 20150186777A1 · Lecue et al. · 2015 [cited by applicant]
US 20150202962A1 · Habashima et al. · 2015 [cited by applicant]
US 20150204563A1 · Imes et al. · 2015 [cited by applicant]
US 20150235267A1 · Steube et al. · 2015 [cited by applicant]
US 20150241895A1 · Lu et al. · 2015 [cited by applicant]
US 20150244730A1 · Vu et al. · 2015 [cited by applicant]
US 20150244732A1 · Golshan et al. · 2015 [cited by applicant]
US 20150261863A1 · Dey et al. · 2015 [cited by applicant]
US 20150263900A1 · Polyakov et al. · 2015 [cited by applicant]
US 20150286969A1 · Warner et al. · 2015 [cited by applicant]
US 20150295796A1 · Hsiao et al. · 2015 [cited by applicant]
US 20150304193A1 · Ishii et al. · 2015 [cited by applicant]
US 20150316918A1 · Schleiss et al. · 2015 [cited by applicant]
US 20150324422A1 · Elder · 2015 [cited by applicant]
US 20150341212A1 · Hsiao et al. · 2015 [cited by applicant]
US 20150348417A1 · Ignaczak et al. · 2015 [cited by applicant]
US 20150379080A1 · Jochimski · 2015 [cited by applicant]
US 20160011753A1 · Mcfarland et al. · 2016 [cited by applicant]
US 20160033946A1 · Zhu et al. · 2016 [cited by applicant]
US 20160035246A1 · Curtis · 2016 [cited by applicant]
US 20160065601A1 · Gong et al. · 2016 [cited by applicant]
US 20160070736A1 · Swan et al. · 2016 [cited by applicant]
US 20160078229A1 · Gong et al. · 2016 [cited by applicant]
US 20160090839A1 · Stolarczyk · 2016 [cited by applicant]
US 20160119434A1 · Dong et al. · 2016 [cited by applicant]
US 20160127712A1 · Alfredsson et al. · 2016 [cited by applicant]
US 20160139752A1 · Shim et al. · 2016 [cited by applicant]
US 20160163186A1 · Davidson et al. · 2016 [cited by applicant]
US 20160170390A1 · Xie et al. · 2016 [cited by applicant]
US 20160171862A1 · Das et al. · 2016 [cited by applicant]
US 20160173816A1 · Huenerfauth et al. · 2016 [cited by applicant]
US 20160179315A1 · Sarao et al. · 2016 [cited by applicant]
US 20160179342A1 · Sarao et al. · 2016 [cited by applicant]
US 20160179990A1 · Sarao et al. · 2016 [cited by applicant]
US 20160195856A1 · Spero · 2016 [cited by applicant]
US 20160212165A1 · Singla et al. · 2016 [cited by applicant]
US 20160239660A1 · Azvine et al. · 2016 [cited by applicant]
US 20160239756A1 · Aggour et al. · 2016 [cited by applicant]
US 20160247129A1 · Song et al. · 2016 [cited by applicant]
US 20160260063A1 · Harris et al. · 2016 [cited by applicant]
US 20160313751A1 · Risbeck et al. · 2016 [cited by applicant]
US 20160313752A1 · Przybylski · 2016 [cited by applicant]
US 20160313902A1 · Hill et al. · 2016 [cited by applicant]
US 20160320758A1 · Park · 2016 [cited by examiner]
US 20160330082A1 · Bliss et al. · 2016 [cited by applicant]
US 20160350364A1 · Anicic et al. · 2016 [cited by applicant]
US 20160357521A1 · Zhang et al. · 2016 [cited by applicant]
US 20160357828A1 · Tobin et al. · 2016 [cited by applicant]
US 20160358432A1 · Branscomb et al. · 2016 [cited by applicant]
US 20160363336A1 · Roth et al. · 2016 [cited by applicant]
US 20160370258A1 · Perez · 2016 [cited by applicant]
US 20160378306A1 · Kresl et al. · 2016 [cited by applicant]
US 20160379326A1 · Chan-Gove et al. · 2016 [cited by applicant]
US 20170006135A1 · Siebel · 2017 [cited by applicant]
US 20170011318A1 · Vigano et al. · 2017 [cited by applicant]
US 20170017221A1 · Lamparter et al. · 2017 [cited by applicant]
US 20170039255A1 · Raj et al. · 2017 [cited by applicant]
US 20170052536A1 · Warner et al. · 2017 [cited by applicant]
US 20170053441A1 · Nadumane et al. · 2017 [cited by applicant]
US 20170063894A1 · Muddu et al. · 2017 [cited by applicant]
US 20170068409A1 · Nair · 2017 [cited by applicant]
US 20170070775A1 · Taxier et al. · 2017 [cited by applicant]
US 20170075984A1 · Deshpande et al. · 2017 [cited by applicant]
US 20170084168A1 · Janchookiat · 2017 [cited by applicant]
US 20170090437A1 · Veeramani et al. · 2017 [cited by applicant]
US 20170093700A1 · Gilley et al. · 2017 [cited by applicant]
US 20170098086A1 · Hoernecke et al. · 2017 [cited by applicant]
US 20170103327A1 · Penilla et al. · 2017 [cited by applicant]
US 20170103403A1 · Chu et al. · 2017 [cited by applicant]
US 20170123389A1 · Baez et al. · 2017 [cited by applicant]
US 20170134415A1 · Muddu et al. · 2017 [cited by applicant]
US 20170177715A1 · Chang et al. · 2017 [cited by applicant]
US 20170180147A1 · Brandman et al. · 2017 [cited by applicant]
US 20170188216A1 · Koskas et al. · 2017 [cited by applicant]
US 20170212482A1 · Boettcher et al. · 2017 [cited by applicant]
US 20170212668A1 · Shah et al. · 2017 [cited by applicant]
US 20170220641A1 · Chi et al. · 2017 [cited by applicant]
US 20170230930A1 · Frey · 2017 [cited by applicant]
US 20170235817A1 · Deodhar et al. · 2017 [cited by applicant]
US 20170249327A1 · Gowdappa · 2017 [cited by examiner]
US 20170251182A1 · Siminoff et al. · 2017 [cited by applicant]
US 20170270124A1 · Nagano et al. · 2017 [cited by applicant]
US 20170277769A1 · Pasupathy et al. · 2017 [cited by applicant]
US 20170278003A1 · Liu · 2017 [cited by applicant]
US 20170294132A1 · Colmenares · 2017 [cited by applicant]
US 20170315522A1 · Kwon et al. · 2017 [cited by applicant]
US 20170315697A1 · Jacobson et al. · 2017 [cited by applicant]
US 20170322534A1 · Sinha et al. · 2017 [cited by applicant]
US 20170323389A1 · Vavrasek · 2017 [cited by applicant]
US 20170329289A1 · Kohn et al. · 2017 [cited by applicant]
US 20170336770A1 · Macmillan · 2017 [cited by applicant]
US 20170345287A1 · Fuller et al. · 2017 [cited by applicant]
US 20170351957A1 · Lecue et al. · 2017 [cited by applicant]
US 20170357225A1 · Asp et al. · 2017 [cited by applicant]
US 20170357490A1 · Park et al. · 2017 [cited by applicant]
US 20170357908A1 · Cabadi et al. · 2017 [cited by applicant]
US 20180012159A1 · Kozloski et al. · 2018 [cited by applicant]
US 20180013579A1 · Fairweather et al. · 2018 [cited by applicant]
US 20180024520A1 · Sinha et al. · 2018 [cited by applicant]
US 20180039238A1 · Gärtner et al. · 2018 [cited by applicant]
US 20180048485A1 · Pelton et al. · 2018 [cited by applicant]
US 20180069932A1 · Tiwari et al. · 2018 [cited by applicant]
US 20180114140A1 · Chen et al. · 2018 [cited by applicant]
US 20180129714A1 · Saxena · 2018 [cited by examiner]
US 20180137288A1 · Polyakov · 2018 [cited by applicant]
US 20180157930A1 · Rutschman et al. · 2018 [cited by applicant]
US 20180162400A1 · Abdar · 2018 [cited by applicant]
US 20180176241A1 · Manadhata et al. · 2018 [cited by applicant]
US 20180198627A1 · Mullins · 2018 [cited by applicant]
US 20180203961A1 · Aisu et al. · 2018 [cited by applicant]
US 20180239982A1 · Rutschman et al. · 2018 [cited by applicant]
US 20180275625A1 · Park et al. · 2018 [cited by applicant]
US 20180276962A1 · Butler et al. · 2018 [cited by applicant]
US 20180292797A1 · Lamparter et al. · 2018 [cited by applicant]
US 20180336785A1 · Ghannam et al. · 2018 [cited by applicant]
US 20180356775A1 · Harvey · 2018 [cited by applicant]
US 20180359111A1 · Harvey · 2018 [cited by applicant]
US 20180364654A1 · Locke et al. · 2018 [cited by applicant]
US 20190005025A1 · Malabarba · 2019 [cited by applicant]
US 20190013023A1 · Pourmohammad et al. · 2019 [cited by applicant]
US 20190025771A1 · Park et al. · 2019 [cited by applicant]
US 20190037135A1 · Hedge · 2019 [cited by applicant]
US 20190042988A1 · Brown et al. · 2019 [cited by applicant]
US 20190088106A1 · Grundstrom · 2019 [cited by applicant]
US 20190094824A1 · Xie et al. · 2019 [cited by applicant]
US 20190096217A1 · Pourmohammad et al. · 2019 [cited by applicant]
US 20190102840A1 · Perl et al. · 2019 [cited by applicant]
US 20190121801A1 · Jethwa et al. · 2019 [cited by applicant]
US 20190138512A1 · Pourmohammad et al. · 2019 [cited by applicant]
US 20190147883A1 · Mellenthin et al. · 2019 [cited by applicant]
US 20190158309A1 · Park et al. · 2019 [cited by applicant]
US 20190163152A1 · Worrall et al. · 2019 [cited by applicant]
US 20190197113A1 · Iyengar · 2019 [cited by examiner]
US 20190268178A1 · Fairweather et al. · 2019 [cited by applicant]
US 20190310979A1 · Masuzaki et al. · 2019 [cited by applicant]
US 20190377306A1 · Harvey · 2019 [cited by applicant]
US 20200226156A1 · Borra et al. · 2020 [cited by applicant]
US 20200285203A1 · Thakur et al. · 2020 [cited by applicant]
US 20200336328A1 · Harvey · 2020 [cited by applicant]
US 20200348632A1 · Harvey · 2020 [cited by applicant]
US 20200387576A1 · Brett et al. · 2020 [cited by applicant]