Abstract: Described is a technology by which a gesture made with a source device (e.g., a cellular telephone), such as a throwing or pointing motion, is used to automatically set up a connection with another device to which the gesture is directed. Audio signals output during the gesture, e.g., such as at the start and end of the gesture, are detected by candidate (listening) devices. The device having the least time difference between detection of the start and end signals is the device that is generally best aligned with the throwing or pointing motion, and thus may be selected as the target device. Once selected, a connection such as a network connection may be set up between the source device and the target device for further communication, such as for application data exchange.

Abstract: Described is a technology by which a gesture made with a source device (e.g., a cellular telephone), such as a throwing or pointing motion, is used to automatically set up a connection with another device to which the gesture is directed. Audio signals output during the gesture, e.g., such as at the start and end of the gesture, are detected by candidate (listening) devices. The device having the least time difference between detection of the start and end signals is the device that is generally best aligned with the throwing or pointing motion, and thus may be selected as the target device. Once selected, a connection such as a network connection may be set up between the source device and the target device for further communication, such as for application data exchange.

Abstract: A video encoding system uses both a central processing unit (CPU) and a graphics processing unit (GPU) to perform video encoding. The system implements a technique that enables the GPU to perform motion estimation for video encoding. The technique allows the GPU to perform a motion estimation process in parallel with the video encoding process performed by the CPU. The performance of video encoding using such a system is greatly accelerated as compared to encoding using just the CPU. Also, data related to motion estimation is arranged and provided to the GPU in a way that utilizes the capabilities of the GPU. Data about video frames may be collocated to enable multiple channels of the GPU to process tasks in parallel. The depth buffer of the GPU may be used to consolidate repeated calculations and searching tasks during the motion estimation process.

Abstract: Acoustic ranging may involve determining a distance between a first device and at least one other device using one or more acoustic signals. In an example embodiment, a first device emits a first acoustic signal and then receives the first acoustic signal at a first time. The first device also receives a second acoustic signal at a second time, with the second acoustic signal having been emitted by a second device. The first device ascertains a first value that reflects a difference between the first time and the second time. Responsive to at least the ascertained first value, the first device determines a distance between the first device and the second device.

Abstract: An accelerated video decoding system utilizes a graphics processing unit to perform motion compensation, image reconstruction, and color space conversion processes, while utilizing a central processing unit to perform other decoding processes.

Abstract: Described is a technology, such as implemented as social networking groupware application designed for mobile device users, that provides a data mashup service for various data types, including location dependent and mobility-aware data such as GPS location and surrounding maps. A mobile user may track the location and maps of roaming friends at runtime. To this end, a client device joins a squad of client devices that are each capable of communicating with one another over a wireless local area network (WLAN) connection. When in a squad, the client can obtain data for use as mashup information from other client devices in the squad over the WLAN connection (inter-squad). This may include intra-squad data that was obtained from a service based on information that the service received from another squad, e.g., over a WWAN connection.

Abstract: Described is a technology by which a gesture made with a source device (e.g., a cellular telephone), such as a throwing or pointing motion, is used to automatically set up a connection with another device to which the gesture is directed. Audio signals output during the gesture, e.g., such as at the start and end of the gesture, are detected by candidate (listening) devices. The device having the least time difference between detection of the start and end signals is the device that is generally best aligned with the throwing or pointing motion, and thus may be selected as the target device. Once selected, a connection such as a network connection may be set up between the source device and the target device for further communication, such as for application data exchange.

Abstract: Systems and methods are described for using peer-to-peer collaboration to enhance streaming of multimedia content. A peer-paired pyramid streaming (P3S) architecture is introduced that is a hybrid of a client/server structure and a peer-to-peer structure. Clients are hierarchically organized and those that are in the same level are coupled to form peer-pairs. The peers in a peer-pair cooperate by utilizing a connection between them. Streaming is enhanced by allowing each peer to download different portions of a stream and sharing portions not in possession of the other. Error recovery is enhanced by allowing a peer to retrieve a dropped packet from its corresponding peer. A colored overlay is used with a P3S structure to improve streaming throughput.

Abstract: The systems and methods described herein are directed at accelerating video encoding using a graphics processing unit. In one aspect, a video encoding system uses both a central processing unit (CPU) and a graphics processing unit (GPU) to perform video encoding. The system implements a technique that enables the GPU to perform motion estimation for video encoding. The technique allows the GPU to perform a motion estimation process in parallel with the video encoding process performed by the CPU. The performance of video encoding using such a system is greatly accelerated as compared to encoding using just the CPU. In another aspect, data related to motion estimation is arranged and provided to the GPU in a way that utilizes the capabilities of the GPU. Data about video frames may be collocated to enable multiple channels of the GPU to process tasks in parallel. The depth buffer of the GPU may be used to consolidate repeated calculations and searching tasks during the motion estimation process.

Abstract: Described is a technology by which mobile telephones are organized and/or operate based upon special relationships with other users and/or other mobile telephones. A mobile computing device is coupled to another mobile computing device so as to have a special relationship therewith, including after subsequent decoupling. When the mobile telephones that have a special relationship are thereafter coupled together, the devices may operate differently (relative to their operation when coupled to other mobile telephones). Also described is a single user interface screen that outputs an identifier (e.g., an image) of a potential recipient, along with communication options, such as to call, send a text message, share data, show information or send a predefined message.

