University of Notre Dame

Search CurateND

Search criteria:

Department or Unit: University of Notre Dame remove × Type of Work: Dataset OR Report OR Presentation remove ×
Clear all

List of files deposited in CurateND that match your search criteria

  • Creator(s):
    Svend-Erik Skaaning, Kyle L. Marquardt, Johannes von Römer, Eitan Tzelgov, Brigitte Seim, Allen Hicken, David Altman, Michael Bernhard, M. Steven Fish, Yi-ting Wang, John Gerring, Jan Teorell, Michael Coppedge, Lisa Gastaldi, Pamela Paxton, Rachel Sigman, Staffan I. Lindberg, Carl Henrik Knutsen, Kelly McMann, Aksel Sundtröm, Agnes Cornell, Daniel Ziblatt, Anna Lührmann, Adam Glynn, Jeffrey Staton, Daniel Pemstein, Luca Uberti, Haakon Gjerløw, Valeriya Mechkova, Tore Wig
    Description:

    Data for Varieties of Democracy Project. Version 10 of these files.

    Date Created:
    2020-01-01
    Record Visibility:
    Public
  • Creator(s):
    Jonathan Hauenstein, Samantha Sherman
    Description:

    Synthesis problems for linkages in kinematics often yield large structured parameterized polynomial systems which generically have far fewer solutions than traditional upper bounds would suggest. This paper describes statistical models for estimating the generic number of solutions of such parameterized polynomial systems. The new approach extends previous work on success ratios of parameter homotopies to using monodromy loops as well as the addition of a trace test that provides a stopping…

    Date Created:
    2020-04-21
    Record Visibility:
    Public
  • Author(s):
    Melissa Grupen-Shemansky
    Abstract:

    This report was developed under a DARPA contract for topic Atoms to products. Two primary goals were addressed in this project. In Focus Area 1 (Assembly Development) the goal was to assemble a 10 μm microelement consisting of an anisotropic lattice of ~5000 (~100 nm) dielectric nanoparticles (NPs) embedded in a polymer electrolyte. Successful completion of the objectives of this goal required that NPs be spatially located with nm-scale precision in a polymer matrix at scales up to ~10 μm (to…

    Date Created:
    2020-04-03
    Record Visibility:
    Public
    Resource Type
    Report
  • Creator(s):
    Jonathan Hauenstein, Margaret Regan
    Description:

    Polynomials which arise via elimination can be difficult to compute explicitly. By using a pseudo-witness set, we develop an algorithm to explicitly compute the restriction of a polynomial to a given line. The resulting polynomial can then be used to evaluate the original polynomial and directional derivatives along the line at any point on the given line. Several examples are used to demonstrate this new algorithm including examples of computing the critical points of the discriminant locu…

    Date Created:
    2020-03-27
    Record Visibility:
    Public
  • Author(s):
    Peggy Griesinger, Mikala Narlock, Jeremy Friesen, Hanna Bertoldi
    Abstract:

    The presenters will outline efforts to create a unified discovery platform for digital collections from libraries, archives, and museums. They will guide attendees through the process of designing harmonized metadata profiles for these related but very different domains, including solutions for conciliating controlled vocabularies. They will discuss the software stack’s approach to moving the harmonized data from varied back-end systems to a singular point from which they build out multiple s…

    Date Created:
    2020-03-12
    Record Visibility:
    Public
    Resource Type
    Presentation
  • Creator(s):
    Jonathan Hauenstein, Martin Helmer
    Description:

    Alt’s problem, formulated in 1923, is to count the number of four-bar linkages whose coupler curve interpolates nine general points in the plane. This problem can be phrased as counting the number of solutions to a system of polynomial equations which was first solved numerically using homotopy continuation by Wampler, Morgan, and Sommese in 1992. Since there is still not a proof that all solutions were obtained, we consider upper bounds for Alt’s problem by counting the number of sol…

    Date Created:
    2020-03-03
    Record Visibility:
    Public
  • Creator(s):
    Matthew Sisk
    Description:

    This is the data table from Appendix A of Sisk, ML (2011) “Settlement and Site Location in the Middle and Upper Paleolithic of the Vézère Valley, France” Ph.D. Dissertation, Stony Brook University, Department of Anthropology. It corrects errors present in the original publication

    Date Created:
    2020-02-12
    Record Visibility:
    Public
  • Creator(s):
    sgesing
    Description:

    In the Summer/Fall of 2017, participants were invited to contribute answers for the PresQT research study, entitled “Data and Software Preservation Quality Tool Needs Assessment” related to the PresQT Project, University of Notre Dame Study # 17-04-3850 DOI 10.17605/OSF.IO/D3JX7. Data Collection closed Sept 1, 2017 at 5 PM EDT.

    Participants’ answers to a series of questions related to their past practice, and anticipated future needs as researchers and/or software developers …

    Date Created:
    2020-01-27
    Record Visibility:
    Public
  • Creator(s):
    Jonathan Hauenstein
    Description:

    Many algorithms for determining properties of real algebraic or semi-algebraic sets rely upon the ability to compute smooth points. Existing methods to compute smooth points on semi-algebraic sets use symbolic quantifier elimination tools. In this paper, we present a simple algorithm based on computing the critical points of some well-chosen function that guarantees the computation of smooth points in each connected compact component of a real (semi)-algebraic set. Our technique is intuitive …

    Date Created:
    2020-01-18
    Record Visibility:
    Public
  • Author(s):
    Michael Hildreth, Natalie Meyers
    Abstract:

    The FAIR Hackathon Workshop for Mathematics and the Physical Sciences (MPS) February 27-28, 2019 in Alexandria, Virginia brought together forty-four stakeholders in the physical sciences community to share skills, tools and techniques to FAIRify research data. As one of the first efforts of its kind in the US, the workshop offered participants a way to engage with FAIR principles (Findable, Accessible, Interoperable and Reusable) Data and metrics in the context of a hackathon. The workshop wa…

    Date Created:
    2020-01-05
    Record Visibility:
    Public
    Resource Type
    Report
  • Author(s):
    Cheri Smith
    Abstract:

    In recent years, the Hesburgh Libraries at the University of Notre Dame have developed and sustained a partnership with our campus student wellness center (The McDonald Center for Student Well-Being - aka “McWell”) that includes several programs designed to promote overall physical, mental and emotional health for our users and our library staff. Our partnership began in 2016 with the introduction of McWell’s “Let’s Talk” service (https://ucc.nd.edu/lets-talk/), which is a program d…

    Date Created:
    2019-12-18
    Record Visibility:
    Public
    Resource Type
    Presentation
  • 12

    Presentation

    Author(s):
    Mikala Narlock
    Abstract:

    Since the publication of the “FAIR Guiding Principles for scientific data management and stewardship” (Wilkinson et al., 2016), a wide-variety of sciences, mathematics, and other data-intensive fields have utilized the principles to promote reusability of data and ensure the long-term preservation of valuable outputs. In particular, domain experts and leading researchers have organized hackathons and sprints to define FAIR for their specific domains. Similarly, these domain experts have creat…

    Date Created:
    2019-11-10
    Record Visibility:
    Public
    Resource Type
    Presentation