A comprehensive mathematical model based on the discrete particle model and computational fluid dynamics was utilized to investigate mixing and segregation of particles in fluidized beds at high pressure. To quantify the extent of mixing in the bed, the Lacey mixing index was used. Simulations were carried out with different mass fractions of small particles at various pressures ranging from 1 ...

A method for non-parametric regression effects is applied to spatially configured data, using a generalised additive form that allows regression effects to vary over areas. The focus is on discrete outcomes in disease mapping but can be adapted to metric outcomes. Specifically a mixed model is proposed that combines a local general additive model (GAM) element for each area with a spatially fil...

The purpose of this study is the dimensioning of the cylindrical mixing chamber of a compressible fluid ejector used in particular in sugar refineries for degraded vapor re-compression at the calandria exit, during the evaporation phase. The method used, known as the “integral” or “thermodynamic model”, is based on the model of the one-dimensional isentropic flow of perfect gases with the addit...

This article examines the geographical corridors for the establishment of rice in seventeenth-century Dutch Guiana. One corridor of introduction is associated with the expulsion of Dutch planters from Brazil in 1644, whose slaves reestablished longstanding subsistence preferences with their exodus to the colony. Another corridor links its introduction to the African Gold Coast, where rice devel...

An (N ;n,m, {w1, . . . , wt})-separating hash family is a set H of N functions h : X −→ Y with |X| = n, |Y | = m, t ≥ 2 having the following property. For any pairwise disjoint subsets C1, . . . , Ct ⊆ X with |Ci| = wi, i = 1, . . . , t, there exists at least one function h ∈ H such that h(C1), h(C2), . . . , h(Ct) are pairwise disjoint. Separating hash families generalize many known combinator...

We present the software library marathon, which is designed to support the analysis of sampling algorithms that are based on the Markov-Chain Monte Carlo principle. The main application of this library is the computation of properties of so-called state graphs, which represent the structure of Markov chains. We demonstrate applications and the usefulness of marathon by investigating the quality...