International Business Machines Corporation

Tobin Jon Lehman

James Harvey Kaufman

Robert Glenn Deen

Daniel Alexander Ford

Viktors Berstis

Qi Lu

Matthew Hammer

H Raymond Strong, Jr

John Daniel Sieron Bethencourt

Kevin Blake Damm

Udi Manber

Vahit Hakan Hacigumus

Hovey R Strong, Jr

Matthias Eichstaedt

Joann Ruvolo

Stefan Bengt Edlund

Melissa Cefkin

Shang-Hua Teng

Ron Yair Pinter

Mario H Lichtsinn

Yolanda A Rankin

Kevin Francis Eustice

Armando Gil Morales

Peter P Gassner

Patrick J Gainer

Stephen McLaughry

Greg Eyres

A computer-implemented method for pairing a new document to a document from a plurality of documents. Embodiments include, for each of the new document and the plurality of documents, generating a vector of terms of interest uniquely associated with a document of the new document and the plurality of documents. For each term of interest, an associated element value of the vector is assigned as zero if the term of interest does not occur in the document and one otherwise. The method also includes, for each document from the plurality of documents, determining a similarity between the vectors. The method also includes selecting a document from the plurality of documents as related to the new document if the similarity between the vector for the new document and the vector for the document from the plurality of documents is greater than or equal to a threshold value.

System, method, and apparatus for pairing a short document to another short document from a plurality of short documents

Embodiments relate to multi-dimensional surface-based bid matching. An aspect includes receiving a bid from a first user, the bid comprising a plurality of ranges, wherein each range of the plurality of ranges corresponds to a respective dimension of a plurality of dimensions. Another aspect includes determining a first bid surface in the plurality of dimensions based on the plurality of ranges of the bid of the first user. Another aspect includes modifying the first bid surface based on a match to the bid of the first user, the match comprising a point on a second bid surface corresponding to a bid from a second user. Another aspect includes wherein, if the first user comprises a work requester, the second user comprises a work producer, and if the first user comprises a work producer, the second user comprises a work requester.

Multi-dimensional surface-based bid matching

Methods and arrangements for providing a compressed representation of a number sequence. An input number sequence is received, as is a stored number sequence. The input number sequence is compared to the stored number sequence. The comparing includes determining a set of coefficients corresponding to the input number sequence, via solving at least one algebraic equation, the at least one algebraic equation comprising at least one of: an arithmetic equation, and an exponential equation. The comparing further includes applying at least one test to determine whether the set of coefficients identifies at least a portion of the stored number sequence as matching the entire input number sequence.

Matching pattern combinations via fast array comparison

The initial partitioning of a distributed computing problem can be critical, and is often a source of tedium for the user. A method is provided that automatically segments the problem into fixed sized collections of original program cells (OPCs) based on the complexity of the problem specified, and the combination of computing agents of various caliber available for the overall job. The OPCs that are on the edge of a collection can communicate with OPCs on the edges of neighboring collections, and are indexed separately from OPCs that are within the 'core' or inner non-edge portion of a collection. Consequently, core OPCs can iterate independently of whether any communication occurs between collections and groups of collections (VPPs). All OPCs on an edge have common dependencies on remote information (i.e., their neighbors are all on the same edge of a neighboring collection).

System and method for automatically segmenting and populating a distributed computing problem

The system and method of the present invention provide for automatic on-demand replication in a replication cluster of content management servers. A replication manager of a content management server receives newly created, modified, and deleted application item types along with their associated physical tables and automatically forwards the received application item types on-demand to the replication managers of other content management servers of the replication cluster.

On-demand replication in a content management system

Embodiments herein present a system, method, etc. for an efficient super cluster implementation for solving connected problems in a distributed environment. More specifically, the system adapts computing latency to communication latency, wherein the system comprises VPPs wrapped within OCW layers. The VPPs represent a subset of an overall computer task; and, the OCW layers are adapted to enclose the VPPs. Specifically, the number of OCWs that enclose a VPP correspond to the number of computing iterations that may be locally executed by the VPP during an inter-VPP communication cycle. In addition, each VPP comprises collections of OPCs, wherein the OPCs comprise data, methods, and pointers to neighbors. The OPCs are indexed separately based on whether the OPC is part of an OCW layer.

Efficient super cluster implementation for solving connected problems in a distributed environment

The disclosed massive multi-player on-line gaming environment and method eliminate the coordination and synchronization problems between servers by assigning each game user to a specific client proxy server for game duration and utilizing a space information distribution center to indicate client specific changes in game space. Such configuration eliminates the need to use 'grey' areas around partitioning boundaries and servers having to 'own' client objects thereby improving massive multi-player on-line gaming scalability.

Handling of players and objects in massive multi-player on-line games

A message pathway selection system dynamically selects an optimum message pathway for transmitting messages. The system dynamically optimizes a message pathway according to various criteria such as, for example, efficiency, economy, data requirements, auditing requirements, security, data size, etc. The system can direct a message to bypass an infrastructure messaging server, using a direct message pathway. The system can also switch from an infrastructure messaging server to a direct method. The system can also utilize an infrastructure messaging pathway either as an alternative or in parallel with the direct message pathway. The system allows an application to use a single communication system for both a direct mode and an infrastructure mode of data transfer. The present system can bypass the infrastructure message pathway, thus reducing message latency, number of messages sent, and improving overall bandwidth.

