skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Title: A tutorial review of linear rheology for polymer chemists: basics and best practices for covalent adaptable networks
This tutorial review of linear viscoelasticity is targeted at polymer chemists working with covalent adaptable networks. It provides an overview of concepts, analysis, misconceptions, and best practices for rheological experiments.  more » « less
Award ID(s):
2144007
PAR ID:
10510016
Author(s) / Creator(s):
;
Publisher / Repository:
Royal Society of Chemistry
Date Published:
Journal Name:
Polymer Chemistry
Volume:
15
Issue:
9
ISSN:
1759-9954
Page Range / eLocation ID:
815 to 846
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. Tweetable abstract Mitochondrial transplantation has been used to treat various diseases associated with mitochondrial dysfunction. Here, we highlight the considerations in quality control mechanisms that should be considered in the context of mitochondrial transplantation. 
    more » « less
  2. Beyersdorff, Olaf; Kanté, Mamadou Moustapha; Kupferman, Orna; Lokshtanov, Daniel (Ed.)
    Given a set P of n points and a set S of n segments in the plane, we consider the problem of computing for each segment of S its closest point in P. The previously best algorithm solves the problem in n^{4/3}2^{O(log^*n)} time [Bespamyatnikh, 2003] and a lower bound (under a somewhat restricted model) Ω(n^{4/3}) has also been proved. In this paper, we present an O(n^{4/3}) time algorithm and thus solve the problem optimally (under the restricted model). In addition, we also present data structures for solving the online version of the problem, i.e., given a query segment (or a line as a special case), find its closest point in P. Our new results improve the previous work. 
    more » « less
  3. For domains in R d \mathbb {R}^d , d ≥ 2 d\geq 2 , we prove universal upper and lower bounds on the product of the bottom of the spectrum for the Laplacian to the power p > 0 p>0 and the supremum over all starting points of the p p -moments of the exit time of Brownian motion. It is shown that the lower bound is sharp for integer values of p p and that for p ≥ 1 p \geq 1 , the upper bound is asymptotically sharp as d → ∞ d\to \infty . For all p > 0 p>0 , we prove the existence of an extremal domain among the class of domains that are convex and symmetric with respect to all coordinate axes. For this class of domains we conjecture that the cube is extremal. 
    more » « less
  4. Abstract The rapid development of modeling techniques has brought many opportunities for data‐driven discovery and prediction. However, this also leads to the challenge of selecting the most appropriate model for any particular data task. Information criteria, such as the Akaike information criterion (AIC) and Bayesian information criterion (BIC), have been developed as a general class of model selection methods with profound connections with foundational thoughts in statistics and information theory. Many perspectives and theoretical justifications have been developed to understand when and how to use information criteria, which often depend on particular data circumstances. This review article will revisit information criteria by summarizing their key concepts, evaluation metrics, fundamental properties, interconnections, recent advancements, and common misconceptions to enrich the understanding of model selection in general. This article is categorized under:Data: Types and Structure > Traditional Statistical DataStatistical Learning and Exploratory Methods of the Data Sciences > Modeling MethodsStatistical and Graphical Methods of Data Analysis > Information Theoretic MethodsStatistical Models > Model Selection 
    more » « less
  5. Abstract Weasels (genusMustelaandNeogale) are of management concern as declining native species in some regions and invasive species in others. Regardless of the need to conserve or remove weasels, there is increasingly a need to use non‐invasive monitoring methods to assess population trends.We conducted a literature review and held the first ever International Weasel Monitoring Symposium to synthesise information on historical and current non‐invasive monitoring techniques for weasels. We also explored current limitations, opportunities, and areas of development to guide future research and long‐term monitoring.Our literature search revealed that in the past 20 years, camera traps were the most commonly used non‐invasive monitoring method (62% of studies), followed by track plates or scent stations designed to collect footprints (23%) and walking transects for tracks in snow or soil (8.7%).Experts agreed that the most promising non‐invasive monitoring techniques available include use of citizen scientist reporting, detection dogs, detecting tracks, non‐invasive genetic surveys, and enclosed or unenclosed camera trap systems. Because each technique has benefits and limitations, using a multi‐method approach is likely required.There is a need for strong commitment to dedicated monitoring that is replicated over space and time such that trend data can be ascertained to better inform future management action. The diversity of non‐invasive monitoring methods now available makes such monitoring possible with relatively minor commitments of funding and effort. 
    more » « less