SwePub
Sök i SwePub databas

  Utökad sökning

Träfflista för sökning "WFRF:(Moulton Vincent) srt2:(2020-2023)"

Sökning: WFRF:(Moulton Vincent) > (2020-2023)

  • Resultat 1-3 av 3
Sortera/gruppera träfflistan
   
NumreringReferensOmslagsbildHitta
1.
  • Mock, Thomas, et al. (författare)
  • Multiomics in the central Arctic Ocean for benchmarking biodiversity change
  • 2022
  • Ingår i: PLoS biology. - : Public Library of Science (PLoS). - 1544-9173 .- 1545-7885. ; 20:10
  • Tidskriftsartikel (refereegranskat)abstract
    • Multiomics approaches need to be applied in the central Arctic Ocean to benchmark biodiversity change and to identify novel species and their genes. As part of MOSAiC, EcoOmics will therefore be essential for conservation and sustainable bioprospecting in one of the least explored ecosystems on Earth.
  •  
2.
  • Reimerdes, H., et al. (författare)
  • Overview of the TCV tokamak experimental programme
  • 2022
  • Ingår i: Nuclear Fusion. - : IOP Publishing. - 1741-4326 .- 0029-5515. ; 62:4
  • Tidskriftsartikel (refereegranskat)abstract
    • The tokamak a configuration variable (TCV) continues to leverage its unique shaping capabilities, flexible heating systems and modern control system to address critical issues in preparation for ITER and a fusion power plant. For the 2019-20 campaign its configurational flexibility has been enhanced with the installation of removable divertor gas baffles, its diagnostic capabilities with an extensive set of upgrades and its heating systems with new dual frequency gyrotrons. The gas baffles reduce coupling between the divertor and the main chamber and allow for detailed investigations on the role of fuelling in general and, together with upgraded boundary diagnostics, test divertor and edge models in particular. The increased heating capabilities broaden the operational regime to include T (e)/T (i) similar to 1 and have stimulated refocussing studies from L-mode to H-mode across a range of research topics. ITER baseline parameters were reached in type-I ELMy H-modes and alternative regimes with 'small' (or no) ELMs explored. Most prominently, negative triangularity was investigated in detail and confirmed as an attractive scenario with H-mode level core confinement but an L-mode edge. Emphasis was also placed on control, where an increased number of observers, actuators and control solutions became available and are now integrated into a generic control framework as will be needed in future devices. The quantity and quality of results of the 2019-20 TCV campaign are a testament to its successful integration within the European research effort alongside a vibrant domestic programme and international collaborations.
  •  
3.
  • Seemann, Carsten R., et al. (författare)
  • Planar median graphs and cubesquare-graphs
  • 2023
  • Ingår i: Discrete Applied Mathematics. - : Elsevier BV. - 0166-218X .- 1872-6771. ; 331, s. 38-58
  • Tidskriftsartikel (refereegranskat)abstract
    • Median graphs are connected graphs in which for all three vertices there is a unique vertex that belongs to shortest paths between each pair of these three vertices. In this paper we provide several novel characterizations of planar median graphs. More specifically, we characterize when a planar graph G is a median graph in terms of forbidden subgraphs and the structure of isometric cycles in G, and also in terms of subgraphs of G that are contained inside and outside of 4-cycles with respect to an arbitrary planar embedding of G. These results lead us to a new characterization of planar median graphs in terms of cubesquare-graphs that is, graphs that can be obtained by starting with cubes and square-graphs, and iteratively replacing 4-cycle boundaries (relative to some embedding) by cubes or square-graphs. As a corollary we also show that a graph is planar median if and only if it can be obtained from cubes and square -graphs by a sequence of square-boundaryamalgamations. These considerations also lead to an O(n log n)-time recognition algorithm to compute a decomposition of a planar median graph with n vertices into cubes and square-graphs. 
  •  
Skapa referenser, mejla, bekava och länka
  • Resultat 1-3 av 3

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy