An official website of the United States government
With relatively few exceptions, dendrochronological records in Australia have been developed from conifer species. Over the last 20 years, some effort has successfully extracted records from some Eucalyptus species and Toona ciliata. However, very little attempt has been made to examine a broader range of species. There has been some success with extracting records from the African Boab species. We collected 10mm core samples from around 30 A. gregorii trees in the Kimberly and will be assessing the potential of the species by examining variability in vessel characteristics, isotopic and elemental tracers. We hope to use elemental tracers in the wood to corroborate a fire record from speleothems in the region.
more »
« less
This content will become publicly available on May 21, 2026
Could Australian Adansonia gregorii (Boab) provide multi-centennial climate records for Australia’s northwest?
With relatively few exceptions, dendrochronological records in Australia have been developed from conifer species. Over the last 20 years, some effort has successfully extracted records from some Eucalyptus species and Toona ciliata. However, very little attempt has been made to examine a broader range of species. There has been some success with extracting records from the African Boab species. We collected 10mm core samples from around 30 A. gregorii trees in the Kimberly and will be assessing the potential of the species by examining variability in vessel characteristics, isotopic an elemental traces. We hope to use elemental traces in the wood to corroborate a fire record from speleothems in the region.
more »
« less
- Award ID(s):
- 2147186
- PAR ID:
- 10613725
- Publisher / Repository:
- Australia New Zealand Tree Ring Science Conference
- Date Published:
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
Recently, the ubiquity of mobile devices leads to an increasing demand of public network services, e.g., WiFi hot spots. As a part of this trend, modern transportation systems are equipped with public WiFi devices to provide Internet access for passengers as people spend a large amount of time on public transportation in their daily life. However, one of the key issues in public WiFi spots is the privacy concern due to its open access nature. Existing works either studied location privacy risk in human traces or privacy leakage in private networks such as cellular networks based on the data from cellular carriers. To the best of our knowledge, none of these work has been focused on bus WiFi privacy based on large-scale real-world data. In this paper, to explore the privacy risk in bus WiFi systems, we focus on two key questions how likely bus WiFi users can be uniquely re-identified if partial usage information is leaked and how we can protect users from the leaked information. To understand the above questions, we conduct a case study in a large-scale bus WiFi system, which contains 20 million connection records and 78 million location records from 770 thousand bus WiFi users during a two-month period. Technically, we design two models for our uniqueness analyses and protection, i.e., a PB-FIND model to identify the probability a user can be uniquely re-identified from leaked information; a PB-HIDE model to protect users from potentially leaked information. Specifically, we systematically measure the user uniqueness on users' finger traces (i.e., connection URL and domain), foot traces (i.e., locations), and hybrid traces (i.e., both finger and foot traces). Our measurement results reveal (i) 97.8% users can be uniquely re-identified by 4 random domain records of their finger traces and 96.2% users can be uniquely re-identified by 5 random locations on buses; (ii) 98.1% users can be uniquely re-identified by only 2 random records if both their connection records and locations are leaked to attackers. Moreover, the evaluation results show our PB-HIDE algorithm protects more than 95% users from the potentially leaked information by inserting only 1.5% synthetic records in the original dataset to preserve their data utility.more » « less
-
Geochemical data from ancient marine sediments are crucial for studying palaeo-environments, palaeo-climates, and elemental cycles. With increased accessibility to geochemical data, many databases have emerged. However, there remains a need for a more comprehensive database that focuses on deep-time marine sediment records. Here, we introduce the Deep-Time Marine Sedimentary Element Database (DM-SED). The DM-SED has been built upon the Sedimentary Geochemistry and Paleoenvironments Project (SGP) database with a new compilation of 34 874 data entries from 433 studies, totalling 63 627 entries. The DM-SED contains 2 522 255 discrete marine sedimentary data points, including major and trace elements and some stable isotopes. It includes 9207 entries from the Precambrian and 54 420 entries from the Phanerozoic, thus providing significant references for reconstructing deep-time Earth system evolution. The data files described in this paper are available at https://doi.org/10.5281/zenodo.14771859 (Lai et al., 2025).more » « less
-
The Brissidae is a family of heart urchins that includes shallow‑water, infaunal species, some of which are rarely observed. One species,Rhynobrissus cuneusCooke, 1957, has only been recorded from the western Atlantic off the coast of North Carolina, USA and in the Gulf of Mexico off the coast of Veracruz, Mexico. This work identifies new records from the coast of Florida, USA, increasing our knowledge of this species’ geographic distribution.more » « less
-
Detecting “similar code” is useful for many software engineering tasks. Current tools can help detect code with statically similar syntactic and–or semantic features (code clones) and with dynamically similar functional input/output (simions). Unfortunately, some code fragments that behave similarly at the finer granularity of their execution traces may be ignored. In this paper, we propose the term “code relatives” to refer to code with similar execution behavior. We define code relatives and then present DyCLINK, our approach to detecting code relatives within and across codebases. DyCLINK records instruction-level traces from sample executions, organizes the traces into instruction-level dynamic dependence graphs, and employs our specialized subgraph matching algorithm to efficiently compare the executions of candidate code relatives. In our experiments, DyCLINK analyzed 422+ million prospective subgraph matches in only 43 minutes. We compared DyCLINK to one static code clone detector from the community and to our implementation of a dynamic simion detector. The results show that DyCLINK effectively detects code relatives with a reasonable analysis time.more » « less
