Microsoft Technology Licensing, LLC

Facebook, Inc.

Mitsubishi Electric Research Laboratories, Inc.

Pinterest, Inc.

Micorsoft Corpration

Yunnan Wu

Ranveer Chandra

Jin Li

Philip Andrew Chou

Paramvir Bahl

Thomas Moscibroda

Cha Zhang

Yuan Yuan

Maxime Boucher

Tao Xie

Rousseau Newaz Kazi

Gopala Sri Hari Narlanka

Amer A Hassan

Christian F Huitema

Kamal Jain

Dinei A Florencio

Wayne Stark

Saumitra M Das

Andreas F Molisch

Jitendra Dattatraya Padhye

Ya-Qin Zhang

Dan Teodosiu

Venkata N Padmanabhan

Lin Luo

Cheng Huang

Andrew Craig Bragdon

Alexandra K Heron

Mehrdad Bidgoli

Eyal Schwartz

Minghua Chen

Justin Velo

John T Spivey

Peter Avelino Ruibal

Matthew Knight Jones

Mohamed Jawad Khaki

Mengya You

Wendy Lu

Alok Menghrajani

Yao Zhao

Nipoon Malhotra

Sun Yuan Kung

Adam Ernst

Shahrouz Tavakoli

Vivian Clara Chow

Baochun Li

Raphael Grignani

Clement Genzmer

Harsh Goel

Sri Hari Narlanka

Beau R Hartshorne

Adam Lazur

Rousseau Kazi

Disclosed are systems and methods for presenting supplemental content items on a user device while requested additional content is obtained. For example, a user is presented with a content item, such as an image, an advertisement, etc., on a display of a user device. The content item, when interacted with by the user, results in a request for additional content, such as a web page, being sent to a remote computing resource, the additional content item being received by the user device from the remote computing resource, loaded by the user device, and presented to the user on the display of the user device. Rather than presenting the user with a blank screen, an empty window, a 'loading' notification (e.g., spinning icon), etc., while the additional content item is retrieved and loaded, the implementations discussed herein provide the user with effectively instant gratification by presenting on the display of the user device and while the additional content item is retrieved and loaded, supplemental content that is already stored in memory of the user device.

Supplemental content items

In one embodiment, a method includes receiving, at the mobile client system, a text string inputted into a query field by a first user, accessing, from a local data store, a set of grammar templates, each grammar template comprising query tokens referencing an object stored in the local data store, generating one or more natural-language suggested queries by matching portions of the text string to query tokens of the grammar templates, each suggested query comprising references to one or more of the objects stored in the local data store and the natural-language string of the matching grammar template, calculating a cost for each grammar template based at least in part on one or more portions of text string not corresponding to one of the query tokens, and displaying one or more suggested queries to the first user, each having a calculated cost below a threshold cost value.

Client-side search templates for online social networks

Techniques for handshake-free encrypted communication are described. An apparatus may comprise a key component, a message component, and a network component. The key component may be operative to retrieve a first symmetric encryption key from a key store and to store a second symmetric encryption key in the key store. The message component may be operative to construct a message comprising a data section, the data section encrypted using the first symmetric encryption key. The network component may be operative to transmit the message to a device and to receive a response to the message, the response comprising the second symmetric encryption key. Other embodiments are described and claimed.

Techniques for handshake-free encrypted communication using symmetric key caching during request-and-response

In one embodiment, a method includes receiving an unstructured text query from a first user of an online social network; and accessing, from a data store of the mobile client system, a set of nodes of a social graph of the online social network. The social graph includes a number of nodes and edges connecting the nodes. The nodes include a first node corresponding to the first user and a number of second nodes that each correspond to a concept or a second user associated with the online social network. The method also includes accessing, from the data store of the mobile client system, a set of grammar templates. Each grammar template includes one or more non-terminal tokens and one or more query tokens. The query tokens include references to zero or more second nodes and one or more edges and each grammar template is based on a natural-language string.

Techniques for handshake-free encrypted communication are described. An apparatus may comprise an application status component, a network component, and a key component. The application status component may be operative to determine that the application has entered a background-availability state. The network component may be operative to request a first symmetric encryption key from a device and to receive the first symmetric encryption key from the device. The key component may be operative to store the first symmetric encryption key in a key store. Other embodiments are described and claimed.

Techniques for handshake-free encrypted communication using symmetric key caching during application backgrounding

Techniques for handshake-free encrypted communication are described. An apparatus may comprise a reception component and a precomputation component. The reception component may be operative to receive a priming message from a client using a stateless network protocol, to establish a communication channel to the client, and to transmit a response to the priming message over the communication channel to the client. The precomputation component may be operative to determine the response in response to the reception of the priming message from the client. Other embodiments are described and claimed.

