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

1. 发明授权

US08862554B2 Methods and arrangements for prioritizing service restoration activities in the event of a catastrophic failure 有权
标题翻译：发生灾难性故障时优先处理服务恢复活动的方法和安排
公开(公告)号：US08862554B2
公开(公告)日：2014-10-14
申请号：US12952774
申请日：2010-11-23
申请人： Om Dadaji Deshmukh , Sameep Mehta , Vinayaka D. Pandit
发明人： Om Dadaji Deshmukh , Sameep Mehta , Vinayaka D. Pandit
IPC分类号： G06F17/30 , G06Q30/02
CPC分类号： G06Q30/02
摘要： Methods and arrangements for prioritizing customer service restoration, in the event of service failure or compromise such that any adverse effect of the service disruption on the customer is minimized, the perceived drop in quality of service, if any, is minimized and timely and efficient resource reallocation for service restoration is achieved. Input data relating to customer service protocols is assimilated. A service restoration order is implemented responsive to a service disruption and based on the assimilated input data. This implementing includes determining bufferable and non-bufferable services, postponing restoration of the bufferable services, and determining an order of priority of the non-bufferable services.
摘要翻译：优先考虑客户服务恢复的方法和安排，在服务失败或妥协的情况下，使得服务中断对客户的任何不利影响被最小化，服务质量下降（如果有的话）被最小化，及时有效的资源实现服务恢复重新分配。与客户服务协议有关的输入数据被同化。响应于服务中断并基于同化的输入数据来实现服务恢复顺序。该实现包括确定可缓冲和不可缓冲的服务，推迟可缓冲服务的恢复，以及确定不可缓冲服务的优先顺序。

2. 发明申请

US20120130957A1 METHODS AND ARRANGEMENTS FOR PRIORITIZING SERVICE RESTORATION ACTIVITIES IN THE EVENT OF A CATASTROPHIC FAILURE 有权
标题翻译：在事件发生的事件中优先服务恢复活动的方法和安排
公开(公告)号：US20120130957A1
公开(公告)日：2012-05-24
申请号：US12952774
申请日：2010-11-23
申请人： Om Dadaji Deshmukh , Sameep Mehta , Vinayaka D. Pandit
发明人： Om Dadaji Deshmukh , Sameep Mehta , Vinayaka D. Pandit
IPC分类号： G06F17/00
CPC分类号： G06Q30/02
摘要： Methods and arrangements for prioritizing customer service restoration, in the event of service failure or compromise such that any adverse effect of the service disruption on the customer is minimized, the perceived drop in quality of service, if any, is minimized and timely and efficient resource reallocation for service restoration is achieved. Input data relating to customer service protocols is assimilated. A service restoration order is implemented responsive to a service disruption and based on the assimilated input data. This implementing includes determining bufferable and non-bufferable services, postponing restoration of the bufferable services, and determining an order of priority of the non-bufferable services.
摘要翻译：优先考虑客户服务恢复的方法和安排，在服务失败或妥协的情况下，使得服务中断对客户的任何不利影响被最小化，服务质量下降（如果有的话）被最小化，及时有效的资源实现服务恢复重新分配。与客户服务协议有关的输入数据被同化。响应于服务中断并基于同化的输入数据来实现服务恢复顺序。该实现包括确定可缓冲和不可缓冲的服务，推迟可缓冲服务的恢复，以及确定不可缓冲服务的优先顺序。

3. 发明申请

US20090271240A1 METHOD AND SYSTEM FOR STRATEGIC HEADCOUNT PLANNING WITH OPERATIONAL TRANSITION MANAGEMENT OF WORKFORCE 审中-公开
标题翻译：用于运营人员过渡管理的策略性计划方法与系统
公开(公告)号：US20090271240A1
公开(公告)日：2009-10-29
申请号：US12110855
申请日：2008-04-28
申请人： Tarun Kumar , Sameep Mehta , Vinayaka D. Pandit , Gyana R. Parija , Anupam Saronwala , Rashmi Singh
发明人： Tarun Kumar , Sameep Mehta , Vinayaka D. Pandit , Gyana R. Parija , Anupam Saronwala , Rashmi Singh
IPC分类号： G06Q30/00 , G06F9/46
CPC分类号： G06Q10/06 , G06Q10/0631
摘要： A method and system are disclosed for planning a workforce headcount for a given business process. The method comprises the steps of providing as inputs, i) productivity ramp-ups to model the level of experience and to measure the performance of both new hires and current employees, and ii) industry/market attrition rates for employees; and performing an evaluation, using said inputs, of at least one given management objective. On the basis of this evaluation, a future hiring and transition plan is provided for the given business process for a defined period of time. In the preferred embodiment of the invention, uncertainty is associated with one or more of the inputs, and the future hiring and transition plan is provided by using stochastic programming to model the uncertainty associated with at least one of said one or more of the inputs.
摘要翻译：公开了一种方法和系统，用于规划给定业务流程的员工人数。该方法包括提供以下步骤：i）提高生产力以提高经验水平，并衡量新员工和现有员工的绩效，以及ii）员工的行业/市场流失率; 以及使用所述输入执行至少一个给定管理目标的评估。在此评估的基础上，为规定的业务流程规定了一段时间的未来招聘和过渡计划。在本发明的优选实施例中，不确定性与一个或多个输入相关联，并且通过使用随机程序来对与所述一个或多个输入中的至少一个相关联的不确定性进行建模来提供未来的招聘和转移计划。

