Related papers: Evolution program for parton densities with pertur…
The QCDNUM program numerically solves the evolution equations for parton densities and fragmentation functions in perturbative QCD. Un-polarised parton densities can be evolved up to next-to-next-to-leading order in powers of the strong…
I report on a numerical program for the evolution of parton distributions. The program uses the Mellin-transform method with an optimized contour. Due to this optimized contour the program needs only a few evaluations of the integrand and…
In analogy with parton distribution functions, also parton fragmentation functions obey matching conditions when crossing heavy-flavour thresholds. We compute these matching conditions at next-to-leading order in the strong coupling…
I present a highly efficient method for evolving parton distributions in perturbative QCD. The method allows evolving the parton distribution functions according to any of the commonly-used truncations of the evolution equations (which…
This paper presents a novel Differential Evolution algorithm for protein folding optimization that is applied to a three-dimensional AB off-lattice model. The proposed algorithm includes two new mechanisms. A local search is used to improve…
This paper attempts to connects the evolution of computer languages with the evolution of life, where the later has been dictated by \emph{theory of evolution of species}, and tries to give supportive evidence that the new languages are…
We describe several techniques for using bulk matter for special purpose computation. In each case it is necessary to use an evolutionary algorithm to program the substrate on which the computation is to take place. In addition, the…
We derive a new fast convergent Density Evolution algorithm for finding optimal rate Low-Density Parity-Check (LDPC) codes used over the binary erasure channel (BEC). The fast convergence property comes from the modified Density Evolution…
We present a number of new contributions to the topic of constructing efficient higher-order splitting methods for the numerical integration of evolution equations. Particular schemes are constructed via setup and solution of polynomial…
The automatic generation of computer programs is one of the main applications with practical relevance in the field of evolutionary computation. With program synthesis techniques not only software developers could be supported in their…
We propose several improvements for Linear Programming (LP) decoding algorithms for High Density Parity Check (HDPC) codes. First, we use the automorphism groups of a code to create parity check matrix diversity and to generate valid cuts…
Evolutionary algorithms are wildly used in unmanned aerial vehicle path planning for their flexibility and effectiveness. Nevertheless, they are so sensitive to the change of environment that can't adapt to all scenarios. Due to this…
We present a new family of low-density parity-check (LDPC) convolutional codes that can be designed using ordered sets of progressive differences. We study their properties and define a subset of codes in this class that have some desirable…
In this paper, we represent Raptor codes as multi-edge type low-density parity-check (MET-LDPC) codes, which gives a general framework to design them for higher-order modulation using MET density evolution. We then propose an efficient…
We present an algorithm for massive parton evolution which is based on the differentially accurate simulation of soft-gluon radiation by means of a non-trivial azimuthal angle dependence of the splitting functions. The kinematics mapping is…
Finding the optimal parameter setting (i.e. the optimal population size, the optimal mutation probability, the optimal evolutionary model etc) for an Evolutionary Algorithm (EA) is a difficult task. Instead of evolving only the parameters…
With the imminent start of LHC experiments, development of phenomenological tools, and in particular the Monte Carlo programs and algorithms, becomes urgent. A new algorithm for the generation of a parton shower initiated by the single…
On the basis of additive schemes (splitting schemes) we construct efficient numerical algorithms to solve approximately the initial-boundary value problems for systems of time-dependent partial differential equations (PDEs). In many applied…
Combinatorial evolution - the creation of new things through the combination of existing things - can be a powerful way to evolve rather than design technical objects such as electronic circuits. Intriguingly, this seems to be an ongoing…
Magnitude pruning is a widely used strategy for reducing model size in pure supervised learning; however, it is less effective in the transfer learning regime that has become standard for state-of-the-art natural language processing…