Abstract: Encoding a new version of a data module includes constructing a delta data module having data for providing the new version of the data module. The delta data module may indicate an encoding for copying data at an offset from one of a number of pointers into different versions of the data module. Decoding a delta data module to provide a new version of a data module includes copying, to the new version of the data module, data relative to a target pointer when an encoding in the delta data module indicates a matching pattern relative to the target pointer, and copying, to the new version of the data module, data relative to at least one other pointer when an encoding in the delta data module indicates a matching pattern relative to the at least one other pointer.

Abstract: Encoding a new version of a data module includes constructing a delta data module having data for providing the new version of the data module. The delta data module may indicate an encoding for copying data at an offset from one of a number of pointers into different versions of the data module. Decoding a delta data module to provide a new version of a data module includes copying, to the new version of the data module, data relative to a target pointer when an encoding in the delta data module indicates a matching pattern relative to the target pointer, and copying, to the new version of the data module, data relative to at least one other pointer when an encoding in the delta data module indicates a matching pattern relative to the at least one other pointer.

Abstract: Methods and systems for providing validating financial services data is provided. The financial services data is translated into a normalized format. The normalized financial services data is validated with one or more validations modules, and an alert is transmitted if any of the validations fail.

Abstract: A computer-implemented method is provided for optimizing allocation of resources across stories for a release within an Agile development environment. The method includes receiving (i) resource information representing a plurality of resources available for allocation to the stories, (ii) one or more story definitions, each story definition comprising a unique identifier and one or more story-level constraints corresponding to a story, (iii) release information, (iv) iteration information, and (iv) one or more optimization criteria. The method also includes generating a plurality of story-level allocation scenarios and determining one or more optimized story-level allocation scenarios from the plurality of story-level allocation scenarios. Each story-level allocation scenario satisfies the one or more story-level constraints associated with each story definition.

Abstract: Encoding a new version of a data module includes constructing a delta data module having data for providing the new version of the data module. The delta data module may indicate an encoding for copying data at an offset from one of a number of pointers into different versions of the data module. Decoding a delta data module to provide a new version of a data module includes copying, to the new version of the data module, data relative to a target pointer when an encoding in the delta data module indicates a matching pattern relative to the target pointer, and copying, to the new version of the data module, data relative to at least one other pointer when an encoding in the delta data module indicates a matching pattern relative to the at least one other pointer.

Abstract: Encoding a new version of a data module includes constructing a delta data module having data for providing the new version of the data module. The delta data module may indicate an encoding for copying data at an offset from one of a number of pointers into different versions of the data module. Decoding a delta data module to provide a new version of a data module includes copying, to the new version of the data module, data relative to a target pointer when an encoding in the delta data module indicates a matching pattern relative to the target pointer, and copying, to the new version of the data module, data relative to at least one other pointer when an encoding in the delta data module indicates a matching pattern relative to the at least one other pointer.

Abstract: A computer-implemented method is provided for optimizing allocation of resources across stories for a release within an Agile development environment. The method includes receiving (i) resource information representing a plurality of resources available for allocation to the stories, (ii) one or more story definitions, each story definition comprising a unique identifier and one or more story-level constraints corresponding to a story, (iii) release information, (iv) iteration information, and (iv) one or more optimization criteria. The method also includes generating a plurality of story-level allocation scenarios and determining one or more optimized story-level allocation scenarios from the plurality of story-level allocation scenarios. Each story-level allocation scenario satisfies the one or more story-level constraints associated with each story definition.

Abstract: Described are methods and apparatuses, including computer program products, for optimizing allocation of resources across projects in a project portfolio. The method includes receiving, at a computing device, (i) resource information, (ii) a portfolio of project definitions and (iii) one or more portfolio-level optimization criteria. The resource information representing a plurality of resources available for allocation to the projects, and each project definition includes a unique identifier and one or more project-level constraints. The method also includes generating, using the computing device, a plurality of project portfolio allocation scenarios and determining one or more optimized project portfolio allocation scenarios from the plurality of project portfolio allocation scenarios. Each project portfolio allocation scenario satisfies the one or more project-level constraints associated with each project definition.

Abstract: Described are methods and apparatuses, including computer program products, for optimizing allocation of resources across projects in a project portfolio. The method includes receiving, at a computing device, (i) resource information, (ii) a portfolio of project definitions and (iii) one or more portfolio-level optimization criteria. The resource information representing a plurality of resources available for allocation to the projects, and each project definition includes a unique identifier and one or more project-level constraints. The method also includes generating, using the computing device, a plurality of project portfolio allocation scenarios and determining one or more optimized project portfolio allocation scenarios from the plurality of project portfolio allocation scenarios. Each project portfolio allocation scenario satisfies the one or more project-level constraints associated with each project definition.

