cometadata/datacite-rtg-text-other-reclassification-records huggingface dataset:
Classifying Organisms and Artefacts By Their Shapes
Creators: name: Salili-James, Arianna
name: Mackay, Anne
name: Rodriguez-Alvarez, Emilio
name: Rodriguez-Perez, Diana
name: Mannack, Thomas
name: Rawlings, Timothy A.
name: Palmer, A. Richard
name: Todd, Jonathan
name: Riutta, Terhi E.
name: Macinnis-Ng, Cate
name: Han, Zhitong
name: Davies, Megan
name: Thorpe, Zinnia
name: Marsland, Stephen
name: Leroi, Armand M.
Publisher: name: arXiv
Year: 2021
Subjects: subject: Computer Vision and Pattern Recognition (cs.CV)
subject: Methodology (stat.ME)
subject: FOS: Computer and information sciences
subject: 62P99

description: We often wish to classify objects by their shapes. Indeed, the study of shapes is an important part of many scientific fields such as evolutionary biology, structural biology, image processing, and archaeology. The most widely-used method of shape analysis, Geometric Morphometrics, assumes that that the mathematical space in which shapes are represented is linear. However, it has long been known that shape space is, in fact, rather more complicated, and certainly non-linear. Diffeomorphic methods that take this non-linearity into account, and so give more accurate estimates of the distances among shapes, exist but have rarely been applied to real-world problems. Using a machine classifier, we tested the ability of several of these methods to describe and classify the shapes of a variety of organic and man-made objects. We find that one method, the Square-Root Velocity Function (SRVF), is superior to all others, including a standard Geometric Morphometric method (eigenshapes). We also show that computational shape classifiers outperform human experts, and that the SRVF shortest-path between shapes can be used to estimate the shapes of intermediate steps in evolutionary series. Diffeomorphic shape analysis methods, we conclude, now provide practical and effective solutions to many shape description and classification problems in the natural and human sciences.
description: 7 pages, 6 figures
title: Neuerscheinungen
Creators: name: Redaktion, Die
Publisher: name: University Library Heidelberg
Year: 2014

description: Denkmalpflege in Baden-Württemberg – Nachrichtenblatt der Landesdenkmalpflege, Bd. 40, Nr. 1 (2011), Beginn und Erscheinungsfrequenz: Ausgaben pro Band: 4
Interaction of laser-cooled $^{87}$Rb atoms with higher order modes of an optical nanofiber
Creators: name: Kumar, Ravi
name: Gokhroo, Vandna
name: Maimaiti, Aili
name: Deasy, Kieran
name: Frawley, Mary C.
name: Phelan, Ciarán
name: Chormaic, Síle Nic
Publisher: name: arXiv
Year: 2013
Subjects: subject: Atomic Physics (physics.atom-ph)
subject: Optics (physics.optics)
subject: FOS: Physical sciences

description: Optical nanofibres are used to confine light to subwavelength regions and are very promising tools for the development of optical fibre-based quantum networks using cold, neutral atoms. To date, experimental studies on atoms near nanofibres have focussed on fundamental fibre mode interactions. In this work, we demonstrate the integration of a few-mode optical nanofibre into a magneto-optical trap for $^{87}$Rb atoms. The nanofibre, with a waist diameter of $\sim$700 nm, supports both the fundamental and first group of higher order modes and is used for atomic fluorescence and absorption studies. In general, light propagating in higher order fibre modes has a greater evanescent field extension around the waist in comparison with the fundamental mode. By exploiting this behaviour, we demonstrate that the detected signal of fluorescent photons emitted from a cloud of cold atoms centred at the nanofibre waist is larger ($\sim$6 times) when higher order guided modes are considered as compared to the fundamental mode. Absorption of on-resonance, higher order mode probe light by the laser-cooled atoms is also observed. These advances should facilitate the realisation of atom trapping schemes based on higher order mode interference.
description: 11 pages, 8 figures
title: "Haus zum Bub" in Konstanz, Hussenstraße 1
Creators: name: Plate, Ulrike
Publisher: name: University Library Heidelberg
Year: 2014

description: Denkmalpflege in Baden-Württemberg – Nachrichtenblatt der Landesdenkmalpflege, Bd. 40, Nr. 2 (2011), Beginn und Erscheinungsfrequenz: Ausgaben pro Band: 4
Single-Photon Switch based on Rydberg Blockade
Creators: name: Baur, Simon
name: Tiarks, Daniel
name: Rempe, Gerhard
name: Dürr, Stephan
Publisher: name: arXiv
Year: 2013
Subjects: subject: Quantum Physics (quant-ph)
subject: FOS: Physical sciences

description: All-optical switching is a technique in which a gate light pulse changes the transmission of a target light pulse without the detour via electronic signal processing. We take this to the quantum regime, where the incoming gate light pulse contains only one photon on average. The gate pulse is stored as a Rydberg excitation in an ultracold atomic gas using electromagnetically induced transparency. Rydberg blockade suppresses the transmission of the subsequent target pulse. Finally, the stored gate photon can be retrieved. A retrieved photon heralds successful storage. The corresponding postselected subensemble shows an extinction of 0.05. The single-photon switch offers many interesting perspectives ranging from quantum communication to quantum information processing.
Sensitivity of accelerator-based neutrino experiments to neutrino-dark matter interaction: Elko as a viable dark matter candidate
Creators: name: Moura, C. A.
name: Kamiya, F.
name: Duarte, L.
name: Dias, M.
name: da Silva, J. M. Hoff
Publisher: name: arXiv
Year: 2021
Subjects: subject: High Energy Physics - Phenomenology (hep-ph)
subject: FOS: Physical sciences

