Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Model assignment”

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.

800 records · Page 45
All sourcesNASA NTRSDOE OSTI
NASA NTRS1986

Cost Risk Analysis Based on Perception of the Engineering Process

In most cost estimating applications at the NASA Langley Research Center (LaRC), it is desirable to present predicted cost as a range of possible costs rather than a single predicted cost. A cost risk analysis generates a range of cost for a project and assigns a probability level to each cost value in the range. Constructing a cost risk curve requires a good estimate of the expected cost of a project. It must also include a good estimate of expected variance of the cost. Many cost risk analyses are based upon an expert's knowledge of the cost of similar projects in the past. In a common scenario, a manager or engineer, asked to estimate the cost of a project in his area of expertise, will gather historical cost data from a similar completed project. The cost of the completed project is adjusted using the perceived technical and economic differences between the two projects. This allows errors from at least three sources. The historical cost data may be in error by some unknown amount. The managers' evaluation of the new project and its similarity to the old project may be in error. The factors used to adjust the cost of the old project may not correctly reflect the differences. Some risk analyses are based on untested hypotheses about the form of the statistical distribution that underlies the distribution of possible cost. The usual problem is not just to come up with an estimate of the cost of a project, but to predict the range of values into which the cost may fall and with what level of confidence the prediction is made. Risk analysis techniques that assume the shape of the underlying cost distribution and derive the risk curve from a single estimate plus and minus some amount usually fail to take into account the actual magnitude of the uncertainty in cost due to technical factors in the project itself. This paper addresses a cost risk method that is based on parametric estimates of the technical factors involved in the project being costed. The engineering process parameters are elicited from the engineer/expert on the project and are based on that expert's technical knowledge. These are converted by a parametric cost model into a cost estimate. The method discussed makes no assumptions about the distribution underlying the distribution of possible costs, and is not tied to the analysis of previous projects, except through the expert calibrations performed by the parametric cost analyst.

Dean, Edwin B.↗
NASA NTRSDate not supplied

Digitizing Named Entities Found Within Letters of Agreement

Letters of Agreement (LOAs) are text-based air traffic control documents that contain procedures and actions agreed upon by the different parties, typically two or more FAA facilities, that are subject to an agreement. The documents contain among other things generic constraints, which are explicit and implicit combinations of procedures that limit a flight’s trajectory and affects pilot actions. For example, a controller may be required, to assign a specific altitude to an aircraft crossing the boundary between two airspaces. Although LOA generic constraints directly impact the trajectory of an aircraft, they are not currently available in a digital form that can be used for (or directly ingested into automated) flight planning. Instead, the constraints are manually input into an onboard or ground based system. LOA documents are primarily stored at a controlling facility and the generic constraints are implemented by experienced air traffic controllers and pilots primarily using voice instructions. This increases the workload of the controllers, likelihood of error (e.g., due to noisy communication) and makes it impractical for implementation with unmanned aircraft. Therefore, steps must be taken to make existing constraints machine interpretable to enable e.g., automated handoffs which in turn would reduce controller workload. With recent advances in natural language processing, especially the rise in digitization of text documents (e.g., medical documents) and automated extraction of information therein, it is now possible to extract flight specific constraints from LOAs. The goal of this work is to digitize named entities through a combination of natural language processing tasks: named entity disambiguation, toponym resolution, and numeric parsing to extract general constraint components contained within LOAs, herein referred to as Entity Enhancement (EE). Starting with a small list of named entities (e.g., ARTCC, Tower, Altitude and Speed), EE can extract the named entities while simultaneously converting the string-based output into a digital format using an ensemble of processes like rule-based gazetteers and syntactic-lexical patterns. The digital format contains a diverse set of information based on the entity label in question, ranging from standardized facility names to units of measure (e.g., feet) and other numeric information. Upon validating our approach using a truth dataset, we show an overall F1-Score of 0.71 for the extraction process. Looking beyond entity enhancement, we are also working towards the goal of completely digitizing the general constraints by performing EE and fitting them into a standardized exchange model (XM) such as the Aeronautical Information Exchange Model (AIXM). This will allow for easy distribution and dissemination of LOA constraints to air users, better searchability within documents, and enable ingestion into automated flight planning. Finally, we show a preliminary version of the proposed XM architecture and demonstrate how the model can be populated from the EE output.

Stephen S. B. Clarke↗
NASA NTRS2005

Influence of Coronal Abundance Variations

