Dynamical evolution of escaped plutinos, another source of Centaurs

It was shown in previous works the existence of weakly chaotic orbits in the plutino population that diffuse very slowly. These orbits correspond to long-term plutino escapers and then represent the plutinos that are escaping from the resonance at present. In this paper we perform numerical simulations in order to explore the dynamical evolution of plutinos recently escaped from the resonance. The numerical simulations were divided in two parts. In the first one we evolved 20,000 test particles in the resonance in order to detect and select the long-term escapers. In the second one, we numerically integrate the selected escaped plutinos in order to study their dynamical post escaped behavior. Our main results include the characterization of the routes of escape of plutinos and their evolution in the Centaur zone. We obtained a present rate of escape of plutinos between 1 and 10 every 10 years. The escaped plutinos have a mean lifetime in the Centaur zone of 108 Myr and their contribution to the Centaur population would be a fraction of less than 6 % of the total Centaur population. In this way, escaped plutinos would be a secondary source of Centaurs.Comment: Accepted for publication in A&

The European Council, Council and Member States: jostling for influence

The European Council and the Council each constitute at once supranational EU institutions in which Member States collectively take decisions in the interest of the EU and intergovernmental bargaining arenas for Member States which try to defend their national interests. While the Environment Council has dealt with climate issues since the 1980s, the European Council has focused more regularly on climate policy issues only after they had become politically salient ‘high politics’ issues. Since about 2007, the European Council has become more active in EU and international climate policy, with notable peaks of activity in 2007-2009 and 2014-2015, associated with the 2009 Copenhagen UN climate conference (COP15) and the 2015 Paris UN climate conference respectively as well as in the run up to the 2021 Glasgow UN climate conference. Although the European Council is meant to define only the general political directions and priorities for the EU, in recent years it has issued sometimes fairly detailed instructions to the Council (and the Commission) to act on a particular climate policy issue. The Environment Council focuses on EU climate dossiers while renewable energy and energy efficiency are usually dealt with by the Transport, Telecommunications and Energy Council. Council meetings constitute only the tip of the iceberg of the Council machinery. They are prepared by Coreper and Council Working Groups which try to achieve as much consensus as possible on dossiers before they are placed on the agenda of Council meetings. The Council’s Working Party on International Environment Issues has been of central importance for the preparation of international climate conferences where the EU is formally represented by the rotating Presidency. Since 2004, a semi-permanent structure with issue leaders and lead negotiators has been in place and has led to an informal division of labour between the Presidency, Commission and Member States. The Council’s internal structures and administrative capacities to deal with EU and international climate issues have changed considerably over the years. This seems to confirm Helen Wallace’s (2003) assessment that the Council is an ‘institutional chameleon’. Over time there have also been significant changes in the relationships between Member States on EU climate issues, with different alliances emerging inside and outside the European Council and Council. Member States have frequently disagreed about the level of ambition for EU climate policies. The widely accepted informal convention that permanent or quasi permanent alliances between groups of Member States should not be formed within the European Council and/or the Council was repeatedly challenged by the Visegrad countries during the 2010s. This challenge, in conjunction with the decline of the relevance of the green trio/sextet, triggered the setting up of the Green Growth Group, both of which have however purposefully remained ad hoc alliances

System Effects in Identifying Risk-Optimal Data Requirements for Digital Twins of Structures

Structural Health Monitoring (SHM) technologies offer much promise to the risk management of the built environment, and they are therefore an active area of research. However, information regarding material properties, such as toughness and strength is instead measured in destructive lab tests. Similarly, the presence of geometrical anomalies is more commonly detected and sized by inspection. Therefore, a risk-optimal combination should be sought, acknowledging that different scenarios will be associated with different data requirements. Value of Information (VoI) analysis is an established statistical framework for quantifying the expected benefit of a prospective data collection activity. In this paper the expected value of various combinations of inspection, SHM and testing are quantified, in the context of supporting risk management of a location of stress concentration in a railway bridge. The Julia code for this analysis (probabilistic models and influence diagrams) is made available. The system-level results differ from a simple linear sum of marginal VoI estimates, i.e. the expected value of collecting data from SHM and inspection together is not equal to the expected value of SHM data plus the expected value of inspection data. In summary, system-level decision making, requires system-level models

Planar Drawings of Fixed-Mobile Bigraphs

