Why Methods for Optimization Problems with Time-Consuming Function Evaluations and Integer Variables Should Use Global Approximation Models

This paper advocates the use of methods based on global approximation models for optimization problems with time-consuming function evaluations and integer variables.We show that methods based on local approximations may lead to the integer rounding of the optimal solution of the continuous problem, and even to worse solutions.Then we discuss a method based on global approximations.Test results show that such a method performs well, both for theoretical and practical examples, without suffering the disadvantages of methods based on local approximations.approximation models;black-box optimization;integer optimization

Probing the Light Pseudoscalar Window

Very light pseudoscalars can arise from the symmetry-breaking sector in many extensions of the Standard Model. If their mass is below 200 MeV, they can be long-lived and have interesting phenomenology. We discuss the experimental constraints on several models with light pseudoscalars, including one in which the pseudoscalar is naturally fermiophobic. Taking into account the stringent bounds from rare K and B decays, we find allowed parameter space in each model that may be accessible in direct production experiments. In particular, we study the photoproduction of light pseudoscalars at Jefferson Lab and conclude that a beam dump experiment could explore some of the allowed parameter space of these models.Comment: 22 pages, 4 figure

Recurrent governance challenges in the implementation and alignment of flood risk management strategies: a review

In Europe increasing flood risks challenge societies to diversify their Flood Risk Management Strategies (FRMSs). Such a diversification implies that actors not only focus on flood defence, but also and simultaneously on flood risk prevention, mitigation, preparation and recovery. There is much literature on the implementation of specific strategies and measures as well as on flood risk governance more generally. What is lacking, though, is a clear overview of the complex set of governance challenges which may result from a diversification and alignment of FRM strategies. This paper aims to address this knowledge gap. It elaborates on potential processes and mechanisms for coordinating the activities and capacities of actors that are involved on different levels and in different sectors of flood risk governance, both concerning the implementation of individual strategies and the coordination of the overall set of strategies. It identifies eight overall coordination mechanisms that have proven to be useful in this respect

Why Methods for Optimization Problems with Time-Consuming Function Evaluations and Integer Variables Should Use Global Approximation Models

This paper advocates the use of methods based on global approximation models for optimization problems with time-consuming function evaluations and integer variables.We show that methods based on local approximations may lead to the integer rounding of the optimal solution of the continuous problem, and even to worse solutions.Then we discuss a method based on global approximations.Test results show that such a method performs well, both for theoretical and practical examples, without suffering the disadvantages of methods based on local approximations.

On-chip integrated amplifiers and lasers utilizing rare-earth-ion activation

This contribution reviews our recent results on rare-earth-ion-doped integrated amplifiers and lasers. We have concentrated our efforts on complex-doped polymers, amorphous Al2O3, and crystalline potassium double tungstates

Matching structure and bargaining outcomes in buyer–seller networks

We examine the relationship between the matching structure of a bipartite (buyer-seller) network and the (expected) shares of the unit surplus that each connected pair in this network can create. We show that in different bargaining environments, these shares are closely related to the Gallai-Edmonds Structure Theorem. This theorem characterizes the structure of maximum matchings in an undirected graph. We show that the relationship between the (expected) shares and the tructure Theorem is not an artefact of a particular bargaining mechanism or trade centralization. However, this relationship does not necessarily generalize to non-bipartite networks or to networks with heterogeneous link values