A method of self-adaptive mutation, crossover and selection was implemented and applied in four genetic algorithms. So developed self-adapting algorithms were then compared, with respect to convergence, with a traditional genetic one, which contained constant rates of mutation and crossover. The experiments were conducted on six benchmark functions including two unimodal functions, three multim...

It is known that real Non-Gaussian stable distributions are unimodal, not additive strongly unimodal, and multiplicative strongly unimodal in the symmetric case. By a theorem of Cuculescu-Theodorescu [5], the only remaining relevant situation for the multiplicative strong unimodality of stable laws is the one-sided. In this paper, we show that positive α−stable laws are multiplicative strongly ...

As the hardware technology for quantum computing advances, its possible applications are actively searched and developed. However, such still suffer from noise on devices, in particular when using two-qubit gates whose fidelity is relatively low. One way to overcome this difficulty substitute non-local operations by local ones. Such substitution can be performed decomposing a channel into linea...

In this paper we prove that any sequence of n real numbers contains a unimodal subsequence of length at least [(3n-3/4) " '-fj and that this bound is best possible.

Time-symmetric cycles are defined. Unimodal time-symmetric cycles are classified. A one-parameter family of maps of the closed unit interval that exhibits this classification is given. 1. Introduction. In one-dimensional dynamics, the maps that are studied are usually noninvertible. The initial reason for studying these maps was that they had complicated behavior that was reminiscent of diffeom...