公开(公告)号：US20050055697A1

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

申请号：US10658726

申请日：2003-09-09

申请人： Melissa Buco ,  Rong Chang ,  Laura Luan ,  Christopher Ward ,  Joel Wolf ,  Philip Yu

发明人： Melissa Buco ,  Rong Chang ,  Laura Luan ,  Christopher Ward ,  Joel Wolf ,  Philip Yu

IPC分类号： G06F9/48 ,  G06Q10/00 ,  G06F9/46 ,  G06F9/00

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.

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

公开(公告)号：US20050177545A1

公开(公告)日：2005-08-11

申请号：US10776548

申请日：2004-02-11

申请人： Melissa Buco ,  Rong Chang ,  Laura Luan ,  Zon-Yin Shae ,  Christopher Ward ,  Joel Wolf ,  Philip Yu

发明人： Melissa Buco ,  Rong Chang ,  Laura Luan ,  Zon-Yin Shae ,  Christopher Ward ,  Joel Wolf ,  Philip Yu

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

CPC分类号： G06Q10/10

摘要： Techniques are provided for representing and managing data and associated relationships. In one aspect of the invention, a technique for managing data associated with a given domain comprises the following steps. A specification of data attributes representing one or more types of data to be managed is maintained. Further, a specification of algorithms representing one or more types of operations performable in accordance with the data attributes is maintained. Still further, a specification of relationships representing relationships between the data attributes and the algorithms is maintained. The data attribute specification, the algorithm specification and the relationship specification are maintained in a storage framework having multiple levels, the multiple levels being specified based on the given domain with which the data being managed is associated. The techniques may be provided in support of service level management. In such a domain, the present invention provides techniques for representing and managing service level agreement management data using a multi-level multi-ontology metadata store and extensible service level management framework.

摘要翻译： 提供技术来表示和管理数据和关联关系。 在本发明的一个方面，一种用于管理与给定域相关联的数据的技术包括以下步骤。 维护表示要管理的一种或多种类型的数据的数据属性的规范。 此外，保持表示根据数据属性可执行的一种或多种类型的操作的算法的规范。 此外，维持表示数据属性和算法之间的关系的关系的规范。 数据属性规范，算法规范和关系规范被保存在具有多个级别的存储框架中，所述多个级别是基于与被管理数据相关联的给定域来指定的。 可以提供技术来支持服务水平管理。 在这样的领域中，本发明提供了使用多级多本体元数据存储和可扩展服务级别管理框架来表示和管理服务级别协议管理数据的技术。

公开(公告)号：US20080005744A1

公开(公告)日：2008-01-03

申请号：US11767891

申请日：2007-06-25

申请人： Melissa Buco ,  Rong Chang ,  Laura Luna ,  Christopher Ward ,  Joel Wolf ,  Philip Yu

发明人： Melissa Buco ,  Rong Chang ,  Laura Luna ,  Christopher Ward ,  Joel Wolf ,  Philip 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.

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

公开(公告)号：US20070220219A1

公开(公告)日：2007-09-20

申请号：US11376322

申请日：2006-03-16

申请人： Nikhil Bansal ,  Frederick Douglis ,  Lisa Fleischer ,  Kirsten Hildrum ,  Akshay Kumar Katta ,  John Palmer ,  Elizabeth Richards ,  David Tao ,  William Tetzlaff ,  Joel Wolf ,  Philip Yu

发明人： Nikhil Bansal ,  Frederick Douglis ,  Lisa Fleischer ,  Kirsten Hildrum ,  Akshay Kumar Katta ,  John Palmer ,  Elizabeth Richards ,  David Tao ,  William Tetzlaff ,  Joel Wolf ,  Philip Yu

IPC分类号： G06F13/00

CPC分类号： H04L47/2433 ,  H04L47/2416 ,  H04L49/90 ,  H04L49/9084

摘要： A method (and system) of storing data in a value-based storage system, includes optimizing a value of data stored in the value-based storage system.

