公开(公告)号：US06892195B2

公开(公告)日：2005-05-10

申请号：US09848426

申请日：2001-05-04

申请人： Juhnyoung Lee ,  Ho Soo Lee

发明人： Juhnyoung Lee ,  Ho Soo Lee

IPC分类号： G06N5/04 ,  G06Q40/04

CPC分类号： G06Q40/04

摘要： 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.

摘要翻译： 一种用于配置出价的系统和方法。 系统和方法使用规则和推理引擎，以便根据请求报价（RFQ）配置出价。 该系统和方法包括将来自两个或多个企业数据源的数据集成到聚合企业数据库和知识库数据库中的数据聚合器。 出价配置者通过使用至少一个推理引擎和从知识数据库提取的事实和规则来构造一个或多个目标RFQ的一个或多个销售出价候选者。

公开(公告)号：US06321132B1

公开(公告)日：2001-11-20

申请号：US09129825

申请日：1998-08-05

申请人： Milind Wasudeo Dawande ,  Jayant R. Kalagnanam ,  Ho Soo Lee ,  Mark Elliot Trumbo

发明人： Milind Wasudeo Dawande ,  Jayant R. Kalagnanam ,  Ho Soo Lee ,  Mark Elliot Trumbo

IPC分类号： G06F1900

CPC分类号： G06Q10/04 ,  G06Q10/087 ,  G06Q10/0875

摘要： An efficient computer implemented method is used to design slabs for production from an order book. This method minimizes the number of slabs designed to fulfill an order book. This method is based on a heuristic algorithm which is a variant of the greedy approach for the set covering method. The variations are novel in three ways. First, designing slabs using the flexibility in the order size; second, using weight for choosing large slabs; and third, controlling the exponential nature of enumeration of the set of all subsets by constructing only the largest slab at each step.

摘要翻译： 一种高效的计算机实现方法用于从订单簿中设计用于生产的板坯。 这种方法最大限度地减少了设计用于完成订单的平板数量。 该方法基于启发式算法，该算法是集合覆盖方法的贪心方法的变体。 这些变化在三个方面是新颖的。 首先，使用订单尺寸的灵活性设计板坯; 第二，使用重量选择大板; 第三，通过在每个步骤中仅构造最大的平板来控制所有子集的枚举的指数性质。

公开(公告)号：US5666469A

公开(公告)日：1997-09-09

申请号：US384979

申请日：1995-02-07

申请人： Ho Soo Lee

发明人： Ho Soo Lee

IPC分类号： G06F9/44 ,  G06N5/04 ,  G06Q10/04 ,  G06F17/00

CPC分类号： G06Q10/04

摘要： A method for generating solutions for sequencing problems of a type that can develop in artificial intelligence or operation research. The method includes the steps of finding multiple sets of subsequences of near optimal quality for a given finite number of n items wherein each item has a set of attributes and wherein there exists a set of constraints and objectives defined on the n items; and satisfying the constraints simultaneously such that the number of subsequences is a minimum.

摘要翻译： 一种用于生成可以在人工智能或操作研究中发展的类型的排序问题的解决方案。 该方法包括以下步骤：为给定的有限数量的n个项目找到接近最优质量的多组子序列，其中每个项目具有一组属性，并且其中存在在n个项目上定义的一组约束和目标; 并同时满足约束条件，使子序列的数量最小。

公开(公告)号：US06182794B2

公开(公告)日：2001-02-06

申请号：US08957594

申请日：1997-10-24

申请人： Ho Soo Lee

发明人： Ho Soo Lee

IPC分类号： F04B3902

CPC分类号： F04B39/0253 ,  F04C29/025

摘要： An oil suction propeller structure for a hermetically sealed compressor includes a rotor, a crank shaft pressure-inserted in the rotor, an oil guide piece pressure-inserted in a lower portion of the crank shaft, a lower wing fixedly inserted in the oil guide piece and soaked in an oil, an upper wing having a width thereof wider than that of the lower wing, and an intermediate portion extending from the lower wing and gradually broadening in width toward the upper wing. The oil suction propeller structure improves oil supply capacity, and minimizes a whirling sound and a dropping noise which may occur during the rotation of the oil guide piece and the oil suction propeller thereof, for thereby enhancing reliability of the hermetically sealed compressor.

摘要翻译： 用于气密密封的压缩机的吸油螺旋桨结构包括：转子，压力插入转子中的曲轴，压入插入曲轴下部的导油件;固定插入导油件 并浸渍在油中，其宽度比下翼宽的上翼，以及从下翼延伸并逐渐变宽向上翼的中间部。 吸油螺旋桨结构改善了供油能力，并且最小化了导油件和其吸油螺旋桨旋转期间可能发生的旋转声音和下降噪音，从而提高了密封式压缩机的可靠性。

公开(公告)号：US5808891A

公开(公告)日：1998-09-15

申请号：US688573

申请日：1996-07-30

申请人： Ho Soo Lee ,  Mark Elliot Trumbo

发明人： Ho Soo Lee ,  Mark Elliot Trumbo

IPC分类号： G05B19/418 ,  G05B19/42

