Search NASA⌕ Search

SEARCH · Search NASA

Results for “Merge trees”

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.

79 records · Page 5

Cosmological simulations of early black hole formation: halo mergers, tidal disruption, and the conditions for direct collapse

Gravitational collapse of a massive primordial gas cloud is thought to be a promising path for the formation of supermassive black holes in the early universe. We study conditions for the so-called direct collapse (DC) black hole formation in a fully cosmological context. We combine a semianalytic model of early galaxy formation with halo merger trees constructed from dark matter N-body simulations. We locate a total of 68 possible DC sites in a volume of 20 h{sup −1} Mpc on a side. We then perform hydrodynamics simulations for 42 selected halos to study in detail the evolution of the massive clouds within them. We find only two successful cases where the gas clouds rapidly collapse to form stars. In the other cases, gravitational collapse is prevented by the tidal force exerted by a nearby massive halo, which otherwise should serve as a radiation source necessary for DC. Ram pressure stripping disturbs the cloud approaching the source. In many cases, a DC halo and its nearby light source halo merge before the onset of cloud collapse. When the DC halo is assembled through major mergers, the gas density increases rapidly to trigger gravitational instability. Based on our cosmological simulations, we conclude that the event rate of DC is an order of magnitude smaller than reported in previous studies, although the absolute rate is still poorly constrained. It is necessary to follow the dynamical evolution of a DC cloud and its nearby halo(s) in order to determine the critical radiation flux for DC.

79 ASTRONOMY AND ASTROPHYSICS↗

The Relationship of Forest Fires Detected by MODIS and SRTM Derived Topographic Features in Central Siberia

Fires are a common occurrence in the Siberian boreal forest. The MOD14 Thermal anomalies product of the Terra MODIS Moderate Resolution Spectroradiometer) product set is designed to detect thermal anomalies (i.e. hotspots or fires) on the Earth's surface. Recent field studies showed a dependence of fire occurrence on topography. In this study MODIS thermal anomaly data and SRTM topography data were merged and analyzed to evaluate if forest fires are more likely to occur at certain combinations of elevation, slope and aspect. Using the satellite data over a large area can lead to better understanding how topography and forest fires are related. The study area covers a 2.5 Million krn(exp 2) portion of the Central Siberian southern taiga from 72 deg to 110 deg East and from 50 deg to 60 deg North. About 57% of the study area is forested and 80% of the forest grows between 200 and 1000 m. Forests with pine (Pinus sylvestris), larch (Larix sibirica, L. gmelinii), Siberian pine (Pinus sibirica), spruce (Picea obovata.) and fir (Abies sibirica) cover most of the landscape. Deciduous stands with birch (Betula pendula, B. pubescens) and aspen (Populus tremula) cover the areas of lower elevation in this region. The climate of this area is distinctly continental with long, cold winters and short hot summers. The tree line in this part of the world is around 1500 m in elevation with alpine tundra, snow and ice fields and rock outcrops extending up to over 3800 m. A 500 m resolution landcover map was developed using 2001 MODIS MOD13 Normalized Vegetation Index (NDVI) and Middle Infrared (MIR) products for seven 16-day periods. The classification accuracy was over 87%. The SRTM version 2 data, which is distributed in 1 degree by 1 degree tiles were mosaiced using the ENVI software. In this study, only those MODIS pixels were used that were flagged as "nominal or high confidence fire" by the MODIS fire product team. Using MODIS data from the years 2000 to 2005 along with the improved Shuttle Radar Topographic Mission (SRTM) version 2 data at 100 m resolution, the distribution of hot spots was examined by elevation, slope and aspect as well as by forest type. The results show that more forest area burns at lower elevations but a larger percentage of the available forest area burns at higher elevations. This is probably because steep slopes occur at higher elevations. Fires are only more common on slopes with a southern exposure if the slope is steeper than 15 degrees. The next step in this study will be to monitor areas where the risk of fire is high (steep slopes with a southern exposure) and to refine this method by incorporating anthropogenic features for more accurate fire disturbance monitoring.

Ranson, Jon K.↗

Expectation-maximization algorithms for learning a finite mixture of univariate survival time distributions from partially specified class values

