cometadata/datacite-rtg-text-other-reclassification-records huggingface dataset:
From Who You Know to What You Read: Augmenting Scientific Recommendations with Implicit Social Networks
Creators: name: Kang, Hyeonsu B.
name: Kocielnik, Rafal
name: Head, Andrew
name: Yang, Jiangjiang
name: Latzke, Matt
name: Kittur, Aniket
name: Weld, Daniel S.
name: Downey, Doug
name: Bragg, Jonathan
Publisher: name: arXiv
Year: 2022
Subjects: subject: Information Retrieval (cs.IR)
subject: Human-Computer Interaction (cs.HC)
subject: Social and Information Networks (cs.SI)
subject: FOS: Computer and information sciences

description: The ever-increasing pace of scientific publication necessitates methods for quickly identifying relevant papers. While neural recommenders trained on user interests can help, they still result in long, monotonous lists of suggested papers. To improve the discovery experience we introduce multiple new methods for \em augmenting recommendations with textual relevance messages that highlight knowledge-graph connections between recommended papers and a user's publication and interaction history. We explore associations mediated by author entities and those using citations alone. In a large-scale, real-world study, we show how our approach significantly increases engagement -- and future engagement when mediated by authors -- without introducing bias towards highly-cited authors. To expand message coverage for users with less publication or interaction history, we develop a novel method that highlights connections with proxy authors of interest to users and evaluate it in a controlled lab study. Finally, we synthesize design implications for future graph-based messages.
description: to be published in ACM SIGCHI 2022
Reflections of the Service Provider
Creators: name: Geischen, John
name: Viggio, Alex
name: Breeze, Jonathan
Publisher: name: VIVO
Year: 2015
Subjects: subject: Information Systems
subject: FOS: Computer and information sciences
subject: Library and Information Studies
subject: FOS: Media and communications

description: As the first official DuraSpace Registered Service Provider for VIVO, Symplectic provides services that cover everything from installation to support of VIVO on client servers. Our continued involvement in user groups, the DuraSpace community and participation in VIVO working groups mean that we are well placed to support the needs of the VIVO community.
Symplectic is also a registered service provider for Profiles RNS, the open source Semantic Web research networking platform based on the VIVO ontology.
This presentation will reflect on Symplectic’s first year as a Registered Service Provider, showcasing the projects we have supported for both VIVO and Profiles RNS - covering installations, data analysis, data population and customisation. As well as our current engagements, we will introduce a number of new initiatives we plan to introduce in support of both open source communities.
Semantics and Design: reflections on beautiful metadata
Creators: name: Whaling, Richard
name: Marques, Andre
Publisher: name: VIVO
Year: 2015
Subjects: subject: Information Systems
subject: FOS: Computer and information sciences
subject: Library and Information Studies
subject: FOS: Media and communications

description: We describe UChicago Faculty Profiles, a semantic platform for exploring faculty research interests and output, based on VIVO-ISF. In the talk, we will describe how this project faced different constraints and requirements than most VIVO implementations; in particular, our directive was to work closely with our university's Office of Communications to provide carefully curated editorial content, and to maintain consistent design and branding with the University's other flagship public-facing sites. These aesthetic concerns, as well as other factors, led us to first explore existing software options, principally VIVO and Profiles RNS, before ultimately deciding to build a system ourselves.

We will discuss our experiments in building the features and workflows we needed with a variety of web application technologies, including Ruby on Rails, Node.js, Expression Engine, and Meteor. In particular, we will focus on the obstacles we faced in building proper handling of Linked Data with these tools, rather than a pure RDF approach, and in which cases we were capable of overcoming them. Finally, we will reflect on the fundamental limitations of our approach compared to VIVO and related technologies, and contemplate what future work could allow us to combine a design-first sensibility with the power and rigor of a more purely semantic system.
POSTER: VIVO at Brown University
Creators: name: McCauley, Stephen
name: Rainwater, Jean
name: Lawless, Ted
Publisher: name: VIVO
Year: 2015
Subjects: subject: Information Systems
subject: FOS: Computer and information sciences
subject: Library and Information Studies
subject: FOS: Media and communications

description: Brown University went live with its VIVO installation, “Researchers@Brown,” in May 2014. The platform serves as the main public portal for information about Brown faculty: their appointments, publications, areas of specialty, and more. In March 2015, one year later, Brown’s VIVO hosted nearly 60,000 unique users, making it one of Brown’s most popular websites.

Our poster will describe the current state of the VIVO project at Brown, and how we arrived here. We will cover staff support, surveying and working with faculty, and local modifications to the VIVO ontology. In addition, we have extended the base VIVO installation with a number of features. These include:
--a custom web-based editing interface, for faculty and their delegates to manage their profiles
--publication harvesting from CrossRef and PubMed
--a JSON data feed pushing VIVO data to other Brown web services
--synchronizing local resources with external data sources, like Wikidata and OCLC’s FAST vocabulary service
--a modified presentation layer

