Hewlett-packard Development Company, L.P.

Entit Software LLC

David Trastour

Maher Rahmouni

Claudio Bartolini

Andrew Robert Byde

Marianne Hickey

Christopher William Preist

Arif Abdulhusein Merchant

Mustafa Uysal

Caroline Kudla

Dennis K Clemmer

Javier Esplugas Cuadrado

Derek Coleman

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.

Comparing projects

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.

Method and system for comparing and locating projects

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.

Selecting executing requests to preempt

An assessment of a request for change is made by first receiving the request for change. The request for change is compared with a plurality of stored requests for change that are stored in a change database. Then, a computation is made, using learned similarity functions, of a similarity value for each of the stored requests for change with respect to the received request for change. Feedback is received with respect to the similarity values. A training set of data is updated based on the received feedback. The updated training set of data is applied to a learning process, to obtain learned similarity functions. The similarity calculator is updated with the learned similarity functions. The similarity functions can be used to evaluate the risk of changes by looking at the impact of similar past changes.

Decision making based on changes input to a database

A method of determining the compatibility of respective information associated with at least two parties is described. The method comprises: a first and second party each expressing their respective information in an agreed format; processing the information according to a two-phase double-encryption process, in which the first party encrypts their information under a personalized first-phase procedure and sends the results to the second party and the second party encrypts their information under a personalized first-phase procedure and sends the results to the first party, the second party encrypting the encrypted information received from the first party under a personalized second-phase procedure to produce a double-encrypted result and the first party encrypting the encrypted information received from the second party under a personalized second-phase procedure to produce a double-encrypted result, the first- and second-phase procedures being chosen such that a given element of information will always yield the same unique double-encrypted result regardless of which party it originates from; and comparing each party's double-encrypted information to determine the compatibility of the information of each party.

System and method for constraint resolution

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.

Growing community of inventors

Bristol, United Kingdom

David Trastour