Heterogeneity exists on a data set when samples from di erent classes are merged into the data set. Finite mixture models can be used to represent a survival time distribution on heterogeneous patient group by the proportions of each class and by the survival time distribution within each class as well. The heterogeneous data set cannot be explicitly decomposed to homogeneous subgroups unless all the samples are precisely labeled by their origin classes; such impossibility of decomposition is a barrier to overcome for estimating nite mixture models. The expectation-maximization (EM) algorithm has been used to obtain maximum likelihood estimates of nite mixture models by soft-decomposition of heterogeneous samples without labels for a subset or the entire set of data. In medical surveillance databases we can find partially labeled data, that is, while not completely unlabeled there is only imprecise information about class values. In this study we propose new EM algorithms that take advantages of using such partial labels, and thus incorporate more information than traditional EM algorithms. We particularly propose four variants of the EM algorithm named EM-OCML, EM-PCML, EM-HCML and EM-CPCML, each of which assumes a specific mechanism of missing class values. We conducted a simulation study on exponential survival trees with five classes and showed that the advantages of incorporating substantial amount of partially labeled data can be highly signi cant. We also showed model selection based on AIC values fairly works to select the best proposed algorithm on each specific data set. A case study on a real-world data set of gastric cancer provided by Surveillance, Epidemiology and End Results (SEER) program showed a superiority of EM-CPCML to not only the other proposed EM algorithms but also conventional supervised, unsupervised and semi-supervised learning algorithms.

97 MATHEMATICS AND COMPUTING↗

A Machine Learning Approach to Improve Air Traffic Management Initiatives