description: We analyze the potential of accelerator-based neutrino experiments, such as the Deep Underground Neutrino Experiment, to constrain a five dimensional operator mediating a beyond standard model interaction between mass dimension one fermion fields, labeled elko, and neutrino. We identify the parameter space where elko is a viable dark matter candidate.
description: 14 pages, 6 figures (v1: 15 pages, 5 figures), revised version to be published in EPL. Important changes in the considered neutrino-elko interaction cross section
DeLag: Using Multi-Objective Optimization to Enhance the Detection of Latency Degradation Patterns in Service-based Systems
Creators: name: Traini, Luca
name: Cortellessa, Vittorio
Publisher: name: arXiv
Year: 2021
Subjects: subject: Software Engineering (cs.SE)
subject: Machine Learning (cs.LG)
subject: Performance (cs.PF)
subject: FOS: Computer and information sciences

description: Performance debugging in production is a fundamental activity in modern service-based systems. The diagnosis of performance issues is often time-consuming, since it requires thorough inspection of large volumes of traces and performance indices. In this paper we present DeLag, a novel automated search-based approach for diagnosing performance issues in service-based systems. DeLag identifies subsets of requests that show, in the combination of their Remote Procedure Call execution times, symptoms of potentially relevant performance issues. We call such symptoms Latency Degradation Patterns. DeLag simultaneously searches for multiple latency degradation patterns while optimizing precision, recall and latency dissimilarity. Experimentation on 700 datasets of requests generated from two microservice-based systems shows that our approach provides better and more stable effectiveness than three state-of-the-art approaches and general purpose machine learning clustering algorithms. DeLag is more effective than all baseline techniques in at least one case study (with p $\leq$ 0.05 and non-negligible effect size). Moreover, DeLag outperforms in terms of efficiency the second and the third most effective baseline techniques on the largest datasets used in our evaluation (up to 22%).
description: Accepted for publication in IEEE Transactions on Software Engineering (TSE)
Quantum secure non-malleable codes in the split-state model
Creators: name: Aggarwal, Divesh
name: Boddu, Naresh Goud
name: Jain, Rahul
Publisher: name: arXiv
Year: 2022
Subjects: subject: Cryptography and Security (cs.CR)
subject: Quantum Physics (quant-ph)
subject: FOS: Computer and information sciences
subject: FOS: Physical sciences

description: Non-malleable-codes introduced by Dziembowski, Pietrzak and Wichs [DPW18] encode a classical message $S$ in a manner such that tampering the codeword results in the decoder either outputting the original message $S$ or a message that is unrelated/independent of $S$. Providing such non-malleable security for various tampering function families has received significant attention in recent years. We consider the well-studied (2-part) split-state model, in which the message $S$ is encoded into two parts $X$ and $Y$, and the adversary is allowed to arbitrarily tamper with each $X$ and $Y$ individually. We consider the security of non-malleable-codes in the split-state model when the adversary is allowed to make use of arbitrary entanglement to tamper the parts $X$ and $Y$. We construct explicit quantum secure non-malleable-codes in the split-state model. Our construction of quantum secure non-malleable-codes is based on the recent construction of quantum secure $2$-source non-malleable-extractors by Boddu, Jain and Kapshikar [BJK21].
description: arXiv admin note: text overlap with arXiv:2109.03097. text overlap with arXiv:1611.09248 by other authors
Is House a Home? Assessing the effectiveness of land base stewardship on Unionid Species at Risk in the Sydenham River Watershed.
Creators: name: Weerakoon, Thiranya
name: Febria, Catherine M.
Publisher: name: figshare
Year: 2023
Subjects: classificationCode: 310304
subject: Freshwater ecology
classificationCode: 410401
subject: Conservation and biodiversity
classificationCode: 410402
subject: Environmental assessment and monitoring

description: Poster created for Canadian Freshwater Mollusc Research Meeting, November 16
Socially-Aware Evaluation Framework for Transportation
Creators: name: Kuncheria, Anu
name: Walker, Joan L.
name: Macfarlane, Jane
Publisher: name: arXiv
Year: 2021
Subjects: subject: Systems and Control (eess.SY)
subject: FOS: Electrical engineering, electronic engineering, information engineering

description: Technological advancements are rapidly changing traffic management in cities. Massive adoption of mobile devices and cloud-based applications have created new mechanisms for urban traffic control and management. Specifically, navigation applications have impacted cities in multiple ways by rerouting traffic on their streets. As different routing strategies distribute traffic differently across the city network, understanding these differences across multiple dimensions is highly relevant for policymakers. In this paper, we develop a holistic framework of indicators, called Socially-Aware Evaluation Framework for Transportation (SAEF), that will assist in understanding how traffic routing and the resultant traffic dynamics impact city metrics, with the intent of avoiding unintended consequences and adhering to city objectives. SAEF is a holistic decision framework formed as an assembled set of city performance indicators grounded in the literature. The selected indicators can be evaluated for cities of various sizes and at the urban scale. The SAEF framework is presented for four Bay Area cities, for which we compare three different routing strategies. Our intent with this work is to provide an evaluation framework that enables reflection on the consequence of policies, traffic management strategies and network changes. With an ability to model out proposed traffic management strategies, the policymaker can consider the trade-offs and potential unintended consequences.
Learning an environment model in real-time with core knowledge and closed-loop behaviours
Creators: name: Lafratta, Giulia
name: Porr, Bernd
name: Chandler, Christopher
name: Miller, Alice
Publisher: name: G-Node
Year: 2024
Subjects: Computational Neuroscience
Motor control, movement and navigation

description: Bernstein Conference 2024 abstract. https://bernstein-conference.de
Fairness without the sensitive attribute via Causal Variational Autoencoder
Creators: name: Grari, Vincent
name: Lamprier, Sylvain
name: Detyniecki, Marcin
Publisher: name: arXiv
Year: 2021
Subjects: subject: Machine Learning (cs.LG)
subject: Artificial Intelligence (cs.AI)
subject: Computers and Society (cs.CY)
subject: Machine Learning (stat.ML)
subject: FOS: Computer and information sciences

