International Business Machines Corporation

John Joseph Turek

Larry Bert Brenner

Marc Adam Kaplan

John Arthur Pershing, Jr

Peter Richard Badovinatz

Tushar Deepak Chandra

Orvalle Theodore Kirby

Ajei Sarat Gopal

Marion Lee Blount

Vittorio R Castelli

Philip Shilung Yu

Joel Leonard Wolf

David Benson Rhoades

John Timothy Robinson

Ming-Syan Chen

Keith C Houck

Ioannis Kontoyiannis

Howard J Locker

Philip Shi-lung Yu

Chung-Sheng Li

Yong Sen Zheng

Lawrence David Bergman

Brian Jay Vetter

Hui Su

Tessa Ann Lau

Hong Nie

Wei Ying Yu

Tian Shu Wang

Dennis Duane Jurgensen

W Nathaniel Mills, Iii

Mark M Maccabee

Jian Gui

A method is provided for automatically applying named styles to existing documents including word processing documents. The existing document is scanned and parsed into style regions of uniform style. The style attributes of each uniform style region are identified, and these identified style attributes are used to create style groups containing style regions having identical or substantially identical style attributes. These style attributes can be expressed in set or vector form. Named styles are then associated with the identified style group by either comparing the style attributes of a given style group to the attributes of a pre-defined named style or by extracting a named style from the style group. Once associated with a named style, the style regions within a given style group can be modified to be consistent with the named style associated with the style group. In addition, subsequent changes to the style attributes in a given style region are made by changing the attributes of the named style associated with the style group containing that style region.

System and method for automatic stylesheet inference

A method and system for decompressing a compressed file is disclosed in this invention, the method comprising: reading a compressed data block from the compressed file; decompressing the compressed data block; outputting the decompressed data for storage into a decompressed file; deleting the compressed data block that was decompressed from the compressed file. The proposed method and system in this invention can reduce the unnecessary repeated data between compressed data and decompressed data. The storage space requirement will be reduced during decompression, and the existing compression/decompression algorithms need not be changed by using this invention. Thus, this invention is easy to be integrated into existing compression/decompression tools.

Method and system for reducing required storage during decompression of a compressed file

Data representing, for instance, an image is lossily encoded, and a residual of the data is losslessly encoded. The lossily encoded data and the losslessly encoded residual provide a losslessly compressed data representation of the original data. The losslessly compressed data is then organized and stored on a storage system according to one or more criteria selected for the particular losslessly encoded data to be organized. This enables the efficient retrieval and processing of the compressed data, including retrieval of portions of the compressed data.

Multiresolution lossless/lossy compression and storage of data for

A communications facility for interactive communications with local applications. The flow of information to local applications is coordinated using a browser. The browser determines, at any given time, which of a plurality of communication paths is to be used to provide the information to the local application. The local application commences a polling loop, which enables messages to be received at the local application via the plurality of communication paths, without terminating the local application. Thus, the local application can have interactive communications with the browser and/or one or more remote servers.

Controlling communications with local applications using a browser

A method, computer program product and a program storage device embodying software for measuring of the response time of an application (including distributed applications in a client/server or Internet environment) as perceived by an end-user. One aspect deals with the measurement of components of the response time and relating those components to user response time. In addition, the components of one transaction can be matched (or correlated) to each other even though they are measured on different systems. The generation of events and transactions can be controlled, allowing their creation to occur as close to their point of origin as practical. Both aggregate and detail reporting facilities provide overall performance and availability information as well as exceptions and/or detail transactions including the decomposition of overall availability and performance metrics into smaller measurements representing the contribution made by select transaction components. An interactive reporting facility enables the selection of a level of transaction decomposition desired. This enables the identification of the transaction components that are introducing delays or faults. The system is extensible, enabling the addition of components to the system that extend its measurement and reporting capabilities. In particular, a language has been created to facilitate the definition of the end-to-end business application transactions. Also, select APIs as well as application data structures allow the addition of software and/or hardware modules to extend the system. The system can also adapt to the presence or absence of select streams of events without having to change its mode of operation. Measurement sources that generate events can be dynamically activated and deactivated.

Application end-to-end response time measurement and decomposition

A barrier synchronization system in a distributed computing environment. A group of members, including a plurality of related processes executing on one or more processors of the distributed computing environment, is provided a protocol having a dynamic number of synchronization phases. The protocol is voted on by one or more members of the group to determine how the protocol should proceed for the group of members. The protocol may complete successfully, continue to another synchronization phase or be rejected. The group of members determines how many synchronization phases the protocol is to include.