Collaborating closely with commercial air carriers and related organizations, the Federal Aviation Administration(FAA) regulates air traffic and ensures the safety and efficiency of air operations. Air traffic controllers make strategic decisions, such as delaying, rerouting, or canceling flights, partly based on guidance provided by the FAA’s Air TrafficControl System Command Center (ATCSCC). The guidance includes, among other things, control measures known asTraffic Management Initiatives (TMIs) designed to enhance safety and improve operational efficiency. TMIs play a crucial role in managing the demand and capacity within the U.S. National Airspace System (NAS). Two major TMIs that are routinely used (primarily to mitigate the adverse effects of bad weather) are Ground Delay Programs (GDPs) andGround Stops (GSs). In a GDP, flights destined for airports facing thunderstorm activity experience delays at their origin airports. This proactive approach minimizes the risk of routing aircraft through hazardous weather conditions and also replaces (fuel burning) airborne delays with ground delays. In a GS, a temporary restriction is imposed on the departure or arrival of aircraft at a specific airport or within a designated airspace. Although other TMIs (e.g., miles-in-trail) are also implemented as part of (air) traffic flow management in the NAS, the focus of this work is on GDPs and GSs. Since TMIs, by design, lead to flight delays or cancellations, it is crucial to put in place the right set of parameters(e.g., scope and duration of the GDP). For example, when the end time of a GDP extends beyond what is necessary, it imposes unnecessary delays on departing flights. This situation could occur as a result of inaccurate prediction of the(required) duration of the GDP based on the weather forecast. On the other hand, if a GDP ends prematurely before the underlying capacity constraints are resolved at the destination airport, it may result in airborne holding. The delicate balance lies in matching the termination of the GDP precisely with the resolution of capacity constraints, avoiding both the imposition of unnecessary ground delays and the need for airborne holding due to premature program termination.Failing to specify the right parameters for TMIs also leads to flight delays, creating a significant obstacle in managing the increasing traffic volumes causing increased work load for the controllers. To address this issue, we propose the integration of Machine Learning (ML) models in the traffic flow management(TFM) pipeline. In current operations, decisions are made by human experts based on extensive training, historical patterns, available traffic and weather data. Since we have an abundance of data from past events that tell us the likely impact of various TMIs, by ingesting historical data, properly trained ML models can offer valuable insights and aid human decision-making. With the FAA increasingly exploring advanced analytics, ML emerges as a focal point for enhancing TFM within the National Airspace System (NAS). As a first step, this study aims to provide traffic controllers with decision-making support for the issuance and adjustment of TMIs. Data analytics and machine learning have been previously employed to address some of the challenges associated with TMIs. Numerous studies have concentrated on various facets of TMI issuance, exploring factors influencing TMI parameters, including arrival rate, airport capacity, and delay prediction. For example, using weather forecasts, several statistical methods were used to produce probabilistic capacity profiles which in conjunction with deterministic models provided insights into the GDP planning process [1–4]. The downside of using deterministic models is that they rely on fixed inputs and predetermined rules, which lack the ability to account for the inherent uncertainty and variability present in real-world scenarios. In a separate series of studies, researchers aimed to predict the occurrences of GDPs and GSs. The majority of these studies utilized various supervised learning methods, including Decision Trees, Naive Bayes, Support VectorMachines, and Random Forests to analyze the influence of weather conditions and arrival demand on TMI incidents[5–8]. However, these studies primarily focused on predicting the incidence of TMIs without explicitly addressing the scope of TMIs, including their duration and their geographical coverage. Furthermore, the emphasis of these studies was largely on GDPs, given their higher frequency and longer duration when compared to GSs. A limited number of studies focused on predicting the parameters of TMIs, specifically addressing their duration and extent. In one such study focusing on optimizing the TMI parameters at San Francisco International Airport (SFO),the authors utilized a probabilistic forecast of fog [9]. They simulated various capacity scenarios based on the (fog)burn-off forecasts, selecting GDP parameters that minimized airborne and overall ground delays. However, this approach exclusively emphasizes stratus (fog) burn-off as the primary determinant of GDP and GS, neglecting other influential factors like severe weather events, runway closures, lower capacity than traffic demand, and other important variables. Given the complexity of predicting the TMI and determining its scope, we seek a more holistic approach. We aim to consider all significant factors that could impact TMIs and their parameters. What sets this research apart is the fusion of all data sources relevant to the issuance and adjustment of TMIs and it represents the first comprehensive attempt to optimize TMIs in this manner. Since this comprehensive solution involves various aspects, we break down the problem into smaller components and input all parameters into a unified model called the “TMI Adjuster”. Figure 1 shows the overall framework and the list of datasets used in each model. The objective of the TMI Adjuster module is to deliver reliable, consistent and expedited recommendations for the progression, adjustment, and termination of TMIs. The ML solution entails developing a pipeline capable of predicting the necessity of a TMI (e.g., GS or GDP) along with its various parameters. For example, in the case of a GS, this includes the scope of the GS either in terms of distance from the destination airport or based on pre-defined airspace sectors. Here, scope refers to those regions and departing airports that are subject to the GS. In this paper, we concentrate on the issuance of GSs in the three major airports in the New York area — LaGuardia(LGA), John F. Kennedy International (JFK), and Newark Liberty International (EWR). We fuse traffic, weather and other relevant aviation data from years 2017 to 2019 to train and validate the ML models. In particular, we use the following datasets: •Terminal Aerodrome Forecast (TAF): meteorological forecasts specific to each airport, issued four times a day, covering predefined time periods. •TMI data: includes all GSs and GDPs along with their respective parameters. •Aviation System Performance Metrics (ASPM): includes traffic related data such as aircraft delays, arrival, and departure rates. •Notices to Airmen (NOTAMs): utilized to extract runway closure data and manage interdependencies between terminals in close proximity. •Flight cancellation data •Airspace Flow Programs (AFP): includes information on flight airborne holdings caused by TMIs. The data preprocessing entails transforming ASPM, TMI, AFP, NOTAMs, and weather data into an hourly format and consolidating all datasets by merging them based on date and time as the primary key. The TMI Adjuster framework comprises two parallel models: one dedicated to GS and a second model focused on GDP. As previously mentioned, our specific focus is on the GS model as a multi-classification problem. In this framework, each data point of the GS model input summarizes ten hours of data. Specifically, the data loader for the GS model generates the input and output of the model as follows: at a given time step, the input includes the actual traffic, weather, and TMI data from the two-hour window before the time step, alongside the weather forecast and scheduled traffic for the next 8 hours starting from the time step. Based on this information, the output of the GS model for each time interval consists of three dimensions. The first dimension represents a binary decision on whether there should be a GS in place for the next hour or not. The second dimension is related to the scope of the GS in the United States, and the third dimension is related to the scope of the GS in Canada (i.e., to determine if the GS impacts airports in Canada).One of the challenges with TMI modeling is the sparsity of TMI events, particularly regarding its scope. To address this challenge in the scope of the GS model output, we implement grouping. The GS scope for the US region is defined based on a list of centers that should be included when the GS is in place. With 20 centers in the US, we utilized historical data to group them into 4 categories. In particular, we summarized our historical data in a graph format where nodes represent centers, and link weights are defined based on the co-occurrence of centers in the scope parameter ofTMIs. By identified strongly connected components in this graph, we were able to partition the centers into four groups. We consider two model structures for the GS Model. Firstly, a hierarchical classification model [10], where the human decision-making for a GS is of hierarchical nature. The decision-maker first decides whether there is a need fora GS, and if the answer is yes, determines the scope. A hierarchical classification model organizes the problem into a class hierarchy, typically a tree or a Directed Acyclic Graph (DAG) structure, and considers the dependency of the decision in the previous step to the next component [10]. Here, we employ the local classifier per level approach, which involves training one multi-class classifier for each level of the class hierarchy. The second structure is the independent structure. In this setting, as the name suggests, we do not consider the dependency of the decisions in the different dimensions of the output of the model. Instead, for each dimension, we train a multi-class classifier independently. Table 1 summarizes GS model statistics for training, validation and testing. The table documents the effect of limiting data to the time steps when there was actually a TMI in place or when a TMI had just terminated. This resulted in a more balanced distribution of the GS class(GS positive class)versus “No GS”(GS negative class), which might help the training process. While JFK and LGA follow very similar distributions, with 40% and 42% GS positive class respectively, EWR has proportionally fewer GS incidents at 28%. Our subsequent phase involves evaluating the performance of both hierarchical structure and independent structure using different state-of-the-art multi-class classifier models such as Random Forest, Decision Trees, K-nearest Neighbors, and Logistic Regression and forecast the duration and scope of the GSs.

