𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Homology and hominid phylogeny: Problems and potential solutions

✍ Scribed by Daniel E. Lieberman


Publisher
John Wiley and Sons
Year
1999
Tongue
English
Weight
161 KB
Volume
7
Category
Article
ISSN
1060-1538

No coin nor oath required. For personal study only.

✦ Synopsis


His research is on the integration of function, growth and phylogeny in skeletal tissues, with a particular focus on using experimental laboratory studies to test behavioral and phylogenetic hypotheses based on hominid skeletal morphologies.


πŸ“œ SIMILAR VOLUMES


Ontogeny and phylogeny of femoro-tibial
✍ Tardieu, Christine πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 359 KB

Three different human femoro-tibial characters are selected as functionally relevant and derived hominid characters: femoral bicondylar angle, shape of the femoral distal epiphysis, and the tibial insertion of the lateral meniscus. The timing and mode of formation of these characters are investigate

The method of fundamental solutions for
✍ Andreas Karageorghis; Graeme Fairweather πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 115 KB πŸ‘ 1 views

In this paper, we investigate the application of the Method of Fundamental Solutions (MFS) to two classes of axisymmetric potential problems. In the ΓΏrst, the boundary conditions as well as the domain of the problem, are axisymmetric, and in the second, the boundary conditions are arbitrary. In both

The existence of approximate solutions f
✍ Robert Whitley; T. V. Hromadka II πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 389 KB πŸ‘ 1 views

A proof is given of the existence of an approximate Complex Variable Boundary Element Method solution for a Birichlet problem. This constructive proof can be used as a basis for numerical calculations. @ 1996

Declarative solutions to partitioned-gri
✍ Sandro Etalle; Pieter H. Hartel; Willem G. Vree πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 269 KB

The problem of partitioning grid-based applications for parallel computing can be solved easily and intuitively in a logic programming language such as Prolog, using only the single assignment property of the logic variable, and not the backtracking. We show that such a logic program can be transfor