Search

The mud undrained shear strength and viscosity are the essential parameters in understanding the behavior of mudflow. One of the laboratory test methods to estimate the undrained shear strength and viscosity is Vallejo and Scovazzo's cylinder strength meter test (CSMT) and flume channel test, respectively. This paper compares the undrained shear strength of kaolin and bentonite muds obtained from the CMST to those obtained using the fall cone and mini vane shear tests and also studies the scale effects in the flume channel test in measuring the mud viscosity at a 20o to 40o slope angles and at various liquidity indexes. The results exhibit that CMST could estimate the undrained strength of mud as low as 0.45 kN/m2 with a liquidity index of up to 5.93. Then, the reduction of the size of the flume channel by half resulted in a mud viscosity of about 2.3 times higher. [ABSTRACT FROM AUTHOR]

Semistructured data appears when the source does not impose a rigid structure on the data, such as the web, or when data is combined from several heterogeneous sources. In mathematical terms, we called semi structured data set as graph data set One particular interesting in mining semi structured pattern is finding frequent highly connected subgraph in large relational graphs. The common problem is to find not only frequent graphs, but also graphs that satisfy the connectivity constraint. We identify three major characteristics different from the previous frequent graph mining problem. First, in relational graphs each node represents a distinct object. No two nodes share the same label. In biological networks, nodes often represent unique objects like genes and enzymes. Secondly, relational graphs may be very large. Thirdly, the interesting patterns should not only be frequent but also satisfy the connectivity constraint. In order to handle these new challenges, we identify two issues have to be solved (1) how to mine frequent graphs efficiently in large relational graphs, and (2) how to handle the connectivity constraint. Since frequent graph mining usually generates too many patterns, it is more appealing to mine closed frequent graphs only. Our major contribution is to tackle the connectivity constraint. We use the minimum cut criterion to measure the connectivity of a pattern and examine the issues of integrating the connectivity constraint with the closed graph mining process. [ABSTRACT FROM AUTHOR]

This study examined the maternal and fetal blood kinetics of lead in pregnant, near term mini-pigs. A lead dose of 1 mg/kg was administered to the animals by i.v. injection as bolus. During the 5-h sampling period, the two-compartment maternal pharmacokinetics demonstrated a rapid phase T1/2 of 8 min and a slower phase T1/2 of 199 min. Lead reached the fetus with a time lag of 81 min. At 24 h after administration the ratio of fetal to maternal blood lead concentration seemed to become stable. When lead was injected directly into the fetal blood circulation, the decay of fetal blood lead fitted one-compartment model. The disappearance half-life was 92 min. Lead can obviously accumulate in fetal liver; the lead level in fetal brain showed no detectable changes. This study confirmed that lead can also pass through the epitheliochorial placenta.