Searcharxiv⌕ Search

arXiv subjects

J. Hoffmann

Publications and source records attributed to J. Hoffmann.

At least 19 recordsLinked to original sources
arXiv2025

Estimation of intrinsic fast radio burst width and scattering distributions from CRAFT data

The intrinsic width and scattering distributions of fast radio bursts (FRBs) inform on their emission mechanism and local environment, and act as a source of detection bias and, hence, an obfuscating factor when performing FRB population and cosmological studies. Here, we utilise a sample of 29 FRBs with measured high-time-resolution properties and known redshift, which were detected using the Australian Square Kilometre Array Pathfinder (ASKAP) by the Commensal Real-time ASKAP Fast Transients Survey (CRAFT), to model these distributions. Using this sample, we estimate the completeness bias of intrinsic width and scattering measurements, and fit the underlying, de-biased distributions in the host rest-frame. In no case do our model fits prefer a down-turn at high values of the intrinsic distributions of either parameter in the 0.01-40 ms range probed by the data. Rather, when assuming a spectral scattering index of $\alpha = -4$, we find that the intrinsic scattering distribution at 1\,GHz is consistent with a log-uniform distribution above 0.04 ms, and that this functional form is strongly favoured over the lognormal descriptions used by previous works. We also find that the intrinsic width distribution rises as a Gaussian in log-space in the 0.03-0.3 ms range, with a log-uniform distribution above that slightly preferred to a lognormal distribution. This confirms previous works suggesting that FRB observations are currently strongly width- and scattering-limited, and we encourage FRB searches to be extended to higher values of time-width. It also implies a bias in FRB host galaxy studies, although the form of that bias is uncertain. Finally, we find that our updated width and scattering models - when implemented in the zDM code - produce $\sim$10% more FRBs at redshift z=1 than at z=0 when compared to alternative width/scattering models.

astro-ph.HE↗
arXiv2025

Elementary Steps of Energy Conversion in Strongly Correlated Systems: Beyond Single Quasiparticles and Rigid Bands

Energy conversion in materials can be considered as a sequence of elementary steps initiated by a primary excitation. While these steps are quite well understood in classical semiconductors in terms of quasiparticle (QP) excitations and interactions, their understanding in strongly correlated materials is still elusive. Here, we review the progress which has been achieved over recent years by studies of manganite perovskite oxides as a model system for materials with strong correlations. They show a subtle interplay of different types of correlations, i.e., electron-phonon, electron-electron and spin-spin, resulting in rich physical phenomena due to competition between different ground states accompanied by temperature- and field-induced phase transitions. They strongly impact various types of energy conversion and transport processes including friction at surfaces, thermal transport, time-, energy- and power-dependent optical excitations as well as photovoltaic energy conversion. The underlying microscopic processes can be broken down to the behavior of the low-energy thermal and high-energy optical excitations, their interactions, transport and conversion which are theoretically analyzed by using models of interacting and tunable QPs: Their nature and interactions can change during excitation, transport and phase transitions, thus modifying electronic structure. At sufficiently high stimulation, QP excitations can even induce or actuate phase transitions. As a result, we obtained a comprehensive understanding of energy conversion steps going far beyond single QP pictures and rigid band approximations well-known for conventional semiconductors.

cond-mat.str-el↗
arXiv2022

AT2019azh: an unusually long-lived, radio-bright thermal tidal disruption event

Tidal disruption events (TDEs) occur when a star is destroyed by a supermassive black hole at the center of a galaxy, temporarily increasing the accretion rate onto the black hole and producing a bright flare across the electromagnetic spectrum. Radio observations of TDEs trace outflows and jets that may be produced. Radio detections of the outflows from TDEs are uncommon, with only about one third of TDEs discovered to date having published radio detections. Here we present over two years of comprehensive, multi-radio frequency monitoring observations of the tidal disruption event AT2019azh taken with the Very Large Array (VLA) and MeerKAT radio telescopes from approximately 10 days pre-optical peak to 810 days post-optical peak. AT2019azh shows unusual radio emission for a thermal TDE, as it brightened very slowly over two years, and showed fluctuations in the synchrotron energy index of the optically thin synchrotron emission from 450 days post-disruption. Based on the radio properties, we deduce that the outflow in this event is likely non-relativistic and could be explained by a spherical outflow arising from self-stream intersections, or a mildly collimated outflow from accretion onto the supermassive black hole. This data-set provides a significant contribution to the observational database of outflows from TDEs, including the earliest radio detection of a non-relativistic TDE to date, relative to the optical discovery.

