cometadata/datacite-rtg-text-other-reclassification-records huggingface dataset:
The Effect of Robot Skill Level and Communication in Rapid, Proximate Human-Robot Collaboration
Creators: name: Lee, Kin Man
name: Krishna, Arjun
name: Zaidi, Zulfiqar
name: Paleja, Rohan
name: Chen, Letian
name: Hedlund-Botti, Erin
name: Schrum, Mariah
name: Gombolay, Matthew
Publisher: name: arXiv
Year: 2023
Subjects: subject: Robotics (cs.RO)
subject: FOS: Computer and information sciences

description: As high-speed, agile robots become more commonplace, these robots will have the potential to better aid and collaborate with humans. However, due to the increased agility and functionality of these robots, close collaboration with humans can create safety concerns that alter team dynamics and degrade task performance. In this work, we aim to enable the deployment of safe and trustworthy agile robots that operate in proximity with humans. We do so by 1) Proposing a novel human-robot doubles table tennis scenario to serve as a testbed for studying agile, proximate human-robot collaboration and 2) Conducting a user-study to understand how attributes of the robot (e.g., robot competency or capacity to communicate) impact team dynamics, perceived safety, and perceived trust, and how these latent factors affect human-robot collaboration (HRC) performance. We find that robot competency significantly increases perceived trust ($p<.001$), extending skill-to-trust assessments in prior studies to agile, proximate HRC. Furthermore, interestingly, we find that when the robot vocalizes its intention to perform a task, it results in a significant decrease in team performance ($p=.037$) and perceived safety of the system ($p=.009$).
Combinations of Quantum Observables and Instruments
Creators: name: Gudder, Stan
Publisher: name: arXiv
Year: 2020
Subjects: subject: Quantum Physics (quant-ph)
subject: FOS: Physical sciences

description: This article points out that observables and instruments can be combined in many ways that have natural and physical interpretations. We shall mainly concentrate on the mathematical properties of these combinations. Section~1 reviews the basic definitions and observables are considered in Section~2. We study parts of observables, post-processing, generalized convex combinations, sequential products and tensor products. These combinations are extended to instruments in Section~3. We consider properties of observables measured by combinations of instruments. We introduce four special types of instruments, namely Kraus, Lüders, trivial and semitrivial instruments. We study when these types are closed under various combinations. In this work, we only consider finite-dimensional quantum systems. A few of the results presented here have appeared in the author's previous articles.
description: 20 pages
An FFT-based Galerkin Method for Homogenization of Periodic Media
Creators: name: Vondřejc, Jaroslav
name: Zeman, Jan
name: Marek, Ivo
Publisher: name: arXiv
Year: 2013
Subjects: subject: Numerical Analysis (math.NA)
subject: Materials Science (cond-mat.mtrl-sci)
subject: Analysis of PDEs (math.AP)
subject: Computational Physics (physics.comp-ph)
subject: FOS: Mathematics
subject: FOS: Physical sciences
subject: 35B27, 65N30, 65N12, 65T40

description: In 1994, Moulinec and Suquet introduced an efficient technique for the numerical resolution of the cell problem arising in homogenization of periodic media. The scheme is based on a fixed-point iterative solution to an integral equation of the Lippmann-Schwinger type, with action of its kernel efficiently evaluated by the Fast Fourier Transform techniques. The aim of this work is to demonstrate that the Moulinec-Suquet setting is actually equivalent to a Galerkin discretization of the cell problem, based on approximation spaces spanned by trigonometric polynomials and a suitable numerical integration scheme. For the latter framework and scalar elliptic setting, we prove convergence of the approximate solution to the weak solution, including a-priori estimates for the rate of convergence for sufficiently regular data and the effects of numerical integration. Moreover, we also show that the variational structure implies that the resulting non-symmetric system of linear equations can be solved by the conjugate gradient method. Apart from providing a theoretical support to Fast Fourier Transform-based methods for numerical homogenization, these findings significantly improve on the performance of the original solver and pave the way to similar developments for its many generalizations proposed in the literature.
description: 22 pages, 1 figure
Error bounds, facial residual functions and applications to the exponential cone
Creators: name: Lindstrom, Scott B.
name: Lourenço, Bruno F.
name: Pong, Ting Kei
Publisher: name: arXiv
Year: 2020
Subjects: subject: Optimization and Control (math.OC)
subject: FOS: Mathematics

description: We construct a general framework for deriving error bounds for conic feasibility problems. In particular, our approach allows one to work with cones that fail to be amenable or even to have computable projections, two previously challenging barriers. For the purpose, we first show how error bounds may be constructed using objects called one-step facial residual functions. Then, we develop several tools to compute these facial residual functions even in the absence of closed form expressions for the projections onto the cones. We demonstrate the use and power of our results by computing tight error bounds for the exponential cone feasibility problem. Interestingly, we discover a natural example for which the tightest error bound is related to the Boltzmann-Shannon entropy. We were also able to produce an example of sets for which a Hölderian error bound holds but the supremum of the set of admissible exponents is not itself an admissible exponent.
description: 39 pages, comments welcome. In this version, we simplified the error bound framework and also obtained a better error bound result for products of exponential cones
The boundary of the orbit of the 3 by 3 determinant polynomial
Creators: name: Hüttenhain, Jesko
name: Lairez, Pierre
Publisher: name: arXiv
Year: 2015
Subjects: subject: Algebraic Geometry (math.AG)
subject: FOS: Mathematics
subject: F.2.2
subject: 14L35, 14E05

