Search

Energetic charged particles generated by inertial confinement fusion (ICF) implosions encode information about the spatial morphology of the hot-spot and dense fuel during the time of peak fusion reactions. The knock-on deuteron imager (KoDI) was developed at the Omega Laser Facility to image these particles in order to diagnose low-mode asymmetries in the hot-spot and dense fuel layer of cryogenic deuterium--tritium ICF implosions. However, the images collected are distorted in several ways that prevent reconstruction of the deuteron source. In this paper we describe these distortions and a series of attempts to mitigate or compensate for them. We present several potential mechanisms for the distortions, including a new model for scattering of charged particles in filamentary electric or magnetic fields surrounding the implosion. A novel particle-tracing methodology is developed and utilized to create synthetic KoDI data based on the filamentary field model that reproduces the main experimentally observed image distortions. We conclude with a discussion of the outlook for KoDI, and potential considerations for other charged-particle diagnostics.

Halin proved that every graph with an end $\omega$ containing infinitely many pairwise disjoint rays admits a subdivision of the infinite quarter-grid as a subgraph where all rays from that subgraph belong to $\omega$. We will prove a corresponding statement for digraphs, that is, we will prove that every digraph that has an end with infinitely many pairwise disjoint directed rays contains a subdivision of a grid-like digraph all of whose directed rays belong to that end., Comment: 20 pages

In this paper we define a degree for ends of infinite digraphs. The well-definedness of our definition in particular resolves a problem by Zuther. Furthermore, we extend our notion of end degree to also respect, among others, the vertices dominating the end, which we denote as combined end degree. Our main result is a characterisation of the combined end degree in terms of certain sequences of vertices, which we call end-exhausting sequences. This establishes a similar, although more complex relationship as known for the combined end degree and end-defining sequences in undirected graphs., Comment: 18 pages

Maps of dynamics are effective representations of motion patterns learned from prior observations, with recent research demonstrating their ability to enhance performance in various downstream tasks such as human-aware robot navigation, long-term human motion prediction, and robot localization. Current advancements have primarily concentrated on methods for learning maps of human flow in environments where the flow is static, i.e., not assumed to change over time. In this paper we propose a method to update the CLiFF-map, one type of map of dynamics, for achieving efficient life-long robot operation. As new observations are collected, our goal is to update a CLiFF-map to effectively and accurately integrate new observations, while retaining relevant historic motion patterns. The proposed online update method maintains a probabilistic representation in each observed location, updating parameters by continuously tracking sufficient statistics. In experiments using both synthetic and real-world datasets, we show that our method is able to maintain accurate representations of human motion dynamics, contributing to high performance flow-compliant planning downstream tasks, while being orders of magnitude faster than the comparable baselines.

Block-based programming environments like Scratch are widely used in introductory programming courses. They facilitate learning pivotal programming concepts by eliminating syntactical errors, but logical errors that break the desired program behaviour are nevertheless possible. Finding such errors requires testing, i.e., running the program and checking its behaviour. In many programming environments, this step can be automated by providing executable tests as code; in Scratch, testing can only be done manually by invoking events through user input and observing the rendered stage. While this is arguably sufficient for learners, the lack of automated testing may be inhibitive for teachers wishing to provide feedback on their students' solutions. In order to address this issue, we introduce a new category of blocks in Scratch that enables the creation of automated tests. With these blocks, students and teachers alike can create tests and receive feedback directly within the Scratch environment using familiar block-based programming logic. To facilitate the creation and to enable batch processing sets of student solutions, we extend the Scratch user interface with an accompanying test interface. We evaluated this testing framework with 28 teachers who created tests for a popular Scratch game and subsequently used these tests to assess and provide feedback on student implementations. An overall accuracy of 0.93 of teachers' tests compared to manually evaluating the functionality of 21 student solutions demonstrates that teachers are able to create and effectively use tests. A subsequent survey confirms that teachers consider the block-based test approach useful., Comment: To appear at the 24th Koli Calling International Conference on Computing Education Research

