Recursive strategy

It is now clear how we can establish a recursive strategy to identify the measurements with gross errors ... 

One complication is that often property-changing operators can only be applied to a stream when certain other properties of the stream are within specified values, which may not be true at the time. For example, a method to select only crystals greater than a given size can be applied only if a stream contains solids. Similarly, a separation method expected to exploit relative volatility differences can be applied only if enthalpy conditions permit simultaneous liquid and vapor phases. If the preconditions for the immediate application of an operator believed to be useful are not met, a new design subproblem may be formulated whose objective is to reduce property differences between the initial stream and the conditions necessary for the application of the operator. This recursive strategy is a common feature of the means-ends analysis paradigm. 

What is the good of this set of results The key point is the identification of a recursive strategy for obtaining the partition function. In particular, in the present setting, we note that in the high-temperature limit, Z = 2 resulting in the... 

In this chapter, we also discussed several schemes that allow for the computation of scalar observables without explicit construction and storage of the eigenvectors. This is important not only numerically for minimizing the core memory requirement but also conceptually because such a strategy is reminiscent of the experimental measurement, which almost never measures the wave function explicitly. Both the Lanczos and the Chebyshev recursion-based methods for this purpose have been developed and applied to both bound-state and scattering problems by various groups. 

Results with Surgery and Radiation Therapy Trials of Chemotherapeutic Agents Recursive Partitioning Analysis Specific Therapy Considerations in non-GBM Malignant Gliomas Radiation Therapy Strategies Novel Chemotherapeutic Agents Future Directions References... 

In a related strategy termed recursive deconvolution [16], samples of all sublibraries at each stage are retained. With this approach it is not necessary to repeat the entire synthesis at each stage of the deconvolution. One simply adds the previously determined preferred synthons to the reserved sublibraries. 

Plan contexts define workflow strategies and systematic plans and can recursively contain contexts of all three types. 

We use an Artificial Intelligence technique called the Problem Decomposition Strategy (14, 15) to tackle this problem. We divide the problem of computing a quantity into a number of sub-problems, each involving the computation of a formula with several sub-quantities. When more than one formula is applicable, they are tried one by one. The entire problem space can be represented as an AND/OR tree, and a Depth-first Recursive Search is employed to traverse the tree. The leaf nodes represent quantities whose values are known. The search terminates at the leaf nodes and returns the value to the level above. When a dead-end is reached, the system progressively backtracks to the levels above in an attempt to select smother formula. If the complete search space is exhausted, the system reports that the problem is unsolvable and prompts the user for more information. 

---