We will provide an overview of these systems, our data sources and workflow, and near-term plans for future development. All together, this poster will provide a broad look at the particulars of the Brown VIVO installation, and the environment within which it operates.
Plasma-like Description for Elementary and Composite Quantum Particles
Creators: name: Akhmeteli, Andrey
Publisher: name: arXiv
Year: 2022
Subjects: subject: General Physics (physics.gen-ph)
subject: FOS: Physical sciences

description: Schr{ö}dinger noticed in 1952 that a scalar complex wave function can be made real by a gauge transformation. The author showed recently that one real function is also enough to describe matter in the Dirac equation in an arbitrary electromagnetic or Yang--Mills field. This suggests some "symmetry" between positive and negative frequencies and, therefore, particles and antiparticles, so the author previously considered a description of one-particle wave functions as plasma-like collections of a large number of particles and antiparticles. The description has some similarities with Bohmian mechanics. This work offers a criterion for approximation of continuous charge density distributions by discrete ones with quantized charge based on the equality of partial Fourier sums, and an example of such approximation is computed using the homotopy continuation method. An example mathematical model of the description is proposed. The description is also extended to composite particles, such as nucleons or large molecules, regarded as collections including a composite particle and a large number of pairs of elementary particles and antiparticles. While it is not clear if this is a correct description of the reality, it can become a basis of an interesting model or useful picture of quantum mechanics.
description: Formatting differs from that in the published version
Applying System of Systems Engineering(SoSE) to VIVO?
Creators: name: Wang, Jing
Publisher: name: VIVO
Year: 2015
Subjects: subject: Information Systems
subject: FOS: Computer and information sciences
subject: Library and Information Studies
subject: FOS: Media and communications

description: System of systems (SoS) refers to a set of operational and managerial independent systems interacting with each other to provide capabilities which cannot be accomplished by any single system. SoS has its own characteristics and challenges, such as emergent behavior and evolutionary development. This presentation will:

Introduce the concepts and characteristics of system of systems (SoS) and system thinking practice.
discuss SoS challenges using SoS case studies such as Global Earth Observation SoS
discuss how SoS Engineering process can be applied to networked research ecosystem in various areas such as community partnerships and SoS architecture.
Ballo delle ingrate 1608/1638: la musica per il balletto teatrale tra tradizione e innovazione monteverdiana
Creators: name: Nocilli, Cecilia
Publisher: name: Pavia University Press - Edizioni dell'Università degli Studi di Pavia
Year: 2020

description: Questo saggio analizza le scelte teatrali, vocali, ritmico-musicali e coreografiche impiegate da Claudio Monteverdi e Ottavio Rinuccini nel Ballo delle Ingrate del 1608 tramite lo sviluppo del concetto di «seconda pratica» esteso in campo coreico e scenico. Come «genere rappresentativo», questo Balletto teatrale è debitore sia della tradizione italiana di danza sia della mascherata fiorentina, ma al contempo avvia una nuova sperimentazione gestuale, teatrale e coreografica per l’influsso dei Comici Fedeli di Giovanni Battista Andreini e di Virginia Ramponi Andreini, protagonista delle «ingrate». La disamina dell’Entrata e della musica del Ballo segue da vicino le indicazioni fornite dalla partitura di Monteverdi del 1638, dal libretto di Rinuccini e dai resoconti delle celebrazioni mantovane del 1608 che hanno delucidato la natura e la struttura dei tre bassi ostinati della musica della danza del Ballo delle Ingrate.
description: Philomusica on-line, Vol 17, N° 1 (2018)
Getting to Know You
Creators: name: Trimmer, Julia
name: Morris, Carol Minton
Publisher: name: VIVO
Year: 2015
Subjects: subject: Information Systems
subject: FOS: Computer and information sciences
subject: Library and Information Studies
subject: FOS: Media and communications

description: Poster: Telling VIVO Stories introduces people, projects, ideas and innovation.
Projective sets, intuitionistically
Creators: name: Veldman, Wim
Publisher: name: arXiv
Year: 2011
Subjects: subject: Logic (math.LO)
subject: FOS: Mathematics
subject: 03F55, 03E15, 04A15