description: In recent years, most fairness strategies in machine learning models focus on mitigating unwanted biases by assuming that the sensitive information is observed. However this is not always possible in practice. Due to privacy purposes and var-ious regulations such as RGPD in EU, many personal sensitive attributes are frequently not collected. We notice a lack of approaches for mitigating bias in such difficult settings, in particular for achieving classical fairness objectives such as Demographic Parity and Equalized Odds. By leveraging recent developments for approximate inference, we propose an approach to fill this gap. Based on a causal graph, we rely on a new variational auto-encoding based framework named SRCVAE to infer a sensitive information proxy, that serve for bias mitigation in an adversarial fairness approach. We empirically demonstrate significant improvements over existing works in the field. We observe that the generated proxy's latent space recovers sensitive information and that our approach achieves a higher accuracy while obtaining the same level of fairness on two real datasets, as measured using com-mon fairness definitions.
description: 8 pages, 9 figures
Warped products in Riemannian manifolds
Creators: name: Park, Kwang-Soon
Publisher: name: arXiv
Year: 2013
Subjects: subject: Differential Geometry (math.DG)
subject: FOS: Mathematics
subject: 53C40, 53C42, 53C50

description: In this paper we prove two inequalities relating the warping function to various curvature terms, for warped products isometrically immersed in Riemannian manifolds. This extends work of B. Y. Chen for the case of immersions into space forms. Finally we give an application where the target manifold is the Clifford torus.
description: 10 pages, to appear in the Bulletin of the Australian Mathematical Society
Overlapping community detection in signed networks
Creators: name: Chen, Yi
name: Wang, Xiao-long
name: Yuan, Bo
name: Tang, Bu-zhou
Publisher: name: arXiv
Year: 2013
Subjects: subject: Social and Information Networks (cs.SI)
subject: Physics and Society (physics.soc-ph)
subject: FOS: Computer and information sciences
subject: FOS: Physical sciences
subject: I.5.3; H.2.8

description: Complex networks considering both positive and negative links have gained considerable attention during the past several years. Community detection is one of the main challenges for complex network analysis. Most of the existing algorithms for community detection in a signed network aim at providing a hard-partition of the network where any node should belong to a community or not. However, they cannot detect overlapping communities where a node is allowed to belong to multiple communities. The overlapping communities widely exist in many real world networks. In this paper, we propose a signed probabilistic mixture (SPM) model for overlapping community detection in signed networks. Compared with the existing models, the advantages of our methodology are (i) providing soft-partition solutions for signed networks; (ii) providing soft-memberships of nodes. Experiments on a number of signed networks show that our SPM model: (i) can identify assortative structures or disassortative structures as the same as other state-of-the-art models; (ii) can detect overlapping communities; (iii) outperform other state-of-the-art models at shedding light on the community detection in synthetic signed networks.
description: 17 pages, 11 figures
A Signature-based Algorithm for Computing the Nondegenerate Locus of a Polynomial System
Creators: name: Eder, Christian
name: Lairez, Pierre
name: Mohr, Rafael
name: Din, Mohab Safey El
Publisher: name: arXiv
Year: 2022
Subjects: subject: Symbolic Computation (cs.SC)
subject: FOS: Computer and information sciences
subject: I.1.2; G.4
subject: 13P10, 13P05

description: Polynomial system solving arises in many application areas to model non-linear geometric properties. In such settings, polynomial systems may come with degeneration which the end-user wants to exclude from the solution set. The nondegenerate locus of a polynomial system is the set of points where the codimension of the solution set matches the number of equations. Computing the nondegenerate locus is classically done through ideal-theoretic operations in commutative algebra such as saturation ideals or equidimensional decompositions to extract the component of maximal codimension. By exploiting the algebraic features of signature-based Gröbner basis algorithms we design an algorithm which computes a Gröbner basis of the equations describing the closure of the nondegenerate locus of a polynomial system, without computing first a Gröbner basis for the whole polynomial system.
description: 22 pages, 2 figures. Substantial rewrite of content of the parts of the paper involving signature-based Gr\"obner basis algorithms, both the exposition and the description of the core algorithm of the paper changed
title: Neuerscheinung
Creators: name: Redaktion, Die
Publisher: name: University Library Heidelberg
Year: 2014

description: Denkmalpflege in Baden-Württemberg – Nachrichtenblatt der Landesdenkmalpflege, Bd. 40, Nr. 2 (2011), Beginn und Erscheinungsfrequenz: Ausgaben pro Band: 4
Synaptic modulation facilitates adaptation in cortical networks
Creators: name: Bulygin, Ivan
name: Ferguson, James C.
name: Condruz, Nicoleta
name: Vogels, Tim P.
Publisher: name: G-Node
Year: 2024
Subjects: Computational Neuroscience
Motor control, movement and navigation

description: Bernstein Conference 2024 abstract. https://bernstein-conference.de
Gluon Digitization via Character Expansion for Quantum Computers
Creators: name: Ji, Yao
name: Lamm, Henry
name: Zhu, Shuchen
Publisher: name: arXiv
Year: 2022
Subjects: subject: High Energy Physics - Lattice (hep-lat)
subject: Quantum Physics (quant-ph)
subject: FOS: Physical sciences

description: Efficient digitization is required for quantum simulations of gauge theories. Schemes based on discrete subgroups use a smaller, fixed number of qubits at the cost of systematic errors. We systematize this approach by deriving the single plaquette action through matching the continuous group action to that of a discrete one via group character expansions modulo the field fluctuation contributions. We accompany this scheme by simulations of pure gauge over the largest discrete crystal-like subgroup of $SU(3)$ up to the fifth-order in the coupling constant.
description: 6 pages, 1 figure
Poster created for Canadian Freshwater Mollusc Research Meeting, November 16
Creators: name: Weerakoon, Thiranya
name: Febria, Catherine M.
Publisher: name: figshare
Year: 2023
Subjects: classificationCode: 310304
subject: Freshwater ecology
classificationCode: 410401
subject: Conservation and biodiversity
classificationCode: 410402
subject: Environmental assessment and monitoring