astro-ph.HE↗
arXiv2020

Orbital order phase transition in $Pr_{1-x}Ca_xMnO_3$ probed by photovoltaics

The phase diagram of $Pr_{1-x}Ca_xMnO_3$ is modified x $\le$ 0.3, which suggests a reevaluation of the phase diagram of other manganites in that doping region. Rather than an orbital ordered phase reaching up to high temperatures of approximately 800-1100 K, we propose a loss of spontaneous orbital order already near room temperature. Above this temperature, the phase is characterized by a finite orbital polarization and octahedral tilt pattern. The tilt pattern couples to the Jahn-Teller distortion and thus induces a remaining orbital order, which persists up to high temperatures, where the tilt order is lost as well. This explains the experimental observation of orbital order up to high temperatures. The reevaluation of the orbital order transition is based on observed anomalies of various physical properties at a temperatures of 220-260 K in epitaxial thin films of $Pr_{1-x}Ca_xMnO_3$ x=0.1, i.e.in the photovoltaic effect, electric transport, magnetization, optical and ultrafast transient pump probe studies. Finite-temperature simulations based on a tight-binding model with carefully adjusted parameters from first-principles calculations exhibit an orbital order phase transition at $T_{OO} \approx$ 300 K for x=0.1. This is consistent with the experimental observation of a temperature dependent change in lattice parameter for bulk samples of the same doping at 300 K for x=0.1 and 350 K for x=0, typical for a second order phase transition. Since our reassignment of the orbital order phase transition towards lower temperatures challenges a well-established and long-accepted picture, we provide results of multiple complementary measurements as well as a detailed discussion.

cond-mat.str-el↗
arXiv2017

Twin GEM-TPC Prototype (HGB4) Beam Test at GSI and Jyväskylä - a Development for the Super-FRS at FAIR

The FAIR[1] facility is an international accelerator centre for research with ion and antiproton beams. It is being built at Darmstadt, Germany as an extension to the current GSI research institute. One major part of the facility will be the Super-FRS[2] separator, which will be include in phase one of the project construction. The NUSTAR experiments will benefit from the Super-FRS, which will deliver an unprecedented range of radioactive ion beams (RIB). These experiments will use beams of different energies and characteristics in three different branches; the high-energy which utilizes the RIB at relativistic energies 300-1500 MeV/u as created in the production process, the low-energy branch aims to use beams in the range of 0-150 MeV/u whereas the ring branch will cool and store beams in the NESR ring. The main tasks for the Super-FRS beam diagnostics chambers will be for the set up and adjustment of the separator as well as to provide tracking and event-by-event particle identification. The Helsinki Institute of Physics, and the Detector Laboratory and Experimental Electronics at GSI are in a joint R&D of a GEM-TPC detector which could satisfy the requirements of such tracking detectors, in terms of tracking efficiency, space resolution, count rate capability and momenta resolution. The current prototype, which is the generation four of this type, is two GEM-TPCs in twin configuration inside the same vessel. This means that one of the GEM-TPC is flipped on the middle plane w.r.t. the other one. This chamber was tested at Jyväskylä accelerator with protons projectiles and at GSI with Uranium, fragments and Carbon beams during this year 2016.

physics.ins-det↗
arXiv2016

Super-FRS GEM-TPC Prototype Development Based on n-Xyter Asic for the FAIR Facility

The FAIR facility is an international accelerator centre for research with ion and antiproton beams. It is being built at Darmstadt, Germany as an extension to the current GSI research institute. One major part of the facility will be the Super-FRS separator, which will be include in phase one of the project construction. The NUSTAR experiments will benefit from the Super-FRS, which will deliver an unprecedented range of radioactive ion beams (RIB). These experiments will use beams of different energies and characteristics in three different branches; the high-energy which utilizes the RIB at relativistic energies 300-1500 MeV /u as created in the production process, the low energy branch aims to use beams in the range of 0-150 MeV/u whereas the ring branch will cool and store beams in the NESR ring. The main tasks for the Super-FRS beam diagnostics chambers will be for the set up and adjustment of the separator as well as to provide tracking and event-by-event particle identification. The Helsinki Institute of Physics, the Comenius University, and the Detector Laboratory and Experimental electronics at GSI are in a joint R&D phase of a GEM-TPC detector which could satisfy the requirements of such diagnostics and tracking chambers in terms of tracking efficiency, space resolution, count rate capability and momenta resolution. The current status of the first prototype and the preliminary results from the test beam campaign S417 using the n-Xyter chips mounted on GEMEX cards will be shown.

