FNT-based reed-solomon erasure codes

This paper presents a new construction of Maximum-Distance Separable (MDS) Reed-Solomon erasure codes based on Fermat Number Transform (FNT). Thanks to FNT, these codes support practical coding and decoding algorithms with complexity O(n log n), where n is the number of symbols of a codeword. An open-source implementation shows that the encoding speed can reach 150Mbps for codes of length up to several 10,000s of symbols. These codes can be used as the basic component of the Information Dispersal Algorithm (IDA) system used in a several P2P systems

Feedrate planning for machining with industrial six-axis robots

The authors want to thank Stäubli for providing the necessary information of the controller, Dynalog for its contribution to the experimental validations and X. Helle for its material contributions.Nowadays, the adaptation of industrial robots to carry out high-speed machining operations is strongly required by the manufacturing industry. This new technology machining process demands the improvement of the overall performances of robots to achieve an accuracy level close to that realized by machine-tools. This paper presents a method of trajectory planning adapted for continuous machining by robot. The methodology used is based on a parametric interpolation of the geometry in the operational space. FIR filters properties are exploited to generate the tool feedrate with limited jerk. This planning method is validated experimentally on an industrial robot

A variational model for data fitting on manifolds by minimizing the acceleration of a B\'ezier curve

We derive a variational model to fit a composite B\'ezier curve to a set of data points on a Riemannian manifold. The resulting curve is obtained in such a way that its mean squared acceleration is minimal in addition to remaining close the data points. We approximate the acceleration by discretizing the squared second order derivative along the curve. We derive a closed-form, numerically stable and efficient algorithm to compute the gradient of a B\'ezier curve on manifolds with respect to its control points, expressed as a concatenation of so-called adjoint Jacobi fields. Several examples illustrate the capabilites and validity of this approach both for interpolation and approximation. The examples also illustrate that the approach outperforms previous works tackling this problem

γ∗p\gamma^*p cross section from the dipole model in momentum space

We reproduce the DIS measurements of the proton structure function at high energy from the dipole model in momentum space. To model the dipole-proton forward scattering amplitude, we use the knowledge of asymptotic solutions of the Balitsky-Kovchegov equation, describing high-energy QCD in the presence of saturation effects. We compare our results with the previous analysis in coordinate space and discuss possible extensions of our approach.Comment: 9 pages, 3 figure