A new methodology for Bayesian history matching using parallel interacting Markov chain Monte Carlo

This paper presents an innovative application of a new class of parallel interacting Markov chains Monte Carlo to solve the Bayesian history matching (BHM) problem. BHM consists of sampling a posterior distribution given by the Bayesian theorem. Markov chain Monte Carlo (MCMC) is well suited for sampling, in principle, any type of distribution; however the number of iteration required by the traditional single-chain MCMC can be prohibitive in BHM applications. Furthermore, history matching is typically a highly nonlinear inverse problem, which leads in very complex posterior distributions, characterized by many separated modes. Therefore, single chain can be trapped into a local mode. Parallel interacting chains is an interesting way to overcome this problem, as shown in this paper. In addition, we presented new approaches to define starting points for the parallel chains. For validation purposes, the proposed methodology is firstly applied in a simple but challenging cross section reservoir model with many modes in the posterior distribution. Afterwards, the application to a realistic case integrated to geostatistical modelling is also presented. The results showed that the combination of parallel interacting chain with the capabilities of distributed computing commonly available nowadays is very promising to solve the BHM problem.     

On improving the performance of large parallel lattice Boltzmann flow simulations in heterogeneous porous media

Classical Cartesian domain decompositions for parallel lattice Boltzmann simulations of fluid flow through heterogeneous porous media are doomed to workload imbalance as the number of processors increases, thus leading to decreasing parallel performance. A one-lattice lattice Boltzmann method (LBM) implementation with vector data structure combined with even fluid node partitioning domain decomposition and fully-optimized data transfer layout is presented. It is found to provide nearly-optimal workload balance, lower memory usage and better computational performance than classical slice decomposition techniques using sparse matrix data structures. Predictive memory usage and parallel performance models are also established and observed to be in very good agreement with data corresponding to numerical fluid flow simulations performed through 3-dimensional packings of cylinders and polydisperse spheres.     

Accuracy estimate and optimization techniques for SimRank computation

The measure of similarity between objects is a very useful tool in many areas of computer science, including information retrieval. SimRank is a simple and intuitive measure of this kind, based on a graph-theoretic model. SimRank is typically computed iteratively, in the spirit of PageRank. However, existing work on SimRank lacks accuracy estimation of iterative computation and has discouraging time complexity. In this paper, we present a technique to estimate the accuracy of computing SimRank iteratively. This technique provides a way to find out the number of iterations required to achieve a desired accuracy when computing SimRank. We also present optimization techniques that improve the computational complexity of the iterative algorithm from O(n ⁴) in the worst case to min(O(nl), O(n ³/ log₂ n)), with n denoting the number of objects, and l denoting the number object-to-object relationships. We also introduce a threshold sieving heuristic and its accuracy estimation that further improves the efficiency of the method. As a practical illustration of our techniques, we computed SimRank scores on a subset of English Wikipedia corpus, consisting of the complete set of articles and category links.     

Real-time massive convolution for audio applications on GPU

Massive convolution is the basic operation in multichannel acoustic signal processing. This field has experienced a major development in recent years. One reason for this has been the increase in the number of sound sources used in playback applications available to users. Another reason is the growing need to incorporate new effects and to improve the hearing experience. Massive convolution requires high computing capacity. GPUs offer the possibility of parallelizing these operations. This allows us to obtain the processing result in much shorter time and to free up CPU resources. One important aspect lies in the possibility of overlapping the transfer of data from CPU to GPU and vice versa with the computation, in order to carry out real-time applications. Thus, a synthesis of 3D sound scenes could be achieved with only a peer-to-peer music streaming environment using a simple GPU in your computer, while the CPU in the computer is being used for other tasks. Nowadays, these effects are obtained in theaters or funfairs at a very high cost, requiring a large quantity of resources. Thus, our work focuses on two mains points: to describe an efficient massive convolution implementation and to incorporate this task to real-time multichannel-sound applications.     