description: We consider the 3 by 3 determinant polynomial and we describe the limit points of the set of all polynomials obtained from the determinant polynomial by linear change of variables. This answers a question of J. M. Landsberg.
Wave turbulence in shallow water models
Creators: name: di Leoni, P. Clark
name: Cobelli, P. J.
name: Mininni, P. D.
Publisher: name: arXiv
Year: 2013
Subjects: subject: Fluid Dynamics (physics.flu-dyn)
subject: FOS: Physical sciences

description: We study wave turbulence in shallow water flows in numerical simulations using two different approximations: the shallow water model, and the Boussinesq model with weak dispersion. The equations for both models were solved using periodic grids with up to $2048^2$ points. In all simulations, the Froude number varies between $0.015$ and $0.05$, while the Reynolds number and level of dispersion are varied in a broader range to span different regimes. In all cases, most of the energy in the system remains in the waves, even after integrating the system for very long times. For shallow flows, non-linear waves are non-dispersive and the spectrum of potential energy is compatible with $\sim k^{-2}$ scaling. For deeper (Boussinesq) flows, the non-linear dispersion relation as directly measured from the wave and frequency spectrum (calculated independently) shows signatures of dispersion, and the spectrum of potential energy is compatible with predictions of weak turbulence theory, $\sim k^{-4/3}$. In this latter case, the non-linear dispersion relation differs from the linear one and has two branches, which we explain with a simple qualitative argument. Finally, we study probability density functions of the surface height and find that in all cases the distributions are asymmetric. The probability density function can be approximated by a skewed normal distribution as well as by a Tayfun distribution.
description: New version with some corrections
Two-timescale Beamforming Optimization for Intelligent Reflecting Surface Aided Multiuser Communication with QoS Constraints
Creators: name: Zhao, Ming-Min
name: Liu, An
name: Wan, Yubo
name: Zhang, Rui
Publisher: name: arXiv
Year: 2020
Subjects: subject: Information Theory (cs.IT)
subject: Signal Processing (eess.SP)
subject: FOS: Computer and information sciences
subject: FOS: Electrical engineering, electronic engineering, information engineering

description: Intelligent reflecting surface (IRS) is an emerging technology that is able to reconfigure the wireless channel via tunable passive signal reflection and thereby enhance the spectral and energy efficiency of wireless networks cost-effectively. In this paper, we study an IRS-aided multiuser multiple-input single-output (MISO) wireless system and adopt the two-timescale (TTS) transmission to reduce the signal processing complexity and channel training overhead as compared to the existing schemes based on the instantaneous channel state information (I-CSI), and at the same time, exploit the multiuser channel diversity in transmission scheduling. Specifically, the long-term passive beamforming is designed based on the statistical CSI (S-CSI) of all links, while the short-term active beamforming is designed to cater to the I-CSI of all users' reconfigured channels with optimized IRS phase shifts. We aim to minimize the average transmit power at the access point (AP), subject to the users' individual quality of service (QoS) constraints. The formulated stochastic optimization problem is non-convex and difficult to solve since the long-term and short-term design variables are complicatedly coupled in the QoS constraints. To tackle this problem, we propose an efficient algorithm, called the primal-dual decomposition based TTS joint active and passive beamforming (PDD-TJAPB), where the original problem is decomposed into a long-term problem and a family of short-term problems, and the deep unfolding technique is employed to extract gradient information from the short-term problems to construct a convex surrogate problem for the long-term problem. The proposed algorithm is proved to converge to a stationary solution of the original problem almost surely. Simulation results are presented which demonstrate the advantages and effectiveness of the proposed algorithm as compared to benchmark schemes.
description: 16 pages, 10 figures, accepted by IEEE Transactions on Wireless communications
Bounding Polynomial Entanglement Measures for Mixed States
Creators: name: Rodriques, Samuel
name: Datta, Nilanjana
name: Love, Peter J.
Publisher: name: arXiv
Year: 2013
Subjects: subject: Quantum Physics (quant-ph)
subject: FOS: Physical sciences

description: We generalize the notion of the best separable approximation (BSA) and best W-class approximation (BWA) to arbitrary pure state entanglement measures, defining the best zero-$E$ approximation (BEA). We show that for any polynomial entanglement measure $E$, any mixed state $ρ$ admits at least one "$S$-decomposition," i.e., a decomposition in terms of a mixed state on which $E$ is equal to zero, and a single additional pure state with (possibly) non-zero $E$. We show that the BEA is not in general the optimal $S$-decomposition from the point of view of bounding the entanglement of $ρ$, and describe an algorithm to construct the entanglement-minimizing $S$-decomposition for $ρ$ and place an upper bound on $E(ρ)$. When applied to the three-tangle, the cost of the algorithm is linear in the rank $d$ of the density matrix and has accuracy comparable to a steepest descent algorithm whose cost scales as $d^8 \log d$. We compare the upper bound to a lower bound algorithm given by Eltschka and Siewert for the three-tangle, and find that on random rank-two three-qubit density matrices, the difference between the upper and lower bounds is $0.14$ on average. We also find that the three-tangle of random full-rank three qubit density matrices is less than $0.023$ on average.
description: Generalized results in previous version to polynomial entanglement monotones beyond the three-tangle
Error bounds for last-column-block-augmented truncations of block-structured Markov chains
Creators: name: Masuyama, Hiroyuki
Publisher: name: arXiv
Year: 2016
Subjects: subject: Probability (math.PR)
subject: FOS: Mathematics

