4 resultados para Pseudorandom permutation ensemble
em Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho"
Resumo:
This paper deals with the design of a network-on-chip reconfigurable pseudorandom number generation unit that can map and execute meta-heuristic algorithms in hardware. The unit can be configured to implement one of the following five linear generator algorithms: a multiplicative congruential, a mixed congruential, a standard multiple recursive, a mixed multiple recursive, and a multiply-with-carry. The generation unit can be used both as a pseudorandom and a message passing-based server, which is able to produce pseudorandom numbers on demand, sending them to the network-on-chip blocks that originate the service request. The generator architecture has been mapped to a field programmable gate array, and showed that millions of numbers in 32-, 64-, 96-, or 128-bit formats can be produced in tens of milliseconds. (C) 2011 Elsevier B.V. All rights reserved.
Resumo:
The nearest-neighbor spacing distributions proposed by four models, namely, the Berry-Robnik, Caurier-Grammaticos-Ramani, Lenz-Haake, and the deformed Gaussian orthogonal ensemble, as well as the ansatz by Brody, are applied to the transition between chaos and order that occurs in the isotropic quartic oscillator. The advantages and disadvantages of these five descriptions are discussed. In addition, the results of a simple extension of the expression for the Dyson-Mehta statistic Δ3 are compared with those of a more popular one, usually associated with the Berry-Robnik formalism. ©1999 The American Physical Society.
Resumo:
The medium term hydropower scheduling (MTHS) problem involves an attempt to determine, for each time stage of the planning period, the amount of generation at each hydro plant which will maximize the expected future benefits throughout the planning period, while respecting plant operational constraints. Besides, it is important to emphasize that this decision-making has been done based mainly on inflow earliness knowledge. To perform the forecast of a determinate basin, it is possible to use some intelligent computational approaches. In this paper one considers the Dynamic Programming (DP) with the inflows given by their average values, thus turning the problem into a deterministic one which the solution can be obtained by deterministic DP (DDP). The performance of the DDP technique in the MTHS problem was assessed by simulation using the ensemble prediction models. Features and sensitivities of these models are discussed. © 2012 IEEE.
Resumo:
We consider dynamical properties for an ensemble of classical particles confined to an infinite box of potential and containing a time-dependent potential well described by different nonlinear functions. For smooth functions, the phase space contains chaotic trajectories, periodic islands and invariant spanning curves preventing the unlimited particle diffusion along the energy axis. Average properties of the chaotic sea are characterised as a function of the control parameters and exponents describing their behaviour show no dependence on the perturbation functions. Given invariant spanning curves are present in the phase space, a sticky region was observed and show to modify locally the diffusion of the particles. © 2013 Elsevier B.V.