Predicting the results of soccer matches is of great interest. This is not only due to the popularity of the sport and the joy of private "betting rounds", but also due to the large sports betting market. Where previously expert knowledge and intuition were used, today there are models that analyze large amounts of data and make predictions based on them. In addition to Poisson models, approaches that belong to the machine learning (ML) category are increasingly being used. These include, for example, neural network or random forest models, which are compared in this article with each other as well as with Poisson models with regard to single-match prediction. In each case, the match results of a season are used as the data basis. The analysis is carried out for 5 European top leagues. A statistical analysis shows that the performance levels of the teams do not change systematically during a season. In order to characterize performance levels as accurately as possible, all match results, except from the match to be predicted, can be used as features with equal weighting. It can be seen that both, the exact choice of features and the choice of model, have only a minor influence on the prediction quality. Possible improvements in match prediction are discussed., Comment: 10 pages, 1 figure

This study investigates the electrochemical behavior and decomposition pathways of four monomers, namely PMC, PMC-OH, PeMC-OH, and DEO-EA, which are potential candidates for polymer electrolytes in solid-state batteries. Density functional theory calculations were employed to determine the oxidation and reduction potentials of these monomers near different ions (Li+, TFSI-, and LiTFSI) and their corresponding reorganization energies. The results reveal notable sensitivity of the monomers to reduction in a Li+ rich regime and to oxidation in a TFSI- rich regime. Additionally, the decomposition pathways of the monomers were investigated, focusing on the cleavage of CO bonds. The findings provide insights into the stability and reactivity of these monomers in various electrochemical environments.

Design features of social media platforms, such as infinite scroll, increase users' likelihood of experiencing normative dissociation -- a mental state of absorption that diminishes self-awareness and disrupts memory. This paper investigates how adding design frictions into the interface of a social media platform reduce mindless scrolling and user satisfaction. We conducted a study with 30 participants and compared their memory recognition of posts in two scenarios: one where participants had to react to each post to access further content and another using an infinite scroll design. Participants who used the design frictions interface exhibited significantly better content recall, although a majority of participants found the interface frustrating. We discuss design recommendations and scenarios where adding design frictions to social media platforms can be beneficial., Comment: 6 pages, 1 figure, Muc '24

Misinformation poses a threat to democracy and to people's health. Reliability criteria for news websites can help people identify misinformation. But despite their importance, there has been no empirically substantiated list of criteria for distinguishing reliable from unreliable news websites. We identify reliability criteria, describe how they are applied in practice, and compare them to prior work. Based on our analysis, we distinguish between manipulable and less manipulable criteria and compare politically diverse laypeople as end users and journalists as expert users. We discuss 11 widely recognized criteria, including the following 6 criteria that are difficult to manipulate: content, political alignment, authors, professional standards, what sources are used, and a website's reputation. Finally, we describe how technology may be able to support people in applying these criteria in practice to assess the reliability of websites., Comment: Published by ACM Transactions on Computer-Human Interaction, presented at CHI 2024

We present an extended framework for hybrid finite element approximations of self-adjoint, positive definite operators. It covers the cases of primal, mixed, and ultraweak formulations, both at the continuous and discrete levels, and gives rise to conforming discretizations. Our framework allows for flexible continuity restrictions across elements, and includes the extreme cases of conforming and discontinuous hybrid methods. We illustrate an application of the framework to the Kirchhoff-Love plate pending model and present three primal hybrid and two mixed hybrid methods, four of them with numerical examples. In particular, we present conforming frameworks for (in classical meaning) non-conforming elements of Morley, Zienkiewicz triangular, and Hellan-Herrmann-Johnson types.

Predictive planning is a key capability for robots to efficiently and safely navigate populated environments. Particularly in densely crowded scenes, with uncertain human motion predictions, predictive path planning, and control can become expensive to compute in real time due to the curse of dimensionality. With the goal of achieving pro-active and legible robot motion in shared environments, in this paper we present HuMAN-MPC, a computationally efficient algorithm for Human Motion Aware Navigation using fast embedded Model Predictive Control. The approach consists of a novel model predictive control (MPC) formulation that leverages a fast state-of-the-art optimization backend based on a sequential quadratic programming real-time iteration scheme while also providing feasibility monitoring. Our experiments, in simulation and on a fully integrated ROS-based platform, show that the approach achieves great scalability with fast computation times without penalizing path quality and efficiency of the resulting avoidance behavior., Comment: published in Long-Term Human Motion Prediction (LHMP) Workshop at International Conference on Robotics and Automation (ICRA) 2024