Farzan Masrour Shalmani↗

THE HALO MERGER RATE IN THE MILLENNIUM SIMULATION AND IMPLICATIONS FOR OBSERVED GALAXY MERGER FRACTIONS

We have developed a new method to extract halo merger rates from the Millennium Simulation. First, by removing superfluous mergers that are artifacts of the standard friends-of-friends (FOF) halo identification algorithm, we find a lower merger rate compared to previous work. The reductions are more significant at lower redshifts and lower halo masses, and especially for minor mergers. Our new approach results in a better agreement with predictions from the extended Press-Schechter model. Second, we find that the FOF halo finder overestimates the halo mass by up to 50% for halos that are about to merge, which leads to an additional {approx}20% overestimate of the merger rate. Therefore, we define halo masses by including only particles that are gravitationally bound to their FOF groups. We provide new best-fitting parameters for a global formula to account for these improvements. In addition, we extract the merger rate per progenitor halo, as well as per descendant halo. The merger rate per progenitor halo is the quantity that should be related to observed galaxy merger fractions when they are measured via pair counting. At low-mass/redshift, the merger rate increases moderately with mass and steeply with redshift. At high enough mass/redshift (for the rarest halos with masses a few times the 'knee' of the mass function), these trends break down, and the merger rate per progenitor halo decreases with mass and increases only moderately with redshift. Defining the merger rate per progenitor halo also allows us to quantify the rate at which halos are being accreted onto larger halos, in addition to the minor and major merger rates. We provide an analytic formula that converts any given merger rate per descendant halo into a merger rate per progenitor halo. Finally, we perform a direct comparison between observed merger fractions and the fraction of halos in the Millennium Simulation that have undergone a major merger during the recent dynamical friction time, and find a fair agreement, within the large uncertainties of the observations. Our new halo merger trees are available at http://www.mpe.mpg.de/ir/MillenniumMergerTrees/.

79 ASTRONOMY AND ASTROPHYSICS↗

Recent Developments in SHERPA