Techniques to prime a stateful request-and-response communication channel

A new media access control (MAC) protocol for cognitive wireless networks is described. The new MAC protocol allows each of multiple nodes, such as cell phones and computers with wireless, to determine utilization of a communication spectrum, such as the television broadcast band. The nodes collaborate to achieve a combined view of spectrum utilization in their local vicinity, in which scheduled users and empty time segments are mapped across a wide range of frequencies. Nodes negotiate with each other to reserve idle segments of the spectrum for packet exchange on negotiated frequencies. Control packet structure allows nodes to become prescient of the local spectrum utilization during handshaking. A cognitive device operating under the new MAC has a first radio that both scans the spectrum and monitors a control channel; and a second reconfigurable radio with adjustable parameters, including frequency and bandwidth, for packet transmission.

Media access control (MAC) protocol for cognitive wireless networks

A multiuser scheme allowing for a number of users, sets of user, or carriers to share one or more channels is provided. In the invention, the available channel bandwidth is subdivided into a number of equal-bandwidth subchannels according to standard OFDM practice. A transmitter transmits data on a set of OFDM subchannels that need not be contiguous in the spectrum or belong to the same OFDM channel. A receiver receives and decodes the data and detects errors on subchannels. The receiver then broadcasts the identity of those subchannels on which the error rate exceeds a specific threshold, and the transmitter may select different subchannels for transmission based on this information.

FEC in cognitive multi-user OFDMA

Described is a distributed peer-assisted multicast content delivery system (e.g., a multiparty conferencing application) that uses an adaptive link rate control protocol to discover and adapt to an arbitrary topology quickly and converge to efficient link rate allocations allowed by an underlying network. Link rates are regularly obtained and used to determine trees for sending packets to other nodes. Network coding is used to implement data multicast so that mixtures (i.e., linear combinations) of the packets are transmitted in the network. The redundant packets may be differentiated from non-redundant ('innovative') packets such that network conditions may be measured by link innovation and/or session innovation.

Multiparty real time content delivery

A prediction is calculated to determine whether a content item posted on a social networking system infringes on copyrights or otherwise violates the system's terms of use. The predictions are generated using social signals that are based on social information surrounding the content item, such as the density of connections between the posting user and the viewing users, the profile information of the users, and the geographical separation between the users. The content item is disabled if the prediction indicates a violation and the violation can be verified.

Using social signals to identify unauthorized content on a social networking system

Dynamic time-spectrum block allocation for cognitive radio networks is described. In one implementation, without need for a central controller, peer wireless nodes collaboratively sense local utilization of a communication spectrum and collaboratively share white spaces for communication links between the nodes. Sharing local views of the spectrum utilization with each other allows the nodes to dynamically allocate non-overlapping time-frequency blocks to the communication links between the nodes for efficiently utilizing the white spaces. The blocks are sized to optimally pack the available white spaces. The nodes regularly readjust the bandwidth and other parameters of all reserved blocks in response to demand, so that packing of the blocks in available white spaces maintains a fair distribution of the overall bandwidth of the white spaces among active communication links, minimizes finishing time of all communications, reduces contention overhead among the nodes contending for the white spaces, and maintains non-overlapping blocks.

Dynamic time-spectrum block allocation for cognitive radio networks

Techniques for enhancing throughput capacity and/or bandwidth distribution fairness among APs in a wireless network are described. Specifically, a channel frequency profile which includes a center frequency and channel-width (i.e., channel bandwidth) is dynamically assigned to each of one or more APs in a wireless network. The assigned channel frequency profile for each AP is based, at least in part, on the current composition of the wireless network including, its topology and traffic load distribution. In this regard, each AP's channel frequency profile can be continuously or periodically changed such that the entire available frequency spectrum is effectively utilized and/or interference between APs is avoided or limited. This, in turn, enhances the throughput capacity and/or bandwidth distribution fairness of the wireless network.

Dynamic channel-width allocation in wireless networks

Context-based routing in multi-hop networks involves using a context-based routing metric. In a described implementation, respective path values are calculated for respective ones of multiple paths using the context-based routing metric. A path is selected from the multiple paths responsive to the calculated path values. Data is transmitted over at least one link of the selected path. In an example embodiment, the context-based routing metric is ascertained responsive to an estimated service interval (ESI) of a bottleneck link of each path of the multiple paths. In another example embodiment, the context-based routing metric is ascertained responsive to an expected resource consumption (ERC) metric. In an example embodiment of path selection, the path is selected using a context-based path pruning (CPP) technique that involves maintaining multiple local contexts at each intermediate node, with each local context representing at least one partial path.

Context-based routing in multi-hop networks

Growing community of inventors

Redmond, WA, United States of America

Yunnan Wu