SearcharxivSearch

arXiv subjects

Ronnie Mainieri

Publications and source records attributed to Ronnie Mainieri.

13 recordsLinked to original sources

Computer activity learning from system call time series

Using a previously introduced similarity function for the stream of system calls generated by a computer, we engineer a program-in-execution classifier using deep learning methods. Tested on malware classification, it significantly outperforms current state of the art. We provide a series of performance measures and tests to demonstrate the capabilities, including measurements from production use. We show how the system scales linearly with the number of endpoints. With the system we estimate the total number of malware families created over the last 10 years as 3450, in line with reasonable economic constraints. The more limited rate for new malware families than previously acknowledged implies that machine learning malware classifiers risk being tested on their training set; we achieve F1 = 0.995 in a test carefully designed to mitigate this risk.

cs.CR

Trace formulas for stochastic evolution operators: Smooth conjugation method

The trace formula for the evolution operator associated with nonlinear stochastic flows with weak additive noise is cast in the path integral formalism. We integrate over the neighborhood of a given saddlepoint exactly by means of a smooth conjugacy, a locally analytic nonlinear change of field variables. The perturbative corrections are transfered to the corresponding Jacobian, which we expand in terms of the conjugating function, rather than the action used in defining the path integral. The new perturbative expansion which follows by a recursive evaluation of derivatives appears more compact than the standard Feynman diagram perturbation theory. The result is a stochastic analog of the Gutzwiller trace formula with the ``hbar'' corrections computed an order higher than what has so far been attainable in stochastic and quantum-mechanical applications.

chao-dyn

Trace formulas for stochastic evolution operators: Weak noise perturbation theory

Periodic orbit theory is an effective tool for the analysis of classical and quantum chaotic systems. In this paper we extend this approach to stochastic systems, in particular to mappings with additive noise. The theory is cast in the standard field theoretic formalism, and weak noise perturbation theory written in terms of Feynman diagrams. The result is a stochastic analog of the next-to-leading hbar corrections to the Gutzwiller trace formula, with long time averages calculated from periodic orbits of the deterministic system. The perturbative corrections are computed analytically and tested numerically on a simple 1-dimensional system.

chao-dyn

THE CONVERGENCE OF CHAOTIC INTEGRALS

We review the convergence of chaotic integrals computed by Monte Carlo simulation, the trace method, dynamical zeta function, and Fredholm determinant on a simple one-dimensional example: the parabola repeller. There is a dramatic difference in convergence between these approaches. The convergence of the Monte Carlo method follows an inverse power law, whereas the trace method and dynamical zeta function converge exponentially, and the Fredholm determinant converges faster than any exponential.

chao-dyn

Geometrization of spin systems using cycle expansions

It is shown that a spin system with long range interactions can be converted into a chaotic dynamical system that is differentiable and low-dimensional. The thermodynamic limit of the spin system is then equivalent to studying the long term behavior of the dynamical system. Cycle expansions of chaotic systems (expansion of the Fredholm determinant) are then used to study the thermodynamic limit. By considering the smooth dynamical system, it is possible to converge to the thermodynamic limit faster than with transfer matrices.

chao-dyn

Cycle expansions with pruned orbits have branch points

Cycle expansions are an efficient scheme for computing the properties of chaotic systems. When enumerating the orbits for a cycle expansion not all orbits that one would expect at first are present --- some are pruned. This pruning leads to convergence difficulties when computing properties of chaotic systems. In numerical schemes, I show that pruning reduces the number of reliable eigenvalues when diagonalizing quantum mechanical operators, and that pruning slows down the convergence rate of cycle expansion calculations. I then exactly solve a diffusion model that displays chaos and show that its cycle expansion develops a branch point.

chao-dyn

Observation of Conservations Laws in Diffusion Limited Aggregation

We repeat the numerical experiments for diffusion limited aggregation (DLA) and show that there is a potentially infinite set of conserved quantities for the long time asymptotics. We connect these observations with the exact integrability of the continuum limit of the DLA (quasi-static Stefan problem). The conserved quantities of the Stefan problem (harmonic moments) when discretized are our conserved quantities. These numerical experiments show that the exact integrability of the Stefan problem may be continued beyond the formation of cusps in the moving boundary.

patt-sol

Design Constraints for Nanometer Scale Quantum Computers

Nanometer scale electronics present a challenge for the computer architect. These quantum devices have small gain and are difficult to interconnect. I have analyzed current device capabilities and explored two general design requirements for the design of computers: error correction and long range connections. These two principles follow when Turing machines are implemented as integrated circuits. I consider the roles of electromigration through thin wires, circuit layout, and error rates for devices with small gain. The analysis brings into sharp focus the future of nanocomputers and suggests solutions to some of its difficulties. It gives a theoretical model for a nanocomputer, separating the roles of devices and algorithms. Within the model one can implement a stochastic computer, which operates despite quantum device limitations.

cond-mat

Dynamic Scaling Function at the Quasiperiodic Transition to Chaos

We obtain a five-step approximation to the quasiperiodic dynamic scaling function for experimental Rayleigh-Be'nard convection data. When errors are taken into account in the experiment, the f(alpha) spectrum of scalings is equivalent to just two of these five scales. To overcome this limitation, we develop a robust technique for extracting the scaling function from experimental data by reconstructing the dynamics of the experiment.

chao-dyn

Phase shift in experimental trajectory scaling functions

For one dimensional maps the trajectory scaling functions is invariant under coordinate transformations and can be used to compute any ergodic average. It is the most stringent test between theory and experiment, but so far it has proven difficult to extract from experimental data. It is shown that the main difficulty is a dephasing of the experimental orbit which can be corrected by reconstructing the dynamics from several time series. From the reconstructed dynamics the scaling function can be accurately extracted.

chao-dyn

On the equality of Hausdorff and box counting dimensions

By viewing the covers of a fractal as a statistical mechanical system, the exact capacity of a multifractal is computed. The procedure can be extended to any multifractal described by a scaling function to show why the capacity and Hausdorff dimension are expected to be equal.

chao-dyn

Can averaged orbits be used to extract scaling functions?

Trajectory scaling functions are the basic element in the study of chaotic dynamical systems, from which any long time average can be computed. It has never been extracted from an experimental time series the reason being its sensitivity to noise. It is shown, by numerical simulations, that the sensitivity of the scaling function is to drift in the control parameters, and not noise. It is also explained how naive averaging of the orbit points may lead to erroneous results.

chao-dyn

Zeta function for the Lyapunov exponent of a product of random matrices

A cycle expansion for the Lyapunov exponent of a product of random matrices is derived. The formula is non-perturbative and numerically effective, which allows the Lyapunov exponent to be computed to high accuracy. In particular, the free energy and the heat capacity are computed for the one-dimensional Ising model with quenched disorder. The formula is derived by using a Bernoulli dynamical system to mimic the randomness.

chao-dyn