description: Is House a Home? Assessing the effectiveness of land base stewardship on Unionid Species at Risk in the Sydenham River Watershed.
Determination of the Kinematic Parameters from SNe Ia and Cosmic Chronometers
Creators: name: Benndorf, D.
name: Jesus, J. F.
name: Pereira, S. H.
Publisher: name: arXiv
Year: 2021
Subjects: subject: Cosmology and Nongalactic Astrophysics (astro-ph.CO)
subject: FOS: Physical sciences

description: In this work, by assuming a spatially flat Universe, we have tested 8 kinematic parametrization models with $H(z)$ data from Cosmic Chronometers and SNe Ia from Pantheon compilation. Our aim is obtain the current values for the Hubble constant ($H_0$), deceleration parameter ($q_0$), jerk ($j_0$) and snap ($s_0$) parameters independently from a dynamical model. By using a Bayesian model comparison, three models are favoured: a model with the deceleration parameter ($q$) linearly dependent on the redshift, $q$ linearly dependent on the scale factor and a model with a constant jerk. The model with constant jerk is slightly favoured by this analysis, furnishing $H_0=68.8^{+3.7}_{-3.6}$ km/s/Mpc, $q_0=-0.58\pm0.13$, $j_0=1.15^{+0.56}_{-0.53}$ and $s_0=-0.25^{+0.40}_{-0.30}$. The other models are compatible with the constant jerk model, except for the snap parameter, where we have found $s_0=4.0^{+3.4}_{-3.0}$ for the model with $q$ linearly dependent on the scale factor. (All uncertainties in the Abstract correspond to 95\% c.l.).
description: 23 pages, 7 figures
title: Dienststellen der Landesdenkmalpflege
Creators: name: Redaktion, Die
Publisher: name: University Library Heidelberg
Year: 2014

description: Denkmalpflege in Baden-Württemberg – Nachrichtenblatt der Landesdenkmalpflege, Bd. 40, Nr. 2 (2011), Beginn und Erscheinungsfrequenz: Ausgaben pro Band: 4
A neuronal central pattern generator to control the REM/non-REM sleep cycle
Creators: name: Riquelme, Juan Luis
name: Fenk, Lorenz
name: Laurent, Gilles
Publisher: name: G-Node
Year: 2024
Subjects: Computational Neuroscience
Motor control, movement and navigation

description: Bernstein Conference 2024 abstract. https://bernstein-conference.de
Polynomial T-depth Quantum Solvability of Noisy Binary Linear Problem: From Quantum-Sample Preparation to Main Computation
Creators: name: Song, Wooyeong
name: Lim, Youngrong
name: Jeong, Kabgyun
name: Lee, Jinhyoung
name: Park, Jung Jun
name: Kim, M. S.
name: Bang, Jeongho
Publisher: name: arXiv
Year: 2021
Subjects: subject: Quantum Physics (quant-ph)
subject: FOS: Physical sciences

description: The noisy binary linear problem (NBLP) is known as a computationally hard problem, and therefore, it offers primitives for post-quantum cryptography. An efficient quantum NBLP algorithm that exhibits a polynomial quantum sample and time complexities has recently been proposed. However, the algorithm requires a large number of samples to be loaded in a highly entangled state and it is unclear whether such a precondition on the quantum speedup can be obtained efficiently. Here, we present a complete analysis of the quantum solvability of the NBLP by considering the entire algorithm process, namely from the preparation of the quantum sample to the main computation. By assuming that the algorithm runs on "fault-tolerant" quantum circuitry, we introduce a reasonable measure of the computational time cost. The measure is defined in terms of the overall number of T gate layers, referred to as T-depth complexity. We show that the cost of solving the NBLP can be polynomial in the problem size, at the expense of an exponentially increasing logical qubits.
description: 15 pages, 4 figures; Comment welcome
Sample, Translate, Recombine: Leveraging Audio Alignments for Data Augmentation in End-to-end Speech Translation
Creators: name: Lam, Tsz Kin
name: Schamoni, Shigehiko
name: Riezler, Stefan
Publisher: name: arXiv
Year: 2022
Subjects: subject: Computation and Language (cs.CL)
subject: Audio and Speech Processing (eess.AS)
subject: FOS: Computer and information sciences
subject: FOS: Electrical engineering, electronic engineering, information engineering

description: End-to-end speech translation relies on data that pair source-language speech inputs with corresponding translations into a target language. Such data are notoriously scarce, making synthetic data augmentation by back-translation or knowledge distillation a necessary ingredient of end-to-end training. In this paper, we present a novel approach to data augmentation that leverages audio alignments, linguistic properties, and translation. First, we augment a transcription by sampling from a suffix memory that stores text and audio data. Second, we translate the augmented transcript. Finally, we recombine concatenated audio segments and the generated translation. Besides training an MT-system, we only use basic off-the-shelf components without fine-tuning. While having similar resource demands as knowledge distillation, adding our method delivers consistent improvements of up to 0.9 and 1.1 BLEU points on five language pairs on CoVoST 2 and on two language pairs on Europarl-ST, respectively.
description: Accepted at ACL 2022
Navigating through the Latent Spaces in Generative Models
Creators: name: Boyanova, Antoniya
name: Koosha, Tahmineh A.
name: Rothermel, Marco
name: Jamalabadi, Hamidreza
Publisher: name: G-Node
Year: 2024
Subjects: Computational Neuroscience
Neurotechnology

description: Bernstein Conference 2024 abstract. https://bernstein-conference.de
Graph-Based Spatial-Temporal Convolutional Network for Vehicle Trajectory Prediction in Autonomous Driving
Creators: name: Sheng, Zihao
name: Xu, Yunwen
name: Xue, Shibei
name: Li, Dewei
Publisher: name: arXiv
Year: 2021
Subjects: subject: Machine Learning (cs.LG)
subject: Artificial Intelligence (cs.AI)
subject: Robotics (cs.RO)
subject: FOS: Computer and information sciences

