Gene expression programming approach to event selection in high energy physics

Gene Expression Programming is a new evolutionary algorithm that overcomes many limitations of the more established Genetic Algorithms and Genetic Programming. Its first application to high energy physics data analysis is presented. The algorithm was successfully used for event selection on samples with both low and high background level. It allowed automatic identification of selection rules that can be interpreted as cuts applied on the input variables. The signal/background classification accuracy was over 90% in all cases

Distribution of municiplaities´ tax incomes/revenues modelling by means of genetic programming

The Goal of this contribution is to demonstrate an illustrative example of genetic programming application in the area of regional administrations financing. The principle of genetic programming is used for the establishing of the analytical function for the calculation of the share each individual municipality has in the national shared taxes revenues in the Czech Republic. This approach is confronted with the existing municipal financing principle issuing from the effective act on Tax Assignment to sub-national Government Level

Cloud engineering is search based software engineering too

Many of the problems posed by the migration of computation to cloud platforms can be formulated and solved using techniques associated with Search Based Software Engineering (SBSE). Much of cloud software engineering involves problems of optimisation: performance, allocation, assignment and the dynamic balancing of resources to achieve pragmatic trade-offs between many competing technical and business objectives. SBSE is concerned with the application of computational search and optimisation to solve precisely these kinds of software engineering challenges. Interest in both cloud computing and SBSE has grown rapidly in the past five years, yet there has been little work on SBSE as a means of addressing cloud computing challenges. Like many computationally demanding activities, SBSE has the potential to benefit from the cloud; ‘SBSE in the cloud’. However, this paper focuses, instead, of the ways in which SBSE can benefit cloud computing. It thus develops the theme of ‘SBSE for the cloud’, formulating cloud computing challenges in ways that can be addressed using SBSE

Digital Ecosystems: Ecosystem-Oriented Architectures

We view Digital Ecosystems to be the digital counterparts of biological ecosystems. Here, we are concerned with the creation of these Digital Ecosystems, exploiting the self-organising properties of biological ecosystems to evolve high-level software applications. Therefore, we created the Digital Ecosystem, a novel optimisation technique inspired by biological ecosystems, where the optimisation works at two levels: a first optimisation, migration of agents which are distributed in a decentralised peer-to-peer network, operating continuously in time; this process feeds a second optimisation based on evolutionary computing that operates locally on single peers and is aimed at finding solutions to satisfy locally relevant constraints. The Digital Ecosystem was then measured experimentally through simulations, with measures originating from theoretical ecology, evaluating its likeness to biological ecosystems. This included its responsiveness to requests for applications from the user base, as a measure of the ecological succession (ecosystem maturity). Overall, we have advanced the understanding of Digital Ecosystems, creating Ecosystem-Oriented Architectures where the word ecosystem is more than just a metaphor.Comment: 39 pages, 26 figures, journa

A Multi-Gene Genetic Programming Application for Predicting Students Failure at School

Several efforts to predict student failure rate (SFR) at school accurately still remains a core problem area faced by many in the educational sector. The procedure for forecasting SFR are rigid and most often times require data scaling or conversion into binary form such as is the case of the logistic model which may lead to lose of information and effect size attenuation. Also, the high number of factors, incomplete and unbalanced dataset, and black boxing issues as in Artificial Neural Networks and Fuzzy logic systems exposes the need for more efficient tools. Currently the application of Genetic Programming (GP) holds great promises and has produced tremendous positive results in different sectors. In this regard, this study developed GPSFARPS, a software application to provide a robust solution to the prediction of SFR using an evolutionary algorithm known as multi-gene genetic programming. The approach is validated by feeding a testing data set to the evolved GP models. Result obtained from GPSFARPS simulations show its unique ability to evolve a suitable failure rate expression with a fast convergence at 30 generations from a maximum specified generation of 500. The multi-gene system was also able to minimize the evolved model expression and accurately predict student failure rate using a subset of the original expressionComment: 14 pages, 9 figures, Journal paper. arXiv admin note: text overlap with arXiv:1403.0623 by other author

Assessment of the effect of the financial crisis on agents’ expectations through symbolic regression

Agents’ perceptions on the state of the economy can be affected during economic crises. Tendency surveys are the main source of agents’ expectations. The main objective of this study is to assess the impact of the 2008 financial crisis on agents’ expectations. With this aim, we evaluate the capacity of survey-based expectations to anticipate economic growth in the United States, Japan, Germany and the United Kingdom. We propose a symbolic regression (SR) via genetic programming approach to derive mathematical functional forms that link survey-based expectations to GDP growth. By combining the main SR-generated indicators, we generate estimates of the evolution of GDP. Finally, we analyse the effect of the crisis on the formation of expectations, and we find an improvement in the capacity of agents’ expectations to anticipate economic growth after the crisis in all countries except Germany.Peer ReviewedPostprint (author's final draft

Discrete Event Simulation Modelling for Dynamic Decision Making in Biopharmaceutical Manufacturing

With the increase in demand for biopharmaceutical products, industries have realised the need to scale up their manufacturing from laboratory-based processes to financially viable production processes. In this context, biopharmaceutical manufacturers are increasingly using simulation-based approaches to gain transparency of their current production system and to assist with designing improved systems. This paper discusses the application of Discrete Event Simulation (DES) and its ability to model the various scenarios for dynamic decision making in biopharmaceutical manufacturing sector. This paper further illustrates a methodology used to develop a simulation model for a biopharmaceutical company, which is considering several capital investments to improve its manufacturing processes. A simulation model for a subset of manufacturing activities was developed that facilitated ‘what-if’ scenario planning for a proposed process alternative. The simulation model of the proposed manufacturing process has shown significant improvement over the current process in terms of throughout time reduction, better resource utilisation, operating cost reduction, reduced bottlenecks etc. This visibility of the existing and proposed production system assisted the company in identifying the potential capital and efficiency gains from the investments therefore demonstrating that DES can be an effective tool for making more informed decisions. Furthermore, the paper also discusses the utilisation of DES models to develop a number of bespoke productivity improvement tools for the company

A study on battery model parametrisation problem: application-oriented trade-offs between accuracy and simplicity

This study is focused on fast low-fidelity battery modelling for online applications. Because the battery parameters change due to variations of battery’s states, the model may need to be updated during operation. This can be achieved through the use of an online parameter identification technique, making use of online current-voltage measurements. The parametrisation algorithm’s speed is a crucial issue in such applications. This paper describes a study exploring the trade-offs between speed and accuracy, considering equivalent circuit models with different levels of complexity and different parameter-fitting algorithms. A visual investigation of the battery parametrisation problem is also proposed by obtaining battery model identification surfaces which help us to avoid unnecessary complexities. Three standard fitting algorithms are used to parametrise battery models using current-voltage measurements. For each level of complexity, the algorithms performances are evaluated using experimental data from a small NiMH battery pack. An application-oriented view on this trade-offs is discussed which demonstrates that the final target of the battery parametrisation problem can significantly affect the choice of the fitting algorithm and battery model structur