专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

11. 发明申请

US20120144403A1 System and method for gathering context parameters to determine a mobile user context 有权
标题翻译：用于收集上下文参数以确定移动用户上下文的系统和方法
公开(公告)号：US20120144403A1
公开(公告)日：2012-06-07
申请号：US13268082
申请日：2011-10-07
申请人： Vahit Hakan Hacigumus , Jagan Sankaranarayanan , Junichi Tatemura
发明人： Vahit Hakan Hacigumus , Jagan Sankaranarayanan , Junichi Tatemura
IPC分类号： G06F9/46
CPC分类号： G06F9/544 , G06F9/5072
摘要： A system and method for data sharing are provided. Context parameters associated with a user are gathered from a plurality of applications. A mobile context of the user is determined based on the gathered context parameters. Content is presented to the user in accordance with the mobile context of the user.
摘要翻译：提供了一种用于数据共享的系统和方法。从多个应用程序收集与用户相关联的上下文参数。基于收集的上下文参数来确定用户的移动上下文。内容根据用户的移动上下文呈现给用户。

12. 发明申请

US20120066020A1 MULTI-TENANT DATABASE MANAGEMENT FOR SLA PROFIT MAXIMIZATION 有权
标题翻译：用于SLA利润最大化的多重数据库管理
公开(公告)号：US20120066020A1
公开(公告)日：2012-03-15
申请号：US12985057
申请日：2011-01-05
申请人： Hyun Jin Moon , Shenoda Guirguis , Yun Chi , Junichi Tatemura , Vahit Hakan Hacigumus
发明人： Hyun Jin Moon , Shenoda Guirguis , Yun Chi , Junichi Tatemura , Vahit Hakan Hacigumus
IPC分类号： G06Q10/00
CPC分类号： G06Q10/10 , G06Q10/0635
摘要： Systems and methods are disclosed to consolidate workload on cloud-based computers by co-locating one or more high-penalty tenants on one or more cloud-based servers; reducing service level agreement (SLA) violations by over-provisioning the cloud-based server; and maximizing an SLA profit.
摘要翻译：公开了系统和方法，以通过在一个或多个基于云的服务器上共同定位一个或多个高罚款租户来整合基于云计算机的工作量; 通过过度配置基于云的服务器来降低服务级别协议（SLA）违规; 并最大化SLA利润。

13. 发明申请

US20110087701A1 SYSTEM, METHOD, AND APPARATUS FOR PAIRING A SHORT DOCUMENT TO ANOTHER SHORT DOCUMENT FROM A PLURALITY OF SHORT DOCUMENTS 审中-公开
标题翻译：从少量短文件中将短文文件与另一份短文件配对的系统，方法和装置
公开(公告)号：US20110087701A1
公开(公告)日：2011-04-14
申请号：US12576959
申请日：2009-10-09
申请人： Greg Eyres , Vahit Hakan Hacigumus , Tobin J. Lehman , H. Raymond Strong, JR.
发明人： Greg Eyres , Vahit Hakan Hacigumus , Tobin J. Lehman , H. Raymond Strong, JR.
IPC分类号： G06F17/30
CPC分类号： G06F17/3069 , G06F17/30011 , G06F17/30705
摘要： A computer-implemented method for pairing a new document to a document from a plurality of documents. Embodiments include, for each of the new document and the plurality of documents, generating a vector of terms of interest uniquely associated with a document of the new document and the plurality of documents. For each term of interest, an associated element value of the vector is assigned as zero if the term of interest does not occur in the document and one otherwise. The method also includes, for each document from the plurality of documents, determining a similarity between the vectors. The method also includes selecting a document from the plurality of documents as related to the new document if the similarity between the vector for the new document and the vector for the document from the plurality of documents is greater than or equal to a threshold value.
摘要翻译：一种用于将新文档与多个文档配对到文档的计算机实现的方法。实施例包括对于新文档和多个文档中的每一个，生成与新文档和多个文档的文档唯一相关联的感兴趣的条款向量。对于每个感兴趣的术语，如果在文档中不出现感兴趣的术语，否则将向量的相关元素值分配为零。对于来自多个文档的每个文档，该方法还包括确定向量之间的相似性。如果新文档的向量与来自多个文档的文档的向量之间的相似度大于或等于阈值，则该方法还包括从与多个文档相关的多个文档中选择文档。

14. 发明申请

