Received Jan 2, 2018 Revised Mar 9, 2018 Accepted Mar 24, 2018 In recent times complex software systems are continuously generating application and server logs for the events which had occurred in the past. These generated logs can be utilized for anomaly and intrusion detection. These log files can be used for detecting certain types of abnormalities or exceptions such as spikes in HTTP reques...

We present properties of multihead two-way probabilistic nite automata that parallel those of their deterministic and nondeterministic counterparts. We deene multihead proba-bilistic nite automata with log-space constructible transition probabilities, and we describe a simple technique to simulate these automata by standard log-space probabilistic Turing machines. Next, we represent log-space p...

Query auto-completion (QAC) is a common interactive feature for assisting users during query formulation. Following each query input keystroke, QAC suggests queries prefixed by the input characters; allowing the user to avoid further cognitive and physical effort if any are acceptable. To rank suggestions, QAC approaches typically aggregate past query popularity to determine the likelihood of a...

Searching in partially ordered structures has been considered in the context of information retrieval and efficient tree-like indexes, as well as in hierarchy based knowledge representation. In this paper we focus on tree-like partial orders and consider the problem of identifying an initially unknown vertex in a tree by asking edge queries: an edge query e returns the component of T − e contai...

Recent work BJKTV has shown that parallel algorithms that are sensitive to the size of the input domain can improve on more general parallel algorithms The cited paper demonstrates an O log log log s step algorithm on an n processor CRCW PRAM for nding the pre x maxima of n numbers in the range s This paper proves a lower bound demonstrating that no algorithm is asymptotically faster as a funct...

 The speech translation (ST) problem can be formulated as a log-linear model with multiple features that capture different levels of dependency between the input voice observation and the output translations. However, while the log-linear model itself is of discriminative nature, many of the feature functions are derived from generative models, which are usually estimated by conventional maxim...

Spike-timing-dependent plasticity (STDP) modifies the weight (or strength) of synaptic connections between neurons and is considered to be crucial for generating network structure. It has been observed in physiology that, in addition to spike timing, the weight update also depends on the current value of the weight. The functional implications of this feature are still largely unclear. Additive...

An ever present goal of seismic processing and inversion is to extract meaningful geology information from seismic data. The simplest possibility is to invert for seismic impedances, or, considering density constant, invert for velocities. Here I use a micro genetic algorithm program to achieve this goal. I use a real sonic log to compute a synthetic seismic trace and then use that trace as inp...

We give a tight analysis of an old and popular sweep-line heuristic for constructing a spanning tree of a set of n points in the plane. The algorithm sweeps a vertical line across the input points from left to right, and each point is connected by a straight line segment to the closest point left of (or on) the sweep-line. If W denotes the weight the Euclidean minimum spanning tree (EMST), the ...

In this paper, we consider the problem for finding an induced cycle passing through k given vertices, which we call the induced cycle problem. The significance of finding induced cycles stems from the fact that precise characterization of perfect graphs would require structures of graphs without an odd induced cycle, and its complement. There has been huge progress in the recent years, especial...