The PI of this project was Jeff Scargle of NASA/Ames. Co-I's were Alma Connors of Eureka Scientific/Wellesley, and myself. Part of the work was subcontracted to Eureka Scientific via SAO, with Vinay Kashyap as PI. This project was originally assigned grant number NCC2-1206, and was later changed to NCC2-1350 for administrative reasons. The goal of the project was to obtain, derive, and develop statistical and data analysis tools that would be of use in the analyses of high-resolution, high-sensitivity data that are becoming available with new instruments. This is envisioned as a cross-disciplinary effort with a number of "collaborators" including some at SA0 (Aneta Siemiginowska, Peter Freeman) and at the Harvard Statistics department (David van Dyk, Rostislav Protassov, Xiao-li Meng, Epaminondas Sourlas, et al). We have developed a new tool to reliably measure the metallicities of thermal plasma. It is unfeasible to obtain high-resolution grating spectra for most stars, and one must make the best possible determination based on lower-resolution, CCD-type spectra. It has been noticed that most analyses of such spectra have resulted in measured metallicities that were significantly lower than when compared with analyses of high- resolution grating data where available (see, e.g., Brickhouse et al., 2000, ApJ 530,387). Such results have led to the proposal of the existence of so-called Metal Abundance Deficient, or "MAD" stars (e.g., Drake, J.J., 1996, Cool Stars 9, ASP Conf.Ser. 109, 203). We however find that much of these analyses may be systematically underestimating the metallicities, and using a newly developed method to correctly treat the low-counts regime at the high-energy tail of the stellar spectra (van Dyk et al. 2001, ApJ 548,224), have found that the metallicities of these stars are generally comparable to their photospheric values. The results were reported at the AAS (Sourlas, Yu, van Dyk, Kashyap, and Drake, 2000, BAAS 196, v32, #54.02), and at the conference on Statistical Challenges in Modem Astronomy (Sourlas, van Dyk, Kashyap, Drake, and Pease, 2003, SCMA 111, Eds. E.D.Feigelson, G.J.Babu, New York:Springer, p489-490). We also described the limitations of one of the most egregiously misused and misapplied statistical tests in astrophysical literature, the F-test for verifying model components (Protassov, van Dyk, Connors, Kashyap, and Siemiginowska, 2002, ApJ, 571,545). Indeed, a search through the ApJ archives turned up 170 papers in the 5 previous years that used the F-test explicitly in some form or the other, and with the vast majority of them not using it correctly! Indeed, looking at just 4 issues of the ApJ in 2001, we found 13 instances of its use, of which nine were demonstrably incorrect. Clearly, it is difficult to understate the importance of this issue. We also worked on speeding up Bayes Blocks and Sparse Bayes Blocks algorithms to make them more tractable for large searches. We also supported staistics students and postdocs in both explicit physics- model-based (spectra with tens of thousands of atomic lines) and "model-free" -- i.e. non-parametric or semi-parametric -- algorithms. Work on using more of the latter is just beginning; while using multi-scale methods for Poisson imaging has come to hition. In fact, "An Image Restoration Technique with Error Estimates", by D. Esch, A. Connors, M. Karovska, and D. van Dyk, was published by ApJ (Esch et a1.2004, ApJ, 610, 1213). The code has been delivered to M. Karovska for CXC; and is available for beta-testing upon request. The other large project we worked on was on the self-consistent modeling of logN-logs curves in the Poisson limit. logN-logs curves are a fundamental tool in the study of source populations, luminosity functions, and cosmological parameters. However, their determination is hampered by statistical effects such as the Eddington bias, incompleteness due to detection efficiency, faint source flux fluctuations, etc. We have develed a new and powerful method using the full Poisson machinery that allows us to model the logN-logs distribution of X-ray sources in a self-consistent manner. Because we properly account for all the above statistical effects, our modeling is valid over the full range of the data, and not just for strong sources, as is normally done. Using a Bayesian approach and modeling the fluxes with known functional forms such as simple or broken power-laws, and conditioning the expected photon counts on the fluxes, the background contamination, effective area, detector vignetting, and detection probability, we can delve deeply into the low counts regime and extend the usefulness of medium sensitivity surveys such as ChAMP by orders of magnitude. The built-in flexibility of the algorithm also allows a simultaneous analysis of multiple datasets. We have applied this analysis to a set a Chandra observations (Sourlas, Kashyap, Zezas, van Dyk, 2004, HEAD #8, #16.32)

Scargle, Jeffrey D.↗
NASA NTRS1994

Theoretical, observational, and isotopic estimates of the lifetime of the solar nebula

