Google Inc.

International Business Machines Corporation

David J Kuettel

Raphael L Levien

Howard Justin Glaser

John Conrad Sanchez

Stewart Earle Nickolas

William Mitchell Edwards

Philip Theodore Berkland

Brian Stell

Sreedhar Reddy Arda

A compressed font file including compressed data is received. The compressed data is decompressed to generate decompressed data. An attempt to validate the decompressed data is made. Within the decompressed data, a predetermined pattern of invalid data corresponding to an element of a font file is detected. The font file is reconstructed by replacing at least some of the invalid data with the element.

System and method of compressing data in font files

A computer-implemented method technique can intercept, at a server including one or more processors, a first request for a source document representing a web page, the first request being transmitted from a computing device to a web server. The first request can include web browser information indicating web browser software executing on the computing device. The technique can intercept the source document being transmitted from the web server to the computing device in response to the first request. The source document can specify one or more fonts in which to display text in the source document. The technique can generate the web page, determine unique characters displayed at the web page, and obtain one or more font subsets. The technique can then transmit information to the computing device based on whether the web browser software is capable of displaying a font family having a plurality of fonts.

Techniques for analyzing web pages to determine font subsets

A request for a font file including a first font table and a second font table is received. A first entropy encoder is selected, based on characteristics of the first font table, front among a plurality of entropy encoders. A second entropy encoder is selected, based on characteristics of the second font table, front among the plurality of entropy encoders. The first entropy encoder is applied to the first font table. The second entropy encoder is applied to the second font table. Compressed data corresponding to the first and second font tables are combined to generate a compressed font file. The compressed font file is transmitted.

System and method of font compression using selectable entropy encoding

A method, apparatus, and article of manufacture for combining existing objects is disclosed. The method comprises the steps of accepting a selection of existing objects to combine, retrieving the methods and attributes of the selected objects, applying a composition rule to the retrieved methods and attributes to define combined methods and attributes, and storing references to the combined methods and attributes to the composite object. The present invention also comprises an article of manufacture, tangibly embodying a series of instructions for performing the above steps. The apparatus comprises a processor for selecting existing objects and for applying a composition rule to the retrieved objects and methods and an I/O device for retrieving the methods an attributes for the selected objects and for storing references to the combined methods and attributes.

Method for defining composed object methods and attributes by dynamically presenting composite values and options

An apparatus and method of mapping a file name to a computer system in a network of computer systems are provided. In a first embodiment, a list of names of the computer systems starting with a root name is created. The filename itself starts with a root name and consists of an aggregation of names. When the filename is obtained, each name is matched one at a time and in the order of appearance to the names in the list. In order for a match, the order of appearance of the names in the list of names and that of the names in the filename must be the same. The last name in the list of names to be matched with a name in the filename represents a computer system within which the file is contained. In a second embodiment, the list of names is in the form of a tree of names. Matching the names of the tree to the names in the filename includes traversing a branch of that tree to a leaf node, the leaf node being the last node in the tree.

Growing community of inventors

San Jose, CA, United States of America

David J Kuettel