Computing the probability that two nodes in a probabilistic network are connected is a wellknown computationally difficult problem. Two strategies are devised for obtaining lower bounds on the connection probability for two terminals. The first improves on the Kruskal-Katona bound by using efficient computations of small pathsets. The second strategy employs efficient algorithms for finding edg...

Total mercury levels in different feather types (down, contour, tail and flight) in Great Cormorants (Phalacrocorax carbo L.) were determined using CV-AAS. Feathers from Great Cormorants inhabiting the Vistula Lagoon ecosystem have an average Hg level of 7.14 ± 3.99 (μg/g w.w.). Age-dependent concentrations of Hg were statistically significant (ANOVA Kruskal-Wallis, p < 0.0001). There were also...

The shadow function is closely related to the Kruskal-Katona Theorem. The Takagi function is a standard example of a nowhere differentiable continuous function. The purpose of this paper is to exhibit a rather surprising relationship between the shadow function and the Takagi function. Using this relationship, one can approximately compute the size of minimum shadows in uniform hypergraphs with...