In this paper, we explore the optimization of metal recycling with a focus on real-time differentiation between alloys of copper and aluminium. Spectral data, obtained through Prompt Gamma Neutron Activation Analysis (PGNAA), is utilized for classification. The study compares data from two detectors, cerium bromide (CeBr$_{3}$) and high purity germanium (HPGe), considering their energy resolution and sensitivity. We test various data generation, preprocessing, and classification methods, with Maximum Likelihood Classifier (MLC) and Conditional Variational Autoencoder (CVAE) yielding the best results. The study also highlights the impact of different detector types on classification accuracy, with CeBr$_{3}$ excelling in short measurement times and HPGe performing better in longer durations. The findings suggest the importance of selecting the appropriate detector and methodology based on specific application requirements.

The hydrodynamics of thin films is typically described using phenomenological models whose connection to the microscopic particle dynamics is a subject of ongoing research. Existing methods based on density functional theory provide a good description of static thin films, but are not sufficient for understanding nonequilibrium dynamics. In this work, we present a microscopic derivation of the thin film equation using the Mori-Zwanzig projection operator formalism. This method allows to directly obtain the correct gradient dynamics structure along with microscopic expressions for the mobility and the free energy. Our results are verified against molecular dynamics simulations for both simple fluids and polymers., Comment: 14 pages, 4 figures

We investigate analogues of alternating sign matrices, called partial alternating sign matrices. We prove bijections between these matrices and several other combinatorial objects. We use an analogue of Wieland's gyration on fully-packed loops, which we relate to the study of toggles and order ideals. Finally, we show that rowmotion on order ideals of a certain poset and gyration on partial fully-packed loop configurations are in equivariant bijection., Comment: 20 pages, 20 figures

We define and study the $(\nu / \lambda)$-partial alternating sign matrix polytope, motivated by connections to the Chan-Robbins-Yuen polytope and the $\nu$-Tamari lattice. We determine the inequality description and show this polytope is a face of the partial alternating sign matrix polytope of [Heuer, Striker 2022]. We show that the $(\nu / \lambda)$-partial ASM polytope is an order polytope and a flow polytope., Comment: 14 pages, 8 figures

The trace-dev-div inequality in $H^s$ controls the trace in the norm of $H^s$ by that of the deviatoric part plus the $H^{s-1}$ norm of the divergence of a quadratic tensor field different from the constant unit matrix. This is well known for $s=0$ and established for orders $0\le s\le 1$ and arbitrary space dimension in this note. For mixed and least-squares finite element error analysis in linear elasticity, this inequality allows to establish robustness with respect to the Lam\'e parameter $\lambda$.

Exploiting physical processes for fast and energy-efficient computation bears great potential in the advancement of modern hardware components. This paper explores non-linear charge tunneling in nanoparticle networks, controlled by external voltages. The dynamics are described by a master equation, which describes the development of a distribution function over the set of charge occupation numbers. The driving force behind this evolution are charge tunneling events among nanoparticles and their associated rates. In this paper, we introduce two meanfield approximations to this master equation. By parametrization of the distribution function using its first- and second-order statistical moments, and a subsequent projection of the dynamics onto the resulting moment manifold, one can deterministically calculate expected charges and currents. Unlike a kinetic Monte Carlo approach, which extracts samples from the distribution function, this meanfield approach avoids any random elements. A comparison of results between the meanfield approximation and an already available kinetic Monte Carlo simulation demonstrates great accuracy. Our analysis also reveals that transitioning from a first-order to a second-order approximation significantly enhances the accuracy. Furthermore, we demonstrate the applicability of our approach to time-dependent simulations, using eulerian time-integration schemes.

We show a projective Beth definability theorem for logic programs under the stable model semantics: For given programs $P$ and $Q$ and vocabulary $V$ (set of predicates) the existence of a program $R$ in $V$ such that $P \cup R$ and $P \cup Q$ are strongly equivalent can be expressed as a first-order entailment. Moreover, our result is effective: A program $R$ can be constructed from a Craig interpolant for this entailment, using a known first-order encoding for testing strong equivalence, which we apply in reverse to extract programs from formulas. As a further perspective, this allows transforming logic programs via transforming their first-order encodings. In a prototypical implementation, the Craig interpolation is performed by first-order provers based on clausal tableaux or resolution calculi. Our work shows how definability and interpolation, which underlie modern logic-based approaches to advanced tasks in knowledge representation, transfer to answer set programming., Comment: Preprint version of the IJCAR 2024 contribution

