Abstract: Distance-based framing includes obtaining at least a video stream during an online conference session. The video stream, an audio stream received with the video stream, or both the video stream and the audio stream are analyzed and a framing that either focuses on a speaker in the video stream or provides an overview of participants in the video stream, the framing being is composed based on the analyzing. A potential error in the framing is detected based on further analysis of the video stream, the audio stream, and an amount of motion in the room. If the distance sensor data contradicts the potential error, the framing is maintained, but if the distance sensor data confirms the potential error, a new framing is generated.

Abstract: A method, computer system, and a computer program product for message directing are provided. A first computer receives a registration of members organized into a first closed group hierarchy. The first computer receives a notification of a sensed change of an element in an environment of the first closed group hierarchy. The first computer receives a first message from an external device. The first message relates to the changed element. The first computer selects a first member of the first closed group hierarchy for receipt of the first message. The selecting is based on message routing guidelines established for the first closed group hierarchy. In response to receiving the notification of the sensed change, the first computer transmits the first message to the selected first member of the first closed group hierarchy.

Abstract: Provided is a computer-implemented method for adapting at least one pre-defined frame delay, wherein the corresponding at least one frame is communicated via at least one network switch of at least one computing unit in a frame-based computer network, including the steps a. receiving input data from the at least one network switch of the at least one computing unit; wherein b. the input data includes at least one information associated with the at least one frame and/or at least one network switch; c. deriving at least one current frame delay of the at least one frame from the at least one information; d. adapting the at least one pre-defined frame delay depending on the at least one current frame delay; and e. providing the at least one adapted frame delay. Also provided is a corresponding computer program product and monitoring unit.

Abstract: Embodiments of a computing device for traffic shaping are disclosed. In an embodiment, the computing device includes one or more processor(s) coupled to a memory. The memory includes a set of instructions which when executed causes the one or more processor(s) to divide a burst period associated with a shaper queue into a plurality of microbursts based at least on a count of worker threads corresponding to a plurality of queues and a shaper bandwidth. The plurality of queues constitutes the shaper queue.

Abstract: A process can include determining a plurality of Network Address Translation (NAT) routes associated with respective edge routers included in a same virtual private network (VPN) for communicating with a software-defined wide area network (SDWAN). A process can include identifying a first subset of the plurality of NAT routes as mapped to a first public NAT address included in a NAT pool associated with the VPN. A process can include tagging each NAT route of the first subset with a tag value indicative of a preferred router for receiving return traffic of the respective NAT route. A process can include routing traffic on a respective NAT route of the plurality of NAT routes based on applying, at an SDWAN controller, a corresponding control policy matching the tag value of the respective NAT route.

Abstract: A quantum block-chained authentication solution with quantum authentication processes for data transmissions passing through a peer-to-peer (P2P) network including a plurality of agent nodes comprises a system that is capable of not only performing a smart contract on a block-chained virtual-machine mechanism for transmitting a data from an agent node to another agent node passing through a plurality of paths in a secure way implemented via proprietary quantum authentication processes, but also detecting and reacting to a malicious behavior within a transmission in time.

Abstract: An ad-hoc network manager is provided. The vehicle includes a transceiver and one or more controllers of the host vehicle, in communication with the transceiver. The one or more controllers are programmed to receive connected messages from remote vehicles via the transceiver, and execute a message subservice configured to provide, to vehicle applications executed by the one or more controller, one or more events related to the received connected messages.

Abstract: A computer-implemented method includes receiving data records from a plurality of different data sources, in which the data records include information regarding elements or components in one or more systems; consolidating the data records; extracting information from the consolidated data records to identify a plurality of nodes and connections between the plurality of nodes in the one or more systems; storing information identifying the plurality of nodes and the connections; and visually presenting the plurality of nodes and the connections in a user interface.

Abstract: Grafting segments of a network together to mitigate service disruptions associated with impairments, maintenance, etc., is contemplated. The grafting may include instantiating a wired and/or wireless graft to facilitate connecting an impaired portion of a network to an unimpaired portion, such as to reestablish services at the impaired portion via the graft to the unimpaired portion.

Abstract: A communication system includes a communication management unit, an access point, and a plurality of traveling vehicles. The access point is connected to the communication management unit. Each vehicle includes a wireless communication unit. The communication system performs wireless polling communication between the communication management unit and the plurality of traveling vehicles via the access point at each predetermined polling cycle. In the communication system, a process including a wireless communication object addition step is performed to accept a new traveling vehicle as an object of wireless communication.

