Science Diplomacy: Introduction to a Boundary Problem

Scientific advancements, their application through technological development, and world politics have been long acknowledged as affecting each other, and are today more than ever at the heart of global policy. Speaking of ‘science diplomacy’ as the encounter of world politics and the world of science at the heart of these advancements might be a unique window into our time. This potential is what prompts this special issue to gather views from a variety of scholarly and practical viewpoints, linking the well‐established world of reflective practitioners in science diplomacy to the growing field of international relations (IR) scholars theorising this realm. Can speaking of ‘science diplomacy’ situate our attention at the crossroads of science and international relations, and spur greater appreciation for their intersections? This introduction to the special issue summarises the rise of science diplomacy as field of inquiry, and casts questions as to the need to advance, where not reform, these conceptualisations. It defines science diplomacy as a ‘boundary problem’ par excellence and emphasises its ‘productive tension’ that emerges between the various ways of knowing of actors belonging to ‘different social worlds’, seeking to gather a productive tension of views on this theme in the issue

Impacts of global change on water-related sectors and society in a trans-boundary central European river basin – Part 2: From eco-hydrology to water demand management

This second part of the paper presents the details of the eco-hydrological model SWIM simulating the natural water supply and its coupling to WBalMo, a water management model. Based on the climate scenarios of the STAR model, SWIM simulates the natural water and matter fluxes for the entire Elbe River area. All relevant processes are modelled for hydrotopes and the resulting discharges are accumulated in subbasins. The output data are input for the water management model WBalMo and the quality models Moneris and QSim. WBalMo takes storage management, inputs and withdrawals into account and analyses how demands by industry, power plants and households will be met at changing natural supply conditions. Some of the first results shall be presented here

06271 Abstracts Collection -- Challenges in Symbolic Computation Software

From 02.07.06 to 07.07.06, the Dagstuhl Seminar 06271 ``Challenges in Symbolic Computation Software\u27\u27 was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available

Impacts of global change on water-related sectors and society in a trans-boundary central European river basin – Part 1: Project framework and impacts on agriculture

Central Europe, the focus region of this study, is a region in transition, climatically from maritime to continental and politically from formerly more planning-oriented to more market-oriented management regimes, and in terms of climate change from regions of increasing precipitation in the west and north of Europe to regions of decreasing precipitation in central and southern Europe. The Elbe basin, a trans-boundary catchment flowing from the Czech Republic through Germany into the North Sea, was selected to investigate the possible impacts of global change on crop yields and water resources in this region. For technical reasons, the paper has been split into two parts, the first showing the overall model concept, the model set-up for the agricultural sector, and first results linking eco-hydrological and agro-economic tools for the German part of the basin. The second part describes the model set-up for simulating water supply and demand linking eco-hydrological and water management tools for the entire basin including the Czech part

Revisit Sparse Polynomial Interpolation based on Randomized Kronecker Substitution

In this paper, a new reduction based interpolation algorithm for black-box multivariate polynomials over finite fields is given. The method is based on two main ingredients. A new Monte Carlo method is given to reduce black-box multivariate polynomial interpolation to black-box univariate polynomial interpolation over any ring. The reduction algorithm leads to multivariate interpolation algorithms with better or the same complexities most cases when combining with various univariate interpolation algorithms. We also propose a modified univariate Ben-or and Tiwarri algorithm over the finite field, which has better total complexity than the Lagrange interpolation algorithm. Combining our reduction method and the modified univariate Ben-or and Tiwarri algorithm, we give a Monte Carlo multivariate interpolation algorithm, which has better total complexity in most cases for sparse interpolation of black-box polynomial over finite fields

Gradual sub-lattice reduction and a new complexity for factoring polynomials

We present a lattice algorithm specifically designed for some classical applications of lattice reduction. The applications are for lattice bases with a generalized knapsack-type structure, where the target vectors are boundably short. For such applications, the complexity of the algorithm improves traditional lattice reduction by replacing some dependence on the bit-length of the input vectors by some dependence on the bound for the output vectors. If the bit-length of the target vectors is unrelated to the bit-length of the input, then our algorithm is only linear in the bit-length of the input entries, which is an improvement over the quadratic complexity floating-point LLL algorithms. To illustrate the usefulness of this algorithm we show that a direct application to factoring univariate polynomials over the integers leads to the first complexity bound improvement since 1984. A second application is algebraic number reconstruction, where a new complexity bound is obtained as well

Certification of Bounds of Non-linear Functions: the Templates Method

The aim of this work is to certify lower bounds for real-valued multivariate functions, defined by semialgebraic or transcendental expressions. The certificate must be, eventually, formally provable in a proof system such as Coq. The application range for such a tool is widespread; for instance Hales' proof of Kepler's conjecture yields thousands of inequalities. We introduce an approximation algorithm, which combines ideas of the max-plus basis method (in optimal control) and of the linear templates method developed by Manna et al. (in static analysis). This algorithm consists in bounding some of the constituents of the function by suprema of quadratic forms with a well chosen curvature. This leads to semialgebraic optimization problems, solved by sum-of-squares relaxations. Templates limit the blow up of these relaxations at the price of coarsening the approximation. We illustrate the efficiency of our framework with various examples from the literature and discuss the interfacing with Coq.Comment: 16 pages, 3 figures, 2 table

Finding polynomial loop invariants for probabilistic programs

Quantitative loop invariants are an essential element in the verification of probabilistic programs. Recently, multivariate Lagrange interpolation has been applied to synthesizing polynomial invariants. In this paper, we propose an alternative approach. First, we fix a polynomial template as a candidate of a loop invariant. Using Stengle's Positivstellensatz and a transformation to a sum-of-squares problem, we find sufficient conditions on the coefficients. Then, we solve a semidefinite programming feasibility problem to synthesize the loop invariants. If the semidefinite program is unfeasible, we backtrack after increasing the degree of the template. Our approach is semi-complete in the sense that it will always lead us to a feasible solution if one exists and numerical errors are small. Experimental results show the efficiency of our approach.Comment: accompanies an ATVA 2017 submissio

On the Generation of Positivstellensatz Witnesses in Degenerate Cases

One can reduce the problem of proving that a polynomial is nonnegative, or more generally of proving that a system of polynomial inequalities has no solutions, to finding polynomials that are sums of squares of polynomials and satisfy some linear equality (Positivstellensatz). This produces a witness for the desired property, from which it is reasonably easy to obtain a formal proof of the property suitable for a proof assistant such as Coq. The problem of finding a witness reduces to a feasibility problem in semidefinite programming, for which there exist numerical solvers. Unfortunately, this problem is in general not strictly feasible, meaning the solution can be a convex set with empty interior, in which case the numerical optimization method fails. Previously published methods thus assumed strict feasibility; we propose a workaround for this difficulty. We implemented our method and illustrate its use with examples, including extractions of proofs to Coq.Comment: To appear in ITP 201

On the complexity of computing real radicals of polynomial systems

International audienceLet f= (f1, ..., fs) be a sequence of polynomials in Q[X1,...,Xn] of maximal degree D and V⊂ Cn be the algebraic set defined by f and r be its dimension. The real radical re associated to f is the largest ideal which defines the real trace of V . When V is smooth, we show that re , has a finite set of generators with degrees bounded by V. Moreover, we present a probabilistic algorithm of complexity (snDn )O(1) to compute the minimal primes of re . When V is not smooth, we give a probabilistic algorithm of complexity sO(1) (nD)O(nr2r) to compute rational parametrizations for all irreducible components of the real algebraic set V ∩ Rn. Experiments are given to show the efficiency of our approaches