[1] We report on laboratory experiments designed to illuminate grain-scale deformation mechanisms within fault gouge. We vary particle size distribution, grain and surface roughness, and gouge layer thickness to better understand how grain sliding, rolling, dilation, and compaction affect the strength and stability of granular fault gouge. The experiments employed the double direct shear testin...

Objective: The present research aimed to examine positive and negative beliefs about worry and tendency of students to drug abuse in terms of cross-level effect of school-bounding. Methods: In this multi-level investigation, 1000 students of high schools were selected by means of multi-stage sampling technique. Then, they completed metacognitive questionnaire (MCQ), school-bound...

In this paper we study the problem of shape from silhouette outlines (SFO) using a novel adaptive dandelion model. SFO reconstructs a 3D model using only the outmost silhouette contours and produces a solid called the ‘‘bounding hull’’. The dandelion model is composed of a pencil of organized line segments emitted from a common point which samples the bounding hull surface in regularly distribu...

A technique for bounding the capacities of networks of independent channels is introduced. Parts I and II treat pointto-point and multiterminal channels, respectively. Bounds are derived using a new tool called a bounding model. Channel 1 is an upper (lower) bounding model for channel 2 if replacing channel 2 by channel 1 in any network yields a new network whose capacity region is a superset (...

Principal component analysis (PCA) is commonly used to compute a bounding box of a point set in R. The popularity of this heuristic lies in its speed, easy implementation and in the fact that usually, PCA bounding boxes quite well approximate the minimumvolume bounding boxes. We present examples of discrete points sets in the plane, showing that the worst case ratio of the volume of the PCA bou...

This paper describes the design, implementation and testing of a suite of algorithms to enable depth constrained autonomous bathymetric (underwater topography) mapping by an Autonomous Surface Vessel (ASV). Given a target depth and a bounding polygon, the ASV will find and follow the intersection of the bounding polygon and the depth contour as modeled online with a Gaussian Process (GP). This ...