The groundwater flow problem in GFLOW is formulated in terms of the analytic element method (AEM), which is a variant of the Boundary Integral Equation Method (BIEM). Within the AEM a solution is sought for the a priory unknown “strength” parameters of the analytic elements. The strength parameter of a line-sink is its extraction rate σ [m/day], which is constant along the line-sink (Haitjema, ...

This paper argues that specified blocks have every advantage over the combination of assertions, preconditions, postconditions, invariants, and variants, both for verifying programs, and for program development. They are simpler, more general, easier to write, and they make proofs easier.

Probabilistic networks, used as an adjunci or alternative to the logzcal models used in AI and DSS, ogler a way to compactly represent a distribution over a set of random variables. Nonetheless, the specification of a given network may require conditional probabilities which are simply unavailable. In this paper a means for analyzing incompletely specified networks is presented, and some genera...

In this paper, an improved model is presented for analysis of failure probability of the interlayer sliding belts under seismic loads. Firstly, using the theory of the Markov chain, the relation between failure probabilities of specified interlayer sliding belts and elements in this interlayer sliding belt is deduced. Then, the failure function is proposed according to the destructive character...

Models are useful when they are compared with data. Whether this comparison should be qualitative or quantitative depends on circumstances, but in many cases some statistical comparison of model and data is useful and enhances objectivity. Unfortunately, ecological dynamic models tend to contain assumptions and simplifications which enhance tractability, promote insight, but spoil model fit and...

We prove a conjecture of Horak that can be thought of as an extension of classical results including Dirac’s theorem on the existence of Hamiltonian cycles. Namely, we prove for 1 ≤ k ≤ n − 2 if G is a connected graph with A ⊂ V (G) such that dG(v) ≥ k for all v ∈ A, then there exists a subtree T of G such that V (T ) ⊃ A and dT (v) ≤ ⌈ n−1 k ⌉ for all v ∈ A.

Effect of different fillers on natural rubber compounds was investigated through curing, mechanical properties and morphology studies for improving mechanical performance of rubber articles. In this work, natural rubber blends with Silica as Single-filler compounds, and blends with Silica and Carbon black as Bi-filler compounds were considered. Then, natural rubber blends with Silica, Carbon bl...

Credal networks are models that extend Bayesian nets to deal with imprecision in probability, and can actually be regarded as sets of Bayesian nets. Evidence suggests that credal nets are a powerful means to represent and deal with many important and challenging problems in uncertain reasoning. We give examples to show that some of these problems can only be modelled by credal nets called non-s...

We analyze the finite temperature phase diagram of fermion mixtures in one-dimensional optical lattices as a function of interaction strength. At low temperatures, the system evolves from an anisotropic three-dimensional Bardeen-Cooper-Schrieffer (BCS) superfluid to an effectively two-dimensional Berezinskii-Kosterlitz-Thouless (BKT) superfluid as the interaction strength increases. We calculat...