Abstract:
A durable holographically imaged paper, plastic film or other product is produced by embossing the image into a thermoplastic coating thereon which comprises plastic pigment particles. The plastic pigment particles are preferably hollow but may be solid. The coating preferably also comprises a thermoplastic polymer or copolymer, for example a copolymer of vinyl acetate and versatic acid, an acrylic polymer, a styrene-acrylic or other acrylic copolymer, a vinyl chloride-vinyl acetate-ethylene terpolymer, a polyvinyl acetate or a polyvinyl alcohol. Preferably, the polymer or copolymer has a glass transition temperature (Tg value) in the range 20° C. to 110° C. The thermoplastic coating may also contain inorganic pigments, for example precipitated calcium carbonate (PCC), ground natural calcium carbonate, or kaolin or other clays, and/or a starch binder. Embossing is preferably carried out directly on the thermoplastic coating by means of a holographically engraved shim.
Abstract:
A block-request streaming system provides for improvements in the user experience and bandwidth efficiency of such systems, typically using an ingestion system that generates data in a form to be served by a conventional file server (HTTP, FTP, or the like), wherein the ingestion system intakes content and prepares it as files or data elements to be served by the file server. A client device can be adapted to take advantage of the ingestion process. The client device might be configured to optimize use of resources, given the information available to it from the ingestion system. This may include configurations to determine the sequence, timing and construction of block requests based on monitoring buffer size and rate of change of buffer size, use of variable sized requests, mapping of block requests to underlying transport connections, flexible pipelining of requests, and/or use of whole file requests based on statistical considerations.
Abstract:
In one example, a device for receiving information for multimedia data, the device comprising one or more processors configured to analyze at least a portion of a manifest file for multimedia content, wherein the portion of the manifest file includes information indicative of sets of representations of the multimedia content and information indicative of common characteristics for each of the sets of representations, select one of the sets of representations based on the common characteristics for the one of the sets of representations, select one of the representations of the selected one of the sets of representations based on one or more coding characteristics of the one of the representations of the one of the sets, and generate a request for data of the one of the representations based on the selection.
Abstract:
A method of encoding data for transmission from a source to a destination over a communications channel is provided. The method operates on an ordered set of input symbols and includes generating a plurality of redundant symbols from the input symbols based on linear constraints. The method also includes generating a plurality of output symbols from a combined set of symbols including the input symbols and the redundant symbols based on linear combinations, wherein at least one of the linear constraints or combinations is over a first finite field and at least one other of the linear constraints or combinations is over a different second finite field, and such that the ordered set of input symbols can be regenerated to a desired degree of accuracy from any predetermined number of the output symbols.
Abstract:
Framing techniques for an improved radio link protocol used in a wireless communication system, such as EV-DO. In one embodiment scheduling of the generation of repair symbols encoded to be transmitted along with source data is described. In another embodiment acknowledgment messages from a receiver are used to control the trailing edge of the protection window offered by the repair symbols. In another embodiment, non-acknowledgment messages from a receiver are used to control the generation of extra repair symbols. In another embodiment, a length field is used to avoid transmission of padding bytes over the air. In yet another embodiment, a symbol auxiliary field is appended to source symbols to indicate the padding bytes needed for symbol aligning thus avoiding the transmission of padding bytes over the air.
Abstract:
Combining parallel Hypertext Transfer Protocol (HTTP) connections and pipelining overcomes an impact of increasing Round Trip Time (RTT) by varying in real time the number of parallel connections and pipelined requests such that the number of outstanding requests is minimal and the link remains fully utilized. Optimal construction and scheduling of requests and connections in an HTTP stack improves page load time and also provides for greater responsiveness to changes in object priorities. Multi-homing and mobility at the application layer for HTTP are addressed. Multi-homing provides for simultaneous use of multiple interfaces, for example WWAN and WLAN interfaces which improves download time, especially in the case that the available bandwidth the interfaces is of the same order of magnitude. Mobility provides for switching connections as the device moves. In combination they provide for smoother mobility. Mobility can be provided this way without server or network support.
Abstract:
A method of mapping m individual objects to source symbols for delivering data from a transmitter to a receiver in a communication system, the m individual objects ordered from object 1 to object m, wherein m>1, includes: aggregating the m individual objects into an aggregate object, including for each individual object j, calculating a number of source symbols S(j) for containing data of the individual object j; and partitioning the aggregate object into Z source blocks, including for each source block k and each individual object j, calculating a number of source symbols NSS(j, k) of individual object j in source block k, wherein the S(j) source symbols for each individual object j are arranged consecutively within consecutive source blocks, starting from a first source block for which NSS(j, k)>0 to a last source block for which NSS(j, k)>0.