CERTUSOFT, INC. Patent applications |
Patent application number | Title | Published |
20140164897 | Constraint-Choice-Action Matrix for Decision Making: Apparatus and Method - The present invention is an apparatus and method for constructing a Constraint-Choice-Action Matrix for making decisions based on constraints. Columns (in one matrix orientation) state conditions. The column header presents a partial boolean expression. Such variable expression may be any object or type, e.g., a number, string, or list. An entry in a cell, selected using a GUI pick-list, combines with the column header, to complete the boolean expression. The set of boolean expressions in a row may be combined into an action boolean statement. If that statement evaluates to true, some action, represented as a row header, is recommended or executed. The matrix is applied to an instance of a context domain, for decision-making. The context domain may be represented in a model representing an instance of that domain (e.g., a product specification for configuration of a machine) in data and rules. | 06-12-2014 |
20120221136 | AUTOMATED HIERARCHICAL CONFIGURATION OF CUSTOM PRODUCTS WITH COMPLEX GEOMETRIES: METHOD AND APPARATUS - The invention is a method and apparatus for automatically generating an optimal configuration of a product, using logic implemented on a digital computer processing system. A general configuration will be broken down into a hierarchy of subdesigns by a designer of an artifact type. A particular instance of the type must satisfy user-specified external parametric constraints. Constraints may take the form of a range of values for some performance characteristic or to satisfy laws or business requirements. Hierarchical decomposition facilitates solution of complex problems. Criteria for a best solution may be specified for a given subdesign, a collection of subdesigns, or globally. Tentative selection of a particular subdesign may impose internally generated constraints upon a subsequent subdesign. If no acceptable solution is found for a subdesign, the candidate overall configuration rolls back to the most complete viable partial collection of subdesigns. The method transforms constraints into a concrete design. | 08-30-2012 |
20120215499 | AUTOMATED HIERARCHICAL CONFIGURATION OF CUSTOM PRODUCTS WITH COMPLEX GEOMETRIES: METHOD AND APPARATUS - The invention is a method and apparatus for automatically generating an optimal configuration of a product, using logic implemented on a digital computer processing system. A general configuration will be broken down into a hierarchy of subdesigns by a designer of an artifact type. A particular instance of the type must satisfy user-specified external parametric constraints. Constraints may take the form of a range of values for some performance characteristic or to satisfy laws or business requirements. Hierarchical decomposition facilitates solution of complex problems. Criteria for a best solution may be specified for a given subdesign, a collection of subdesigns, or globally. Tentative selection of a particular subdesign may impose internally generated constraints upon a subsequent subdesign. If no acceptable solution is found for a subdesign, the candidate overall configuration rolls back to the most complete viable partial collection of subdesigns. The method transforms constraints into a concrete design. | 08-23-2012 |
20120215336 | AUTOMATED HIERARCHICAL CONFIGURATION OF CUSTOM PRODUCTS WITH COMPLEX GEOMETRIES: METHOD AND APPARATUS - The invention is a method and apparatus for automatically generating an optimal configuration of a product, using logic implemented on a digital computer processing system. A general configuration will be broken down into a hierarchy of subdesigns by a designer of an artifact type. A particular instance of the type must satisfy user-specified external parametric constraints. Constraints may take the form of a range of values for some performance characteristic or to satisfy laws or business requirements. Hierarchical decomposition facilitates solution of complex problems. Criteria for a best solution may be specified for a given subdesign, a collection of subdesigns, or globally. Tentative selection of a particular subdesign may impose internally generated constraints upon a subsequent subdesign. If no acceptable solution is found for a subdesign, the candidate overall configuration rolls back to the most complete viable partial collection of subdesigns. The method transforms constraints into a concrete design. | 08-23-2012 |