Patents by Inventor Kenneth W. Fertig
Kenneth W. Fertig has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 10509871Abstract: Presented are methods for determining computational flow for a data-dependent constraint network that are especially useful for modeling and trading off alternative configurations in a single computational environment, during design analysis and optimization of an engineering system. These methods leverage a preexisting constraint management system that uses a bipartite graph of variables and constraints to model an engineering system and employ logic formulae based world sets to determine the applicability of the constraints to different system configurations. These methods ensure that a data-dependent constraint network is in a consistent state, and are the essential foundation for other techniques that rely on a consistent constraint network to produce computational plans for propagating values and uncertainties through the constraint network during tradeoff analyses.Type: GrantFiled: February 21, 2017Date of Patent: December 17, 2019Assignee: THE BOEING COMPANYInventors: Kenneth W. Fertig, Sudhakar Y. Reddy
-
Patent number: 10339459Abstract: Presented are rapid and robust techniques for estimating the uncertainty in product attributes (performance, cost, etc.) during the multi-disciplinary design and analysis phase of the product life-cycle. The techniques leverage the capabilities of a preexisting constraint management system that may be used to calculate performance and cost metrics of an engineering system as a function of the design structure and operational scenarios. The techniques are particularly useful when the constraint management system is used to automate the reverse computation required when the analyst specifies cost, schedule, or performance targets using approaches such as cost as independent variable. Disclosed techniques may also be applied to constraint management systems that include compound-valued variables.Type: GrantFiled: March 17, 2017Date of Patent: July 2, 2019Assignee: THE BOEING COMPANYInventors: Kenneth W. Fertig, Sudhakar Y. Reddy
-
Patent number: 10339458Abstract: Presented are rapid and robust techniques for estimating the uncertainty in product attributes (performance, cost, etc.) during the multi-disciplinary design and analysis phase of the product life-cycle. The techniques leverage the capabilities of a preexisting constraint management system that may be used to calculate performance and cost metrics of an engineering system as a function of the design structure and operational scenarios. The techniques are particularly useful when the constraint management system is used to automate the reverse computation required when the analyst specifies cost, schedule, or performance targets using approaches such as cost as independent variable. Disclosed techniques may also be applied to constraint management systems that include compound-valued variables.Type: GrantFiled: March 17, 2017Date of Patent: July 2, 2019Assignee: The Boeing CompanyInventors: Kenneth W. Fertig, Sudhakar Y. Reddy
-
Publication number: 20180239847Abstract: Presented are methods for determining computational flow for a data-dependent constraint network that are especially useful for modeling and trading off alternative configurations in a single computational environment, during design analysis and optimization of an engineering system. These methods leverage a preexisting constraint management system that uses a bipartite graph of variables and constraints to model an engineering system and employ logic formulae based world sets to determine the applicability of the constraints to different system configurations. These methods ensure that a data-dependent constraint network is in a consistent state, and are the essential foundation for other techniques that rely on a consistent constraint network to produce computational plans for propagating values and uncertainties through the constraint network during tradeoff analyses.Type: ApplicationFiled: February 21, 2017Publication date: August 23, 2018Inventors: Kenneth W. Fertig, Sudhakar Y. Reddy
-
Publication number: 20170193377Abstract: Presented are rapid and robust techniques for estimating the uncertainty in product attributes (performance, cost, etc.) during the multi-disciplinary design and analysis phase of the product life-cycle. The techniques leverage the capabilities of a preexisting constraint management system that may be used to calculate performance and cost metrics of an engineering system as a function of the design structure and operational scenarios. The techniques are particularly useful when the constraint management system is used to automate the reverse computation required when the analyst specifies cost, schedule, or performance targets using approaches such as cost as independent variable. Disclosed techniques may also be applied to constraint management systems that include compound-valued variables.Type: ApplicationFiled: March 17, 2017Publication date: July 6, 2017Inventors: Kenneth W. FERTIG, Sudhakar Y. REDDY
-
Publication number: 20170193378Abstract: Presented are rapid and robust techniques for estimating the uncertainty in product attributes (performance, cost, etc.) during the multi-disciplinary design and analysis phase of the product life-cycle. The techniques leverage the capabilities of a preexisting constraint management system that may be used to calculate performance and cost metrics of an engineering system as a function of the design structure and operational scenarios. The techniques are particularly useful when the constraint management system is used to automate the reverse computation required when the analyst specifies cost, schedule, or performance targets using approaches such as cost as independent variable. Disclosed techniques may also be applied to constraint management systems that include compound-valued variables.Type: ApplicationFiled: March 17, 2017Publication date: July 6, 2017Inventors: Kenneth W. FERTIG, Sudhakar Y. REDDY
-
Publication number: 20160371333Abstract: A method of determining a conditional computational plan for a data dependent constraint network represented by a bipartite graph containing input variable nodes, output variable nodes, and relation nodes, may include specifying, using a variable node specifier, at least one output variable node for which a plan is desired. The method may further include determining, using a plan determiner, a plan from the input variable nodes to the output variable node using a backward chaining search of the bipartite graph.Type: ApplicationFiled: August 29, 2016Publication date: December 22, 2016Inventors: Kenneth W. FERTIG, Sudhakar Y. REDDY, Stubblefield L. PHILLIP
-
Patent number: 9507909Abstract: A method of determining a conditional computational plan for a data dependent constraint network represented by a bipartite graph containing input variable nodes, output variable nodes, and relation nodes, may include specifying, using a variable node specifier, at least one output variable node for which a plan is desired. The method may further include determining, using a plan determiner, a plan from the input variable nodes to the output variable node using a backward chaining search of the bipartite graph.Type: GrantFiled: October 12, 2012Date of Patent: November 29, 2016Assignee: The Boeing CompanyInventors: Kenneth W. Fertig, Sudhakar Y. Reddy, Philip L. Stubblefield
-
Patent number: 9026410Abstract: A method for simplifying a complex well-formed formula (WFF) may include receiving, in a formula processor, an input WFF and converting the input WFF into an initial bit array. The method may further include simplifying the initial bit array into a simplified bit array by removing predicates from the initial bit array not necessary to represent the input WFF. The method may include converting the simplified bit array into a return WFF in either a conjunctive normal form or a disjunctive normal form.Type: GrantFiled: March 16, 2012Date of Patent: May 5, 2015Assignee: The Boeing CompanyInventors: Kenneth W. Fertig, Sudhakar Y. Reddy, Bruce Riggins
-
Publication number: 20130246016Abstract: A method for simplifying a complex well-formed formula (WFF) may include receiving, in a formula processor, an input WFF and converting the input WFF into an initial bit array. The method may further include simplifying the initial bit array into a simplified bit array by removing predicates from the initial bit array not necessary to represent the input WFF. The method may include converting the simplified bit array into a return WFF in either a conjunctive normal form or a disjunctive normal form.Type: ApplicationFiled: March 16, 2012Publication date: September 19, 2013Applicant: THE BOEING COMPANYInventors: Kenneth W. Fertig, Sudhakar Y. Reddy, Bruce Riggins
-
Patent number: 8185421Abstract: Multi-Objective Optimization (MOO) is integrated with a Constraint Management System (CMS) so as to rapidly and flexibly search large design spaces and focus on “interesting” designs as determined by user-specified criteria. A method embeds a trade space and its trade-off envelope within the same CMS network used to calculate the values of the points in the trade space itself. The method supports automatic variation of the resulting trade-off analyses in response to variations in upstream parameters, assumptions, and/or requirements. When feasible, the CMS can back-solve for values of upstream parameters so that selected attributes of the trade-off envelope achieve user-specified values. The coupled use of a CMS with multi-objective optimization avoids having to generate a large set of permutations of inputs and factors and then restricting the analysis to those having desired outputs or of having to manually “reformulate” the equation set so that it solves in the desired direction.Type: GrantFiled: May 9, 2006Date of Patent: May 22, 2012Assignee: The Boeing CompanyInventors: Kenneth W. Fertig, Sudhakar Y Reddy, Philip L. Stubblefield
-
Patent number: 7133520Abstract: A method and apparatus are provided for assigning agents of an automatic call distributor to incoming calls of a plurality of call types handled by the automatic call distributor. The method includes the steps of determining a target occupancy matrix including a target occupancy for each agent of the agents of the automatic call distributor for each call type of the plurality of call types. The method further includes the steps of processing a call of a first type of the types determined in the target occupancy matrix and assigning the call to an agent of the agents of the automatic call distributor with a largest relative difference between an actual occupancy of calls of the first type handled by the agent and the target occupancy of calls of the first type determined for the agent in the target occupancy matrix.Type: GrantFiled: April 27, 1999Date of Patent: November 7, 2006Assignee: Rockwell Electronic Commerce Technologies, LLCInventors: Robert Doyle, Laird C. Williams, Kenneth W. Fertig, Xuemei Wang, N. Serdar Uckun