Design patterns percolating to parallel programming framework implementation

Structured parallel programming is recognised as a viable and effective means of tackling parallel programming problems. Recently, a set of simple and powerful parallel building blocks RISC pb²l) has been proposed to support modelling and implementation of parallel frameworks. In this work we demonstrate how that same parallel building block set may be used to model both general purpose parallel programming abstractions, not usually listed in classical skeleton sets, and more specialized domain specific parallel patterns. We show how an implementation of RISC pb² l can be realised via the FastFlow framework and present experimental evidence of the feasibility and efficiency of the approach.

The Equiprobability Bias from a Mathematical and Psychological Perspective

The equiprobability bias (EB) is a tendency to believe that every process in which randomness is involved corresponds to a fair distribution, with equal probabilities for any possible outcome. The EB is known to affect both children and adults, and to increase with probability education. Because it results in probability errors resistant to pedagogical interventions, it has been described as a deep misconception about randomness: the erroneous belief that randomness implies uniformity. In the present paper, we show that the EB is actually not the result of a conceptual error about the definition of randomness. On the contrary, the mathematical theory of randomness does imply uniformity. However, the EB is still a bias, because people tend to assume uniformity even in the case of events that are not random. The pervasiveness of the EB reveals a paradox: The combination of random processes is not necessarily random. The link between the EB and this paradox is discussed, and suggestions are made regarding educational design to overcome difficulties encountered by students as a consequence of the EB.

Enhancing Linear Programming with Motion Modeling for Multi-target Tracking

In this paper we extend the minimum-cost network flow approach to multi-target tracking, by incorporating a motion model, allowing the tracker to better cope with longterm occlusions and missed detections. In our new method, the tracking problem is solved iteratively: Firstly, an initial tracking solution is found without the help of motion information. Given this initial set of tracklets, the motion at each detection is estimated, and used to refine the tracking solution.
Finally, special edges are added to the tracking graph, allowing a further revised tracking solution to be found, where distant tracklets may be linked based on motion similarity. Our system has been tested on the PETS S2.L1 and Oxford town-center sequences, outperforming the baseline system, and achieving results comparable with the current state of the art.

A Significance-Driven Programming Framework for Energy-Constrained Approximate Computing

Approximate execution is a viable technique for energy-con\-strained environments, provided that applications have the mechanisms to produce outputs of the highest possible quality within the given energy budget.
We introduce a framework for energy-constrained execution with controlled and graceful quality loss. A simple programming model allows users to express the relative importance of computations for the quality of the end result, as well as minimum quality requirements. The significance-aware runtime system uses an application-specific analytical energy model to identify the degree of concurrency and approximation that maximizes quality while meeting user-specified energy constraints. Evaluation on a dual-socket 8-core server shows that the proposed
framework predicts the optimal configuration with high accuracy, enabling energy-constrained executions that result in significantly higher quality compared to loop perforation, a compiler approximation technique.

A Programming Model and Runtime System for Significance-Aware Energy-Efficient Computing.

We introduce a task-based programming model and runtime system that exploit the observation that not all parts of a program are equally significant for the accuracy of the end-result, in order to trade off the quality of program outputs for increased energy-efficiency. This is done in a structured and flexible way, allowing for easy exploitation of different points in the quality/energy space, without adversely affecting application performance. The runtime system can apply a number of different policies to decide whether it will execute less-significant tasks accurately or approximately.

The experimental evaluation indicates that our system can achieve an energy reduction of up to 83% compared with a fully accurate execution and up to 35% compared with an approximate version employing loop perforation. At the same time, our approach always results in graceful quality degradation.

Approximate credal network updating by linear programming with applications to decision making

Credal nets are probabilistic graphical models which extend Bayesian nets to cope with sets of distributions. An algorithm for approximate credal network updating is presented. The problem in its general formulation is a multilinear optimization task, which can be linearized by an appropriate rule for fixing all the local models apart from those of a single variable. This simple idea can be iterated and quickly leads to accurate inferences. A transformation is also derived to reduce decision making in credal networks based on the maximality criterion to updating. The decision task is proved to have the same complexity of standard inference, being NPPP-complete for general credal nets and NP-complete for polytrees. Similar results are derived for the E-admissibility criterion. Numerical experiments confirm a good performance of the method.

Inference in Credal Networks Through Integer Programming

A credal network associates a directed acyclic graph with a collection of sets of probability measures; it offers a compact representation for sets of multivariate distributions. In this paper we present a new algorithm for inference in credal networks based on an integer programming reformulation. We are concerned with computation of lower/upper probabilities for a variable in a given credal network. Experiments reported in this paper indicate that this new algorithm has better performance than existing ones for some important classes of networks.

Inference in credal networks using multilinear programming

A credal network is a graphical tool for representation and manipulation of uncertainty, where probability values may be imprecise or indeterminate. A credal network associates a directed acyclic graph with a collection of sets of probability measures; in this context, inference is the computation of tight lower and upper bounds for conditional probabilities. In this paper we present new algorithms for inference in credal networks based on multilinear programming techniques. Experiments indicate that these new algorithms have better performance than existing ones, in the sense that they can produce more accurate results in larger networks.

Mathematical modelling of quantum yield enhancements of methyl orange photooxidation in aqueous TiO2 suspensions under controlled periodic UV LED illumination

Quantum yields of the photocatalytic degradation of methyl orange under controlled periodic illumination (CPI) have been modelled using existing models. A modified Langmuir-Hinshelwood (L-H) rate equation was used to predict the degradation reaction rates of methyl orange at various duty cycles and a simple photocatalytic model was applied in modelling quantum yield enhancement of the photocatalytic process due to the CPI effect. A good agreement between the modelled and experimental data was observed for quantum yield modelling. The modified L-H model, however, did not accurately predict the photocatalytic decomposition of the dye under periodic illumination.

Bdellovibrio predation in the presence of decoys:Three-way bacterial interactions revealed by mathematical and experimental analyses

Bdellovibrio bacteriovorus is a small, gram-negative, motile bacterium that preys upon other gram-negative bacteria, including several known human pathogens. Its predation efficiency is usually studied in pure cultures containing solely B. bacteriovorus and a suitable prey. However, in natural environments, as well as in any possible biomedical uses as an antimicrobial, Bdellovibrio is predatory in the presence of diverse decoys, including live nonsusceptible bacteria, eukaryotic cells, and cell debris. Here we gathered and mathematically modeled data from three-member cultures containing predator, prey, and nonsusceptible bacterial decoys. Specifically, we studied the rate of predation of planktonic late-log-phase Escherichia coli S17-1 prey by B. bacteriovorus HD100, both in the presence and in the absence of Bacillus subtilis nonsporulating strain 671, which acted as a live bacterial decoy. Interestingly, we found that although addition of the live Bacillus decoy did decrease the rate of Bdellovibrio predation in liquid cultures, this addition also resulted in a partially compensatory enhancement of the availability of prey for predation. This effect resulted in a higher final yield of Bdellovibrio than would be predicted for a simple inert decoy. Our mathematical model accounts for both negative and positive effects of predator-prey-decoy interactions in the closed batch environment. In addition, it informs considerations for predator dosing in any future therapeutic applications and sheds some light on considerations for modeling the massively complex interactions of real mixed bacterial populations in nature.