Search for [formula omitted] and [formula omitted] using genetic programming event selection

We apply a genetic programming technique to search for the doubly Cabibbo suppressed decays Λc+ → pK+π− and Ds+ → K+K+π−. We normalize these decays to their Cabibbo favored partners and find BR(Λc+ → pK+π−)/BR(Λc+ → pK−π+) < 0.46% and BR(Ds+ → K+K+π−)/BR(Ds+ → K−K+π+) < 0.78% at the 90% confidence level (CL). This is the first successful use of genetic programming in a high energy physics data analysis.

Quantum generative modeling is emerging as a powerful tool for advancing data analysis in high-energy physics, where complex multivariate distributions are common. However, efficiently learning and sampling these distributions remains challenging. We propose a quantum protocol for a bivariate probabilistic model based on shifted Chebyshev polynomials, trained as a circuit-based representation of two correlated variables, with sampling performed via quantum Chebyshev transforms. As a key application, we study fragmentation functions (FFs) of charged pions and kaons from single-inclusive hadron production in electron-positron annihilation. We learn the joint distribution of momentum fraction z and energy scale Q, and infer their correlations from the entanglement structure. Building on the generalization capabilities of the quantum model and extended register architecture, we perform fine-grid multivariate sampling for FF dataset augmentation. Our results highlight the growing potential of quantum generative modeling to advance data analysis and scientific discovery in high-energy physics. Quantum computing holds great promise for advancing data analysis in science, including high-energy physics. This work presents a quantum protocol for learning and sampling multivariate distributions, using Chebyshev polynomials and quantum Chebyshev transforms to study fragmentation functions and energy-momentum correlations in hadron production.

Genetic programming techniques have been applied to a variety of different problems. In this paper, the authors discuss the use of these techniques in a virtual environment. The use of genetic programming allows the authors a quick method of searching shape and sound spaces. The basic design of the system, problems encountered, and future plans are all discussed.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

With the development of the new generation of High Energy Physics (HEP) experiments, huge amounts of data are being generated. Efficient parallel algorithms/frameworks and High IO throughput are key to meet the scalability and performance requirements of HEP offline data analysis. Though Hadoop has gained a lot of attention from scientific community for its scalability and parallel computing framework for large data sets, it’s still difficult to make HEP data processing tasks run directly on Hadoop. In this paper we investigate the application of Hadoop to make HEP jobs run on it transparently. Particularly, we discuss a new mechanism to support HEP software to random access data in HDFS. Because HDFS is streaming data stored only supporting sequential write and append. It cannot satisfy HEP jobs to random access data. This new feature allows the Map/Reduce tasks to random read/write on the local file system on data nodes instead of using Hadoop data streaming interface. This makes HEP jobs run on Hadoop possible. We also develop diverse MapReduce model for HEP jobs such as Corsika simulation, ARGO detector simulation and Medea++ reconstruction. And we develop a toolkit for users to submit/query/remove jobs. In addition, we provide cluster monitoring and account system to benefit to the system availability. This work has been in production for HEP experiment to gain about 40,000 CPU hours per month since September, 2016.

Solid-State-Drives are currently introduced in storage facilities for High Energy Physics (HEP) experiments and their performances are measured and compared to standard magnetic disks. For this paper a typical HEP data analysis is performed and used as a test to measure computing performances. The tests exploit the features provided by PROOF-Lite which allows to distribute a huge number of events among different CPU cores, thus reducing the overall time needed to complete the analysis task. These tests are carried on few computational devices typically hosted at a current Tier-2/Tier-3 facility. The performance results are provided in terms of figures of merit and the main issue is scalability described in terms of speed up factor and processing event rate. The obtained results can be used as guideline for both the typical HEP analyst and the Tier-2/Tier-3 manager: the former in the configuration of his own analysis task while dealing with increasing data sizes, the latter in the implementation of an interactive data analysis facility for HEP experiments while facing solutions that concern both technological and economical aspects.

