| Patent application number | Description | Published |
|---|
| 20090141028 | METHOD TO PREDICT EDGES IN A NON-CUMULATIVE GRAPH - To predict edges in a non-cumulative graph, based on a sequence of non-cumulative previous occurrences of the graph, the sequence of non-cumulative previous occurrences of the graph is obtained, and topological properties of each of the previous occurrences of the graph are extracted. Topological similarities between each of the previous occurrences of the graph are computed based on the topological properties. The edges of the graph are predicted by computing a score for each possible edge of the graph, based upon the topological similarities. | 06-04-2009 |
| 20090144032 | SYSTEM AND COMPUTER PROGRAM PRODUCT TO PREDICT EDGES IN A NON-CUMULATIVE GRAPH - To predict edges in a non-cumulative graph, based on a sequence of non-cumulative previous occurrences of the graph, the sequence of non-cumulative previous occurrences of the graph is obtained, and topological properties of each of the previous occurrences of the graph are extracted. Topological similarities between each of the previous occurrences of the graph are computed based on the topological properties. The edges of the graph are predicted by computing a score for each possible edge of the graph, based upon the topological similarities. | 06-04-2009 |
| 20090271240 | METHOD AND SYSTEM FOR STRATEGIC HEADCOUNT PLANNING WITH OPERATIONAL TRANSITION MANAGEMENT OF WORKFORCE - 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. | 10-29-2009 |
| 20100005173 | Method, system and computer program product for server selection, application placement and consolidation - 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. | 01-07-2010 |
| 20100036690 | SERVICE SCHEDULING - Techniques for scheduling one or more services are provided. The techniques include obtaining customer information, obtaining one or more service characteristics for each of the one or more services, and using the customer information and the one or more service characteristics to schedule the one or more services. | 02-11-2010 |
| 20100205039 | DEMAND FORECASTING - 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. | 08-12-2010 |
| 20110161470 | Method, System and Computer Program Product for Server Selection, Application Placement and Consolidation Planning of Information Technology Systems - 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. | 06-30-2011 |