Abstract: A method establishes a vehicle area network on a vehicle having a tractor with a tractor wireless hub, the tractor being connected to a first trailer having a first trailer wireless hub. The method activates the tractor hub and the first trailer wireless hub, and shares credentials between the tractor wireless hub and the first trailer wireless hub in accordance with out of band pairing techniques. Typically, the tractor wireless hub acts as an access point for the vehicle area network but the access point can be centralized by: searching down a length of the vehicle to determine relative locations of the tractor wireless hub, the first trailer wireless hub and the second trailer wireless hub; determining a centrally located hub based on the locations; and establishing the centrally located hub as the access point.

Abstract: A method for autonomously routing data with reduced latencies over the Internet includes sending one or more ping messages from a first node to one or more genesis nodes on the Internet, receiving one of the ping messages from the first node by a first genesis node, sending a reply message to invite the first node to join a pulse group if the first node is selected based on predetermined criteria, automatically measuring one-way latencies between a plurality of nodes in the pulse group, wherein the pulse group includes the first genesis node, a first node, and a second node, automatically removing a node from the pulse group if fluctuations of one-way latencies associated with the node exceed a pre-determined threshold, and automatically determining a lower-latency data routing path from the first node to the second node based on the one-way latencies measured in the pulse group.

Abstract: Embodiments of the present disclosure relate to a method for distributing content, an electronic device, and a computer program product. The method for distributing content provided in embodiments of the present disclosure includes acquiring neighboring topological information of a plurality of nodes in a collaborative storage network, the plurality of nodes being used for collaboratively storing a plurality of contents requested by a client, the neighboring topological information at least indicating a one-hop relationship between directly connected one-hop node pairs among the plurality of nodes and a two-hop relationship between two-hop node pairs connected via an intermediate node among the plurality of nodes; determining a potential cost of transmitting a plurality of to-be-distributed contents among the plurality of nodes based on the neighboring topological information; and distributing a target content among the plurality of contents to a node among the plurality of nodes based on the potential cost.

Abstract: Disclosed is a mechanism for implementing link state flooding reduction (LSFR) in an Interior Gateway Protocol (IGP) network. The mechanism includes receiving data indicating connectivity of a plurality of nodes in the network. A flooding topology is built based on the connectivity. This includes selecting one of the nodes as a root node, and building a tree of links connecting the root node to the nodes in the network. The flooding topology is stored in a memory. The flooding topology may not be to the remaining nodes in the network. Link state messages may then be flooded over the flooding topology.

Abstract: Various embodiments of the present disclosure improve existing multi-layer and other network technologies by routing and processing client requests that require machine learning based on the machine learning capabilities of each network device and/or other computer resource characteristics of different network devices. This ensures that network latency and throughput, among other computer resource consumption characteristics, will be improved as machine learning processing can occur at the most suitable network device or be distributed among various suitable network devices.

Abstract: Embodiments for a method of implementing multiple domains in a network switching device are disclosed. The method includes assigning a plurality of hardware ports to a plurality of domains. Ports are assigned to at least two of the plurality of domains, and none of the ports are concurrently assigned to multiple domains. The method also includes loading rules for forwarding packets between the plurality of ports into a data plane. The rules direct the data plane to forward only between ports in a common domain of the plurality of domains. The method also includes assuring that a packet received at any port assigned to a first domain is not sent in legible form from any port assigned to a second domain if an error causes the data plane to forward or request forwarding the packet to any port assigned to a second domain.

Abstract: A method for establishing a segment routing (SR) tunnel based on an Internet Protocol version 6 (IPv6) data plane using a Path Computation Element Communication Protocol (PCEP) includes generating, by a path computation element (PCE), a first PCEP message, wherein the first PCEP message comprises indicating information and segment identifier (SID), and wherein the indicating information indicates that the SID is an IPv6 prefix of a node in a tunnel; receiving, by a first path computation client (PCC), the first PCEP message from the PCE; and establishing, by the first PCC, a Segment Routing over IPv6 (SRv6) tunnel from the first PCC to a second PCC.

