SEARCH · Search NASA
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.
CID3 algorithm simulates self-growing neural network. Constructs decision trees equivalent to hidden layers of neural network. Based on ID3 algorithm, which dynamically generates decision tree while minimizing entropy of information. CID3 algorithm generates feedforward neural network by use of either crisp or fuzzy measure of entropy.
Many CLIPS rule-bases contain one or more rule groups that perform classification. In this paper we describe CLIPS-Induce, an automated system for the creation of a CLIPS classification rule-base from a set of test cases. CLIPS-Induce consists of two components, a decision tree induction component and a CLIPS production extraction component. ID3, a popular decision tree induction algorithm, is used to induce a decision tree from the test cases. CLIPS production extraction is accomplished through a top-down traversal of the decision tree. Nodes of the tree are used to construct query rules, and branches of the tree are used to construct classification rules. The learned CLIPS productions may easily be incorporated into a large CLIPS system that perform tasks such as accessing a database or displaying information.
System for computer construction, enumeration and notation of organic molecules as tree structures and cyclic graphs
Contour trees are used for topological data analysis in scientific visualization. While originally computed with serial algorithms, recent work has introduced a vector-parallel algorithm. Furthermore, this algorithm is relatively slow for fully augmented contour trees which are needed for many practical data analysis tasks. We therefore introduce a representation called the hyperstructure that enables efficient searches through the contour tree and use it to construct a fully augmented contour tree in data parallel, with performance on average 6 times faster than the state-of-the-art parallel algorithm in the TTK topological toolkit.
The existence of complete genome sequences makes it important to develop different approaches for classification of large-scale data sets and to make extraction of biological insights easier. Here, we propose an approach for classification of complete proteomes/protein sets based on protein distributions on some basic attributes. We demonstrate the usefulness of this approach by determining protein distributions in terms of two attributes: protein lengths and protein intrinsic disorder contents (ID). The protein distributions based on L and ID are surveyed for representative proteome organisms and protein sets from the three domains of life. The two-dimensional maps (designated as fingerprints here) from the protein distribution densities in the LD space defined by ln( L ) and ID are then constructed. The fingerprints for different organisms and protein sets are found to be distinct with each other, and they can therefore be used for comparative studies. As a test case, phylogenetic trees have been constructed based on the protein distribution densities in the fingerprints of proteomes of organisms without performing any protein sequence comparison and alignments. The phylogenetic trees generated are biologically meaningful, demonstrating that the protein distributions in the LD space may serve as unique phylogenetic signals of the organisms at the proteome level.
Automated cloud detection and tracking is an important step in assessing global climate change via remote sensing. Cloud masks, which indicate whether individual pixels depict clouds, are included in many of the data products that are based on data acquired on- board earth satellites. Many cloud-mask algorithms have the form of decision trees, which employ sequential tests that scientists designed based on empirical astrophysics studies and astrophysics simulations. Limitations of existing cloud masks restrict our ability to accurately track changes in cloud patterns over time. In this study we explored the potential benefits of automatically-learned decision trees for detecting clouds from images acquired using the Advanced Very High Resolution Radiometer (AVHRR) instrument on board the NOAA-14 weather satellite of the National Oceanic and Atmospheric Administration. We constructed three decision trees for a sample of 8km-daily AVHRR data from 2000 using a decision-tree learning procedure provided within MATLAB(R), and compared the accuracy of the decision trees to the accuracy of the cloud mask. We used ground observations collected by the National Aeronautics and Space Administration Clouds and the Earth s Radiant Energy Systems S COOL project as the gold standard. For the sample data, the accuracy of automatically learned decision trees was greater than the accuracy of the cloud masks included in the AVHRR data product.
Motivation Generating phylogenomic trees from the genomic data is essential in understanding biological systems. Each step of this complex process has received extensive attention and has been significantly streamlined over the years. Given the public availability of data, obtaining genomes for a wide selection of species is straightforward. However, analyzing that data to generate a phylogenomic tree is a multistep process with legitimate scientific and technical challenges, often requiring a significant input from a domain-area scientist. Results We present Poplar, a new, streamlined computational pipeline, to address the computational logistical issues that arise when constructing the phylogenomic trees. It provides a framework that runs state-of-the-art software for essential steps in the phylogenomic pipeline, beginning from a genome with or without an annotation, and resulting in a species tree. Running Poplar requires no external databases. In the execution, it enables parallelism for execution for clusters and cloud computing. The trees generated by Poplar match closely with state-of-the-art published trees. The usage and performance of Poplar is far simpler and quicker than manually running a phylogenomic pipeline. Availability and implementation Freely available on GitHub at https://github.com/sandialabs/poplar. Implemented using Python and supported on Linux.
One of the many remarkable properties of conformal field theory in two dimensions is its connection to algebraic geometry. Since every compact Riemann surface is a projective algebraic curve, many constructions of interest in physics (which a priori depend on the analytic structure of the spacetime) can be formulated in purely algebraic language. This opens the door to interesting generalizations, obtained by taking another choice of field: for instance, the p-adics. Herein, we generalize the $\mathrm{AdS} / \mathrm{CFT}$ correspondence according to this principle; the result is a formulation of holography in which the bulk geometry is discrete—the Bruhat–Tits tree for $\mathrm{PGL} (2, \mathbb{Q}_p)$—but the group of bulk isometries nonetheless agrees with that of boundary conformal transformations and is not broken by discretization. We anticipate that this forms the natural geometric setting for tensor networks that have been proposed as models of bulk reconstruction via quantum error correcting codes; in certain cases, geodesics in the Bruhat–Tits tree reproduce those constructed using quantum error correction. Other aspects of holography also hold: Standard holographic results for massive free scalar fields in a fixed background carry over to the tree, whose vertical direction can be interpreted as a renormalization-group scale for modes in the boundary $\mathrm{CFT}$. Higher-genus bulk geometries (the $\mathrm{BTZ}$ black hole and its generalizations) can be understood straightforwardly in our setting, and the Ryu–Takayanagi formula for the entanglement entropy appears naturally
The CloudSat Project has developed a simplified approach for fault tree analysis and probabilistic risk assessment. A system-level fault tree has been constructed to identify credible fault scenarios and failure modes leading up to a potential failure to meet the nominal mission success criteria.
The backbone approach to constructing a ground-motion logic tree for probabilistic seismic hazard analysis (PSHA) can address shortcomings in the traditional approach of populating the branches with multiple existing, or potentially modified, ground-motion models (GMMs) by rendering more transparent the relationship between branch weights and the resulting distribution of predicted accelerations. To capture epistemic uncertainty in a tractable manner, there are benefits in building the logic tree through the application of successive adjustments for differences in source, path, and site characteristics between the host region of the selected backbone GMM and the target region for which the PSHA is being conducted. The implementation of this approach is facilitated by selecting a backbone GMM that is amenable to such host-to-target adjustments for individual source, path, and site characteristics. The NGA-West2 GMM of Chiou and Youngs (CY14) has been identified as a highly adaptable model for crustal seismicity that is well suited to such adjustments. Rather than using generic source, path, and site characteristics assumed appropriate for the host region, the final suite of adjusted GMMs for the target region will be better constrained if the host-region parameters are defined specifically on the basis of their compatibility with the CY14 backbone GMM. To this end, making use of a recently developed crustal shear-wave velocity profile consistent with CY14, we present an inversion of the model to estimate the key source and path parameters, namely the stress parameter and the anelastic attenuation. With these outputs, the effort in constructing a ground-motion logic tree for any PSHA dealing with crustal seismicity can be focused primarily on the estimation of the target-region characteristics and their associated uncertainties. The inversion procedure can also be adapted for any application in which different constraints might be relevant.
Decision trees have been a very popular class of predictive models for decades due to their interpretability and good performance on categorical features. However, they are not always robust and tend to overfit the data. Additionally, if allowed to grow large, they lose interpretability. In this paper, we present a mixed integer programming formulation to construct optimal decision trees of a prespecified size. We take the special structure of categorical features into account and allow combinatorial decisions (based on subsets of values of features) at each node. Our approach can also handle numerical features via thresholding. Here we show that very good accuracy can be achieved with small trees using moderately-sized training sets. The optimization problems we solve are tractable with modern solvers.
A major impediment to a systematic attack on Ada software reusability is the lack of an effective taxonomy for software component functions. The scope of all possible applications of Ada software is considered too great to allow the practical development of a working taxonomy. Instead, for the purposes herein, the scope of Ada software application is limited to device and subsystem control in real-time embedded systems. A functional approach is taken in constructing the taxonomy tree for identified Ada domain. The use of modular software functions as a starting point fits well with the object oriented programming philosophy of Ada. Examples of the types of functions represented within the working taxonomy are real time kernels, interrupt service routines, synchronization and message passing, data conversion, digital filtering and signal conditioning, and device control. The constructed taxonomy is proposed as a framework from which a need analysis can be performed to reveal voids in current Ada real-time embedded programming efforts for Space Station.
Abstract Objective We investigate surname affinities among areas of modern‐day China, by constructing a spatial network, and making community detection. It reports a geographical genealogy of the Chinese population that is result of population origins, historical migrations, and societal evolutions. Materials and methods We acquire data from the census records supplied by China's National Citizen Identity Information System, including the surname and regional information of 1.28 billion registered Chinese citizens. We propose a multilayer minimum spanning tree (MMST) to construct a spatial network based on the matrix of isonymic distances, which is often used to characterize the dissimilarity of surname structure among areas. We use the fast unfolding algorithm to detect network communities. Results We obtain a 10‐layer MMST network of 362 prefecture nodes and 3,610 edges derived from the matrix of the Euclidean distances among these areas. These prefectures are divided into eight groups in the spatial network via community detection. We measure the partition by comparing the inter‐distances and intra‐distances of the communities and obtain meaningful regional ethnicity classification. Discussion The visualization of the resulting communities on the map indicates that the prefectures in the same community are usually geographically adjacent. The formation of this partition is influenced by geographical factors, historic migrations, trade and economic factors, as well as isolation of culture and language. The MMST algorithm proves to be effective in geo‐genealogy and ethnicity classification for it retains essential information about surname affinity and highlights the geographical consanguinity of the population.
The Sordariomycetes is a specious, morphologically diverse, and widely distributed class of the phylum Ascomycota that forms a well-supported clade diverged from Leotiomycetes. Aside from their ecological significance as plant and human pathogens, saprobes, endophytes, and fungicolous taxa, species of Sordariomycetes produces a wide range of chemically novel and diverse metabolites used in important fields. Recent phylogenetic analyses derived from a small number of genes have considerably increased our understanding of the family, order, and subclass relationships within Sordariomycetes, but several important groups have not been resolved well. In addition, there are various paraphyletic or polyphyletic groups. Moreover, the criteria used to establish higher ranks remain highly variable across different studies. Therefore, the taxonomy of Sordariomycetes is in constant flux, remains poorly understood, and is subject to much controversy. Here, for the first time, we have assembled a phylogenetic dataset containing 638 genomes representing the 156 genera, 50 families, and 17 orders and 5 subclasses of Sordariomycetes. This data set is based on 1124 genes and results in a well-resolved phylogenomic tree. We further constructed an evolutionary timeline of Sordariomycetes diversification based on the genomic data sets. Our divergence time estimate results are inconsistent with previous studies, suggesting estimates of node ages are less precise and varied. Based on these results, we discuss the higher ranks of Sordariomycetes and empirically propose an unprecedented taxonomic framework for the class.
Abstract Lianas, woody vines acting as structural parasites of trees, have profound effects on the composition and structure of tropical forests, impacting tree growth, mortality, and forest succession. Remote sensing could offer a powerful tool for quantifying the scale of liana infestation, provided the availability of robust detection methods. We analyze the consistency and global geographic specificity of spectral signals—reflectance across wavelengths—from liana‐infested tree crowns and forest stands, examining the underlying mechanisms of these signals. We compiled a uniquely comprehensive database, including leaf reflectance spectra from 5424 leaves, fine‐scale airborne reflectance data from 999 liana‐infested canopies, and coarse‐scale satellite reflectance data covering 775 ha of liana‐infested forest stands. To unravel the mechanisms of the liana spectral signal, we applied mechanistic radiative transfer models across scales, establishing a synthesis of the relative importance of different mechanisms, which we corroborate with field data on liana leaf chemistry and canopy structure. We find a consistent liana spectral signal at canopy and stand scales across globally distributed sites. This signature mainly arises at the canopy level due to direct effects of more horizontal leaf angles, resulting in a larger projected leaf area, and indirect effects from increased light scattering in the near and short‐wave infrared regions, linked to lianas' less costly leaf construction compared with trees on average. The existence of a consistent global spectral signal for lianas suggests that large‐scale quantification of liana infestation is feasible. However, because the traits responsible for the liana canopy‐reflectance signal are not exclusive to lianas, accurate large‐scale detection requires rigorously validated remote sensing methods. Our models highlight challenges in automated detection, such as potential misidentification due to leaf phenology, tree life history, topography, and climate, especially where the scale of liana infestation is less than a single remote sensing pixel. The observed cross‐site patterns also prompt ecological questions about lianas' adaptive similarities in optical traits across environments, indicating possible convergent evolution due to shared constraints on leaf biochemical and structural traits.
Abstract Macaronesia has long been recognized as a natural model for studying evolutionary processes in plant diversification. Several studies have attempted to focus on single lineages, and few have covered the diversification of a family across all the archipelagos. We used a comprehensive sample to clarify the phylogenetic relationships and the biogeographic history of the Macaronesian Campanulaceae. Hypotheses related to the colonization of these archipelagos will be used to examine the diversification patterns of different lineages. We sequenced the ITS region and six cp DNA markers ( atpB , matK , petD , rbcL , trnL‐F , and psbA‐trnH ) from 10 Campanulaceae species, including seven endemic species in Macaronesia. The phylogeny of these taxa was reconstructed using maximum parsimony, maximum likelihood, and Bayesian inference. To study the relationships within each lineage, haplotype networks were calculated using NeighborNet and TCS algorithms. Moreover, data were combined with fossil information to construct time‐calibrated trees for the Macaronesian Campanulaceae species. The phylogenetic analyses are largely congruent with current taxon circumscriptions, and all the endemic genera formed monophyletic clades, namely Azorina in Azores; Musschia in Madeira; and Campanula in Cape Verde. The Azorina clade and the Cape Verde endemic Campanula may share a common ancestor in North Africa, and the divergence was dated ca. 12.3 million years ago (Mya). The divergence of the Musschia clade began in the Pliocene ca. 3.4 Mya. Moreover, several examples of intraspecific variation were revealed among the native species with a clear geographic structured patterns, suggesting that cryptic diversity might exist within the native Macaronesian Campanulaceae when compared to the close mainland taxa (e.g., Campanula erinus , Trachelium caeruleum ), but additional studies are needed to support the molecular data. This study highlights the power of combining data (e.g., phylogeny and divergence times, with species distribution data) for testing diversification hypotheses within the unique Macaronesian flora, providing useful information for future conservation efforts.
We present a new on-shell recursion relation for scattering amplitudes involving Nambu-Goldstone bosons with a gauged unbroken symmetry. A central challenge is that gauge interactions break Adler’s zero condition for charged scalars, invalidating the standard soft recursion. To overcome this, we introduce a “gauged soft recursion” that leverages the soft theorems of the gauge bosons themselves, combined with a novel decomposition of amplitudes into gauge-invariant components where Adler’s zero is partially restored. The formalism, which also incorporates internal gauge bosons via angular momentum constraints, enables the systematic construction of tree-level amplitudes with arbitrary numbers of Goldstone bosons and gauge bosons in both Abelian and non-Abelian theories, as we demonstrate with explicit examples.
Background: Willows are widely distributed in the northern hemisphere and have good adaptability to different living environment. The increasing of genome and transcriptome data provides a chance for comparative analysis to study the evolution patterns with the different origin and geographical distributions in the Salix phylogeny. Results: Transcript sequences of 10 Salicaceae species were downloaded from public databases. All pairwise of orthologues were identified by comparative analysis in these species, from which we constructed a phylogenetic tree and estimated the rate of diverse. Divergence times were estimated in the 10 Salicaceae using comparative transcriptomic analysis. All of the fast-evolving positive selection sequences were identified, and some cold-, drought-, light-, universal-, and heat- resistance genes were discovered. Conclusions: The divergence time of subgenus Vetrix and Salix was about 17.6–16.0 Mya during the period of Middle Miocene Climate Transition (21–14 Mya). Subgenus Vetrix diverged to migratory and resident groups when the climate changed to the cool and dry trend by 14 Mya. Cold- and light- stress genes were involved in positive selection among the resident Vetrix, and which would help them to adapt the cooling stage. Universal- stress genes exhibited positive selection among the migratory group and subgenus Salix. These data are useful for comprehending the adaptive evolution and speciation in the Salix lineage.