description: Forecasting the trajectories of neighbor vehicles is a crucial step for decision making and motion planning of autonomous vehicles. This paper proposes a graph-based spatial-temporal convolutional network (GSTCN) to predict future trajectory distributions of all neighbor vehicles using past trajectories. This network tackles the spatial interactions using a graph convolutional network (GCN), and captures the temporal features with a convolutional neural network (CNN). The spatial-temporal features are encoded and decoded by a gated recurrent unit (GRU) network to generate future trajectory distributions. Besides, we propose a weighted adjacency matrix to describe the intensities of mutual influence between vehicles, and the ablation study demonstrates the effectiveness of our proposed scheme. Our network is evaluated on two real-world freeway trajectory datasets: I-80 and US-101 in the Next Generation Simulation (NGSIM).Comparisons in three aspects, including prediction errors, model sizes, and inference speeds, show that our network can achieve state-of-the-art performance.
description: 11 pages, 9 figures, 8 tables, submitted to IEEE Trans. Intelligent Transportation Systems
Dirac neutrinos from flavor symmetry
Creators: name: Aranda, Alfredo
name: Bonilla, Cesar
name: Morisi, S.
name: Peinado, E.
name: Valle, J. W. F.
Publisher: name: arXiv
Year: 2013
Subjects: subject: High Energy Physics - Phenomenology (hep-ph)
subject: FOS: Physical sciences

description: We present a model where Majorana neutrino mass terms are forbidden by the flavor symmetry group Delta(27). Neutrinos are Dirac fermions and their masses arise in the same way as that of the charged fermions, due to very small Yukawa couplings. The model fits current neutrino oscillation data and correlates the octant of the atmospheric angle with the magnitude of the lightest neutrino mass, with maximal mixing excluded for any neutrino mass
description: 6 pages, 2 figures, references added, discussion of FCNC processes added. Version to appear in PRD
Object-Aware Cropping for Self-Supervised Learning
Creators: name: Mishra, Shlok
name: Shah, Anshul
name: Bansal, Ankan
name: Jagannatha, Abhyuday
name: Anjaria, Janit
name: Sharma, Abhishek
name: Jacobs, David
name: Krishnan, Dilip
Publisher: name: arXiv
Year: 2021
Subjects: subject: Computer Vision and Pattern Recognition (cs.CV)
subject: Machine Learning (cs.LG)
subject: FOS: Computer and information sciences

description: A core component of the recent success of self-supervised learning is cropping data augmentation, which selects sub-regions of an image to be used as positive views in the self-supervised loss. The underlying assumption is that randomly cropped and resized regions of a given image share information about the objects of interest, which the learned representation will capture. This assumption is mostly satisfied in datasets such as ImageNet where there is a large, centered object, which is highly likely to be present in random crops of the full image. However, in other datasets such as OpenImages or COCO, which are more representative of real world uncurated data, there are typically multiple small objects in an image. In this work, we show that self-supervised learning based on the usual random cropping performs poorly on such datasets. We propose replacing one or both of the random crops with crops obtained from an object proposal algorithm. This encourages the model to learn both object and scene level semantic representations. Using this approach, which we call object-aware cropping, results in significant improvements over scene cropping on classification and object detection benchmarks. For example, on OpenImages, our approach achieves an improvement of 8.8% mAP over random scene-level cropping using MoCo-v2 based pre-training. We also show significant improvements on COCO and PASCAL-VOC object detection and segmentation tasks over the state-of-the-art self-supervised learning approaches. Our approach is efficient, simple and general, and can be used in most existing contrastive and non-contrastive self-supervised learning frameworks.
tDCS montage optimization for the treatment of epilepsy using Neurotwins
Creators: name: Mercadal, Borja
name: Lopez-Sola, Edmundo
name: Guasch-Morgades, Maria
name: Lleal-Custey, Èlia
name: Galan-Augé, Cristian
name: Salvador, Ricardo
name: Sanchez-Todo, Roser
name: Wendling, Fabrice
name: Bartolomei, Fabrice
name: Ruffini, Giulio
Publisher: name: G-Node
Year: 2024
Subjects: Computational Neuroscience
Neurotechnology

description: Bernstein Conference 2024 abstract. https://bernstein-conference.de
Work process : determination of a schedule for the IH 635 state highway improvement using the linear scheduling method, Dallas County
Creators: name: Dunin, Bartosz A.
Publisher: name: The University of Texas at Austin
Year: 2005
Subjects: subject: Roads--Texas--Dallas County--Design and construction--Management
subject: Roads--Texas--Dallas County--Design and construction--Planning
subject: Production scheduling--Texas--Dallas County

description: The Linear Scheduling Method is applied in the scheduling of a Texas Department of Transportation (TxDOT) highway improvement project. The Linear Scheduling Method (LSM) is applied through the use of Microsoft Excel spreadsheets and graphs, and gives a working day schedule output. The data used came from Traffic Control Plans provided by TxDOT for the IH 635 Dallas County project
title: Vollmontage-Schulen im Dienste der offenen Gesellschaft. Die Schulbauten des Büros Günter Behnisch aus den 1960er Jahren
Creators: name: Cremer, Folkhard
Publisher: name: University Library Heidelberg
Year: 2014

description: Denkmalpflege in Baden-Württemberg – Nachrichtenblatt der Landesdenkmalpflege, Bd. 40, Nr. 3 (2011), Beginn und Erscheinungsfrequenz: Ausgaben pro Band: 4
Calcium imaging-based brain-computer interface in freely behaving mice
Creators: name: Balilti-Turgeman, Linor
name: Pinchasov, Or
name: Geva, Nitzan
name: Rubin, Alon
name: Ziv, Yaniv
Publisher: name: G-Node
Year: 2024
Subjects: Computational Neuroscience
Neurotechnology