Abstract: Intelligent query routing may be performed across shards of a scalable database table. A router of a database system may receive an access request directed to one or more database tables. The router may evaluate the access request with respect to metadata obtained for the database tables to determine an assignment distribution of computing resources of the database system to data that can satisfy the access request. The router can select planning locations to perform the access request based on the assignment distribution of the computing resources. The router can cause the access request to be performed according to planning at the selected planning locations.

Abstract: An operation method of a network device and a control chip of the network device are provided. The network device receives an input signal through a fiber medium. The operation method includes the following steps: setting a target speed of the network device to a first speed; transmitting and/or receiving a data at the first speed; and setting the target speed of the network device to a second speed which is different from the first speed when the amplitude or energy of the input signal is not greater than a threshold.

Abstract: A system and method for faster access for compressed time series data. A set of blocks are generated based on a table stored in a database of the data platform. The table stores data associated with multiple sources of data provided as consecutive values, each block containing index vectors having a range of the consecutive values. A block index is generated for each block having a field start vector representing a starting position of the block relative to the range of consecutive values, and a starting value vector representing a value of the block at the starting position. The field start vector of the block index is accessed to obtain the starting position of a field corresponding to a first block and to the range of the consecutive values of the first block. The starting value vector is then determined from the block index to determine an end and a length of the field of the first block.

Abstract: The disclosure provides an approach for reducing congestion within a network, the network comprising a plurality of subnets, the plurality of subnets comprising a plurality of host machines and a plurality of virtual computing instances (VCIs) running on the plurality of host machines. Embodiments include receiving, by an edge services gateway (ESG) of a first subnet of the plurality of subnets, membership information for a group identifying a subset of the plurality of host machines. Embodiments include receiving a multicast packet directed to the group and selecting from the plurality of host machines, a replicator host machine for the multicast packet. Embodiments include sending, to the replicator host machine, the multicast packet along with metadata indicating that the replicator host machine is to replicate the multicast packet to remaining host machines of the subset of the plurality of host machines identified in the membership information for the group.

Abstract: A relay device includes a plurality of input/output ports (111); an authentication information storage unit (114) to store authentication information used for performing authentication of a target relay device which is a relay device to be authenticated; an authentication processing unit (113) to acquire a target authentication packet which is an authentication packet used for authentication of the target relay device via a target input/output port (111) which is an input/output port connected to the target relay device in the plurality of input/output ports and to authenticate the target relay device by referring to the authentication information, and a relay processing unit (112) to cause a transfer input/output port which is an input/output port (111) to which a transfer destination of the transfer packet is connected, and to discard the transfer packet when the authentication of the target relay device is failed.

Abstract: Method and apparatus may be used for determining whether or not redundant transmission is enabled. One method for determining whether or not redundant transmission is enable includes: receiving trigger information, wherein the trigger information includes at least one of prediction information, load information, QoS information and reliability indication information; and determining whether or not redundant transmission is enabled according to the received trigger information.

Abstract: Methods, apparatus, computer program products for exchange data among air-gapped devices are provided. The method comprises: identifying, by a device in a cluster of devices, a plurality of accessible devices in the cluster via corresponding respective quick response (QR) codes; generating, by the device, logical routing information based on the identified plurality of accessible devices, the logical routing information comprising at least identifiers of the identified plurality of accessible devices; and transmitting, by the device, data encoded in a plurality of QR codes to a destination device in the cluster based on a shortest routing path identified in the logical routing information.

Abstract: A mesh network protocol, comprising: receiving a packet from a sender, identifying the sender, a prior sender, a flood mode, a time-to-live, and a sequence identifier; marking the recipient as critical if during a full flood period, the recipient is the same as the prior sender, and marking the recipient as non-critical if no packet is received with the recipient the same as the prior sender; rebroadcasting the packet, modified by updating sender with the recipient, and sender as prior sender, decrementing the time to live until expiration, and, the identity of the recipient is different from the identity of the prior sender in full flood mode; or the identity of the recipient is different from the prior sender, and the recipient is critical, in partial flood mode.