description: We study `definable' subsets of Baire space $\mathcal{N}$. The logic of our arguments is intuitionistic and we use L.E.J.~Brouwer's Thesis on bars in $\mathcal{N}$ and his continuity axioms. We avoid the operation of taking the complement of a subset of $\mathcal{N}$. A subset of $\mathcal{N}$ is $\mathbfΣ^1_1$ or: analytic if it is the projection of a closed subset of $\mathcal{N}$. Important $\mathbfΣ^1_1$ set are the set of the codes of all closed and located subsets of $\mathcal{N}$ that are positively uncountable and the set of the codes of all located and closed subsets of $\mathcal{N}$ containing at least one member coding a (positively) infinite subset of $\mathbb{N}$. A subset of $\mathcal{N}$ is strictly analytic if it is the projection of a closed and located subset of $\mathcal{N}$. Brouwer's Thesis on bars in $\mathcal{N}$ proves separation and boundedness theorems for strictly analytic subsets of $\mathcal{N}$. A subset of $\mathcal{N}$ is $\mathbfΠ^1_1$ or: co-analytic if it is the co-projection of an open subset of $\mathcal{N} \times \mathcal{N}=\mathcal{N}$. There is no symmetry between analytic and co-analytic sets like in classical descriptive set theory. An important $\mathbfΠ^1_1$ set is the set of the codes of all closed and located subsets of $\mathcal{N}$ all of whose members code an almost-finite subset of $\mathbb{N}$. The set of the codes of closed and located subsets of $\mathcal{N}$ that are almost-countable, or, equivalently, \{reducible in Cantor's sense, is treated at some length. This set is probably not $\mathbfΠ^1_1$. The projective hierarchy collapses: every (positively) projective set is $\mathbfΣ^1_2$: the projection of a co-analytic subset of $\mathcal{N}$.
description: 82 pages
title: Ocean deoxygenation: Everyone’s problem
title: Causes, impacts, consequences and solutions
titleType: Subtitle
title: Ocean deoxygenation: Everyone’s problem
titleType: AlternativeTitle
Creators: name: Laffoley, Daniel D'A.‏
name: Baxter, John M.
Publisher: name: Union internationale pour la conservation de la nature
Year: 2019

description: Existe une version résumée en format PDF et imprimée
Spatial birth-and-death processes with a finite number of particles
Creators: name: Bezborodov, Viktor
name: Di Persio, Luca
Publisher: name: arXiv
Year: 2015
Subjects: subject: Probability (math.PR)
subject: FOS: Mathematics
subject: 60K35, 60J25

description: Spatial birth-and-death processes with time dependent rates are obtained as solutions to certain stochastic equations. The existence, uniqueness, uniqueness in law and the strong Markov property of unique solutions are proven when the integral of the birth rate over $\mathbb{R} ^ \mathrm{d}$ grows not faster than linearly with the number of particles of the system. Martingale properties of the constructed process provide a rigorous connection to the heuristic generator. We also study pathwise behavior of an aggregation model. The probability of extinction and the growth rate of the number of particles conditioning on non-extinction are estimated.
description: Minor changes and improvements; journal ref added. arXiv admin note: text overlap with arXiv:1502.06783
Bijections in de Bruijn Graphs
Creators: name: Rukavicka, Josef
Publisher: name: arXiv
Year: 2017
Subjects: subject: Combinatorics (math.CO)
subject: FOS: Mathematics
subject: 05C30, 05A19

description: A T-net of order $m$ is a graph with $m$ nodes and $2m$ directed edges, where every node has indegree and outdegree equal to $2$. (A well known example of T-nets are de Bruijn graphs.) Given a T-net $N$ of order $m$, there is the so called "doubling" process that creates a T-net $N^*$ from $N$ with $2m$ nodes and $4m$ edges. Let $|X|$ denote the number of Eulerian cycles in a graph $X$. It is known that $| N^*|=2^{m-1}|N|$. In this paper we present a new proof of this identity. Moreover we prove that $|N|\leq 2^{m-1}$. Let $Θ(X)$ denote the set of all Eulerian cycles in a graph $X$ and $S(n)$ the set of all binary sequences of length $n$. Exploiting the new proof we construct a bijection $Θ(N)\times S(m-1)\rightarrow Θ(N^*)$, which allows us to solve one of Stanley's open questions: we find a bijection between de Bruijn sequences of order $n$ and $S(2^{n-1})$.
Hadronic molecules
Creators: name: Guo, Feng-Kun
name: Hanhart, Christoph
name: Meißner, Ulf-G.
name: Wang, Qian
name: Zhao, Qiang
name: Zou, Bing-Song
Publisher: name: arXiv
Year: 2017
Subjects: subject: High Energy Physics - Phenomenology (hep-ph)
subject: High Energy Physics - Experiment (hep-ex)
subject: High Energy Physics - Lattice (hep-lat)
subject: Nuclear Theory (nucl-th)
subject: FOS: Physical sciences

description: A large number of experimental discoveries especially in the heavy quarkonium sector that did not at all fit to the expectations of the until then very successful quark model led to a renaissance of hadron spectroscopy. Among various explanations of the internal structure of these excitations, hadronic molecules, being analogues of light nuclei, play a unique role since for those predictions can be made with controlled uncertainty. We review experimental evidences of various candidates of hadronic molecules, and methods of identifying such structures. Nonrelativistic effective field theories are the suitable framework for studying hadronic molecules, and are discussed in both the continuum and finite volumes. Also pertinent lattice QCD results are presented. Further, we discuss the production mechanisms and decays of hadronic molecules, and comment on the reliability of certain assertions often made in the literature.
description: Corrected several entries in Table VI for the contact terms for the S-wave interactions between the spin multiplets of D1 and Dbar; 67 pages, 23 figures
The Electronic Notebook Ontology
Creators: name: Chalk, Stuart
Publisher: name: VIVO
Year: 2015
Subjects: subject: Information Systems
subject: FOS: Computer and information sciences
subject: Library and Information Studies
subject: FOS: Media and communications

description: Science is rapidly being brought into the electronic realm and electronic laboratory notebooks (ELN) are a big part of this activity. The representation of the scientific process in the context of an ELN is an important component to making the data recorded in ELNs semantically integrated.

This presentation will outline initial developments of an Electronic Notebook Ontology (ENO) that will help tie together the ExptML ontology, HCLS Community Profile data descriptions, and the VIVO-ISF ontology.
Can the graviton have a large mass near black holes?
Creators: name: Zhang, Jun
name: Zhou, Shuang-Yong
Publisher: name: arXiv
Year: 2017
Subjects: subject: General Relativity and Quantum Cosmology (gr-qc)
subject: High Energy Astrophysical Phenomena (astro-ph.HE)
subject: High Energy Physics - Phenomenology (hep-ph)
subject: High Energy Physics - Theory (hep-th)
subject: FOS: Physical sciences

description: The mass of the graviton, if nonzero, is usually considered to be very small, e.g. of the Hubble scale, from several observational constraints. In this paper, we propose a gravity model where the graviton mass is very small in the usual weak gravity environments, below all the current graviton mass bounds, but becomes much larger in the strong gravity regime such as a black hole's vicinity. For black holes in this model, significant deviations from general relativity emerge very close to the black hole horizon and alter the black hole quasi-normal modes, which can be extracted from the ringdown waveform of black hole binary mergers. Also, the enhancement of the graviton mass near the horizon can result in echoes in the late time ringdown, which can be verified in the upcoming gravitational wave observations of higher sensitivity.
description: 6 pages, 4 figures, v2 matches version published in PRD
Matrix Completion Methods for Causal Panel Data Models
Creators: name: Athey, Susan
name: Bayati, Mohsen
name: Doudchenko, Nikolay
name: Imbens, Guido
name: Khosravi, Khashayar
Publisher: name: arXiv
Year: 2017
Subjects: subject: Statistics Theory (math.ST)
subject: Econometrics (econ.EM)
subject: FOS: Mathematics
subject: FOS: Economics and business

description: In this paper we study methods for estimating causal effects in settings with panel data, where some units are exposed to a treatment during some periods and the goal is estimating counterfactual (untreated) outcomes for the treated unit/period combinations. We propose a class of matrix completion estimators that uses the observed elements of the matrix of control outcomes corresponding to untreated unit/periods to impute the "missing" elements of the control outcome matrix, corresponding to treated units/periods. This leads to a matrix that well-approximates the original (incomplete) matrix, but has lower complexity according to the nuclear norm for matrices. We generalize results from the matrix completion literature by allowing the patterns of missing data to have a time series dependency structure that is common in social science applications. We present novel insights concerning the connections between the matrix completion literature, the literature on interactive fixed effects models and the literatures on program evaluation under unconfoundedness and synthetic control methods. We show that all these estimators can be viewed as focusing on the same objective function. They differ solely in the way they deal with identification, in some cases solely through regularization (our proposed nuclear norm matrix completion estimator) and in other cases primarily through imposing hard restrictions (the unconfoundedness and synthetic control approaches). The proposed method outperforms unconfoundedness-based or synthetic control estimators in simulations based on real data.
description: 42 pages, 10 figures
VIVO in a networked research ecosystem
Creators: name: Wang, Jing
name: Elsborg, Don
name: Khan, Huda
name: Eichmann, David
name: Meeks, Eric
Publisher: name: VIVO
Year: 2015
Subjects: subject: Information Systems
subject: FOS: Computer and information sciences
subject: Library and Information Studies
subject: FOS: Media and communications

description: One of the goals stated in the VIVO Strategic Plan 2015-2016 is to promote a more open and networked research ecosystem (Goal 2). As more systems become interconnected, the demand for systems integration and interoperability increases but the problems become more complex.

System of systems (SoS) refers to a set of operationally and managerially independent systems interacting with each other to provide capabilities which cannot be accomplished by any single system. SoS has its own characteristics and challenges, such as emergent behavior and evolutionary development. SoS principles and methods can be applied to the networked research ecosystem and can be helpful in identifying the pain points and opportunities as well as the requirements for future systems integration across VIVO instances and between VIVO and complementary platforms.

In this presentation we will summarize preliminary work that has been done in a System of Systems approach for a network of VIVOs; review the necessary architecture components; discuss the pros and cons of different integration styles and patterns; identify challenges and opportunities; and highlight some of the SoS level integration requirements for VIVO to function optimally in a networked research ecosystem.

.
Intrinsic Dimension of Geometric Data Sets
Creators: name: Hanika, Tom
name: Schneider, Friedrich Martin
name: Stumme, Gerd
Publisher: name: arXiv
Year: 2018
Subjects: subject: Artificial Intelligence (cs.AI)
subject: Machine Learning (cs.LG)
subject: Metric Geometry (math.MG)
subject: FOS: Computer and information sciences
subject: FOS: Mathematics
subject: I.2.6
subject: 03G10 51F99 68P05 68T01

description: The curse of dimensionality is a phenomenon frequently observed in machine learning (ML) and knowledge discovery (KD). There is a large body of literature investigating its origin and impact, using methods from mathematics as well as from computer science. Among the mathematical insights into data dimensionality, there is an intimate link between the dimension curse and the phenomenon of measure concentration, which makes the former accessible to methods of geometric analysis. The present work provides a comprehensive study of the intrinsic geometry of a data set, based on Gromov's metric measure geometry and Pestov's axiomatic approach to intrinsic dimension. In detail, we define a concept of geometric data set and introduce a metric as well as a partial order on the set of isomorphism classes of such data sets. Based on these objects, we propose and investigate an axiomatic approach to the intrinsic dimension of geometric data sets and establish a concrete dimension function with the desired properties. Our model for data sets and their intrinsic dimension is computationally feasible and, moreover, adaptable to specific ML/KD-algorithms, as illustrated by various experiments.
description: v3: 33 pages, 3 figures, 2 tables
Generalizing Parallel Replica Dynamics: Trajectory Fragments, Asynchronous Computing, and PDMPs
Creators: name: Aristoff, David
Publisher: name: arXiv
Year: 2018
Subjects: subject: Numerical Analysis (math.NA)
subject: FOS: Mathematics
subject: 65C05, 65C20, 65C40, 65Y05, 82C80

description: We study the Parallel Replica Dynamics in a general setting. We introduce a trajectory fragment framework that can be used to design and prove consistency of Parallel Replica algorithms for generic Markov processes. We use our framework to formulate a novel condition that guarantees an asynchronous algorithm is consistent. Exploiting this condition and our trajectory fragment framework, we present new synchronous and asynchronous Parallel Replica algorithms for piecewise deterministic Markov processes.
description: 32 pages, 9 figures
Optimizing weighted ensemble sampling of steady states
Creators: name: Aristoff, David
name: Zuckerman, Daniel M.
Publisher: name: arXiv
Year: 2018
Subjects: subject: Numerical Analysis (math.NA)
subject: FOS: Mathematics
subject: 65C05, 65C20, 65C40, 65Y05, 82C80

description: We propose parameter optimization techniques for weighted ensemble sampling of Markov chains in the steady-state regime. Weighted ensemble consists of replicas of a Markov chain, each carrying a weight, that are periodically resampled according to their weights inside of each of a number of bins that partition state space. We derive, from first principles, strategies for optimizing the choices of weighted ensemble parameters, in particular the choice of bins and the number of replicas to maintain in each bin. In a simple numerical example, we compare our new strategies with more traditional ones and with direct Monte Carlo.
description: 28 pages, 5 figures
Traces of performance in early fifteenth-century musical attributions
Creators: name: Marchi, Lucia
Publisher: name: Pavia University Press - Edizioni dell'Università degli Studi di Pavia
Year: 2020

description: The manuscript Chantilly, Bibliothèque du Château, ms. 564 presents some intriguing cases of unusually-placed attributions – either in one of the voices, or in the text residuum. Re-evaluating Allan Atlas’ hypothesis that double attributions could indicate a shared responsibility, I suggest that one of the preserved names indicates not the composer, but the performer of the pieces. Sources with traces of performances are known in later times – for example the Palestrina autograph (Rome, Archivio di San Giovanni in Laterano, cod. 59) in which the singers’ names are marked at the beginning of each voice. Thus, the Chantilly manuscript could give a unique glimpse at the performance of late fourteenth-century repertory, and the complex relationship between composers and performers. The codex contains the quintessential repertory of the so-called Ars subtilior, a style of rhythmic and melodic complexity normally associated with written culture. The possibility that its circulation could be associated with jongleurs sheds a different light on our understanding of this music.
description: Philomusica on-line, Vol 18, N° 1 (2019)
The Tax Cuts and Jobs Act Would Have Lowered Average Income Tax Rates for Farm Households between 2016 and 2017
Creators: name: Williamson, James
name: Williamson, James
Publisher: name: Unknown
Year: 2019
Subjects: subject: Farm Management
subject: Financial Economics
subject: Labor and Human Capital
subject: Tax Cuts and Jobs Act (TCJA)
subject: Agricultural Resource Management Survey (ARMS)
subject: family farms

description: The Tax Cuts and Jobs Act (TCJA) of 2017 made significant changes, albeit temporary ones in many cases, to the Federal income tax system. ERS researchers estimated that, had the TCJA been in effect in 2016, family farm households would have faced an average effective tax rate of 13.9 percent—compared to the actual 17.2 percent effective tax rate that year. Had the TCJA been in effect in 2017, the average effective tax rate for family farm households would have been more than a percentage point lower than in 2016 (12.8 percent).
title: La mer d'eau douce = El mar dulce
title: (tome/tomo 1)
titleType: Subtitle
title: La mer d'eau douce = El mar dulce
titleType: AlternativeTitle
Creators: name: Payró, Roberto Jorge
Publisher: name: Bibliothèque numérique romande
Year: 2020

description: E-book bilingue français-espagnol
Quantized Scalar Fields in Curved Spacetime Background of Thick Brane
Creators: name: Wang, Jian
name: Liu, Yu-Xiao
Publisher: name: arXiv
Year: 2018
Subjects: subject: High Energy Physics - Theory (hep-th)
subject: General Relativity and Quantum Cosmology (gr-qc)
subject: FOS: Physical sciences

description: In this paper, we adopt the method of quantum fields in curved spacetime to quantize a free scalar matter field in the braneworld background whose warped factor is of the form that could generate Pöschl-Teller potential. Then we consider the interaction between the scalar field $ϕ(x)$ and a classical scalar source $ρ(x)$ with the form $\mathcal{H}_I=\sqrt{-g}\tilde{g}ρ(x)ϕ(x)$. The corresponding S-matrix is given and the number of particles generated by the source is obtained. Furthermore, we get the {particle numbers} in the cases that only ground state mode of the field could be detected and both the ground and first exited states could be detected, respectively. Finally, by the particle number density we define, we show how the extra dimension makes a difference specifically by the excited modes.
description: 8 pages, no figure
A working prototype for vizualizing VIVO linked open data - toward a new VIVO LOD browser
Creators: name: Elsborg, Don
Publisher: name: VIVO
Year: 2015
Subjects: subject: Information Systems
subject: FOS: Computer and information sciences
subject: Library and Information Studies
subject: FOS: Media and communications

description: VIVO intially shipped with flash vizualizations which were limited to viewing particular subsets of local VIVO data. Other similar profiling applicaitons have similar visualizations which have a limited range of data which can be view.

This working prototype will actively demonstrate web based javascript browsing of VIVO data. All VIVO data. VIVO data which can cross multiple web sites, domains, and institutions. The visualization utilizes standard VIVO jsonld renderings of individuals and classgroups which VIVO can deliver "out of the box", hence additional services like SPARQL endpoints are not required.

The talk will explore the funcationality required to view data properties and classes, display VIVO images, utilize various graph displays such as sunburts and radial graphs. What VIVO data should be displayed to an end user. It's important to show real meaningful information in a simple manner that's easy to digest. How and where should this be done? What was required by the javascript developer to accomodate the VIVO model?

The prototype is a work in progress. The source code will be freely available and can be used to vizualize data in any VIVO system.
Examining the differences between scientific team types
Creators: name: Agniel, Denis
name: Weber, Griffin
Publisher: name: VIVO
Year: 2015
Subjects: subject: Information Systems
subject: FOS: Computer and information sciences
subject: Library and Information Studies
subject: FOS: Media and communications

description: Introduction: There may be fundamental differences between the way that scientific research gets done by teams of different types. We seek to understand the differences between teams of three different types: biomedical teams, non-biomedical teams, and interdisciplinary teams. In particular, we are interested in examining the impact of team type on translation into clinical practice. We used the Scopus bibliographic database of over 54 million publications and over 28 million authors to explore these areas.

Defining team types: We defined a researcher as a biomedical researcher if over 50% of their publications were identified as having a PubMed ID in Scopus. Then biomedical teams were defined as teams with all biomedical researchers, and non-biomedical teams were defined as those with all non-biomedical researchers. Interdisciplinary teams were those that had a mix of biomedical and non-biomedical researchers.

Team type characteristics: We examined the behavior of each team type. Publications were classified by Scopus according to the subject matter of the journal in which they were published. We identified which subject areas were most likely to publish research by interdisciplinary teams. We also examined the breakdown of team types by number of authors, finding that the majority of publications with fewer authors were non-biomedical, but as the number of authors increases articles tend to be more biomedical and interdisciplinary. More than 540 million citations were available to be analyzed, and we examined the citation rate for each article. Biomedical teams were more likely to be cited regardless of the subject matter or the number of authors.

Measuring translation impact by team type: We finally measure the impact of team type on translation according to the Triangle of Biomedicine, which maps the 22 million biomedical journal articles in PubMed to a triangle, whose corners represent research related to animals, cells and molecules, and humans. We examined where on the triangle articles of each team type fell on the Triangle according to the subject matter of the article (see figure). We also modeled the impact of team type on the time until translation.
Research Networking Systems: A data treasure trove for creating strategic research initiatives and analyses
Creators: name: Allee, Ruth
name: Cleto, Cynthia
name: Fransen, Jan
name: McCready, Kate
name: Sharlini Sankaran
name: Trimmer, Julia
Publisher: name: VIVO
Year: 2015
Subjects: subject: Information Systems
subject: FOS: Computer and information sciences
subject: Library and Information Studies
subject: FOS: Media and communications

description: Research Networking Systems (RNS) were primarily established to stimulate collaboration, which may cross disciplines, sectors, institutional or even national boundaries; and studies have shown that collaborations that cross such boundaries, may increase citation rates by as much as a two-fold factor. Within North America, a critical mass of institutions has been able to invigorate their research programs by implementing RNS. However, once implemented, how does the institution utilize the system and the data treasure trove it contains to facilitate impactful research initiatives? This session brings together the project leads from Duke University, University of Minnesota, Northwestern University, and REACH NC (a 20-institution, North Carolina state-wide RNS) who have implemented Pure Experts Portals, Elsevier’s RNS. They will share their perspective on how their organizations have utilized RNS, and in certain cases repurposed data to pursue further analysis and visualizations that address strategic and diverse organizational needs. What are their most impactful use cases, and how can data from RNS facilitate these use cases? We will present the use cases below and more:

1. Using RNS to enhance and expand upon contextual data of other Northwestern sites – ex. Global Research and Undergraduate Research Opportunities, and graduate program sites

2. Visualizing collaborations between the U of Minnesota’s College Biological Sciences (CBS) and College of Food Ag Natural Sciences (CFANS)

3. Identifying expertise and forming partnerships to advise on collaborations between diverse sectors including academic researchers, the economic development community, the military and defense community, and private businesses in North Carolina using REACH NC.

4. Provisioning publications for VIVO, for department websites, and for reporting and analytics at Duke University
Degree bounds for Gröbner bases of modules
Creators: name: Liang, Yihui
Publisher: name: arXiv
Year: 2019
Subjects: subject: Commutative Algebra (math.AC)
subject: FOS: Mathematics
subject: 13B25, 13P10

description: Let $F$ be a non-negatively graded free module over a polynomial ring $\mathbb{K}[x_1,\dots,x_n]$ generated by $m$ basis elements. Let $M$ be a submodule of $F$ generated by elements in $F$ with degrees bounded by $D$ and dim $F/M$=$r$. We prove that if $M$ is graded, the degree of the reduced Gröbner basis of $M$ for any term order is bounded by $2\left[1/2((Dm)^{n-r}m+D) \right]^{2^{r-1}}$. If $M$ is not graded, the bound is $2\left[1/2((Dm)^{(n-r)^2}m+D) \right]^{2^{r}}$. This is a generalization of Dubé(1990) and Mayr-Ritscher(2013)'s bounds for ideals in a polynomial ring.
description: There is an error in the proof of lemma 49 in version 2. To replace it, we quote a similar lemma with a larger bound (lemma 39 in this version)
Exploring Structural Sparsity of Deep Networks via Inverse Scale Spaces
Creators: name: Fu, Yanwei
name: Liu, Chen
name: Li, Donghao
name: Zhong, Zuyuan
name: Sun, Xinwei
name: Zeng, Jinshan
name: Yao, Yuan
Publisher: name: arXiv
Year: 2019
Subjects: subject: Machine Learning (cs.LG)
subject: Dynamical Systems (math.DS)
subject: Optimization and Control (math.OC)
subject: Machine Learning (stat.ML)
subject: FOS: Computer and information sciences
subject: FOS: Mathematics

description: The great success of deep neural networks is built upon their over-parameterization, which smooths the optimization landscape without degrading the generalization ability. Despite the benefits of over-parameterization, a huge amount of parameters makes deep networks cumbersome in daily life applications. Though techniques such as pruning and distillation are developed, they are expensive in fully training a dense network as backward selection methods, and there is still a void on systematically exploring forward selection methods for learning structural sparsity in deep networks. To fill in this gap, this paper proposes a new approach based on differential inclusions of inverse scale spaces, which generate a family of models from simple to complex ones along the dynamics via coupling a pair of parameters, such that over-parameterized deep models and their structural sparsity can be explored simultaneously. This kind of differential inclusion scheme has a simple discretization, dubbed Deep structure splitting Linearized Bregman Iteration (DessiLBI), whose global convergence in learning deep networks could be established under the Kurdyka-Lojasiewicz framework. Experimental evidence shows that our method achieves comparable and even better performance than the competitive optimizers in exploring the sparse structure of several widely used backbones on the benchmark datasets. Remarkably, with early stopping, our method unveils `winning tickets' in early epochs: the effective sparse network structures with comparable test accuracy to fully trained over-parameterized models, that are further transferable to similar alternative tasks. Furthermore, our method is able to grow networks efficiently with adaptive filter configurations, demonstrating a good performance with much less computational cost. Codes and models can be downloaded at {https://github.com/DessiLBI2020/DessiLBI}.
description: This is the journal extension version of the ICML conference paper, "DessiLBI: Exploring Structural Sparsity of Deep Networks via Differential Inclusion Paths"
Tackling Silos and Cultures: VIVO Outreach and Engagement at Duke University
Creators: name: Lamont Cannon
name: Trimmer, Julia
Publisher: name: VIVO
Year: 2015
Subjects: subject: Information Systems
subject: FOS: Computer and information sciences
subject: Library and Information Studies
subject: FOS: Media and communications

