Land cover maps are fundamental materials for resource management and change detection. Remote sensing technology is crucial for fast mapping with low cost. However, besides the inherent classification errors in the land cover products, numerous illogical transitions exist between the neighboring time points. In this study, we introduce a series of logical codes for all the land cover types acc...

Measurements of the one-point probability distribution function and higher-order moments (variance, skewness, kurtosis) high-redshift 21 cm fluctuations are among most direct statistical probes non-Gaussian nature structure formation evolution during reionization. However, contamination from astrophysical foregrounds instrument systematics pose significant challenges in measuring these statisti...

Slime Mould Algorithm (SMA) is a new meta-heuristics algorithm that inspired by the behaviors of slime mould from nature. Due to its effective performance, SMA has shown competitive performance among other algorithms and been used in many mathematical optimization real-world problems. However, tends sink into local optimality lacks diversity population. Therefore, cope with drawbacks classical ...

We show that wave maps φ from two-dimensional Minkowski spaceR to hyperbolic spacesH are globally smooth in time if the initial data is smooth, conditionally on some reasonable claims concerning the local theory of such wave maps, as well as the self-similar and travelling (or stationary solutions); we will address these claims in the sequels [60], [61], [62] to this paper. Following recent wor...

This work presents a procedural content generation system that uses an evolutionary algorithm in order to generate interesting maps for a real-time strategy game, called Planet Wars. Interestingness is here captured by the dynamism of games (i.e., the extent to which they are action-packed). We consider two different approaches to measure the dynamism of the games resulting from these generated...

Since the advent of evolution strategies many attempts have been done to improve the mutation operator [7]. The first enhancement could be seen in the introduction of a flexible step size. As a logical consequence later n step sizes, one per variable, were used. Highest flexibility is achieved with the correlated mutation but also quadratic growth of the number of strategy parameters [8]. A new...