Abstract: System and method for adjusting side mirrors capture, by a primary camera, a facial image of a driver; estimate a 3D eye location with respect to a 3D coordinate of the primary camera based on the captured facial image; map the estimated 3D eye location to a respective set of pitch and yaw of the side mirror based on a look up table; and rotate the side mirror to a target position in accordance with the respective set of pitch and yaw. The lookup table includes a plurality of rows, each containing a pair of a key and a set of values. The key is a set of three parameters of 3D line of locations where the driver can observe an optimal view behind the vehicle, and the set of values includes a set of pitch and yaw of the side mirror corresponding to the 3D line of locations.

Abstract: A method for adjusting a side mirror of a vehicle includes capturing, by a primary camera provided in front of a driver of the vehicle, a facial image of the driver; estimating a 3D eye location with respect to a 3D coordinate of the primary camera based on the captured facial image; mapping the estimated 3D eye location to a respective set of pitch and yaw angles of the side mirror based on a lookup table; and rotating the side mirror to a target position in accordance with the respective set of pitch and yaw angles. The lookup table includes a plurality of rows, each row containing a pair of a key and a set of values. The key is a 3D eye location, and the set of values includes a set of pitch and yaw angles of the side mirror corresponding to the 3D eye location.

Abstract: Techniques configure a network to relay data from a node to a root device are described herein. In an example, one-hop neighbors of the node are determined and ranked according to link quality. The ranked neighbor nodes may be considered potential “parent nodes” of the node. The ranked nodes may be divided into a plurality of groups according to link quality. A parent node may be selected from among the “best” group of one-hop neighbor nodes and may be used to relay data for the node to and/or from the router or other device. The node continues to use the parent node at least until its ranking removes it from the best group or falls below a threshold value. After the ranking of the parent falls below such a prescribed threshold it may be replaced by selection of a replacement parent from the group of one-hop upstream neighbors having the best link quality.

Abstract: Source routing techniques include sending data across several networks, while limiting source routing overhead. For example, the source routing techniques may use a first address format to route data to nodes along a routing path that are within a first network where a source node is located, and use a second address format to route the data to a node along the routing path that is within a second, different network. The node in the second network may similarly route the data through the second network using the first address format for nodes within the second network and, if needed, route the data to a node within a third network using the second address format. This may be repeated for any number of networks to reach a destination.

Abstract: In order to avoid various jamming attacks from intelligent jammers in modern complex wireless environments, a system and method is presented for a user radio to generate and implement an adaptive anti-jamming communication strategy. The said adaptive anti-jamming communication strategy is obtained via the training process for a specific neural network using Deep Double-Q Reinforcement learning algorithm in the strategy generation phase. The objective of this process is to discover a strategy to select the optimal radio action including transmission channel and transmission power for the user radio, which is changed adaptively to different jamming patterns to maximize the successful transmission rate (“jamming-free”) while retaining the power consumption of user radio as low as possible.

Abstract: Techniques configure a network to relay data from a node to a root device are described herein. In an example, one-hop neighbors of the node are determined and ranked according to link quality. The ranked neighbor nodes may be considered potential “parent nodes” of the node. The ranked nodes may be divided into a plurality of groups according to link quality. A parent node may be selected from among the “best” group of one-hop neighbor nodes and may be used to relay data for the node to and/or from the router or other device. The node continues to use the parent node at least until its ranking removes it from the best group or falls below a threshold value. After the ranking of the parent falls below such a prescribed threshold it may be replaced by selection of a replacement parent from the group of one-hop upstream neighbors having the best link quality.

Abstract: Techniques for bridging communication between multiple networks to facilitate distribution of multicast data are described herein. For example, a node that is able to communicate with its network and an adjacent network may send a subscription message indicating that the node is a member of a multicast group. The subscription message may be forwarded up both networks. The node may then forward, between the networks, data that is destined for members of the multicast group.

Abstract: Techniques configure a network to relay data from a node to a root device are described herein. In an example, one-hop neighbors of the node are determined and ranked according to link quality. The ranked neighbor nodes may be considered potential “parent nodes” of the node. The ranked nodes may be divided into a plurality of groups according to link quality. A parent node may be selected from among the “best” group of one-hop neighbor nodes and may be used to relay data for the node to and/or from the router or other device. The node continues to use the parent node at least until its ranking removes it from the best group or falls below a threshold value. After the ranking of the parent falls below such a prescribed threshold it may be replaced by selection of a replacement parent from the group of one-hop upstream neighbors having the best link quality.

Abstract: Techniques for starting an electronic communication based on a captured image are disclosed herein. In some embodiments, a computer system detects that an image has been captured by a camera on a first mobile device of a first user, where the captured image has been captured by the camera at a point in time, and, in response to detecting that the image has been captured, the computer system identifies at least one other user in the captured image. In some example embodiments, the computer system transmits a message to an electronic destination associated with the other user(s) based on the identifying of the other user(s) in the captured image.

