cometadata/datacite-rtg-text-other-reclassification-records huggingface dataset:
Phascolodon gidleyi Simpson 1925
Creators: name: Cifelli, Richard L.
Publisher: name: Zenodo
Year: 2002
Subjects: Biodiversity
Taxonomy
Chromista
Ciliophora
Cyrtophoria
Cyrtophorida
Chilodonellidae
Phascolodon
Phascolodon gidleyi

description: Phascolodon gidleyi Simpson, 1925
(“ Amphilestidae ”, Mammalia), type species by monotypy, was named on the basis of a single specimen from Como Quarry 9, Morrison Formation (Kimmeridgian–Tithonian), Wyoming, USA. As the genus is preoccupied by Phascolodon Stein, 1859 (Ciliophora, Phyllopharyngea), Cifelli and Dykes (2001) proposed the substitute name, Phascolotheridium Cifelli and Dykes, 2001, to replace the junior synonym, Phascolodon Simpson, 1925. It has recently come to my attention, however, that another substitute name had been published (Kretzoi and Kretzoi 2000) some months previously. Hence, Comodon Kretzoi and Kretzoi, 2000 replaces Phascolodon Simpson, 1925; Phascolotheridium Cifelli and Dykes, 2001 is a junior synonym of Comodon Kretzoi and Kretzoi, 2000. The type and only species is thus properly cited as Comodon gidleyi (Simpson, 1925).
description: Published as part of Cifelli, Richard L., 2002, A new teiid lizard from the Cedar Mountain Formation (Albian-Cenomanian boundary) of Utah., pp. 276-285 in Acta Palaeontologica Polonica 47 (1) on page 276, DOI: 10.5281/zenodo.13174508
Supplementary document for Super-Resolved Total Internal Reflection Fluorescence Microscopy using Random Illuminations, TIRF-RIM - 6475930.pdf
Creators: name: Affannoukoué, Kévin
name: labouesse, simon
name: Maire, Guillaume
name: Gallais, Laurent
name: Savatier, Julien
name: Allain, Marc
name: Rasedujjaman, Md
name: Legoff, Loic
name: Idier, Jerôme
name: poincloux, renaud
Publisher: name: Optica Publishing Group
Year: 2025
Subjects: subject: Microbiology
subject: FOS: Biological sciences
subject: Cell Metabolism

description: Document giving the precise description of the movies and figures.
title:  Extracellular Free Water as an Imaging Biomarker of Neuroinflammation
Creators: name: Pinheiro, Cristina
Publisher: name: University of Kentucky Libraries
Year: 2024
Subjects: classificationCode: 5.1
subject: FOS: Psychology

