Space Charges Can Significantly Affect the Dynamics of Accelerator Maps

Space charge effects can be very important for the dynamics of intense particle beams, as they repeatedly pass through nonlinear focusing elements, aiming to maximize the beam's luminosity properties in the storage rings of a high energy accelerator. In the case of hadron beams, whose charge distribution can be considered as "frozen" within a cylindrical core of small radius compared to the beam's dynamical aperture, analytical formulas have been recently derived \cite{BenTurc} for the contribution of space charges within first order Hamiltonian perturbation theory. These formulas involve distribution functions which, in general, do not lead to expressions that can be evaluated in closed form. In this paper, we apply this theory to an example of a charge distribution, whose effect on the dynamics can be derived explicitly and in closed form, both in the case of 2--dimensional as well as 4--dimensional mapping models of hadron beams. We find that, even for very small values of the "perveance" (strength of the space charge effect) the long term stability of the dynamics changes considerably. In the flat beam case, the outer invariant "tori" surrounding the origin disappear, decreasing the size of the beam's dynamical aperture, while beyond a certain threshold the beam is almost entirely lost. Analogous results in mapping models of beams with 2-dimensional cross section demonstrate that in that case also, even for weak tune depressions, orbital diffusion is enhanced and many particles whose motion was bounded now escape to infinity, indicating that space charges can impose significant limitations on the beam's luminosity.Comment: 16 pages, 4 figures, to appear in Physics Letters

Distributed computing methodology for training neural networks in an image-guided diagnostic application

Distributed computing is a process through which a set of computers connected by a network is used collectively to solve a single problem. In this paper, we propose a distributed computing methodology for training neural networks for the detection of lesions in colonoscopy. Our approach is based on partitioning the training set across multiple processors using a parallel virtual machine. In this way, interconnected computers of varied architectures can be used for the distributed evaluation of the error function and gradient values, and, thus, training neural networks utilizing various learning methods. The proposed methodology has large granularity and low synchronization, and has been implemented and tested. Our results indicate that the parallel virtual machine implementation of the training algorithms developed leads to considerable speedup, especially when large network architectures and training sets are used

Improved sign-based learning algorithm derived by the composite nonlinear Jacobi process

In this paper a globally convergent first-order training algorithm is proposed that uses sign-based information of the batch error measure in the framework of the nonlinear Jacobi process. This approach allows us to equip the recently proposed Jacobi–Rprop method with the global convergence property, i.e. convergence to a local minimizer from any initial starting point. We also propose a strategy that ensures the search direction of the globally convergent Jacobi–Rprop is a descent one. The behaviour of the algorithm is empirically investigated in eight benchmark problems. Simulation results verify that there are indeed improvements on the convergence success of the algorithm

Generalization of the Apollonius theorem for simplices and related problems

The Apollonius theorem gives the length of a median of a triangle in terms of the lengths of its sides. The straightforward generalization of this theorem obtained for m-simplices in the n-dimensional Euclidean space for n greater than or equal to m is given. Based on this, generalizations of properties related to the medians of a triangle are presented. In addition, applications of the generalized Apollonius' theorem and the related to the medians results, are given for obtaining: (a) the minimal spherical surface that encloses a given simplex or a given bounded set, (b) the thickness of a simplex that it provides a measure for the quality or how well shaped a simplex is, and (c) the convergence and error estimates of the root-finding bisection method applied on simplices

How does the Smaller Alignment Index (SALI) distinguish order from chaos?

The ability of the Smaller Alignment Index (SALI) to distinguish chaotic from ordered motion, has been demonstrated recently in several publications.\cite{Sk01,GRACM} Basically it is observed that in chaotic regions the SALI goes to zero very rapidly, while it fluctuates around a nonzero value in ordered regions. In this paper, we make a first step forward explaining these results by studying in detail the evolution of small deviations from regular orbits lying on the invariant tori of an {\bf integrable} 2D Hamiltonian system. We show that, in general, any two initial deviation vectors will eventually fall on the ``tangent space'' of the torus, pointing in different directions due to the different dynamics of the 2 integrals of motion, which means that the SALI (or the smaller angle between these vectors) will oscillate away from zero for all time.Comment: To appear in Progress of Theoretical Physics Supplemen

Particle Swarm Optimization: An efficient method for tracing periodic orbits in 3D galactic potentials

We propose the Particle Swarm Optimization (PSO) as an alternative method for locating periodic orbits in a three--dimensional (3D) model of barred galaxies. We develop an appropriate scheme that transforms the problem of finding periodic orbits into the problem of detecting global minimizers of a function, which is defined on the Poincar\'{e} Surface of Section (PSS) of the Hamiltonian system. By combining the PSO method with deflection techniques, we succeeded in tracing systematically several periodic orbits of the system. The method succeeded in tracing the initial conditions of periodic orbits in cases where Newton iterative techniques had difficulties. In particular, we found families of 2D and 3D periodic orbits associated with the inner 8:1 to 12:1 resonances, between the radial 4:1 and corotation resonances of our 3D Ferrers bar model. The main advantages of the proposed algorithm is its simplicity, its ability to work using function values solely, as well as its ability to locate many periodic orbits per run at a given Jacobian constant.Comment: 12 pages, 8 figures, accepted for publication in MNRA