Search NASA⌕ Search

SEARCH · Search NASA

Results for “Tree Classifiers”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 109 records · Page 6

Application of Multi-Criteria Decision Analysis Techniques for Informing Select Agent Designation and Decision Making

The Centers for Disease Control and Prevention (CDC) Select Agent Program establishes a list of biological agents and toxins that potentially threaten public health and safety, the procedures governing the possession, utilization, and transfer of those agents, and training requirements for entities working with them. Every 2 years the Program reviews the select agent list, utilizing subject matter expert (SME) assessments to rank the agents. In this study, we explore the applicability of multi-criteria decision analysis (MCDA) techniques and logic tree analysis to support the CDC Select Agent Program biennial review process, applying the approach broadly to include non-select agents to evaluate its generality. We conducted a literature search for over 70 pathogens against 15 criteria for assessing public health and bioterrorism risk and documented the findings for archiving. The most prominent data gaps were found for aerosol stability and human infectious dose by inhalation and ingestion routes. Technical review of published data and associated scoring recommendations by pathogen-specific SMEs was found to be critical for accuracy, particularly for pathogens with very few known cases, or where proxy data (e.g., from animal models or similar organisms) were used to address data gaps. Analysis of results obtained from a two-dimensional plot of weighted scores for difficulty of attack (i.e., exposure and production criteria) vs. consequences of an attack (i.e., consequence and mitigation criteria) provided greater fidelity for understanding agent placement compared to a 1-to-n ranking and was used to define a region in the upper right-hand quadrant for identifying pathogens for consideration as select agents. A sensitivity analysis varied the numerical weights attributed to various properties of the pathogens to identify potential quantitative (x and y) thresholds for classifying select agents. The results indicate while there is some clustering of agent scores to suggest thresholds, there are still pathogens that score close to any threshold, suggesting that thresholding “by eye” may not be sufficient. The sensitivity analysis indicates quantitative thresholds are plausible, and there is good agreement of the analytical results with select agent designations. A second analytical approach that applied the data using a logic tree format to rule out pathogens for consideration as select agents arrived at similar conclusions.

60 APPLIED LIFE SCIENCES↗

Galaxy morphology prediction using Capsule Networks

Abstract Understanding morphological types of galaxies is a key parameter for studying their formation and evolution. Neural networks that have been used previously for galaxy morphology classification have some disadvantages, such as not being inherently invariant under rotation. In this work, we studied the performance of Capsule Network (CapsNet), a recently introduced neural network architecture that is rotationally invariant and spatially aware, on the task of galaxy morphology classification. We designed two evaluation scenarios based on the answers from the question tree in the Galaxy Zoo project. In the first scenario, we used CapsNet for regression and predicted probabilities for all of the questions. In the second scenario, we chose the answer to the first morphology question that had the highest user agreement as the class of the object and trained a CapsNet classifier, where we also reconstructed galaxy images. We achieved promising results in both of these scenarios. Automated approaches such as the one introduced here will play a critical role in the upcoming large sky surveys.

Katebi, Reza↗

Training toward significance with the decorrelated event classifier transformer neural network

Experimental particle physics uses machine learning for many tasks, where one application is to classify signal and background events. This classification can be used to bin an analysis region to enhance the expected significance for a mass resonance search. In natural language processing, one of the leading neural network architectures is the transformer. In this work, an event classifier transformer is proposed to bin an analysis region, in which the network is trained with special techniques. The techniques developed here can enhance the significance and reduce the correlation between the network’s output and the reconstructed mass. It is found that this trained network can perform better than boosted decision trees and feed-forward networks. Published by the American Physical Society 2024

Astronomy & Astrophysics↗

Non-standard interactions in radiative neutrino mass models

