Method and system for heuristically designing and managing a network
First Claim
1. A method performing complex combinations of functionality on a system, and for heuristically defining and modifying such functionality, the method comprising:
- a) acquiring data about the system, at each of a plurality of points in time, from each of at least one data domain through which data is available from the system;
b) identifying combinations of data which recur;
c) associating a repetition cluster with each combination of data which recurs;
d) executing an action associated with a corresponding repetition cluster;
e) acquiring from each of the at least one data domains data corresponding to the consequences of executing each of the actions;
f) determining from data derived from the consequences of actions associated with corresponding repetition clusters of data which actions are desirable; and
g) increasing the probability that a desirable action will be executed when a combination of data is acquired which substantially corresponds to a repetition cluster associated wit the desirable action.
11 Assignments
0 Petitions
Accused Products
Abstract
A method for performing combinations of functions which can heuristically modify the functional components of the machine, separate such functional components down to the device level, and optimize the distribution of information between the functional components, by defining the domains for the network, acquiring data for each domain at each of a plurality of points in time, creating repetition clusters by looking for combinations of data that recur, identifying action to be performed based on the repetition clusters; and acquiring data from the consequences of actions performed.
-
Citations
25 Claims
-
1. A method performing complex combinations of functionality on a system, and for heuristically defining and modifying such functionality, the method comprising:
-
a) acquiring data about the system, at each of a plurality of points in time, from each of at least one data domain through which data is available from the system;
b) identifying combinations of data which recur;
c) associating a repetition cluster with each combination of data which recurs;
d) executing an action associated with a corresponding repetition cluster;
e) acquiring from each of the at least one data domains data corresponding to the consequences of executing each of the actions;
f) determining from data derived from the consequences of actions associated with corresponding repetition clusters of data which actions are desirable; and
g) increasing the probability that a desirable action will be executed when a combination of data is acquired which substantially corresponds to a repetition cluster associated wit the desirable action. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9)
-
-
10. A machine having a functional architecture configured for performing complex, heuristically defined functions on a system, and which architecture permits the machine to be readily copied, created, and repaired, and the functionary to be readily modified, the machine comprising:
-
a) at least one clustering function connected for acquiring data about the system, at each of a plurality of points in time, from each of at least one data domain of the system, the at least one clustering function having an array of first devices arranged in an hierarchical organization of repetition definition and detection clusters within the machine for identifying repetitions of information conditions from the data domains and generating at least one action recommendation from the identified repetitions of information conditions; and
b) at least one competition function connected to the at least one clustering function for receiving the at least one action recommendation, the at least one competition function having an array of second devices arranged in an hierarchical organization of clusters, which second devices are adapted for associating the at least one action recommendation with system actions, and for selecting a single action recommendation according to predetermined criteria of desirability, the at least one competition function being further connected for transmitting the selected action to the network. - View Dependent Claims (11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25)
-
Specification