Component-Based Software Realisations of Monte Carlo and Stochastic Galerkin Methods

In this paper we present a component–based software realisation of the Monte Carlo and Stochastic Galerkin methods for simulating stochastic models with uncertain parameters described by random fields. The system supports parallel and distributed computations and focuses on the reusability and extensibility of the provided components and frameworks. Third–party software is interfaced to avoid cost–intensive reimplementations. The mentioned schemes are compared with respect to their convergence by considering a stationary groundwater flow model. (© 2008 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Parallel branch, cut, and price for large-scale discrete optimization

In discrete optimization, most exact solution approaches are based on branch and bound, which is conceptually easy to parallelize in its simplest forms. More sophisticated variants, such as the so-called branch, cut, and price algorithms, are more difficult to parallelize because of the need to share large amounts of knowledge discovered during the search process. In the first part of the paper, we survey the issues involved in parallelizing such algorithms. We then review the implementation of SYMPHONY and COIN/BCP, two existing frameworks for implementing parallel branch, cut, and price. These frameworks have limited scalability, but are effective on small numbers of processors. Finally, we briefly describe our next-generation framework, which improves scalability and further abstracts many of the notions inherent in parallel BCP, making it possible to implement and parallelize more general classes of algorithms. Mathematics Subject Classification (1991):65K05, 68N99, 68W10, 90-04, 90-08, 90C06, 90C09, 90C10, 90C11, 90C57     

Graphical tools for model-based mixture discriminant analysis

The paper introduces a methodology for visualizing on a dimension reduced subspace the classification structure and the geometric characteristics induced by an estimated Gaussian mixture model for discriminant analysis. In particular, we consider the case of mixture of mixture models with varying parametrization which allow for parsimonious models. The approach is an extension of an existing work on reducing dimensionality for model-based clustering based on Gaussian mixtures. Information on the dimension reduction subspace is provided by the variation on class locations and, depending on the estimated mixture model, on the variation on class dispersions. Projections along the estimated directions provide summary plots which help to visualize the structure of the classes and their characteristics. A suitable modification of the method allows us to recover the most discriminant directions, i.e., those that show maximal separation among classes. The approach is illustrated using simulated and real data.     

Long-range predictive adaptive fuzzy relational control

A class of long-range predictive adaptive fuzzy relational controllers is presented. The plant behavior is described over an extended time horizon by a fuzzy relational model which is identified based on input-output closed-loop observations of the plant variables. In this class of adaptive controllers the control law attempts to minimize a quadratic cost over an extended control horizon. When used with linear models, this approach has revealed a significant potential for overcoming the limitations of one-step ahead schemes, such as the stabilization of non-minimum phase plants. Here, a uniform framework is adopted for implementing both the fuzzy model and the fuzzy controller, namely distributed fuzzy relational structures gaining from their massive parallel processing features and from the learning capabilities typical of the connectivist approaches. Issues such as maintenance during the adaptation process of the meaning of linguistic terms used at both fuzzy systems interfaces are addressed, namely by introducing a new design methodology for on-line fuzzy systems interface adaptation. The examples presented reinforce the claim of the usefulness of this new approach.     

Distributed Online Frequency Assignment in Cellular Networks

A cellular network is generally modeled as a subgraph of the triangular lattice. The distributed online frequency assignment problem can be abstracted as a multicoloring problem on a weighted graph, where the weight vector associated with the vertices models the number of calls to be served at the vertices and is assumed to change over time. In this paper, we develop a framework for studying distributed online frequency assignment in cellular networks. We present the first distributed online algorithms for this problem with proven bounds on their competitive ratios. We show a series of algorithms that use at each vertex information about increasingly larger neighborhoods of the vertex, and that achieve better competitive ratios. In contrast, we show lower bounds on the competitive ratios of some natural classes of online algorithms.     

Formal approaches to rule-based systems in medicine: The case of CADIAG-2

There is no established formal framework for expert systems based on weighted IF–THEN rules. We discuss three mathematical models that have been recently proposed by the authors for CADIAG-2—a well-known system of this kind. The three frameworks are based on fuzzy logics, probability theory and possibilistic logic, respectively. CADIAG-2 is used here as a case study to evaluate these frameworks. We point out their use, advantages and disadvantages. In addition, the described models provide insight into various aspects of CADIAG-2.     

On the influence of theory on research in mathematics education: the case of teaching and learning limits of functions

After an introduction on approaches, research frameworks and theories in mathematics education research, three didactical research studies on limits of functions with different research frameworks are analysed and compared with respect to their theoretical perspectives. It is shown how a chosen research framework defines the world in which the research lives, pointing to the difficult but necessary task to compare research results within a common field of study but conducted within different frameworks.     

A survey for the quadratic assignment problem

The quadratic assignment problem (QAP), one of the most difficult problems in the NP-hard class, models many real-life problems in several areas such as facilities location, parallel and distributed computing, and combinatorial data analysis. Combinatorial optimization problems, such as the traveling salesman problem, maximal clique and graph partitioning can be formulated as a QAP. In this paper, we present some of the most important QAP formulations and classify them according to their mathematical sources. We also present a discussion on the theoretical resources used to define lower bounds for exact and heuristic algorithms. We then give a detailed discussion of the progress made in both exact and heuristic solution methods, including those formulated according to metaheuristic strategies. Finally, we analyze the contributions brought about by the study of different approaches.     

Accept & reject statement-based uncertainty models

We develop a framework for modelling and reasoning with uncertainty based on accept and reject statements about gambles. It generalises the frameworks found in the literature based on statements of acceptability, desirability, or favourability and clarifies their relative position. Next to the statement-based formulation, we also provide a translation in terms of preference relations, discuss—as a bridge to existing frameworks—a number of simplified variants, and show the relationship with prevision-based uncertainty models. We furthermore provide an application to modelling symmetry judgements.     

An extended event graph-based modelling method for parallel and distributed discrete-event simulation

The developing logical process (LP)-based parallel and distributed discrete-event simulation (PDES) in the existing PDES programming environments is a difficult and time-consuming process. Event graph is a simple and powerful modelling formalism of discrete-event simulation, whereas this formalism does not support PDES. This article proposes an extension of the event graph to consider the communication of LPs via the events sent, which is called ‘extended event graph (EEG)’, and proposes an EEG-based modelling method for PDES. This modelling method shifts the focus of PDES development from writing code to building models, and the system implementation can be automatically and directly generated from EEG model. The experimental results show that EEG models can successfully execute in the parallel simulator, and this framework can effectively improve the PDES modelling activities.