description: Bernstein Conference 2024 abstract. https://bernstein-conference.de
title: Die Keltenfürstin von Herbertingen. Entdeckung, Bergung und wissenschaftliche Bedeutung des neuen hallstattzeitlichen Prunkgrabs von der Heuneburg
Creators: name: Krausse, Dirk
name: Ebinger-Rist, Nicole
Publisher: name: University Library Heidelberg
Year: 2014

description: Denkmalpflege in Baden-Württemberg – Nachrichtenblatt der Landesdenkmalpflege, Bd. 40, Nr. 4 (2011), Beginn und Erscheinungsfrequenz: Ausgaben pro Band: 4
Scalable microelectrode arrays: moving beyond time division multiplexing
Creators: name: Weaver, Sean
name: Chen, Yiyang
name: Renz, Aline
name: Choi, Woojun
name: Vyza, Yashwanth
name: Schlotter, Tilman
name: Vulić, Katarina
name: Kim, Donghwan
name: Atzeni, Gabriele
name: Momotenko, Dmitry
name: Nakatsuka, Nako
name: Jang, Taekwang
name: Vörös, János
Publisher: name: G-Node
Year: 2024
Subjects: Computational Neuroscience
Neurotechnology

description: Bernstein Conference 2024 abstract. https://bernstein-conference.de
Agreeing to Disagree: Annotating Offensive Language Datasets with Annotators' Disagreement
Creators: name: Leonardelli, Elisa
name: Menini, Stefano
name: Aprosio, Alessio Palmero
name: Guerini, Marco
name: Tonelli, Sara
Publisher: name: arXiv
Year: 2021
Subjects: subject: Computation and Language (cs.CL)
subject: Artificial Intelligence (cs.AI)
subject: Computers and Society (cs.CY)
subject: FOS: Computer and information sciences

description: Since state-of-the-art approaches to offensive language detection rely on supervised learning, it is crucial to quickly adapt them to the continuously evolving scenario of social media. While several approaches have been proposed to tackle the problem from an algorithmic perspective, so to reduce the need for annotated data, less attention has been paid to the quality of these data. Following a trend that has emerged recently, we focus on the level of agreement among annotators while selecting data to create offensive language datasets, a task involving a high level of subjectivity. Our study comprises the creation of three novel datasets of English tweets covering different topics and having five crowd-sourced judgments each. We also present an extensive set of experiments showing that selecting training and test data according to different levels of annotators' agreement has a strong effect on classifiers performance and robustness. Our findings are further validated in cross-domain experiments and studied using a popular benchmark dataset. We show that such hard cases, where low agreement is present, are not necessarily due to poor-quality annotation and we advocate for a higher presence of ambiguous cases in future datasets, particularly in test sets, to better account for the different points of view expressed online.
description: To appear at EMNLP 2021 (long paper)
title: Mitteilungen
Creators: name: Redaktion, Die
Publisher: name: University Library Heidelberg
Year: 2014

description: Denkmalpflege in Baden-Württemberg – Nachrichtenblatt der Landesdenkmalpflege, Bd. 40, Nr. 4 (2011), Beginn und Erscheinungsfrequenz: Ausgaben pro Band: 4
The power of linear programming for general-valued CSPs
Creators: name: Kolmogorov, Vladimir
name: Thapper, Johan
name: Zivny, Stanislav
Publisher: name: arXiv
Year: 2013
Subjects: subject: Computational Complexity (cs.CC)
subject: FOS: Computer and information sciences
subject: F.2.m

description: Let $D$, called the domain, be a fixed finite set and let $Γ$, called the valued constraint language, be a fixed set of functions of the form $f:D^m\to\mathbb{Q}\cup\{\infty\}$, where different functions might have different arity $m$. We study the valued constraint satisfaction problem parametrised by $Γ$, denoted by VCSP$(Γ)$. These are minimisation problems given by $n$ variables and the objective function given by a sum of functions from $Γ$, each depending on a subset of the $n$ variables. Finite-valued constraint languages contain functions that take on only rational values and not infinite values. Our main result is a precise algebraic characterisation of valued constraint languages whose instances can be solved exactly by the basic linear programming relaxation (BLP). For a valued constraint language $Γ$, BLP is a decision procedure for $Γ$ if and only if $Γ$ admits a symmetric fractional polymorphism of every arity. For a finite-valued constraint language $Γ$, BLP is a decision procedure if and only if $Γ$ admits a symmetric fractional polymorphism of some arity, or equivalently, if $Γ$ admits a symmetric fractional polymorphism of arity 2. Using these results, we obtain tractability of several novel classes of problems, including problems over valued constraint languages that are: (1) submodular on arbitrary lattices; (2) $k$-submodular on arbitrary finite domains; (3) weakly (and hence strongly) tree-submodular on arbitrary trees.
description: A full version of a FOCS'12 paper by the last two authors (arXiv:1204.1079) and an ICALP'13 paper by the first author (arXiv:1207.7213) to appear in SIAM Journal on Computing (SICOMP)
0-Form, 1-Form and 2-Group Symmetries via Cutting and Gluing of Orbifolds
Creators: name: Cvetič, Mirjam
name: Heckman, Jonathan J.
name: Hübner, Max
name: Torres, Ethan
Publisher: name: arXiv
Year: 2022
Subjects: subject: High Energy Physics - Theory (hep-th)
subject: Mathematical Physics (math-ph)
subject: Algebraic Topology (math.AT)
subject: Differential Geometry (math.DG)
subject: FOS: Physical sciences
subject: FOS: Mathematics