physics.ins-det↗
arXiv2014

Reconnaissance of the HR 8799 Exosolar System II: Astrometry and Orbital Motion

We present an analysis of the orbital motion of the four sub-stellar objects orbiting HR8799. Our study relies on the published astrometric history of this system augmented with an epoch obtained with the Project 1640 coronagraph + Integral Field Spectrograph (IFS) installed at the Palomar Hale telescope. We first focus on the intricacies associated with astrometric estimation using the combination of an Extreme Adaptive Optics system (PALM-3000), a coronagraph and an IFS. We introduce two new algorithms. The first one retrieves the stellar focal plane position when the star is occulted by a coronagraphic stop. The second one yields precise astrometric and spectro-photometric estimates of faint point sources even when they are initially buried in the speckle noise. The second part of our paper is devoted to studying orbital motion in this system. In order to complement the orbital architectures discussed in the literature, we determine an ensemble of likely Keplerian orbits for HR8799bcde, using a Bayesian analysis with maximally vague priors regarding the overall configuration of the system. While the astrometric history is currently too scarce to formally rule out coplanarity, HR8799d appears to be misaligned with respect to the most likely planes of HR8799bce orbits. This misalignment is sufficient to question the strictly coplanar assumption made by various authors when identifying a Laplace resonance as a potential architecture. Finally, we establish a high likelihood that HR8799de have dynamical masses below 13 M_Jup using a loose dynamical survival argument based on geometric close encounters. We illustrate how future dynamical analyses will further constrain dynamical masses in the entire system.

astro-ph.SR↗
arXiv2013

Hypernuclear spectroscopy of products from 6Li projectiles on a carbon target at 2 AGeV

A novel experiment, aiming at demonstrating the feasibility of hypernuclear spectroscopy with heavy-ion beams, was conducted. Using the invariant mass method, the spectroscopy of hypernuclear products of 6Li projectiles on a carbon target at 2 AGeV was performed. Signals of the Λ-hyperon and 3ΛH and 4ΛH hypernuclei were observed for final states of p+π^-, 3He+π^- and 4He+π^-, respectively, with significance values of 6.7, 4.7 and 4.9σ. By analyzing the proper decay time from secondary vertex distribution with the unbinned maximum likelihood fitting method, their lifetime values were deduced to be $262 ^{+56}_{-43} \pm 45$ ps for Λ, $183 ^{+42}_{-32} \pm 37$ ps for 3ΛH, and $140 ^{+48}_{-33}\pm 35 $ ps for 4ΛH.

nucl-ex↗
arXiv2011

Probabilistic Planning via Heuristic Forward Search and Weighted Model Counting

We present a new algorithm for probabilistic planning with no observability. Our algorithm, called Probabilistic-FF, extends the heuristic forward-search machinery of Conformant-FF to problems with probabilistic uncertainty about both the initial state and action effects. Specifically, Probabilistic-FF combines Conformant-FFs techniques with a powerful machinery for weighted model counting in (weighted) CNFs, serving to elegantly define both the search space and the heuristic function. Our evaluation of Probabilistic-FF shows its fine scalability in a range of probabilistic domains, constituting a several orders of magnitude improvement over previous results in this area. We use a problematic case to point out the main open issue to be addressed by further research.

cs.AI↗
arXiv2011

Engineering Benchmarks for Planning: the Domains Used in the Deterministic Part of IPC-4