Models of radiative Majorana neutrino masses require new scalars and/or fermions to induce lepton-number-violating interactions. We show that these new particles also generate observable neutrino non-standard interactions (NSI) with matter. We classify radiative models as type-I or II, with type-I models containing at least one Standard Model (SM) particle inside the loop diagram generating neutrino mass, and type-II models having no SM particle inside the loop. While type-II radiative models do not generate NSI at tree-level, popular models which fall under the type-I category are shown, somewhat surprisingly, to generate observable NSI at tree-level, while being consistent with direct and indirect constraints from colliders, electroweak precision data and charged-lepton flavor violation (cLFV). We survey such models where neutrino masses arise at one, two and three loops. In the prototypical Zee model which generates neutrino masses via one-loop diagrams involving charged scalars, we find that diagonal NSI can be as large as (8%, 3.8%, 9.3%) for (ε$_{ee}$, ε$_{μμ}$, ε$_{ττ}$), while off-diagonal NSI can be at most (10$^{–3}$%, 0.56%, 0.34%) for (ε$_{eμ}$, ε$_{eτ}$, ε$_{μτ}$). In one-loop neutrino mass models using leptoquarks (LQs), (ε$_{μμ}$, ε$_{ττ}$) can be as large as (21.6%, 51.7%), while ε$_{ee}$ and (ε$_{eμ}$, ε$_{eτ}$, ε$_{μτ}$) can at most be 0.6%. Other two- and three-loop LQ models are found to give NSI of similar strength. The most stringent constraints on the diagonal NSI are found to come from neutrino oscillation and scattering experiments, while the off-diagonal NSI are mostly constrained by low-energy processes, such as atomic parity violation and cLFV. We also comment on the future sensitivity of these radiative models in long-baseline neutrino experiments, such as DUNE. While our analysis is focused on radiative neutrino mass models, it essentially covers all NSI possibilities with heavy mediators.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Machine learning applied to classifying neutron resonances

The performance of nuclear reactors and other nuclear systems depends on a precise understanding of the neutron interaction cross sections for materials used in these systems. These cross sections exhibit resonance structure whose shape is determined in part by the angular momentum quantum numbers of the resonances. The correct assignment of the quantum numbers of neutron resonances is therefore of paramount importance. In this project, we apply a machine learning technique, namely decision trees, to automate the quantum number assignments. The tree is trained from simulated data generated to mimic the errors found in real data. We explore the use of several physics-motivated features for training our trees, including the nearest neighbor spacing distribution, cumulative level distribution, and channel width distributions. Initial results using random matrix theory motivated fits which demonstrated that we can determine resonance spin groups somewhat reliably. If we use these fits as features in our trees, we can train them to spot outliers corresponding to misassigned resonances. We found that with the large number of features used in this project that the decision tree tended to over t training data resulting in poor performance with respect to the test data. By reducing the number of features, we can achieve nearly perfect assignment of quantum numbers with our training data.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Polarimetric SAR Image Terrain Classification

In practical applications of automated terrain classification from high-resolution polarimetric synthetic aperture radar (PolSAR) imagery, different terrain types may inherently contain a high level of internal variability, as when a broadly defined class (e.g., “trees”) contains elements arising from multiple subclasses (pine, oak, and willow). In addition, real-world factors such as the time of year of a collection, the moisture content of the scene, the imaging geometry, and the radar system parameters can all increase the variability observed within each class. Such variability challenges the ability of classifiers to maintain a high level of sensitivity in recognizing diverse elements that are within-class, without sacrificing their selectivity in rejecting out-of-class elements. In an effort to gauge the degree to which classifiers respond robustly in the presence of intraclass variability and generalize to untrained scenes and conditions, here we compare the performance of a suite of classifiers across six broad terrain categories from a large set of polarimetric synthetic aperture radar (PolSAR) image sets. The main contributions of this article are as follows: 1) an analysis of the robustness of a variety of current state-of-the art classification algorithms to intraclass variability found in PolSAR image sets, and 2) the associated PolSAR image and feature data that Sandia is releasing to the research community with this publication. The analysis of the classification algorithms we provide will serve as a benchmark of performance for the future PolSAR terrain classification algorithm research and development enabled by the image sets and data provided. By sharing our analysis and high-resolution fully polarimetric Sandia data with the research community, we enable others to develop and assess a new generation of robust terrain classification algorithms for PolSAR.

42 ENGINEERING↗

Data-driven Cyberattack Detection for Photovoltaic (PV) Systems through Analyzing Micro-PMU Data

