A client device requests a web page via a network, where the web page is identified by an identifier and references a widget. Following receipt of the requested web page, the client device requests the widget referenced by the requested web page and presents, within the requested web page, a presentation of the widget. Thereafter, in response to receiving user information within the presentation of the widget, the client device communicates the user information to a server via a secure connection between the widget on the client device and the server while maintaining user context at the client device in the requested web page, where the secure connection is initiated by the client device and employs a secure communication protocol implemented by the widget.

The subject matter of this specification can be implemented in, among other things, a method that includes receiving, by a processing device, one or more first content items for one or more first user accounts of a content sharing system. The method further includes storing the first content items at the content sharing system. The method further includes receiving, by the processing device, a second content item for a second user account of the content sharing system. The method further includes comparing, by the processing device, the received second content item to the stored first content items to determine that the second content item is not exclusive to the second user account. The method further includes restricting a privilege of the second user account for the second content item in response to the determination that the second content item is not exclusive to the second user account.

Techniques for architected data transfer are described. A controller maintains a network information database representing overarching knowledge of the network, such as the underlying communication infrastructure, resource consumption limits, and segment locations. The controller uses the information stored in the network information database to direct transmitters to transfer data segments to receivers in a manner that ensures relatively predictable resource consumption. In one approach, the controller receives a request to transfer data to a receiver. The controller, based on the information contained in the network information database, computes an optimal set of transmitters to participate in the transfer. The controller sends each transmitter in the optimal set an instruction assigning that transmitter to transfer one or more segments of the data to the receiver. Each transmitter, upon receiving the instructions, sends their respectively assigned data segments to the receiver.

A method including downloading a streaming model file and at least one initial execution file from a server via a conventional download protocol without using a specialized streaming protocol. When executed, the initial execution file only partially implements an application. The model file stores information identifying additional portions of the application file to be downloaded from the server. Data is read from the initial execution file, and stored in a local copy of the application file. Then, the application is executed by executing the local copy. Until the entire application file has been downloaded and as the application is executing, the information is read from the model file to identify a next file to download, the next file is downloaded via the conventional download protocol without using a specialized streaming protocol, next data is read from the next file, and the next data is stored in the local copy.

Methods, servers, clients, and systems for releasing instant messaging key-value data are provided. A server receives a request packet for pulling key-value data sent from a client during a login. The request packet at least contains a full-amount pulling time-stamp, an increased-amount pulling time-stamp, and a data-altering serial number. The server selects a pre-set data releasing mechanism according to parameters contained in the request packet, to release full amount key-value data to the client or to release increased amount key-value data to the client, or not to release the key-value data, such that, according to a returned result from the server, the client updates local cache data to display to a user.

In an approach to improving resource downloads, one or more computer processors detect a request to download a resource from an original source to a user's computing device. The one or more computer processors determine a cost of the download of the requested resource from the original source. The one or more computer processors determine whether the cost of the download of the requested resource from the original source exceeds a predefined threshold. The one or more computer processors determine a group of trusted network connected endpoints. The one or more computer processors determine whether the requested resource exists in the group of trusted network connected endpoints. Responsive to determining the requested resource exists in the group of trusted network connected endpoints, the one or more computer processors download the requested resource from at least one of the trusted network connected endpoints.

In embodiments of device to device content upgrades, a computing device includes a peer sharing manager that shares content and upgrades to content with peer devices. The computing device downloads content and upgrades from sources on the Internet, and shares the content and upgrades with peer devices that lack an Internet connection. A lowest supported version of the content can be shared from the computing device to one of the peer devices. The lowest supported version of the content determines capabilities of the peer device and establishes a peer-to-peer communication link with the computing device. The peer device reports the capability information to the computing device and, if the computing device determines that the peer device is capable of supporting an upgraded version of the content, the computing device communicates the upgraded version of the content to the peer device.

A method of constructing a plurality of downloadable files from an application file and a plurality of transcripts. The application file stores data blocks and implements an application. Each of the transcripts stores at least one order in which at least a portion of the data blocks of the application file were accessed by the application when executed previously. The transcripts are combined into a combined transcript storing at least one combined order comprising a combined portion of the data blocks. The data blocks of the combined portion are arranged in a data structure having an origin. A first set of data blocks within a predetermined distance from the origin is stored in at least one initial execution file. A second set of data blocks outside the predetermined distance from the origin is stored in downloadable sequence files.

The present disclosure is directed to systems and methods for performing load balancing and message routing by a device intermediary to a plurality of short message peer to peer (SMPP) clients and a plurality of SMPP servers. The device can receive a request from an SMPP client to establish an SMPP session, replace a first sequence identifier in the request with a second sequence identifier generated by the device, and store a mapping of the second sequence identifier to the first sequence identifier. The device can select an SMPP server to forward the request with the second sequence identifier and receive a response from the SMPP server with the second sequence identifier. The device can identify, from the mapping, the first sequence identifier and the connection to the SMPP client using the second sequence identifier to forward the SMPP response with the first sequence identifier.

A first stream operator can receive a first tuple including a first set of attributes to be stored in a first window and a second tuple including a second set of attributes to be stored in a second window. The first window and the second window can each have an eviction policy. In response to triggering the eviction policy for the first window and the second window, the first tuple stored in the first window can be compared with the second tuple stored in the second window. Based upon the comparing, it can be determined that the first tuple and the second tuple go outside of a join threshold. In response to determining that the first tuple and the second tuple go outside of a join threshold, the eviction policy of the first window can be altered.