Some recent QCD-related developments in the SHERPA event generator are presented. In the past decades, event generators such as PYTHIA [1, 2] and HERWIG [3, 4] have been central for nearly all physics analyses at particle physics experiments at the high-energy frontier. This will also hold true at the LHC, where a large number of interesting signals for new particles or new phenomena (the Higgs boson or any other manifestation of the mechanism behind electro-weak symmetry breaking, supersymmetry, extra dimensions etc.) is hampered by a plethora of severe, sometimes overwhelming backgrounds. Nearly all of them are largely influenced by QCD. Therefore it seems fair to say that the success of the LHC in finding new physics may very well depend on a deep and detailed understanding of old physics, like QCD. Examples for this include, among others, the central-jet veto for the vector boson fusion channel for Higgs production or topologies, where gauge bosons emerge in association with many jets, a background for many search channels. In a reflection on increased needs by the experimental community, aiming at higher precision, incorporation of new physics models and so on, the work horses of old have undergone serious renovation efforts, resulting in new, improved versions of the respective codes, namely PYTHIA8 [5] and HERWIG++ [6]. In addition a completely new code, SHERPA [7], has been constructed and is in the process of maturing. The status of this code is the topic of this contribution. SHERPA's hallmark property is the inclusion of higher-order tree-level QCD contributions, leading to an improved modelling of jet production. They are introduced through a full-fledged matrix element generator, AMEGIC++ [8], which is capable of generating matrix elements and corresponding phase space mappings for processes with multi-particle final states in various models, including the Standard Model, anomalous gauge triple and quadruple couplings according to [9, 10], the Minimal Supersymmetric Standard Model with Feynman rules from [11], the ADD-model of extra dimensions [12, 13], and a model with an extra U(1) singlet coupling to the Higgs boson only [14]. The code has been thoroughly tested and validated [15]. This code, however, is limited, especially in the treatment of many ({ge} 6) external QCD particles. Therefore, in the near future, SHERPA will incorporate another, new matrix element generator, COMIX, which is based on Berends-Giele recursion relations [16] and color-dressing [17] rather than color-ordering. In Tabs. 1 and 2 some example cross sections for gg {yields} ng at fixed energies and pp {yields} b{bar b} + n jets obtained with this program are exhibited and compared to those from other programs. In addition, concerning the calculation of higher-order matrix elements and cross sections, there have been first steps towards an automation of such calculations at truly next-to leading order accuracy. They manifest themselves in the implementation of a procedure [19] to fully automatically construct and evaluate Catani-Seymour dipole subtraction terms [20] for the real part of such NLO calculations. The results from the matrix element calculations are merged with the subsequent parton shower through the formalism of [21, 22]. The results of its implementation in SHERPA [23] has recently been compared with other algorithms [24]. Although there remains some dispute about the theoretical equivalence of the different approaches, the overall results show satisfying agreement with each other, such that they can be used with confidence for data analysis.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

UNDERSTANDING BLACK HOLE MASS ASSEMBLY VIA ACCRETION AND MERGERS AT LATE TIMES IN COSMOLOGICAL SIMULATIONS

Accretion is thought to primarily contribute to the mass accumulation history of supermassive black holes (SMBHs) throughout cosmic time. While this may be true at high redshifts, at lower redshifts and for the most massive black holes (BHs) mergers themselves might add significantly to the mass budget. We explore this in two disparate environments—a massive cluster and a void region. We evolve SMBHs from 4 > z > 0 using merger trees derived from hydrodynamical cosmological simulations of these two regions, scaled to the observed value of the stellar mass fraction to account for overcooling. Mass gains from gas accretion proportional to bulge growth and BH-BH mergers are tracked, as are BHs that remain ''orbiting'' due to insufficient dynamical friction in a merger remnant, as well as those that are ejected due to gravitational recoil. We find that gas accretion remains the dominant source of mass accumulation in almost all SMBHs; mergers contribute 2.5% ± 0.1% for all SMBHs in the cluster and 1.0% ± 0.1% in the void since z = 4. However, mergers are significant for massive SMBHs. The fraction of mass accumulated from mergers for central BHs generally increases for larger values of the host bulge mass: in the void, the fraction is 2% at M {sub *,} {sub bul} = 10{sup 10} M {sub ☉}, increasing to 4% at M {sub *,} {sub bul} ≳ 10{sup 11} M {sub ☉}, and in the cluster it is 4% at M {sub *,} {sub bul} = 10{sup 10} M {sub ☉} and 23% at 10{sup 12} M {sub ☉}. We also find that the total mass in orbiting SMBHs is negligible in the void, but significant in the cluster, in which a potentially detectable 40% of SMBHs and ≈8% of the total SMBH mass (where the total includes central, orbiting, and ejected SMBHs) is found orbiting at z = 0. The existence of orbiting and ejected SMBHs requires modification of the Soltan argument. We estimate this correction to the integrated accreted mass density of SMBHs to be in the range 6%-21%, with a mean value of 11% ± 3%. Quantifying the growth due to mergers at these late times, we calculate the total energy output and strain from gravitational waves emitted by merging SMBHs, and obtain a signal potentially detectable by pulsar timing arrays.

79 ASTRONOMY AND ASTROPHYSICS↗