description: This paper discusses the error estimation of the last-column-block-augmented northwest-corner truncation (LC-block-augmented truncation, for short) of block-structured Markov chains (BSMCs) in continuous time. We first derive upper bounds for the absolute difference between the time-averaged functionals of a BSMC and its LC-block-augmented truncation, under the assumption that the BSMC satisfies the general $f$-modulated drift condition. We then establish computable bounds for a special case where the BSMC is exponentially ergodic. To derive such computable bounds for the general case, we propose a method that reduces BSMCs to be exponentially ergodic. We also apply the obtained bounds to level-dependent quasi-birth-and-death processes (LD-QBDs), and discuss the properties of the bounds through the numerical results on an M/M/$s$ retrial queue, which is a representative example of LD-QBDs. Finally, we present computable perturbation bounds for the stationary distribution vectors of BSMCs.
description: This version has corrected minor errors related to the domain of "sup" in several error bounds
X-ray redshifts for obscured AGN: a case study in the J1030 deep field
Creators: name: Peca, Alessandro
name: Vignali, Cristian
name: Gilli, Roberto
name: Mignoli, Marco
name: Nanni, Riccardo
name: Marchesi, Stefano
name: Bolzonella, Micol
name: Brusa, Marcella
name: Cappelluti, Nico
name: Comastri, Andrea
name: Lanzuisi, Giorgio
name: Vito, Fabio
Publisher: name: arXiv
Year: 2020
Subjects: subject: Astrophysics of Galaxies (astro-ph.GA)
subject: FOS: Physical sciences

description: We present a procedure to constrain the redshifts of obscured ($N_H > 10^{22}$ cm$^{-2}$) Active Galactic Nuclei (AGN) based on low-count statistics X-ray spectra, which can be adopted when photometric and/or spectroscopic redshifts are unavailable or difficult to obtain. We selected a sample of 54 obscured AGN candidates on the basis of their X-ray hardness ratio, $HR>-0.1$, in the Chandra deep field ($\sim$479 ks, 335 arcmin$^2$) around the $z=6.3$ QSO SDSS J1030+0524. The sample has a median value of $\approx80$ net counts in the 0.5-7 keV energy band. We estimate reliable X-ray redshift solutions taking advantage of the main features in obscured AGN spectra, like the Fe 6.4 keV K$\mathrmα$ emission line, the 7.1 keV Fe absorption edge and the photoelectric absorption cut-off. The significance of such features is investigated through spectral simulations, and the derived X-ray redshift solutions are then compared with photometric redshifts. Both photometric and X-ray redshifts are derived for 33 sources. When multiple solutions are derived by any method, we find that combining the redshift solutions of the two techniques improves the rms by a factor of two. Using our redshift estimates ($0.1\lesssim z \lesssim 4$), we derived absorbing column densities in the range $\sim 10^{22}-10^{24}$ cm$^{-2}$ and absorption-corrected, 2-10 keV rest-frame luminosities between $\sim 10^{42}$ and $10^{45}$ erg s$^{-1}$, with median values of $N_H = 1.7 \times 10^{23}$ cm$^{-2}$ and $L_{\mathrm{2-10\, keV}} = 8.3\times10^{43}$ erg s$^{-1}$, respectively. Our results suggest that the adopted procedure can be applied to current and future X-ray surveys, for sources detected only in the X-rays or that have uncertain photometric or single-line spectroscopic redshifts.
description: 22 pages, 18 figures
Hippocampal representational drift and the impact of Alzheimer’s disease
Creators: name: Aamir, Namra
name: Schmidt, Alexander
name: Wolf, Fred
name: Mizuta, Kotaro
name: Hayashi, Yasunori
Publisher: name: G-Node
Year: 2024
Subjects: Computational Neuroscience
Brain disease, network dysfunction and intervention

description: Bernstein Conference 2024 abstract. https://bernstein-conference.de
On p-adic differential equations with separation of variables
Creators: name: Lairez, Pierre
name: Vaccon, Tristan
Publisher: name: arXiv
Year: 2016
Subjects: subject: Symbolic Computation (cs.SC)
subject: FOS: Computer and information sciences

description: Several algorithms in computer algebra involve the computation of a power series solution of a given ordinary differential equation. Over finite fields, the problem is often lifted in an approximate $p$-adic setting to be well-posed. This raises precision concerns: how much precision do we need on the input to compute the output accurately? In the case of ordinary differential equations with separation of variables, we make use of the recent technique of differential precision to obtain optimal bounds on the stability of the Newton iteration. The results apply, for example, to algorithms for manipulating algebraic numbers over finite fields, for computing isogenies between elliptic curves or for deterministically finding roots of polynomials in finite fields. The new bounds lead to significant speedups in practice.
description: ISSAC '16, July 19-22, 2016, Waterloo, ON, Canada
title: Claudia Mohn
Creators: name: Redaktion, Die
Publisher: name: University Library Heidelberg
Year: 2014

description: Denkmalpflege in Baden-Württemberg – Nachrichtenblatt der Landesdenkmalpflege, Bd. 31, Nr. 1 (2002), Beginn und Erscheinungsfrequenz: Ausgaben pro Band: 4
Amenable cones are particularly nice
Creators: name: Lourenço, Bruno F.
name: Roshchina, Vera
name: Saunderson, James
Publisher: name: arXiv
Year: 2020
Subjects: subject: Optimization and Control (math.OC)
subject: Combinatorics (math.CO)
subject: Metric Geometry (math.MG)
subject: FOS: Mathematics