With increasing exposure to software-based sensing and control, Photovoltaic (PV) systems are facing higher risks of cyber attacks. Here, to ensure the system stability and minimize potential economic losses, it is imperative to monitor operating states and detect attacks at the early stage. To meet this demand, Micro-Phasor Measurement Units (μPMU) are increasingly popular in monitoring distribution networks. However, due to the relatively low sampling rate, μPMU has not yet been used to detect and classify cyber-attacks in power electronics enabled smart grid. To our knowledge, this is one of the first attempts to use μPMU to detect cyber attacks that degrade the performance of power electronics systems. We propose to apply data-driven methods on micro-PMU data to implement attack detection. We have evaluated data-driven methods, including decision tree (DT), K-nearest neighbor (KNN), support vector machine (SVM), artificial neural network (ANN), long short-term memory (LSTM) and convolutional neural network (CNN). The proposed CNN model achieves the required performances with the highest 99.23% accuracy and 0.9963 F 1 score.

14 SOLAR ENERGY↗

classLog: Logistic regression for the classification of genetic sequences

Introduction Sequencing and phylogenetic classification have become a common task in human and animal diagnostic laboratories. It is routine to sequence pathogens to identify genetic variations of diagnostic significance and to use these data in realtime genomic contact tracing and surveillance. Under this paradigm, unprecedented volumes of data are generated that require rapid analysis to provide meaningful inference. Methods We present a machine learning logistic regression pipeline that can assign classifications to genetic sequence data. The pipeline implements an intuitive and customizable approach to developing a trained prediction model that runs in linear time complexity, generating accurate output rapidly, even with incomplete data. Our approach was benchmarked against porcine respiratory and reproductive syndrome virus (PRRSv) and swine H1 influenza A virus (IAV) datasets. Trained classifiers were tested against sequences and simulated datasets that artificially degraded sequence quality at 0, 10, 20, 30, and 40%. Results When applied to a poor-quality sequence data, the classifier achieved between >85% to 95% accuracy for the PRRSv and the swine H1 IAV HA dataset and this increased to near perfect accuracy when using the full dataset. The model also identifies amino acid positions used to determine genetic clade identity through a feature selection ranking within the model. These positions can be mapped onto a maximum-likelihood phylogenetic tree, allowing for the inference of clade defining mutations. Discussion Our approach is implemented as a python package with code available at https://github.com/flu-crew/classLog .

Zeller, Michael A.↗

Metatranscriptomic dynamics after Verticillium dahliae infection and root damage in Olea europaea

Background: The olive tree is of particular economic interest in the Mediterranean basin. Researchers have conducted several studies on one of the most devastating disorders affecting this tree, the Verticillium wilt, which causes substantial economic losses in numerous areas. We analyzed metatranscriptomic samples taken from a previous study conducted on leaves and roots of Olea europaea that were infected with Verticillium dahliae. In addition, we also analyzed mechanically damaged roots. The aim of our approach is to describe the dynamics of the root microbiome after severe perturbations. Results: Our results not only describe the dynamics of the microbial community associated with the disturbance, but also show the high complexity of these systems and explain how this can lead to a conflicting assignment of the various types of parasitism observed in a specific organism. Conclusions: Our findings indicate that this infection, although led by Verticillium, is driven not by a single species, but by a polymicrobial consortium that also includes natural endophytes of the olive tree. This community contains both biotrophic and necrotrophic organisms that alternate and live together during the infection. In addition, opportunistic organisms appear that take profit not from plant tissues, but from new emerging populations of microorganisms. Therefore, this system can be described as a complex biological system composed of different interacting communities. Notably, our work has important considerations when it comes to classifying the type of parasitism of a given species.

Verticillium dahliae↗

Characterization of a novel HIV-1 circulating recombinant form, CRF91_cpx, comprising CRF02_AG, G, J, and U, mostly among men who have sex with men