US20080195441A1 OPTIMAL GROUP OF SERVICE COMPOSITIONS 审中-公开
标题翻译：最优服务组合
公开(公告)号：US20080195441A1
公开(公告)日：2008-08-14
申请号：US12060951
申请日：2008-04-02
申请人： Vahit Hakan Hacigumus
发明人： Vahit Hakan Hacigumus
IPC分类号： G06Q10/00
CPC分类号： G06Q30/02 , G06Q10/063 , G06Q10/06375
摘要： A method and system for forming service compositions to provide service components to business processes. Service components independently needed by each business process are identified. At least one of the service components is needed by at least two business processes. At least two different service components are needed by at least one business process. At least two service compositions are specified. Each service composition includes at least one service component. At least one service composition comprises at least two service components. An optimal subset of the service compositions is ascertained, such that the total cost of deploying the service compositions in the optimal subset to provide the service components independently needed by each business process does not exceed the total cost of deploying the service compositions in any other subset of the service compositions to provide the service components independently needed by each business process.
摘要翻译：一种用于形成服务组合以向业务流程提供服务组件的方法和系统。确定每个业务流程独立需要的服务组件。至少有两个业务流程需要至少一个服务组件。至少有一个业务流程需要至少两个不同的服务组件。指定至少两种服务组合物。每个服务组合包括至少一个服务组件。至少一个服务组合包括至少两个服务组件。确定服务组合的最佳子集，使得在最佳子集中部署服务组合以提供每个业务过程独立需要的服务组件的总成本不超过在任何其他子集中部署服务组合的总成本的服务组合来提供每个业务流程独立需要的服务组件。

15. 发明授权

US08776076B2 Highly scalable cost based SLA-aware scheduling for cloud services 有权
标题翻译：针对云服务的高度可扩展的基于成本的SLA感知调度
公开(公告)号：US08776076B2
公开(公告)日：2014-07-08
申请号：US12985038
申请日：2011-01-05
申请人： Yun Chi , Hyun Jin Moon , Vahit Hakan Hacigumus
发明人： Yun Chi , Hyun Jin Moon , Vahit Hakan Hacigumus
IPC分类号： G06F9/46 , G06F15/173 , G06Q50/10 , G06Q30/02 , G06Q10/06
CPC分类号： G06Q50/10 , G06Q10/0631 , G06Q30/0283
摘要： An efficient cost-based scheduling method called incremental cost-based scheduling, iCBS, maps each job, based on its arrival time and SLA function, to a fixed point in the dual space of linear functions. Due to this mapping, in the dual space, the job will not change their locations over time. Instead, at the time of selecting the next job with the highest priority to execute, a line with appropriate angle in the query space is used to locate the current job with the highest CBS score in logarithmic time. Because only those points that are located on the convex hull in the dual space can be chosen, a dynamic convex hull maintaining method incrementally maintains the job with the highest CBS score over time.
摘要翻译：基于成本的有效调度方法称为增量成本调度，iCBS将每个作业的到达时间和SLA功能映射到线性函数的双重空间中的一个固定点。由于这种映射，在双重空间中，作业将不会随着时间而改变其位置。相反，在选择执行最高优先级的下一个作业时，在查询空间中具有适当角度的行用于以对数时间定位具有最高CBS分数的当前作业。因为只能选择位于双重空间中的凸包上的那些点，所以动态凸包维持方法随着时间的推移逐渐维持CBS得分最高的作业。

16. 发明授权

US08380557B2 Multi-tenant database management for service level agreement (SLA) profit maximization 有权
标题翻译：多租户数据库管理服务水平协议（SLA）的利润最大化
公开(公告)号：US08380557B2
公开(公告)日：2013-02-19
申请号：US12985057
申请日：2011-01-05
申请人： Hyun Jin Moon , Junichi Tatemura , Vahit Hakan Hacigumus , Shenoda Guirguis , Yun Chi
发明人： Hyun Jin Moon , Junichi Tatemura , Vahit Hakan Hacigumus , Shenoda Guirguis , Yun Chi
IPC分类号： G06Q10/00
CPC分类号： G06Q10/10 , G06Q10/0635
摘要： Systems and methods are disclosed to consolidate workload on cloud-based computers by co-locating one or more high-penalty tenants on one or more cloud-based servers; reducing service level agreement (SLA) violations by over-provisioning the cloud-based server; and maximizing an SLA profit.
摘要翻译：公开了系统和方法，以通过在一个或多个基于云的服务器上共同定位一个或多个高罚款租户来整合基于云计算机的工作量; 通过过度配置基于云的服务器来降低服务级别协议（SLA）违规; 并最大化SLA利润。

17. 发明申请

