| Patent application number | Description | Published |
|---|
| 20120290963 | GUI FOR GOAL PROGRAMMING AND GOAL WEIGHTING IN OPTIMIZATION BASED APPLICATIONS - 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. The method further includes receiving selection of a subset of objectives to generate a new aggregate objective in the aggregate objective table. | 11-15-2012 |
| 20130060728 | GENERATING A MIXED INTEGER LINEAR PROGRAMMING MATRIX FROM AN ANNOTATED ENTITY-RELATIONSHIP DATA MODEL AND A SYMBOLIC MATRIX - 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. | 03-07-2013 |
| 20130346393 | RELATIONAL MODELING ENGINE - 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. | 12-26-2013 |
| 20140304789 | CONVENIENT ONE-TIME PASSWORD - 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. | 10-09-2014 |
| 20140310069 | COORDINATED BUSINESS RULES MANAGEMENT AND MIXED INTEGER PROGRAMMING - Embodiments of the present invention provide a method, system and computer program product for an integrated business rules management system (BRMS) and mixed integer programming (MIP) technology application deployment. In an embodiment of the invention, a method of rules processing with MIP constraints can include selecting candidate rules from amongst a set of rules in a rules engine executing in memory of a computer and reducing the candidate rules to rules in a conflict set according to constraints specified in the candidate rules. The method also can include conflict resolving the rules in the conflict set and generating an agenda for the rules of the conflict set. Finally, the method can include adding constraints specified in the rules of the conflict set to working memory of the rules engine and applying the rules in the conflict set in agenda order to the working memory. | 10-16-2014 |
| 20140310070 | COORDINATED BUSINESS RULES MANAGEMENT AND MIXED INTEGER PROGRAMMING - Embodiments of the present invention provide a method, system and computer program product for an integrated business rules management system (BRMS) and mixed integer programming (MIP) technology application deployment. In an embodiment of the invention, a method of rules processing with MIP constraints can include selecting candidate rules from amongst a set of rules in a rules engine executing in memory of a computer and reducing the candidate rules to rules in a conflict set according to constraints specified in the candidate rules. The method also can include conflict resolving the rules in the conflict set and generating an agenda for the rules of the conflict set. Finally, the method can include adding constraints specified in the rules of the conflict set to working memory of the rules engine and applying the rules in the conflict set in agenda order to the working memory. | 10-16-2014 |
| 20150039364 | OPTIMIZING EMERGENCY RESOURCES IN CASE OF DISASTER - A method and system for planning relocation of people from disaster locations to safe locations. Received are an identification of: a disaster locations at which a respective disaster is predicted to occur, numbers of persons to be evacuated during a specified range of time at each disaster location, safe locations available for relocating the persons to be evacuated, vehicles available to transport the persons from the disaster locations to the safe locations, each vehicle's capacity of a maximum number of people that can be simultaneously transported, and each vehicle's current location. An optimal plan is generated for (i) evacuating the identified number of persons from the disaster locations during the respective specified ranges of time and (ii) transporting the evacuated persons to the safe locations, utilizing the received identifications. All persons evacuated from the disaster locations have been relocated at the safe locations by elapse of the N time intervals. | 02-05-2015 |