CPC分类号： G05B19/41865 ,  Y02P90/20 ,  Y10S706/904

摘要： A scheduling method suitable for use in a primary steel production area operating in either direct rolling or direct hot charge rolling modes, collectively referred to as synchronized rolling. The steel production area comprising a continuous caster, for input of slabs to a hot strip mill. An order load for some finite period (e.g. one week) is received as input to the method. The method generates a caster schedule and a hot strip mill schedule which fills the order load with the objective of operating the continuous caster and the hot strip mill with minimal interruption. The generated schedule works within the constraints imposed by both the continuous caster and the hot strip mill. The schedule generation process also considers key operating constraints of individual facilities as well as those on which the facility has dependencies. The schedule also addresses objectives such as maximizing throughput, maximizing on-time delivery, and minimizing operating costs.

摘要翻译： 适用于以直接轧制或直接热轧轧制方式运行的主钢生产区域的调度方法，统称为同步轧制。 钢生产区域包括连铸机，用于将板坯输入热轧机。 作为该方法的输入接收一些有限周期（例如一周）的订单负载。 该方法生成施法者计划和热轧带钢轧机计划，其填充订单负载，以连续铸造机和热轧带钢轧机的操作为中心。 生成的计划在连续铸造机和热轧带钢厂施加的约束条件下工作。 时间表生成过程还考虑了各个设施以及设施依赖关系的关键操作限制。 该计划还涉及目标，例如最大化吞吐量，最大限度地提高准时交货，并最大限度地降低运营成本。

公开(公告)号：US6044361A

公开(公告)日：2000-03-28

申请号：US47275

申请日：1998-03-24

申请人： Jayant R. Kalagnanam ,  Ho Soo Lee ,  Mark Elliot Trumbo

发明人： Jayant R. Kalagnanam ,  Ho Soo Lee ,  Mark Elliot Trumbo

IPC分类号： G06Q10/04 ,  G06Q10/08 ,  G06F17/00

CPC分类号： G06Q10/04 ,  G06Q10/087 ,  G06Q10/0875

摘要： 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.

摘要翻译： 快速计算机实现方法通过同时解决多个目标并生成多个非主导解决方案，为多目标库存匹配问题生成近似最优解。 该方法实现了由三个步骤组成的多分配反向算法。 第一步是通过应用迭代双边匹配和最大流算法创建可行解决方案。 近似最优可行解存储在非主导集中。 第二步是使用多键排序来识别给定的可行解决方案中的不合需要的匹配。 第三步是通过从可行解决方案中移除不需要的匹配来解决问题，并将这些不合需要的匹配放在一组不错的匹配上。 如果可行的解决方案是非主导的，则将副本存储在非主导的集合中。 最终提供可行的解决方案作为排斥步骤的输入。

公开(公告)号：US07702561B2

公开(公告)日：2010-04-20

申请号：US09917818

申请日：2001-07-31

申请人： Andrew J. Davenport ,  Jayant R. Kalagnanam ,  Ho Soo Lee

发明人： Andrew J. Davenport ,  Jayant R. Kalagnanam ,  Ho Soo Lee

IPC分类号： G06Q40/00

CPC分类号： G06Q30/08 ,  G06Q10/087 ,  G06Q40/04 ,  G06Q40/06

摘要： 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.

摘要翻译： 提供了一种用于识别反向组合拍卖中的成本最小化出价集，该方法是根据各种商业规则进行全或无捆绑出价。 该方法包括为每个投标引入决策变量，引入计数变量以指示是否在最优投标集中选择来自供应商的投标，使用出价变量建模每个项目的需求约束，基于供应商的最小和最大数量建模 计算变量，引入虚拟变量以确保可行解决方案的存在，给定成本制定了基于具有给定成本水平作为约束的附加时间戳目标来选择提前到达的投标的目标，并引入价格修改来处理所提出的 选择提前到期的投标的目标。

公开(公告)号：US06611814B1

公开(公告)日：2003-08-26

申请号：US09618100

申请日：2000-07-17

申请人： Juhnyoung Lee ,  Jayant R. Kalagnanam ,  Andrew J. Davenport ,  Ho Soo Lee

发明人： Juhnyoung Lee ,  Jayant R. Kalagnanam ,  Andrew J. Davenport ,  Ho Soo Lee

IPC分类号： G06F1760

CPC分类号： G06Q30/0201 ,  G06Q30/02 ,  G06Q30/0601 ,  G06Q30/0631 ,  G06Q30/0633 ,  G06Q30/0641

摘要： 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.

摘要翻译： 计算机系统和方法在计算机网络上使用一个或多个购物者的一个或多个虚拟愿望清单。 一个过程从在线通讯簿或其他个人数据库中提取信息，并创建购物者想要购买产品的收件人列表。 第二个过程通过观察他们对在线商店的访问以及其他在线行为来获得收件人的虚拟愿望清单。 要求收件人允许将此数据提供给其他购物者，网上商店和其他网站。 收件人可以修改他们的虚拟愿望清单，并选择性地批准其他购物者等的使用。第三个过程为收件人创建购物清单，并生成购买者为预期收件人购买的推荐产品列表。