Abstract: A computer-implemented method for classifying three-dimensional (3D) objects including obtaining a set of 3D objects. Each 3D object of the set has a signature representative of the morphology of the 3D object. The method also includes computing a multi-level clustering of the set of 3D objects. The multi-level clustering is a hierarchical tree structure of clusters of 3D objects of the set and has N hierarchical levels. The method also includes selecting, automatically or upon user interaction, one of the computed clusters of a level of the multi-level clustering thereby defining a current level. The method comprises displaying, to a user, 3D objects of the selected cluster in a first part of a display. The method further includes classifying, upon user interaction, the displayed 3D objects. The computer-implemented method improves the classification of 3D objects.

Abstract: Systems and methods are described for using opportunistically delayed delivery of content to address sub-optimal bandwidth resource usage in network infrastructures that allow subscribers to share forward link resources. According to some embodiments, content is identified as delayable and assigned to a delaycast queue and/or service flow. For example, a server system of a satellite communications system identifies content that can be delayed to exploit future excess link capacity through multicasting and to exploit subscriber-side storage resources. Some implementations attempt to exploit any excess link resources at any time, while others exploit unused bandwidth only during certain times or when a certain threshold of resources is available. Various embodiments also provide content scoring and/or other prioritization techniques for optimizing exploitation of the delaycast queue.

Abstract: The embodiments of the disclosure provide a computer system, comprising a plurality of computing devices, each computing device comprising a storage unit and at least one computing unit which are connected in parallel, the plurality of computing devices being divided into a plurality of nodes, and the plurality of nodes forming a network topology; a communication device comprising an autonomous domain building module and a first communication module, the first communication module being configured for connecting the plurality of computing devices in a communication manner; and a task processing device comprising an addressing module and a task processing module. Therefore, the solution of the present disclosure meets the explosive demand of massive data and large amount computing power caused by artificial intelligence and blockchain to a certain extent.

Abstract: The invention describes a method for determining a storage location of a database object of a specific version, wherein indexes for each version of the database object are stored in a trie having a root node corresponding to the specific version, the method comprising: determining a trie corresponding to the specific version by accessing the root node of the trie corresponding to the specific version; determining an object identifier of the database object by traversing the trie corresponding to the specific version using a secondary key related to the database object as search key; determining the storage location of the database object by traversing the trie corresponding to the specific version using the determined object identifier as search key.

Abstract: Embodiments of the present invention relate to methods, systems, and computer program products for file management in a distributed file cache system. In some embodiments, a method is disclosed. According to the method, responsive to determining that at least one client node is obtaining a file of a first version stored at a storage node, one or more processors generate contact information indicating that the file of the first version is accessible from the storage node and the at least one client node and recorded the contact information into a distributed hash table. The storage node and the at least one client node are included in a plurality of nodes associated with the distributed hash table. Further, one or more processors generate first version information indicating that the file is of the first version and record the first version information into a blockchain associated with the plurality of nodes.

Abstract: A system and method for hybrid any-cast (unicast, multicast and anycast) routing in a mobile ad hoc communication network (MANET) is disclosed. In embodiments, each communication node of the MANET may implement on-demand routing functions whereby the node does not establish or maintain routes to destination nodes unless there is active communication, discovering routes via flooding of data packets in transit. Each communication node may select, or may transition from on-demand to, proactive routing functions. Proactive nodes first establish routes to clusters of other proactive nodes by flooding, and receiving acknowledgments from, the other proactive nodes. Each cluster of proactive nodes maintains routes within the cluster and establishes communication routes outside the cluster by flooding and relaying of routing status messages via clusterhead and gateway nodes.

Abstract: Some embodiments provide a method for a forwarding element that receives a packet. The method determines whether the packet matches any flow entries in a first cache that uses a first type of algorithm to identify matching flow entries for packets. When the packet does not match any flow entries in the first cache, the method determines whether the packet matches any flow entries in a second cache that uses a second, different type of algorithm to identify matching flow entries for packets. The method executes a set of actions specified by a flow entry matched by the packet in one of the first and second caches.

Abstract: Systems and methods are provided for synchronizing uplink (UL) and downlink (DL) traffic. In particular, frames associated with Quality of Service (QoS}-sensitive traffic flows to be transmitted in a first direction are prioritized commensurate with frames to be transmitted in a second direction, different/opposite to that of the first direction. For example, UL traffic flows can be prioritized based on DL traffic flows, where the traffic flows belong to the same application flow, and vice versa, where DL traffic flows can be prioritized based on UL traffic flows for the same application flow. In this way, end-to-end QoS can be achieved.