Prospective molecular studies of HIV-1 pol region (2253–5250 in HXB2 genome) sequences from sequenced samples of 269 HIV-1-infected patients in Cyprus (2017–2021) revealed a transmission cluster of 14 unknown HIV-1 recombinants that were not classified as previously established CRFs. The earliest recombinant was collected in September 2017, and the transmission cluster continued to grow until November 2020. Near full-length HIV-1 genome sequences of the 11 of the 14 recombinants were successfully obtained (790–8795 in HXB2 genome) and aligned against a reference dataset of HIV-1 subtypes and CRFs. We employed MEGAX for maximum-likelihood tree construction (GTR model, 1000 bootstrap replicates), Cluster-Picker for phylogenetic clustering analysis (genetic distance ≤0.045, bootstrap support value ≥70%), and REGA-3.0 for subtype determination. Bootscan and similarity plot analyses (sliding window of 400 nucleotides overlapped by 40 nucleotides) were conducted using SimPlot-v3.5.1, and subregion confirmatory neighbour-joining tree analyses were conducted using MEGAX (Kimura two-parameter model, 1000 bootstrap replicates, ≥70% bootstrap-support value). Exclusive clustering of the HIV-1 recombinants revealed their uniqueness. The recombination analyses illustrated the same unique mosaic pattern with six putative intersubtype recombination breakpoints, seven fragments of subtypes CRF02_AG, G, J and an unclassified fragment. We conclusively characterized the mosaic structure of the novel HIV-1 CRF, named CRF91_cpx, by the Los Alamos HIV Sequence Database. Additionally, we identified a URF of CRF91_cpx with two additional recombination sites, generated by a recombination event between subtype B and CRF91_cpx. Since the identification of CRF91_cpx, two additional patient samples have been entered into the CRF91_cpx transmission cluster, demonstrating active growth.

60 APPLIED LIFE SCIENCES↗

Haar-Like Wavelets on Hierarchical Trees

Here, discrete wavelet methods, originally formulated in the setting of regularly sampled signals, can be adapted to data defined on a point cloud if some multiresolution structure is imposed on the cloud. A wide variety of hierarchical clustering algorithms can be used for this purpose, and the multiresolution structure obtained can be encoded by a hierarchical tree of subsets of the cloud. Prior work introduced the use of Haar-like bases defined with respect to such trees for approximation and learning tasks on unstructured data. This paper builds on that work in two directions. First, we present an algorithm for constructing Haar-like bases on general discrete hierarchical trees. Second, with an eye towards data compression, we present thresholding techniques for data defined on a point cloud with error controlled in the $L$ $\infty$ norm and in a Hölder-type norm. In a concluding trio of numerical examples, we apply our methods to compress a point cloud dataset, study the tightness of the $L$ $\infty$ error bound, and use thresholding to identify MNIST classifiers with good generalizability.

97 MATHEMATICS AND COMPUTING↗

Uncertainty-Aware Machine Learning for Small-Angle X-ray Scattering Analysis in Autonomous Experimentation

Small-angle X-ray scattering (SAXS) is a powerful high-throughput characterization tool for probing nanoscale structure in native sample environments, providing real-time morphological information such as nanoparticle size and shape during synthesis. However, automated SAXS data analysis for extracting meaningful structural parameters is non-trivial and remains a bottleneck in closed-loop experimentation towards autonomous materials discovery, which demands fast, reliable, and uncertainty-aware data analysis. Here, we develop a machine-learning approach for automated SAXS analysis tailored to closed-loop nanoparticle synthesis. A Random Forest (RF) regression model is trained on 100,000 synthetic SAXS curves generated from polydisperse spherical nanoparticles with realistic background contributions. Using normalized one-dimensional SAXS intensity profiles as input, the RF model directly predicts nanoparticle radius, size polydispersity, and background parameters, while the ensemble standard deviation across trees provides built-in uncertainty quantification (UQ). On synthetic data, we show that combining fit-quality metrics (R 2 , MAE) with thresholds on prediction uncertainty reliably identifies accurate parameter estimates without access to ground truth. We then apply the trained model to 365 experimental SAXS profiles of citrate-reduced gold nanoparticles synthesized using an automated droplet-flow microreactor with in situ SAXS at a synchrotron beamline, classifying the results into high- and low-confidence subsets based on UQ metrics. Finally, we integrate RF-based SAXS analysis into a simulated closed-loop optimization campaign using Gaussian process Bayesian optimization to minimize nanoparticle polydispersity, benchmarking against conventional automated Levenberg–Marquardt fitting. The RF-guided campaign exhibits substantially faster convergence and lower relative opportunity cost (∼0.07 vs ∼0.3), demonstrating that uncertainty-aware machine-learning SAXS analysis significantly enhances the efficiency and robustness of autonomous nanomaterials synthesis workflows.

Bayesian optimization↗

A Cyber-Physical Anomaly Detection for Wide-Area Protection Using Machine Learning