4. 发明申请

US20100005173A1 Method, system and computer program product for server selection, application placement and consolidation 失效
标题翻译：方法，系统和计算机程序产品，用于服务器选择，应用程序放置和整合
公开(公告)号：US20100005173A1
公开(公告)日：2010-01-07
申请号：US12217439
申请日：2008-07-03
申请人： Ramesh Baskaran , Sameep Mehta , Anindya Neogi , Vinayaka D. Pandit , Gyana Ranjan Parija , Akshat Verma
发明人： Ramesh Baskaran , Sameep Mehta , Anindya Neogi , Vinayaka D. Pandit , Gyana Ranjan Parija , Akshat Verma
IPC分类号： G06F15/16
CPC分类号： G06F9/5066
摘要： A plurality of application profiles are obtained, for a plurality of applications. Each of the profiles specifies a list of resources, and requirements for each of the resources, associated with a corresponding one of the applications. Specification of a plurality of constraints associated with the applications is facilitated, as is obtaining a plurality of cost models associated with at least two different kinds of servers on which the applications are to run. A recommended server configuration is generated for running the applications, by formulating and solving a bin packing problem. Each of the at least two different kinds of servers is treated as a bin of a different size, based on its capacity, and has an acquisition cost associated therewith. The size is substantially equal to a corresponding one of the resource requirement as given by a corresponding one of the application profiles. Each of the applications is treated as an item, with an associated size, to be packed into the bins. The bin packing problem develops the recommended server configuration based on reducing a total acquisition cost while satisfying the constraints and the sizes of the applications.
摘要翻译：获得多个应用简档，用于多个应用。每个配置文件指定与相应应用程序相关联的资源列表和每个资源的要求。促进与应用相关联的多个约束的规范，以及获得与要在其上运行应用的至少两种不同类型的服务器相关联的多个成本模型。生成用于运行应用程序的推荐的服务器配置，通过制定和解决垃圾箱打包问题。至少两种不同类型的服务器中的每一种基于其容量被视为不同尺寸的箱，并且具有与其相关联的购置成本。该大小基本上等于由相应的一个应用简档给出的资源需求中相应的一个。每个应用程序都被视为具有相关尺寸的项目，以将其打包到箱中。垃圾箱打包问题在满足约束和应用程序的大小的基础上，降低了总采购成本，从而开发了推荐的服务器配置。

5. 发明授权

US09864634B2 Enhancing initial resource allocation management to provide robust reconfiguration 有权
公开(公告)号：US09864634B2
公开(公告)日：2018-01-09
申请号：US13366438
申请日：2012-02-06
申请人： Sreyash D. Kenkre , Sameep Mehta , Krishnasuri Narayanam , Vinayaka D. Pandit , Soujanya Soni
发明人： Sreyash D. Kenkre , Sameep Mehta , Krishnasuri Narayanam , Vinayaka D. Pandit , Soujanya Soni
IPC分类号： G06F15/177 , G06F9/50
CPC分类号： G06F9/50
摘要： A description of a resource associated with a service of an entity can be captured. The service can be associated with one or more resources, a constraint, and a demand. The resource can be associated with one or more characteristics including a utility, a limited availability, and a consumption rate. The entity can be an organization or a system. An initial allocation problem associated with the resource can be formulated as a two phase problem. The first phase can be an optimization problem and the second phase can be a restricted allocation problem. The initial allocation problem can be associated with reconfiguring a previously established allocation of a baseline scenario. The optimization problem can be solved optimally or approximately to establish a favorable allocation. The favorable allocation can minimizes the reconfiguration cost of the reconfiguring. The baseline scenario can be a normal operation of the service.

6. 发明申请