Abstract: Systems and methods are disclosed for identifying a set of internal edges on a representation of a network that satisfy a set of demands on the network. The disclosed systems and methods perform a multi-step process of selecting the internal edges. In a first step, an initial set of internal edges can be selected using a clique graph (or in another suitable manner). In a second step, a second set of internal edges can be selected using stream graph(s) (or in another suitable manner). The second set of internal edges can be used when determining network paths that satisfy the demands. When the representation of the network has a cut of two, the disclosed systems and methods can identify a set of internal edges providing a degree of protection against link failure.

Abstract: A network system includes a communication apparatus, and a control apparatus configured to control the communication apparatus. The communication apparatus includes a memory configured to store program instructions, and a processor configured to execute the instructions to receive an address of a destination virtual machine from the control apparatus, receive a packet from a source virtual machine, identify, based on the address of the destination virtual machine corresponding to the received packet, an identifier of an edge node connected to the destination virtual machine, and add the identifier of the edge node to the received packet.

Abstract: A system and method to adapt the grouping between a plurality of nodes in a data processing system. In one embodiment, a first leader node (320) in a data processing system (300) is configured to determine (815) a cost map within a first group of nodes (310), calculate (820) costs between the first leader node (320) and first member nodes (330) based on the cost map, determine (830) a candidate member node (330A) from the first member nodes (330), query (840) other leader nodes (350, 380) to accept a transfer of the candidate member node (330A), receive (850) a first transfer response from a second leader node (350) to accept the transfer to a second group of nodes (340), initiate (860) a transfer of and receive (865) an acknowledgement for the transfer of the candidate member node (330A) to the second group of nodes (340).

Abstract: A system and method for coherency gathering for rays in a ray tracing system. The ray tracing system uses a hierarchical acceleration structure comprising a plurality of nodes including upper level nodes and lower level nodes. For each instance where one of the lower level nodes is a child of one of the upper level nodes, an instance transform is defined, specifying the relationship between a first coordinate system of the upper level node and the second coordinate system for that instance of the lower level node. The system provides an instance transform cache for storing a plurality of these instance transforms while conducting intersection testing.

Abstract: A method for managing a computer network is provided, which comprises: performing data collection at at least one network node of the computer network belonging to a set of one or more network nodes corresponding to a first depth level of a routing tree that represents nodes of the computer network and edges respectively corresponding to neighboring relations between two nodes of the computer network, the data collection comprising: receiving first data collection configuration data generating second data collection configuration data for collecting data from at least one child node in the routing tree of the at least one network node of the computer network, wherein the second data collection configuration data comprises scheduling data for collecting data from each of the at least one child node, and collecting data from each of the at least one child node according to the second data collection configuration data.

Abstract: In some examples, a method includes receiving, by an egress network device for a network, messages from each of a plurality of ingress network devices for the network, wherein each of the messages specifies a multicast source, a multicast group, and an upstream multicast hop weight value for multicast traffic for the multicast source and the multicast group; selecting, by the egress network device and based on the upstream multicast hop weight values specified by the received messages, one of the plurality of ingress network devices to which to send a multicast join message of a plurality of multicast join messages for the multicast source and multicast group; and sending, by the egress network device, the multicast join message to the selected one of the plurality of ingress network devices.

Abstract: A computer-implemented method determines a routing cost for routing data over a routing path between a first device in a first network and a second device, wherein the routing path has a path segment between a gateway device of the first network and a device in a second network, the gateway device being configured to establish a connection between the first and second networks. This method may include determining a routing cost for the path segment, the routing cost for the path segment having a default routing cost value that is based on capabilities of the gateway device and/or the communication technology; and determining the routing cost for the routing path based on the routing cost for the path segment. The invention furthermore relates to determining a route based on the routing cost, and to routing a data packet based on the route.

Abstract: A DECT network clustering method includes sending, by a DECT host to a router, a multicast command that declares joining a specified multicast group; sending, by a DECT device to the router, a multicast probe message sent to a target multicast group; receiving, by the router, the multicast command and the multicast probe message, and sending, to the DECT host according to the multicast command, the multicast probe message; receiving, by the DECT host, the multicast probe message, and sending status declaration information to the DECT device; receiving, by the DECT device, the status declaration information, and initiating a TCP connection request to the DECT host in a point-to-point manner; and receiving, by the DECT host, the connection request from the DECT device, and establishing a TCP channel with the DECT device.