Wide-area protection scheme (WAPS) provides system-wide protection by detecting and mitigating small and large-scale disturbances that are difficult to resolve using local protection schemes. As this protection scheme is evolving from a substation-based distributed remedial action scheme (DRAS) to the control center-based centralized RAS (CRAS), it presents severe challenges to their cybersecurity because of its heavy reliance on an insecure grid communication, and its compromise would lead to system failure. This article presents an architecture and methodology for developing a cyber-physical anomaly detection system (CPADS) that utilizes synchrophasor measurements and properties of network packets to detect data integrity and communication failure attacks on measurement and control signals in CRAS. The proposed machine leaning-based methodology applies a rules-based approach to select relevant input features, utilizes variational mode decomposition (VMD) and decision tree (DT) algorithms to develop multiple classification models, and performs final event identification using a rules-based decision logic. Here, we have evaluated the proposed methodology of CPADS using the IEEE 39 bus system for several performance measures (accuracy, recall, precision, and F-measure) in a cyber-physical testbed environment. Furthermore, our experimental results reveal that the proposed algorithm (VMD-DT) of CPADS outperforms the existing machine learning classifiers during noisy and noise-free measurements while incurring an acceptable processing overhead.

24 POWER TRANSMISSION AND DISTRIBUTION↗

A deep learning approach to real-time HIV outbreak detection using genetic data

Pathogen genomic sequence data are increasingly made available for epidemiological monitoring. A main interest is to identify and assess the potential of infectious disease outbreaks. While popular methods to analyze sequence data often involve phylogenetic tree inference, they are vulnerable to errors from recombination and impose a high computational cost, making it difficult to obtain real-time results when the number of sequences is in or above the thousands. Here, we propose an alternative strategy to outbreak detection using genomic data based on deep learning methods developed for image classification. The key idea is to use a pairwise genetic distance matrix calculated from viral sequences as an image, and develop convolutional neutral network (CNN) models to classify areas of the images that show signatures of active outbreak, leading to identification of subsets of sequences taken from an active outbreak. We showed that our method is efficient in finding HIV-1 outbreaks with R0 ≥ 2.5, and overall a specificity exceeding 98% and sensitivity better than 92%. We validated our approach using data from HIV-1 CRF01 in Europe, containing both endemic sequences and a well-known dual outbreak in intravenous drug users. Our model accurately identified known outbreak sequences in the background of slower spreading HIV. Importantly, we detected both outbreaks early on, before they were over, implying that had this method been applied in real-time as data became available, one would have been able to intervene and possibly prevent the extent of these outbreaks. This approach is scalable to processing hundreds of thousands of sequences, making it useful for current and future real-time epidemiological investigations, including public health monitoring using large databases and especially for rapid outbreak identification.

59 BASIC BIOLOGICAL SCIENCES↗

Application of Quantum Machine Learning to High Energy Physics Analysis at LHC using IBM Quantum Computer Simulators and IBM Quantum Computer Hardware

One of the major objectives of the experimental programs at the LHC is the discovery of new physics. This requires the identification of rare signals in immense backgrounds. Using machine learning algorithms greatly enhances our ability to achieve this objective. With the progress of quantum technologies, quantum machine learning could become a powerful tool for data analysis in high energy physics. In this study, using IBM gate-model quantum computing systems, we employ the quantum variational classifier method and the quantum kernel estimator method in two recent LHC flagship physics analyses: $t\bar{t}H$ (Higgs boson production in association with a top quark pair) and $H\rightarrow\mu\mu$ (Higgs boson decays to two muons). We have obtained early results with 10 qubits on the IBM quantum simulator and the IBM quantum hardware. On the quantum simulator, the quantum machine learning methods perform similarly to classical algorithms such as SVM (support vector machine) and BDT (boosted decision tree), which are often employed in LHC physics analyses. On the quantum hardware, the quantum machine learning methods have shown promising discrimination power, comparable to that on the quantum simulator. This study demonstrates that quantum machine learning has the ability to differentiate between signal and background in realistic physics datasets.

Chan, Jay↗

Detecting anomalous packets in network transfers: investigations using PCA, autoencoder and isolation forest in TCP