There are a variety of isotopic data for meteorites which suggest that the protostellar nebula existed and was involved in making planetary materials for some 10(exp 7) yr or more. Many cosmochemists, however, advocate alternative interpretations of such data in order to comply with a perceived constraint, from theoretical considerations, that the nebula existed only for a much shorter time, usually stated as less than or = 10(exp 6) yr. In this paper, we review evidence relevant to solar nebula duration which is available through three different disciplines: theoretical modelling of star formation, isotopic data from meteorites, and astronomical observations of T Tauri stars. Theoretical models based on observations of present star-forming regions indicate that stars like the Sun form by dynamical gravitational collapse of dense cores of cold molecular clouds in the interstellar medium. The collapse to a star and disk occurs rapidly on a time scale of the order 10(exp 5) yr. Disks evolve by dissipating energy while redistributing angular momentum, but it is difficult to predict the rate of evolution, particularly for low mass (compared to the star) disks which nonetheless still contain enough material to account for the observed planetary system. There is no compelling evidence, from available theories of disk structure and evolution, that the solar nebula must have evolved rapidly and could not have persisted for more than 1 Ma. In considering chronologically relevant isotopic data for meteorites, we focus on three methodologies: absolute ages by U-Pb/Pb-Pb, and relative ages by short-lived radionuclides (especially Al-26) and by evolution of Sr-87/Sr-86. Two kinds of meteoritic materials-refractory inclusions such as CAIs and differentiated meteorites (eucrites and angrites) - appear to have experience potentially dateable nebular events. In both case, the most straightforward interpretations of the available data indicate nebular events spanning several Ma. We also consider alternative interpretations, particularly the hypothesis of radically heterogeneous distribution of Al-26, which would avoid these chronological interpretations. The principal impetus for such alternative interpretations seems to be precisely the obviation of the chronological interpretation (i.e., the presumption rather than the inference of a short (less than or = Ma) lifetime of the nebula). Astronomical observations of T Tauri stars indicate that the presence of dusty disks is a common if not universal feature, that the disks are massive enough to accomodate a planetary system such as ours, and that at least some persist for 10(exp 7) yr or more. The results are consistent with the time scales inferred from the meteorite isotopic data. They cannot be considered conclusive with regard to solar nebula time scales, however,in part because it is difficult to relate disk observations to processes that affect meteorites, and in part because the ages assigned for these stars could be wrong by a factor of several in either direction. We conclude that the balance of available evidence favors the view that the nebula existed and was active for at least several Ma. However, because the evidence is not definitive, it is important that the issue be perceived to be an open question, whose answer should be sought rather than presumed.

Podosek, Frank A.↗
NASA NTRS1994

Theoretical, observational, and isotopic estimates of the lifetime of the solar nebula

There are a variety of isotopic data for meteorites which suggest that the protostellar nebula existed and was involved in making planetary materials for some 10(exp 7) yr or more. Many cosmochemists, however, advocate alternative interpretations of such data in order to comply with a perceived constraint, from theoretical considerations, that the nebula existed only for a much shorter time, usually stated as less than or equal to 10(exp 6) yr. In this paper, we review evidence relevant to solar nebula duration which is available through three different disciplines: theoretical modeling of star formation, isotopic data from meteorites, and astronomical observations of T Tauri stars. Theoretical models based on observations of present star-forming regions indicate that stars like the Sun form by dynamical gravitational collapse of dense cores of cold molcular clouds in the interstellar clouds in the interstellar medium. The collapse to a star and disk occurs rapidly, on a time scale of the order 10(exp 5) yr. Disks evolve by dissipating energy while redistributing angular momentum, but it is difficult to predict the rate of evolution, particularly for low mass (compared to the star) disks which nonetheless still contain enough material to account for the observed planetary system. There is no compelling evidence, from available theories of disk structure and evolution, that the solar nebula must have evolved rapidly and could not have persisted for more than 1 Ma. In considering chronoloically relevant isotopic data for meteorites, we focus on three methodologies: absolute ages by U-Pb/Pb-Pb, and relative ages by short-lived radionuclides (especially Al-26) and by evolution of Sr-87/Sr-86. Two kinds of meteoritic materials-refractory inclusions such as CAIs and differential meteorites (eucrites and augrites) -- appear to have experienced potentially dateable nebular events. In both cases, the most straightforward interpretations of the available data indicate nebular events spanning several Ma. We also consider alternative interpretations, particularly the hypothesis of radically heterogeneous distribution of Al-26, which would avoid these chronological interpretations. The principal impetus for such alternative interpretations seems to be precisely the obviation of the chronological interpretation (i.e., the presumption rather than the inference of a short (less than or equal to 1 Ma) lifetime of the nebula). Astronomical observations of T Tauri stars indicate that the presence of dusty disks is a common if not universal feature, that the disks are massive enough to accomodate a planetary system such as ours, and that at least some persist for 110(exp 7) yr or more. The results are consistent with the time scales inferred from the meteoritic isotopic data. They cannot be considered conclusive with regard to solar nebula time scales, however, in part because it is difficult to relate disk observations to processes that affect meteorites, and in part because the ages assigned for these stars could be wrong by a factor of several in either direction. We conclude that the balance of available evidence favors the view that the nebula existed and was active for at least several Ma. However, because the evidence is not definitive, it is important that the issue be perceived to be an open question, whose answer should be sought rather than presumed.