Abstract: Techniques for connecting networks to facilitate distribution of data are described. For example, to distribute multicast data to members of a multicast group that span multiple networks, the techniques may identify a path between networks that each have a member of the multicast group, such as a shortest path between networks. The techniques may inform the networks on the path to establish a connection with an adjacent network. This may allow multicast data for a multicast group to be distributed to members of the multicast group that are located in separate networks.

Abstract: Source routing techniques include sending data across several networks, while limiting source routing overhead. For example, the source routing techniques may use a first address format to route data to nodes along a routing path that are within a first network where a source node is located, and use a second address format to route the data to a node along the routing path that is within a second, different network. The node in the second network may similarly route the data through the second network using the first address format for nodes within the second network and, if needed, route the data to a node within a third network using the second address format. This may be repeated for any number of networks to reach a destination.

Abstract: Techniques for bridging communication between multiple networks to facilitate distribution of multicast data are described herein. For example, a node that is able to communicate with its network and an adjacent network may send a subscription message indicating that the node is a member of a multicast group. The subscription message may be forwarded up both networks. The node may then forward, between the networks, data that is destined for members of the multicast group.

Abstract: Techniques are directed to opportunistically communicating using a modulation scheme that is other than the preferred modulation scheme, to update communication metric data for the second modulation scheme, such as a modulation scheme that has not been used as much as the first modulation scheme. The second modulation scheme may be associated with a higher data rate than the preferred modulation scheme. If communication using the second modulation scheme is successful, subsequent communication may be carried out exclusively using the second modulation scheme, and the communication metrics may develop such that the second modulation scheme becomes the preferred modulation scheme.

Abstract: Source routing techniques include sending data across several networks, while limiting source routing overhead. For example, the source routing techniques may use a first address format to route data to nodes along a routing path that are within a first network where a source node is located, and use a second address format to route the data to a node along the routing path that is within a second, different network. The node in the second network may similarly route the data through the second network using the first address format for nodes within the second network and, if needed, route the data to a node within a third network using the second address format. This may be repeated for any number of networks to reach a destination.

Abstract: Techniques for bridging communication between multiple networks to facilitate distribution of multicast data are described herein. For example, a node that is able to communicate with its network and an adjacent network may send a subscription message indicating that the node is a member of a multicast group. The subscription message may be forwarded up both networks. The node may then forward, between the networks, data that is destined for members of the multicast group.

Abstract: Techniques for starting an electronic communication based on a captured image are disclosed herein. In some embodiments, a computer system detects that an image has been captured by a camera on a first mobile device of a first user, where the captured image has been captured by the camera at a point in time, and, in response to detecting that the image has been captured, the computer system identifies at least one other user in the captured image. In some example embodiments, the computer system transmits a message to an electronic destination associated with the other user(s) based on the identifying of the other user(s) in the captured image.

Abstract: Techniques for connecting networks to facilitate distribution of data are described. For example, to distribute multicast data to members of a multicast group that span multiple networks, the techniques may identify a path between networks that each have a member of the multicast group, such as a shortest path between networks. The techniques may inform the networks on the path to establish a connection with an adjacent network. This may allow multicast data for a multicast group to be distributed to members of the multicast group that are located in separate networks.

Abstract: Source routing techniques include sending data across several networks, while limiting source routing overhead. For example, the source routing techniques may use a first address format to route data to nodes along a routing path that are within a first network where a source node is located, and use a second address format to route the data to a node along the routing path that is within a second, different network. The node in the second network may similarly route the data through the second network using the first address format for nodes within the second network and, if needed, route the data to a node within a third network using the second address format. This may be repeated for any number of networks to reach a destination.

Abstract: A new device is deployed to an area in which a network is provided. The new device may join the network using a single handshake via a neighboring device that is a member of the network and register with a network management system managing the network. If the network is overloaded or has limited bandwidth remaining, the network may refuse to admit the new device, or if the new device is isolated, may force some devices that are members of the network to leave or migrate from the network to allow the isolated device to join the network.

Abstract: Techniques for controlling packet transmission levels in a multi-hop network may be performed in a distributed manner. Load-control functionality may be distributed among a plurality of nodes within a network, allowing such nodes to send feedback to upstream nodes, and receive feedback from downstream nodes. In an example, received packets are measured, such as by summing sizes of received packets over time, to determine a received traffic-level. Transmitted packets are measured, such as by summing sizes of transmitted packets over time, to determine a transmitted traffic-level. Feedback may be sent to at least one source of the received packets based at least in part on the received traffic-level and the transmitted traffic-level. The feedback may indicate a desired rate for the sender to transmit. A node may receive data from upstream node(s) and from an internal device, such as a metrology unit. Both data sources may be controlled by feedback.