description: Amenability is a geometric property of convex cones that is stronger than facial exposedness and assists in the study of error bounds for conic feasibility problems. In this paper we establish numerous properties of amenable cones, and investigate the relationships between amenability and other properties of convex cones, such as niceness and projectional exposure. We show that the amenability of a compact slice of a closed convex cone is equivalent to the amenability of the cone, and prove several results on the preservation of amenability under intersections and other convex operations. It then follows that homogeneous, doubly nonnegative and other cones that can be represented as slices of the cone of positive semidefinite matrices, are amenable. It is known that projectionally exposed cones are amenable and that amenable cones are nice, however the converse statements have been open questions. We construct an example of a four-dimensional cone that is nice but not amenable. We also show that amenable cones are projectionally exposed in dimensions up to and including four. We conclude with a discussion on open problems related to facial structure of convex sets that we came across in the course of this work, but were not able to fully resolve.
description: 30 pages, 4 figures, comments welcome. To appear in SIAM Journal on Optimization
Computing the homology of basic semialgebraic sets in weak exponential time
Creators: name: Bürgisser, Peter
name: Cucker, Felipe
name: Lairez, Pierre
Publisher: name: arXiv
Year: 2017
Subjects: subject: Computational Geometry (cs.CG)
subject: Algebraic Geometry (math.AG)
subject: Algebraic Topology (math.AT)
subject: FOS: Computer and information sciences
subject: FOS: Mathematics
subject: 14P10

description: We describe and analyze an algorithm for computing the homology (Betti numbers and torsion coefficients) of basic semialgebraic sets which works in weak exponential time. That is, out of a set of exponentially small measure in the space of data the cost of the algorithm is exponential in the size of the data. All algorithms previously proposed for this problem have a complexity which is doubly exponential (and this is so for almost all data).
title: Tagungen
Creators: name: Redaktion, Die
Publisher: name: University Library Heidelberg
Year: 2014

description: Denkmalpflege in Baden-Württemberg – Nachrichtenblatt der Landesdenkmalpflege, Bd. 34, Nr. 1 (2005), Beginn und Erscheinungsfrequenz: Ausgaben pro Band: 4
Parameterized Algebraic Protocols
Creators: name: Mordido, Andreia
name: Spaderna, Janek
name: Thiemann, Peter
name: Vasconcelos, Vasco T.
Publisher: name: arXiv
Year: 2023
Subjects: subject: Programming Languages (cs.PL)
subject: FOS: Computer and information sciences
subject: D.3.1

description: We propose algebraic protocols that enable the definition of protocol templates and session types analogous to the definition of domain-specific types with algebraic datatypes. Parameterized algebraic protocols subsume all regular as well as most context-free and nested session types and, at the same time, replace the expensive superlinear algorithms for type checking by a nominal check that runs in linear time. Algebraic protocols in combination with polymorphism increase expressiveness and modularity by facilitating new ways of parameterizing and composing session types.
Transition rate matrices for the 4-state system from Diving into a dead-end: asymmetric evolution of diving drives diversity and disparity shifts in waterbirds
Creators: name: Tyler, Joshua
name: Younger, Jane L.
Publisher: name: The Royal Society
Year: 2022
Subjects: subject: Evolutionary Biology
subject: FOS: Biological sciences
subject: Ecology
subject: 60301 Animal Systematics and Taxonomy
subject: 60310 Plant Systematics and Taxonomy

description: Transition rate matrices for each of the seven models used in the ancestral state reconstruction analysis. Each value is given as the rate of transitions per million years.
Rigid continuation paths I. Quasilinear average complexity for solving polynomial systems
Creators: name: Lairez, Pierre
Publisher: name: arXiv
Year: 2017
Subjects: subject: Numerical Analysis (math.NA)
subject: Computational Complexity (cs.CC)
subject: FOS: Mathematics
subject: FOS: Computer and information sciences
subject: 68Q25 (Primary), 65H10, 65H20, 65Y20 (Secondary)

description: How many operations do we need on the average to compute an approximate root of a random Gaussian polynomial system? Beyond Smale's 17th problem that asked whether a polynomial bound is possible, we prove a quasi-optimal bound $\text{(input size)}^{1+o(1)}$. This improves upon the previously known $\text{(input size)}^{\frac32 +o(1)}$ bound. The new algorithm relies on numerical continuation along \emph{rigid continuation paths}. The central idea is to consider rigid motions of the equations rather than line segments in the linear space of all polynomial systems. This leads to a better average condition number and allows for bigger steps. We show that on the average, we can compute one approximate root of a random Gaussian polynomial system of~$n$ equations of degree at most $D$ in $n+1$ homogeneous variables with $O(n^5 D^2)$ continuation steps. This is a decisive improvement over previous bounds that prove no better than $\sqrt{2}^{\min(n, D)}$ continuation steps on the average.
Usage and Scaling of an Open-Source Spiking Multi-Area Model of Monkey Cortex
Creators: name: van Albada, Sacha Jennifer
name: Pronold, Jari
name: van Meegen, Alexander
name: Diesmann, Markus
Publisher: name: arXiv
Year: 2020
Subjects: subject: Neurons and Cognition (q-bio.NC)
subject: FOS: Biological sciences
subject: J.3