Large-scale scientific workflows rely heavily on high-performance file transfers. These transfers require strict quality parameters such as guaranteed bandwidth, no packet loss or data duplication. To have successful file transfers, methods such as predetermined thresholds and statistical analysis need to be done to determine abnormal patterns. Network administrators routinely monitor and analyze network data for diagnosing and alleviating these, making decisions based on their experience. However, as networks grow and become complex, monitoring large data files and quickly processing them, makes it improbable to identify errors and rectify these. Abnormal file transfers have been classified by simply setting alert thresholds, via tools such as PerfSonar and TCP statistics (Tstat). This paper investigates the feasibility of unsupervised feature extraction methods for identifying network anomaly patterns with three unsupervised classification methods—principal component analysis, autoencoder and isolation forest. Here, we collect file transfer statistics from two experiment sets—synthetic iPerf generated traffic and 1000 Genome workflow runs, with synthetically introduced anomalies. Our results show that while PCA and a simple autoencoder finds it difficult to detect clusters, the tree-variant isolation forest is able to identify anomalous packets by breaking down TCP traces into tree classes early.

97 MATHEMATICS AND COMPUTING↗

Cacao pod transcriptome profiling of seven genotypes identifies features associated with post-penetration resistance to Phytophthora palmivora

Abstract The oomycete Phytophthora palmivora infects the fruit of cacao trees ( Theobroma cacao ) causing black pod rot and reducing yields. Cacao genotypes vary in their resistance levels to P. palmivora , yet our understanding of how cacao fruit respond to the pathogen at the molecular level during disease establishment is limited. To address this issue, disease development and RNA-Seq studies were conducted on pods of seven cacao genotypes (ICS1, WFT, Gu133, Spa9, CCN51, Sca6 and Pound7) to better understand their reactions to the post-penetration stage of P. palmivora infection. The pod tissue- P. palmivora pathogen assay resulted in the genotypes being classified as susceptible (ICS1, WFT, Gu133 and Spa9) or resistant (CCN51, Sca6 and Pound7). The number of differentially expressed genes (DEGs) ranged from 1625 to 6957 depending on genotype. A custom gene correlation approach identified 34 correlation groups. De novo motif analysis was conducted on upstream promoter sequences of differentially expressed genes, identifying 76 novel motifs, 31 of which were over-represented in the upstream sequences of correlation groups and associated with gene ontology terms related to oxidative stress response, defense against fungal pathogens, general metabolism and cell function. Genes in one correlation group (Group 6) were strongly induced in all genotypes and enriched in genes annotated with defense-responsive terms. Expression pattern profiling revealed that genes in Group 6 were induced to higher levels in the resistant genotypes. An additional analysis allowed the identification of 17 candidate cis -regulatory modules likely to be involved in cacao defense against P. palmivora . This study is a comprehensive exploration of the cacao pod transcriptional response to P. palmivora spread after infection. We identified cacao genes, promoter motifs, and promoter motif combinations associated with post-penetration resistance to P. palmivora in cacao pods and provide this information as a resource to support future and ongoing efforts to breed P. palmivora -resistant cacao.

60 APPLIED LIFE SCIENCES↗

AmeriFlux FLUXNET-1F US-Ton Tonzi Ranch

This is the AmeriFlux Management Project (AMP) created FLUXNET-1F version of the carbon flux data for the site US-Ton Tonzi Ranch. This is the FLUXNET version of the carbon flux data for the site US-Ton Tonzi Ranch produced by applying the standard ONEFlux (1F) software. Site Description - The Tonzi Ranch is located on the lower foothills of the Sierra Nevada Mountains. The site is classified as an oak savanna woodland (Davis et al, 2016) and is situated on privately owned land. This site is representative of the oak savanna ecosystem that rings the Great Central Valley of California and inhabits the lower reaches of the Sierra Nevada foothills. This ecosystem is a natural laboratory for studying how ecosystem scale carbon and water fluxes respond to environmental change. The temperatures range between 0 and 40 C, the autumn, winter and spring are wet and cool, while the summer growing season is hot, dry and rainless. The overstory is dominated by blue oak trees (40% of total vegetation) with intermittent grey pine trees (3 trees/ha). Understory species include a variety of grasses and herbs, including purple false brome, smooth cat's ear, and rose clover. These two distinctive layers operate in and out of phase from one another. Growing season of the understory is confined to the wet season only, typically from October to early May. In contrast, the deciduous blue oak trees are dormant and leafless during the rainy winter months. The trees tend to leaf out in March and reach maximum LAI in April. During the rainless summers, the grasses in the understory die and the leaves experience soil moisture deficit stress References Davis, F., et al. (2016). "Oak woodlands." Ecosystems of California: 509–529.

Ma, Siyan↗