Search criteria:
List of files deposited in CurateND that match your search criteria

 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:
 20200421
 Record Visibility:
 Public

 Creator(s):
 Jonathan Hauenstein, Margaret Regan
 Description:
Polynomials which arise via elimination can be difficult to compute explicitly. By using a pseudowitness 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:
 20200327
 Record Visibility:
 Public

3
Dataset
 Creator(s):
 Mark Suhovecky
 Description:
This dataset contains the raw and sanitized data about Curate privacy settings, collected April 2nd, 2020 from the CurateND anotation test server, along with the R code used to convert the raw data to the sanitized data. The data is being used as part of INF 7491, a graduatelevel data analysis course held Winter Semester 2020 at Wayne State University.
The raw data consists of a RDF entries for every attribute in every CurateND pid, stored as RDF triples. The processed data is stored a an …
 Date Created:
 20200324
 Record Visibility:
 Public

 Creator(s):
 Jonathan Hauenstein, Martin Helmer
 Description:
Alt’s problem, formulated in 1923, is to count the number of fourbar 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:
 20200303
 Record Visibility:
 Public

5
Dataset
 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:
 20200212
 Record Visibility:
 Public

6
Dataset
 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 # 17043850 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:
 20200127
 Record Visibility:
 Public

7
Dataset
 Creator(s):
 Jonathan Hauenstein
 Description:
Many algorithms for determining properties of real algebraic or semialgebraic sets rely upon the ability to compute smooth points. Existing methods to compute smooth points on semialgebraic sets use symbolic quantifier elimination tools. In this paper, we present a simple algorithm based on computing the critical points of some wellchosen 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:
 20200118
 Record Visibility:
 Public

 Creator(s):
 Tianze Peng, David Richter
 Description:
Description (updated: 12/26/2019)
Matlab code for figures 37 1. First unzip all files. (Sizespecific statistics for each case are stored in PDFdata.zip.) 2. Run the main script: Bulkheatflux.m * (depedent) code for plotting: polybulkfluxpoly.m * (depedent) code for estimating bulk flux: estpoly_partflux.m
 Date Created:
 20191226
 Record Visibility:
 Public

 Creator(s):
 Marc Muller, Jaynise PerezValentin
 Description:
This dataset accompanies the Manuscript “Impact of Hurricane Maria on beach erosion in Puerto Rico: remote sensing and causal inference” by Jaynise PerezValentin and Marc F. Muller, November 2019.
beachesGIS is a zip archive that contains GIS vectors of 75 beach polygons across Puerto Rico. The vectors are provided in ESRI Shapefile format and LatLong coordinate system and have an attribute table with a beach name.
TimeSeries is a csv table containing time series of shoreline pos…
 Date Created:
 20191106
 Record Visibility:
 Public

10
Dataset
 Creator(s):
 Kelly McMann, Adam Glynn, John Gerring, Pamela Paxton, Agnes Cornell, Eitan Tzelgov, Allen Hicken, SvendErik Skaaning, David Altman, Aksel Sundström, Staffan I. Lind berg, Carl Henrik Knutsen, Jeffrey Staton, Anna Lührmann, Rachel Sigman, Michael Coppedge, Jan Teorell, Haakon Gjerløw, Moa Olin, Kyle L. Mar quardt, Yiting Wang, Luca Uberti, Tore Wig, Michael Bernhard, M. Steven Fish, Joshua Krusell, Daniel Ziblatt., Valeriya Mechkova, Brigitte Seim, Daniel Pemstein
 Record Visibility:
 Public

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

 Creator(s):
 Dan Bates, David Eklund, Jonathan Hauenstein, Chris Peterson
 Description:
A fundamental problem in algebraic geometry is to decompose the solution set of a given polynomial system. A numerical description of this solution set is called a numerical irreducible decomposition and currently all standard algorithms use a sequence of homotopies forming a dimensionbydimension approach. In this article, we pair a classical result to compute a smooth point on every irreducible component in every dimension using a single homotopy together with the theory of isosingular s…
 Date Created:
 20190426
 Record Visibility:
 Public