description: We are entering an age of `big' computational neuroscience, in which neural network models are increasing in size and in numbers of underlying data sets. Consolidating the zoo of models into large-scale models simultaneously consistent with a wide range of data is only possible through the effort of large teams, which can be spread across multiple research institutions. To ensure that computational neuroscientists can build on each other's work, it is important to make models publicly available as well-documented code. This chapter describes such an open-source model, which relates the connectivity structure of all vision-related cortical areas of the macaque monkey with their resting-state dynamics. We give a brief overview of how to use the executable model specification, which employs NEST as simulation engine, and show its runtime scaling. The solutions found serve as an example for organizing the workflow of future models from the raw experimental data to the visualization of the results, expose the challenges, and give guidance for the construction of ICT infrastructure for neuroscience.
Renormalization of the strongly attractive inverse square potential: Taming the singularity
Creators: name: Alhaidari, A. D.
Publisher: name: arXiv
Year: 2013
Subjects: subject: Quantum Physics (quant-ph)
subject: High Energy Physics - Theory (hep-th)
subject: Mathematical Physics (math-ph)
subject: FOS: Physical sciences

description: Quantum anomalies in the inverse square potential are well known and widely investigated. Most prominent is the unbounded increase in oscillations of the particle's state as it approaches the origin when the attractive coupling parameter is greater than the critical value of 1/4. Due to this unphysical divergence in oscillations, we are proposing that the interaction gets screened at short distances making the coupling parameter acquire an effective (renormalized) value that falls within the weak range 0 to 1/4. This prevents the oscillations form growing without limit giving a lower bound to the energy spectrum and forcing the Hamiltonian of the system to be self-adjoint. Technically, this translates into a regularization scheme whereby the inverse square potential is replaced near the origin by another that has the same singularity but with a weak coupling strength. Here, we take the Eckart as the regularizing potential and obtain the corresponding solutions (discrete bound states and continuum scattering states).
description: 10 pages, 1 figure, some typos and errors are corrected in this revised version
Deep Brain Stimulation in the Globus Pallidus internus Promotes Habitual Behavior by Modulating Cortico-Thalamic Shortcuts and Basal Ganglia Plasticity
Creators: name: Maith, Oliver
name: Hamker, Fred
Publisher: name: G-Node
Year: 2024
Subjects: Computational Neuroscience
Brain disease, network dysfunction and intervention

description: Bernstein Conference 2024 abstract. https://bernstein-conference.de
Spatial Distribution of OVI Covering Fractions in the Simulated Circumgalactic Medium
Creators: name: Marra, Rachel
name: Churchill, Christopher W.
name: Kacprzak, Glenn G.
name: Vliet, Rachel Vander
name: Ceverino, Daniel
name: Lewis, Emmy
name: Nielsen, Nikole M.
name: Muzahid, Sowgat
name: Charlton, Jane C.
Publisher: name: arXiv
Year: 2020
Subjects: subject: Astrophysics of Galaxies (astro-ph.GA)
subject: FOS: Physical sciences

description: We use adaptive mesh refinement cosmological simulations to study the spatial distribution and covering fraction of OVI absorption in the circumgalactic medium (CGM) as a function of projected virial radius and azimuthal angle. We compare these simulations to an observed sample of 53 galaxies from the Multiphase Galaxy Halos Survey. Using Mockspec, an absorption line analysis pipeline, we generate synthetic quasar absorption line observations of the simulated CGM. To best emulate observations, we studied the averaged properties of 15,000 "mock samples" each of 53 sightlines having a distribution of $D/R_{vir}$ and sightline orientation statistically consistent with the observations. We find that the OVI covering fraction obtained for the simulated galaxies agrees well with the observed value for the inner halo ($D/R_{vir} \leq 0.375$) and is within $1.1σ$ in the outer halo ($D/R_{vir} > 0.75$), but is underproduced within $0.375 < D/R_{vir} \leq 0.75$. The observed bimodal distribution of OVI covering fraction with azimuthal angle, showing higher frequency of absorption along the projected major and minor axes of galaxies, is not reproduced in the simulations. Further analysis reveals the spatial-kinematic distribution of OVI absorbing gas is dominated by outflows in the inner halo mixed with a inflowing gas that originates from further out in the halo. Though the CGM of the individual simulated galaxies exhibit spatial structure, the flat azimuthal distribution occurs because the individual simulated galaxies do not develop a CGM structure that is universal from galaxy to galaxy.
description: Accepted on December 1, 2020 for publication in The Astrophysical Journal
title: Inhalt
Creators: name: Redaktion, Die
Publisher: name: University Library Heidelberg
Year: 2014

description: Denkmalpflege in Baden-Württemberg – Nachrichtenblatt der Landesdenkmalpflege, Bd. 34, Nr. 2 (2005), Beginn und Erscheinungsfrequenz: Ausgaben pro Band: 4
title: Kirchenausstattungen von Heinrich Dolmetsch. Vom Umgang mit Raumfassungen des späten 19. und frühen 20. Jahrhunderts
Creators: name: Pietrus, Ellen
Publisher: name: University Library Heidelberg
Year: 2014

description: Denkmalpflege in Baden-Württemberg – Nachrichtenblatt der Landesdenkmalpflege, Bd. 34, Nr. 2 (2005), Beginn und Erscheinungsfrequenz: Ausgaben pro Band: 4
In-vivo dynamical effects of structural white matter disconnections
Creators: name: Leone, Riccardo
name: Geysen, Steven
name: Deco, Gustavo
name: Kobeleva, Xenia
Publisher: name: G-Node
Year: 2024
Subjects: Computational Neuroscience
Brain disease, network dysfunction and intervention

description: Bernstein Conference 2024 abstract. https://bernstein-conference.de
Instability windows and evolution of rapidly rotating neutron stars
Creators: name: Gusakov, Mikhail E.
name: Chugunov, Andrey I.
name: Kantor, Elena M.
Publisher: name: arXiv
Year: 2013
Subjects: subject: High Energy Astrophysical Phenomena (astro-ph.HE)
subject: Solar and Stellar Astrophysics (astro-ph.SR)
subject: FOS: Physical sciences

description: We consider an instability of rapidly rotating neutron stars in low-mass X-ray binaries (LMXBs) with respect to excitation of r-modes (which are analogous to Earth's Rossby waves controlled by the Coriolis force). We argue that finite temperature effects in the superfluid core of a neutron star lead to a resonance coupling and enhanced damping (and hence stability) of oscillation modes at certain stellar temperatures. Using a simple phenomenological model we demonstrate that neutron stars with high spin frequency may spend a substantial amount of time at these `resonance' temperatures. This finding allows us to explain puzzling observations of hot rapidly rotating neutron stars in LMXBs and to predict a new class of hot, non-accreting, rapidly rotating neutron stars, some of which may have already been observed and tentatively identified as quiescent LMXB (qLMXB) candidates. We also impose a new theoretical limit on the neutron star spin frequency, explaining the cut-off spin frequency ~730 Hz, following from the statistical analysis of accreting millisecond X-ray pulsars. Besides explaining the observations, our model provides a new tool to constrain superdense matter properties comparing measured and theoretically predicted resonance temperatures.
description: 7 pages, 3 figures, 1 table, accepted for publication in PRL. Short version of arXiv:1305.3825; discussion of a possible new class of neutron stars is added
Parameterized post-Newtonian formalism for multimetric gravity
Creators: name: Hohmann, Manuel
Publisher: name: arXiv
Year: 2013
Subjects: subject: General Relativity and Quantum Cosmology (gr-qc)
subject: FOS: Physical sciences