description: What’s the best way to reach faculty members? Most colleges and universities are commonly siloed across schools and departments, so it is a major challenge to effectively communicate with faculty to inform and educate them consistently on any topic. Cultures across schools can be very different -- what is important can vary greatly across disciplines. In addition, we found that by talking with Duke school communicators, administrators, and other teams who have implemented systems in the past, there is no single “best way” in which to consistently reach all faculty.

Given these issues and challenges, the Scholars@Duke team took a multi-pronged approach to engage our faculty concerning our VIVO implementation (Scholars@Duke). In this presentation, we will discuss our methods of outreach and how we interacted with faculty, power users, data consumers, and other Scholars@Duke stakeholders. We will discuss the successes, as well as, the “not so happy” reactions of faculty with the hope that our methods and strategies help other VIVO institutions add to their “outreach toolbox” at their own institutions.
An ergodic theorem for the weighted ensemble method
Creators: name: Aristoff, David
Publisher: name: arXiv
Year: 2019
Subjects: subject: Numerical Analysis (math.NA)
subject: Mathematical Physics (math-ph)
subject: Probability (math.PR)
subject: FOS: Mathematics
subject: FOS: Physical sciences
subject: 65C05, 65C35, 65C40

description: We study weighted ensemble, an interacting particle method for sampling distributions of Markov chains that has been used in computational chemistry since the 1990s. Many important applications of weighted ensemble require the computation of long time averages. We establish the consistency of weighted ensemble in this setting by proving an ergodic theorem for time averages. As part of the proof, we derive explicit variance formulas that could be useful for optimizing the method.
description: 21 pages, 1 figure
Topological Formulae for the Zeroth Cohomology of Line Bundles on del Pezzo and Hirzebruch Surfaces
Creators: name: Brodie, Callum R.
name: Constantin, Andrei
name: Deen, Rehan
name: Lukas, Andre
Publisher: name: arXiv
Year: 2019
Subjects: subject: Algebraic Geometry (math.AG)
subject: High Energy Physics - Theory (hep-th)
subject: FOS: Mathematics
subject: FOS: Physical sciences

