Convergence of evolutionary algorithms on the n-dimensional continuous space.

Evolutionary algorithms (EAs) are random optimization methods inspired by genetics and natural selection, resembling simulated annealing. We develop a method that can be used to find a meaningful tradeoff between the difficulty of the analysis and the algorithms' efficiency. Since the case of a discrete search space has been studied extensively, we develop a new stochastic model for the continuous n-dimensional case.

Elementary inequalities that involve two nonnegative vectors or functions.

We report 96 inequalities with common structure, all elementary to state but many not elementary to prove. If n is a positive integer, a = (a1,..

[Our management of complicated ulcer in cirrhotic patients].

The authors present 83 cases of associated ulcer and cirrhosis, evaluating the frequency of this complication in relation with the total number of ulcers hospitalized over a determined time. The percentage of this association was of 1,6 of the total number of patients with ulcers, and of 10,2 of the total number of patients with cirrhosis. The major complications of this association were hemorrhage and perforation, both in an identical percentage (38).