In recent theoretical and experimental work on schemata in genetic programming we have proposed a new simpler form of crossover in which the same crossover point is selected in both parent programs. We call this operator one-point crossover because of its similarity with the corresponding operator in genetic algorithms. One point crossover presents very interesting properties from the theory po...

ranking fuzzy numbers plays a very important role in linguistic decision making and other fuzzy application systems. in spite of many ranking methods, no one can rank fuzzy numbers with human intuition consistently in all cases. shortcoming are found in some of the convenient methods for ranking triangular fuzzy numbers such as the coefficient of variation (cv index), distance between fuzzy set...

We discuss the problem of finding approximate solutions of the equation 0 ) (  x f (1) In some cases it is possible to find the exact roots of the equation (1) for example when ) (x f is a quadratic on cubic polynomial otherwise, in general, is interested in finding approximate solutions using some numerical methods. Here, we will discuss a method called fixed point iteration method and a part...

One-point probability distribution functions (PDFs) of the cosmic matter density are powerful cosmological probes that extract non-Gaussian properties and complement two-point statistics. Computing covariance one-point PDFs is key for building a robust galaxy survey analysis upcoming surveys like Euclid Rubin Observatory LSST requires good models characterising spatial correlations. In this wor...

The rate ofunidirectional efflux of45Ca from rat liver microsomal vesicles loaded with 45Ca and then treated with thapsigargin is not inhibited by increased [Ca2+] in the external medium, although the net efflux rate is substantially inhibited. We have used this property to measure the electrochemical gradient of Ca2+ from the inside to the outside of the vesicles at a series of Ca2+ loadings, ...

All forms of the simplex method reach the optimum by traversing a series of basic solutions. Since each basic solution represents an extreme point of the feasible region, the track followed by the algorithm moves around the boundary of the feasible region. In the worst case, it may be necessary to examine most if not all of the extreme points. This can be cripplingly inefficient given that the ...

The late universe contains a wealth of information about fundamental physics and gravity, wrapped up in non-Gaussian fields. To make use as much possible it is necessary to go beyond two-point statistics. Rather than going higher order N-point correlation functions, we demonstrate that the probability distribution function (PDF) spheres matter field (a one-point function) already significant am...