Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Znaleziono wyników: 2

Liczba wyników na stronie

Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

The fragile legacy of Amphicoelias fragillimus (Dinosauria: Sauropoda; Morrison Formation – latest Jurassic)

Woodruff D., Foster J.

Volumina Jurassica

2014

Vol. 12, no. 2

211--220

In the summer of 1878, American paleontologist Edward Drinker Cope published the discovery of a sauropod dinosaur that he named Amphicoelias fragillimus. What distinguishes A. fragillimus in the annals of paleontology is the immense magnitude of the skeletal material. The single incomplete dorsal vertebra as reported by Cope was a meter and a half in height, which when fully reconstructed, would make A. fragillimus the largest vertebrate ever. After this initial description Cope never mentioned A. fragillimus in any of his scientific works for the remainder of his life. More than four decades after its description, a scientific survey at the American Museum of Natural History dedicated to the sauropods collected by Cope failed to locate the remains or whereabouts of A. fragillimus. For nearly a century the remains have yet to resurface. The enormous size of the specimen has generally been accepted despite being well beyond the size of even the largest sauropods known from verifiable fossil material (e.g. Argentinosaurus). By deciphering the ontogenetic change of Diplodocoidea vertebrae, the science of gigantism, and Cope’s own mannerisms, we conclude that the reported size of A. fragillimus is most likely an extreme over-estimation.

Integrating pivot based search with branch and bound for binary MIPs

Lokketangen A., Woodruff D.

Control and Cybernetics

2000

Vol. 29, no 3

741-759

This paper examines integration of a sophisticated, pivot-based tabu search into branch and bound for 0-1 MIPS and global diversification tests using chunking. Issues related to behavior of a tabu search within a branch and bound algorithm are analyzed using computational experiments. Results are presented showing that the inclusion of the local search sometimes results in fewer and nodes and lower CPU times even when used in a callback mode. The main benefit in incorporating a pivot based heuristic is that an integer feasible solution can be found earlier in the branching process. Computational experiments are presented showing that for some instances the overall search time is improved, while for some others the tabu search can find good solutions quickly.