利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

32 条记录 (耗时 0.038 秒)

    Inventory replication based upon order fulfillment rates
    1.
    发明申请
    Inventory replication based upon order fulfillment rates 审中-公开
    基于订单履行率的库存复制

    公开(公告)号：US20100241269A1

    公开(公告)日：2010-09-23

    申请号：US12800759

    申请日：2010-05-22

    申请人： Peter Ham ,  Boris Klots ,  Radhakrishna Hari ,  Franklin R. Koenig ,  Gautam Bhargava ,  Gerry Perham

    发明人： Peter Ham ,  Boris Klots ,  Radhakrishna Hari ,  Franklin R. Koenig ,  Gautam Bhargava ,  Gerry Perham

    IPC分类号： G06F19/00 ,  G06F7/00 ,  G06Q10/00 ,  G06Q30/00

    CPC分类号： G06Q10/087 ,  G06Q10/06315 ,  G06Q10/06375 ,  G06Q30/0201 ,  G06Q30/0601 ,  G06Q30/0617 ,  G06Q30/0633

    摘要： A load balancing technology segregates various inventory types (e.g., potatoes vs. milk, vs. pretzels, vs. tissue paper, etc.) based upon how frequently they are ordered in a distribution center. Inventory types that are ordered at the slowest rate are not “replicated” over multiple pods in the distribution center. Rather, they are constrained to reside at a single pod within the distribution center. Items that are ordered somewhat more frequently than those in the slowest group are replicated in multiple pods across the distribution center. In other words, these items are separately stocked at locations on more than one pod in the distribution center. This means that a container passing through the distribution center can obtain each of the items in the second group of item types at multiple pods in the distribution center. Thus, these items do not create a bottleneck in the order fulfillment process. Inventory types in a third group, the fastest movers, are segregated from items in the first two groups. They are stored in a separate type of pod that fulfills orders even faster than the other type of pods.

    摘要翻译： 负载平衡技术基于在配送中心中订购的频率，分离各种库存类型（例如，土豆对牛奶，与椒盐脆饼，对薄纸等）。 以最慢速率排序的库存类型不会在配送中心的多个pod中“复制”。 相反，它们被限制在分配中心内的单个荚上。 订购量比最慢组中的产品更频繁地复制在配送中心的多个pod中。 换句话说，这些物品分开存放在配送中心多个荚的位置。 这意味着通过配送中心的集装箱可以在配送中心的多个荚中获得第二组物品类型中的每个物品。 因此，这些项目不会在订单履行过程中产生瓶颈。 第三组中最快的移动商的库存类型与前两个组中的项目分开。 它们存储在单独类型的pod中，其顺序比其他类型的pod更快。

    Inventory replication based upon order fulfillment rates
    2.
    发明申请
    Inventory replication based upon order fulfillment rates 审中-公开
    基于订单履行率的库存复制

    公开(公告)号：US20080154709A1

    公开(公告)日：2008-06-26

    申请号：US12074283

    申请日：2008-03-03

    申请人： Peter Ham ,  Boris Klots ,  Radhakrishna Hari ,  Franklin R. Koenig ,  Gautam Bhargava ,  Gerry Perham

    发明人： Peter Ham ,  Boris Klots ,  Radhakrishna Hari ,  Franklin R. Koenig ,  Gautam Bhargava ,  Gerry Perham

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

    CPC分类号： G06Q10/087 ,  G06Q10/06315 ,  G06Q10/06375 ,  G06Q30/0201 ,  G06Q30/0601 ,  G06Q30/0617 ,  G06Q30/0633

    摘要： A load balancing technology segregates various inventory types (e.g., potatoes vs. milk, vs. pretzels, vs. tissue paper, etc.) based upon how frequently they are ordered in a distribution center. Inventory types that are ordered at the slowest rate are not “replicated” over multiple pods in the distribution center. Rather, they are constrained to reside at a single pod within the distribution center. Items that are ordered somewhat more frequently than those in the slowest group are replicated in multiple pods across the distribution center. In other words, these items are separately stocked at locations on more than one pod in the distribution center. This means that a container passing through the distribution center can obtain each of the items in the second group of item types at multiple pods in the distribution center. Thus, these items do not create a bottleneck in the order fulfillment process. Inventory types in a third group, the fastest movers, are segregated from items in the first two groups. They are stored in a separate type of pod that fulfills orders even faster than the other type of pods.

    摘要翻译： 负载平衡技术基于在配送中心中订购的频率，分离各种库存类型（例如，土豆对牛奶，与椒盐脆饼，对薄纸等）。 以最慢速率排序的库存类型不会在配送中心的多个pod中“复制”。 相反，它们被限制在分配中心内的单个荚上。 订购量比最慢组中的产品更频繁地复制在配送中心的多个pod中。 换句话说，这些物品分开存放在配送中心多个荚的位置。 这意味着通过配送中心的集装箱可以在配送中心的多个荚中获得第二组物品类型中的每个物品。 因此，这些项目不会在订单履行过程中产生瓶颈。 第三组中最快的移动商的库存类型与前两个组中的项目分开。 它们存储在单独类型的pod中，其顺序比其他类型的pod更快。

    System and methodology for voice activated access to multiple data sources and voice repositories in a single session
    5.
    发明授权
    System and methodology for voice activated access to multiple data sources and voice repositories in a single session 有权
    语音激活访问单个会话中多个数据源和语音存储库的系统和方法

    公开(公告)号：US07289607B2

    公开(公告)日：2007-10-30

    申请号：US10968503

    申请日：2004-10-19

    申请人： Gautam Bhargava ,  Ramnesk Bhasin ,  Slva V. Kumar

    发明人： Gautam Bhargava ,  Ramnesk Bhasin ,  Slva V. Kumar

    IPC分类号： H04M1/64

    CPC分类号： H04M3/4938

    摘要： A system and method and computer program for seamlessly accessing multiple data sources and voice repositories using voice commands in a single phone call session. The system comprises of voice grammars that span various contexts for all data sources and voice repositories, a telephony platform, an automatic speech recognition engine, extractors for extracting information from the data sources and voice repositories and an interpreter for controlling the extractors and telephony platform. It is the co-operation between the voice grammars and the telephony platform, controlled by a VoiceXML interpreter that enables this seamless access to information from the multiple data sources and voice repositories.

    摘要翻译： 一种用于在单个电话呼叫会话中使用语音命令无缝访问多个数据源和语音存储库的系统和方法和计算机程序。 该系统包括跨越所有数据源和语音库的各种上下文的语音语法，电话平台，自动语音识别引擎，用于从数据源和语音存储库提取信息的提取器以及用于控制提取器和电话平台的解释器。 语音语法和电话平台之间的协作，由VoiceXML解释器控制，可以无缝访问来自多个数据源和语音信息库的信息。

    System and method for delivering content to a communication device in a content delivery system
    6.
    发明授权
    System and method for delivering content to a communication device in a content delivery system 有权
    用于将内容传送到内容传送系统中的通信设备的系统和方法

    公开(公告)号：US08126858B1

    公开(公告)日：2012-02-28

    申请号：US12284180

    申请日：2008-09-19

    申请人： Mark A. Ruzon ,  Keshav Menon ,  Gurumurthy D. Ramkumar ,  Donald Tanguay ,  Supratik Bhattacharyya ,  Gautam Bhargava

    发明人： Mark A. Ruzon ,  Keshav Menon ,  Gurumurthy D. Ramkumar ,  Donald Tanguay ,  Supratik Bhattacharyya ,  Gautam Bhargava

    IPC分类号： G06F7/00 ,  G06F17/00

    CPC分类号： G06F17/30017 ,  G06F17/30247 ,  G06F17/30277

    摘要： The present invention relates to a method, system, and a computer-readable storage medium containing executable instructions for delivering content to a communication device, in response to an image sent by the communication device. The received image is matched with a plurality of images, and, when a match is found for the received image, content corresponding to the matching image is delivered to the communication device. The plurality of images is stored in an image database, and the corresponding content is stored in a content repository. The present invention enables a content provider to automatically update the image database and the content repository without any human intervention.

    摘要翻译： 本发明涉及一种方法，系统和计算机可读存储介质，其包含用于响应于通信设备发送的图像而将内容传送到通信设备的可执行指令。 所接收的图像与多个图像匹配，并且当对于接收到的图像找到匹配时，与匹配图像相对应的内容被传送到通信装置。 多个图像被存储在图像数据库中，并且相应的内容被存储在内容存储库中。 本发明使得内容提供商能够在没有任何人为干预的情况下自动更新图像数据库和内容存储库。

    Method and apparatus for reordering complex SQL queries containing inner and outer join operations
    8.
    发明授权
    Method and apparatus for reordering complex SQL queries containing inner and outer join operations 失效
    重新排序包含内部和外部连接操作的复杂SQL查询的方法和装置

    公开(公告)号：US5832477A

    公开(公告)日：1998-11-03

    申请号：US856198

    申请日：1997-05-14

    申请人： Gautam Bhargava ,  Piyush Goel ,  Balakrishna Ragmavendra Iyer

    发明人： Gautam Bhargava ,  Piyush Goel ,  Balakrishna Ragmavendra Iyer

    IPC分类号： G06F17/30

    CPC分类号： G06F17/30463 ,  G06F17/30466 ,  Y10S707/99932

    摘要： A method and apparatus for reordering complex SQL queries containing joins, outer and full outer joins. The method and apparatus first translates the query into a hypergraph representation. Required sets, conflict sets and preserved sets are then generated for the query hypergraph. Using the required sets, a plurality of plans are enumerated, wherein the plans represent associative re-orderings of relations in the query. SQL operators are selectively assigned to each of the enumerated plans using the conflict sets and/or preserved sets, so that the results from the plans are identical to the original query. A novel Modified General Outer Join (MGOJ) operator may be assigned to the root of a sub-tree, wherein the MGOJ operator is a compensation operator. The operator assignment is performed recursively for the root of each sub-tree in the plan. One of the enumerated plans (generally the most optimal) is then selected for execution.

    摘要翻译： 一种重新排序复杂SQL查询的方法和装置，它包含连接，外部和外部连接。 该方法和装置首先将查询翻译成超图表示。 然后为查询超图生成所需的集合，冲突集和保留集。 使用所需的集合，列举了多个计划，其中计划表示查询中的关系的关联重新排序。 使用冲突集和/或保留集合将SQL运算符选择性地分配给每个枚举的计划，以便计划的结果与原始查询相同。 可以将新颖的修改后的通用外部联接（MGOJ）运算符分配给子树的根，其中，MGOJ运算符是补偿运算符。 对于计划中每个子树的根，递归地执行运算符分配。 然后选择一个列举的计划（通常是最优）。

    Method and apparatus for executing complex SQL queries using projection operations
    9.
    发明授权
    Method and apparatus for executing complex SQL queries using projection operations 失效
    使用投影操作执行复杂SQL查询的方法和装置

    公开(公告)号：US5752017A

    公开(公告)日：1998-05-12

    申请号：US468647

    申请日：1995-06-05

    申请人： Gautam Bhargava ,  Piyush Goel ,  Balakrishna Ragmavendra Iyer

    发明人： Gautam Bhargava ,  Piyush Goel ,  Balakrishna Ragmavendra Iyer

    IPC分类号： G06F17/30

    CPC分类号： G06F17/30463 ,  G06F17/30466 ,  Y10S707/99932

    摘要： A method and apparatus for reordering complex SQL queries containing joins, outer and full outer joins. The method and apparatus first translates the query into a hypergraph representation. Required sets, conflict sets and preserved sets are then generated for the query hypergraph. Using the required sets, a plurality of plans are enumerated, wherein the plans represent associative reorderings of relations in the query. SQL operators are selectively assigned to each of the enumerated plans using the conflict sets and/or preserved sets, so that the results from the plans are identical to the original query. A novel Modified General Outer Join (MGOJ) operator may be assigned to the root of a sub-tree, wherein the MGOJ operator is a compensation operator. The operator assignment is performed recursively for the root of each sub-tree in the plan. One of the enumerated plans (generally the most optimal) is then selected for execution.

    摘要翻译： 一种重新排序复杂SQL查询的方法和装置，它包含连接，外部和外部连接。 该方法和装置首先将查询翻译成超图表示。 然后为查询超图生成所需的集合，冲突集和保留集。 使用所需的集合，列举了多个计划，其中计划表示查询中关系的关联排序。 使用冲突集和/或保留集合将SQL运算符选择性地分配给每个枚举的计划，以便计划的结果与原始查询相同。 可以将新颖的修改后的通用外部联接（MGOJ）运算符分配给子树的根，其中，MGOJ运算符是补偿运算符。 对于计划中每个子树的根，递归地执行运算符分配。 然后选择一个列举的计划（通常是最优）。

    Reordering complex SQL queries containing inner and outer join operations using hypergraphs and required sets
    10.
    发明授权
    Reordering complex SQL queries containing inner and outer join operations using hypergraphs and required sets 失效
    使用超图和所需的集合重新排序包含内部和外部连接操作的复杂SQL查询

    公开(公告)号：US5724568A

    公开(公告)日：1998-03-03

    申请号：US464268

    申请日：1995-06-05

    申请人： Gautam Bhargava ,  Piyush Goel ,  Balakrishna Ragmavendra Iyer

    发明人： Gautam Bhargava ,  Piyush Goel ,  Balakrishna Ragmavendra Iyer

    IPC分类号： G06F17/30

    CPC分类号： G06F17/30463 ,  G06F17/30466 ,  Y10S707/99932

    摘要： A method and apparatus for reordering complex SQL queries containing joins, outer and full outer joins. The method and apparatus first translates the query into a hypergraph representation. Required sets, conflict sets and preserved sets are then generated for the query hypergraph. Using the required sets, a plurality of plans are enumerated, wherein the plans represent associative reorderings of relations in the query. SQL operators are selectively assigned to each of the enumerated plans using the conflict sets and/or preserved sets, so that the results from the plans are identical to the original query. A novel Modified General Outer Join (MGOJ) operator may be assigned to the root of a sub-tree, wherein the MGOJ operator is a compensation operator. The operator assignment is performed recursively for the root of each sub-tree in the plan. One of the enumerated plans (generally the most optimal) is then selected for execution.

    摘要翻译： 一种重新排序复杂SQL查询的方法和装置，它包含连接，外部和外部连接。 该方法和装置首先将查询翻译成超图表示。 然后为查询超图生成所需的集合，冲突集和保留集。 使用所需的集合，列举了多个计划，其中计划表示查询中关系的关联排序。 使用冲突集和/或保留集合将SQL运算符选择性地分配给每个枚举的计划，以便计划的结果与原始查询相同。 可以将新颖的修改后的通用外部联接（MGOJ）运算符分配给子树的根，其中，MGOJ运算符是补偿运算符。 对于计划中每个子树的根，递归地执行运算符分配。 然后选择一个列举的计划（通常是最优）。