US20100205039A1 DEMAND FORECASTING 审中-公开
标题翻译：需求预测
公开(公告)号：US20100205039A1
公开(公告)日：2010-08-12
申请号：US12369418
申请日：2009-02-11
申请人： Jayanta Basak , Sameep Mehta , Vinayaka D. Pandit , Gyana Ranjan Parija
发明人： Jayanta Basak , Sameep Mehta , Vinayaka D. Pandit , Gyana Ranjan Parija
IPC分类号： G06Q10/00
CPC分类号： G06Q10/04 , G06Q30/0202
摘要： At least a first future external event is obtained as input. At least one future effect of the at least one future external event is predicted. The at least first future external event is similar to at least a first past external event. Future utilization of at least one tangible resource is forecast by superimposing events-normalized forecasted data and the at least one predicted future effect of the at least one future event similar to the at least first past external event.
摘要翻译：至少获得第一个未来的外部事件作为输入。预测至少一个未来的外部事件的至少一个未来的影响。至少第一个未来的外部事件类似于至少第一个以前的外部事件。至少一个有形资源的未来利用是通过叠加事件 - 归一化的预测数据和至少一个未来事件的至少一个预测未来的影响来预测的，类似于至少第一过去的外部事件。

7. 发明授权

US08843936B2 Automatically identifying critical resources of an organization 有权
标题翻译：自动识别组织的关键资源
公开(公告)号：US08843936B2
公开(公告)日：2014-09-23
申请号：US13483492
申请日：2012-05-30
申请人： Sreyash D. Kenkre , Sameep Mehta , Krishnasuri Narayanam , Vinayaka D. Pandit
发明人： Sreyash D. Kenkre , Sameep Mehta , Krishnasuri Narayanam , Vinayaka D. Pandit
IPC分类号： G06F9/46 , G06Q10/00
CPC分类号： G06Q10/087 , G06Q10/06313
摘要： A method and associated systems for automatically identifying critical resources in an organization. An organization creates a model of the dependencies between pairs of resource instances, wherein that model describes how the organization's projects and services are affected when a resource instance becomes unavailable. This model may be represented as a system of directed graphs. This model may be used to automatically identify a resource instance as “critical” when excessive cost is required to resume all projects and services rendered infeasible by the disruption of that resource instance. This model may also be used to automatically identify a resource instance as “critical for a resource type” when disruption of the resource instance forces the capacity of the resource type available to the entire organization to fall below a threshold value.
摘要翻译：用于自动识别组织中关键资源的方法和相关系统。组织创建资源实例对之间的依赖关系的模型，其中该模型描述了当资源实例变得不可用时组织的项目和服务如何受到影响。该模型可以表示为有向图的系统。当需要过多的成本来恢复由于该资源实例中断而导致的不可行的所有项目和服务时，该模型可用于将资源实例自动识别为“关键”。当中断资源实例时，该模型也可用于将资源实例自动标识为“对资源类型至关重要”，从而强制整个组织可用的资源类型的容量低于阈值。

8. 发明申请

US20130326531A1 AUTOMATICALLY IDENTIFYING CRITICAL RESOURCES OF AN ORGANIZATION 有权
标题翻译：自动识别组织的关键资源
公开(公告)号：US20130326531A1
公开(公告)日：2013-12-05
申请号：US13483492
申请日：2012-05-30
申请人： Sreyash D. Kenkre , Sameep Mehta , Krishnasuri Narayanam , Vinayaka D. Pandit
发明人： Sreyash D. Kenkre , Sameep Mehta , Krishnasuri Narayanam , Vinayaka D. Pandit
IPC分类号： G06F9/46
CPC分类号： G06Q10/087 , G06Q10/06313
摘要： A method and associated systems for automatically identifying critical resources in an organization. An organization creates a model of the dependencies between pairs of resource instances, wherein that model describes how the organization's projects and services are affected when a resource instance becomes unavailable. This model may be represented as a system of directed graphs. This model may be used to automatically identify a resource instance as “critical” when excessive cost is required to resume all projects and services rendered infeasible by the disruption of that resource instance. This model may also be used to automatically identify a resource instance as “critical for a resource type” when disruption of the resource instance forces the capacity of the resource type available to the entire organization to fall below a threshold value.
摘要翻译：用于自动识别组织中关键资源的方法和相关系统。组织创建资源实例对之间的依赖关系的模型，其中该模型描述了当资源实例变得不可用时组织的项目和服务如何受到影响。该模型可以表示为有向图的系统。当需要过多的成本来恢复由于该资源实例中断而导致的不可行的所有项目和服务时，该模型可用于将资源实例自动识别为“关键”。当中断资源实例时，该模型也可用于将资源实例自动标识为“对资源类型至关重要”，从而强制整个组织可用的资源类型的容量低于阈值。

9. 发明授权

