A5004281203- Complexity and Algorithms in Graphs
- Cryptography and Data Security
- Railway Engineering and Dynamics
- Mechanical stress and fatigue analysis
- Privacy-Preserving Technologies in Data
- semigroups and automata theory
- Geotechnical Engineering and Underground Structures
- Machine Learning and Algorithms
- Transport and Logistics Innovations
- Advanced Graph Theory Research
- Optimization and Search Problems
- Railway Systems and Energy Efficiency
- Computational Geometry and Mesh Generation
Eindhoven University of Technology
2019-2022
KTH Royal Institute of Technology
2014
Wheel reprofiling costs for freight vehicles are a major issue in Sweden, reducing the profitability of traffic operations and therefore hindering modal shift needed achieving reduced emissions. In order to understand damage modes vehicles, uniform wear prediction with Archard's law has been studied two-axle timber transport wagon, simulation results have compared measurements. Challenges wheel wagons discussed, including influence block brakes switches crossings. The latter on profile...
Abstract The main idea behind lattice sieving algorithms is to reduce a sufficiently large number of vectors with each other so that set short enough obtained. It therefore natural study which cannot be reduced. In this work we give concrete definition an irreducible vector and the properties all such vectors. We show subset Voronoi relevant its properties. For extremal lattices may contain as many $$2^n$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:msup>...