This paper details the implementation and trialling of a prototype in-bucket bulk density monitor on a production dragline. Bulk density information can provide feedback to mine planning and scheduling to improve blasting and consequently facilitating optimal bucket sizing. The bulk density measurement builds upon outcomes presented in the AMTC2009 paper titled ‘Automatic In-Bucket Volume Estim...

OBJECTIVE Determine diagnostic power and intercorrelation between bladder outlet obstruction number (BOON) and intravesical prostatic protrusion (IPP ) as non-invasive predictors of infravesical obstruction in patients with lower urinary tract symptoms due to benign prostatic enlargement. MATERIAL AND METHODS Prospective study during 2009-2010 analyzed data of 110 patients with proven benign ...

Edible film with maximum tensile strength (TS), elongation at break (EAB), and antioxidant capacity were obtained 29.42:70.58 (v/v) of grape juice (GJ): water volume ratio, 5% (w/v) cross-linked maize starch (CLMS), 0.5% glycerol by using Box–Behnken design. The optimum formulated was tested in the preservation fresh-cut pineapple slices. Oxygen concentration headspace did not change significan...

Given a graph G=(V, E), a connected sides cut (U, V\U) or δ(U) is the set of edges of E linking all vertices of U to all vertices of V\U such that the induced subgraphs G[U] and G[V\U] are connected. Given a positive weight function w defined on E, the maximum connected sides cut problem is to find a connected sides cut Ω such that w(Ω) is maximum. This problem is NP-hard. In this paper, we giv...

For a connected graph G = (V,E), a subset U ⊆ V is called a disconnected cut if U disconnects the graph and the subgraph induced by U is disconnected as well. A natural condition is to impose that for any u ∈ U the subgraph induced by (V \U)∪{u} is connected. In that case U is called a minimal disconnected cut. We show that the problem of testing whether a graph has a minimal disconnected cut i...