Abstract: Using location-independent names to identify content, a service for mapping endpoint requests to requested content. Content requested by an endpoint of the network is mapped to a dynamic “swarm” of server, peer, or other endpoints capable of supporting the content download. Content names are mapped to a dynamically generated content swarm, presenting a current set of hosts, which can provide the requested content. Optionally, varying degrees of explicit visibility into routing paths and the performance tradeoffs between those routing paths is supported. Based on a set of class of service parameters for a given request for content, a host can initiate route selection based on class of service parameters, predicated on routing metrics maintained by the network by cooperating endpoints and/or network routers.

Abstract: A service for facilitating a determination of path quality between a first endpoint node and a second endpoint node in a network of nodes is provided. Path quality information is aggregated from across network internet service providers (ISPs), giving authorized endpoints access to path quality information for specified path segments of a path to another endpoint. Path quality information includes one or more metrics that measure available bandwidth, loss rate and/or latency.

Abstract: Acoustic ranging may involve determining a distance between a first device and at least one other device using one or more acoustic signals. In an example embodiment, a first device emits a first acoustic signal and then receives the first acoustic signal at a first time. The first device also receives a second acoustic signal at a second time, with the second acoustic signal having been emitted by a second device. The first device ascertains a first value that reflects a difference between the first time and the second time. Responsive to at least the ascertained first value, the first device determines a distance between the first device and the second device.

Abstract: The techniques and mechanisms described herein are directed at transmitting elementary streams in a broadcast environment. The mechanisms provide a buffer controller and packet scheduler that allow a media format to be transmitted through the broadcasting environment in a manner resulting in a low channel switch delay. A buffer-fullness indicator allows the operation with various types of decoders. A lower bound and an upper bound are calculated for each frame within the elementary stream. The lower bound corresponds to an earliest time for sending the frame without causing an overflow condition within a decoder buffer. The upper bound corresponds to a latest time for sending the frame without causing an underflow condition within the decoder buffer. A send time is then scheduled based on the lower bound and the upper bound that determines when a packet associated with the frame is transmitted over a channel in a broadcast environment.

Abstract: An HTTP-based P2P framework is described. In one implementation, an exemplary system reduces network congestion caused by P2P traffic at Internet Service Providers (ISPs) by packetizing P2P data and recruiting pre-existing Internet web caches (for HTTP traffic) to cache the P2P traffic. Exemplary pinging techniques detect the web caches, which are usually transparent, and determine their usability. Then, an exemplary topology-building protocol constructs a cache-aware tree-structured P2P overlay that prefers to deliver the P2P traffic via cached data paths. The cache-aware tree-structured P2P overlay has a logical structure that maximizes P2P data transit over paths that have pre-existing Internet web caches. If no web caches are detected, then peers are put into an orphan set and can resort to conventional P2P technology.

Abstract: A video encoding system performs packetization of FGS/PFGS encoded video bitstreams by selecting encoded bitstream segments for packetization based on an estimated total contribution to distortion reduction associated with each encoded bitstream segment. The selected bitstream segments are then packetized according to a packet-independence packetization strategy that minimizes inter-packet dependency.

Abstract: Efficient integrated digital video transcoding is described. In one aspect, an integrated transcoder receives an encoded bitstream. The integrated transcoder transcodes the encoded bitstream by partially decoding the encoded bitstream based on a first transform associated with a first media data format. The decoding operations generate an intermediate data stream. The integrated transcoder then encodes the intermediate data stream using a second transform associated with a second media data format. The first and second transforms are not the same.

Abstract: The systems and methods described herein are directed at accelerating video encoding using a graphics processing unit. In one aspect, a video encoding system uses both a central processing unit (CPU) and a graphics processing unit (GPU) to perform video encoding. The system implements a technique that enables the GPU to perform motion estimation for video encoding. The technique allows the GPU to perform a motion estimation process in parallel with the video encoding process performed by the CPU. The performance of video encoding using such a system is greatly accelerated as compared to encoding using just the CPU. In another aspect, data related to motion estimation is arranged and provided to the GPU in a way that utilizes the capabilities of the GPU. Data about video frames may be collocated to enable multiple channels of the GPU to process tasks in parallel. The depth buffer of the GPU may be used to consolidate repeated calculations and searching tasks during the motion estimation process.

Abstract: A video encoding system uses both a central processing unit (CPU) and a graphics processing unit (GPU) to perform video encoding. The system implements a technique that enables the GPU to perform motion estimation for video encoding. The technique allows the GPU to perform a motion estimation process in parallel with the video encoding process performed by the CPU. The performance of video encoding using such a system is greatly accelerated as compared to encoding using just the CPU. Also, data related to motion estimation is arranged and provided to the GPU in a way that utilizes the capabilities of the GPU. Data about video frames may be collocated to enable multiple channels of the GPU to process tasks in parallel. The depth buffer of the GPU may be used to consolidate repeated calculations and searching tasks during the motion estimation process.

Abstract: It is known to represent a square block of an image which has a maximum horizontal or vertical extension N as N vectors each representing one column or row, and encode it using an N×N discrete cosine transform matrix. We introduce a technique which transforms an input vector, or array, representing a portion of an arbitrarily-shaped object block in which the maximum horizontal or vertical extension is at most N, by adding to it additional padding elements, to produce a vector or array which can be encoded using an N×N discrete cosine transform. The padding maximises the number of transformed elements which are zero. We propose encoding arbitrarily-shaped objects based on this padding technique.