Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher.
Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?
Some links on this page may take you to non-federal websites. Their policies may differ from this site.
-
X-ray diffraction indicates that the structure of the recently discovered carbonaceous sulfur hydride (C-S-H) room temperature superconductor is derived from previously established van der Waals compounds found in the H2S-H2 and CH4-H2 systems. Crystals of the superconducting phase were produced by a photochemical synthesis technique leading to the superconducting critical temperature Tc of 288 K at 267 GPa. X-ray diffraction patterns measured from 124 to 178 GPa, within the pressure range of the superconducting phase, are consistent with an orthorhombic structure derived from the Al2Cu-type determined for (H2S)2H2 and (CH4)2H2 that differs from those predicted and observed for the S-Hmore »Free, publicly-accessible full text available September 21, 2022
-
Free, publicly-accessible full text available August 1, 2022
-
As machine learning has become more prevalent, researchers have begun to recognize the necessity of ensuring machine learning systems are fair. Recently, there has been an interest in defining a notion of fairness that mitigates over-representation in traditional clustering. In this paper we extend this notion to hierarchical clustering, where the goal is to recursively partition the data to optimize a specific objective. For various natural objectives, we obtain simple, efficient algorithms to find a provably good fair hierarchical clustering. Empirically, we show that our algorithms can find a fair hierarchical clustering, with only a negligible loss in the objective.
-
There has been significant study on the sample complexity of testing properties of distributions over large domains. For many properties, it is known that the sample complexity can be substantially smaller than the domain size. For example, over a domain of size n, distinguishing the uniform distribution from distributions that are far from uniform in ℓ1-distance uses only O(n−−√) samples. However, the picture is very different in the presence of arbitrary noise, even when the amount of noise is quite small. In this case, one must distinguish if samples are coming from a distribution that is ϵ-close to uniform frommore »