Method and system for the detection of anomalous behavior in systems displaying typical and complex behavior encoded in a digital signal through the study of a computational model (artificial system) of interacting agents defined using the information contained in the digital signal and imposing that agents engage in a maximally frustrated dynamics. Changes in the target system's behavior lead a measurable decrease in frustration of the artificial system, from sequences never presented before during the system's normal behavior or combinations of already presented sequences never seen together.
Please help me write a proper abstract based on the patent claims. CLAIM: 1. A method for the detection of anomalous sequences in a digital signal to be tested as compared to an initial digital signal, divided in three stages designated by repertoire education, calibration and detection, wherein: using agents, and where each agent comprises: 1) a sequence with d digits, referred to as a ligand; 2) a list with a plurality of sequences with d digits, referred to as a receptor; 3) a state, indicating when it is off, in which case the agent is said to be alone, or if it is on, in which case with another agent it is said to be paired; 4) a connectivity list, in which is listed a selection of other agents with which the agent can interact; Comprising the following steps: a) initializing a population of presenter agents each one from a set of sequences taken from a pre-established number of sequences defined from a training digital signal, during the education and calibration stages, or from a signal to be tested, in the detection stage; b) initializing a population of detector agents; c) during a time to be established, it is done: i) interacting between presenter and detector agents; ii) replacing detector agents that do not form pairs after a pre-established time, calling this action a positive selection and applying it during the education of the first population to be included in the detection repertoire; iii) replacing detector agents that are paired a presenter agent for a time longer than a pre-established time, calling this action as a negative selection and applying it during the education of the repertoire; iv) replacing detector agents terminating pairings longer than a pre-established time duration and not forming a new pairing, by other equivalent detector agents in the repertoire, calling this action anergy and applying it during the calibration and anomaly detection; d) adding the educated population of detector agents to a repertoire of detector agents during the repertoire education stage; e) detecting any possible increase in the duration and number of long pairings between presenter and detector agents and/or any possible increase in the duration and number of times detector agents are not paired, signaling the presence of anomalous sequences or anomalous combinations of known sequences; and for the said interaction pairing agents of the opposite types: a′) when two agents are not paired, whenever for both agents the other agent's ligand is listed in its receptor; b′) when an agent is not paired and the other is paired, whenever in the receptor of the agent that is not paired is the other agent's ligand, and the receptor of the paired agent prefers the ligand of the agent not paired to the ligand of agent to which it is paired; c′) when two agents are already paired, whenever for both agents their receptors prefer the ligand of the other agent to the ligand of the agent to which they are paired. 2. A method according to claim 1, wherein repeating steps from a) to c) a predefined number of times, and in each case, adding a population of the obtained detector agents in a repertoire of educated detector agents. 3. A method according to claim 1, wherein the initialization of a population of detector agents comprising for each detector agent: a) the assignment of a cluster, denoted C, being C a random integer between 1 and the number of clusters, denoted Nc; b) the initialization of a ligand to the number assigned to the cluster; c) the initialization of a receptor with an ordered list of randomly distributed ligands; d) the initialization of a connectivity list with a random list of presenter agents; e) the initialization of the agent's state to zero. 4. A method according to claim 1, wherein the initialization of a population of presenter agents comprising for each presenter agent: a) the assignment of a cluster, denoted C, defined from the template sequences presented by this presenter agent, being C an integer between 1 and the number of clusters, denoted Nc; b) the initialization of the ligand with a template sequence associated to this presenter agent; c) the initialization of the receptor with an ordered list R(i) using the rule R(i)=C+i−1 (mod Nc), being i an integer between 1 and Nc; d) the initialization of the connectivity list as a ordered list of all detector agents in which connectivity lists the present presenter agent; e) the initialization of the agent's state as off. 5. A method according to claim 1 comprising for each agent: a) the initialization and recording of the time duration during which the agent's pairing remains unchanged; b) the initialization and recording of the time duration during which the agent remains unpaired. 6. A method according to claim 1, wherein in the positive selection, a detector agent is replaced by another identical detector agent but where it is replaced: a) its receptor; b) its connectivity list; c) its cluster C. 7. A method according to claim 1, wherein updating the pre-established positive selection time used in positive selection to the largest time duration, a detector agent remained not paired in a recent previously established period of time, whenever no agents verify the positive selection elimination condition. 8. A method according to claim 1, wherein when eliminated by negative selection, a detector agent is replaced by another identical detector agent where it is replaced: a) its receptor; b) its connectivity list; c) its state to off, as well as that of the agent it was paired with. 9. A method according to claim 1, wherein updating the negative selection predefined time used in the negative selection condition, to the largest time duration a detector agent remained paired, whenever no agents verify the negative selection elimination condition. 10. A method according to claim 2, wherein during negative selection, the detector agent being replaced by another identical detector agent for which: a) its receptor is replaced by a list given by a random permutation of the list to be replaced; b) its state is turned off, as well as that of the agent it was paired with. 11. A method according to claim 1, wherein on step c), at each pre-established period of time, the population of presenter agents is reinitialized, being each agent reinitialized from a new template sequence with a pre-established number of sequences taken from the digital training signal. 12. A method according to claim 1, wherein one or more time durations being defined by the number of iterations performed at a given iteration of the method. 13. A method according to claim 12 characterized for detecting possible increases in pairing lifetimes between presenter and detector agents and/or possible increases in the time detector agents spent unpaired, by comparing these time durations to values obtained after executing the method with a testing and a training signal. 14. A method according to claim 13, wherein using in the mentioned comparison a constant parameter, ε, threshold, predefined to reduce false positive errors. 15. A computer program comprising the computer code required to accomplish the steps involved in the preferred method when the given program is run in a data processing system. 16. A computer readable medium incorporating the previous computer program. 17. A data processing system for the detection of anomalous sequences in a digital signal to be tested and compared to a training digital signal characterized by being configured to execute the method of claim 1. 18. A method according to claim 2, wherein the initialization of a population of detector agents comprising for each detector agent: a) the assignment of a cluster, denoted C, being C a random integer between 1 and the number of clusters, denoted Nc; b) the initialization of a ligand to the number assigned to the cluster; c) the initialization of a receptor with an ordered list of randomly distributed ligands; d) the initialization of a connectivity list with a random list of presenter agents; e) the initialization of the agent's state to zero. 19. A method according to claim 2, wherein the initialization of a population of presenter agents comprising for each presenter agent: a) the assignment of a cluster, denoted C, defined from the template sequences presented by this presenter agent, being C an integer between 1 and the number of clusters, denoted Nc; b) the initialization of the ligand with a template sequence associated to this presenter agent; c) the initialization of the receptor with an ordered list R(i) using the rule R(i)=C+i−1 (mod Nc), being i an integer between 1 and Nc; d) the initialization of the connectivity list as a ordered list of all detector agents in which connectivity lists the present presenter agent; e) the initialization of the agent's state as off. 20. A method according to claim 2 comprising for each agent: a) the initialization and recording of the time duration during which the agent's pairing remains unchanged; b) the initialization and recording of the time duration during which the agent remains unpaired.