Podosek, Frank A.↗
NASA NTRS2018

Mars Planetary Network for Human Exploration Era – Potential Challenges and Solutions

During 2016-2017, a study was conducted under the sponsorship of the NASA’s Space Communications and Navigation (SCaN) Program to investigate the deep space communications capacity taking into account the needs of all the present and envisioned future missions toward 2030s. It was soon recognized that planning for human exploration to Mars would impose certain unprecedent challenges, both fiscal and technical, to the current space communications paradigm. Targeting the assumed missions concepts, i.e., Crewed Mission to Phobos (CMTP) and Mars Short Stay Mission (MSSM), a Mars Planetary Network for the human exploration era has been formulated. The activity modeling and network traffic simulation/modeling we performed gave some insight into the technical challenges in space communications for the envisioned human Mars exploration era. Chief among the potential challenges are: (1) the high demand on the deep space network (DSN) assets for achieving the high-rate links, both return and forward, from Mars farthest/farther distance (up to 2.67 AU); (2) the need for resilient, persistent communication coverage for crewed vehicles, on surface and in orbits; (3) the significant period of outage for the Mars-Earth link due to superior solar conjunction; (4) the need for on-demand, simultaneous access to the proximity link by multiple vehicles and astronauts in the exploration zone; (5) the capability of determining precise, real-time, positions of surface vehicles and astronauts by the deep space habitat and/or other tele-operations entities. Solution space to each of the above challenges has been explored and analyzed in the context of the individual problem domain and, more importantly, in conjunction with that for the other challenges. This has led to an end-to-end definition of a Mars Planetary Network that would feature: (1) the fusion of deep space Ka-band and optical communications for achieving Mars-Earth high-rate links taking advantage of the optical/RF hybrid 8m/34m antennas in DSN; (2) the integrated application of the Multiple Spacecraft Per Antenna (MSPA) technique, for return link data acquisition, and the Multiple Uplink Per Antenna (MUPA) technique, for forward link data trasnmission, to reduce the number of 34m beam-wave guide (BWG) antennas needed for the era; (3) the integration of three, arrayed, 34m beam-wave guide (BWG) antennas, to provide a high G/T aperture, with the MSPA/MUPA techniques, and a dual “trunk link”approach to cut down the needed G/T -- hence, reducing the number of 34m antennas, relative to that in the single trunk approach by 50%; (4) the deployment of two areostationary/areosynchronous Mars relay orbiters; one of them could also function as (or be served by) a notional Deep Space Habitat (DSH); (5) the opportunistic deployment of a science orbiter in a Pioneer-6 type orbit, equidistant Mars/Earth, that could also serve as an intermediary relay during the Mars superior solar conjunction perod; (6) the existence of the multi-function Mars proximity link that provides the demand-assigned, multiple access (DAMA) capability; and (7) the provision of tracking observables, by leveraging on the planned Mars orbiting and surface infrastructure, to enable the in-situ navigation for surface and orbiting vehicles. This paper provides the description of the proposed Mars Planetary Network in the human exploration era, the trade-off analysis for the various alternative architectures, and the optimal solutions to the key challenges in defining this end-to-end network.

Cheung, Kar-Ming↗
NASA NTRS2002

Genes encoding calmodulin-binding proteins in the Arabidopsis genome

