Patents by Inventor Tobin J. Lehman
Tobin J. Lehman has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 10083229Abstract: 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.Type: GrantFiled: October 9, 2009Date of Patent: September 25, 2018Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Greg Eyres, Vahit Hakan Hacigumus, Tobin J. Lehman, H. Raymond Strong, Jr.
-
Patent number: 10068285Abstract: 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.Type: GrantFiled: April 24, 2013Date of Patent: September 4, 2018Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Melissa Cefkin, Tobin J. Lehman, Yolanda A. Rankin, H. Raymond Strong, Jr.
-
Patent number: 9998140Abstract: 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.Type: GrantFiled: April 22, 2013Date of Patent: June 12, 2018Assignee: International Business Machines CorporationInventors: Tobin J. Lehman, Mario H. Lichtsinn, Hovey R. Strong, Jr.
-
Publication number: 20140324617Abstract: 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.Type: ApplicationFiled: April 24, 2013Publication date: October 30, 2014Applicant: International Business Machines CorporationInventors: Melissa Cefkin, Tobin J. Lehman, Yolanda A. Rankin, H. Raymond Strong, JR.
-
Publication number: 20140317161Abstract: 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.Type: ApplicationFiled: April 22, 2013Publication date: October 23, 2014Applicant: International Business Machines CorporationInventors: Tobin J. Lehman, Mario H. Lichtsinn, Hovey R. Strong, JR.
-
Publication number: 20120029974Abstract: A deal management system is used to manage a complex service deal that defines various services to be fulfilled on behalf of a client. The deal management system includes a deal specification subsystem, a cost subsystem, and an estimation subsystem. The deal specification subsystem has a new deal interface to facilitate user specification of the complex service deal, including a plurality of service elements scheduled for fulfillment from a plurality of service delivery centers. The cost subsystem tracks an aggregate cost of a service delivery center that is arranged to fulfill a particular service element. The estimation subsystem dynamically evaluates accuracy of a deal cost model for the complex service deal during a duration of the particular service element by establishing a correlation between particular service elements within the complex service deal and portions of the aggregate cost data allocated to the corresponding service delivery center.Type: ApplicationFiled: July 30, 2010Publication date: February 2, 2012Applicant: International Business Machines CorporationInventors: Isaac G. Councill, Shun Jiang, Tobin J. Lehman, James J. Rhodes, Hovey Raymond Strong, JR., Ruoyi Zhou
-
Patent number: 8090762Abstract: 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.Type: GrantFiled: January 10, 2006Date of Patent: January 3, 2012Assignee: International Business Machines CorporationInventors: Robert G. Deen, James H. Kaufman, Tobin J. Lehman
-
Patent number: 7953816Abstract: 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.Type: GrantFiled: January 10, 2006Date of Patent: May 31, 2011Assignee: International Business Machines CorporationInventors: Robert G. Deen, James H. Kaufman, Tobin J. Lehman
-
Publication number: 20110087701Abstract: 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.Type: ApplicationFiled: October 9, 2009Publication date: April 14, 2011Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Greg Eyres, Vahit Hakan Hacigumus, Tobin J. Lehman, H. Raymond Strong, JR.
-
Patent number: 7702784Abstract: 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.Type: GrantFiled: July 14, 2008Date of Patent: April 20, 2010Assignee: International Business Machines CorporationInventors: Viktors Berstis, John Daniel Sieron Bethencourt, Kevin Blake Damm, Robert Glenn Deen, Matthew Hammer, James H. Kaufman, Tobin J. Lehman
-
Publication number: 20080270605Abstract: 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.Type: ApplicationFiled: July 14, 2008Publication date: October 30, 2008Inventors: Viktors Berstis, John Daniel Sieron Bethencourt, Kevin Blake Damm, Robert Glenn Deen, Matthew Hammer, James H. Kaufman, Tobin J. Lehman
-
Patent number: 6658437Abstract: 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.Type: GrantFiled: June 5, 2000Date of Patent: December 2, 2003Assignee: International Business Machines CorporationInventor: Tobin J. Lehman
-
Patent number: 6292186Abstract: A universal information appliance (UIA) such as can be embodied by a personal digital assistant (PDA) can receive an application written in a new “MoDAL” 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 “TSpaces”.Type: GrantFiled: November 6, 1998Date of Patent: September 18, 2001Assignee: International Business Machines CorporationInventors: Tobin J. Lehman, Kevin Francis Eustice, Armando Gil Morales
-
Patent number: 5566329Abstract: A relational data base management system that stores and retrieves large data objects (LOBs) from data base storage to evaluate assignment statements includes a data manager that mutates selected string operations into equivalent functions on a LOB operand that can be left in the data base, thereby eliminating the associated storage access operations. When the data manager receives an assignment statement containing one or more LOBs, the data manager first checks to determine if the statement can be mutated. If the statement can be mutated, then the mutation is performed. The mutated statement is then processed according to a conventional deleted evaluation scheme. If the assignment statement cannot be mutated, then the statement is evaluated according to a conventional deleted evaluation scheme.Type: GrantFiled: February 10, 1995Date of Patent: October 15, 1996Assignee: International Business Machines CorporationInventors: Patrick J. Gainer, Peter P. Gassner, Tobin J. Lehman