description: Orbifold singularities of M-theory constitute the building blocks of a broad class of supersymmetric quantum field theories (SQFTs). In this paper we show how the local data of these geometries determines global data on the resulting higher symmetries of these systems. In particular, via a process of cutting and gluing, we show how local orbifold singularities encode the 0-form, 1-form and 2-group symmetries of the resulting SQFTs. Geometrically, this is obtained from the possible singularities which extend to the boundary of the non-compact geometry. The resulting category of boundary conditions then captures these symmetries, and is equivalently specified by the orbifold homology of the boundary geometry. We illustrate these general points in the context of a number of examples, including 5D superconformal field theories engineered via orbifold singularities, 5D gauge theories engineered via singular elliptically fibered Calabi-Yau threefolds, as well as 4D SQCD-like theories engineered via M-theory on non-compact $G_2$ spaces.
description: v4: 78 pages, 9 figures, typos corrected, clarifications added
Synaptic fluctuation induces representational drift while preserving discriminability
Creators: name: Nakamura, Kento
name: Endo, Keita
name: Kazama, Hokto
Publisher: name: G-Node
Year: 2024
Subjects: Computational Neuroscience
Learning, plasticity and memory

description: Bernstein Conference 2024 abstract. https://bernstein-conference.de
Limits, Colimits, and Spectra of Modelled Spaces
Creators: name: Aratake, Hisashi
Publisher: name: arXiv
Year: 2022
Subjects: subject: Category Theory (math.CT)
subject: Logic (math.LO)
subject: FOS: Mathematics
subject: 03G30 (Primary) 18C35 (Secondary)

description: It is well-known that the construction of Zariski spectra of (commutative) rings yields a dual adjunction between the category of rings and the category of locally ringed spaces. There are many constructions of spectra of algebras in various contexts giving such adjunctions. Michel Coste unified them in the language of categorical logic by showing that, for an appropriate triple $ (T_0,T,Λ) $ (which we call a spatial Coste context), each $ T_0 $-model can be associated with a $ T $-modelled space and that this yields a dual adjunction between the category of $ T_0 $-models and the category of $ T $-modelled spaces and "admissible" morphisms. However, most of his proofs remain unpublished. In this paper, we introduce an alternative construction of spectra of $ T_0 $-models and give another proof of Coste adjunction. Moreover, we also extend spectra of $ T_0 $-models to relative spectra of $ T_0 $-modelled spaces and prove the existence of limits and colimits in the involved categories of modelled spaces. We can deduce, for instance, that the category of ringed spaces whose stalks are fields is complete and cocomplete.
description: 52 pages
Affine Kac-Moody Algebras and Tau-Functions for the Drinfeld-Sokolov Hierarchies: the Matrix-Resolvent Method
Creators: name: Dubrovin, Boris
name: Valeri, Daniele
name: Yang, Di
Publisher: name: arXiv
Year: 2021
Subjects: subject: Mathematical Physics (math-ph)
subject: Representation Theory (math.RT)
subject: Exactly Solvable and Integrable Systems (nlin.SI)
subject: FOS: Physical sciences
subject: FOS: Mathematics

description: For each affine Kac-Moody algebra $X_n^{(r)}$ of rank $\ell$, $r=1,2$, or $3$, and for every choice of a vertex $c_m$, $m=0,\dots,\ell$, of the corresponding Dynkin diagram, by using the matrix-resolvent method we define a gauge-invariant tau-structure for the associated Drinfeld-Sokolov hierarchy and give explicit formulas for generating series of logarithmic derivatives of the tau-function in terms of matrix resolvents, extending the results of [Mosc. Math. J. 21 (2021), 233-270, arXiv:1610.07534] with $r=1$ and $m=0$. For the case $r=1$ and $m=0$, we verify that the above-defined tau-structure agrees with the axioms of Hamiltonian tau-symmetry in the sense of [Adv. Math. 293 (2016), 382-435, arXiv:1409.4616] and [arXiv:math.DG/0108160].
Neuromodulated online cognitive maps for reinforcement learning
Creators: name: Danieli, Krubeal
name: Lepperød, Mikkel E.
name: Fyhn, Marianne
Publisher: name: G-Node
Year: 2024
Subjects: Computational Neuroscience
Learning, plasticity and memory

description: Bernstein Conference 2024 abstract. https://bernstein-conference.de
title: Immer an der Wand lang ... Die Sanierung des Schlosshafenstegs in Friedrichshafen
Creators: name: Goerlich, Martina
name: Blumer, Rolf-Dieter
name: Butenuth, Janine
name: Richter, Sophie
Publisher: name: University Library Heidelberg
Year: 2014

description: Denkmalpflege in Baden-Württemberg – Nachrichtenblatt der Landesdenkmalpflege, Bd. 41, Nr. 1 (2012), Beginn und Erscheinungsfrequenz: Ausgaben pro Band: 4
MPEC 2023-V200 : 2023 VX6
Creators: name: Minor Planet Center Staff
Publisher: name: The Minor Planet Center
Year: 2023
Subjects: subject: Small Solar System bodies
valueUri: http://astrothesaurus.org/uat/1469
subject: 2023 VX6

description: The Minor Planet Electronic Circulars contain information on unusual minor planets, routine data on comets and natural satellites, and occasional editorial announcements.  They are published on behalf of Division F of the International Astronomical Union by the Minor Planet Center, Smithsonian Astrophysical Observatory, Cambridge, MA 02138, U.S.A.
title: Ausstellung
Creators: name: Redaktion, Die
Publisher: name: University Library Heidelberg
Year: 2014

description: Denkmalpflege in Baden-Württemberg – Nachrichtenblatt der Landesdenkmalpflege, Bd. 41, Nr. 1 (2012), Beginn und Erscheinungsfrequenz: Ausgaben pro Band: 4
Rajiformes
Creators: name: Cohen, Simone C.
name: Kohn, Anna
Publisher: name: Zenodo
Year: 2008
Subjects: Biodiversity
Taxonomy
Animalia
Chordata
Pisces
Rajiformes

description: Order Rajiformes  Family Triakidae
 Mustelus schmitti
 Erpocotyle schmitti (AR)