US08244873B2 Method, system and computer program product for server selection, application placement and consolidation planning of information technology systems 失效
标题翻译：方法，系统和计算机程序产品，用于信息技术系统的服务器选择，应用程序布局和整合规划
公开(公告)号：US08244873B2
公开(公告)日：2012-08-14
申请号：US13041939
申请日：2011-03-07
申请人： Ramesh Baskaran , Sameep Mehta , Anindya Neogi , Vinayaka D. Pandit , Gyana Ranjan Parija , Akshat Verma
发明人： Ramesh Baskaran , Sameep Mehta , Anindya Neogi , Vinayaka D. Pandit , Gyana Ranjan Parija , Akshat Verma
IPC分类号： G06F15/16
CPC分类号： G06F9/5066
摘要： A plurality of application profiles are obtained, for a plurality of applications. Each of the profiles specifies a list of resources, and requirements for each of the resources, associated with a corresponding one of the applications. Specification of a plurality of constraints associated with the applications is facilitated, as is obtaining a plurality of cost models associated with at least two different kinds of servers on which the applications are to run. A recommended server configuration is generated for running the applications, by formulating and solving a bin packing problem. Each of the at least two different kinds of servers is treated as a bin of a different size, based on its capacity, and has an acquisition cost associated therewith. The size is substantially equal to a corresponding one of the resource requirement as given by a corresponding one of the application profiles. Each of the applications is treated as an item, with an associated size, to be packed into the bins. The bin packing problem develops the recommended server configuration based on reducing a total acquisition cost while satisfying the constraints and the sizes of the applications.
摘要翻译：获得多个应用简档，用于多个应用。每个配置文件指定与相应应用程序相关联的资源列表和每个资源的要求。促进与应用相关联的多个约束的规范，以及获得与要在其上运行应用的至少两种不同类型的服务器相关联的多个成本模型。生成用于运行应用程序的推荐的服务器配置，通过制定和解决垃圾箱打包问题。至少两种不同类型的服务器中的每一种基于其容量被视为不同尺寸的箱，并且具有与其相关联的购置成本。该大小基本上等于由相应的一个应用简档给出的资源需求中相应的一个。每个应用程序都被视为具有相关尺寸的项目，以将其打包到箱中。垃圾箱打包问题在满足约束和应用程序的大小的基础上，降低了总采购成本，从而开发了推荐的服务器配置。

10. 发明申请

US20110161470A1 Method, System and Computer Program Product for Server Selection, Application Placement and Consolidation Planning of Information Technology Systems 失效
标题翻译：信息技术系统服务器选择，应用放置和整合规划的方法，系统和计算机程序产品
公开(公告)号：US20110161470A1
公开(公告)日：2011-06-30
申请号：US13041939
申请日：2011-03-07
申请人： Ramesh Baskaran , Sameep Mehta , Anindya Neogi , Vinayaka D. Pandit , Gyana Ranjan Parija , Akshat Verma
发明人： Ramesh Baskaran , Sameep Mehta , Anindya Neogi , Vinayaka D. Pandit , Gyana Ranjan Parija , Akshat Verma
IPC分类号： G06F15/177
CPC分类号： G06F9/5066
摘要： A plurality of application profiles are obtained, for a plurality of applications. Each of the profiles specifies a list of resources, and requirements for each of the resources, associated with a corresponding one of the applications. Specification of a plurality of constraints associated with the applications is facilitated, as is obtaining a plurality of cost models associated with at least two different kinds of servers on which the applications are to run. A recommended server configuration is generated for running the applications, by formulating and solving a bin packing problem. Each of the at least two different kinds of servers is treated as a bin of a different size, based on its capacity, and has an acquisition cost associated therewith. The size is substantially equal to a corresponding one of the resource requirement as given by a corresponding one of the application profiles. Each of the applications is treated as an item, with an associated size, to be packed into the bins. The bin packing problem develops the recommended server configuration based on reducing a total acquisition cost while satisfying the constraints and the sizes of the applications.
摘要翻译：获得多个应用简档，用于多个应用。每个配置文件指定与相应应用程序相关联的资源列表和每个资源的要求。促进与应用相关联的多个约束的规范，以及获得与要在其上运行应用的至少两种不同类型的服务器相关联的多个成本模型。生成用于运行应用程序的推荐的服务器配置，通过制定和解决垃圾箱打包问题。至少两种不同类型的服务器中的每一种基于其容量被视为不同尺寸的箱，并且具有与其相关联的购置成本。该大小基本上等于由相应的一个应用简档给出的资源需求中相应的一个。每个应用程序都被视为具有相关尺寸的项目，以将其打包到箱中。垃圾箱打包问题在满足约束和应用程序的大小的基础上，降低了总采购成本，从而开发了推荐的服务器配置。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式