✦ LIBER ✦

Some implications of the union-intersection principle for tests of sphericity

✍ Scribed by W. Venables

Book ID: 107880039
Publisher: Elsevier Science
Year: 1976
Tongue: English
Weight: 270 KB
Volume: 6
Category: Article
ISSN: 0047-259X
DOI: 10.1016/0047-259x(76)90029-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Isotonic M-estimation of location: union

Isotonic M-estimation of location: union-intersection principle and preliminary test versions

✍ Azza R. Karmous; Pranab K. Sen 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 898 KB

Hardness estimated from the indentation

Hardness estimated from the indentation of a spherical body. Some implications for nanoindentation test results

✍ M. S. Bobji; M. Fahim; S. K. Biswas 📂 Article 📅 1996 🏛 Springer US 🌐 English ⚖ 560 KB

Extreme points of the intersection and t

Extreme points of the intersection and the union of some operator balls

✍ Yuri Lyubich 📂 Article 📅 2002 🏛 SP Birkhäuser Verlag Basel 🌐 English ⚖ 449 KB

A note on the Union-Intersection charact

A note on the Union-Intersection character of some MANOVA procedures

✍ Govind S Mudholkar; Michael L Davidson; Perla Subbaiah 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 350 KB

The safety implications of some control

The safety implications of some control changes at urban intersections

✍ W.J. Frith; D.S. Harte 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 667 KB

## Injury accident data for a sample of New Zealand urban intersections were analysed. looking for an increase or decrease which coincided with a change in control. Increases or decreases were also looked for in certain types of accidents and in accident severity. The control changes considered we

Approximating centroids for the maximum

Approximating centroids for the maximum intersection of spherical polygons

✍ Jong-Sung Ha; Kwan-Hee Yoo 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 229 KB

This paper considers the problem of investigating the spherical regions owned by the maximum number of spherical polygons. We present a practical O(n(vCI)) time algorithm for finding the approximating centroids for the maximum intersection of spherical polygons, where n, v, and I are, respectively,