Efficient Regular Expression Pattern Matching for Network Intrusion Detection Systems using Modified Word-based Automata

Network Intrusion Detection Systems (NIDS) intercept the traffic at an organization's network periphery to thwart intrusion attempts. Signature-based NIDS compares the intercepted packets against its database of known vulnerabilities and malware signatures to detect such cyber attacks. These signatures are represented using Regular Expressions (REs) and strings. Regular Expressions, because of their higher expressive power, are preferred over simple strings to write these signatures. We present Cascaded Automata Architecture to perform memory efficient Regular Expression pattern matching using existing string matching solutions. The proposed architecture performs two stage Regular Expression pattern matching. We replace the substring and character class components of the Regular Expression with new symbols. We address the challenges involved in this approach. We augment the Word-based Automata, obtained from the re-written Regular Expressions, with counter-based states and length bound transitions to perform Regular Expression pattern matching. We evaluated our architecture on Regular Expressions taken from Snort rulesets. We were able to reduce the number of automata states between 50% to 85%. Additionally, we could reduce the number of transitions by a factor of 3 leading to further reduction in the memory requirements.

Multipath Dissemination in Regular Mesh Topologies

Mesh topologies are important for large-scale peer-to-peer systems that use low-power transceivers. The Quality of Service (QoS) in such systems is known to decrease as the scale increases. We present a scalable approach for dissemination that exploits all the shortest paths between a pair of nodes and improves the QoS. Despite th presence of multiple shortest paths in a system, we show that these paths cannot be exploited by spreading the messages over the paths in a simple round-robin manner; nodes along one of these paths will always handle more messages than the nodes along the other paths. We characterize the set of shortest paths between a pair of nodes in regular mesh topologies and derive rules, using this characterization, to effectively spread the messages over all the available paths. These rules ensure that all the nodes that are at the same distance from the source handle roughly the same number of messages. By modeling the multihop propagation in the mesh topology as a multistage queuing network, we present simulation results from a variety of scenarios that include link failures and propagation irregularities to reflect real-world characteristics. Our method achieves improved QoS in all these scenarios.

Nuclear magnetic resonance spectra of oriented bicyclic systems containing heteroatom(s):the spectrum of 2-thiocoumarin

From the proton nmr studies of 2-thiocoumarin and coumarin, it is concluded that the relative interproton distances in the two oxygen heteroatom bicyclic systems are similar. The values for the phenyl ring protons do not deviate significantly from the regular hexagonal geometry, unlike bicyclic systems with nitrogens as the heteroatoms, such as diazanaphthalenes. Larger values of the indirect spin-spin couplings within the protons of the ring containing the oxygen heteroatom, compared to the values between the ortho protons in the phenyl rings in coumarin and 2-thiocoumarin, correspond to the olefinic nature of these protons. This is in contrast to results for the nitrogen heterocycles where both the rings are aromatic.

Functional programming systems revisited

Functional Programming (FP) systems are modified and extended to form Nondeterministic Functional Programming (NFP) systems in which nondeterministic programs can be specified and both deterministic and nondeterministic programs can be verified essentially within the system. It is shown that the algebra of NFP programs has simpler laws in comparison with the algebra of FP programs. "Regular" forms are introduced to put forward a disciplined way of reasoning about programs. Finally, an alternative definition of "linear" forms is proposed for reasoning about recursively defined programs. This definition, when used to test the linearity of forms, results in simpler verification conditions than those generated by the original definition of linear forms.

Trends in the stability of ternary oxides: Systems M-Pb-O (M = Ca, Sr, Ba)

Recent experimental investigations of phase equilibria and thermodynamic properties of the systems M-Pb-O, where M = Ca, Sr or Ba, indicate a regular increase in thermodynamic stability of ternary oxides, MPbO3 and M2PbO4, with increasing basicity of the oxide of the alkaline-earth metal. Number of stable interoxide compounds at 1100 K in the systems M-Pb-O (M = Mg, Ca, Sr, Ba) increases in unit increments from Mg to Ba. In this paper, experimentally determined standard Gibbs energies of formation of M2PbO4 (M = Ca, Sr, Ba) and MPbO3 (M = Sr, Ba) from their component binary monoxides and oxygen gas are combined with an estimated value for CaPbO3 to delineate systematic trends in thermodynamic stability of the ternary oxides. The trends are interpreted using concepts of tolerance factor and acid-base interactions. All the ternary oxides in these systems contain lead in the tetravalent state. The small Pb4+ ions polarize the surrounding oxygen ions and cause the formation of oxyanions which are acidic in character. Hence, the higher oxidation state of lead is stabilized in the presence of basic oxides of alkaline-earth group. A schematic subsolidus temperature-composition phase diagram is presented for the system BaO-PbO-O-2 to illustrate the change in oxidation states in binary and ternary oxides with temperature.

