Computational automation for global objectives
First Claim
1. A computational automation system comprising:
- a) an executive driver which is a main program of a computing system that maintains a plurality of files opened to support the mission of computational automation, which allows a very large number of executions of various objective tasks, computational or non-computational, for an entire session until calling for exit by user'"'"'s menu choice;
b) a symbolic numeric interpreter means that reads in input as character string and decomposes the string into symbols and numeric quantities ready for decoders to process further;
c) a pair of decoding means comprising means for determining the content of the symbolic-numeric input and means for organizing system actions and responses by calling at least one specific objective task subroutine and passing information required by the objective task subroutine to indicated locations;
d) a main menu means for programs of a common class that offers three input options, namely sequential input means using a switching means which comprises means for indicating the end of the sequential input means, computer guided random order symbolic-numeric input means, and free symbolic-numeric input means;
e) a collection of CAE objective task programs stored in the system in the form of building blocks at user'"'"'s disposal which can be used separately to do one task at time, or combinatively to do one task after another until all are done;
f) means for performing parametric study, also called domain analysis on at least one computational method by performing a plurality of executions of the computational method with input data generated by automation, with ranges, parameters, and goals all under user'"'"'s control, and sending the output data to a graphical output device wherein for the computational method a determination of parametric/domain'"'"'s effect caused by algorithm dependent digital computational nature is made and is without uncertainty of possible human errors;
g) means for performing other much simple or more advanced automation in form of added tasks or through users own free experimentation of new communication power and session log file convenience, unlimited new algorithms of automation can be readily generated this way, such that in principle with such tool no one need to duplicate the exactly same manual session twice.
0 Assignments
0 Petitions
Accused Products
Abstract
A method has been established for dealing with computational automation for global objective that pursues the final purpose of computation rather than the computations alone. The global objective programming allows users to use simple symbolic-numeric input to access the flexible usage of solvers for multiple purposes. It enables various levels of computer automation in procedural objective tasks and computational objective tasks to be executed separately or combinatively under very simple common rules of symbolic-numeric statements input at run time. This kind of automation is vital in tapping the enormous power, credibility, and reliability of computers for computation. Needless manual effort that doesn'"'"'t contribute to the better understanding of analyses, tends to contribute to inefficiency at best, and provide the excuse of "to err is human" at worst. The user-involved-flexible-computational-automation offers users the opportunities to understand the key issues for solutions being sought, the power to question the computer'"'"'s results, and the leeway to see the computer'"'"'s own proofs. In this way, the goal to make designers regain their analytical tools and engineers to restore their engineering confidence in the computer age can be placed within comfortable reach.
23 Citations
5 Claims
-
1. A computational automation system comprising:
-
a) an executive driver which is a main program of a computing system that maintains a plurality of files opened to support the mission of computational automation, which allows a very large number of executions of various objective tasks, computational or non-computational, for an entire session until calling for exit by user'"'"'s menu choice; b) a symbolic numeric interpreter means that reads in input as character string and decomposes the string into symbols and numeric quantities ready for decoders to process further; c) a pair of decoding means comprising means for determining the content of the symbolic-numeric input and means for organizing system actions and responses by calling at least one specific objective task subroutine and passing information required by the objective task subroutine to indicated locations; d) a main menu means for programs of a common class that offers three input options, namely sequential input means using a switching means which comprises means for indicating the end of the sequential input means, computer guided random order symbolic-numeric input means, and free symbolic-numeric input means; e) a collection of CAE objective task programs stored in the system in the form of building blocks at user'"'"'s disposal which can be used separately to do one task at time, or combinatively to do one task after another until all are done; f) means for performing parametric study, also called domain analysis on at least one computational method by performing a plurality of executions of the computational method with input data generated by automation, with ranges, parameters, and goals all under user'"'"'s control, and sending the output data to a graphical output device wherein for the computational method a determination of parametric/domain'"'"'s effect caused by algorithm dependent digital computational nature is made and is without uncertainty of possible human errors; g) means for performing other much simple or more advanced automation in form of added tasks or through users own free experimentation of new communication power and session log file convenience, unlimited new algorithms of automation can be readily generated this way, such that in principle with such tool no one need to duplicate the exactly same manual session twice. - View Dependent Claims (2, 3, 4, 5)
-
Specification