description: Older adults experience a chronic state of heightened immune response referred to as “inflammaging” which can be observed by detecting levels of proinflammatory cytokines in blood serum. These proinflammatory cytokines are secreted in the central nervous system and may also enter the brain through the blood brain barrier. Previous literature has suggested that extracellular free water, a magnetic resonance imaging metric, may allow us to detect alterations in the extracellular space which are thought to correlate with inflammation in the central nervous system. This study examined the correlation between two proinflammatory cytokines, IL-6 and TNFα, collected longitudinally and cross-sectionally imaged extracellular free water. There was a positive correlation between extracellular free water and concurrent levels of IL-6 and TNFα (IL-6 intercept: r=.455, pr=.240, pr=-.444, pr=.297, pb=-.26, 95% CI [-.50, -.03], p
description: © 2024 Cristina N. Pinheiro
Glivenko-Cantelli classes and NIP formulas
Creators: name: Khanaki, Karim
Publisher: name: arXiv
Year: 2021
Subjects: subject: Logic (math.LO)
subject: FOS: Mathematics
subject: 03C45

description: We give several new equivalences of $NIP$ for formulas and new proofs of known results using [T87] and [HOR91]. We emphasize that Keisler measures are more complicated than types (even in $NIP$ context), in an analytic sense. Among other things, we show that, for a first order theory $T$ and formula $ϕ(x,y)$, the following are equivalent:
 (i) $ϕ$ has $NIP$ (for theory $T$).
 (ii) For any global $ϕ$-type $p(x)$ and any model $M$, if $p$ is finitely satisfiable in $M$, then $p$ is generalized $DBSC$ definable over $M$. In particular, if $M$ is countable, $p$ is $DBSC$ definable over $M$. (Cf. Definition 3.3, Fact 3.4.)
 (iii) For any global Keisler $ϕ$-measure $μ(x)$ and any model $M$, if $μ$ is finitely satisfiable in $M$, then $μ$ is generalized Baire-1/2 definable over $M$. In particular, if $M$ is countable, $p$ is Baire-1/2 definable over $M$. (Cf. Definition 3.5.)
 (iv) For any model $M$ and any Keisler $ϕ$-measure $μ(x)$ over $M$, \begin{align*} \sup_{b\in M}|\frac{1}{k}\sum_1^kϕ(p_i,b)-μ(ϕ(x,b))|\to 0 \end{align*} for almost every $(p_i)\in S_ϕ(M)^{\Bbb N}$ with the product measure $μ^{\Bbb N}$. (Cf. Theorem 4.3.)
 (v) Suppose moreover that $T$ is countable, then for any countable model $M$, the space of global $M$-finitely satisfied types/measures is a Rosenthal compactum. (Cf. Theorem A.1.)
description: 36 pages
Turing Completeness and Sid Meier's Civilization
Creators: name: de Wynter, Adrian
Publisher: name: arXiv
Year: 2021
Subjects: subject: Computational Complexity (cs.CC)
subject: Artificial Intelligence (cs.AI)
subject: FOS: Computer and information sciences

description: We prove that three strategy video games from the Sid Meier's Civilization series: Sid Meier's Civilization: Beyond Earth, Sid Meier's Civilization V, and Sid Meier's Civilization VI, are Turing complete. We achieve this by building three universal Turing machines-one for each game-using only the elements present in the games, and using their internal rules and mechanics as the transition function. The existence of such machines imply that under the assumptions made, the games are undecidable. We show constructions of these machines within a running game session, and we provide a sample execution of an algorithm-the three-state Busy Beaver-with one of our machines.
description: Preprint
Varieties defined by linear equations have the amalgamation property
Creators: name: Lipparini, Paolo
Publisher: name: arXiv
Year: 2021
Subjects: subject: Logic (math.LO)
subject: Rings and Algebras (math.RA)
subject: FOS: Mathematics
subject: 03C05, 03C52, 08B05, 08B25

description: A variety is a class of algebraic structures axiomatized by a set of equations. An equation is linear if there is at most one occurrence of an operation symbol on each side. We show that a variety axiomatized by linear equations has the strong amalgamation property.
 Suppose further that the language has no constant symbol and, for each equation, either one side is operation-free, or exactly the same variables appear on both sides. Then also the joint embedding property holds.
 Examples include most varieties defining classical Maltsev conditions. In a few special cases, the above properties are preserved when further unary operations appear in the equations.
description: 24 pages
Defeasible Reasoning via Datalog$^\neg$
Creators: name: Maher, Michael J.
Publisher: name: arXiv
Year: 2021
Subjects: subject: Logic in Computer Science (cs.LO)
subject: Artificial Intelligence (cs.AI)
subject: FOS: Computer and information sciences
subject: I.2.3; F.4.1; I.2.2; I.2.4
subject: 03B70 (Primary) 03B60, 03B53 (Secondary)

description: We address the problem of compiling defeasible theories to Datalog$^\neg$ programs. We prove the correctness of this compilation, for the defeasible logic $DL(\partial_{||})$, but the techniques we use apply to many other defeasible logics. Structural properties of $DL(\partial_{||})$ are identified that support efficient implementation and/or approximation of the conclusions of defeasible theories in the logic, compared with other defeasible logics. We also use previously well-studied structural properties of logic programs to adapt to incomplete Datalog$^\neg$ implementations.
description: Under consideration in Theory and Practice of Logic Programming (TPLP)
Intuitive and Ubiquitous Fever Monitoring Using Smartphones and Smartwatches
Creators: name: Breda, Joseph
name: Patel, Shwetak
Publisher: name: arXiv
Year: 2021
Subjects: subject: Human-Computer Interaction (cs.HC)
subject: Computers and Society (cs.CY)
subject: FOS: Computer and information sciences

description: Inside all smart devices, such as smartphones or smartwatches, there are thermally sensitive resistors known as thermistors which are used to monitor the temperature of the device. These thermistors are sensitive to temperature changes near their location on-device. While they are designed to measure the temperature of the device components such as the battery, they can also sense changes in the temperature of the ambient environment or thermal entities in contact with the device. We have developed a model to estimate core body temperature from signals sensed by these thermistors during a user interaction in which the user places the capacitive touchscreen of a smart device against a thermal site on their body such as their forehead. During the interaction, the device logs the temperature sensed by the thermistors as well as the raw capacitance seen by the touch screen to capture features describing the rate of heat transfer from the body to the device and device-to-skin contact respectively. These temperature and contact features are then used to model the rate of heat transferred from the user's body to the device and thus core-body temperature of the user for ubiquitous and accessible fever monitoring using only a smart device. We validate this system in a lab environment on a simulated skin-like heat source with a temperature estimate mean absolute error of 0.743$^{\circ}$F (roughly 0.4$^{\circ}$C) and limit of agreement of $\pm2.374^{\circ}$F (roughly 1.3$^{\circ}$C) which is comparable to some off-the-shelf peripheral and tympanic thermometers. We found a Pearson's correlation $R^2$ of 0.837 between ground truth temperature and temperature estimated by our system. We also deploy this system in an ongoing clinical study on a population of 7 participants in a clinical environment to show the similarity between simulated and clinical trials.
description: 18 pages, 9 figures, Not yet submitted to conference (submitting after clinical trials)
Weighted colimits of 2-representations and star algebras
Creators: name: Stroiński, Mateusz
Publisher: name: arXiv
Year: 2021
Subjects: subject: Representation Theory (math.RT)
subject: FOS: Mathematics

description: We apply the theory of weighted bicategorical colimits to study the problem of existence and computation of such colimits of birepresentations of finitary bicategories. The main application of our results is the complete classification of simple transitive birepresentations of a bicategory studied in arXiv:1805.05724, which confirms a conjecture made therein.
description: 31 pages
Constrained Sampling from a Kernel Density Estimator to Generate Scenarios for the Assessment of Automated Vehicles
Creators: name: de Gelder, Erwin
name: Cator, Eric
name: Paardekooper, Jan-Pieter
name: Camp, Olaf Op den
name: De Schutter, Bart
Publisher: name: arXiv
Year: 2021
Subjects: subject: Artificial Intelligence (cs.AI)
subject: FOS: Computer and information sciences

description: The safety assessment of automated vehicles (AVs) is an important aspect of the development cycle of AVs. A scenario-based assessment approach is accepted by many players in the field as part of the complete safety assessment. A scenario is a representation of a situation on the road to which the AV needs to respond appropriately. One way to generate the required scenario-based test descriptions is to parameterize the scenarios and to draw these parameters from a probability density function (pdf). Because the shape of the pdf is unknown beforehand, assuming a functional form of the pdf and fitting the parameters to the data may lead to inaccurate fits. As an alternative, Kernel Density Estimation (KDE) is a promising candidate for estimating the underlying pdf, because it is flexible with the underlying distribution of the parameters. Drawing random samples from a pdf estimated with KDE is possible without the need of evaluating the actual pdf, which makes it suitable for drawing random samples for, e.g., Monte Carlo methods. Sampling from a KDE while the samples satisfy a linear equality constraint, however, has not been described in the literature, as far as the authors know.
 In this paper, we propose a method to sample from a pdf estimated using KDE, such that the samples satisfy a linear equality constraint. We also present an algorithm of our method in pseudo-code. The method can be used to generating scenarios that have, e.g., a predetermined starting speed or to generate different types of scenarios. This paper also shows that the method for sampling scenarios can be used in case a Singular Value Decomposition (SVD) is used to reduce the dimension of the parameter vectors.
description: 6 pages, 3 figures, to be published in the proceedings of the IEEE Intelligent Vehicle Symposium Workshops (IV workshop)
Human Perception of Audio Deepfakes
Creators: name: Müller, Nicolas M.
name: Pizzi, Karla
name: Williams, Jennifer
Publisher: name: arXiv
Year: 2021
Subjects: subject: Human-Computer Interaction (cs.HC)
subject: Artificial Intelligence (cs.AI)
subject: Sound (cs.SD)
subject: Audio and Speech Processing (eess.AS)
subject: FOS: Computer and information sciences
subject: FOS: Electrical engineering, electronic engineering, information engineering

description: The recent emergence of deepfakes has brought manipulated and generated content to the forefront of machine learning research. Automatic detection of deepfakes has seen many new machine learning techniques, however, human detection capabilities are far less explored. In this paper, we present results from comparing the abilities of humans and machines for detecting audio deepfakes used to imitate someone's voice. For this, we use a web-based application framework formulated as a game. Participants were asked to distinguish between real and fake audio samples. In our experiment, 472 unique users competed against a state-of-the-art AI deepfake detection algorithm for 14912 total of rounds of the game. We find that humans and deepfake detection algorithms share similar strengths and weaknesses, both struggling to detect certain types of attacks. This is in contrast to the superhuman performance of AI in many application areas such as object detection or face recognition. Concerning human success factors, we find that IT professionals have no advantage over non-professionals but native speakers have an advantage over non-native speakers. Additionally, we find that older participants tend to be more susceptible than younger ones. These insights may be helpful when designing future cybersecurity training for humans as well as developing better detection algorithms.
description: Published at ACM Multimedia 2022 Workshop DDAM First International Workshop on Deepfake Detection for Audio Multimedia at ACM Multimedia 2022
Acyclic cluster algebras with dense $g$-vector fans
Creators: name: Yurikusa, Toshiya
Publisher: name: arXiv
Year: 2021
Subjects: subject: Representation Theory (math.RT)
subject: Commutative Algebra (math.AC)
subject: FOS: Mathematics
subject: 13F60, 05E45, 16G20

description: The $g$-vector fans play an important role in studying cluster algebras and silting theory. We survey cluster algebras with dense $g$-vector fans and show that a connected acyclic cluster algebra has a dense $g$-vector fan if and only if it is either finite type or affine type. As an application, we classify finite dimensional hereditary algebras with dense $g$-vector fans.
description: 23 pages
Sommaire de la revue Annales du patrimoine numéro 22-2022
Creators: name: Abbassa, Mohammed
Publisher: name: figshare
Year: 2024
Subjects: classificationCode: 470501
subject: African literature
classificationCode: 470507
subject: Comparative and transnational literature
classificationCode: 470514
subject: Literary theory

description: Revue Annales du patrimoine faculté des lettres et des arts, université de Mostaganem, numéro 22-2022
Channel State Acquisition in Uplink NOMA for Cellular-Connected UAV: Exploitation of Doppler and Modulation Diversities
Creators: name: Darsena, Donatella
name: Iudice, Ivan
name: Verde, Francesco
Publisher: name: arXiv
Year: 2021
Subjects: subject: Signal Processing (eess.SP)
subject: Statistics Theory (math.ST)
subject: FOS: Electrical engineering, electronic engineering, information engineering
subject: FOS: Mathematics

description: Integration of unmanned aerial vehicles (UAVs) for surveillance or monitoring applications into fifth generation (5G) New Radio (NR) cellular networks is an intriguing problem that has recently tackled a lot of interest in both academia and industry. For an efficient spectrum usage, we consider a recently-proposed sky-ground nonorthogonal multiple access (NOMA) scheme, where a cellular-connected UAV acting as aerial user (AU) and a static terrestrial user (TU) are paired to simultaneously transmit their uplink signals to a base station (BS) in the same time-frequency resource blocks. In such a case, due to the highly dynamic nature of the UAV, the signal transmitted by the AU experiences both time dispersion due to multipath propagation effects and frequency dispersion caused by Doppler shifts. On the other hand, for a static ground network, frequency dispersion of the signal transmitted by the TU is negligible and only multipath effects have to be taken into account. To decode the superposed signals at the BS through successive interference cancellation, accurate estimates of both the AU and TU channels are needed. In this paper, we propose channel estimation procedures that suitably exploit the different circular/noncircular modulation formats (modulation diversity) and the different almost-cyclostationarity features (Doppler diversity) of the AU and TU by means of widely-linear time-varying processing. Our estimation approach is semi-blind since Doppler shifts and time delays of the AU are estimated based on the received data only, whereas the remaining relevant parameters of the AU and TU channels are acquired relying also on the available training symbols, which are transmitted by the AU and TU in a nonorthogonal manner.
description: 18 pages, 8 figures, 1 Table, accepted for publication on IEEE Open Journal of the Communications Society
An Extended Primal-Dual Algorithm Framework for Nonconvex Problems with Application to Nonlinear Imaging
Creators: name: Gao, Yu
name: Pan, Xiaochuan
name: Chen, Chong
Publisher: name: arXiv
Year: 2021
Subjects: subject: Optimization and Control (math.OC)
subject: Medical Physics (physics.med-ph)
subject: FOS: Mathematics
subject: FOS: Physical sciences
subject: 65R32, 68U10, 92C55, 94A08

description: We propose an extended primal-dual algorithm framework for solving a general nonconvex optimization model. This work is motivated by image reconstruction problems in a class of nonlinear imaging, where the forward operator can be formulated as a nonlinear convex function with respect to the reconstructed image. Using the proposed framework, we put forward six specific iterative schemes, and present their detailed mathematical explanation. We also establish the relationship to existing algorithms. Moreover, under proper assumptions, we analyze the convergence of the schemes for the general model when the optimal dual variable regarding the nonlinear operator is non-vanishing. As a representative, the image reconstruction for spectral computed tomography is used to demonstrate the effectiveness of the proposed algorithm framework. By special properties of the concrete problem, we further prove the convergence of these customized schemes when the optimal dual variable regarding the nonlinear operator is vanishing. Finally, the numerical experiments show that the proposed algorithm has good performance on image reconstruction for various data with non-standard scanning configuration.
description: 34 pages, 10 figures, 3 tables
Supplementary document for Optimization of highly inclined Illumination for diffraction-limited and super-resolution microscopy - 6476359.pdf
Creators: name: Gardini, Lucia
name: Vignolini, Tiziano
name: Curcio, Valentina
name: Pavone, Francesco
name: Capitanio, Marco
Publisher: name: Optica Publishing Group
Year: 2025
Subjects: Photonics, Optoelectronics and Optical Communications

description: Supporting Information
Block-transitive, point-primitive Steiner 3-designs
Creators: name: Gan, Yunsong
name: Liu, Weijun
Publisher: name: arXiv
Year: 2021
Subjects: subject: Combinatorics (math.CO)
subject: Group Theory (math.GR)
subject: FOS: Mathematics

description: This paper studies the long-standing open problem of the reduction of Steiner 3-designs admitting a block-transitive automorphism group. We prove that if G acts as a point-primitive, block-transitive automorphism group of a nontrivial Steiner 3-design, then G is of affine or almost simple type.
Simple transitive 2-representations of bimodules over radical square zero Nakayama algebras via localization
Creators: name: Jonsson, Helena
name: Stroiński, Mateusz
Publisher: name: arXiv
Year: 2021
Subjects: subject: Representation Theory (math.RT)
subject: FOS: Mathematics
subject: 18N10, 16D20, 16G10

description: We study the classification problem of simple transitive 2-representations of the 2-category of finite-dimensional bimodules over a radical square zero Nakayama algebra. This results in a complete classification of simple transitive 2-representations whose apex is a finitary two-sided cell. We define a notion of localization of 2-representations. We construct previously unknown simple transitive 2-representations as localizations of cell 2-representations. Using the universal property of our construction we prove that any simple transitive 2-representation with finitary apex is equivalent to a localization of a cell 2-representation.
description: 25 pages
WHOCARES: data-driven WHOle-brain CArdiac signal REgression from highly accelerated simultaneous multi-Slice fMRI acquisitions
Creators: name: Colenbier, Nigel
name: Marino, Marco
name: Arcara, Giorgio
name: Frederick, Blaise
name: Pellegrino, Giovanni
name: Marinazzo, Daniele
name: Ferrazzi, Giulio
Publisher: name: arXiv
Year: 2022
Subjects: subject: Medical Physics (physics.med-ph)
subject: FOS: Physical sciences

description: Cardiac pulsation is a physiological confound of functional magnetic resonance imaging (fMRI) time-series that introduces spurious signal fluctuations in proximity to blood vessels. fMRI alone is not sufficiently fast to resolve cardiac pulsation. Depending on the ratio between the instantaneous heart-rate and the acquisition sampling frequency (1/TR, with TR being the repetition time), the cardiac signal may alias into the frequency band of neural activation. The introduction of simultaneous multi-slice (SMS) imaging has significantly reduced the chances of cardiac aliasing. However, the necessity of covering the entire brain at high spatial resolution restrain the shortest TR to just over 0.5 seconds, which is in turn not sufficiently short to resolve cardiac pulsation beyond 60 beats per minute. Recently, hyper-sampling of the fMRI time-series has been introduced to overcome this issue. While each anatomical location is sampled every TR seconds, the time between consecutive excitations is shorter and thus adequate to resolve cardiac pulsation. In this study, we show that it is feasible to temporally and spatially resolve cardiac waveforms at each voxel location by combining a dedicated hyper-sampling decomposition scheme with SMS. We developed the technique on 774 healthy subjects selected from the Human Connectome Project (HCP) and validated the technology against the RETROICOR method. The proposed approach, which we name Data-driven WHOle-brain CArdiac signal REgression from highly accelerated simultaneous multi-Slice fMRI acquisitions (WHOCARES), is fully data-driven, does not make specific assumptions on cardiac pulsatility, and is independent from external physiological recordings so that the retrospective correction of fMRI data becomes possible when such measurements are not available. WHOCARES is freely available at https://github.com/gferrazzi/WHOCARES.
Scenario Parameter Generation Method and Scenario Representativeness Metric for Scenario-Based Assessment of Automated Vehicles
Creators: name: de Gelder, Erwin
name: Hof, Jasper
name: Cator, Eric
name: Paardekooper, Jan-Pieter
name: Camp, Olaf Op den
name: Ploeg, Jeroen
name: De Schutter, Bart
Publisher: name: arXiv
Year: 2022
Subjects: subject: Robotics (cs.RO)
subject: FOS: Computer and information sciences

description: The development of assessment methods for the performance of Automated Vehicles (AVs) is essential to enable the deployment of automated driving technologies, due to the complex operational domain of AVs. One candidate is scenario-based assessment, in which test cases are derived from real-world road traffic scenarios obtained from driving data. Because of the high variety of the possible scenarios, using only observed scenarios for the assessment is not sufficient. Therefore, methods for generating additional scenarios are necessary.
 Our contribution is twofold. First, we propose a method to determine the parameters that describe the scenarios to a sufficient degree without relying on strong assumptions on the parameters that characterize the scenarios. By estimating the probability density function (pdf) of these parameters, realistic parameter values can be generated. Second, we present the Scenario Representativeness (SR) metric based on the Wasserstein distance, which quantifies to what extent the scenarios with the generated parameter values are representative of real-world scenarios while covering the actual variety found in the real-world scenarios.
 A comparison of our proposed method with methods relying on assumptions of the scenario parametrization and pdf estimation shows that the proposed method can automatically determine the optimal scenario parametrization and pdf estimation. Furthermore, we demonstrate that our SR metric can be used to choose the (number of) parameters that best describe a scenario. The presented method is promising, because the parameterization and pdf estimation can directly be applied to already available importance sampling strategies for accelerating the evaluation of AVs.
description: 14 pages, 11 figures, 4 tables, accepted for publication in IEEE Transactions on Intelligent Transportation Systems
Capability-based Frameworks for Industrial Robot Skills: a Survey
Creators: name: Pantano, Matteo
name: Eiband, Thomas
name: Lee, Dongheui
Publisher: name: arXiv
Year: 2022
Subjects: subject: Robotics (cs.RO)
subject: FOS: Computer and information sciences

description: The research community is puzzled with words like skill, action, atomic unit and others when describing robots' capabilities. However, for giving the possibility to integrate capabilities in industrial scenarios, a standardization of these descriptions is necessary. This work uses a structured review approach to identify commonalities and differences in the research community of robots' skill frameworks. Through this method, 210 papers were analyzed and three main results were obtained. First, the vast majority of authors agree on a taxonomy based on task, skill and primitive. Second, the most investigated robots' capabilities are pick and place. Third, industrial oriented applications focus more on simple robots' capabilities with fixed parameters while ensuring safety aspects. Therefore, this work emphasizes that a taxonomy based on task, skill and primitives should be used by future works to align with existing literature. Moreover, further research is needed in the industrial domain for parametric robots' capabilities while ensuring safety.
Minimizing state preparation times in pulse-level variational molecular simulations
Creators: name: Asthana, Ayush
name: Liu, Chenxu
name: Meitei, Oinam Romesh
name: Economou, Sophia E.
name: Barnes, Edwin
name: Mayhall, Nicholas J.
Publisher: name: arXiv
Year: 2022
Subjects: subject: Quantum Physics (quant-ph)
subject: Chemical Physics (physics.chem-ph)
subject: FOS: Physical sciences

description: Quantum simulation on NISQ devices is severely limited by short coherence times. A variational pulse-shaping algorithm known as ctrl-VQE was recently proposed to address this issue by eliminating the need for parameterized quantum circuits, which lead to long state preparation times. Here, we find the shortest possible pulses for ctrl-VQE to prepare target molecular wavefunctions for a given device Hamiltonian describing coupled transmon qubits. We find that the time-optimal pulses that do this have a bang-bang form consistent with Pontryagin's maximum principle. We further investigate how the minimal state preparation time is impacted by truncating the transmons to two versus more levels. We find that leakage outside the computational subspace (something that is usually considered problematic) speeds up the state preparation, further reducing device coherence-time demands. This speedup is due to an enlarged solution space of target wavefunctions and to the appearance of additional channels connecting initial and target states.
Precise control of entanglement in multinuclear spin registers coupled to defects
Creators: name: Takou, Evangelia
name: Barnes, Edwin
name: Economou, Sophia E.
Publisher: name: arXiv
Year: 2022
Subjects: subject: Quantum Physics (quant-ph)
subject: FOS: Physical sciences

description: Quantum networks play an indispensable role in quantum information tasks such as secure communications, enhanced quantum sensing, and distributed computing. Among the most mature and promising platforms for quantum networking are nitrogen-vacancy centers in diamond and other color centers in solids. One of the challenges in using these systems for networking applications is to controllably manipulate entanglement between the electron and the nuclear spin register despite the always-on nature of the hyperfine interactions, which makes this an inherently many-body quantum system. Here, we develop a general formalism to quantify and control the generation of entanglement in an arbitrarily large nuclear spin register coupled to a color center electronic spin. We provide a reliable measure of nuclear spin selectivity, by exactly incorporating into our treatment the dynamics with unwanted nuclei. We also show how to realize direct multipartite gates through the use of dynamical decoupling sequences, drastically reducing the total gate time compared to protocols based on sequential entanglement with individual nuclear spins. We quantify the performance of such gate operations in the presence of unwanted residual entanglement links, capturing the dynamics of the entire nuclear spin register. Finally, using experimental parameters of a well-characterized 27 nuclear spin register device, we show how to prepare with high fidelity entangled states for quantum error correction.
description: 17+18 pages, 16 figures
Observation of an acoustic topological Euler insulator with meronic waves
Creators: name: Jiang, Bin
name: Bouhon, Adrien
name: Wu, Shi-Qiao
name: Kong, Ze-Lin
name: Lin, Zhi-Kang
name: Slager, Robert-Jan
name: Jiang, Jian-Hua
Publisher: name: arXiv
Year: 2022
Subjects: subject: Mesoscale and Nanoscale Physics (cond-mat.mes-hall)
subject: Materials Science (cond-mat.mtrl-sci)
subject: FOS: Physical sciences

description: Topological band theory has conventionally been concerned with the topology of bands around a single gap. Only recently non-Abelian {topologies that thrive on involving multiple gaps} were studied, unveiling a new horizon {in topological physics} beyond the conventional paradigm. Here, we report on the first experimental realization of a topological Euler insulator phase with unique meronic characterization in an acoustic metamaterial. We demonstrate that this topological phase has several nontrivial features: First, the system cannot be {described} by conventional topological band theory, but has a nontrivial Euler class that captures the unconventional geometry {of the Bloch} bands {in the Brillouin zone}. Second, we uncover in theory and probe in experiments a meronic configuration of the bulk Bloch states for the first time. Third, using a detailed symmetry {analysis}, we show that the topological Euler insulator evolves from {a non-Abelian topological semimetal phase via the annihilation of Dirac points in pairs in one of the band gaps}. With these nontrivial properties, we establish concretely an unconventional bulk-edge correspondence which is confirmed by directly measuring the edge states via {pump-probe techniques}. Our work thus unveils a nontrivial topological Euler insulator phase with {a unique} meronic {pattern} and paves the way as a platform for {non-Abelian topological} phenomena.
description: 7+34 pages, 2+13 figures
Multiplex mobility network and metapopulation epidemic simulations of Italy based on Open Data
Creators: name: Desiderio, Antonio
name: Cimini, Giulio
name: Salina, Gaetano
Publisher: name: arXiv
Year: 2022
Subjects: subject: Physics and Society (physics.soc-ph)
subject: Social and Information Networks (cs.SI)
subject: FOS: Physical sciences
subject: FOS: Computer and information sciences

description: The patterns of human mobility play a key role in the spreading of infectious diseases and thus represent a key ingredient of epidemic modeling and forecasting. Unfortunately, as the Covid-19 pandemic has dramatically highlighted, for the vast majority of countries there is no availability of granular mobility data. This hinders the possibility of developing computational frameworks to monitor the evolution of the disease and to adopt timely and adequate prevention policies. Here we show how this problem can be addressed in the case study of Italy. We build a multiplex mobility network based solely on open data, and implement a SIR metapopulation model that allows scenario analysis through data-driven stochastic simulations. The mobility flows that we estimate are in agreement with real-time proprietary data from smartphones. Our modeling approach can thus be useful in contexts where high-resolution mobility data is not available.
description: 10 pages, 3 figures
Formal relation between Pegg-Barnett and Paul quantum phase frameworks
Creators: name: Linowski, Tomasz
name: Schlichtholz, Konrad
name: Rudnicki, Łukasz
Publisher: name: arXiv
Year: 2022
Subjects: subject: Quantum Physics (quant-ph)
subject: FOS: Physical sciences

description: The problem of defining a hermitian quantum phase operator is nearly as old as quantum mechanics itself. Throughout the years, a number of solutions was proposed, ranging from abstract operator formalisms to phase-space methods. In this work, we make an explicit connection between two of the most prominent approaches, by proving that the probability distribution of phase in the Paul formalism follows exactly from the Pegg-Barnett formalism by combining the latter with the quantum limited amplifier channel. Our findings suggest that the Paul framework may be viewed as a semi-classical limit of the Pegg-Barnett approach.
description: 8 pages + 2-page Appendix
Supplementary document for Optimization of highly inclined Illumination for diffraction-limited and super-resolution microscopy - 6476359.pdf
Creators: name: Gardini, Lucia
name: Vignolini, Tiziano
name: Curcio, Valentina
name: Pavone, Francesco
name: Capitanio, Marco
Publisher: name: Optica Publishing Group
Year: 2023
Subjects: Photonics, Optoelectronics and Optical Communications

description: Supporting Information
Optimal universal quantum circuits for unitary complex conjugation
Creators: name: Ebler, Daniel
name: Horodecki, Michał
name: Marciniak, Marcin
name: Młynik, Tomasz
name: Quintino, Marco Túlio
name: Studziński, Michał
Publisher: name: arXiv
Year: 2022
Subjects: subject: Quantum Physics (quant-ph)
subject: FOS: Physical sciences

description: Let $U_d$ be a unitary operator representing an arbitrary $d$-dimensional unitary quantum operation. This work presents optimal quantum circuits for transforming a number $k$ of calls of $U_d$ into its complex conjugate $\bar{U_d}$. Our circuits admit a parallel implementation and are proven to be optimal for any $k$ and $d$ with an average fidelity of $\left\langle{F}\right\rangle =\frac{k+1}{d(d-k)}$. Optimality is shown for average fidelity, robustness to noise, and other standard figures of merit. This extends previous works which considered the scenario of a single call ($k=1$) of the operation $U_d$, and the special case of $k=d-1$ calls. We then show that our results encompass optimal transformations from $k$ calls of $U_d$ to $f(U_d)$ for any arbitrary homomorphism $f$ from the group of $d$-dimensional unitary operators to itself, since complex conjugation is the only non-trivial automorphisms on the group of unitary operators. Finally, we apply our optimal complex conjugation implementation to design a probabilistic circuit for reversing arbitrary quantum evolutions.
description: 20 pages, 5 figures. Improved presentation, typos corrected, and some proofs are now clearer. Close to the published version
Looking at supersymmetric black holes for a very long time
Creators: name: Lin, Henry W.
name: Maldacena, Juan
name: Rozenberg, Liza
name: Shan, Jieru
Publisher: name: arXiv
Year: 2022
Subjects: subject: High Energy Physics - Theory (hep-th)
subject: FOS: Physical sciences

description: We study correlation functions for extremal supersymmetric black holes. It is necessary to take into account the strongly coupled nature of the boundary supergraviton mode. We consider the case with ${\cal N}=2$ supercharges which is the minimal amount of supersymmetry needed to give a large ground state degeneracy, separated from the continuum. Using the exact solution for this theory we derive formulas for the two point function and we also give integral expressions for any $n$-point correlator. These correlators are time independent at large times and approach constant values that depend on the masses and couplings of the bulk theory. We also explain that in the non-supersymmetric case, the correlators develop a universal time dependence at long times. This paper is the longer companion paper of arXiv:2207.00407.
description: 61 pages, 19 figures; v2: fixed typos, expanded comments on random matrix behavior of projected operators, added Appendix K, v3: fixed minus signs, v4: minor improvements, v5: correction to Fig 12
TESS Shines Light on the Origin of the Ambiguous Nuclear Transient ASASSN-18el
Creators: name: Hinkle, Jason T.
name: Kochanek, Christopher S.
name: Shappee, Benjamin J.
name: Vallely, Patrick J.
name: Auchettl, Katie
name: Fausnaugh, Michael
name: Holoien, Thomas W. -S.
name: Treiber, Helena P.
name: Payne, Anna V.
name: Gaudi, B. Scott
name: Stassun, Keivan G.
name: Thompson, Todd A.
name: Tonry, John L.
name: Villanueva, Steven
Publisher: name: arXiv
Year: 2022
Subjects: subject: High Energy Astrophysical Phenomena (astro-ph.HE)
subject: FOS: Physical sciences

description: We analyze high-cadence data from the Transiting Exoplanet Survey Satellite (TESS) of the ambiguous nuclear transient (ANT) ASASSN-18el. The optical changing-look phenomenon in ASASSN-18el has been argued to be due to either a drastic change in the accretion rate of the existing active galactic nucleus (AGN) or the result of a tidal disruption event (TDE). Throughout the TESS observations, short-timescale stochastic variability is seen, consistent with an AGN. We are able to fit the TESS light curve with a damped-random-walk (DRW) model and recover a rest-frame variability amplitude of $\hatσ = 0.93 \pm 0.02$ mJy and a rest-frame timescale of $τ_{DRW} = 20^{+15}_{-6}$ days. We find that the estimated $τ_{DRW}$ for ASASSN-18el is broadly consistent with an apparent relationship between the DRW timescale and central supermassive black hole mass. The large-amplitude stochastic variability of ASASSN-18el, particularly during late stages of the flare, suggests that the origin of this ANT is likely due to extreme AGN activity rather than a TDE.
description: Updated to reflect the accepted version in MNRAS
Free factors and profinite completions
Creators: name: Garrido, Alejandra
name: Jaikin-Zapirain, Andrei
Publisher: name: arXiv
Year: 2022
Subjects: subject: Group Theory (math.GR)
subject: FOS: Mathematics
subject: 20E18, 20E06

description: Can one detect free products of groups via their profinite completions? We answer positively among virtually free groups. More precisely, we prove that a subgroup of a finitely generated virtually free group $G$ is a free factor if and only if its closure in the profinite completion of $G$ is a profinite free factor. This generalises results by Parzanchevski and Puder (later also proved by Wilton) for free groups. Our methods are entirely different to theirs, combining homological properties of profinite groups and the decomposition theory of Dicks and Dunwoody.
description: 21 pages, accepted for publication in IMRN
title: Design for reliability in advanced technologies using machine learning
Creators: name: Klemme, Florian
Publisher: name: Universität Stuttgart
Year: 2024
Subjects: subject: 004

description: This thesis focuses on the standard cell library, which is one of the core entities in the digital circuit design flow, to demonstrate the challenges and opportunities of advanced technology nodes. The standard cell library serves as a technology interface between the foundry and the circuit designer, enabling automatic mapping of high-level circuit descriptions to the technology of the foundry through the process of logic synthesis. In the past decade, the standard cell library has been continuously adapted to keep up with the demands of shrinking process nodes. This includes, e.g., the integration of more accurate timing models, process variation, or signal integrity for cross-talk and noise in the circuit. This thesis takes this development to the next level and presents approaches to bring machine learning and transistor self-heating into the standard cell library.
title: ÐÑÑÐ¾ÑÐ¸Ñ Ð¸ Ð¼ÐµÑÐ¾Ð´Ð¾Ð»Ð¾Ð³Ð¸Ñ Ð´Ð¸Ð·Ð°Ð¹Ð½Ð°: ÑÐ¸Ð½ÑÐµÐ· Ð¸Ð´ÐµÐ¸, Ð¼Ð°ÑÐµÑÐ¸Ð°Ð»Ð° Ð¸ ÐºÐ¾Ð½ÑÐµÐºÑÑÐ°
title: ÑÑÐµÐ±Ð½Ð¾-Ð¼ÐµÑÐ¾Ð´Ð¸ÑÐµÑÐºÐ¾Ðµ Ð¿Ð¾ÑÐ¾Ð±Ð¸Ðµ
titleType: Subtitle
Creators: name: ÐÐ¾Ð½ÑÐµÐ²Ð°, ÐÑÐ¸Ð½Ð°
name: Ð©ÑÑ, Ð¡ÐµÐ¼ÑÐ½
Publisher: name: ÐÐÐÐÐ¢ÐÐ¥-ÐÐ ÐÐ¡Ð¡
Year: 2025
Subjects: Ð¥ÑÐ´Ð¾Ð¶ÐµÑÑÐ²ÐµÐ½Ð½Ð¾Ðµ ÐºÐ¾Ð½ÑÑÑÑÐ¸ÑÐ¾Ð²Ð°Ð½Ð¸Ðµ
Ð´Ð¸Ð·Ð°Ð¹Ð½
Ð¿ÑÐ¾Ð¼ÑÑÐ»ÐµÐ½Ð½ÑÐ¹ Ð´Ð¸Ð·Ð°Ð¹Ð½
Ð¿ÑÐ¾ÐµÐºÑÐ¸ÑÐ¾Ð²Ð°Ð½Ð¸Ðµ
Ð¸ÑÑÐ¾ÑÐ¸Ñ Ð´Ð¸Ð·Ð°Ð¹Ð½Ð°
Ð¿ÑÐ¾ÑÐ¾ÑÐ¸Ð¿Ð¸ÑÐ¾Ð²Ð°Ð½Ð¸Ðµ
ÑÑÐµÐ±Ð½Ð¸ÐºÐ¸ Ð¸ Ð¿Ð¾ÑÐ¾Ð±Ð¸Ñ Ð´Ð»Ñ Ð²ÑÐ·Ð¾Ð²

description: Ð ÑÑÐµÐ±Ð½Ð¾-Ð¼ÐµÑÐ¾Ð´Ð¸ÑÐµÑÐºÐ¾Ð¼ Ð¿Ð¾ÑÐ¾Ð±Ð¸Ð¸ Ð¸ÑÑÐ»ÐµÐ´ÑÐµÑÑÑ ÑÐ²Ð¾Ð»ÑÑÐ¸Ñ Ð´Ð¸Ð·Ð°Ð¹Ð½Ð° ÐºÐ°Ðº ÑÐ¸Ð½ÑÐµÑÐ¸ÑÐµÑÐºÐ¾Ð¹ Ð´ÐµÑÑÐµÐ»ÑÐ½Ð¾ÑÑÐ¸, Ð¾Ð±ÑÐµÐ´Ð¸Ð½ÑÑÑÐµÐ¹ Ð¸Ð´ÐµÑ, Ð¼Ð°ÑÐµÑÐ¸Ð°Ð» Ð¸ ÐºÐ¾Ð½ÑÐµÐºÑÑ. Ð Ð°ÑÑÐ¼Ð¾ÑÑÐµÐ½Ñ ÐºÐ»ÑÑÐµÐ²ÑÐµ ÑÑÐ°Ð¿Ñ â Ð¾Ñ ÑÐµÐ¼ÐµÑÐ»ÐµÐ½Ð½Ð¾Ð³Ð¾ Ð¿ÑÐ¾Ð¸Ð·Ð²Ð¾Ð´ÑÑÐ²Ð° Ð´Ð¾ ÑÐ¸ÑÑÐ¾Ð²Ð¾Ð¹ ÑÐ¿Ð¾ÑÐ¸ â ÑÐµÑÐµÐ· Ð¿ÑÐ¸Ð·Ð¼Ñ ÑÐµÑÐ½Ð¾Ð»Ð¾Ð³Ð¸ÑÐµÑÐºÐ¸Ñ Ð¸Ð½Ð½Ð¾Ð²Ð°ÑÐ¸Ð¹, ÐºÑÐ»ÑÑÑÑÐ½ÑÑ Ð¿Ð°ÑÐ°Ð´Ð¸Ð³Ð¼ Ð¸ ÑÐ¾ÑÐ¸Ð°Ð»ÑÐ½Ð¾-ÑÐºÐ¾Ð½Ð¾Ð¼Ð¸ÑÐµÑÐºÐ¸Ñ ÑÑÐ»Ð¾Ð²Ð¸Ð¹. ÐÑÐ¾Ð±ÑÐ¹ Ð°ÐºÑÐµÐ½Ñ ÑÐ´ÐµÐ»Ð°Ð½ Ð½Ð° Ð¼ÐµÑÐ¾Ð´Ð¾Ð»Ð¾Ð³Ð¸ÑÑ ÑÐºÐ¾Ð» ÐÐ°ÑÑÐ°ÑÐ·, ÐÐ¥Ð£Ð¢ÐÐÐÐ¡ Ð¸ Ð£Ð»ÑÐ¼ÑÐºÐ¾Ð¹ ÑÐºÐ¾Ð»Ñ, Ð³Ð´Ðµ Ð¼Ð°ÑÐµÑÐ¸Ð°Ð»ÑÐ½Ð¾ÑÑÑ Ð²ÑÑÑÑÐ¿Ð°ÐµÑ Ð¾ÑÐ½Ð¾Ð²Ð¾Ð¹ ÑÐ¾ÑÐ¼Ð¾Ð¾Ð±ÑÐ°Ð·Ð¾Ð²Ð°Ð½Ð¸Ñ, Ð° Ð¿ÑÐ¾ÐµÐºÑÐ¸ÑÐ¾Ð²Ð°Ð½Ð¸Ðµ â Ð³Ð°ÑÐ¼Ð¾Ð½Ð¸Ð·Ð°ÑÐ¸ÐµÐ¹ ÑÑÐ½ÐºÑÐ¸Ð¾Ð½Ð°Ð»ÑÐ½Ð¾ÑÑÐ¸, ÑÑÑÐµÑÐ¸ÐºÐ¸ Ð¸ ÑÐ¼ÑÑÐ»Ð°. ÐÐ·Ð´Ð°Ð½Ð¸Ðµ Ð¿ÑÐµÐ´Ð½Ð°Ð·Ð½Ð°ÑÐµÐ½Ð¾ Ð´Ð»Ñ Ð±Ð°ÐºÐ°Ð»Ð°Ð²ÑÐ¾Ð² Ð½Ð°Ð¿ÑÐ°Ð²Ð»ÐµÐ½Ð¸Ñ 54.03.01 Â«ÐÐ¸Ð·Ð°Ð¹Ð½Â» Ð¸ Ð¿ÑÐ°ÐºÑÐ¸ÐºÐ¾Ð², ÑÑÑÐµÐ¼ÑÑÐ¸ÑÑÑ Ð¸Ð½ÑÐµÐ³ÑÐ¸ÑÐ¾Ð²Ð°ÑÑ Ð·Ð½Ð°Ð½Ð¸Ñ Ð¾ Ð¿ÑÐ¾ÑÐ»Ð¾Ð¼ Ð² Ð°ÐºÑÑÐ°Ð»ÑÐ½ÑÐµ Ð¿ÑÐ¾ÐµÐºÑÑ.
A geometric Elliott invariant and noncommutative rigidity of mapping tori
Creators: name: Guo, Hao
name: Proietti, Valerio
name: Wang, Hang
Publisher: name: arXiv
Year: 2022
Subjects: subject: Operator Algebras (math.OA)
subject: K-Theory and Homology (math.KT)
subject: FOS: Mathematics
subject: 46L80, 58B34, 46L35

description: We prove a rigidity property for mapping tori associated to minimal topological dynamical systems using tools from noncommutative geometry. More precisely, we show that under mild geometric assumptions, an orientation-preserving leafwise homotopy equivalence of two mapping tori associated to $\mathbb{Z}^d$-actions on a compact space can be lifted to an isomorphism of their foliation $C^*$-algebras. This property is a noncommutative analogue of topological rigidity in the context of foliated spaces whose space of leaves is singular, where isomorphism type of the $C^*$-algebra replaces homeomorphism type. Our technique is to develop a geometric approach to the Elliott invariant that relies on topological and index-theoretic data from the mapping torus. We also discuss how our construction can be extended to slightly more general homotopy quotients arising from actions of discrete cocompact subgroups of simply connected solvable Lie groups, as well as how the theory can be applied to the magnetic gap-labelling problem for certain Cantor minimal systems.
description: 40 pages
Test-based Patch Clustering for Automatically-Generated Patches Assessment
Creators: name: Martinez, Matias
name: Kechagia, Maria
name: Perera, Anjana
name: Petke, Justyna
name: Sarro, Federica
name: Aleti, Aldeida
Publisher: name: arXiv
Year: 2022
Subjects: subject: Software Engineering (cs.SE)
subject: FOS: Computer and information sciences

description: Previous studies have shown that Automated Program Repair (APR) techniques suffer from the overfitting problem. Overfitting happens when a patch is run and the test suite does not reveal any error, but the patch actually does not fix the underlying bug or it introduces a new defect that is not covered by the test suite. Therefore, the patches generated by apr tools need to be validated by human programmers, which can be very costly, and prevents apr tool adoption in practice. Our work aims to minimize the number of plausible patches that programmers have to review, thereby reducing the time required to find a correct patch. We introduce a novel light-weight test-based patch clustering approach called xTestCluster, which clusters patches based on their dynamic behavior. xTestCluster is applied after the patch generation phase in order to analyze the generated patches from one or more repair tools and to provide more information about those patches for facilitating patch assessment. The novelty of xTestCluster lies in using information from execution of newly generated test cases to cluster patches generated by multiple APR approaches. A cluster is formed of patches that fail on the same generated test cases. The output from xTestCluster gives developers a) a way of reducing the number of patches to analyze, as they can focus on analyzing a sample of patches from each cluster, b) additional information attached to each patch. After analyzing 902 plausible patches from 21 Java APR tools, our results show that xTestCluster is able to reduce the number of patches to review and analyze with a median of 50%. xTestCluster can save a significant amount of time for developers that have to review the multitude of patches generated by apr tools, and provides them with new test cases that expose the differences in behavior between generated patches.
description: Published in Springer Empirical Software Engineering, Volume 29, article number 116 (2024)
Loss aversion in strategy-proof school-choice mechanisms
Creators: name: Meisner, Vincent
name: von Wangenheim, Jonas
Publisher: name: arXiv
Year: 2022
Subjects: subject: Theoretical Economics (econ.TH)
subject: FOS: Economics and business

description: Evidence suggests that participants in strategy-proof matching mechanisms play dominated strategies. To explain the data, we introduce expectation-based loss aversion into a school-choice setting and characterize choice-acclimating personal equilibria. We find that non-truthful preference submissions can be strictly optimal if and only if they are top-rank monotone. In equilibrium, inefficiency or justified envy may arise in seemingly stable or efficient mechanisms. Specifically, students who are more loss averse or less confident than their peers obtain suboptimal allocations.