利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

81 条记录 (耗时 0.035 秒)

    Method, apparatus, and program for scheduling resources in a penalty-based environment
    1.
    发明授权
    Method, apparatus, and program for scheduling resources in a penalty-based environment 失效
    用于在基于罚分的环境中调度资源的方法，装置和程序

    公开(公告)号：US07480913B2

    公开(公告)日：2009-01-20

    申请号：US10658726

    申请日：2003-09-09

    申请人： Melissa Jane Buco ,  Rong Nickle Chang ,  Laura Zaihua Luan ,  Christopher Ward ,  Joel Leonard Wolf ,  Philip Shi-lung Yu

    发明人： Melissa Jane Buco ,  Rong Nickle Chang ,  Laura Zaihua Luan ,  Christopher Ward ,  Joel Leonard Wolf ,  Philip Shi-lung Yu

    IPC分类号： G06F9/46

    CPC分类号： G06F9/4887 ,  G06Q10/06

    摘要： The present invention relates to the problem of scheduling work for employees and/or other resources in a help desk or similar environment. The employees have different levels of training and availabilities. The jobs, which occur as a result of dynamically occurring events, consist of multiple tasks ordered by chain precedence. Each job and/or task carries with it a penalty which is a step function of the time taken to complete it, the deadlines and penalties having been negotiated as part of one or more service level agreement contracts. The goal is to minimize the total amount of penalties paid. The invention consists of a pair of heuristic schemes for this difficult scheduling problem, one greedy and one randomized. The greedy scheme is used to provide a quick initial solution, while the greedy and randomized schemes are combined in order to think more deeply about particular problem instances. The invention also includes a scheme for determining how much time to allocate to thinking about each of several potential problem instance variants.

    摘要翻译： 本发明涉及在帮助台或类似环境中调度员工和/或其他资源的工作的问题。 员工具有不同的培训水平和可用性。 由于动态发生的事件而发生的作业由链优先级排序的多个任务组成。 每项工作和/或任务带有罚款，这是完成它所需的时间的一个阶段功能，作为一个或多个服务级别协议合同的一部分，谈判达成的期限和处罚。 目标是尽量减少所支付的罚款总额。 本发明由一对启发式方案组成，用于这个困难的调度问题，一个是贪心的，一个是随机的。 贪心的方案用于提供一个快速的初步解决方案，而贪心和随机的方案是相结合的，以便更深入地思考特定的问题实例。 本发明还包括一种用于确定分配多少时间以考虑几个潜在问题实例变体中的每一个的方案。

    Scheduling resources in a penalty-based environment
    2.
    发明授权
    Scheduling resources in a penalty-based environment 有权
    在基于惩罚的环境中调度资源

    公开(公告)号：US08302097B2

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

    申请号：US11767891

    申请日：2007-06-25

    申请人： Melissa Jane Buco ,  Rong Nickle Chang ,  Laura Zaihua Luan ,  Christopher Ward ,  Joel Leonard Wolf ,  Philip Shi-lung Yu

    发明人： Melissa Jane Buco ,  Rong Nickle Chang ,  Laura Zaihua Luan ,  Christopher Ward ,  Joel Leonard Wolf ,  Philip Shi-lung Yu

    IPC分类号： G06F9/46

    CPC分类号： G06F9/4887 ,  G06Q10/06

    摘要： The present invention relates to the problem of scheduling work for employees and/or other resources in a help desk or similar environment. The employees have different levels of training and availabilities. The jobs, which occur as a result of dynamically occurring events, consist of multiple tasks ordered by chain precedence. Each job and/or task carries with it a penalty which is a step function of the time taken to complete it, the deadlines and penalties having been negotiated as part of one or more service level agreement contracts. The goal is to minimize the total amount of penalties paid. The invention consists of a pair of heuristic schemes for this difficult scheduling problem, one greedy and one randomized. The greedy scheme is used to provide a quick initial solution, while the greedy and randomized schemes are combined in order to think more deeply about particular problem instances. The invention also includes a scheme for determining how much time to allocate to thinking about each of several potential problem instance variants.

    摘要翻译： 本发明涉及在帮助台或类似环境中调度员工和/或其他资源的工作的问题。 员工具有不同的培训水平和可用性。 由于动态发生的事件而发生的作业由链优先级排序的多个任务组成。 每项工作和/或任务带有罚款，这是完成它所需的时间的一个阶段功能，作为一个或多个服务级别协议合同的一部分，谈判达成的期限和处罚。 目标是尽量减少所支付的罚款总额。 本发明由一对启发式方案组成，用于这个困难的调度问题，一个是贪心的，一个是随机的。 贪心的方案用于提供一个快速的初步解决方案，而贪心和随机的方案是相结合的，以便更深入地思考特定的问题实例。 本发明还包括一种用于确定分配多少时间以考虑几个潜在问题实例变体中的每一个的方案。

    System and method for construction of a data structure for indexing multidimensional objects
    6.
    发明授权
    System and method for construction of a data structure for indexing multidimensional objects 失效
    用于构建索引多维对象的数据结构的系统和方法

    公开(公告)号：US5781906A

    公开(公告)日：1998-07-14

    申请号：US660047

    申请日：1996-06-06

    申请人： Charu Chandra Aggarwal ,  Joel Leonard Wolf ,  Philip Shi-lung Yu

    发明人： Charu Chandra Aggarwal ,  Joel Leonard Wolf ,  Philip Shi-lung Yu

    IPC分类号： G06F17/30

    CPC分类号： G06F17/30327 ,  G06F17/30333 ,  Y10S707/99931 ,  Y10S707/99932 ,  Y10S707/99933 ,  Y10S707/99943

    摘要： An apparatus and a method for constructing a multidimensional index tree which minimizes the time to access data objects and is resilient to the skewness of the data. This is achieved through successive partitioning of all given data objects by considering one level at a time starting with one partition and using a top-down approach until each final partition can fit within a leaf node. Subdividing the data objects is via a global optimization approach to minimize the area overlap and perimeter of the minimum bounding rectangles covered by each node. The current invention divides the index construction problem into two subproblems: the first one addresses the tightness of the packing (in terms of area, overlap and perimeter) using a small fan out at each index node and the other one handles the fan out issue to improve index page utilization. These two stages are referred to as binarization and compression. The binarization stage constructs a binary tree such that the entries in the leaf nodes correspond to the spatial data objects. The compression stage converts the binary tree into a tree for which all but the leaf nodes and the parent nodes of all leaf nodes have branch factors of M. In the binarization stage, a weighting or skew factor is used to achieve flexibility in determining the number of data objects to be included in each of the partitions to obtain a tree structure with desirable query performance. Thus the index tree constructed is not required to be height balanced. This provides a means to trade-off imbalance in the index tree in order to reduce the number of pages which need to be accessed in a query.

    摘要翻译： 一种用于构造多维索引树的装置和方法，其使得访问数据对象的时间最小化并且对数据的偏度有弹性。 这是通过从一个分区开始一次考虑一个级别并使用自上而下的方法，直到每个最终分区可以适合于叶节点内的所有给定数据对象的连续分区来实现的。 通过全局优化方法细分数据对象，以最小化每个节点覆盖的最小边界矩形的面积重叠和周长。 本发明将指数构造问题划分为两个子问题：第一个问题是使用每个索引节点处的小扇形物来解决包装的紧密度（面积，重叠和周长），另一个处理扇出问题 提高索引页面利用率。 这两个阶段被称为二值化和压缩。 二值化阶段构造二叉树，使得叶节点中的条目对应于空间数据对象。 压缩级将二进制树转换为树，除了叶节点和所有叶节点的父节点之外，所有叶节点都具有分支因子M.在二进制化阶段，使用加权或偏斜因子来确定数量的灵活性 的数据对象被包括在每个分区中以获得具有期望的查询性能的树结构。 因此，构建的索引树不需要高度平衡。 这提供了一种权衡索引树中的不平衡的方法，以减少查询中需要访问的页面数量。

    System and method for caching objects of non-uniform size using multiple LRU stacks partitions into a range of sizes
    8.
    发明授权
    System and method for caching objects of non-uniform size using multiple LRU stacks partitions into a range of sizes 失效
    使用多个LRU堆栈来缓存不均匀大小的对象的系统和方法分割成一系列大小

    公开(公告)号：US6012126A

    公开(公告)日：2000-01-04

    申请号：US741412

    申请日：1996-10-29

    申请人： Charu Chandra Aggarwal ,  Marina Aleksandrovna Epelman ,  Joel Leonard Wolf ,  Philip Shi-lung Yu

    发明人： Charu Chandra Aggarwal ,  Marina Aleksandrovna Epelman ,  Joel Leonard Wolf ,  Philip Shi-lung Yu

    IPC分类号： G06F12/08 ,  G06F12/12 ,  G06F12/00

    CPC分类号： G06F12/0866 ,  G06F12/123 ,  G06F2212/311

    摘要： A system and method for caching objects of non-uniform size. A caching logic includes a selection logic and an admission control logic. The admission control logic determines whether an object not currently in the cache is accessed may be cached at all. The admission control logic uses an auxiliary LRU stack which contains the identities and time stamps of the objects which have been recently accessed. Thus, the memory required is relatively small. The auxiliary cache serves as a dynamic popularity list and an object may be admitted to the cache if and only if it appears on the popularity list. The selection logic selects one or more of the objects in the cache which have to be purged when a new object enters the cache. The order of removal of the objects is prioritized based both on the size as well as the frequency of access of the object and may be adjusted by a time to obsolescence factor (TTO). To reduce the time required to compare the space-time product of each object in the cache, the objects may be classified in ranges having geometrically increasing intervals. Specifically, multiple LRU stacks are maintained independently wherein each LRU stack contains only objects in a predetermined range of sizes. In order to choose candidates for replacement, only the least recently used objects in each group need be considered.

    摘要翻译： 用于缓存不均匀大小的对象的系统和方法。 缓存逻辑包括选择逻辑和准入控制逻辑。 准入控制逻辑确定是否存取当前不在高速缓存中的对象可以被缓存。 准入控制逻辑使用辅助LRU堆栈，其包含最近访问的对象的标识符和时间标记。 因此，所需的存储器相对较小。 辅助缓存用作动态流行度列表，并且当且仅当出现在受欢迎程度列表上时，对象可以被允许进入高速缓存。 选择逻辑选择当新对象进入高速缓存时必须被清除的高速缓存中的一个或多个对象。 基于对象的访问大小和频率，对对象的删除顺序进行优先排序，并且可以通过时间到过时因素（TTO）进行调整。 为了减少比较高速缓存中每个对象的时空乘积所需的时间，对象可以分为具有几何增加间隔的范围。 具体地说，独立维护多个LRU堆栈，其中每个LRU堆栈仅包含预定尺寸范围的对象。 为了选择候选人进行替换，只需要考虑每组中最近最少使用的对象。

    Method of performing a parallel relational database query in a multiprocessor environment
    9.
    发明授权
    Method of performing a parallel relational database query in a multiprocessor environment 失效

    公开(公告)号：US5765146A

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

    申请号：US148769

    申请日：1993-11-04

    申请人： Joel Leonard Wolf ,  Philip Shi-lung Yu ,  John Joseph Edward Turek

    发明人： Joel Leonard Wolf ,  Philip Shi-lung Yu ,  John Joseph Edward Turek

    IPC分类号： G06F17/30

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

    摘要： A method of performing a parallel join operation on a pair of relations R1 and R2 in a system containing P processors organized into Q clusters of P/Q processors each. The system contains disk storage for each cluster, shared by the processors of that cluster, together with a shared intermediate memory (SIM) accessible by all processors. The relations R1 and R2 to be joined are first sorted on the join column. The underlying domain of the join column is then partitioned into P ranges of equal size. Each range is further divided into M subranges of progressively decreasing size to create MP tasks T.sub.m,p, the subranges of a given range being so sized relative to one another that the estimated completion time for task T.sub.m,p is a predetermined fraction that of task T.sub.m-1,p. Tasks T.sub.m,p with larger time estimates are assigned (and the corresponding tuples shipped) to the cluster to which processor p belongs, while tasks with smaller time estimates are assigned to the SIM, which is regarded as a universal cluster (cluster 0). The actual task-to-processor assignments are determined dynamically during the join phase in accordance with the dynamic longest processing time first (DLPT) algorithm. Each processor within a cluster picks its next task at any given decision point to be the one with the largest time estimate which is owned by that cluster or by cluster 0.

    System and method for resource adaptive classification of data streams
    10.
    发明授权
    System and method for resource adaptive classification of data streams 失效
    数据流资源自适应分类的系统和方法

    公开(公告)号：US08051021B2

    公开(公告)日：2011-11-01

    申请号：US11530938

    申请日：2006-09-12

    申请人： Charu Aggarwal ,  Philip Shi-lung Yu

    发明人： Charu Aggarwal ,  Philip Shi-lung Yu

    IPC分类号： G06N5/00

    CPC分类号： G06K9/6282 ,  G06N99/005

    摘要： A system and method for resource adaptive classification of data streams. Embodiments of systems and methods provide classifying data received in a computer, including discretizing the received data, constructing an intermediate data structure from said received data as training instances, performing subspace sampling on said received data as test instances and adaptively classifying said received data based on statistics of said subspace sampling.

    摘要翻译： 一种用于数据流资源自适应分类的系统和方法。 系统和方法的实施例提供在计算机中接收的分类数据，包括离散接收的数据，从所接收的数据构建中间数据结构作为训练实例，对所接收的数据进行子空间采样作为测试实例，并基于 所述子空间抽样统计。