US20110219031A1 SYSTEMS AND METHODS FOR SLA-AWARE SCHEDULING IN CLOUD COMPUTING 有权
标题翻译：云计算中SLA-AWARE调度的系统和方法
公开(公告)号：US20110219031A1
公开(公告)日：2011-09-08
申请号：US12818155
申请日：2010-06-18
申请人： Yun Chi , Hyun Jin Mun , Vahit Hakan Hacigumus , Junichi Tatemura
发明人： Yun Chi , Hyun Jin Mun , Vahit Hakan Hacigumus , Junichi Tatemura
IPC分类号： G06F17/30
CPC分类号： G06F17/30
摘要： Systems and methods are disclosed for scheduling one or more queries for execution with one or more cloud computers by applying a service level agreement (SLA) analysis using an SLA-tree data structure to each query in a query queue; using the SLA-tree data structure to determine an overall profit in the query queue; and generating a profit-oriented schedule to select the next query for execution by the cloud computers.
摘要翻译：公开了系统和方法，用于通过使用SLA树数据结构对查询队列中的每个查询应用服务水平协议（SLA）分析来调度用于一个或多个云计算机执行的一个或多个查询; 使用SLA树数据结构来确定查询队列中的整体利润; 并产生利润导向的时间表，以选择下一个查询以供云计算机执行。

18. 发明申请

US20110173038A1 CONSTRAINT-CONSCIOUS OPTIMAL SCHEDULING FOR CLOUD INFRASTRUCTURES 有权
标题翻译：用于云基础设施的约束优化调度
公开(公告)号：US20110173038A1
公开(公告)日：2011-07-14
申请号：US12818514
申请日：2010-06-18
申请人： Hyun Jin Moon , Vahit Hakan Hacigumus , Yun Chi
发明人： Hyun Jin Moon , Vahit Hakan Hacigumus , Yun Chi
IPC分类号： G06Q10/00 , G06Q50/00
CPC分类号： G06F9/5072 , G06F2209/506 , G06Q10/0631 , G06Q10/103
摘要： Systems and methods are disclosed to schedule jobs in a cloud computing infrastructure by receiving in a first queue jobs with deadlines or constraints specified in a hard service level agreement (SLA); receiving in a second queue jobs with a penalty cost metric specified in a soft SLA; and minimizing both constraint violation count and total penalty cost in the cloud computing infrastructure by identifying jobs with deadlines in the first queue and delaying jobs in the first queue within a predetermined slack range in favor of jobs in the second queue to improve the penalty cost metric.
摘要翻译：公开了系统和方法，以通过在硬服务级别协议（SLA）中指定的期限或约束的第一队列作业中接收来调度云计算基础设施中的作业; 在软SLA中指定的惩罚成本度量在第二队列中接收作业; 并且通过在第一队列中识别具有最后期限的作业并且在预定的松弛范围内延迟第一队列中的作业，有利于第二队列中的作业以改善惩罚成本度量，来最小化云计算基础设施中的约束违规计数和总惩罚成本。

19. 发明申请

US20080004923A1 OPTIMAL GROUP OF SERVICE COMPOSITIONS 失效
公开(公告)号：US20080004923A1
公开(公告)日：2008-01-03
申请号：US11427115
申请日：2006-06-28
申请人： Vahit Hakan Hacigumus
发明人： Vahit Hakan Hacigumus
IPC分类号： G06F17/50
CPC分类号： G06Q30/02 , G06Q10/063 , G06Q10/06375
摘要： A method and system for forming service compositions to provide service components to business processes. Service components independently needed by each business process are identified. At least one of the service components is needed by at least two business processes. At least two different service components are needed by at least one business process. At least two service compositions are specified. Each service composition includes at least one service component. At least one service composition comprises at least two service components. An optimal subset of the service compositions is ascertained, such that the total cost of deploying the service compositions in the optimal subset to provide the service components independently needed by each business process does not exceed the total cost of deploying the service compositions in any other subset of the service compositions to provide the service components independently needed by each business process.

20. 发明授权

US10083229B2 System, method, and apparatus for pairing a short document to another short document from a plurality of short documents 有权
公开(公告)号：US10083229B2
公开(公告)日：2018-09-25
申请号：US12576959
申请日：2009-10-09
申请人： Greg Eyres , Vahit Hakan Hacigumus , Tobin J. Lehman , H. Raymond Strong, Jr.
发明人： Greg Eyres , Vahit Hakan Hacigumus , Tobin J. Lehman , H. Raymond Strong, Jr.
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F16/3347 , G06F16/35 , G06F16/93
摘要： A computer-implemented method for pairing a new document to a document from a plurality of documents. Embodiments include, for each of the new document and the plurality of documents, generating a vector of terms of interest uniquely associated with a document of the new document and the plurality of documents. For each term of interest, an associated element value of the vector is assigned as zero if the term of interest does not occur in the document and one otherwise. The method also includes, for each document from the plurality of documents, determining a similarity between the vectors. The method also includes selecting a document from the plurality of documents as related to the new document if the similarity between the vector for the new document and the vector for the document from the plurality of documents is greater than or equal to a threshold value.

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式