description: We show that the zeroth cohomology of effective line bundles on del Pezzo and Hirzebruch surfaces can always be computed in terms of a topological index.
description: 9 pages
An Inexact Augmented Lagrangian Framework for Nonconvex Optimization with Nonlinear Constraints
Creators: name: Sahin, Mehmet Fatih
name: Eftekhari, Armin
name: Alacaoglu, Ahmet
name: Latorre, Fabian
name: Cevher, Volkan
Publisher: name: arXiv
Year: 2019
Subjects: subject: Optimization and Control (math.OC)
subject: FOS: Mathematics

description: We propose a practical inexact augmented Lagrangian method (iALM) for nonconvex problems with nonlinear constraints. We characterize the total computational complexity of our method subject to a verifiable geometric condition, which is closely related to the Polyak-Lojasiewicz and Mangasarian-Fromowitz conditions. In particular, when a first-order solver is used for the inner iterates, we prove that iALM finds a first-order stationary point with $\tilde{\mathcal{O}}(1/ε^4)$ calls to the first-order oracle. If, in addition, the problem is smooth and a second-order solver is used for the inner iterates, iALM finds a second-order stationary point with $\tilde{\mathcal{O}}(1/ε^5)$ calls to the second-order oracle, which matches the known theoretical complexity result in the literature. We also provide strong numerical evidence on large-scale machine learning problems, including the Burer-Monteiro factorization of semidefinite programs, and a novel nonconvex relaxation of the standard basis pursuit template. For these examples, we also show how to verify our geometric condition.
The New Research Data Mechanics
Creators: name: SIMON PORTER
Publisher: name: VIVO
Year: 2015
Subjects: subject: Information Systems
subject: FOS: Computer and information sciences
subject: Library and Information Studies
subject: FOS: Media and communications

