Search for: All records

Soil erosion in agricultural landscapes reduces crop yields, leads to loss of ecosystem services, and influences the global carbon cycle. Despite decades of soil erosion research, the magnitude of historical soil loss remains poorly quantified across large agricultural regions because preagricultural soil data are rare, and it is challenging to extrapolate local-scale erosion observations across time and space. Here we focus on the Corn Belt of the midwestern United States and use a remote-sensing method to map areas in agricultural fields that have no remaining organic carbon-rich A-horizon. We use satellite and LiDAR data to develop a relationship between A-horizon loss and topographic curvature and then use topographic data to scale-up soil loss predictions across 3.9 × 10⁵km²of the Corn Belt. Our results indicate that 35 ± 11% of the cultivated area has lost A-horizon soil and that prior estimates of soil degradation from soil survey-based methods have significantly underestimated A-horizon soil loss. Convex hilltops throughout the region are often completely denuded of A-horizon soil. The association between soil loss and convex topography indicates that tillage-induced erosion is an important driver of soil loss, yet tillage erosion is not simulated in models used to assess nationwide soil loss trends in the United States. We estimate that A-horizon loss decreases crop yields by 6 ± 2%, causing $2.8 ± $0.9 billion in annual economic losses. Regionally, we estimate 1.4 ± 0.5 Pg of carbon have been removed from hillslopes by erosion of the A-horizon, much of which likely remains buried in depositional areas within the fields. 

Abstract Nanograined metals have the merit of high strength, but usually suffer from low work hardening capacity and poor thermal stability, causing premature failure and limiting their practical utilities. Here we report a “nanodispersion-in-nanograins” strategy to simultaneously strengthen and stabilize nanocrystalline metals such as copper and nickel. Our strategy relies on a uniform dispersion of extremely fine sized carbon nanoparticles (2.6 ± 1.2 nm) inside nanograins. The intragranular dispersion of nanoparticles not only elevates the strength of already-strong nanograins by 35%, but also activates multiple hardening mechanisms via dislocation-nanoparticle interactions, leading to improved work hardening and large tensile ductility. In addition, these finely dispersed nanoparticles result in substantially enhanced thermal stability and electrical conductivity in metal nanocomposites. Our results demonstrate the concurrent improvement of several mutually exclusive properties in metals including strength-ductility, strength-thermal stability, and strength-electrical conductivity, and thus represent a promising route to engineering high-performance nanostructured materials. 

We consider a scenario involving computations over a massive dataset stored distributedly across multiple workers, which is at the core of distributed learning algorithms. We propose Lagrange Coded Computing (LCC), a new framework to simultaneously provide (1) resiliency against stragglers that may prolong computations; (2) security against Byzantine (or malicious) workers that deliberately modify the computation for their benefit; and (3) (information-theoretic) privacy of the dataset amidst possible collusion of workers. LCC, which leverages the well-known Lagrange polynomial to create computation redundancy in a novel coded form across workers, can be applied to any computation scenario in which the function of interest is an arbitrary multivariate polynomial of the input dataset, hence covering many computations of interest in machine learning. LCC significantly generalizes prior works to go beyond linear computations. It also enables secure and private computing in distributed settings, improving the computation and communication efficiency of the state-of-the-art. Furthermore, we prove the optimality of LCC by showing that it achieves the optimal tradeoff between resiliency, security, and privacy, i.e., in terms of tolerating the maximum number of stragglers and adversaries, and providing data privacy against the maximum number of colluding workers. Finally, we show via experiments on Amazon EC2 that LCC speeds up the conventional uncoded implementation of distributed least-squares linear regression by up to 13.43×, and also achieves a 2.36×-12.65× speedup over the state-of-the-art straggler mitigation strategies.