Patents by Inventor Hovey Raymond Strong

Hovey Raymond Strong 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).

  • Publication number: 20120198028
    Abstract: A computer program product, including a computer readable storage medium to store a computer readable program, wherein the computer readable program, when executed by a processor within a computer, causes the computer to perform operations for moving data stored on a transactional semantic independent persister in a distributed environment. The operations include: receiving an indicator to move data stored by the persister at a first node of the distributed environment to a second node of the distributed environment, wherein the data corresponds to a source; and cloning the persister at the first node to a cloned persister at the second node in response to receiving the indicator, wherein the cloning includes: moving data stored by the persister at the first node to the cloned persister; and moving remaining data in a data stream between the source and the persister at the first node to the cloned persister.
    Type: Application
    Filed: January 27, 2011
    Publication date: August 2, 2012
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Mario H. Lichtsinn, Hovey Raymond Strong, JR.
  • Publication number: 20120054247
    Abstract: A method, system, and article for automated processing of a data stream are provided. Stream processing is applied to a hierarchical self describing data stream. As the data stream is processed, some elements therein are associated with a selected path expression. The selected path expressions are ordered based upon the hierarchy, and a tree structure is created that corresponds to the hierarchy. Each leaf node of the tree is associated with a logical operator or an expression to be applied to data processed from the data stream to the leaf node.
    Type: Application
    Filed: August 27, 2010
    Publication date: March 1, 2012
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Shun Jiang, Kenneth M. Johns, James J. Rhodes, Hovey Raymond Strong, JR.
  • Publication number: 20120030218
    Abstract: A method, system, and article for improving performance of a Boolean combination of at least two filters to a data stream. Stream processing is applied to an expression having to or more logical operators. As the data stream is processed, efficiency of the operators in the expression is evaluated. A sort algorithm is dynamically invoked to ensure that a more efficient operator precedes processing of a less efficient operator.
    Type: Application
    Filed: July 28, 2010
    Publication date: February 2, 2012
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Shun Jiang, Kenneth M. Johns, James J. Rhodes, Hovey Raymond Strong, JR.
  • Publication number: 20120029974
    Abstract: 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: Application
    Filed: July 30, 2010
    Publication date: February 2, 2012
    Applicant: International Business Machines Corporation
    Inventors: Isaac G. Councill, Shun Jiang, Tobin J. Lehman, James J. Rhodes, Hovey Raymond Strong, JR., Ruoyi Zhou
  • Publication number: 20110087616
    Abstract: A method for displaying portfolio risk is described. The method includes receiving a time series corresponding to a weight and a desirability of each of an asset in a portfolio. The method further includes maintaining the time series corresponding to the weight and the desirability of each of the assets in the portfolio. The method also includes maintaining a standard time series for comparison with the time series corresponding to the weight and the desirability of each of the assets in the portfolio. The method further includes displaying, for each asset in the portfolio, a quantity based on desirability versus a quantity based on the correlation between desirability and the standard time series over two specified windows of time. The method also includes displaying trend information based on moving two specified windows of time from the past to the point where at least one window is the most current window.
    Type: Application
    Filed: October 9, 2009
    Publication date: April 14, 2011
    Applicant: International Business Machines Corporation
    Inventors: Hovey Raymond Strong, JR., Sekou Remy, Tobin Jon Lehman
  • Publication number: 20090177963
    Abstract: A method of summarizing a document includes a step of extracting one or more sections of the document. The method also includes a step of separating at least one of the one or more extracted sections into one or more subsections based at least in part on a conjunctive structure of the section, wherein each subsection comprises one or more terms. The method also includes steps of determining whether one or more terms within a designated set of terms are present within at least one of the one or more subsections and, responsive to a determination that one or more terms within the designated set of terms are present within at least one of the one or more subsections, removing the one or more terms from the one or more subsections. The method also includes a step of aggregating at least a portion of the one or more sections into a summary of the document.
    Type: Application
    Filed: January 9, 2008
    Publication date: July 9, 2009
    Inventors: Larry Lee Proctor, Hovey Raymond Strong, JR., Renjie Tang, Ruoyi Zhou
  • Patent number: 7480859
    Abstract: Transforming a user-supplied DTD satisfying a first XML grammar into a PDTD satisfying a second XML grammar, including converting DTD declarations of alternate content to sequences, converting DTD declarations of optional content to mandatory content, converting DTD declarations of imbedded sequences to subsequences, and demoting attribute definitions of DTD elements having attributes to children of the DTD elements having attributes. Embodiments include converting recursions into repetitions, demoting imbedded compound repetitions from element declarations having imbedded compound repetitions, and demoting imbedded leaves from elements having imbedded leaves.
    Type: Grant
    Filed: October 4, 2005
    Date of Patent: January 20, 2009
    Assignee: International Business Machines Corporation
    Inventors: Ravi Mani, Joerg Meyer, Pratibha Jamdagneya Sharma, Hovey Raymond Strong, Jr.
  • Patent number: 7099891
    Abstract: According to a preferred embodiment of the present invention, a bridging system (100) and method provides a way of linking two independent data systems by receiving a dataset from a source data system. The bridging system (100) translates the dataset from a source schema to a target schema according to a set of mapping rules, and queues the translated data in persistent storage, and then sends the translated dataset to a destination data system. The system (100) includes an XML bridge (114), multiple application specific gateways (116,118), and a web admin interface (210), all in communication via a wide area network.
    Type: Grant
    Filed: June 15, 2001
    Date of Patent: August 29, 2006
    Assignee: International Business Machines Corporation
    Inventors: Clifford Vernon Harris, Jeffrey Thomas Kreulen, Vikas Krishna, Kevin Snow McCurley, Sami Nicole Rollins, Hovey Raymond Strong, Jr., Neelakantan Sundaresan
  • Patent number: 7085784
    Abstract: A system, method, and computer readable medium for control and synchronization of data between collaborative database systems. These databases are not exact duplicates and in face involve locally private data. The data is shared at the discretion of a local database and can happen during times of low system or communication demand. The use of merging a particular text string into one of the database fields after data is sent between systems is used to tag the synchronization. No time stamps or similar dating is used. This enables no addition to the data fields that are in use between the database. Care is taken to assure timely and correct synchronization while not sending data that has already been sent.
    Type: Grant
    Filed: January 10, 2002
    Date of Patent: August 1, 2006
    Assignee: International Business Machines Corporation
    Inventors: Vikas Krishna, Hovey Raymond Strong, Jr.
  • Patent number: 7076729
    Abstract: Graphical specification of an XML to XML transformation rule, including receiving a user's selection of a user-selected, optionally ambiguous, target leaf node, from a target tree of an initial target context, the target leaf node representing a target XML element to be mapped by the transformation rule; if the target leaf node is ambiguous, disambiguating the target leaf node; and adding the target leaf node to the transformation rule. Embodiments typically include receiving a user's selection of at least one user-selected, optionally ambiguous, source leaf node, from a source tree of an initial source context, wherein the source leaf node represents a source XML element to be mapped to the target leaf node by the transformation rule; if the source leaf node is ambiguous, disambiguating the source leaf node; and adding the user-selected source leaf node to the transformation rule.
    Type: Grant
    Filed: May 9, 2002
    Date of Patent: July 11, 2006
    Assignee: International Business Machines Corporation
    Inventors: Ravi Mani, Joerg Meyer, Pratibha Jamdagneya Sharma, Hovey Raymond Strong, Jr.
  • Patent number: 7069504
    Abstract: Transforming a source XML document satisfying a source DTD into a target XML document satisfying a target DTD, transforming the source XML document into a source document tree, where the source XML document satisfies a first XML grammar and the source document tree satisfies a second XML grammar; converting the source document tree into a target document tree satisfying the second XML grammar; and transforming the target document tree into the target XML document, wherein the target XML document satisfies the first XML grammar.
    Type: Grant
    Filed: September 19, 2002
    Date of Patent: June 27, 2006
    Assignee: International Business Machines Corporation
    Inventors: Ravi Mani, Joerg Meyer, Pratibha Jamdagneya Sharma, Hovey Raymond Strong, Jr.
  • Patent number: 7062708
    Abstract: Transforming a user-supplied DTD satisfying a first XML grammar into a PDTD satisfying a second XML grammar, including converting DTD declarations of alternate content to sequences, converting DTD declarations of optional content to mandatory content, converting DTD declarations of imbedded sequences to subsequences, and demoting attribute definitions of DTD elements having attributes to children of the DTD elements having attributes. Embodiments include converting recursions into repetitions, demoting imbedded compound repetitions from element declarations having imbedded compound repetitions, and demoting imbedded leaves from elements having imbedded leaves.
    Type: Grant
    Filed: September 19, 2002
    Date of Patent: June 13, 2006
    Assignee: International Business Machines Corporation
    Inventors: Ravi Mani, Joerg Meyer, Pratibha Jamdagneya Sharma, Hovey Raymond Strong, Jr.
  • Patent number: 6862586
    Abstract: A method and structure for performing a database search includes searching a database using a query (searching producing result items), and ranking the result items based on one or more of a frequency of an occurrence of in-links and out-links in each of the result items.
    Type: Grant
    Filed: February 11, 2000
    Date of Patent: March 1, 2005
    Assignee: International Business Machines Corporation
    Inventors: Jeffrey Thomas Kreulen, Vikas Krishna, Dharmendra Shantilal Modha, William Scott Spangler, Hovey Raymond Strong, Jr.
  • Patent number: 6748438
    Abstract: In a multiprocessing system, access to a shared resource is arbitrated among multiple computing nodes. The shared resources has a membership view resulting from a predetermined membership protocol performed by the shared resource and the computing nodes. Preferably, this membership protocol includes a termination condition guaranteeing asymmetric safety among all members of the multiprocessing system. The shared resource arbitrates access to itself by fencing computing nodes outside shared resource's membership view. In one embodiment, the shared resource may comprise a data storage facility, such as a disk drive. Illustratively, computation of the shared resource's membership view may employ a procedure where each computing node subscribes to the resource during prescribed membership intervals.
    Type: Grant
    Filed: November 17, 1997
    Date of Patent: June 8, 2004
    Assignee: International Business Machines Corporation
    Inventors: John Davis Palmer, Hovey Raymond Strong, Jr., Eliezer Upfal
  • Publication number: 20040060004
    Abstract: Transforming a source XML document satisfying a source DTD into a target XML document satisfying a target DTD, transforming the source XML document into a source document tree, where the source XML document satisfies a first XML grammar and the source document tree satisfies a second XML grammar; converting the source document tree into a target document tree satisfying the second XML grammar; and transforming the target document tree into the target XML document, wherein the target XML document satisfies the first XML grammar.
    Type: Application
    Filed: September 19, 2002
    Publication date: March 25, 2004
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Ravi Mani, Joerg Meyer, Pratibha Jamdagneya Sharma, Hovey Raymond Strong
  • Publication number: 20040060003
    Abstract: Transforming a user-supplied DTD satisfying a first XML grammar into a PDTD satisfying a second XML grammar, including converting DTD declarations of alternate content to sequences, converting DTD declarations of optional content to mandatory content, converting DTD declarations of imbedded sequences to subsequences, and demoting attribute definitions of DTD elements having attributes to children of the DTD elements having attributes. Embodiments include converting recursions into repetitions, demoting imbedded compound repetitions from element declarations having imbedded compound repetitions, and demoting imbedded leaves from elements having imbedded leaves.
    Type: Application
    Filed: September 19, 2002
    Publication date: March 25, 2004
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Ravi Mani, Joerg Meyer, Pratibha Jamdagneya Sharma, Hovey Raymond Strong
  • Publication number: 20030212698
    Abstract: Graphical specification of an XML to XML transformation rule, including receiving a user's selection of a user-selected, optionally ambiguous, target leaf node, from a target tree of an initial target context, the target leaf node representing a target XML element to be mapped by the transformation rule; if the target leaf node is ambiguous, disambiguating the target leaf node; and adding the target leaf node to the transformation rule. Embodiments typically include receiving a user's selection of at least one user-selected, optionally ambiguous, source leaf node, from a source tree of an initial source context, wherein the source leaf node represents a source XML element to be mapped to the target leaf node by the transformation rule; if the source leaf node is ambiguous, disambiguating the source leaf node; and adding the user-selected source leaf node to the transformation rule.
    Type: Application
    Filed: May 9, 2002
    Publication date: November 13, 2003
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Ravi Mani, Joerg Meyer, Pratibha Jamdagneya Sharma, Hovey Raymond Strong
  • Publication number: 20030131004
    Abstract: A system, method, and computer readable medium for control and synchronization of data between collaborative database systems. These databases are not exact duplicates and in face involve locally private data. The data is shared at the discretion of a local database and can happen during times of low system or communication demand. The use of merging a particular text string into one of the database fields after data is sent between systems is used to tag the synchronization. No time stamps or similar dating is used. This enables no addition to the data fields that are in use between the database. Care is taken to assure timely and correct synchronization while not sending data that has already been sent.
    Type: Application
    Filed: January 10, 2002
    Publication date: July 10, 2003
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Vikas Krishna, Hovey Raymond Strong
  • Patent number: 6510431
    Abstract: A system and method for routing customer requests to advisors is disclosed. The system and method comprises at least one customer server process for receiving customer requests and classifying the information to produce a classified request, the classified request comprising the original request and at least one attribute. The system further comprises at least one advisor server process for receiving the classified requests, comparing the classified requests by associated profiles from the advisors to find matching attributes with classified request, and creating a connection between the requesting customer and at least one advisor, the at least one advisor having submitted a profile with matching attributes. A routing system in accordance with the present invention reduces response time to a problem and saves advisor time. The system also provides for an automatic response to frequent problems at increased efficiency.
    Type: Grant
    Filed: June 28, 1999
    Date of Patent: January 21, 2003
    Assignee: International Business Machines Corporation
    Inventors: Matthias Eichstaedt, Jeffrey Thomas Kreulen, Vikas Krishna, William Scott Spangler, Hovey Raymond Strong, Jr.
  • Publication number: 20020194357
    Abstract: According to a preferred embodiment of the present invention, a bridging system (100) and method provides a way of linking two independent data systems by receiving a dataset from a source data system. The bridging system (100) translates the dataset from a source schema to a target schema according to a set of mapping rules, and queues the translated data in persistent storage, and then sends the translated dataset to a destination data system. The system (100) includes an XML bridge (114), multiple application specific gateways (116,118), and a web admin interface (210), all in communication via a wide area network.
    Type: Application
    Filed: June 15, 2001
    Publication date: December 19, 2002
    Applicant: International Business Machines Corporation
    Inventors: Clifford Vernon Harris, Jeffrey Thomas Kreulen, Vikas Krishna, Kevin Snow McCurley, Sami Nicole Rollins, Hovey Raymond Strong, Neelakantan Sundaresan