Family Dasyatidae
 Dasyatis guttata
 Monocotyle guttatae (BR) Family Potamotrygonidae
 Paratrygon aiereba
 Potamotrygonocotyle aramasae (BR) Potamotrygon brachyura
 Potamotrygonocotyle uruguayensis (BR) Potamotrygon castexi
 Potamotrygonocotyle eurypotamoxenus (BR) Potamotrygon falkneri
 Potamotrygonocotyle eurypotamoxenus (BR) Potamotrygon hystrix
 Potamotrygonocotyle eurypotamoxenus (BR) Potamotrygon motoro
 Potamotrygonocotyle chisholmae (AR, BR)
 Potamotrygonocotyle dromedarius (BR)
 Potamotrygonocotyle eurypotamoxenus (AR, BR)
 Potamotrygon schroederi
 Potamotrygonocotyle rarum (BR) Potamotrygon sp.
 Potamotrygonocotyle quadracotyle (BR)
 Potamotrygonocotyle rionegrense (BR)
 Potamotrygonocotyle umbrella (BR) Family Rhinobatidae
 Rhinobatos planiceps
 Rhinobatonchocotyle cyclovaginatus (PE)
description: Published as part of Cohen, Simone C. & Kohn, Anna, 2008, South American Monogenea — list of species, hosts and geographical distribution from 1997 to 2008, pp. 1-42 in Zootaxa 1924 on page 24, DOI: 10.5281/zenodo.184771
Baker-Akhiezer spinor kernel and tau-functions on moduli spaces of meromorphic differentials
Creators: name: Kalla, Caroline
name: Korotkin, Dmitry
Publisher: name: arXiv
Year: 2013
Subjects: subject: Exactly Solvable and Integrable Systems (nlin.SI)
subject: Mathematical Physics (math-ph)
subject: FOS: Physical sciences
subject: 14H70, 32G15

description: In this paper we study Baker-Akhiezer spinor kernel on moduli spaces of meromorphic differentials on Riemann surfaces. We introduce the Baker-Akhiezer tau-function which is related to both Bergman tau-function (which was studied before in the context of Hurwitz spaces and spaces of holomorphic and quadratic differentials) and KP tau-function on such spaces. In particular, we derive variational formulas of Rauch-Ahlfors type on moduli spaces of meromorphic differentials with prescribed singularities: we use the system of homological coordinates, consisting of absolute and relative periods of the meromorphic differential, and show how to vary the fundamental objects associated to a Riemann surface (the matrix of $b$-periods, normalized Abelian differentials, the Bergman bidifferential, the Szegö kernel and the Baker-Akhiezer spinor kernel) with respect to these coordinates. The variational formulas encode dependence both on the moduli of the Riemann surface and on the choice of meromorphic differential (variation of the meromorphic differential while keeping the Riemann surface fixed corresponds to flows of KP type). Analyzing the global properties of the Bergman and Baker-Akhiezer tau-functions we establish relationships between various divisor classes on the moduli spaces.
description: Added Remark 3 and section 2.3. A few typos corrected
Global large solution for the tropical climate model with diffusion
Creators: name: Chen, Xia
name: Yuan, Baoquan
name: Zhang, Ying
Publisher: name: arXiv
Year: 2021
Subjects: subject: Analysis of PDEs (math.AP)
subject: FOS: Mathematics
subject: 35Q35, 76D03, 86A10

description: This paper studies the d-dimensional (d=2,3) tropical climate model with only the dissipation of the first baroclinic model of the velocity ($-ηΔv$). By choosing a class of special initial data $(u_0,v_0,θ_0)$ whose $H^s(\mathbb{R}^d)$ norm can be arbitrarily large, we obtain the global smooth solution of d-dimensional tropical climate model.
description: 12 pages
Ternary Egyptian fractions with prime denominator
Creators: name: Mond, Adva
name: Portier, Julien
Publisher: name: arXiv
Year: 2022
Subjects: subject: Number Theory (math.NT)
subject: Combinatorics (math.CO)
subject: FOS: Mathematics
subject: 11D68, 11N37, 11N56

description: For a prime number $p$, let $A_3(p)= | \{ m \in \mathbb{N}: \exists m_1,m_2,m_3 \in \mathbb{N}, \frac{m}{p}=\frac{1}{m_1}+\frac{1}{m_2}+\frac{1}{m_3} \} |$. In 2019 Luca and Pappalardi proved that $x (\log x)^3 \ll \sum_{p \le x} A_{3}(p) \ll x (\log x)^5$. We improve the upper bound, showing $\sum_{p \le x} A_{3}(p) \ll x (\log x)^3 (\log \log x)^2$.
Enhanced weak force sensing through atom-based coherent noise cancellation in a hybrid cavity optomechanical system
Creators: name: Singh, S. K.
name: Mazaheri, M.
name: Peng, Jia-Xin
name: Asjad, M.
Publisher: name: arXiv
Year: 2022
Subjects: subject: Quantum Physics (quant-ph)
subject: FOS: Physical sciences

description: We investigate weak force-sensing based on coherent quantum noise cancellation in a nonlinear hybrid optomechanical system. The optomechanical cavity contains a moveable mechanical mirror, a fixed semitransparent mirror, an ensemble of ultracold atoms, and an optical parametric amplifier (OPA). Using the coherent quantum noise cancellation (CQNC) process, one can eliminate the back action noise at all frequencies. Also by tuning the OPA parameters, one can suppress the quantum shot-noise at lower frequencies than the resonant frequency. In the CQNC scheme, the damping rate of the mechanical oscillator matches the damping rate of the atomic ensemble, which is experimentally achievable even for a low-frequency mechanical oscillator with a high-quality factor. Elimination of the back action noise and suppression of the shot noise significantly enhance force sensing and thus overcome the standard quantum limit of weak force sensing. This hybrid scheme can play an essential role in the realization of quantum optomechanical sensors and quantum control.
Modulation of Spike-timing-dependent Plasticity via the Interaction of Astrocyte-regulated D-serine with NMDA Receptors
Creators: name: Squadrani, Lorenzo
name: Verzelli, Pietro
name: Petkovic, Janko
name: Tchumatchenko, Tatjana
Publisher: name: G-Node
Year: 2024
Subjects: Computational Neuroscience
Learning, plasticity and memory

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