摘要翻译： 一种在基于值的存储系统中存储数据的方法（和系统）包括优化存储在基于价值的存储系统中的数据的值。

公开(公告)号：US20070230488A1

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

申请号：US11396502

申请日：2006-03-31

申请人： Philip Yu ,  Haixun Wang ,  Hao He

发明人： Philip Yu ,  Haixun Wang ,  Hao He

IPC分类号： H04L12/56

CPC分类号： H04L45/48 ,  H04L45/02

摘要： There is provided a method for determining reachability between any two nodes within a graph. The inventive method utilizes a dual-labeling scheme. Initially, a spanning tree is defined for a group of nodes within a graph. Each node in the spanning tree is assigned a unique interval-based label, that describes its dependency from an ancestor node. Non-tree labels are then assigned to each node in the spanning tree that is connected to another node in the spanning tree by a non-tree link. From these labels, reachability of any two nodes in the spanning tree is determined by using only the interval-based labels and the non-tree labels.

摘要翻译： 提供了一种用于确定图中任何两个节点之间的可达性的方法。 本发明的方法利用双标记方案。 最初，为图中的一组节点定义了生成树。 生成树中的每个节点都被分配一个唯一的基于间隔的标签，它描述了从祖先节点的依赖关系。 然后，非树标签被分配给生成树中通过非树形链接连接到生成树中的另一个节点的每个节点。 从这些标签中，生成树中任何两个节点的可达性通过仅使用基于间隔的标签和非树标签来确定。

公开(公告)号：US20070226212A1

公开(公告)日：2007-09-27

申请号：US11753232

申请日：2007-05-24

申请人： Charu Aggarwal ,  Philip Yu

发明人： Charu Aggarwal ,  Philip Yu

IPC分类号： G06F17/30

CPC分类号： G06K9/6284 ,  Y10S707/952

摘要： Techniques for monitoring abnormalities in a data stream are provided. A plurality of objects are received from the data stream and one or more clusters are created from these objects. At least a portion of the one or more clusters have statistical data of the respective cluster. It is determined from the statistical data whether one or more abnormalities exist in the data stream.

摘要翻译： 提供了用于监视数据流异常的技术。 从数据流接收多个对象，并从这些对象创建一个或多个聚类。 一个或多个集群的至少一部分具有相应集群的统计数据。 从统计数据确定数据流中是否存在一个或多个异常。

公开(公告)号：US20070118539A1

公开(公告)日：2007-05-24

申请号：US11283383

申请日：2005-11-18

申请人： Kirsten Hildrum ,  Philip Yu

发明人： Kirsten Hildrum ,  Philip Yu

IPC分类号： G06F7/00

CPC分类号： G06F17/30864 ,  G06Q10/10

摘要： Techniques for community discovery in a network are disclosed. For example, a technique for discovering a community around a given entity in an interaction graph, wherein nodes in the graph represent entities and edges connecting nodes in the graph represent interactions between connected nodes, comprises the following steps/operations. Nodes in the interaction graph are partitioned into different sets of nodes based on interaction information associated with each node to minimize a number of interaction pairs that need to be considered. An objective function is minimized by moving entities between the different sets such that the community is discovered once a measure associated with the objective function is minimized.

摘要翻译： 公布了网络中社区发现的技术。 例如，用于在交互图中发现给定实体周围的社区的技术，其中图中的节点表示连接图中的节点的实体和边表示连接的节点之间的交互，包括以下步骤/操作。 基于与每个节点相关联的交互信息将交互图中的节点划分成不同的节点集合，以最小化需要考虑的多个交互对。 通过在不同组之间移动实体来最小化目标函数，使得一旦与目标函数相关联的度量被最小化，则发现社区。

公开(公告)号：US20060184527A1

公开(公告)日：2006-08-17

申请号：US11058944

申请日：2005-02-16

申请人： Yun Chi ,  Haixun Wang ,  Philip Yu

发明人： Yun Chi ,  Haixun Wang ,  Philip Yu

IPC分类号： H04L27/28

