Recently several simply computed graph theoretic measures of computer program complexity, testing and unstructuredness have been proposed. Most of them are based on a static analysis of the program graph. One of the best known and most widely accepted is the cyclomatic number. Another is the number of knots, or...
A graph fold is the special case of a graph homomorphism where the two identified vertices are both adjacent to a common vertex. Like homomorphisms, folds are related to the chromatic number and we obtain an Interpolation Theorem for folds. If X(G) = n, then G is absolutely n-chromatic if...
Local stability seems to imply global stability for population models. To investigate this claim, we formally define a population model. This definition seems to include the one-dimensional discrete models now in use. We derive a necessary and sufficient condition for the global stability of our defined class of models. We...
This monograph presents a proof grammar for a formal language containing property symbols of every finite type. The proof grammar is thus applicable to any finite level higher-order logic.
The unique features of this system are: first, its mode of presentation as a recursive discourse grammar rigorously constructed from the...
This report includes information concerning experimental use of unregistered pesticides or unregistered uses of pesticides. Experimental results should not be interpreted as recommendations for use. Use of unregistered materials or use of any registered pesticides inconsistent with its label is against both Federal Law and State Law.
Results of 1977 and 1978 field trials of weed control research in horticultural crops are given in this report. These studies were conducted by the research staff at Corvallis.
Funds and supplies from the various companies of the agricultural chemical industry with products included in this report are gratefully acknowledged,
A general model of interactive problem solving is described. The model views interactive problem solving to be the product of cooperating subsystems. The operative subsystem selectively attends to and manipulates problem relevant information in search of a solution. The descriptive subsystem is capable of interpreting this behavior and of discussing...
A tour of a graph (digraph, or sequential machine) is a sequence of nodes from the graph such that each node appears at least once and two nodes are adjacent in the sequence only if they are adjacent in the graph. Finding the shortest tour. of a graph is known...