We present a pattern matching approach to the problem of misuse detection in a computer system, which is formalized as the problem of multiple approximate pattern matching. This permits very fast searching of potential attacks. We study the probability of matching of the model and its relation to the filtering efficiency of potential attacks within large audit trails. Experimental results show ...

Searching the Internet effectively necessitates the use of contemporary software programs commonly known as "search engines" to locate desired and meaningful information. Knowing how to effectively and efficiently utilize such search engines is critical for effective and efficient knowledge-seeking activities by the practitioner. Three categories of search engines are described in this article ...

In order to solve the permutation flow shop scheduling problem, a multipopulation and self-adaptive genetic algorithm based on simulated annealing is proposed in this paper. For the precocity problem of traditional genetic algorithm, the multi-population coevolution strategy is adopted. We introduce a squared term to improve traditional self-adaptive genetic operators, which can increase the se...

We formulate the Generalized Pattern Matching decision problem, a natural extension of string searching capturing regularities across scale. The special case of Unavoidability Testing is obtained for pure generalized patterns by fixing an appropriate family of text strings – the Zimin words. We investigate the complexity of the known methods for solving this restricted decision problem. Althoug...

We formalize weighted dependency parsing as searching for maximum spanning trees (MSTs) in directed graphs. Using this representation, the parsing algorithm of Eisner (1996) is sufficient for searching over all projective trees inO(n3) time. More surprisingly, the representation is extended naturally to non-projective parsing using Chu-Liu-Edmonds (Chu and Liu, 1965; Edmonds, 1967) MST algorith...

A high-performance algorithm for searching for frequent patterns (FPs) in transactional databases is presented. The search for FPs is carried out by using an iterative sieve algorithm by computing the set of enclosed cycles. In each inner cycle of level m FPs composed of m elements are generated. The assigned number of enclosed cycles (the parameter of the problem) defines the maximum length of...

Human body tracking is useful in applications like medical diagnostic, human computer interface, visual surveillance etc. In this paper, a trajectory-learning algorithm using wavenet is proposed to track human body in real time without sacrificing accuracy. Human body is located within a small searching window using color and shape as heuristic. The location and size of the searching window are...

The complex pattern of mines made by leafminers is postulated to hinder the host-searching behaviour of parasitoids, and if this is true, parasitoids should have evolved strategies of searching mines in a way that will achieve the highest efficiency. We investigated the possible deterrent effect of mine pattern complexity on a parasitoid searching for a host within a patch, and the searching be...

For the problem that the energy efficiency of the cloud computing data center is low, from the point of view of the energy efficiency of the servers, we propose a new energy-efficient multi-job scheduling model based on Google’s massive data processing framework. To solve this model, we design a practical encoding and decoding method for the individuals and construct an overall energy efficienc...

Traveling sales man problem with precedence constraints is one of the most notorious problems in terms of the efficiency of its solution approach, even though it has very wide range of industrial applications. We propose a new evolutionary algorithm to efficiently obtain good solutions by improving the search process. Our genetic operators guarantee the feasibility of solutions over the generat...