In a field of research about general reasoning mechanisms, it is essential to have appropriate benchmarks. Ideally, the benchmarks should reflect possible applications of the developed technology. In AI Planning, researchers more and more tend to draw their testing examples from the benchmark collections used in the International Planning Competition (IPC). In the organization of (the deterministic part of) the fourth IPC, IPC-4, the authors therefore invested significant effort to create a useful set of benchmarks. They come from five different (potential) real-world applications of planning: airport ground traffic control, oil derivative transportation in pipeline networks, model-checking safety properties, power supply restoration, and UMTS call setup. Adapting and preparing such an application for use as a benchmark in the IPC involves, at the time, inevitable (often drastic) simplifications, as well as careful choice between, and engineering of, domain encodings. For the first time in the IPC, we used compilations to formulate complex domain features in simple languages such as STRIPS, rather than just dropping the more interesting problem constraints in the simpler language subsets. The article explains and discusses the five application domains and their adaptation to form the PDDL test suites used in IPC-4. We summarize known theoretical results on structural properties of the domains, regarding their computational complexity and provable properties of their topology under the h+ function (an idealized version of the relaxed plan heuristic). We present new (empirical) results illuminating properties such as the quality of the most wide-spread heuristic functions (planning graph, serial planning graph, and relaxed plan), the growth of propositional representations over instance size, and the number of actions available to achieve each fact; we discuss these data in conjunction with the best results achieved by the different kinds of planners participating in IPC-4.

cs.AI↗
arXiv2011

The Deterministic Part of IPC-4: An Overview

We provide an overview of the organization and results of the deterministic part of the 4th International Planning Competition, i.e., of the part concerned with evaluating systems doing deterministic planning. IPC-4 attracted even more competing systems than its already large predecessors, and the competition event was revised in several important respects. After giving an introduction to the IPC, we briefly explain the main differences between the deterministic part of IPC-4 and its predecessors. We then introduce formally the language used, called PDDL2.2 that extends PDDL2.1 by derived predicates and timed initial literals. We list the competing systems and overview the results of the competition. The entire set of data is far too large to be presented in full. We provide a detailed summary; the complete data is available in an online appendix. We explain how we awarded the competition prizes.

cs.AI↗
arXiv2011

Where 'Ignoring Delete Lists' Works: Local Search Topology in Planning Benchmarks

Between 1998 and 2004, the planning community has seen vast progress in terms of the sizes of benchmark examples that domain-independent planners can tackle successfully. The key technique behind this progress is the use of heuristic functions based on relaxing the planning task at hand, where the relaxation is to assume that all delete lists are empty. The unprecedented success of such methods, in many commonly used benchmark examples, calls for an understanding of what classes of domains these methods are well suited for. In the investigation at hand, we derive a formal background to such an understanding. We perform a case study covering a range of 30 commonly used STRIPS and ADL benchmark domains, including all examples used in the first four international planning competitions. We *prove* connections between domain structure and local search topology -- heuristic cost surface properties -- under an idealized version of the heuristic functions used in modern planners. The idealized heuristic function is called h^+, and differs from the practically used functions in that it returns the length of an *optimal* relaxed plan, which is NP-hard to compute. We identify several key characteristics of the topology under h^+, concerning the existence/non-existence of unrecognized dead ends, as well as the existence/non-existence of constant upper bounds on the difficulty of escaping local minima and benches. These distinctions divide the (set of all) planning domains into a taxonomy of classes of varying h^+ topology. As it turns out, many of the 30 investigated domains lie in classes with a relatively easy topology. Most particularly, 12 of the domains lie in classes where FFs search algorithm, provided with h^+, is a polynomial solving mechanism. We also present results relating h^+ to its approximation as implemented in FF. The behavior regarding dead ends is provably the same. We summarize the results of an empirical investigation showing that, in many domains, the topological qualities of h^+ are largely inherited by the approximation. The overall investigation gives a rare example of a successful analysis of the connections between typical-case problem structure, and search performance. The theoretical investigation also gives hints on how the topological phenomena might be automatically recognizable by domain analysis techniques. We outline some preliminary steps we made into that direction.

cs.AI↗
arXiv2011

Ordered Landmarks in Planning

Many known planning tasks have inherent constraints concerning the best order in which to achieve the goals. A number of research efforts have been made to detect such constraints and to use them for guiding search, in the hope of speeding up the planning process. We go beyond the previous approaches by considering ordering constraints not only over the (top-level) goals, but also over the sub-goals that will necessarily arise during planning. Landmarks are facts that must be true at some point in every valid solution plan. We extend Koehler and Hoffmann's definition of reasonable orders between top level goals to the more general case of landmarks. We show how landmarks can be found, how their reasonable orders can be approximated, and how this information can be used to decompose a given planning task into several smaller sub-tasks. Our methodology is completely domain- and planner-independent. The implementation demonstrates that the approach can yield significant runtime performance improvements when used as a control loop around state-of-the-art sub-optimal planning systems, as exemplified by FF and LPG.

