Abstract: Authenticating a human user in a computer system by performing the following steps: (i) determining a one-time password determination algorithm (OTPDA) of one of the following types: graphical, audible, decoder key based, language-based, general knowledge based, temporal, transformative arithmetic and/or a hybrid type; and (ii) revealing the OTPDA to the human user in human-comprehensible form. Revealing OTPDA is done by: (i) communicating the OTPDA itself to the human user, and/or (ii) confirming, to the human user, that the human user's choice for an OTPDA will be used. Preferably, the OTPDA is simple to remember and can be applied by the human user without resort to a computer or similar device.

Abstract: Embodiments of the present invention address deficiencies of the art in respect to mathematical programming for optimization based applications systems and provide a method, system and computer program product for providing an interface for generating and customizing optimization-based applications. A method for providing an interface for generating and customizing optimization-based applications can include generating an initial user interface having an objectives and sequences panel, the objectives and sequences panel can include a basic objective table, an aggregate objective table and an objective sequence table in a goal programming and goal weighting controller module executing in memory by a processor of a host computer. The method also includes rendering in the basic objective table a list of goals with corresponding indexes provided by the optimization application.

Abstract: This invention relates to a method, system and computer program product for processing instruction code to solve a problem. A method according to an embodiment includes: identifying a first relational data table operating on a second relational data table in the instruction code; selecting one or more sets of decision variables from identified tables and operation; constructing one or more equivalent sets of serialized instructions comprising the equivalent serial logical operations operating on one or more of the identified sets of decision variables; and performing the equivalent sets of serialized instructions to determine a solution to the problem.

Abstract: Programmatically generating a mixed integer linear programming (“MIP”) matrix, which can then be solved to provide an optimization, based on an annotated entity/relationship data model and a symbolic matrix. The annotated data model identifies one or more outputs of the optimization. The symbolic matrix provides one or more constraints that provide requirements under which the optimization is solved. Outputs of the optimization are represented as variables, inputs of the optimization are represented as constants, and primary keys from the data model are represented as indexes. The constraints are expressed using the variables, constants, and indexes. A MIP matrix is generated from the symbolic matrix, and is then solved by a MIP solver. The output of the MIP solver is used to update a corresponding data structure of the data model.

Abstract: Embodiments of the present invention address deficiencies of the art in respect to mathematical programming for optimization based applications systems and provide a method, system and computer program product for providing an interface for generating and customizing optimization-based applications. A method for providing an interface for generating and customizing optimization-based applications can include generating an initial user interface having an objectives and sequences panel, the objectives and sequences panel can include a basic objective table, an aggregate objective table and an objective sequence table in a goal programming and goal weighting controller module executing in memory by a processor of a host computer. The method also includes rendering in the basic objective table a list of goals with corresponding indexes provided by the optimization application.

Abstract: A method, system and computer program product for coupling forecasting and planning in a production planning tool is provided. In an embodiment of the invention, a method for coupling forecasting and planning in a production planning tool is provided. The method includes invoking a forecasting module in a production planning tool executing in memory of a computer upon demand data to compute a forecasting model. The method also includes retrieving a stochastic vector from the computed forecasting model for a product, the stochastic vector expressing vector of expected values of demand for the product, and linearizing the stochastic vector in a matrix describing a linear model for demand of the product. The method further includes providing the linearized stochastic vector to a stochastic linear program (LP) relaxation of a planning module of the production planning tool.

Abstract: A system and method for dispatching tasks in a business process management system are provided, whereby tasks are automatically dispatched to a queue for being processed by at least one out of multiple resources. The method includes generating a forecast of further tasks to be dispatched in the future and dispatching each task to the queue for being processed by at least one resource under consideration of the forecast of further tasks to be dispatched in the future.

Abstract: A method of optimizing a Business Process Management (BPM) model, where the model is associated with a plurality of key performance indicators depending on a control parameter vector that includes a plurality of control parameters, may include separating the plurality of control parameters into a linear control parameter vector and a non-linear control parameter vector. A set of candidate values may be iteratively calculated for the control parameter vector. Each candidate value may be determined for a preselected value of a non-linear control parameter belonging to the non-linear control parameter vector from execution of a mixed integer program model associated with the BPM model, the key performance indicators and the preselected value of the non-linear control parameter vector. The method may further include adjusting the BPM model based on at least one of the candidate values.

Abstract: The present invention relates to methods and systems for optimizing business process management using mathematical programming. In one aspect, the invention allows for formulation of a mixed integer program based on a business process model. The business process may be generically defined using the models set forth. This allows many disparate business processes to be modeled as mixed integer programs. In a second aspect of the invention, a mixed integer program representing a business process model may be used in connection with simulation of the business process to refine resource assignments. After an initial simulation, later simulations may be refined by using a solution of the mixed integer program to generate resource assignment recommendations. The resource assignment recommendations may influence decisions made in the execution. This may allow the execution to reflect possible improvements to the manner in which events or documents in the business process are dispatched.

Abstract: A method of scheduling and making material time balancing decisions for a set of balanced tasks. The method includes steps of scheduling a first task from among the set of tasks, maintaining a reversible buffer over the interval, values of which over the time interval define a buffer profile. The buffer profile indicates the balance of items consumed by already scheduled tasks over the time interval. The next task to be scheduled is then selected from among all schedulable tasks of the set of tasks. A schedulable task is defined as a task that produces a quantity of items that is less than or equal to the balance of items consumed by the already scheduled tasks, as indicated by the buffer profile. The selected task may then be scheduled such that the end time of the selected task is latest.

Abstract: Systems, methodologies, media, and other embodiments associated with parallel optimization in transportation planning are described. One exemplary method embodiment may include selecting, in parallel, candidate loads to satisfy a set of orders, selecting final loads from the candidate loads, and in parallel selectively manipulating the final loads into a transportation plan that reduces a transportation cost.

Abstract: A plan is a relaxation of the production management problem with time buckets: no precise lead times, no exact continuous balance of material. A schedule considers the full production management problem with all of the details. The present invention includes methods and systems for modeling plans and schedules and methods and systems for communicating between the planning and scheduling models. Bidirectional communication may be carried out between the planning model and the scheduling model to enable, for example, the planning model to be used as a hint during scheduling and to enable a new plan to be launched in the middle of a scheduling algorithm to update the results thereof.

Abstract: An adjustable ringprosthesis designed particularly for being sewed onto the ring of the mitral valve or tricuspidal valve of a living heart uses a spring ribbon coiled with an overlap of about a half turn covered in a woven, braided or knitted cuff of a suitable synthetic fiber that can be sewed into place. An adjusting device (40) is fixedly positioned on a portion of the spring ribbon which is internally overlapped by an end portion which carries teeth so as to form a rack which can be driven by a screw (15) in the adjusting device for varying the diameter of the ring. The adjusting device is operated by an adjusting tool, the front end of which is guided into a screw-head socket (50) for turning the screw to change the ring diameter. The shaft of the tool is guided by a tube through a connecting piece (51) onto which the guide tube is screwed, and from which it can be unscrewed and removed when there is no further need for post-operative adjustment of the prosthesis.