Discrete orbits, recurrence and solvable subgroups of Diff(C^2,0)

We discuss the local dynamics of a subgroup of Diff(C^2,0) possessing locally discrete orbits as well as the structure of the recurrent set for more general groups. It is proved, in particular, that a subgroup of Diff(C^2,0) possessing locally discrete orbits must be virtually solvable. These results are of considerable interest in problems concerning integrable systems.Comment: The first version of this paper and "A note on integrability and finite orbits for subgroups of Diff(C^n,0)" are an expanded version of our paper "Discrete orbits and special subgroups of Diff(C^n,0)". An intermediate version re-submitted to the journal on March 2015 is available at http://www.fep.up.pt/docentes/hreis/publications.htm where there is also a comparison between these 3 version

LibCPIXE: a PIXE simulation open-source library for multilayered samples

Most particle induced X-ray emission (PIXE) data analysis codes are not focused on handling multilayered samples. We have developed an open-source library called "LibCPIXE", for PIXE data analysis. It is written in standard C and implements functions for simulating X-ray yields of PIXE spectra taken from arbitrary samples, including multilayered targets. The library is designed to be fast, portable, modular and scalable, as well as to facilitate its incorporation into any existing program. In order to demonstrate the capabilities of the library, a program called CPIXE was developed and used to analyze various real samples involving both bulk and layered samples. Just as the library, the CPIXE source code is freely available under the General Public License. We demonstrate that it runs both under GNU/Linux systems as well as under MS Windows. There is in principle no limitation to port it to other platforms

Quantum evolution of scalar fields in Robertson-Walker space-time

We study the $\lambda \phi^4$ field theory in a flat Robertson-Walker space-time using the functional Sch\"odinger picture. We introduce a simple Gaussian approximation to analyze the time evolution of pure states and we establish the renormalizability of the approximation. We also show that the energy-momentum tensor in this approximation is finite once we consider the usual mass and coupling constant renormalizations.Comment: Revtex file, 19 pages, no figures. Compressed ps version available at http://phenom.physics.wisc.edu/pub/preprints/1995/madph-95-912.ps.Z or at ftp://phenom.physics.wisc.edu/pub/preprints/1995/madph-95-912.ps.

Eliminating Network Protocol Vulnerabilities Through Abstraction and Systems Language Design

Incorrect implementations of network protocol message specifications affect the stability, security, and cost of network system development. Most implementation defects fall into one of three categories of well defined message constraints. However, the general process of constructing network protocol stacks and systems does not capture these categorical con- straints. We introduce a systems programming language with new abstractions that capture these constraints. Safe and efficient implementations of standard message handling operations are synthesized by our compiler, and whole-program analysis is used to ensure constraints are never violated. We present language examples using the OpenFlow protocol

Analysis of a test method for measuring resonant frequencies of loaded hydraulic feed lines

Analysis of test facility for measuring resonant frequencies of fluid feed line

Scaling in the crossover from random to correlated growth

In systems where deposition rates are high compared to diffusion, desorption and other mechanisms that generate correlations, a crossover from random to correlated growth of surface roughness is expected at a characteristic time t_0. This crossover is analyzed in lattice models via scaling arguments, with support from simulation results presented here and in other authors works. We argue that the amplitudes of the saturation roughness and of the saturation time scale as {t_0}^{1/2} and t_0, respectively. For models with lateral aggregation, which typically are in the Kardar-Parisi-Zhang (KPZ) class, we show that t_0 ~ 1/p, where p is the probability of the correlated aggregation mechanism to take place. However, t_0 ~ 1/p^2 is obtained in solid-on-solid models with single particle deposition attempts. This group includes models in various universality classes, with numerical examples being provided in the Edwards-Wilkinson (EW), KPZ and Villain-Lai-Das Sarma (nonlinear molecular-beam epitaxy) classes. Most applications are for two-component models in which random deposition, with probability 1-p, competes with a correlated aggregation process with probability p. However, our approach can be extended to other systems with the same crossover, such as the generalized restricted solid-on-solid model with maximum height difference S, for large S. Moreover, the scaling approach applies to all dimensions. In the particular case of one-dimensional KPZ processes with this crossover, we show that t_0 ~ nu^{-1} and nu ~ lambda^{2/3}, where nu and lambda are the coefficients of the linear and nonlinear terms of the associated KPZ equations. The applicability of previous results on models in the EW and KPZ classes is discussed.Comment: 14 pages + 5 figures, minor changes, version accepted in Phys. Rev.