Analysis of the recently completed Arabidopsis genome sequence indicates that approximately 31% of the predicted genes could not be assigned to functional categories, as they do not show any sequence similarity with proteins of known function from other organisms. Calmodulin (CaM), a ubiquitous and multifunctional Ca(2+) sensor, interacts with a wide variety of cellular proteins and modulates their activity/function in regulating diverse cellular processes. However, the primary amino acid sequence of the CaM-binding domain in different CaM-binding proteins (CBPs) is not conserved. One way to identify most of the CBPs in the Arabidopsis genome is by protein-protein interaction-based screening of expression libraries with CaM. Here, using a mixture of radiolabeled CaM isoforms from Arabidopsis, we screened several expression libraries prepared from flower meristem, seedlings, or tissues treated with hormones, an elicitor, or a pathogen. Sequence analysis of 77 positive clones that interact with CaM in a Ca(2+)-dependent manner revealed 20 CBPs, including 14 previously unknown CBPs. In addition, by searching the Arabidopsis genome sequence with the newly identified and known plant or animal CBPs, we identified a total of 27 CBPs. Among these, 16 CBPs are represented by families with 2-20 members in each family. Gene expression analysis revealed that CBPs and CBP paralogs are expressed differentially. Our data suggest that Arabidopsis has a large number of CBPs including several plant-specific ones. Although CaM is highly conserved between plants and animals, only a few CBPs are common to both plants and animals. Analysis of Arabidopsis CBPs revealed the presence of a variety of interesting domains. Our analyses identified several hypothetical proteins in the Arabidopsis genome as CaM targets, suggesting their involvement in Ca(2+)-mediated signaling networks.

NASA Discipline Plant Biology↗
NASA NTRSDate not supplied

Monitoring Airspace Complexity and Determining Contributing Factors

