3. SITE 1071
Position: 39°22.9446′N, 72°43.6830′W Start hole: 1300 hr, 23 June 1997 End hole: 0355 hr, 24 June 1997 Time on hole: 14.92 hr Seafloor (drill pipe measurement from rig floor, mbrf): 99.4 Total depth (drill pipe measurement from rig floor, mbrf): 151.3 Distance between rig floor and sea level (m): 11.2 Water depth (drill pipe measurement from sea level, m): 88.2 Penetration (mbsf): 51.9 Coring totals: Type: APC Number: 7 Cored: 36.3 m Recovered: 27.75 m (76.45%)
The Atlantic Continental Margin: U.S.
The Geology of North America series has been prepared to mark the Centennial of The Geological Society of America. It represents the cooperative efforts of more than 1000 individuals from academia, state and federal agencies of many countries, and industry to prepare syntheses that are as current and authoritative as possible about the geology of the North American continent and adjacent oceanic regions. This series is part of the Decade of North American Geology (DNAG) Project which also includes eight wall maps at a scale of 1:5,000,000 that summarize the geology, tectonics, magnetic and gravity anomaly patterns, regional stress fields, thermal aspects, seismicity and neotectonics of North America and its surroundings. Together, the synthesis volumes and maps are the first coordinated effort to integrate all available knowledge about the geology and geophysics of a crustal plate on a regional scale. Topics discussed in Volume 1 include stratigraphy, depositional processes, and depositional history; basin synthesis; deep crystal structure; rifting and subsidence theory; geological resources; and environmental hazards. Individual papers were processed separately for the data base.
Rubik's for cryptographers
Hard mathematical problems are at the core of security arguments in cryptography. In this paper, we study mathematical generalizations of the famous Rubik’s cube puzzle, namely the factorization, representation and balance problems in non-Abelian groups. These problems arise naturally when describing the security of Cayley hash functions, a class of cryptographic hash functions with very interesting properties. The factorization problem is also strongly related to a famous long-standing conjecture of Babai, at the intersection of group theory and graph theory. A constructive proof of Babai’s conjecture would make all Cayley hash functions insecure, but on the other hand it would have many positive applications in graph theory and computer science. In this paper, we classify existing attacks against Cayley hash functions and we review known results on Babai’s conjecture. Despite recent cryptanalytic progress on particular instances, we show that the factorization, representation and balance problems presumably remain good sources of cryptographic hard problems. Our study demonstrates that Cayley hash functions deserve further interest by the cryptography community.