System, method, and service for dynamically selecting an optimum message pathway

Embodiments herein present a virtual memory technique for efficiently solving connected problems in a distributed environment. An exemplary method begins by selectively loading computing task segments into a first node, wherein the number of computing task segments is the maximum number of computing task segments that will fit within the first node. The computing task segments are enclosed within wrappers, wherein the wrappers are streamed into the first node at a maximum rate that a disk can read and write data. Further, the wrappers comprise priority wrappers that must be computed in order to process the computing task segments; and thus, the priority wrappers are loaded into the first node first. In addition, the computing task segments comprise computing task segment block collections, wherein the method creates a list of computing task segment block collection jobs that must be completed in order to process one of the computing task segments.

Virtual memory technique for efficiently solving connected problems in a distributed environment

A method and system for balancing server work load for cellular phone client-proxy applications in an environment where the clients change position within a given geographic area is disclosed. The method comprises the steps of mapping, monitoring, automatically re-mapping the system when required, updating a map address book, and updating a client address book. The system has a mapping system and a communication system connected to a plurality of servers, proxy servers and applications by an internal network. The proxy servers are connected to a plurality of clients by the Internet. If a threshold is exceeded, the monitoring program sends a message to a mapping program. Upon receipt of the message, the mapping program uses a rules engine to calculate a new map graph to remove load from an overloaded server (or servers) and to adjust communication requirements for data by reconfiguring partitions.

Distributing and geographically load balancing location aware communication device client-proxy applications

A distributed parallel computing system actively takes advantage of problem partitioning to balance the computing load among computing resources continually during processing. Variable problem partitions (VPPs) are initially defined as groups of original problem cells (OPCs). VPPs may be redefined and redistributed during execution, if necessary, to optimize performance based on the actual computing agent parameters and costs observed or reported through self-tests. For example, a good rule for efficient execution of a computing problem may be that the time required to perform a computation sequence (iteration) of all OPCs in a VPP should be comparable to the time required to share results via edge OPCs at the VPP collection perimeters. The rules that yield cost-efficient execution may be saved and re-used to generate initial partitionings for subsequent computing problem execution runs.

System and method for balancing a computing load among computing resources in a distributed computing problem

A method is described for automatically segmenting and populating a distributed problem, including determining a bounding space that is at least equal in size to a problem space volume, partitioning the bounding space into a plurality of sub-spaces capable of holding collections of original problem cells, mapping the distributed problem into the partitioned bounding space to populate the sub-spaces with data from the problem, and determining boundaries between the sub-spaces. The method further includes determining coupling interdependencies between sub-spaces, determining complexities associated with boundaries, calculating densities of the data from the problem, and if the densities of two or more contiguous collections fall below a lower level threshold, dynamically joining the two or more contiguous collections, if a particular collection density exceeds an upper threshold, dynamically subdividing the particular collection into a finer granularity, and processing the problem based on the boundaries, the coupling interdependencies, the complexities, and the densities.

Automatically segmenting and populating a distributed computing problem

A database management system that stores and retrieves large data objects (LOBs) from a database storage of a computer system storage device containing a LOB data space having LOB data values of a database. The space management system permits a user of the computer system to generate requests for access to LOBs of a database and includes a plurality of allocation units for storing data. Each allocation unit has an address, and the allocation units are grouped into a plurality of blocks, each block including at least two allocation units. The space management system includes first and second types of space allocation maps. Each of these two types of space allocation maps has a predetermined number of bits. The first type space allocation map represents blocks of allocation units below a predetermined size, and each bit in the first type space allocation map represents the allocation status of a corresponding one of the allocation units at a particular address. The space allocation map of the second type represents blocks of allocation units equal to, or greater than, the predetermined size. The entire second type space allocation map represents the status and size of a single block of allocation units. The space management system also includes a controller unit for interpreting the space allocation map and for executing requests to store information in said allocation units.

System and method for data space allocation using optimized bit representation

An &ldquo;active&rdquo; calendar automatically analyzes a user's calendar entries and sends machine-readable messages to destinations appropriate to content of the calendar entry. A group of event categories is established, each category specifying one class of anticipated calendar entry. An action rule database pre-associates each event category with one or more message formats each having a content and a destination. The action rule database also contains data identifying sources containing the content and destination for each message format. These sources include records of the action rule database itself, subparts of calendar entries of the pre-associated event category, one or more other databases, or a combination of the foregoing. After the calendar receives a user-submitted computer calendar entry describing a planned event, it identifies one of the event categories of the established group that classifies the planned event. For each message format pre-associated with the identified event category, the calendar determines the content and destination for the message as specified by the action rule database, and transmits the message to the destination.

Active calendar system

A universal information appliance (UIA) such as can be embodied by a personal digital assistant (PDA) can receive an application written in a new &ldquo;MoDAL&rdquo; language, parse the application to divide it into binary-formatted GUI elements, and then dynamically render a GUI interface on the display of the UIA based on the GUI elements parsed out of the application. The user can further modify the GUI and save it. With this combination, a GUI can be easily and dynamically tailored for a wide range of user needs, including the needs of handicapped users. The UIA communicates data in an onboard data cache with globally shared, associatively addressed memory spaces such as &ldquo;TSpaces&rdquo;.

Growing community of inventors

Cupertino, CA, United States of America

Tobin Jon Lehman