description: We discuss the post-Newtonian limit of multimetric gravity theories with $N \geq 2$ metric tensors and a corresponding number of standard model copies, and construct an extension of the parameterized post-Newtonian (PPN) formalism. This extended formalism allows a characterization of multimetric gravity theories by a set of constant parameters. The multimetric PPN parameters we derive are a superset of the standard PPN parameters, which have been measured using high-precision experiments in the solar system. We apply our formalism to a class of theories which we previously discussed in the context of cosmology and gravitational waves, and which feature an accelerating expansion of the universe. A comparison between our results and the measured PPN parameters shows that multimetric gravity is fully compatible with solar system observations.
description: 37 pages, no figures, journal version
title: Besondere Dachdeckungen im Main-Tauber-Kreis
Creators: name: Breuer, Judith
Publisher: name: University Library Heidelberg
Year: 2014

description: Denkmalpflege in Baden-Württemberg – Nachrichtenblatt der Landesdenkmalpflege, Bd. 34, Nr. 2 (2005), Beginn und Erscheinungsfrequenz: Ausgaben pro Band: 4
Information and treatment of unknown correlations in the combination of measurements using the BLUE method
Creators: name: Valassi, Andrea
name: Chierici, Roberto
Publisher: name: arXiv
Year: 2013
Subjects: subject: Data Analysis, Statistics and Probability (physics.data-an)
subject: High Energy Physics - Experiment (hep-ex)
subject: FOS: Physical sciences

description: We discuss the effect of large positive correlations in the combinations of several measurements of a single physical quantity using the Best Linear Unbiased Estimate (BLUE) method. We suggest a new approach for comparing the relative weights of the different measurements in their contributions to the combined knowledge about the unknown parameter, using the well-established concept of Fisher information. We argue, in particular, that one We discuss the effect of large positive correlations in the combinations of several measurements of a single physical quantity using the Best Linear Unbiased Estimate (BLUE) method. We suggest a new approach for comparing the relative weights of the different measurements in their contributions to the combined knowledge about the unknown parameter, using the well-established concept of Fisher information. We argue, in particular, that one contribution to information comes from the collective interplay of the measurements through their correlations and that this contribution cannot be attributed to any of the individual measurements alone. We show that negative coefficients in the BLUE weighted average invariably indicate the presence of a regime of high correlations, where the effect of further increasing some of these correlations is that of reducing the error on the combined estimate. In these regimes, we stress that assuming fully correlated systematic uncertainties is not a truly conservative choice, and that the correlations provided as input to BLUE combinations need to be assessed with extreme care instead. In situations where the precise evaluation of these correlations is impractical, or even impossible, we provide tools to help experimental physicists perform more conservative combinations.
title: Editorial
Creators: name: Planck, Dieter
Publisher: name: University Library Heidelberg
Year: 2014

description: Denkmalpflege in Baden-Württemberg – Nachrichtenblatt der Landesdenkmalpflege, Bd. 34, Nr. 3 (2005), Beginn und Erscheinungsfrequenz: Ausgaben pro Band: 4
Orbits of mutually unbiased bases
Creators: name: Blanchfield, Kate
Publisher: name: arXiv
Year: 2013
Subjects: subject: Quantum Physics (quant-ph)
subject: FOS: Physical sciences

description: We express Alltop's construction of mutually unbiased bases as orbits under the Weyl-Heisenberg group in prime dimensions and find a related construction in dimensions 2 and 4. We reproduce Alltop's mutually unbiased bases using abelian subgroups of the Clifford group in prime dimensions, in direct analogy to the well-known construction of mutually unbiased bases using abelian subgroups of the Weyl-Heisenberg group. Finally, we prove three theorems relating to the distances and linear dependencies among different sets of mutually unbiased bases.
description: 21 pages
Generalized Hermite Reduction, Creative Telescoping and Definite Integration of D-Finite Functions
Creators: name: Bostan, Alin
name: Chyzak, Frédéric
name: Lairez, Pierre
name: Salvy, Bruno
Publisher: name: arXiv
Year: 2018
Subjects: subject: Symbolic Computation (cs.SC)
subject: FOS: Computer and information sciences
subject: I.1.2

