Many real-world optimisation problems are of dynamic nature, requiring an optimisation algorithm which is able to continuously track a changing optimum over time. To achieve this, we propose two population-based algorithms for solving dynamic optimisation problems (DOPs) with continuous variables: the self-adaptive differential evolution algorithm (jDE) and the differential ant-stigmergy algorithm (DASA). The performances of the jDE and the DASA are evaluated on the set of well-known benchmark problems provided for the special session on Evolutionary Computation in Dynamic and Uncertain Environments. We analyse the results for five algorithms presented by using the non-parametric statistical test procedure. The two proposed algorithms show a consistently superior performance over other recently proposed methods. The results show that both algorithms are appropriate candidates for DOPs.

New language technologies are coming, thanks to the huge and competing private investment fuelling rapid progress; we can either understand and foresee their effects, or be taken by surprise and spend our time trying to catch up. This report scketches out some transformative new technologies that are likely to fundamentally change our use of language. Some of these may feel unrealistically futuristic or far-fetched, but a central purpose of this report - and the wider LITHME network - is to illustrate that these are mostly just the logical development and maturation of technologies currently in prototype. But will everyone benefit from all these shiny new gadgets? Throughout this report we emphasise a range of groups who will be disadvantaged and issues of inequality. Important issues of security and privacy will accompany new language technologies. A further caution is to re-emphasise the current limitations of AI. Looking ahead, we see many intriguing opportunities and new capabilities, but a range of other uncertainties and inequalities. New devices will enable new ways to talk, to translate, to remember, and to learn. But advances in technology will reproduce existing inequalities among those who cannot afford these devices, among the world’s smaller languages, and especially for sign language. Debates over privacy and security will flare and crackle with every new immersive gadget. We will move together into this curious new world with a mix of excitement and apprehension - reacting, debating, sharing and disagreeing as we always do. Plug in, as the human-machine era dawns.

In this paper we present self-adaptive differential evolution algorithm jDElsgo on large scale global optimization. The experimental results obtained by our algorithm on benchmark functions provided for the CEC 2010 competition and special session on Large Scale Global Optimization are presented. The experiments were performed on 20 benchmark functions with high dimension D = 1000. Obtained results show that our algorithm performs highly competitive in comparison with the DECC-G*, DECC-G and MLCC algorithms.

Since the discovery of the Differential Evolution algorithm, new and improved versions have continuously emerged. In this paper, we review selected algorithms based on Differential Evolution that have been proposed in recent years. We examine the mechanisms integrated into them and compare the performance of algorithms. To compare their performances, statistical comparisons were used as they enable us to draw reliable conclusions about the algorithms’ performances. We use the Wilcoxon signed-rank test for pairwise comparisons and the Friedman test for multiple comparisons. Subsequently, the Mann–Whitney U-score test was added. We conducted not only a cumulative analysis of algorithms, but we also focused on their performances regarding the function family (i.e., unimodal, multimodal, hybrid, and composition functions). Experimental results of algorithms were obtained on problems defined for the CEC’24 Special Session and Competition on Single Objective Real Parameter Numerical Optimization. Problem dimensions of 10, 30, 50, and 100 were analyzed. In this paper, we highlight promising mechanisms for further development and improvements based on the study of the selected algorithms.

Machine translation has already become part of our everyday life. This chapter gives an overview of machine translation approaches. Statistical machine translation was a dominant approach over the past 20 years. It brought many cases of practical use. It is described in more detail in this chapter. Statistical machine translation is not equally successful for all language pairs. Highly inflectional languages are hard to process, especially as target languages. As statistical machine translation has almost reached the limits of its capacity, neural machine translation is becoming the technology of the future. This chapter also describes the evaluation of machine translation quality. It covers manual and automatic evaluations. Traditional and recently proposed metrics for automatic machine translation evaluation are described. Human translation still provides the best translation quality, but it is, in general, time-consuming and expensive. Integration of human and machine translation is a promising workflow for the future. Machine translation will not replace human translation, but it can serve as a tool to increase productivity in the translation process.

The demand for solving large-scale complex problems continues to grow. Many real-world problems are described by a large number of variables that interact with each other in a complex way. The dimensionality of the problem has a direct impact on the computational cost of the optimization. During the last two decades, differential evolution has been shown to be one of the most powerful optimizers for a wide range of optimization problems. In this paper, we investigate its appropriateness for large-scale problems. We propose a new variation of differential evolution that exhibits good results on difficult functions with large numbers of variables. The proposed algorithm incorporates the following mechanisms: The use of three strategies, the extended range of values for self-adapted parameters F and CR, subpopulations, and the population size reduction. The algorithm was tested on the CEC 2013 benchmark suite for large-scale optimization, and on two real-world problems from the CEC 2011 benchmark suite on real-world optimization. A comparative analysis was performed with recently proposed algorithms. The analysis shows the superior performance of our algorithm on most complex problems, described by overlapping and non-separable functions.