Abstract: An apparatus includes a computer executable for processing a file of a first file type, and a Hypertext Transfer Protocol (“HTTP”) client that receives files of the first type and a second type from a network. The HTTP client causes the computer executable to process files of the first type. The computer executable includes a first module that determines whether the file includes a first content type and performs a first function if the file includes the first content type. The computer executable also includes a second module that determines whether the file includes a second content type and performs a second function different from the first function if the file includes the second content type.

Abstract: Methods and apparatus for document based ambiguous character resolution. An application searches a document for words that do not contain ambiguous characters and adds them to a dictionary, then searches the document for words that do contain ambiguous characters. For each ambiguous word, a set of candidate solutions is created by resolving the ambiguous characters in all possible ways. The dictionary is searched for words matching members of the candidate solution set. When a single member is matched, the ambiguous characters are resolved accordingly. When no member or more than one member is matched, a user is prompted to resolve the ambiguous characters. Alternatively, when more than one member is matched, the ambiguous characters are resolved to obtain the largest word, the smallest word, the most words, or the fewest words.

Abstract: Methods and apparatus for document based ambiguous character resolution. An application searches a document for words that do not contain ambiguous characters and adds them to a dictionary, then searches the document for words that do contain ambiguous characters. For each ambiguous word, a set of candidate solutions is created by resolving the ambiguous characters in all possible ways. The dictionary is searched for words matching members of the candidate solution set. When a single member is matched, the ambiguous characters are resolved accordingly. When no member or more than one member is matched, a user is prompted to resolve the ambiguous characters. Alternatively, when more than one member is matched, the ambiguous characters are resolved to obtain the largest word, the smallest word, the most words, or the fewest words.

Abstract: A method and computer program product for reflowing a PDL page without using the original application used to create the PDL page. The method and computer program product include receiving a page represented in a page description language, the page including a plurality of page objects, and changing one or both of a size of the page and a size of one or more of the page objects, while maintaining spatial relationships between the page objects.

Abstract: Methods, systems and apparatus, including computer program products, for processing digital data. An approximate storage size is predicted for an output representation that uses variable length encoding. The approximate storage size can be used to determine one or more compression parameters to satisfy a global constraint, such as a maximum storage size for a compressed representation of the digital data. In a user interface, storage sizes can be graphically represented for multiple images. In the graphical representation, the storage size is represented for each image by a corresponding graphics object that includes a visual representation of the image and has a linear size that is proportional to the storage size of that image.

Abstract: Methods, tools, and systems are provided for editing an image in a browser. One method includes presenting an image in a browser, receiving a selection from a user to transform the image and transforming the image in the browser without interaction with the server.

Abstract: Methods, tools, and systems are provided for editing an image in a browser. One method includes presenting an image in a browser, receiving a selection identifying an area of an image to transform and a transformation and transforming the area of the image in the browser without interaction with the server.

Abstract: An apparatus includes a computer executable for processing a file of a first file type, and a Hypertext Transfer Protocol (“HTTP”) client that receives files of the first type and a second type from a network. The HTTP client causes the computer executable to process files of the first type. The computer executable includes a first module that determines whether the file includes a first content type and performs a first function if the file includes the first content type. The computer executable also includes a second module that determines whether the file includes a second content type and performs a second function different from the first function if the file includes the second content type.

Abstract: Methods and apparatus for document based ambiguous character resolution. An application searches a document for words that do not contain ambiguous characters and adds them to a dictionary, then searches the document for words that do contain ambiguous characters. For each ambiguous word, a set of candidate solutions is created by resolving the ambiguous characters in all possible ways. The dictionary is searched for words matching members of the candidate solution set. When a single member is matched, the ambiguous characters are resolved accordingly. When no member or more than one member is matched, a user is prompted to resolve the ambiguous characters. Alternatively, when more than one member is matched, the ambiguous characters are resolved to obtain the largest word, the smallest word, the most words, or the fewest words.

Abstract: Methods and apparatus for creating a license defining permissions to use electronic content. The methods include selecting a plurality of habitat types, each an aspect of a user environment to which a license can be bound, the selection based on input from a retail customer; determining one or more habitat values and relations for each selected type; and creating a license to use the electronic content, the license including an and-or logic expression of habitat terms, each term containing one of the selected types and its set of corresponding values and relations. Each habitat term may include a key for decrypting or unlocking the electronic content.

Abstract: Methods and apparatus for document based ambiguous character resolution. An application searches a document for words that do not contain ambiguous characters and adds them to a dictionary, then searches the document for words that do contain ambiguous characters. For each ambiguous word, a set of candidate solutions is created by resolving the ambiguous characters in all possible ways. The dictionary is searched for words matching members of the candidate solution set. When a single member is matched, the ambiguous characters are resolved accordingly. When no member or more than one member is matched, a user is prompted to resolve the ambiguous characters. Alternatively, when more than one member is matched, the ambiguous characters are resolved to obtain the largest word, the smallest word, the most words, or the fewest words.