description: Hermite reduction is a classical algorithmic tool in symbolic integration. It is used to decompose a given rational function as a sum of a function with simple poles and the derivative of another rational function. We extend Hermite reduction to arbitrary linear differential operators instead of the pure derivative, and develop efficient algorithms for this reduction. We then apply the generalized Hermite reduction to the computation of linear operators satisfied by single definite integrals of D-finite functions of several continuous or discrete parameters. The resulting algorithm is a generalization of reduction-based methods for creative telescoping.
description: Accepted for publication in the proceedings of the conference ISSAC'18 (Jul 16-19, 2018)
title: Weinheim. Die Altstadt als Gesamtanlage unter Denkmalschutz
Creators: name: Thieme, Angelika
Publisher: name: University Library Heidelberg
Year: 2014

description: Denkmalpflege in Baden-Württemberg – Nachrichtenblatt der Landesdenkmalpflege, Bd. 34, Nr. 3 (2005), Beginn und Erscheinungsfrequenz: Ausgaben pro Band: 4
LERW as an example of off-critical SLEs
Creators: name: Bauer, Michel
name: Bernard, Denis
name: Kytola, Kalle
Publisher: name: arXiv
Year: 2007
Subjects: subject: Mathematical Physics (math-ph)
subject: FOS: Physical sciences

description: Two dimensional loop erased random walk (LERW) is a random curve, whose continuum limit is known to be a Schramm-Loewner evolution (SLE) with parameter kappa=2. In this article we study ``off-critical loop erased random walks'', loop erasures of random walks penalized by their number of steps. On one hand we are able to identify counterparts for some LERW observables in terms of symplectic fermions (c=-2), thus making further steps towards a field theoretic description of LERWs. On the other hand, we show that it is possible to understand the Loewner driving function of the continuum limit of off-critical LERWs, thus providing an example of application of SLE-like techniques to models near their critical point. Such a description is bound to be quite complicated because outside the critical point one has a finite correlation length and therefore no conformal invariance. However, the example here shows the question need not be intractable. We will present the results with emphasis on general features that can be expected to be true in other off-critical models.
description: 45 pages, 2 figures
title: Ausstellungen
Creators: name: Redaktion, Die
Publisher: name: University Library Heidelberg
Year: 2014

description: Denkmalpflege in Baden-Württemberg – Nachrichtenblatt der Landesdenkmalpflege, Bd. 34, Nr. 4 (2005), Beginn und Erscheinungsfrequenz: Ausgaben pro Band: 4
title: Vielzahl und Vielfalt. Projekt zur Erfassung der Kleindenkmale in Baden-Württemberg 2001–2005
Creators: name: Blaschka, Martina
Publisher: name: University Library Heidelberg
Year: 2014

description: Denkmalpflege in Baden-Württemberg – Nachrichtenblatt der Landesdenkmalpflege, Bd. 35, Nr. 1 (2006), Beginn und Erscheinungsfrequenz: Ausgaben pro Band: 4
The evolution of communication axes in the developing brain
Creators: name: Herbert, Elizabeth
name: Chirif Molina, Ricardo
name: Chini, Mattia
name: Pochinok, Irina
name: Hanganu-Opatz, Ileana
name: Gjorgjieva, Julijana
Publisher: name: G-Node
Year: 2024
Subjects: Computational Neuroscience
Networks and dynamical systems

description: Bernstein Conference 2024 abstract. https://bernstein-conference.de
Tri-spin dynamics in alkali metal-noble gas NMR gyroscope
Creators: name: Liu, Guobin
Publisher: name: arXiv
Year: 2018
Subjects: subject: Atomic Physics (physics.atom-ph)
subject: FOS: Physical sciences

description: Alkali metal-noble gas NMR gyroscope is widely used for precision rotation measurement in fundamental and applied physics. By numerically simulating the alkali-nuclear-nuclear tri-spin dynamics, we investigate the dependence of gyroscope response on alkali spin relaxation time and nuclear spin magnetization. We found additional resonance peaks appear due to a new source of instability, namely the inherent multistability of tri-spin dynamics. The numerical simulation results agree well with the recent experiment, enabling a better understanding and exploitation of the gyroscope signal.
description: 12 figures
Intelligent Reflecting Surface Aided Full-Duplex Communication: Passive Beamforming and Deployment Design
Creators: name: Cai, Yunlong
name: Zhao, Ming-Min
name: Xu, Kaidi
name: Zhang, Rui
Publisher: name: arXiv
Year: 2020
Subjects: subject: Information Theory (cs.IT)
subject: Signal Processing (eess.SP)
subject: FOS: Computer and information sciences
subject: FOS: Electrical engineering, electronic engineering, information engineering