Abstract: Encoding a new version of a data module includes constructing a delta data module having data for providing the new version of the data module. The delta data module may indicate an encoding for copying data at an offset from one of a number of pointers into different versions of the data module. Decoding a delta data module to provide a new version of a data module includes copying, to the new version of the data module, data relative to a target pointer when an encoding in the delta data module indicates a matching pattern relative to the target pointer, and copying, to the new version of the data module, data relative to at least one other pointer when an encoding in the delta data module indicates a matching pattern relative to the at least one other pointer.

Abstract: Encoding a new version of a data module includes constructing a delta data module having data for providing the new version of the data module. The delta data module may indicate an encoding for copying data at an offset from one of a number of pointers into different versions of the data module. Decoding a delta data module to provide a new version of a data module includes copying, to the new version of the data module, data relative to a target pointer when an encoding in the delta data module indicates a matching pattern relative to the target pointer, and copying, to the new version of the data module, data relative to at least one other pointer when an encoding in the delta data module indicates a matching pattern relative to the at least one other pointer.

Abstract: Encoding a new version of a data module includes constructing a delta data module having data for providing the new version of the data module. The delta data module may indicate an encoding for copying data at an offset from one of a number of pointers into different versions of the data module. Decoding a delta data module to provide a new version of a data module includes copying, to the new version of the data module, data relative to a target pointer when an encoding in the delta data module indicates a matching pattern relative to the target pointer, and copying, to the new version of the data module, data relative to at least one other pointer when an encoding in the delta data module indicates a matching pattern relative to the at least one other pointer.

Abstract: A system and method for providing file data, such as a set of files for updating a computer system, in a self-contained package, in which the package size is significantly reduced via delta compression. A build mechanism examines files to be distributed, and generates a self-contained package containing files and deltas. To this end, a directed graph is built from the sizes of the various base file and delta file possibilities, and a minimum spanning tree computation selects the files that result in the smallest package. A base file may have multiple deltas applied to synthesize multiple files, and any base file may itself have been previously synthesized from another base file and a delta. A client extraction mechanism, optionally provided with the package, works with the contents of the package as directed by a manifest to synthesize target files from the base files and the contained deltas.

Abstract: One solution for dealing with complex call flows employs a diagramming tool that allows a designer to graphically represent the customer experience during the call by connecting IVR actions and decision points with arrows. The resulting diagram is translated into a Finite State Machine (FSM).

Abstract: Encoding a new version of a data module includes constructing a delta data module having data for providing the new version of the data module. The delta data module may indicate an encoding for copying data at an offset from one of a number of pointers into different versions of the data module. Decoding a delta data module to provide a new version of a data module includes copying, to the new version of the data module, data relative to a target pointer when an encoding in the delta data module indicates a matching pattern relative to the target pointer, and copying, to the new version of the data module, data relative to at least one other pointer when an encoding in the delta data module indicates a matching pattern relative to the at least one other pointer.

Abstract: A dishwasher includes a housing having a washing chamber and an access door, a plurality of legs supporting the housing, a pump and a drive motor provided in a cavity between the legs and below the housing, a plate closing a front side of the cavity, an insulator provided between the plate and the pump and drive motor and a first side shield closing a first side of the cavity.

Abstract: In a content delivery scheme for target files, one or more recipes for each of the target files are encoded in an index. The index uses a framework that is able to represent content delivery schemes involving static containers, dynamic containers, self-contained containers, containers that are not self-contained, containers with internal delta dependency and containers with no internal delta dependency.

Abstract: Multi-media call centers are able to receive incoming contacts or calls in a plurality of different types of medium. For example, as email, fax, chat, web-based and other types of contact. Incoming contacts are routed to one of a plurality of agents. Each agent has one or more skills, for example, a particular agent has knowledge about sales for product X and about technical support for product Y. Associated with each skill is a queue into which incoming calls are placed until an agent with that skill becomes available. Typically further subdivision of these queues is made such that for a particular skill, there is one queue for each possible medium. Often the queues referred to above build up and end user's experience significant waiting times before reaching a call center agent. This leads to dropped calls and customer dissatisfaction. To avoid this customers are able to switch between queues of different media types (but the same skill type) in order to reduce waiting times.

Abstract: A version control system such as may be used in an information management system for a source code development project. Multiple versions of artifacts are stored in the version control system. Some versions are stored in uncompressed form while others are stored in compressed form. The artifacts selected to be stored in compressed form are selected to facilitate rapid retrieval of files. The compression process is such that the compression may be performed as a background operation.

Abstract: A system and method for dynamically updating digital information, such as a data file, between computing devices in a computer network are provided. The digital information identifier, such as a file name, and a unit identifier, such as a size, of the digital information are provided by a publishing computing device. The publishing computing device receives a request for a delta portion of the identified digital information and, in response to the request, dynamically generates a patch including a copy of the requested information. Once the patch is generated, publishing computing device provides the patch to the party requesting the information.