Over the last decade, numerous papers have investigated the use of Genetic Programming (GP) for creating financial trading strategies. Typically, in the literature, the results are inconclusive but the investigators always suggest the possibility of further improvements, leaving the conclusion regarding the effectiveness of GP undecided. In this paper, we discuss a series of pretests aimed at giving more clear-cut answers as to whether GP can be effective with the training data at hand. Precisely, pretesting allows us to distinguish between a failure due to the market being efficient or due to GP being inefficient. The basic idea here is to compare GP with several variants of random searches and random trading behaviors having well-defined characteristics. In particular, if the outcomes of the pretests reveal no statistical evidence that GP possesses a predictive ability superior to a random search or a random trading behavior, then this suggests to us that there is no point in investing further resources in GP. The analysis is illustrated with GP-evolved strategies for nine markets exhibiting various trends.

Process mining technology aims to automatically generate process models by analyzing events, thereby assisting the design and redesign of process models. Although many process mining methods have appeared, they all have deficiencies. These methods focus on mining from the behavioral aspects described by the log, while ignoring the structural nature of the process model itself. The complexity of the process describes the simplicity and ease of understanding of the process. Higher process complexity affects the readability of the process. Genetic programming has strong robustness. Its individual representation based on tree structure can describe the special structure of the process. The introduction of process complexity fitness enables it to consider the complexity of the process model itself while mining log behavior, so as to achieve nonlinear mining of complex processes. This paper analyzes the process mining based on genetic programming and proposes process individuals based on tree structure. By realizing the combination of process complexity measurement and process mining technology, noncomplex process mining can be realized. In this paper, the process complexity is combined with the process mining algorithm based on genetic programming, and a measure of process structural complexity is proposed, which is converted into complexity fitness and introduced into the fitness function of genetic programming, to realize the use of genetic programming. The research results show that the improved new adaptive genetic programming robust scheduling algorithm provides a new idea and method for the evaluation of college sports under different sports conditions. This makes the college sports evaluation management system more intelligent and improves the rational allocation of physical education teaching.

This paper presents a quantum convolutional neural network (QCNN) for the classification of high energy physics events. The proposed model is tested using a simulated dataset from the Deep Underground Neutrino Experiment. The proposed quantum architecture demonstrates an advantage of learning faster than the classical convolutional neural networks (CNNs) under a similar number of parameters. In addition to the faster convergence, the QCNN achieves a greater test accuracy compared to CNNs. Based on our results from numerical simulations, it is a promising direction to apply QCNN and other quantum machine learning models to high energy physics and other scientific fields.

In high-energy physics experiments, traditional data analysis methods increasingly show limitations when handling large-scale datasets, highlighting the urgent need for a transition to automated and intelligent analysis techniques to improve accuracy and efficiency. To address this challenge, we utilized an open dataset from CERN and proposed a novel Z-Bagging model, an ensemble learning approach designed to distinguish between two decay processes of the Z boson: Z [Formula: see text]+[Formula: see text] (Zmumu) and Z [Formula: see text] e+e[Formula: see text] (Zee). Initially, we tested several classical machine learning models to evaluate their performance in distinguishing these two decay modes. While these models showed some improvements in accuracy, further optimization was identified. Consequently, we introduced the Z-Bagging model, which combines multiple weak learners, such as Random Forest, Support Vector Machine and K-Nearest Neighbors, into a single strong learner. By integrating diverse models, Z-Bagging achieves more accurate and stable predictions. Experimental results demonstrate that the Z-Bagging model significantly outperforms existing models in classification accuracy for distinguishing Zmumu and Zee decay processes. This improvement provides a more precise tool for data analysis in high-energy physics.

In this paper we summarize the use of genetic programming (GP) in nonlinear system identification: After giving a short introduction to evolutionary computation and genetic algorithms, we describe the basic principles of genetic programming and how it is used for data based identification of nonlinear mathematical models. Furthermore, we summarize projects in which we have successfully applied GP in RD we also give a summary of several algorithmic enhancements that have been successfully researched in the last years (including offspring selection, on-line and sliding window GP, operators for monitoring genetic process dynamics, and the design of cooperative evolutionary data mining agents). A short description of HeuristicLab (HL), the optimization framework developed by the HEAL research group, and the use of the GP implementations in HL are given in the appendix of this paper.