The national airspace has evolved over many years to accommodate increased traffic demand [1] while simultaneously maintaining one of the safest forms of transportation [2], [3]. One of the reasons for this success is the ability of the system and the operators to adapt and accommodate to situations that routinely disrupt optimal operations. These situations may include: adverse weather, delays, early arrivals, equipment outages, and other factors that are outside the operators ability to control. These factors can lead to states where automation is unable to properly handle these issues and therefore air traffic controllers and pilots have to intervene, ultimately increasing communication between operators resulting in higher workload. As controller workload increases to handle sub-optimal operating conditions this can be viewed as an increase in complexity. The reasoning for this is because humans are now required to make tactical decisions in response to external factors, resulting in a departure from the strategic plan where operations would be more efficiently managed. Human operators control airspace complexity under rigid regulations that are constantly changing. The airspace is divided into sectors and the number of aircraft assigned to each controller is limited for safe handling. There has been past work that devised airspace complexity metrics in commercial aviation and related these metrics to controller workload (e.g., [4],[5]). The upper bounds on the system load are pre-determined. Such bounds on complexity make for a safe system, but the system cannot scale and adapt to autonomous, dense, and heterogeneous traffic, including the many types of Unmanned Aerial Vehicles (UAVs) envisioned to be added to the operations. We hypothesize that, as traffic density and heterogeneity grow, and other key metrics change, there will be phase transitions at which the way traffic should be managed changes significantly [6]. We offer a method for in-time detection of contributing factors that lead to phase transitions, characterized by increased complexity. To the best of our knowledge, there is no tool similar to our proposed effort that identifies such contributing factors or precursor patterns. To define the scope we are proposing to measure complexity from the viewpoint of the Terminal Radar Approach Control Facilities (TRACON) controller’s perspective. In particular we are analyzing arrivals into KSFO. With safety as the top concern for airspace operators, it is important to recognize that as density and heterogeneity grow, the focus of the system will change. Times of the day when the airspace has low density and heterogeneity, the flights will follow more efficient paths where the aircraft move on established routes that are more or less directly to the destination. However, when density and heterogeneity increases, the system will begin changing focus to avoiding conflicts and collisions and route the flights in a more flexible way. Higher flexibility requires more communication and coordination between controllers and pilots which the current automation is unable to handle. This paper proposes a novel approach that monitors airspace complexity at multiple scales, uses a Machine Learning-based tool that predicts when operations will transition to a regime of greater complexity, and identifies actions that can reduce the complexity while still maintaining efficient and safe operations. We demonstrate our proposed approach using data from multiple complementary sources. This includes, but is not limited to: historical aircraft surveillance data from NASA’s Sherlock Data Warehouse [7], METAR weather data, and airport configuration data from Aviation System Performance Metrics (ASPM). The surveillance data flight paths are sampled at a variable sample rate — increasing as the aircraft approaches the airport. This is due to how Sherlock manages flight track stitching between different radar facilities which have different sampling rates. The weather and performance data are logged at defined intervals throughout the day at a courser refresh rate. In addition to the logged data and metrics, we leverage pre-defined Standard Terminal Arrival Routes (STARs) procedures to characterize the path of each flight. Each flight files for one of these routes in the flight plan well before entering the terminal airspace, and approximately follows the route until it leaves the STAR, typically on the final fix of a runway transition. However, most flights do not always fly the full STAR procedure to completion [8], but the majority do adhere to the fixes within the common route of the procedure. Our approach leverages fixes in the common route of each of the STARs to build a reference path to the airport. This allows us to characterize the flight paths in what we are defining as the “maneuvering area” (the airspace between the STAR and before the flight is lined up on the runway’s final approach) to determine how off nominal the flights are to calculate its complexity score. Determining airspace complexity is a concept that does not have a concrete answer. In designing this metric, we consider what increases the workload for the air traffic controllers. Consequently more specialized vectoring maneuvers results in higher workload. Accordingly, we start with a theory: each flight has a direct path it takes from the STAR’s common route to the final approach’s outer marker fix for the flight’s landing runway. It is important to note that the direct path is only used as a reference. If the majority of the flights have a large consistent offset as compared to other routes it does not necessarily mean that those flights have higher complexity. We are merely building a distribution based on this direct path for that particular STAR and runway pair to determine the normal mode of operations for that route. Flights that are in the upper tail of these distributions will result in higher complexity scores and flights that fly in the median will represent the normal mode of operations and therefore will have lower complexity scores. Since flights following each STAR route take different paths to the airport, we have a different distribution for each STAR route and therefore can model these distributions to compute a complexity score from their respective normalized distributions. To evaluate the effectiveness of our proposed airspace complexity metric we will compare against an established approach based on trajectory clustering [9]. This unsupervised learning technique consists of the following steps: (1) identify the general maneuvering areas (waypoints) by performing $\kappa$-means or DBSCAN clustering on locations where aircraft frequently turn based on the surveillance radar track data, (2) map flight trajectories onto sequences of waypoints, and (3) cluster the sequences based on their common subsequences. From a high-level perspective, this baseline model learns nominal operations in the airspace through the sequence of waypoints that are representative of where aircraft change direction and defines deviations from the nominal operations as “complex.” Therefore, more deviations from the nominal operations correspond to higher complexity values. For our validation, we re-implemented this technique and tune model hyper-parameters to correctly detect waypoints for the arrival traffic into the San Francisco bay area. We will compute the complexity measure over a one-year period using our proposed technique as well as the baseline. Our validation will be based on each technique’s ability to detect a set of undesirable outcomes (e.g., go-arounds, holding patterns, average time in the airspace, etc.). Since our current complexity metric is derived from the offset from the direct reference path, it’s important to understand what causes these offsets. In many of the flights with high offset distance, flights performing holding patterns and S turns can be observed. These maneuvering tactics are utilized to add distance between the aircraft and the destination runway to prevent multiple flights from having conflicting arrival times. In order to predict a rise in complexity (or the precursor to complexity), it’s necessary to be able to identify these potential conflicts (which in turn, result in higher offsets). To do this, we define a “representative flight” for each STAR route and runway pair. This flight is approximately the path the flight would take if there was a clear path with no other flights in the airspace — including the time remaining to the airport. We first identify the flights for a given STAR runway pair using the offset to the reference path distributions that fall between the 44-55 percentiles. This yields the flights that conform to the most normal mode of operation. Each of these flights is partitioned based on the percent complete from the entry point into the maneuvering areas from 0\% – 100\% complete. Then for each percent “bin”, we take the median value of the flight’s latitude/longitude coordinates, airspeed, and (non causal) time remaining to the airport to construct a lookup table for each percent complete bin on a given route. As a flight enters the maneuvering area, we can find the estimated arrival time of a flight to the airport by finding the closest point to the representative path’s percent complete bin (relative to the flight’s current position at any snapshot in the airspace) and therefore retrieve the corresponding remaining time left on the “representative path”. We assume that the flight will follow the representative path to completion when deriving these estimates. We can then compare these estimated arrival times against other flights for the same snapshot in time to identify potential conflicts. If more flights are estimated to arrive within a tolerance window than there are runways available, then we have a potential conflict. We can use this derived measure along with other factors expected to add disruption to the operation such as weather and runway configuration changes as an input to machine learning tools to detect precursors that increases in our complexity measure. This novel method will assist in uncovering insights into the contributing factors that lead to increased complexity that may allow for in-time responses to avoid reaching a high complexity state in the airspace.

complexity↗