939 resultados para infinitesimal generator
Resumo:
Includes index.
Resumo:
"5 December 1983."
Resumo:
"20 August 1984."
Resumo:
Includes index.
Resumo:
"22 April 1983."
Resumo:
Vol. 3 and 4 form the author's Treatise on analytical mechanics.
Resumo:
"The research was conducted by the Propellants Division of Amoco Chemicals Corporation of Seymour, Indiana, under Contract no. AF 33 (657)-11120."
Resumo:
The aim of this article is to demonstrate that the apparent controversy between the infinitesimal deformation (ID) approach and the phenomenological theory of martensitic transformations (PTMTs) in predicting the crystallographic characteristics of a martensitic transformation is entirely based on unjustified approximations associated with the way in which the ID calculations are performed. When applied correctly, the ID approach is shown to be absolutely identical to the PTMT. Nevertheless, there may be some advantages in using the ID approach. In particular, it is somewhat simpler than the PTMT; it is based on a physical concept that is easier to understand and, most important, it may provide a tool for investigating some of the features of martensitic transformations that have eluded explanation via the PTMT.
Resumo:
The research literature on metalieuristic and evolutionary computation has proposed a large number of algorithms for the solution of challenging real-world optimization problems. It is often not possible to study theoretically the performance of these algorithms unless significant assumptions are made on either the algorithm itself or the problems to which it is applied, or both. As a consequence, metalieuristics are typically evaluated empirically using a set of test problems. Unfortunately, relatively little attention has been given to the development of methodologies and tools for the large-scale empirical evaluation and/or comparison of metaheuristics. In this paper, we propose a landscape (test-problem) generator that can be used to generate optimization problem instances for continuous, bound-constrained optimization problems. The landscape generator is parameterized by a small number of parameters, and the values of these parameters have a direct and intuitive interpretation in terms of the geometric features of the landscapes that they produce. An experimental space is defined over algorithms and problems, via a tuple of parameters for any specified algorithm and problem class (here determined by the landscape generator). An experiment is then clearly specified as a point in this space, in a way that is analogous to other areas of experimental algorithmics, and more generally in experimental design. Experimental results are presented, demonstrating the use of the landscape generator. In particular, we analyze some simple, continuous estimation of distribution algorithms, and gain new insights into the behavior of these algorithms using the landscape generator.
Resumo:
In this paper, we address some issue related to evaluating and testing evolutionary algorithms. A landscape generator based on Gaussian functions is proposed for generating a variety of continuous landscapes as fitness functions. Through some initial experiments, we illustrate the usefulness of this landscape generator in testing evolutionary algorithms.