Abstract: Methods and systems receive a service name, a service description, and/or operational steps of a service being registered. A first menu of previously established service class choices is provided in ranked order based on the service name, service description, and/or operational steps. Similarly, second and third menus of previously established class input/output mappings to inputs and outputs (required and produced by the operational steps of the service being registered) is presented in a ranked order, based on similar input/outputs of the selected service class. A fourth menu of previously established class transformations is provided in ranked order based on the similarity of inputs and outputs required for the operational steps of the service being registered, and inputs and outputs of the selected service class. The service is registered based on the selected service class, the selected class input mappings, the selected class output mappings, and the selected transformations.

Abstract: A method of implementing a business process may include receiving business process information associated with a business process. The business process information may include a graph representing one or more activities to be performed to complete the business process. The method may include identifying, by a computing device, a number of groups associated with the business process information. Each group may be capable of performing at least a portion of the activities. The method may include partitioning, by the computing device, the graph into a number of fragments that is greater than or equal to the number of identified groups. Each fragment may include one or more activities from the graph. The method may include, for each fragment, transmitting the fragment to an identified group that is capable of performing each activity associated with the fragment, and orchestrating the performance of the activities associated with each fragment by each group.

Abstract: Method and systems assist non-programmer users in specifying business processes. Users submit high-level descriptions of simple, incomplete, or incorrect business processes in softcopy form illustrating the orchestration of services (or the control flow), and get prompted with suggestions to specify the services' data flow. The method and systems herein assist in specifying data flowing between services, but also detects missing edges and services, for which the method and systems herein also provide data flow suggestions. The suggestions are computed and ranked using heuristics, and displayed through a wizard to the user.

Abstract: Methods and systems for scalable extraction of episode rules using incremental episode tree construction in a multi-application event space comprise compiling events from multiple, different domain logs into in a universal log file, rolling domain-dependent and domain-independent windows through the universal log file to identify distinct event-pattern episodes, adding episodes to an episode tree data structure, pruning less frequent episodes from the episode tree, analyzing the episode tree to identify frequent episode rules, and applying the frequent episode rules to future interactions with users.

Abstract: The disclosure describes a method and system monitoring a set of loans and identifying loans in the set that that are likely to default before an upcoming date. The system uses a set of data about loans that are in a default status and loans that are in a non-default status to train a set of loan models. The loan models include at least one model for a defaulted loan and at least one model for a non-defaulted loan. After the loan models are created, the system monitors active loans and classifies each active loan in accordance with one of the loan models. Based on the loan model to which the active loan is classified, the processor will determine a probability of default over a prospective time period for the active loan and issue an alert when a loan's probability of default exceeds a threshold.

Abstract: A method and system for designing file replication schemes in file sharing systems consider node storage constraints and node up/down statistics, file storage costs, and file transfer costs among the nodes, user request rates for the files, and user specified file availability requirements. Based on these considerations, a systematic method for designing file replication schemes can be implemented. The method first determines the number of copies of the files to be stored in the system to achieve the desired goal (e.g., to satisfy file availability requirements, or to maximize the system hit rate), and then selects the nodes at which to store the file copies to minimize the total expected cost. The file replication scheme for a peer-to-peer file sharing system in a distributed and adaptive manner can scale to a large number of nodes and files and can handle changes in the user request pattern over time.