Abstract: A project-comparator subsystem generates a similarity metric for input electronically-represented projects input to the project-comparator subsystem. A project search engine receives data that represents a first electronically-represented project, identifies, by pairwise comparison of the stored electronically-represented projects with the first electronically-represented project using the project-comparator subsystem, a stored electronically-represented project with greatest similarity to the first electronically-represented project, and outputs an indication of the identified stored electronically-represented project.

Abstract: Methods, systems, and computer-readable storage media for recommending one or more indicators to be monitored. In some implementations, actions include receiving user input, the user input indicating a measure selected by a user, identifying a plurality of dimensions corresponding to the measure, receiving goal data, the goal data being provided by the user, determining a rank for each dimension of the plurality of dimensions, each rank being determined based on a risk and a contribution associated with a respective dimension, the risk being determined based on the goal data, and providing dimensions of the plurality of dimensions for display to the user, the dimensions being displayed based on rank, each dimension filtering the measure to provide a respective filtered measure, the filtered measure being an indicator that can be monitored.

Abstract: A project-comparator subsystem generates a similarity metric for input electronically-represented projects input to the project-comparator subsystem. A project search engine receives data that represents a first electronically-represented project, identifies, by pairwise comparison of the stored electronically-represented projects with the first electronically-represented project using the project-comparator subsystem, a stored electronically-represented project with greatest similarity to the first electronically-represented project, and outputs an indication of the identified stored electronically-represented project.

Abstract: One embodiment of the present invention is directed to a project search system, implemented on one or more computer systems, comprising two or more stored projects represented by electronically stored, computer-accessible data that are stored in a project-database component; a project-comparator subsystem, executed on the one or more computer systems, that generates a similarity metric for two electronically-represented projects input to the project-comparator subsystem; and a project search engine, executed on the one or more computer systems, that receives data that represents an input project, identifies, by pairwise comparison of the stored projects with the input project using the project-comparator subsystem, one or more stored projects with greatest similarity to the input project, and outputs, to a graphical interface displayed on a computer display or to an application program, indications of the one or more stored projects with greatest similarity to the input project.

Abstract: Systems, methods, and computer-readable and executable instructions are provided for selecting executing requests to preempt. Selecting executing requests to preempt can include determining whether an application is in an overload condition. Selecting executing requests can also include in response to determining the application is in an overload condition, identifying each request that is being executed by the application. Selecting executing requests can also include determining a value for each request that is executing. Furthermore, selecting executing requests can also include selecting executing requests to preempt based on the values for the requests.

Abstract: One embodiment of the present invention is directed to a project search system, implemented on one or more computer systems, comprising two or more stored projects represented by electronically stored, computer-accessible data that are stored in a project-database component; a project-comparator subsystem, executed on the one or more computer systems, that generates a similarity metric for two electronically-represented projects input to the project-comparator subsystem; and a project search engine, executed on the one or more computer systems, that receives data that represents an input project, identifies, by pairwise comparison of the stored projects with the input project using the project-comparator subsystem, one or more stored projects with greatest similarity to the input project, and outputs, to a graphical interface displayed on a computer display or to an application program, indications of the one or more stored projects with greatest similarity to the input project.

Abstract: A method of changing an information technology system comprising a plurality of interacting components is provided. In an embodiment, the method comprises defining (320) a plurality of maintenance windows; providing (330) a database (110) of required component changes, each change comprising a workflow of at least one activity having a predefined duration, each change being labeled with a set of attributes including a list of acceptable maintenance windows; providing (340) a database listing said components and dependencies between said components; generating (350) change constraints for required component changes based on said dependencies and the required component changes; generating (360) a set of individual preference scores for the generated change constraints; and scheduling (370) changes in available maintenance windows using the individual preference scores.

Abstract: A method of determining the compatibility of respective information associated with at least two parties is described.

Abstract: Requests that are executing when an application is determined to be in an overload condition are preempted. To select the executing requests to preempt, a value for each executing request is determined. Then, executing requests are selected for preemption based on the values.

Abstract: In an embodiment, the invention provides a method of prioritizing problems in IT services. The method comprises determining a plurality of N problems. An incident cost, a workaround cost, an expected resolution cost, and a total cost for each of the N problems is determined. A priority is assigned to each of the N problems such that each priority has an expected resolution time. The priorities are assigned such that the total cost for fixing all N problems is lower than any other selection of priorities.

Abstract: A method of and system for defining a common interactions protocol between two entities is described. The method comprises inputting a description of each entity's messaging guidelines, the description including the entity's constraints on interacting with the other entity; calculating the union of the two descriptions; determining whether the union is satisfiable using a constraint resolver; providing the intersection of the two descriptions as the common interactions protocol if the union is satisfiable; and indicating where any incompatibility lies if the union is not satisfiable.

Abstract: A method of determining the compatibility of respective information associated with at least two parties is described.

Abstract: In at least some embodiments, an apparatus and method may receive parameters of an information technology (IT) infrastructure and formulate one or more IT recovery plans based on the parameters. The apparatus and method may further calculate a projected utility for one or more of the IT recovery plans based on one or more contractual agreements.

Abstract: A method of and system for defining a common interactions protocol between two entities is described. The method comprises inputting a description of each entity's messaging guidelines, the description including the entity's constraints on interacting with the other entity; calculating the union of the two descriptions; determining whether the union is satisfiable using a constraint resolver; providing the intersection of the two descriptions as the common interactions protocol if the union is satisfiable; and indicating where any incompatibility lies if the union is not satisfiable.