One burden of high energy physics data analysis is uncertainty within the measurement, both systematically and statistically. Even with sophisticated neural network techniques that are used to assist in high energy physics measurements, the resulting measurement may suffer from both types of uncertainties. Fortunately, most types of systematic uncertainties are based on knowledge from information such as theoretical assumptions, for which the range and behaviour are known. It has been proposed to mitigate such systematic uncertainties by using a new type of neural network called adversarial neural network (ANN) that would make the discriminator less sensitive to these uncertainties, but this has not yet been demonstrated in a real-life LHC analysis. This work investigates ANNs using as a benchmark the search for the production of four top quarks, an extremely rare physics process at the LHC and one of the important processes that can prove or disprove the Standard Model. The search for four top quarks in some cases is sensitive to large systematic uncertainties. The expected cross section upper limit for four top quark production is calculated using traditional neural networks and adversarial neural networks based on simulated proton-proton collisions within the Compact Muon Solenoid detector within Large Hadron Collider, and are compared to existing results. The improvement and further considerations to the search for rare processes at the LHC will be discussed.

The results of analysis using correlative and multivariate methods, as developed for data analysis in high-energy physics and implemented in the Toolkit for Multivariate Analysis software package, of the relations of the variation of increased radon concentration with climate variables in shallow underground laboratory is presented. Multivariate regression analysis identified a number of multivariate methods which can give a good evaluation of increased radon concentrations based on climate variables. The use of the multivariate regression methods will enable the investigation of the relations of specific climate variable with increased radon concentrations by analysis of regression methods resulting in 'mapped' underlying functional behaviour of radon concentrations depending on a wide spectrum of climate variables.

Genetic programming is applied to an information retrieval system in order to improve Boolean query formulation via relevance feedback. This approach brings together the concepts of information retrieval and genetic programming. Documents are viewed as vectors in index term space. A Boolean query, viewed as a parse tree, is an organism in the genetic programming sense. Through the mechanisms of genetic programming, the query is modified in order to improve precision and recall. Relevance feedback is incorporated, in part, via user defined measures over a trial set of documents. The fitness of a candidate query can be expressed directly as a function of the relevance of the retrieved set. Preliminary results based on a testbed are given. The form of the fitness function has a significant effect upon performance and the proper fitness functions take into account relevance based on topicality (and perhaps other factors).< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

Computational tools for analyzing biochemical phenomena are becoming increasingly important. Recently, high-level formal languages for modeling and simulating biochemical reactions have been proposed. These languages make the formal modeling of complex reactions accessible to domain specialists outside of theoretical computer science. This research explores the use of genetic programming to automate the construction of models written in one such language. Given a description of desired time-course data, the goal is for genetic programming to construct a model that might generate the data. The language investigated is Kahramanogullari's and Cardelli's Programming Interface for Modeling (PIM) language. The PIM syntax is defined in a grammar-guided genetic programming system. All time series generated during simulations are described by statistical feature tests, and the fitness evaluation compares feature proximity between the target and candidate solutions. PIM models of varying complexity were used as target expressions for genetic programming, and were successfully reconstructed in all cases. This shows that the compositional nature of PIM models is amenable to genetic program search.

This paper describes an approach to the use of genetic programming (GP) for the automatic detection of rhythmic stress in spoken New Zealand English. A linear-structured GP system uses speaker independent prosodic features and vowel quality features as terminals to classify each vowel segment as stressed or unstressed. Error rate is used as the fitness function. In addition to the standard four arithmetic operators, this approach also uses several other arithmetic, trigonometric, and conditional functions in the function set. The approach is evaluated on 60 female adult utterances with 703 vowels and a maximum accuracy of 92.61% is achieved. The approach is compared with decision trees (DT) and support vector machines (SVM). The results suggest that, on our data set, GP outperforms DT and SVM for stress detection, and GP has stronger automatic feature selection capability than DT and SVM.KeywordsSupport Vector MachineProsodic FeatureLexical StressVowel QualityGenetic Programming SystemThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.