We formulate the Forest Management Problem as a Multicommodity Network Flow Problem with a convex cost function. We then show how to transfer the problem to an equivalent Single-Commodity Network Flow formulation in order to address several sensitivity analysis questions using results by Granot...

We consider a rich tanker trailer routing problem with stochastic transit times for chemicals and liquid bulk orders. A typical route of the tanker trailer comprises of sourcing a cleaned and prepped trailer from a pre-wash location, pickup and delivery of chemical orders, cleaning the tanker...

The R package emdi offers a methodological and computational framework for the estimation of regionally disaggregated indicators using small area estimation methods and provides tools for assessing, processing and presenting the results. A range of indicators that includes the mean of the target...

We assess gains from parallel computation on Backlight supercomputer. The information transfers are expensive. We find that to make parallel computation efficient, a task per core must be sufficiently large, ranging from few seconds to one minute depending on the number of cores employed. For...

Progress in information technologies has enabled to apply computer-intensive methods to statistical analysis. In time series modeling, sequential Monte Carlo method was developed for general nonlinear non-Gaussian state-space models and it enables to consider very complex nonlinear non-Gaussian...

The traditional Monte Carlo simulation of order transitions in a ferromagnet (or in a binary crystalline alloy) is carried out by generating a sequence of local swaps (spin reversals or exchanges of atoms) on a finite lattice, each of which in turn is accepted or rejected according to...

The parallel computational complexity of the Bak–Sneppen evolution model is studied. It is shown that Bak–Sneppen histories can be generated by a massively parallel computer in a time that is polylogarithmic in the length of the history. In this parallel dynamics, histories are built up via...

In the present study, in-cylinder diesel combustion simulation was performed with parallel processing on an Intel Xeon Quad-Core platform to allow both fluid dynamics and chemical kinetics of the surrogate diesel fuel model to be solved simultaneously on multiple processors. Here, Cartesian...

We assess gains from parallel computation on Backlight supercomputer. We find that information transfers are expensive. To make parallel computation efficient, a task per core must be sufficiently large, ranging from few seconds to one minute depending on the number of cores employed. For small...

The neutronic simulation of a nuclear reactor core is performed using the neutron transport equation, and leads to an eigenvalue problem in the steady-state case. Among the deterministic resolution methods, simplified transport (SPN) or diffusion approximations are often used. The MINOS solver...