Patent application number | Description | Published |
20100305986 | Using Service Exposure Criteria - Techniques for performing service exposure for reuse of one or more services are provided. The techniques include analyzing applicability of service criteria for a candidate service, identifying one or more services that are contextually-related to the candidate service, and using the service criteria applicable to the candidate service to expose the one or more services contextually-related to the candidate service. | 12-02-2010 |
20120016701 | INTELLIGENT TIMESHEET ASSISTANCE - A timesheet assistant mines development items in a repository of a computer to form identified development items. Development context information and effort indicators, associated with the identified development items, are extracted. Statistical analysis is applied to tasks of the identified development items using the effort indicators. Efforts expended on the tasks are predicted using historical data to create effort estimates. Developer reported efforts for the identified items are received, and a timesheet is generated using the development context information, the effort estimates and the developer reported effort. The timesheet is presented for review, verification, and approval. | 01-19-2012 |
20120072227 | AUTOMATICALLY GENERATING HIGH QUALITY SOA DESIGN FROM BUSINESS PROCESS MAPS BASED ON SPECIFIED QUALITY GOALS - Methods and systems for automatically generating a service oriented architecture (SOA) design. A set of business process maps for the domain under consideration is defined and a design quality goal (function) that should be met (optimized) is specified. The design goal/function involves SOA metrics like coupling, cohesion, granularity, etc., which the system under consideration is pre-programmed to compute on any SOA design. The system takes as input the set of business process maps and the design quality goal/functions. It first generates semantic business process maps by identifying key concepts that occur in the task and business item descriptions. Next, it efficiently searches the service design space by starting with a seed design and employing a sequence of moves to iteratively optimize it. It outputs a set of possible SOA designs that meet the specified quality goals or optimizes the specified function, from where a user may select the final design. | 03-22-2012 |
20120174057 | INTELLIGENT TIMESHEET ASSISTANCE - A timesheet assistant mines development items in a repository of a computer to form identified development items. Development context information and effort indicators, associated with the identified development items, are extracted. Statistical analysis is applied to tasks of the identified development items using the effort indicators. Efforts expended on the tasks are predicted using historical data to create effort estimates. Developer reported efforts for the identified items are received, and a timesheet is generated using the development context information, the effort estimates and the developer reported effort. The timesheet is presented for review, verification, and approval. | 07-05-2012 |
20120284073 | OPTIMIZED COLLABORATION BETWEEN DISTRIBUTED CENTERS OF GLOBAL SERVICE DELIVERY SYSTEMS - A computer implemented method, system, and/or computer program product facilitate optimal collaboration between cells from different service centers for delivering a service to a customer. A cost of collaboration between two cells in different service centers is defined. Each of the two cells is a group of resources capable of executing a same task, and the cost is a 3-Tuple that consists of a monetary cost, a makespan cost, and a skill misalignment cost associated with the collaboration. After establishing acceptable cost ranges for the 3-Tuple based on constraints defined by an enterprise policy, a processor creates multiple collaboration matrices based on different permutations of the 3-Tuple. Once an optimal collaboration function derived from the multiple collaboration matrices is identified, the task is assigned to two optimal cells identified in the optimal collaboration function. | 11-08-2012 |
20120284076 | OPTIMIZING SERVICE DELIVERY SYSTEMS - A computer implemented method, system and/or computer program product optimizes a service delivery system. A processor receives a first set of inputs that describes a current state of a service delivery system and a second set of inputs that describes a cost overhead for the service delivery system. The processor then optimizes the service delivery system in order to derive an optimized service delivery system. | 11-08-2012 |
20120284078 | TOOL FOR MANAGER ASSISTANCE - A computer implemented method, system, and/or computer program product generate an optimal training policy and an optimal promotion policy to accommodate an upcoming project. Required new job positions are identified for an upcoming project. A skillset matrix, which describes a current skill level of each worker in a work unit, and a promotion matrix, which describes historical evaluations of how well each worker achieved predefined goals of past projects, are generated. The skillset matrix is utilized to create an optimal training policy that identifies which workers are in need of additional training in order to qualify for one or more of the identified new job positions, and the promotion matrix is utilized create an optimal promotion policy that identifies which workers will be candidates for being promoted into one or more of the identified said new job positions. | 11-08-2012 |
20120316912 | OPTIMIZING A SHARED SERVICE DELIVERY SYSTEM - A computer implemented method, system, and/or computer program product optimize a shared service delivery system. A model of an existing shared service delivery system is created. Capacity of the existing shared service delivery system is defined according to required resources for existing projects, new projects, and proposed projects. Existing cells of practitioners in the existing shared service delivery system are identified, and any gaps or gluts of capacity in the existing cells of practitioners are identified according to a general predetermined resource requirement for the shared service delivery system. | 12-13-2012 |
20130054291 | DETERMINING RELATIVE CRITICALITY OF SERVICE TICKETS IN FACTORY-STYLE SHARED DELIVERY - Described herein are methods, systems, apparatuses and products for determining relative criticality of service tickets in factory-style shared delivery. An aspect provides for accessing ticket information, accessing service level agreement information, accessing future volume estimation information, estimating a number of missed service level objectives that are permissible without having a service level agreement breach; and determining a criticality of at least one received ticket based on said ticket information, said service level agreement information, and said future volume estimation information. Other embodiments are disclosed. | 02-28-2013 |
20130054292 | DETERMINING RELATIVE CRITICALITY OF SERVICE TICKETS IN FACTORY-STYLE SHARED DELIVERY - Described herein are methods, systems, apparatuses and products for determining relative criticality of service tickets in factory-style shared delivery. An aspect provides for accessing ticket information, accessing service level agreement information, accessing future volume estimation information, estimating a number of missed service level objectives that are permissible without having a service level agreement breach; and determining a criticality of at least one received ticket based on said ticket information, said service level agreement information, and said future volume estimation information. Other embodiments are disclosed. | 02-28-2013 |
20130191186 | SYSTEM, METHOD AND COMPUTER PROGRAM FOR CAPTURING RELATIONSHIPS BETWEEN BUSINESS OUTCOMES, PERSONS AND TECHNICAL ASSETS - A method includes building a library of service value maps (SVMs) each including a multi-layered hierarchical arrangement of elements with causal links between at least some elements of a particular layer and at least some elements of next higher layer. Each SVM includes at a topmost layer at least one desired outcome for an entity associated with the SVM, at a next lower layer capabilities that support the at least one desired outcome and, for each identified capability, at a next lower layer organization solution assets that support the capabilities. The identified solution assets and components are mapped to infrastructure elements in a lower-most layer. The method further includes assigning weights to the links between elements of a particular layer and elements of a next higher layer, where each weight has a value to indicate a contribution of an associated element to a linked-to element in the next higher layer. | 07-25-2013 |
20130191187 | SYSTEM, METHOD AND COMPUTER PROGRAM FOR IDENTIFYING VALUE AGGREGATION POINTS FROM A SET OF SERVICE VALUE MAPS - A method provides a set of service value maps (SVMs) each having a plurality of nodes and linkages between nodes; forming a network model based on the set of SVMs and analyzing the network model to compute aggregate values for the nodes to enable an identification of a node that matches at least one criterion. Analyzing can include using a degree centrality process where a value for each node is defined as a number of outgoing edges from the node, or an eigenvalue centrality process where a value of a node is proportional to a value of those nodes that the node is connected to. Each SVM can be represented as a directed acyclic graph (DAG) where each edge between nodes is an edge in the DAG. The at least one criterion can include a highest valued node identifying a value aggregation point (VAP) of the set of SVMs. | 07-25-2013 |
20140207528 | SYSTEM, METHOD AND COMPUTER PROGRAM FOR IDENTIFYING VALUE AGGREGATION POINTS FROM A SET OF SERVICE VALUE MAPS - A data processing system provides a set of service value maps (SVMs) each having a plurality of nodes and linkages between nodes, forms a network model based on the SVMs and analyses the network model to compute aggregate values for the nodes to enable an identification of a node that matches at least one criterion. Analyzing can include using a degree centrality process where a value for each node is defined as a number of outgoing edges from the node, or an eigenvalue centrality process where a value of a node is proportional to a value of those nodes that the node is connected to. Each SVM can be represented as a directed acyclic graph (DAG) where each edge between nodes is an edge in the DAG. The at least one criterion can include a highest valued node identifying a value aggregation point (VAP) of the set of SVMs. | 07-24-2014 |
20140297831 | CONTINUOUS IMPROVEMENT OF GLOBAL SERVICE DELIVERY AUGMENTED WITH SOCIAL NETWORK ANALYSIS - Improving global service delivery by augmenting with social network analysis, may comprise identifying social network metrics and key performance indicator metrics; collecting data associated with the social network metrics and the key performance indicator metrics, from on-going work performed in the global service delivery and a social network of practitioners; transforming the data into measurable metric data; determining whether a deviation exists in the measurable metric data; and generating an actionable recommendation in response to determining that the deviation exists. | 10-02-2014 |
20140297837 | CONTINUOUS IMPROVEMENT OF GLOBAL SERVICE DELIVERY AUGMENTED WITH SOCIAL NETWORK ANALYSIS - Improving global service delivery by augmenting with social network analysis, may comprise identifying social network metrics and key performance indicator metrics; collecting data associated with the social network metrics and the key performance indicator metrics, from on-going work performed in the global service delivery and a social network of practitioners; transforming the data into measurable metric data; determining whether a deviation exists in the measurable metric data; and generating an actionable recommendation in response to determining that the deviation exists. | 10-02-2014 |