description: Over the past 10 years, research systems have evolved from systems that focused on how to structure and record information on research, to systems capable of allowing significant insights to be derived based upon years of high quality information. In 2015, the maturity of the information now collected within many Current Research Information Systems, and the insights that this can provide is of equal or greater value than the insights that could be gleaned from established externally provided research metrics platforms alone. The ability to intersect these external and internal worlds provides new levels of strategic insight not previously available.

With the addition of platforms that track altmetrics, and their ability to connect university publications data with a constant flow of real time attention level metrics, an image of a dynamic network of systems emerges, connected together by ever turning ‘cogs’ pushing and translating information. Add to this, the success of ORCID as researcher identifier infrastructure across systems and it becomes possible to extend this network back from the systems that track and record research information, right to the platforms through which research knowledge is created.

The ‘Mechanics’ of this network of systems is more than just getting the ‘plumbing’ right. As research information moves through the network, its audience and purpose changes, the requirements for contextual metadata can also change.

Reflecting on the connected implementations of Symplectic, Figshare, and Altmetric for Institutions at the University of Melbourne, this presentation till explore the concept of a New Research Data Mechanics, and VIVO’s role within it.
Superconformal surfaces in four dimensions
Creators: name: Bianchi, Lorenzo
name: Lemos, Madalena
Publisher: name: arXiv
Year: 2019
Subjects: subject: High Energy Physics - Theory (hep-th)
subject: FOS: Physical sciences

description: We study the constraints of superconformal symmetry on codimension two defects in four-dimensional superconformal field theories. We show that the one-point function of the stress tensor and the two-point function of the displacement operator are related, and we discuss the consequences of this relation for the Weyl anomaly coefficients as well as in a few examples, including the supersymmetric Rényi entropy. Imposing consistency with existing results, we propose a general relation that could hold for sufficiently supersymmetric defects of arbitrary dimension and codimension. Turning to $\mathcal{N}=(2,2)$ surface defects in $\mathcal{N} \geqslant 2$ superconformal field theories, we study the associated chiral algebra. We work out various properties of the modules introduced by the defect in the original chiral algebra. In particular, we find that the one-point function of the stress tensor controls the dimension of the defect identity in chiral algebra, providing a novel way to compute it, once the defect identity is identified. Studying a few examples, we show explicitly how these properties are realized.
description: 60 pages; v3: matches published version