A fixed-mobile bigraph G is a bipartite graph such that the vertices of one partition set are given with fixed positions in the plane and the mobile vertices of the other part, together with the edges, must be added to the drawing. We assume that G is planar and study the problem of finding, for a given k >= 0, a planar poly-line drawing of G with at most k bends per edge. In the most general case, we show NP-hardness. For k=0 and under additional constraints on the positions of the fixed or mobile vertices, we either prove that the problem is polynomial-time solvable or prove that it belongs to NP. Finally, we present a polynomial-time testing algorithm for a certain type of "layered" 1-bend drawings

A Coloring Algorithm for Disambiguating Graph and Map Drawings

Drawings of non-planar graphs always result in edge crossings. When there are many edges crossing at small angles, it is often difficult to follow these edges, because of the multiple visual paths resulted from the crossings that slow down eye movements. In this paper we propose an algorithm that disambiguates the edges with automatic selection of distinctive colors. Our proposed algorithm computes a near optimal color assignment of a dual collision graph, using a novel branch-and-bound procedure applied to a space decomposition of the color gamut. We give examples demonstrating the effectiveness of this approach in clarifying drawings of real world graphs and maps

An In-Depth Analysis of the Slingshot Interconnect

The interconnect is one of the most critical components in large scale computing systems, and its impact on the performance of applications is going to increase with the system size. In this paper, we will describe Slingshot, an interconnection network for large scale computing systems. Slingshot is based on high-radix switches, which allow building exascale and hyperscale datacenters networks with at most three switch-to-switch hops. Moreover, Slingshot provides efficient adaptive routing and congestion control algorithms, and highly tunable traffic classes. Slingshot uses an optimized Ethernet protocol, which allows it to be interoperable with standard Ethernet devices while providing high performance to HPC applications. We analyze the extent to which Slingshot provides these features, evaluating it on microbenchmarks and on several applications from the datacenter and AI worlds, as well as on HPC applications. We find that applications running on Slingshot are less affected by congestion compared to previous generation networks.Comment: To be published in Proceedings of The International Conference for High Performance Computing Networking, Storage, and Analysis (SC '20) (2020

An Oort cloud origin for the high-inclination, high-perihelion Centaurs

We analyse the origin of three Centaurs with perihelia in the range 15 AU to 30 AU, inclinations above 70 deg and semi-major axes shorter than 100 AU. Based on long-term numerical simulations we conclude that these objects most likely originate from the Oort cloud rather than the Kuiper Belt or Scattered Disc. We estimate that there are currently between 1 and 200 of these high-inclination, high-perihelion Centaurs with absolute magnitude H<8.Comment: Accepted for publication in MNRA

Cylindrical fractional Brownian motion in Banach spaces

In this article we introduce cylindrical fractional Brownian motions in Banach spaces and develop the related stochastic integration theory. Here a cylindrical fractional Brownian motion is understood in the classical framework of cylindrical random variables and cylindrical measures. The developed stochastic integral for deterministic operator valued integrands is based on a series representation of the cylindrical fractional Brownian motion, which is analogous to the Karhunen-Loève expansion for genuine stochastic processes. In the last part we apply our results to study the abstract stochastic Cauchy problem in a Banach space driven by cylindrical fractional Brownian motion

An unquenched lattice QCD calculation of the mass of the bottom quark

We compute the b quark mass from dynamical lattice QCD with clover quarks. The calculation is done at a fixed lattice spacing with sea quark masses as low as half the strange quark mass. Our final result is m_b(m_b} = 4.25(2)(11) GeV, where the first error is statistical and the last error is the systematic uncertainty.Comment: 10 page

On Smooth Orthogonal and Octilinear Drawings: Relations, Complexity and Kandinsky Drawings

We study two variants of the well-known orthogonal drawing model: (i) the smooth orthogonal, and (ii) the octilinear. Both models form an extension of the orthogonal, by supporting one additional type of edge segments (circular arcs and diagonal segments, respectively). For planar graphs of max-degree 4, we analyze relationships between the graph classes that can be drawn bendless in the two models and we also prove NP-hardness for a restricted version of the bendless drawing problem for both models. For planar graphs of higher degree, we present an algorithm that produces bi-monotone smooth orthogonal drawings with at most two segments per edge, which also guarantees a linear number of edges with exactly one segment.Comment: Appears in the Proceedings of the 25th International Symposium on Graph Drawing and Network Visualization (GD 2017