Microsoft Technology Licensing, LLC

Min Wei

Alexander Sasha Stojanovic

Qiang Wang

Vivek Sharma

David L Johnson

Eric Dean Tribble

Joseph Prasanna Fernando

Carlos P Gomes

Kaviraj Singh

Gautam Pulla

John Oberon

Tudor Toma

Sung-Hsun Su

David Lao

Scot J Gellock

An embodiment of the invention is directed toward determining a solution to an objective function that is to be maximized or minimized. An initial feasible basis is determined. An entering variable is determined to enter the initial feasible basis. It is determined if there is an exiting variable. While there is an exiting variable, the exiting variable is removed from the feasible basis, the entering variable is added to the feasible basis, and a new entering variable is determined.

Special-ordered-set-based cost minimization

A framework may be provided for facilitating adoption of mathematical and logical solvers. A model, representing a problem, may be defined. The model may be defined: via a series of statements in a type safe common-language-specification compliant modeling language; via an intermediate format; or via a series of calls to a standardized application program interface. The framework may translate the defined model to an intermediate format, which many solvers may understand. The framework may provide a number of solver-related services including, but not limited to, services for creating a model, analyzing a model, selecting a well-suited solver based on analysis of a model, decomposing a model into multiple sub-models and providing the multiple sub-models to multiple solvers as multiple parallel threads, data binding, simulation, and post optimality analysis.

Framework for interoperability of solvers

A schema for a rule transport engine to be applied to an email having multiple recipients. The schema defines a rule which executes one or more specific actions for a particular recipient or a particular group of recipients receiving a message instance of a bifurcated message when the message meets certain conditions.

Email transport rule per-recipient condition

A model, which defines a mathematical problem, and multiple directives may be received. Each of the multiple directives may be mapped to a respective linear solver instance. The linear solver instances may be launched to execute in parallel. Each of the linear solver instances may use either a primal or a dual algorithm and may further use double arithmetic, exact arithmetic, or hybrid arithmetic, as specified by corresponding ones of the multiple directives. A linear solver instance that uses hybrid arithmetic may start by using double arithmetic and may use exact arithmetic after experiencing a numerical difficulty. After the numerical difficulty is resolved, the linear solver instance that uses hybrid arithmetic may restart and continue to solve the mathematical problem using double arithmetic. After one of the linear solver instances finds an optimal solution, others of the linear solver instances may be stopped and a report may be provided.

Transparent parallelism among linear solvers

The present invention extends to methods, systems, and computer program products for securely and efficiently extending data processing pipeline functionality. Data processing agents register, potentially based solely on configuration data contained in the data processing agents, to manipulate data of a data processing pipeline. Configuration data can identify a specified event (e.g., an SMTP verb) the data processing agent is to hook into. Upon detection of a specified event, one or more agents that have registered for the specified event are loaded into secure zones. Process boundaries separate agents from one another and from other processes such that execution of each agent is isolated from other processes. Pipeline related data (e.g., electronic message data) is transferred to each loaded agent. Application Program Interfaces ('APIs') can be used to transfer data between modules that implement embodiments of the present invention.

Securely and efficiently extending data processing pipeline functionality

Securely extending data processing pipeline functionality

A computing workflow system has a workflow process definition contained in a workflow table as script functions. The workflow table is part of an extended database schema operating with an extended store, a workflow engine and a script engine. The novel workflow system includes a server database having a data table and an associated workflow table. A workflow extended store is communicatively coupled to the server database. A workflow engine is also communicatively coupled to the server database and to the workflow extended store. Further, a script engine is communicatively coupled to the workflow engine. The workflow table includes workflow rules and associated code to be executed by the workflow engine. Each row of the workflow table represents a workflow step. Script functions are defined in the workflow table to evaluate the condition and execute the action of each workflow step. The rules and associated code in the workflow table is both declarative and procedural. The workflow engine compares the data change information from the extended store procedure with the workflow definition in the workflow table and determines the appropriate step that needs to be executed. Then it checks execution permissions on that step. If execute permission is granted, the workflow engine evaluates the workflow step condition against the workflow table and, if true, it executes the step action. Upon completing the step action, the workflow engine commits all the changes made to the current item or to other items in the database.

Growing community of inventors

Redmond, WA, United States of America

Min Wei