Homonuclear NOE in spatially periodic spin systems

The nuclear Overhauser effect equations are solved analytically for a homonuclear group of spins whose sites are periodically arranged, including the special cases where the spins lie at the vertices of a regular polygon and on a one-dimensional lattice. t is shown that, for long correlation times, the equations governing magnetization transfer resemble a diffusion equation. Furthermore the deviation from exact diffusion is quantitatively related to the molecular tumbling correlation time. Equations are derived for the range of magnetization travel subsequent to the perturbation of a single spin in a lattice for both the case of strictly dipolar relaxation and the more general situation where additional T1 mechanisms may be active. The theory given places no restrictions on the delay (or mixing) times, and it includes all the spins in the system. Simulations are presented to confirm the theory.

Gain calibration of CCD systems at VBO

The system gain of two CCD systems in regular use at the Vainu Bappu Observatory, Kavalur, is determined at a few gain settings. The procedure used for the determination of system gain and base-level noise is described in detail. The Photometrics CCD system at the 1-m reflector uses a Thomson-CSF TH 7882 CDA chip coated for increased ultraviolet sensitivity. The gain is programme-selected through the parameter 'cgain' varying between 0 and 4095 in steps of 1. The inverse system gain for this system varies almost linearly from 27.7 electrons DN-1 at cgain = 0 to 1.5 electrons DN-1 at cgain = 500. The readout noise is less than or similar 11 electrons at cgain = 66. The Astromed CCD system at 2.3-m Vainu Bappu Telescope uses a GEC P8603 chip which is also coated for enhanced ultraviolet sensitivity. The amplifier gain is selected in discrete steps using switches in the controller. The inverse system gain is 4.15 electrons DN-1 at the gain setting of 9.2, and the readout noise approximately 8 electrons.

Monte-Carlo estimation of time-dependent statistical characteristics of random dynamical systems

The problem of estimating the time-dependent statistical characteristics of a random dynamical system is studied under two different settings. In the first, the system dynamics is governed by a differential equation parameterized by a random parameter, while in the second, this is governed by a differential equation with an underlying parameter sequence characterized by a continuous time Markov chain. We propose, for the first time in the literature, stochastic approximation algorithms for estimating various time-dependent process characteristics of the system. In particular, we provide efficient estimators for quantities such as the mean, variance and distribution of the process at any given time as well as the joint distribution and the autocorrelation coefficient at different times. A novel aspect of our approach is that we assume that information on the parameter model (i.e., its distribution in the first case and transition probabilities of the Markov chain in the second) is not available in either case. This is unlike most other work in the literature that assumes availability of such information. Also, most of the prior work in the literature is geared towards analyzing the steady-state system behavior of the random dynamical system while our focus is on analyzing the time-dependent statistical characteristics which are in general difficult to obtain. We prove the almost sure convergence of our stochastic approximation scheme in each case to the true value of the quantity being estimated. We provide a general class of strongly consistent estimators for the aforementioned statistical quantities with regular sample average estimators being a specific instance of these. We also present an application of the proposed scheme on a widely used model in population biology. Numerical experiments in this framework show that the time-dependent process characteristics as obtained using our algorithm in each case exhibit excellent agreement with exact results. (C) 2010 Elsevier Inc. All rights reserved.

Dynamically Reconfigurable Regular Expression Matching Architecture

Regular Expressions are generic representations for a string or a collection of strings. This paper focuses on implementation of a regular expression matching architecture on reconfigurable fabric like FPGA. We present a Nondeterministic Finite Automata based implementation with extended regular expression syntax set compared to previous approaches. We also describe a dynamically reconfigurable generic block that implements the supported regular expression syntax. This enables formation of the regular expression hardware by a simple cascade of generic blocks as well as a possibility for reconfiguring the generic blocks to change the regular expression being matched. Further,we have developed an HDL code generator to obtain the VHDL description of the hardware for any regular expression set. Our optimized regular expression engine achieves a throughput of 2.45 Gbps. Our dynamically reconfigurable regular expression engine achieves a throughput of 0.8 Gbps using 12 FPGA slices per generic block on Xilinx Virtex2Pro FPGA.

Computation of thermodynamic properties of quaternary and higher order systems from binary data using shortest distance composition paths

Equations for the computation of integral and partial thermodynamic properties of mixing in quarternary systems are derived using data on constituent binary systems and shortest distance composition paths to the binaries. The composition path from a quarternary composition to the i-j binary is characterized by a constant value of (Xi − Xj). The merits of this composition path over others with constant values for View the MathML source or Xi are discussed. Finally the equations are generalized for higher order systems. They are exact for regular solutions, but may be used in a semiempirical mode for non-regular solutions.