CPC分类号： G06K9/6297 ,  H04L43/028

摘要： Load shedding schemes for mining data streams. A scoring function is used to rank the importance of stream elements, and those elements with high importance are investigated. In the context of not knowing the exact feature values of a data stream, the use of a Markov model is proposed herein for predicting the feature distribution of a data stream. Based on the predicted feature distribution, one can make classification decisions to maximize the expected benefits. In addition, there is proposed herein the employment of a quality of decision (QoD) metric to measure the level of uncertainty in decisions and to guide load shedding. A load shedding scheme such as presented herein assigns available resources to multiple data streams to maximize the quality of classification decisions. Furthermore, such a load shedding scheme is able to learn and adapt to changing data characteristics in the data streams.

公开(公告)号：US20060010093A1

公开(公告)日：2006-01-12

申请号：US10880913

申请日：2004-06-30

申请人： Wei Fan ,  Haixun Wang ,  Philip Yu

发明人： Wei Fan ,  Haixun Wang ,  Philip Yu

IPC分类号： G06F17/30

CPC分类号： G06F17/30017 ,  G06F2216/03 ,  Y10S707/99931 ,  Y10S707/99935

摘要： In connection with the mining of time-evolving data streams, a general framework that mines changes and reconstructs models from a data stream with unlabeled instances or a limited number of labeled instances. In particular, there are defined herein statistical profiling methods that extend a classification tree in order to guess the percentage of drifts in the data stream without any labelled data. Exact error can be estimated by actively sampling a small number of true labels. If the estimated error is significantly higher than empirical expectations, there preferably re-sampled a small number of true labels to reconstruct the decision tree from the leaf node level.

摘要翻译： 与挖掘时间不断变化的数据流有关的一般框架，即从具有未标记实例的数据流或有限数量的标记实例中挖掘变更和重建模型。 特别地，这里定义了扩展分类树的统计分析方法，以便在没有任何标记数据的情况下猜测数据流中漂移的百分比。 可以通过主动抽取少量真实标签来估计精确误差。 如果估计的误差明显高于经验期望值，则最好重新采样少量的真实标签，以从叶节点级别重建决策树。

公开(公告)号：US20050096841A1

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

申请号：US10700168

申请日：2003-11-03

申请人： Bugra Gedik ,  Kun-Lung Wu ,  Philip Yu

发明人： Bugra Gedik ,  Kun-Lung Wu ,  Philip Yu

IPC分类号： G01C21/00 ,  G01C21/26 ,  G06F17/30

CPC分类号： G06F17/30595 ,  G06F17/30333 ,  G06F17/30548 ,  Y10S707/99931 ,  Y10S707/99933

摘要： The present invention is directed to a system and a method for evaluating a plurality of moving queries over moving objects. The method, which can be embodied in a computer readable medium containing computer readable code, constructs motion-adaptive bounding boxes around the objects and queries and indexes the objects and queries based upon the bounding boxes. Predictive query results are used to optimize the evaluation of the moving queries. The bounding boxes vary in size and shape depending on the speed and motion direction of the objects and queries. The system of the present invention includes the moving objects and queries, each having an associated motion-adaptive bounding box. The system also provides for a monitoring system capable of monitoring the location and motion of the moving objects and moving queries and of evaluating the moving queries. The monitoring system includes a motion-adaptive query index and a motion-adaptive object index.

摘要翻译： 本发明涉及一种用于评估移动物体上的多个移动查询的系统和方法。 可以在包含计算机可读代码的计算机可读介质中实现的方法围绕对象构建运动自适应边界框，并基于边界框查询和索引对象和查询。 预测性查询结果用于优化移动查询的评估。 边框根据物体和查询的速度和运动方向而有所不同，大小和形状不同。 本发明的系统包括运动对象和查询，每个运动对象和查询具有相关联的运动自适应边界框。 该系统还提供了一种能够监测移动物体的位置和运动以及移动查询并评估移动查询的监视系统。 监控系统包括运动自适应查询索引和运动自适应对象索引。