- GSI Helmholtz Centre for Heavy Ion ResearchDE1k papers
- Centre National de la Recherche ScientifiqueFR363 papers
- ExtreMe Matter Institute EMMIDE361 papers
- Heidelberg UniversityDE283 papers
- Goethe University FrankfurtDE260 papers
- Michigan State UniversityUS258 papers
- Joint Institute for Nuclear ResearchRU238 papers
- Max Planck Institute for Nuclear PhysicsDE227 papers
- Commissariat à l'Énergie Atomique et aux Énergies AlternativesFR222 papers
- European Organization for Nuclear ResearchCH212 papers
- Institut National de Physique Nucléaire et de Physique des ParticulesFR211 papers
- Lawrence Berkeley National LaboratoryUS211 papers
4,680 papers
A detailed view at magnetic dipole strengths: The case of semi-magic Ti
B. Kelly, M. Spieker, U. Friman-Gayer +14
Magnetic dipole, , strengths were studied in semi-magic Ti up to the neutron-separation threshold by combining data from one-neutron transfer, real-phot…
Magnetic Dipole Hyperfine Constants of 15 Energy Levels in Tm II Determined by Collinear Laser Fluorescence Spectroscopy
Hendrik Bodnar, Kristian König, Wilfried Nörtershäuser
We present measurements of the hyperfine structure, transition frequencies and relative intensities in 14 lines of 169Tm+ ions starting from the $4f^{13}({}^2\!F^o_{7/2})6s_{1/2} (…
The PIONEER Project: A PrIvacy companion for mOtivatioN and knowlEdge transfER
Simon Althaus, Nina Gerber, Sara Hahn +5
Remaining control over their private data is one of the key challenges in this century for users. We know from prior work that users are often neither in a position to fully grasp…
Dynamic Tree Colors: Adaptive Discriminable Hierarchies with Minimum Instability
Tobias Mertz, Steven Lamarr Reynolds, Jörn Kohlhammer
Hierarchical color maps can support users in the analysis of hierarchical data. For large hierarchies, dynamic color maps can improve discriminability upon user interactions, but t…
Online and Incremental Fractional Vertex Cover on Trees
Júlia Baligács, Bartłomiej Bosek, Yann Disser +5
In this paper we study the fractional vertex cover problem on trees in two related models: online and incremental. In the online model, the vertices of the tree are known a priori…
ShardMeter: Sharded and Geo-Distributed Training Without the Guesswork
Tim Beringer, Patrick Diem, Felix Wolf +1
Training large-scale AI models often outgrows a single data center, demanding sharded, multi-cluster, and decentralized training. However, the huge space of resource allocations ma…