Ho L Lee

6611814, Aug 26, 2003

Jul 17, 2000

09/618100

Juhnyoung Lee - Yorktown Heights NY
Jayant R. Kalagnanam - Tarrytown NY
Andrew J. Davenport - Ossining NY
Ho Soo Lee - Mount Kisco NY

International Business Machines Corporation - Armonk NY

G06F 1760

705 26, 705 27

A computer system and method uses one or more virtual wish lists of one or more shoppers over a computer network. One process extracts information from online address books or other personal databases, and creates lists of recipients for whom a shopper wants to purchase products. A second process obtains virtual wish lists of recipients by observing their visits to online stores, and other online behavior. Recipients are asked for permission to make this data available to other shoppers, online stores, and other Web sites. Recipients can modify their virtual wish lists, and selectively approve of their use by other shoppers, etc. A third process creates shopping lists for the recipients, and generates lists of recommended products for shoppers to buy for intended recipients.

6892195, May 10, 2005

May 4, 2001

09/848426

Juhnyoung Lee - Yorktown Heights NY, US
Ho Soo Lee - Mount Kisco NY, US

International Business Machines Corporation - Armonk NY

G06N005/04

706 61

A system and method for configuring sell bids. The system and method use rules and inference engines in order to configure sell bids in view of Request for Quotes (RFQs). The system and method include a data aggregator that integrates data from two or more enterprise data sources into an aggregated enterprise database and a knowledge base database. A bid configurator constructs one or more sell bid candidates for one or more target RFQs by using at least one inference engine and the extracted facts and rules from the knowledge database.

7702561, Apr 20, 2010

Jul 31, 2001

09/917818

Andrew J. Davenport - Ossining NY, US
Jayant R. Kalagnanam - Tarrytown NY, US
Ho Soo Lee - Mount Kisco NY, US

International Business Machines Corporation - Armonk NY

G06Q 40/00

705 37, 705 7, 705 8, 705 28, 705 36 R

A method is provided for identifying a cost-minimizing bid set in a reverse combinatorial auction subject to various business rules for all-or-nothing bundled bids. The method includes introducing a decision variable for each bid, introducing a counting variable to indicate whether bids from a supplier are chosen in an optimal bid set, modeling demand constraints for each item using the bid variables, modeling minimum and maximum numbers of suppliers based on the counting variables, introducing dummy variables to ensure existence of feasible solutions, for a given cost formulating an objective of choosing bids that arrive early based on an additional timestamped objective with the given cost level as a constraint, and introducing price modifications to handle the formulated objective of choosing bids that arrive early.

20020065762, May 30, 2002

Mar 8, 2001

09/800664

Ho Lee - Mount Kisco NY, US
Juhnyoung Lee - Yorktown Heights NY, US

G06F017/60

705/037000, 705/026000

A method for purchasing and selling products or services in a networked environment using a request for quotation process and a visual interface for evaluating submitted bids for such products or services. A buyer submits a Request for Quotation (RFQ) and associated attributes and/or business rules over a network. As seller responds to the RFQ by submitting a bid with attribute values. A market maker uses the buyer attributes and/or business rules with the attribute values of the submitted bid to create a visual interface augmented by customized filters which are later used to evaluate seller submitted bids. The bids are received in the e-marketplace, at which time the e-marketplace can arrange, sort or filter the received bids in order to assist the buyer in examining and evaluating such bids. The filtering may include filtering an attribute value, an attribute line, a bid line or a portion of the bid line. Information may also be displayed associated with the bid line such as attribute information, general information or detailed information. The bid lines may also be tagged, counted, scrolled, enlarged or reduced.

20020165814, Nov 7, 2002

May 4, 2001

09/848428

Juhnyoung Lee - Yorktown Heights NY, US
Ho Lee - Mount Kisco NY, US

G06F017/60

705/037000

A system and method that introduces ordering on a set of criteria and ranks alternatives having two or more attributes. More specifically, a system and method for online trading over a networked system where buyers and sellers make one or more trade deals on one or more products or services that have two or more attributes by using a Request For Quote (RFQ) process on an electronic marketplace. The system and method relates to decision under certainty. To provide the advantages presented by the system and method, a weight generator process computes weights of object attributes by re-engineering the ranks of the selected objects given by the user. The computing of the attribute weights is performed by score inequality.

49512250, Aug 21, 1990

Nov 14, 1988

7/272135

Ho S. Lee - Mount Kisco NY
Marshall I. Schor - Katonah NY

International Business Machines Corp. - Armonk NY

G06F 1518

364513

A pattern-matching system, such as of the RETE type, is updated. The updating operation is generalize to operate with correct match resuslts for generalized RETE networks (ones where join nodes may have either predecessor be another join node), and for arbitrary partial update state, characterized by stop nodes designating how far update operations have progressed for particular update tokens (designated suspended tokens) at any particular time. The updating operation consists of the following steps: First, all tokens only partially updated through the network are shadowed, in that the partial result memories associated with the stop nodes are put into the state that exists or existed before the suspended tokens arrive at the stop nodes. Then for each suspended token, it is pushed to resume nodes connected as RHS (or LHS) inputs in a descending order of resume nodes. The descending order is determined among sets of resume nodes where one node is reachable from the other, either in an upwards or downwards direction.

60443618, Mar 28, 2000

Mar 24, 1998

9/047275

Jayant R. Kalagnanam - Tarrytown NY
Ho Soo Lee - Mount Kisco NY
Mark Elliot Trumbo - Pleasantville NY

International Business Machines Corporation - Armonk NY

G06F 1700

705 28

A fast computer implemented method generates near-optimal solutions to the multi-objective inventory matching problem by solving for multiple objectives simultaneously and generating multiple non-dominating solutions. The method implements a multi-assignment backjumping algorithm that consists of three steps. The first step is a rappeling step in which a feasible solution is created by applying Iterative Bipartite Matching and maximum flow algorithm. Near-optimal feasible solutions are stored in a non dominated set. The second step is to use a multi-key sort to identify undesirable matches in a given feasible solution. The third step is backlifting the solution by removing undesirable matches from the feasible solution and places those undesirable matches on a no good set of matches. If the feasible solution is non-dominated, a copy is stored in a non-dominated set. The feasible solution is finally provided as input to the repelling step.

49567918, Sep 11, 1990

Nov 14, 1988

7/272097

Ho S. Lee - Mount Kisco NY
Marshall I. Schor - Katonah NY

International Business Machines Corp. - Armonk NY

G06F 1518

364513

A pattern-matching network is merged with an existing RETE network without recompiling the whole network, while still matching existing data. Permanent, temporary, full and partial merging operations are described, depending on the origination of match patterns among LHS, on demand (procedural programming), or top level. The merge process combines functionally identical nodes from the networks for reducing the number of nodes in the resulting network. The merger process produces so-called alpha and beta synapse nodes; alpha synapse nodes have pointers to top nodes, while beta synapse nodes consist pointers to a drain node, which is a node in the grafted RETE portions of the resulting network and to source memory nodes in the pre-existing RETE network. The algorithm for obtaining a set of synapse nodes without duplication of any logic connecting paths is described. The synapse nodes are used in updating a grafted network, also can be a suspended portion, upon completion of the merger.