For a smooth projective curve $X$ over $\mathbb C_p$ and any reductive group $G$, we show that the moduli stack of $G$-Higgs bundles on $X$ is a twist of the moduli stack of v-topological $G$-bundles on $X_v$ in a canonical way. We explain how a choice of an exponential trivialises this twist on points. This yields a geometrisation of Faltings' $p$-adic Simpson correspondence for $X$, which we recover as a homeomorphism between the points of moduli spaces. We also show that our twisted isomorphism sends the stack of $p$-adic representations of $\pi_1(X)$ to an open substack of the stack of semi-stable Higgs bundles of degree $0$.

We construct a relative Hodge-Tate spectral sequence for any smooth proper morphism of rigid analytic spaces over a perfectoid field extension of $\mathbb Q_p$. To this end, we generalise Scholze's strategy in the absolute case by using smoothoid adic spaces. As our main additional ingredient, we prove a perfectoid version of Grothendieck's "cohomology and base-change". We also use this to prove local constancy of Hodge numbers in the rigid analytic setting, and deduce that the relative Hodge-Tate spectral sequence degenerates., Comment: Comments welcome!

We prove an analogue of Scholze's Primitive Comparison Theorem for proper rigid spaces over an algebraically closed non-archimedean field $K$ of characteristic $p$. This implies a v-topological version of the Primitive Comparison Theorem for proper finite type morphisms $f:X\to Y$ of analytic adic spaces over $\mathbb Z_p$. We deduce new cases of the Proper Base Change Theorem for $p$-torsion coefficients and the K\"unneth formula in this setting., Comment: This is the accepted version

Nonlinear behavior in the hopping transport of interacting charges enables reconfigurable logic in disordered dopant network devices, where voltages applied at control electrodes tune the relation between voltages applied at input electrodes and the current measured at an output electrode. From kinetic Monte Carlo simulations we analyze the critical nonlinear aspects of variable-range hopping transport for realizing Boolean logic gates in these devices on three levels. First, we quantify the occurrence of individual gates for random choices of control voltages. We find that linearly inseparable gates such as the XOR gate are less likely to occur than linearly separable gates such as the AND gate, despite the fact that the number of different regions in the multidimensional control voltage space for which AND or XOR gates occur is comparable. Second, we use principal component analysis to characterize the distribution of the output current vectors for the (00,10,01,11) logic input combinations in terms of eigenvectors and eigenvalues of the output covariance matrix. This allows a simple and direct comparison of the behavior of different simulated devices and a comparison to experimental devices. Third, we quantify the nonlinearity in the distribution of the output current vectors necessary for realizing Boolean functionality by introducing three nonlinearity indicators. The analysis provides a physical interpretation of the effects of changing the hopping distance and temperature and is used in a comparison with data generated by a deep neural network trained on a physical device.

For any rigid space over a perfectoid extension of $\mathbb Q_p$ that admits a liftable smooth formal model, we construct an isomorphism between the moduli stacks of Hitchin-small Higgs bundles and Hitchin-small v-vector bundles. This constitutes a moduli-theoretic improvement of the small $p$-adic Simpson correspondence of Faltings, Abbes-Gros, Tsuji and Wang. Our construction is based on the Hodge-Tate stack of Bhatt-Lurie. We also prove an analogous correspondence in the arithmetic setting of rigid spaces of good reduction over $p$-adic fields., Comment: revised version of what used to be the second part of arXiv:2302.12747

Nanoparticles interconnected by insulating organic molecules exhibit nonlinear switching behavior at low temperatures. By assembling these switches into a network and manipulating charge transport dynamics through surrounding electrodes, the network can be reconfigurably functionalized to act as any Boolean logic gate. This work introduces a kinetic Monte Carlo-based simulation tool, applying established principles of single electronics to model charge transport dynamics in nanoparticle networks. We functionalize nanoparticle networks as Boolean logic gates and assess their quality using a fitness function. Based on the definition of fitness, we derive new metrics to quantify essential nonlinear properties of the network, including negative differential resistance and nonlinear separability. These nonlinear properties are crucial not only for functionalizing the network as Boolean logic gates but also when our networks are functionalized for brain-inspired computing applications in the future. We address fundamental questions about the dependence of fitness and nonlinear properties on system size, number of surrounding electrodes, and electrode positioning. We assert the overall benefit of having more electrodes, with proximity to the network's output being pivotal for functionality and nonlinearity. Additionally, we demonstrate a optimal system size and argue for breaking symmetry in electrode positioning to favor nonlinear properties., Comment: 15 pages, 12 figures