Improvements and comparison of heuristics for solving the uncapacitated multisource Weber problem

Copyright @ 2000 INFORMSThe multisource Weber problem is to locate simultaneously m facilities in the Euclidean plane to minimize the total transportation cost for satisfying the demand of n fixed users, each supplied from its closest facility. Many heuristics have been proposed for this problem, as well as a few exact algorithms. Heuristics are needed to solve quickly large problems and to provide good initial solutions for exact algorithms. We compare various heuristics, i.e., alternative location-allocation (Cooper 1964), projection (Bongartz et al. 1994), Tabu search (Brimberg and Mladenovic 1996a), p-Median plus Weber (Hansen ct al. 1996), Genetic search and several versions of Variable Neighbourhood search. Based on empirical tests that are reported, it is found that most traditional and some recent heuristics give poor results when the number of facilities to locate is large and that Variable Neighbourhood search gives consistently best results, on average, in moderate computing time.This study was supported by the Department of National Defence (Canada) Academic Research; Office of Naval Research Grant N00014-92-J-1194, Natural Sciences and Engineering Research Council of Canada Grant GPO 105574 and Fonds pour la Formation des Chercheurs et l’Aide a la Recherche Grant 32EQ 1048; and by an International Postdoctoral Fellowship of the Natural Sciences and Engineering Research Council of Canada, Grant OGPOO 39682

Micro/Nano Manufacturing

Micro- and nano-scale manufacturing has been the subject of ever more research and industrial focus over the past 10 years. Traditional lithography-based technology forms the basis of micro-electro-mechanical systems (MEMS) manufacturing, but also precision manufacturing technologies have been developed to cover micro-scale dimensions and accuracies. Furthermore, these fundamentally different technology platforms are currently combined in order to exploit the strengths of both platforms. One example is the use of lithography-based technologies to establish nanostructures that are subsequently transferred to 3D geometries via injection molding. Manufacturing processes at the micro-scale are the key-enabling technologies to bridge the gap between the nano- and the macro-worlds to increase the accuracy of micro/nano-precision production technologies, and to integrate different dimensional scales in mass-manufacturing processes. Accordingly, this Special Issue seeks to showcase research papers, short communications, and review articles that focus on novel methodological developments in micro- and nano-scale manufacturing, i.e., on novel process chains including process optimization, quality assurance approaches and metrology

Subsquares Approach - Simple Scheme for Solving Overdetermined Interval Linear Systems

In this work we present a new simple but efficient scheme - Subsquares approach - for development of algorithms for enclosing the solution set of overdetermined interval linear systems. We are going to show two algorithms based on this scheme and discuss their features. We start with a simple algorithm as a motivation, then we continue with a sequential algorithm. Both algorithms can be easily parallelized. The features of both algorithms will be discussed and numerically tested.Comment: submitted to PPAM 201

A combined biomarker and clinical panel for chronic graft versus host disease diagnosis.

Whilst many chronic graft versus host disease (cGVHD) biomarkers have been previously reported, few have been verified in an independent cGVHD cohort. We aimed to verify the diagnostic accuracy of previously reported markers of cGVHD in a multi-centre Chronic GVHD Consortium. A total of 42 RNA and 18 protein candidate biomarkers were assessed amongst 59 cGVHD cases and 33 matched non-GVHD controls. Total RNA was isolated from PBMC, and RNA markers were quantified using PCR. Serum protein markers were quantified using ELISA. A combined 3 RNA biomarker (IRS2, PLEKHF1 and IL1R2) and 2 clinical variables (recipient CMV serostatus and conditioning regimen intensity) panel accurately (AUC 0.81) segregated cGVHD cases from controls. Other studied RNA and protein markers were not confirmed as accurate cGVHD diagnostic biomarkers. The studied markers failed to segregate higher risk cGVHD (per overall NIH 0-3 score, and overlap versus classic cGVHD status). These data support the need for multiple independent verification studies for the ultimate clinical application of cGVHD diagnostic biomarkers

Decentralized learning with budgeted network load using Gaussian copulas and classifier ensembles

We examine a network of learners which address the same classification task but must learn from different data sets. The learners cannot share data but instead share their models. Models are shared only one time so as to preserve the network load. We introduce DELCO (standing for Decentralized Ensemble Learning with COpulas), a new approach allowing to aggregate the predictions of the classifiers trained by each learner. The proposed method aggregates the base classifiers using a probabilistic model relying on Gaussian copulas. Experiments on logistic regressor ensembles demonstrate competing accuracy and increased robustness in case of dependent classifiers. A companion python implementation can be downloaded at https://github.com/john-klein/DELC

Positive Semidefiniteness and Positive Definiteness of a Linear Parametric Interval Matrix

We consider a symmetric matrix, the entries of which depend linearly on some parameters. The domains of the parameters are compact real intervals. We investigate the problem of checking whether for each (or some) setting of the parameters, the matrix is positive definite (or positive semidefinite). We state a characterization in the form of equivalent conditions, and also propose some computationally cheap sufficient\,/\,necessary conditions. Our results extend the classical results on positive (semi-)definiteness of interval matrices. They may be useful for checking convexity or non-convexity in global optimization methods based on branch and bound framework and using interval techniques

Scalar Levin-Type Sequence Transformations

Sequence transformations are important tools for the convergence acceleration of slowly convergent scalar sequences or series and for the summation of divergent series. Transformations that depend not only on the sequence elements or partial sums $s_n$ but also on an auxiliary sequence of so-called remainder estimates $\omega_n$ are of Levin-type if they are linear in the $s_n$, and nonlinear in the $\omega_n$. Known Levin-type sequence transformations are reviewed and put into a common theoretical framework. It is discussed how such transformations may be constructed by either a model sequence approach or by iteration of simple transformations. As illustration, two new sequence transformations are derived. Common properties and results on convergence acceleration and stability are given. For important special cases, extensions of the general results are presented. Also, guidelines for the application of Levin-type sequence transformations are discussed, and a few numerical examples are given.Comment: 59 pages, LaTeX, invited review for J. Comput. Applied Math., abstract shortene

The Case for Agricultural Climate Services in Africa

Ninety percent of the world’s farms are managed by small-scale farmers, feeding millions of people. Unfortunately, those farmers face significant impacts from climate variability and change. These impacts disrupt their ability to meet livelihoods and sustenance needs, and to produce enough food for a growing world. Climate services provide information about these impacts and aim to support agricultural decision-making for improved livelihoods, resilience, and food security

Making Climate Services Work for Africa's Farmers at Scale

The substantial body of knowledge about good practice in climate services suggests that making climate services work for farmers at a national scale requires managing tradeoffs between meeting farmers’ context-specific needs and providing cost-effective services at scale