description: This paper investigates the passive beamforming and deployment design for an intelligent reflecting surface (IRS) aided full-duplex (FD) wireless system, where an FD access point (AP) communicates with an uplink (UL) user and a downlink (DL) user simultaneously over the same time-frequency dimension with the help of IRS. Under this setup, we consider three deployment cases: 1) two distributed IRSs placed near the UL user and DL user, respectively; 2) one centralized IRS placed near the DL user; 3) one centralized IRS placed near the UL user. In each case, we aim to minimize the weighted sum transmit power consumption of the AP and UL user by jointly optimizing their transmit power and the passive reflection coefficients at the IRS (or IRSs), subject to the UL and DL users' rate constraints and the uni-modulus constraints on the IRS reflection coefficients. First, we analyze the minimum transmit power required in the IRS-aided FD system under each deployment scheme, and compare it with that of the corresponding half-duplex (HD) system. We show that the FD system outperforms its HD counterpart for all IRS deployment schemes, while the distributed deployment further outperforms the other two centralized deployment schemes. Next, we transform the challenging power minimization problem into an equivalent but more tractable form and propose an efficient algorithm to solve it based on the block coordinate descent (BCD) method. Finally, numerical results are presented to validate our analysis as well as the efficacy of the proposed passive beamforming design.
description: 30 pages, 9 figures, submitted for possible journal publication
A numerical transcendental method in algebraic geometry
Creators: name: Lairez, Pierre
name: Sertöz, Emre Can
Publisher: name: arXiv
Year: 2018
Subjects: subject: Algebraic Geometry (math.AG)
subject: FOS: Mathematics
subject: 32J25, 14Q10, 14C22, 32G20

description: Based on high precision computation of periods and lattice reduction techniques, we compute the Picard group of smooth surfaces. We also study the lattice reduction technique that is employed in order to quantify the possibility of numerical error in terms of an intrinsic measure of complexity of each surface. The method applies more generally to the computation of the lattice generated by Hodge cycles of middle dimension on smooth projective hypersurfaces. We demonstrate the method by a systematic study of thousands of quartic surfaces (K3s) defined by sparse polynomials. As an application, we count the number of rational curves of a given degree lying on each surface. For quartic surfaces we also compute the endomorphism ring of their transcendental lattice.
description: 25 pages
title: Der südliche Hahnenturm am Freiburger Münster Unserer Lieben Frau. Steinrestauratorische Arbeiten abgeschlossen
Creators: name: Leusch, Frank T.
Publisher: name: University Library Heidelberg
Year: 2014

description: Denkmalpflege in Baden-Württemberg – Nachrichtenblatt der Landesdenkmalpflege, Bd. 35, Nr. 1 (2006), Beginn und Erscheinungsfrequenz: Ausgaben pro Band: 4
Computing the volume of compact semi-algebraic sets
Creators: name: Lairez, Pierre
name: Mezzarobba, Marc
name: Din, Mohab Safey El
Publisher: name: arXiv
Year: 2019
Subjects: subject: Symbolic Computation (cs.SC)
subject: FOS: Computer and information sciences

description: Let $S\subset R^n$ be a compact basic semi-algebraic set defined as the real solution set of multivariate polynomial inequalities with rational coefficients. We design an algorithm which takes as input a polynomial system defining $S$ and an integer $p\geq 0$ and returns the $n$-dimensional volume of $S$ at absolute precision $2^{-p}$.Our algorithm relies on the relationship between volumes of semi-algebraic sets and periods of rational integrals. It makes use of algorithms computing the Picard-Fuchs differential equation of appropriate periods, properties of critical points, and high-precision numerical integration of differential equations.The algorithm runs in essentially linear time with respect to~$p$. This improves upon the previous exponential bounds obtained by Monte-Carlo or moment-based methods. Assuming a conjecture of Dimca, the arithmetic cost of the algebraic subroutines for computing Picard-Fuchs equations and critical points is singly exponential in $n$ and polynomial in the maximum degree of the input.
Self-Adaptive Training: Bridging Supervised and Self-Supervised Learning
Creators: name: Huang, Lang
name: Zhang, Chao
name: Zhang, Hongyang
Publisher: name: arXiv
Year: 2021
Subjects: subject: Machine Learning (cs.LG)
subject: Computer Vision and Pattern Recognition (cs.CV)
subject: FOS: Computer and information sciences

description: We propose self-adaptive training -- a unified training algorithm that dynamically calibrates and enhances training processes by model predictions without incurring an extra computational cost -- to advance both supervised and self-supervised learning of deep neural networks. We analyze the training dynamics of deep networks on training data that are corrupted by, e.g., random noise and adversarial examples. Our analysis shows that model predictions are able to magnify useful underlying information in data and this phenomenon occurs broadly even in the absence of any label information, highlighting that model predictions could substantially benefit the training processes: self-adaptive training improves the generalization of deep networks under noise and enhances the self-supervised representation learning. The analysis also sheds light on understanding deep learning, e.g., a potential explanation of the recently-discovered double-descent phenomenon in empirical risk minimization and the collapsing issue of the state-of-the-art self-supervised learning algorithms. Experiments on the CIFAR, STL, and ImageNet datasets verify the effectiveness of our approach in three applications: classification with label noise, selective classification, and linear evaluation. To facilitate future research, the code has been made publicly available at https://github.com/LayneH/self-adaptive-training.
description: Accepted at T-PAMI. Journal version of arXiv:2002.10319 [cs.LG] (NeurIPS2020). 22 pages, 15 figures, 13 tables
Top-down modulation shapes timescales via synaptic plasticity in cortical circuits with multiple interneuron types
Creators: name: Veneto, Fabio
name: Jüngling, Marcel
name: Richter, Leonidas
name: Mazzucato, Luca
name: Gjorgjieva, Julijana
Publisher: name: G-Node
Year: 2024
Subjects: Computational Neuroscience
Networks and dynamical systems

description: Bernstein Conference 2024 abstract. https://bernstein-conference.de