Abstract: The present disclosure relates to systems, methods, and products for identifying candidate molecule. The system includes a non-transitory memory storing instructions; and a processor in communication with the non-transitory memory. The processor executes the instructions to cause the system to receive drug data; convert the drug data into at least one point in a latent space using a grammar variational auto-encoder (VAE) model; receive a query for the at least one candidate molecule; select one or more points in the latent space; and create a k-dimensional tree graph based on the query for the at least one candidate molecule and the selected one or more points; determine a plurality of paths according to an interpolation technique; receive preference data; determine an optimum path; determine at least one candidate point on the optimum path; and determine a drug molecular structure using an inverse of the grammar VAE model.

Abstract: In some examples, a method includes receiving, by an egress network device for a network, messages from each of a plurality of ingress network devices for the network, wherein each of the messages specifies a multicast source, a multicast group, and an upstream multicast hop weight value for multicast traffic for the multicast source and the multicast group; selecting, by the egress network device and based on the upstream multicast hop weight values specified by the received messages, one of the plurality of ingress network devices to which to send a multicast join message of a plurality of multicast join messages for the multicast source and multicast group; and sending, by the egress network device, the multicast join message to the selected one of the plurality of ingress network devices.

Abstract: A wireless device is configured to receive scheduling information at a predetermined time interval from a wireless node. The scheduling information includes a plurality of reception definitions. Each reception definition indicates a reception start time, a reception duration, and assigned frequency information. Each reception definition is derived from a wireless device identification associated with the reception definition. The wireless device is configured to receive data associated with at least one of the reception definitions.

Abstract: In some examples, a method includes receiving, by an egress network device for a network, messages from each of a plurality of ingress network devices for the network, wherein each of the messages specifies a multicast source, a multicast group, and an upstream multicast hop weight value for multicast traffic for the multicast source and the multicast group; selecting, by the egress network device and based on the upstream multicast hop weight values specified by the received messages, one of the plurality of ingress network devices to which to send a multicast join message of a plurality of multicast join messages for the multicast source and multicast group; and sending, by the egress network device, the multicast join message to the selected one of the plurality of ingress network devices.

Abstract: Embodiments for a method of implementing multiple domains in a network switching device are disclosed. The method includes assigning a plurality of hardware ports to a plurality of domains. Ports are assigned to at least two of the plurality of domains, and none of the ports are concurrently assigned to multiple domains. The method also includes loading rules for forwarding packets between the plurality of ports into a data plane. The rules direct the data plane to forward only between ports in a common domain of the plurality of domains. The method also includes assuring that a packet received at any port assigned to a first domain is not sent in legible form from any port assigned to a second domain if an error causes the data plane to forward or request forwarding the packet to any port assigned to a second domain.

Abstract: Flow-zone switching provides for the switching of frames through a network, basing forwarding decisions on location and flow information encoded in the frames, such as in the source and destination addresses. Various address formats are disclosed, supporting transfer of packet data among data switches as well as among endpoints. Systems, apparatuses, and methods are disclosed.

Abstract: This application discloses a link-state advertisement LSA sending method, an apparatus, and a system, to reduce a quantity of LSA sending times. The method includes: generating, by a first router, a first path table based on level location information of the first router, level location information of a second router, and level location information of at least one third router; sending, by the first router, a first link state update LSU message to the second router; receiving, by the second router, the first link state update LSU message from the first router; updating, by the second router, a link state database LSDB of the second router based on a first LSA; and sending, by the second router, the first LSA to a router corresponding to an identifier in the first path table.

Abstract: A method of sorting an array of data elements, the method includes assigning values associated with a monotonic function to the data elements, and sorting the array of data elements by sorting the monotonic function values using a least significant digit (LSD) Radix sort.

Abstract: The invention relates to a method for analyzing an abnormal event in an industrial automation and control system, IACS, comprising the following steps: identifying the abnormal event; detecting a root cause of the abnormal event; and generating a notification if the root cause is not a user activity and, if the root cause is a user activity, evaluating the possible impact on the IACS caused by the abnormal event, and generating a notification if the evaluation of the possible impact does not match a predefined list of allowable behavior. The present invention also relates to a corresponding system and corresponding computer program product comprising one or more computer readable media having computer executable instructions for performing the steps of the method.