System for barrier synchronization wherein members dynamic voting

An application programming interface that unifies a plurality of mechanisms into a single framework. The interface includes a mechanism for communicating between members of a process group of related processes, and a mechanism for synchronizing the related processes of the process group. Additionally, the application programming interface may include mechanisms for managing membership of the process group or a processor group of processors, and/or a mechanism for controlling a group state value for the process group.

Application programming interface unifying multiple mechanisms

A method of identifying quality-of-service problems associated with a given Web server in a computer network. The Web server includes a Web page having a token declaring that quality-of-service information is to be collected. When the Web page is received at a Web client having the capability to collect the information, an indication is provided to the Web client user that the information is being collected. The collected quality-of-service information is then uploaded, preferably without any information identifying the user, either to the Web server that served the page or to a management server.

Internet quality-of-service method and system

A barrier synchronization program product in a distributed computing environment. A group of members, including a plurality of related processes executing on one or more processors of the distributed computing environment, is provided a protocol having a dynamic number of synchronization phases. The protocol is voted on by one or more members of the group to determine how the protocol should proceed for the group of members. The protocol may complete successfully, continue to another synchronization phase or be rejected. The group of members determines how many synchronization phases the protocol is to include.

Program product to effect barrier synchronization in a distributed

Apparatus for configuring a computer system is adapted to allow configuration to occur on the system unit without removing the system unit from its packaging. By so preparing and operating the unit that it can function to a degree as a network client, it is possible to perform steps for configuring 'in the package' that violate normal self test expectations. With this abnormal operating environment and operation the system is placed in condition to be removed from the packaging at the user's location with BIOS and program image customized for the user. This approach provides a freshly configured system and yet eliminates unpacking at a configuration center and then repacking for transfer to the user or the need for refresh configuration at the user site as the system unit is set up for normal use.

In-box configuration apparatus for a computer system

A method and apparatus for configuring a computer system is adapted to allow configuration to occur on the system unit without removing the system unit from its packaging. By so preparing and operating the unit that it can function to a degree as a network client, it is possible to perform steps for configuring 'in the package' that violate normal self test expectations. With this abnormal operating environment and operation the system is placed in condition to be removed from the packaging at the user's location with BIOS and program image customized for the user. This approach provides a freshly configured system and yet eliminates unpacking at a configuration center and then repacking for transfer to the user or the need for refresh configuration at the user site as the system unit is set up for normal use.

In-box configuration method for a computer system

A barrier synchronization technique in a distributed computing environment. A group of members, including a plurality of related processes executing on one or more processors of the distributed computing environment, is provided a protocol having a dynamic number of synchronization phases. The protocol is voted on by one or more members of the group to determine how the protocol should proceed for the group of members. The protocol may complete successfully, continue to another synchronization phase or be rejected. The group of members determines how many synchronization phases the protocol is to include.

Barrier synchronization method wherein members dynamic voting controls

A method of performing a parallel join operation on a pair of relations R1 and R2 in a system containing P processors organized into Q clusters of P/Q processors each. The system contains disk storage for each cluster, shared by the processors of that cluster, together with a shared intermediate memory (SIM) accessible by all processors. The relations R1 and R2 to be joined are first sorted on the join column. The underlying domain of the join column is then partitioned into P ranges of equal size. Each range is further divided into M subranges of progressively decreasing size to create MP tasks T.sub.m,p, the subranges of a given range being so sized relative to one another that the estimated completion time for task T.sub.m,p is a predetermined fraction that of task T.sub.m-1,p. Tasks T.sub.m,p with larger time estimates are assigned (and the corresponding tuples shipped) to the cluster to which processor p belongs, while tasks with smaller time estimates are assigned to the SIM, which is regarded as a universal cluster (cluster 0). The actual task-to-processor assignments are determined dynamically during the join phase in accordance with the dynamic longest processing time first (DLPT) algorithm. Each processor within a cluster picks its next task at any given decision point to be the one with the largest time estimate which is owned by that cluster or by cluster 0.

Method of performing a parallel relational database query in a

A method and apparatus for minimizing the time required to obtain results for a content based query in a data base. More specifically, with this invention, the data base is partitioned into a plurality of groups. Then, a schedule or sequence of groups is assigned to each of the operations of the query, where the schedule represents the order in which an operation of the query will be applied to the groups in the schedule. Each schedule is arranged so that each application of the operation operates on the group which will yield intermediate results that are closest to final results.

Growing community of inventors

South Nyack, NY, United States of America

John Joseph Turek