Characterization of renal tumours based on Raman spectra classification

In this study, we propose to evaluate the potential of Raman spectroscopy (RS) to assess renal tumours at surgery. Different classes of Raman renal spectra acquired during a clinical protocol are discriminated using support vector machines classifiers. The influence on the classification scores of various preprocessing steps generally involved in RS are also investigated and evaluated in the particular context of renal tumour characterization. Encouraging results show the interest of RS to evaluate kidney cancer and suggest the potential of this technique as a surgical assistance during partial nephrectomy.     

Reliability versus performance for critical applications

Applications implemented on critical systems are subject to both safety critical and real-time constraints. Classically, applications are specified as precedence task graphs that must be scheduled onto a given target multiprocessor heterogeneous architecture. We propose a new method for simultaneously optimizing two objectives: the execution time and the reliability of the schedule. The problem is decomposed into two successive steps: a spatial allocation during which the reliability is maximized (randomized algorithm), and a scheduling during which the makespan is minimized (list scheduling algorithm). It allows us to produce several trade-off solutions, among which the user can choose the solution that best fits the application’s requirements. Reliability is increased by replicating adequate tasks onto well chosen processors. Our fault model assumes that processors are fail-silent, that they are subject to transient failures, and that the occurrences of failures follow a constant parameter Poisson law. We assess and validate our method by running extensive simulations on both random graphs and actual application graphs. They show that it is competitive, in terms of makespan, compared to existing reference scheduling methods for heterogeneous processors (HEFT), while providing a better reliability.     

Airflow in a slot-ventilated enclosure partially filled with porous boxes: Part I - Measurements and simulations in the clear region

A reduced-scale model and CFD predictions were used to investigate experimentally and numerically the airflow patterns within a ceiling slot-ventilated enclosure partially loaded with vented boxes filled by spherical objects. The experiments were carried out using laser Doppler velocimetry. Airflows around and inside porous boxes were predicted taking into account their aerodynamic interactions. This work is divided into two parts. This paper presents part I and concerns the air velocity characteristics within the jet above the boxes, while Part II deals with the air velocity characteristics inside the boxes. The results highlight the confinement effect due to the enclosure and the influence of load porosity on jet penetration, its development and hence the heterogeneity of ventilation within the enclosure. The numerical predictions obtained with the computational fluid dynamics Fluent package using the RSM turbulence model show reasonable agreement with experimental data. Predicted velocity profiles were generally within an error of 3-30% of the measured velocities.     

A DSS for integrated distribution of empty and full containers

A DSS integrating empty and full containers transshipment operations is presented, addressing the typically unbalanced export/import containers trading problem. The problem is modeled as a network, where nodes represent customers, leasing companies, harbors and warehouses, while arcs represent transportation routes. The underlying mathematical model operates in stages, first prioritizing and adjusting full containers demands considering available empty containers supplies, and then statically optimizing costs. Transportation routes are registered and dynamically controlled, cyclically, for a given time horizon. The DSS is flexible, allowing several parameters to be configured. Experimental examples using randomly generated parameters were conducted to evaluate the effectiveness of the system.     

Betriebliches Identitätsmanagement

Enterprise Identity Management Systems (EIdMS) are an IT-based infrastructure that needs to be integrated in various business processes and related infrastructures. Assessment and preparation of decisions for the introduction need to take the costs, benefits, and the organizational settings into consideration. A variety of methods for the evaluation and decision support of new IT (e. g. EIdMS) are discussed in the literature – however, these are typically based on single dimensions (e. g. financial or technology aspects). This paper proposes a multidimensional decision support framework, based on the Balanced Scorecard concept. The presented approach introduces four perspectives and a related set of initial decision parameters to support decision making. The perspectives are (a) financial/monetary, (b) business processes, (c) supporting processes and (ICT) infrastructure and (d) information security, risks and compliance. Perspectives and adaptable sets of decision parameters also may serve as foundation for software-based decision support instruments.