Abstract: Methods and apparatus implementing a technique for retrieving requested data. In general, in one aspect, the technique includes receiving a request from an application to read a portion of an application file and consulting a filter-system file. The filter-system file contains processed data that corresponds to data in the application file and correspondence information indicating how the set of processed data corresponds to the data in the application file. The technique also includes deriving the requested portion of the application file from the processed data using the correspondence information, and delivering the requested portion of the application file to the application.

Abstract: A method and computer program product for reflowing a PDL page without using the original application used to create the PDL page. The method and computer program product include receive a page represented in a page description language, the page including a plurality of page objects, and changing one or both of a size of the page and a size of one or more of the page objects, while maintaining spatial relationships between the page objects.

Abstract: Methods and apparatus, including computer program products, for printing an electronic document. In one aspect, a method includes receiving an electronic document and usage rights, the usage rights permitting uses of the document including a low-fidelity print use; rendering the document in response to a print request by creating a low-fidelity bitmap for each page of the document in accordance with the usage rights; and printing the low-fidelity bitmaps to an output device, whereby the print output is a low fidelity rendering of the document. Particular embodiments can include one or more of the following features. The document is rendered at a pre-determined resolution specified in the usage rights. The pre-determined resolution is lower than a minimum required by an optical character recognition (OCR) system. The document is rendered at a pre-determined color fidelity specified in the usage rights. The pre-determined color fidelity is a 2-bit grayscale.

Abstract: Methods and apparatus, including computer program apparatus and a system, for providing a trusted time. A first local time from a computer is sent to a trusted server. Trusted time data protected by encryption or a digital signature is received from the trusted server. The invention stores the trusted time data on the computer and checks the validity of the trusted time data. The trusted time data is used on the computer to compute a trusted time corresponding to a local time.

Abstract: Methods and apparatus implementing a technique for processing handwritten marks made on a machine-readable tablet. The technique includes providing multiple regions for input on the tablet; receiving from a user handwritten marks made in a current region of the plurality of regions; receiving from the user an indication that the current region is complete and thereupon selecting a different one of the plurality of regions as the current region in which to receive handwritten marks made by the user, whereby marks are received in a sequence of at least two regions; and representing the handwritten input as the aggregate of the marks written in the sequence of regions in a writing direction, the marks in different input regions having positions with respect to each other defined by a logical concatenation of the regions on the sequence of regions. The input can be arbitrarily-long markings of any kind.

Abstract: A compiler-loader system enables the creation of different loaded executable images in target computers complying with different versions of an instruction-set architecture, the different images being created from a single executable program on secondary storage. The compiler generates an executable program containing a routine executable on both versions of the target computers, and also containing an architecture entry with (i) an address of the program location from which the routine is called, (ii) an instruction executable on only one version of the target computers that performs the same function as the routine but with superior performance, and (iii) a value indicating which version of the target machines the instruction can be executed on. The loader determines whether the target machine can execute the instruction, and if so replaces the subroutine call appearing at the address in the architecture entry with the instruction appearing in the architecture entry.

Abstract: In a computerized method, performance data collected while a computer system executed instructions of a program are analyzed. The method collects performance data while executing the program. The performance data includes sample counts of instructions executed. The program is analyzed to determine classes of instructions. Instructions of the same equivalence class all execute the identical number of times. The execution frequencies for each instructions of each equivalence class is estimated. The estimated execution frequencies can then be used to determine the average number of cycles required to issue each instruction of each equivalence class. The average number of cycles can be compared with the minimum number of cycles to determine the number of dynamic stall cycles incurred by the instructions. Furthermore, reasons for the dynamic stall cycles can be inferred.

Abstract: A compiler-loader system enables the creation of different loaded executable images in target computers complying with different versions of an instruction-set architecture, the different images being created from a single executable program on secondary storage. The compiler generates an executable program containing a routine executable on both versions of the target computers, and also containing an architecture entry with (i) an address of the program location from which the routine is called, (ii) an instruction executable on only one version of the target computers that performs the same function as the routine but with superior performance, and (iii) a value indicating which version of the target machines the instruction can be executed on. The loader determines whether the target machine can execute the instruction, and if so replaces the subroutine call appearing at the address in the architecture entry with the instruction appearing in the architecture entry.

Abstract: In a computerized method, performance data collected while a computer system executed instructions of a program are analyzed. The method collects performance data while executing the program. The performance data includes sample counts of instructions executed. The program is analyzed to determine classes of instructions. Instructions of the same equivalence class all execute the identical number of times. The execution frequencies for each instructions of each equivalence class is estimated. The estimated execution frequencies can then be used to determine the average number of cycles required to issue each instruction of each equivalence class. The average number of cycles can be compared with the minimum number of cycles to determine the number of dynamic stall cycles incurred by the instructions. Furthermore, reasons for the dynamic stall cycles can be inferred.