Abstract: A method for visualization of an end device. The method may include setting an object display limit on a display map, the display map displaying a plurality of objects, and wherein each of the plurality of objects is assigned a priority status; receiving data from the end device; classifying the data and assigning priority status to an object with the data, wherein the object is added to the plurality of objects; and displaying the plurality of objects based on priority status and the object display limit.

Abstract: Example implementations described herein provide systems and methods for visualization of power distribution feeder networks. The systems and methods involve setting a limit of objects of the power distribution network to be displayed on a map, the objects comprising at least nodes and links between the nodes, the links comprising at least conductive lines; when the total number of the objects exceeds a limit, selecting one or more subsets of the conductive lines based on one or more conditions related to the conductive lines; and generating a first visualization displaying the map comprising a subset of the objects including the one or more subsets of the conductive lines, wherein a number of displayed objects is less than or equal to the limit.

Abstract: Example implementations described herein provide systems and methods for visualization of power distribution feeder networks. The systems and methods involve setting a limit of objects of the power distribution network to be displayed on a map, the objects comprising at least nodes and links between the nodes, the links comprising at least conductive lines; when the total number of the objects exceeds a limit, selecting one or more subsets of the conductive lines based on one or more conditions related to the conductive lines; and generating a first visualization displaying the map comprising a subset of the objects including the one or more subsets of the conductive lines, wherein a number of displayed objects is less than or equal to the limit.

Abstract: A system including a peer-to-peer network and cloud data services for DER data acquisition and aggregation is provided. The system may perform a method for managing a plurality of DERs at an edge computing device (e.g., a super edge node or master edge node). The method may include receiving, from a cloud node, a data collection protocol. The method may also include transmitting the data collection protocol to each of a plurality of private-device edge nodes (e.g., a privately-owned mobile devices) in a peer-to-peer network and receiving, based on the data collection protocol, data relating to the plurality of DERs from the plurality of private-device edge nodes through the peer-to-peer network. The method may further include transmitting the received data to a cloud-based node (e.g., a cloud system). The system may provide a cost-effective infrastructure for data acquisition and system control.

Abstract: A computer-implemented method of constructing and maintaining a record keeping dictionary data structure can include: generating a PATRICIA trie from a set of strings; generating multiple kth-level elevator-stairs data structures at exponentially reducing k-levels, wherein each of the kth-level elevator-stairs data structure includes a kth-level trie corresponding to the PATRICIA trie and wherein nodes of the kth-level trie at string depths of integer multiples of k are accessible through hash table links; and linking nodes in neighboring kth-level tries of the multiple kth-level elevator-stairs data structures where the nodes represent a same node in the PATRICIA trie.

Abstract: A computer-implemented method of constructing and maintaining a record keeping dictionary data structure can include: generating a PATRICIA trie from a set of strings; generating multiple kth-level elevator-stairs data structures at exponentially reducing k-levels, wherein each of the kth-level elevator-stairs data structure includes a kth-level trie corresponding to the PATRICIA trie and wherein nodes of the kth-level trie at string depths of integer multiples of k are accessible through hash table links; and linking nodes in neighboring kth-level tries of the multiple kth-level elevator-stairs data structures where the nodes represent a same node in the PATRICIA trie.

Abstract: A computer-implemented method of constructing and maintaining a record keeping dictionary data structure can include: generating a PATRICIA trie from a set of strings; generating multiple kth-level elevator-stairs data structures at exponentially reducing k-levels, wherein each of the kth-level elevator-stairs data structure includes a kth-level trie corresponding to the PATRICIA trie and wherein nodes of the kth-level trie at string depths of integer multiples of k are accessible through hash table links; and linking nodes in neighboring kth-level tries of the multiple kth-level elevator-stairs data structures where the nodes represent a same node in the PATRICIA trie.

Abstract: A computer-implemented method of constructing and maintaining a record keeping dictionary data structure can include: generating a PATRICIA trie from a set of strings; generating multiple kth-level elevator-stairs data structures at exponentially reducing k-levels, wherein each of the kth-level elevator-stairs data structure includes a kth-level trie corresponding to the PATRICIA trie and wherein nodes of the kth-level trie at string depths of integer multiples of k are accessible through hash table links; and linking nodes in neighboring kth-level tries of the multiple kth-level elevator-stairs data structures where the nodes represent a same node in the PATRICIA trie.