An official website of the United States government
Abstract Federal and state land agencies lack diversity at the natural resource manager level, in turn limiting the agencies' capacity for creative problem solving needed for complex and wicked environmental problems. Diverse representation is imperative to increase public support and trust in natural resource management.We used an online survey method to examine the relationship and experiences between independent demographic variables (e.g. gender, ethnicity and years worked in natural resources) and two dependent variables: (1) perceived public support and (2) sense of belonging for resource management professionals in the Pacific Northwest, USA.We find in general, that gender is associated with how one progresses through a career in natural resource management. As years in natural resource management increases, sense of belonging decreases for women and remains constant for men. Similarly, as years in natural resource management increases, perceived public support increases for men and remains constant for women.Given that ample past research suggests strong links between sustainable management and diverse perspectives, this study has implications for addressing our current and future natural resource management challenges. Read the freePlain Language Summaryfor this article on the Journal blog.
more »
« less
A semiclassical approach to geometric X-ray transforms in the presence of convexity
In this short paper we introduce a variant of the approach to inverting the X-ray transform that originated in the author’s work with Uhlmann. The new method is based on semiclassical analysis and eliminates the need for using sufficiently small domains and layer stripping for obtaining the injectivity and stability results, assuming natural geometric conditions are satisfied.
more »
« less
- PAR ID:
- 10490859
- Publisher / Repository:
- American Mathematical Society (AMS)
- Date Published:
- Journal Name:
- Communications of the American Mathematical Society
- Volume:
- 4
- Issue:
- 4
- ISSN:
- 2692-3688
- Format(s):
- Medium: X Size: p. 97-116
- Size(s):
- p. 97-116
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
Abstract In this paper, we examine the locality condition for non‐splitting and determine the level of uniqueness of limit models that can be recovered in some stable, but not superstable, abstract elementary classes. In particular we prove the following. Suppose that is an abstract elementary class satisfyingthe joint embedding and amalgamation properties with no maximal model of cardinality ,stability in ,,continuity for (i.e., if and is a limit model witnessed by for some limit ordinal and there exists so that does not ‐split over for all , then does not ‐split over ). Then for and limit ordinals both with cofinality , if satisfies symmetry for (or just ‐symmetry), then, for any and that are and ‐limit models over , respectively, we have that and are isomorphic over . Note that no tameness is assumed.more » « less
-
Given a set of points $$P = (P^+ \sqcup P^-) \subset \mathbb{R}^d$$ for some constant $$d$$ and a supply function $$\mu:P\to \mathbb{R}$$ such that $$\mu(p) > 0~\forall p \in P^+$$, $$\mu(p) < 0~\forall p \in P^-$$, and $$\sum_{p\in P}{\mu(p)} = 0$$, the geometric transportation problem asks one to find a transportation map $$\tau: P^+\times P^-\to \mathbb{R}_{\ge 0}$$ such that $$\sum_{q\in P^-}{\tau(p, q)} = \mu(p)~\forall p \in P^+$$, $$\sum_{p\in P^+}{\tau(p, q)} = -\mu(q) \forall q \in P^-$$, and the weighted sum of Euclidean distances for the pairs $$\sum_{(p,q)\in P^+\times P^-}\tau(p, q)\cdot ||q-p||_2$$ is minimized. We present the first deterministic algorithm that computes, in near-linear time, a transportation map whose cost is within a $$(1 + \varepsilon)$$ factor of optimal. More precisely, our algorithm runs in $$O(n\varepsilon^{-(d+2)}\log^5{n}\log{\log{n}})$$ time for any constant $$\varepsilon > 0$$. While a randomized $$n\varepsilon^{-O(d)}\log^{O(d)}{n}$$ time algorithm for this problem was discovered in the last few years, all previously known deterministic $$(1 + \varepsilon)$$-approximation algorithms run in~$$\Omega(n^{3/2})$$ time. A similar situation existed for geometric bipartite matching, the special case of geometric transportation where all supplies are unit, until a deterministic $$n\varepsilon^{-O(d)}\log^{O(d)}{n}$$ time $$(1 + \varepsilon)$$-approximation algorithm was presented at STOC 2022. Surprisingly, our result is not only a generalization of the bipartite matching one to arbitrary instances of geometric transportation, but it also reduces the running time for all previously known $$(1 + \varepsilon)$$-approximation algorithms, randomized or deterministic, even for geometric bipartite matching. In particular, we give the first $$(1 + \varepsilon)$$-approximate deterministic algorithm for geometric bipartite matching and the first $$(1 + \varepsilon)$$-approximate deterministic or randomized algorithm for geometric transportation with no dependence on $$d$$ in the exponent of the running time's polylog. As an additional application of our main ideas, we also give the first randomized near-linear $$O(\varepsilon^{-2} m \log^{O(1)} n)$$ time $$(1 + \varepsilon)$$-approximation algorithm for the uncapacitated minimum cost flow (transshipment) problem in undirected graphs with arbitrary \emph{real} edge costs.more » « less
-
Tabulated statistics of road networks at the level of intersections and for built-up areas for each decade from 1900 to 2010, and for 2015, for each core-based statistical area (CBSA, i.e., metropolitan and micropolitan statistical area) in the conterminous United States. These areas are derived from historical road networks developed by Johannes Uhl. See Burghardt et al. (2022) for details on the data processing. Spatial coverage: all CBSAs that are covered by the HISDAC-US historical settlement layers. This dataset includes around 2,700 U.S. counties. In the remaining counties, construction year coverage in the underlying ZTRAX data (Zillow Transaction and Assessment Dataset) is low. See Uhl et al. (2021) for details. All data created by Keith A. Burghardt, USC Information Sciences Institute, USA Codebook: these CBSA statistics are stratified by degree of aggregation. - CBSA_stats_diffFrom1950: Change in CBSA-aggregated patch statistics between 1950 and 2015 - CBSA_stats_by_decade: CBSA-aggregated patch statistics for each decade from 1900-2010 plus 2015 - CBSA_stats_by_decade: CBSA-aggregated cumulative patch statistics for each decade from 1900-2010 plus 2015. All roads created up to a given decade are used for calculating statistics. - Patch_stats_by_decade: Individual patch statistics for each decade from 1900-2010 plus 2015 - Patch_stats_by_decade: Individual cumulative patch statistics for each decade from 1900-2010 plus 2015. All roads created up to a given decade are used for calculating statistics. The statistics are the following: msaid: CBSA codeid: (if patch statistics) arbitrary int unique to each patch within the CBSA that yearyear: year of statisticspop: population within all CBSA countiespatch_bupr: built up property records (BUPR) within a patch (or sum of patches within CBSA)patch_bupl: built up property l (BUPL) within a patch (or sum of patches within CBSA)patch_bua: built up area (BUA) within a patch (or sum of patches within CBSA)all_bupr: Same as above but for all data in 2015 regardless of whether properties were in patchesall_bupl: Same as above but for all data in 2015 regardless of whether properties were in patchesall_bua: Same as above but for all data in 2015 regardless of whether properties were in patchesnum_nodes: number of nodes (intersections)num_edges: number of edges (roads between intersections)distance: total road length in kmk_mean: mean number of undirected roads per intersectionk1: fraction of nodes with degree 1k4plus: fraction of nodes with degree 4+bearing: histogram of different bearings between intersectionsentropy: entropy of bearing histogrammean_local_gridness: Griddedness used in textmean_local_gridness_max: Same as griddedness used in text but assumes we can have up to 3 quadrilaterals for degree 3 (maximum possible, although intersections will not necessarily create right angles) Code available at https://github.com/johannesuhl/USRoadNetworkEvolution. References: Burghardt, K., Uhl, J., Lerman, K., & Leyk, S. (2022). Road Network Evolution in the Urban and Rural United States Since 1900. Computers, Environment and Urban Systems.more » « less
-
A series of Co–P materials with varying P : Co ratio from 0 to 4 supported on SBA-15 were evaluated for ethane dehydrogenation (EDH) performance. In comparison to monometallic Co, the Co–P materials have improved ethylene selectivity from 41% for Co to 88–90% for Co–P, which was attributed to the segregation of Co atoms and the formation of partial positive Co δ + sites in the Co–P materials due to charge transfer. Among the Co–P materials studied, an optimum in stability was observed in those containing a P : Co ratio in the range 1 to 2. Below this range, limited P is available to adequately separate Co atoms. Above this range, the excess P promotes coke formation through possible acid catalyzed pathways. The stability of two of the Co–P materials containing the Co 2 P and CoP phase, respectively, were further tested for EDH at 700 °C. Under these conditions, the ethylene selectivity was 98%, and both materials remained active with little to no deactivation for over 4 h. In comparison to a Pt–Sn reference, both Co–P materials showed vastly improved stability. Additionally, both Co–P materials showed no signs of sintering after EDH at 700 °C and maintained their respective Co 2 P and CoP phases. These results demonstrate the catalytic improvement with P incorporation and highlights the high stability of Co–P, and possibly other metal phosphides, as high temperature EDH catalysts.more » « less