cs.AI↗
arXiv2011

The Metric-FF Planning System: Translating "Ignoring Delete Lists" to Numeric State Variables

Planning with numeric state variables has been a challenge for many years, and was a part of the 3rd International Planning Competition (IPC-3). Currently one of the most popular and successful algorithmic techniques in STRIPS planning is to guide search by a heuristic function, where the heuristic is based on relaxing the planning task by ignoring the delete lists of the available actions. We present a natural extension of ``ignoring delete lists'' to numeric state variables, preserving the relevant theoretical properties of the STRIPS relaxation under the condition that the numeric task at hand is ``monotonic''. We then identify a subset of the numeric IPC-3 competition language, ``linear tasks'', where monotonicity can be achieved by pre-processing. Based on that, we extend the algorithms used in the heuristic planning system FF to linear tasks. The resulting system Metric-FF is, according to the IPC-3 results which we discuss, one of the two currently most efficient numeric planners.

cs.AI↗
arXiv2011

The FF Planning System: Fast Plan Generation Through Heuristic Search

We describe and evaluate the algorithmic techniques that are used in the FF planning system. Like the HSP system, FF relies on forward state space search, using a heuristic that estimates goal distances by ignoring delete lists. Unlike HSP's heuristic, our method does not assume facts to be independent. We introduce a novel search strategy that combines hill-climbing with systematic search, and we show how other powerful heuristic information can be extracted and used to prune the search space. FF was the most successful automatic planner at the recent AIPS-2000 planning competition. We review the results of the competition, give data for other benchmark domains, and investigate the reasons for the runtime performance of FF compared to HSP.

cs.AI↗
arXiv2011

On Reasonable and Forced Goal Orderings and their Use in an Agenda-Driven Planning Algorithm

The paper addresses the problem of computing goal orderings, which is one of the longstanding issues in AI planning. It makes two new contributions. First, it formally defines and discusses two different goal orderings, which are called the reasonable and the forced ordering. Both orderings are defined for simple STRIPS operators as well as for more complex ADL operators supporting negation and conditional effects. The complexity of these orderings is investigated and their practical relevance is discussed. Secondly, two different methods to compute reasonable goal orderings are developed. One of them is based on planning graphs, while the other investigates the set of actions directly. Finally, it is shown how the ordering relations, which have been derived for a given set of goals G, can be used to compute a so-called goal agenda that divides G into an ordered set of subgoals. Any planner can then, in principle, use the goal agenda to plan for increasing sets of subgoals. This can lead to an exponential complexity reduction, as the solution to a complex planning problem is found by solving easier subproblems. Since only a polynomial overhead is caused by the goal agenda computation, a potential exists to dramatically speed up planning algorithms as we demonstrate in the empirical evaluation, where we use this method in the IPP planner.

cs.AI↗
arXiv2011

A Large-Scale FPGA-Based Trigger and Dead-Time Free DAQ System for the Kaos Spectrometer at MAMI

The Kaos spectrometer is maintained by the A1 collaboration at the Mainz Microtron MAMI with a focus on the study of (e,e'K^+) coincidence reactions. For its electron-arm two vertical planes of fiber arrays, each comprising approximately 10 000 fibers, are operated close to zero degree scattering angle and in close proximity to the electron beam. A nearly dead-time free DAQ system to acquire timing and tracking information has been installed for this spectrometer arm. The signals of 144 multi-anode photomultipliers are collected by 96-channel front-end boards, digitized by double-threshold discriminators and the signal time is picked up by state-of-the-art F1 time-to-digital converter chips. In order to minimize background rates a sophisticated trigger logic was implemented in newly developed Vuprom modules. The trigger performs noise suppression, signal cluster finding, particle tracking, and coincidence timing, and can be expanded for kinematical matching (e'K^+) coincidences. The full system was designed to process more than 4 000 read-out channels and to cope with the high electron flux in the spectrometer and the high count rate requirement of the detectors. It was successfully in-beam tested at MAMI in 2009.

physics.ins-det↗