Abstract: One embodiment of the present invention sets forth a technique for designing a four-bar linkage mechanism. The technique includes receiving an input coupler curve that defines motion within a plane with respect to a point that is to be included on the four-bar linkage mechanism; generating a set of sample points, wherein each point in the set of sample points corresponds to a different location on the input coupler curve; and implementing a global optimization solver to generate a first design for the four-bar linkage mechanism. The first design includes at least one value for each geometric variable included in a set of geometric variables associated with the four-bar linkage, where at least one of the geometric variables is based on one of the sample points. The first design generates an output coupler curve that approximates the input coupler curve.

Abstract: One embodiment of the present invention sets forth a technique for designing a four-bar linkage mechanism. The technique includes receiving an input coupler curve that defines motion within a plane with respect to a point that is to be included on the four-bar linkage mechanism; generating a set of sample points, wherein each point in the set of sample points corresponds to a different location on the input coupler curve; and implementing a global optimization solver to generate a first design for the four-bar linkage mechanism. The first design includes at least one value for each geometric variable included in a set of geometric variables associated with the four-bar linkage, where at least one of the geometric variables is based on one of the sample points. The first design generates an output coupler curve that approximates the input coupler curve.

Abstract: It is difficult for managers or other operators to decide how best to modify an available pool of resources used for their workflows. Methods for achieving this by improving the robustness of workflows are described. The more robust a workflow, the better its ability to withstand detrimental changes to its associated pool of resources. It is recognized here that the size of the solution space for the problem of allocating resources to tasks in a workflow provides a useful indicator of robustness of a workflow. In general, the greater the size of the solution space the more robust the workflow. A constraint optimization problem is specified for the problem of how best to modify resource characteristics of a pool of resources in order to maximize a size of a solution space. The solution space is that for the problem of allocating resources from the pool to tasks in a workflow.

Abstract: It is difficult for managers or other operators to decide how best to modify an available pool of resources used for their workflows. Methods for achieving this by improving the robustness of workflows are described. The more robust a workflow, the better its ability to withstand detrimental changes to its associated pool of resources. It is recognized here that the size of the solution space for the problem of allocating resources to tasks in a workflow provides a useful indicator of robustness of a workflow. In general, the greater the size of the solution space the more robust the workflow. A constraint optimization problem is specified for the problem of how best to modify resource characteristics of a pool of resources in order to maximize a size of a solution space. The solution space is that for the problem of allocating resources from the pool to tasks in a workflow.

Abstract: Processes are often cross-functional and involve the flow of information between several functional areas. For example, an order fulfillment process may require input from sales, logistics and manufacturing. Existing workflow engines, which do not use constraint programming techniques, are able to model such cross-functional processes only where the workflows are precisely and accurately defined. A constraint programming approach to workflow analysis is used here. A synchronization module in a constraint programming workflow engine scheduler receives registrations from listener tasks in a workflow which are dependent on tasks in other workflows. The synchronization module triggers the listener tasks at appropriate times to monitor for information from the dependent tasks. In this way cross-workflow synchronization is achieved by specifying listener tasks and registering these at the synchronization module. Thus it is not essential for the workflows to be precisely defined.

Abstract: Previous workflow engines have typically used definitions of workflows with tasks having pre-assigned resources or resources computed by earlier tasks in the workflow. Also, previous workflow engines have typically used if-then rules and conditions to specify and control execution of tasks in the workflow. In contrast, the methods described herein use constraint programming techniques. Information about a workflow is provided, comprising a plurality of tasks, and for at least some of those tasks, resource allocation requirements. Using this workflow information together with policy information and information about resource characteristics, a constraint optimization problem is specified. This problem is solved using a constraint programming solver and the resulting information about resources allocated to tasks is stored. In this way, resources may be allocated to tasks in a dynamic manner, during execution of a workflow if required.