3 resultados para upper bound

em Biblioteca Digital da Produção Intelectual da Universidade de São Paulo


Relevância:

60.00% 60.00%

Publicador:

Resumo:

We propose a stage-structured integrodifference model for blowflies' growth and dispersion taking into account the density dependence of fertility and survival rates and the non-overlap of generations. We assume a discrete-time, stage-structured, model. The spatial dynamics is introduced by means of a redistribution kernel. We treat one and two dimensional cases, the latter on the semi-plane, with a reflexive boundary. We analytically show that the upper bound for the invasion front speed is the same as in the one-dimensional case. Using laboratory data for fertility and survival parameters and dispersal data of a single generation from a capture-recapture experiment in South Africa, we obtain an estimate for the velocity of invasion of blowflies of the species Chrysomya albiceps. This model predicts a speed of invasion which was compared to actual observational data for the invasion of the focal species in the Neotropics. Good agreement was found between model and observations.

Relevância:

60.00% 60.00%

Publicador:

Resumo:

We report measurements of charmed-hadron (D-0, D*) production cross sections at midrapidity in p + p collisions at a center-of-mass energy of 200 GeV by the STAR experiment. Charmed hadrons were reconstructed via the hadronic decays D-0 -> K- pi(+), D*(+) -> D-0 pi(+) -> K-pi(+)pi(+) and their charge conjugates, covering the p(T) range of 0.6-2.0 and 2.0-6.0 GeV/c for D-0 and D*(+), respectively. From this analysis, the charm-pair production cross section at midrapidity is d sigma/dy vertical bar(c (c) over bar)(y-0) = 170+/-45(stat)(-59)(+38()sys) mu b. The extracted charm-pair cross section is compared to perturbative QCD calculations. The transverse momentum differential cross section is found to be consistent with the upper bound of a fixed-order next-to-leading logarithm calculation.

Relevância:

60.00% 60.00%

Publicador:

Resumo:

This work aimed to apply genetic algorithms (GA) and particle swarm optimization (PSO) in cash balance management using Miller-Orr model, which consists in a stochastic model that does not define a single ideal point for cash balance, but an oscillation range between a lower bound, an ideal balance and an upper bound. Thus, this paper proposes the application of GA and PSO to minimize the Total Cost of cash maintenance, obtaining the parameter of the lower bound of the Miller-Orr model, using for this the assumptions presented in literature. Computational experiments were applied in the development and validation of the models. The results indicated that both the GA and PSO are applicable in determining the cash level from the lower limit, with best results of PSO model, which had not yet been applied in this type of problem.