Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “integer”

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 487 records · Page 27

Optimization of Airport Surface Traffic: A Case-Study of Incheon International Airport

This study aims to develop a controllers' decision support tool for departure and surface management of ICN. Airport surface traffic optimization for Incheon International Airport (ICN) in South Korea was studied based on the operational characteristics of ICN and airspace of Korea. For surface traffic optimization, a multiple runway scheduling problem and a taxi scheduling problem were formulated into two Mixed Integer Linear Programming (MILP) optimization models. The Miles-In-Trail (MIT) separation constraint at the departure fix shared by the departure flights from multiple runways and the runway crossing constraints due to the taxi route configuration specific to ICN were incorporated into the runway scheduling and taxiway scheduling problems, respectively. Since the MILP-based optimization model for the multiple runway scheduling problem may be computationally intensive, computation times and delay costs of different solving methods were compared for a practical implementation. This research was a collaboration between Korea Aerospace Research Institute (KARI) and National Aeronautics and Space Administration (NASA).

surface management↗

Optimization of Airport Surface Traffic: A Case-Study of Incheon International Airport

This study aims to develop a controllers decision support tool for departure and surface management of ICN. Airport surface traffic optimization for Incheon International Airport (ICN) in South Korea was studied based on the operational characteristics of ICN and airspace of Korea. For surface traffic optimization, a multiple runway scheduling problem and a taxi scheduling problem were formulated into two Mixed Integer Linear Programming (MILP) optimization models. The Miles-In-Trail (MIT) separation constraint at the departure fix shared by the departure flights from multiple runways and the runway crossing constraints due to the taxi route configuration specific to ICN were incorporated into the runway scheduling and taxiway scheduling problems, respectively. Since the MILP-based optimization model for the multiple runway scheduling problem may be computationally intensive, computation times and delay costs of different solving methods were compared for a practical implementation. This research was a collaboration between Korea Aerospace Research Institute (KARI) and National Aeronautics and Space Administration (NASA).

taxi scheduler↗

QSPIN: A High Level Java API for Quantum Computing Experimentation

QSPIN is a high level Java language API for experimentation in QC models used in the calculation of Ising spin glass ground states and related quadratic unconstrained binary optimization (QUBO) problems. The Java API is intended to facilitate research in advanced QC algorithms such as hybrid quantum-classical solvers, automatic selection of constraint and optimization parameters, and techniques for the correction and mitigation of model and solution errors. QSPIN includes high level solver objects tailored to the D-Wave quantum annealing architecture that implement hybrid quantum-classical algorithms [Booth et al.] for solving large problems on small quantum devices, elimination of variables via roof duality, and classical computing optimization methods such as GPU accelerated simulated annealing and tabu search for comparison. A test suite of documented NP-complete applications ranging from graph coloring, covering, and partitioning to integer programming and scheduling are provided to demonstrate current capabilities.

Quantu↗

Limiting Data Friction by Reducing Data Download Using Spatiotemporally Aligned Data Organization Through STARE

Current data processing practice limits the volume and variety of relevant geoscience data that can practically be applied to important problems. File archives in centralized data centers are the principal means by which Earth Science data are accessed. This approach, however, requires laborious search, retrieval, and eventual customization/adaptation for the data to be used. Such fractionation makes it even more difficult to share outcomes, i.e. research artifacts and data products, hampering reusability and repeatability, since end users generally have their own research agenda and preferences as well as scarce resources. Thus, while finding and downloading data files from central data centers are already costly for end users working in their own field, using data products from other disciplines rapidly becomes prohibitive. This curtails scientific productivity, limits avenues of study, and endangers quality and reproducibility. The Spatio-Temporal Adaptive Resolution Encoding (STARE) is a unifying scheme that facilitates the indexing, access, and fusion of diverse Earth Science data. STARE implements an innovative encoding of geo-spatiotemporal information, originally developed for aligning datasets with diverse spatiotemporal characteristics in an array database. The spatial component of STARE recursively quadfurcates a root polyhedron, producing a hierarchical scheme for addressing geographic locations and regions. The temporal component of STARE uses conventional date-time units as an indexing hierarchy. The additional encoding of spatial and temporal resolution information in STARE enables comparisons and conditional selections across diverse datasets. Moreover, spatiotemporal set-operations, e.g. union and intersection, are mapped to efficient integer operations with STARE. Applied to existing data models (point, grid, spacecraft swath) and corresponding granules, STARE indexes provide a streamlined description usable as geo-spatiotemporal metadata. When coupled with large scale, distributed hardware and software, STARE-based data access reduces pre-analysis data preparation costs by offering a convenient means to align different datasets spatiotemporally without specialized effort in parallel computing or distributed data management.

Kuo, Kwo-Sen↗

An Innovative Infrastructure with a Universal Geo-Spatiotemporal Data Representation Supporting Cost-Effective Integration of Diverse Earth Science Data

The SpatioTemporal Adaptive Resolution Encoding (STARE) is a unifying scheme encoding geospatial and temporal information for organizing data on scalable computing/storage resources, minimizing expensive data transfers. STARE provides a compact representation that turns set-logic functions into integer operations, e.g. conditional sub-setting, taking into account representative spatiotemporal resolutions of the data in the datasets. STARE geo-spatiotemporally aligns data placements of diverse data on massive parallel resources to maximize performance. Automating important scientific functions (e.g. regridding) and computational functions (e.g. data placement) allows scientists to focus on domain-specific questions instead of expending their efforts and expertise on data processing. With STARE-enabled automation, SciDB (Scientific Database) plus STARE provides a database interface, reducing costly data preparation, increasing the volume and variety of interoperable data, and easing result sharing. Using SciDB plus STARE as part of an integrated analysis infrastructure dramatically eases combining diametrically different datasets.

Rilee, Michael Lee↗

A Markov Decision Process Framework for Optimal Airport Reconfiguration

The airport runway configuration is defined as a combination set of runways for arrivals and departures used at a point during operation of the airport. An optimal configuration of these runways depends on a number of factors, including traffic demand, wind magnitude and direction, other adverse weather conditions, and noise restrictions, among others. Based on the current state of these factors and predictions of traffic demand and weather conditions, runway configuration changes are made and coordinated between tower controller, other air traffic control facilities, pilots, and ground personnel. Reconfigurations can be quite disruptive to airport operations; minimizing their frequency and scheduling them well in advance is essential for mitigating some of the added workload for controllers and pilots. Unfortunately, deciding on an appropriate time to change is challenging for human decision makers. Not only do multiple factors need to be evaluated, but the uncertainty in their forecasts must also be considered. Previous optimization methods, such as mixed linear integer programming, have been proposed. Although these methods can reason over a large set of variables, they do not systematically handle the uncertainty associated with weather movement, traffic demands, and other variables. In this work, we introduce a Markov Decision Process (MDP)-based decision making framework which can reason effectively over the inherent uncertainties and make optimal decisions on if/when to change the airport configuration. In a prototype implementation, we present a single runway with three aircraft and utilize knowledge of the forecasted wind speed and direction to determine whether to keep or change the current runway configuration. Our aim through this work is to present a framework for airport reconfiguration which can be scalable to additional aircraft, multiple runways, and various input parameters. This technique will optimize the airport reconfiguration procedure by providing a proactive approach, optimizing not just at the next optimal opportunity for a reconfiguration based on varying atmospheric and traffic conditions in the terminal airspace, but also anticipating future necessary reconfigurations. This will eliminate the inefficiencies of frequent changes currently associated with runway reconfiguration procedures.

runway reconfiguration↗

Comparison of First-Come First-Served and Optimization Based Scheduling Algorithms for Integrated Departure and Arrival Management

Korea Aerospace Research Institute (KARI) and National Aeronautics and Space Administration (NASA) are investigating scheduling algorithms that will be a part of an integrated arrival and departure management system. Inha University, one of the Korean collaborators of KARI, developed an Extended First-Come First-Served (EFCFS) algorithm that is robust and efficient. However, since the EFCFS algorithm sequentially computes the schedule based on priority, the end results may not be optimal for system efficiency. The approach based on Mixed Integer Linear Programming (MILP) originally developed by NASA and modified by KARI is known to produce better schedules at the expense of computational cost. In this paper, the two different scheduling approaches are compared using common traffic scenarios and constraints at Incheon International Airport. Capabilities to apply weight class based wake turbulence runway separation minima and Miles-in-Trail (MIT) restrictions at selected meter fixes are added to the previously developed EFCFS scheduler. Based on historic data, 40 departures and 20 arrivals are chosen in a one-hour period and 100 scenarios were created by randomly assigning gate numbers, gate departure times, and runway landing times. With the current runway separation requirements, MILP resulted in about ten to twenty percent smaller average delays depending on the constraints. With artificially increased separation minima, the difference between MILP and EFCFS became more noticeable. However, the EFCFS was about ten times faster with smaller variations among different scenarios and constraints. The comparison suggests that the MILP-based algorithm has a small advantage at the current traffic level; however, has potential to be more effective in higher demand or severe weather situations. The EFCFS algorithm may be better suited for real-time applications or investigating larger scale scheduling problems.

air traffic optimization↗

Discovery of Activities via Statistical Clustering of Fixation Patterns

Human behavior often consists of a series of distinct activities, each characterized by a unique pattern of interaction with the visual environment. This is true even in a restricted domain, such as a piloting an aircraft, where activities with distinct visual signatures might be things like communicating, navigating, and monitoring. We propose a novel analysis method for gaze-tracking data, to perform blind discovery of these hypothetical activities. The method is in some respects similar to recurrence analysis, but here we compare not individual fixations, but groups of fixations aggregated over a fixed time interval. The duration of this interval is a parameter that we will refer to as delta. We assume that the environment has been divided into a set of N different areas-of-interest (AOIs). For a given interval of time of duration delta, we compute the proportion of time spent fixating each AOI, resulting in an N-dimensional vector. These proportions can be converted to integer counts by multiplying by delta divided by the average fixation duration (another parameter that we fix at 280 milliseconds). We compare different intervals by computing the chi-square statistic. The p-value associated with the statistic is the likelihood of observing the data under the hypothesis that the data in the two intervals were generated by a single process with a single set of probabilities governing the fixation of each AOI. The method has been applied to approximately 100 hours of eye movement data collected from pilots in a high-fidelity B747 flight simulator, and the results have been compared to synthetic data in which the each activity is represented as first-order Markov process with random probabilities assigned to the AOIs. Randomly-generated synthetic activities can require thousands of fixations to be discriminated with statistical significance, while the human data can be clustered using averaging windows of some 10's of seconds, suggesting that the actual activities are much more narrowly focused than random Markov models.

activity analysis↗

Discovery of Activities via Statistical Clustering of Fixation Patterns

Human behavior often consists of a series of distinct activities, each characterized by a unique pattern of interaction with the visual environment. This is true even in a restricted domain, such as a pilot flying an airplane; in this case, activities with distinct visual signatures might be things like communicating, navigating, monitoring, etc. We propose a novel analysis method for gaze-tracking data, to perform blind discovery of these hypothetical activities. We compare, not individual fixations, but groups of fixations aggregated over a fixed time interval (Tau). We assume that the environment has been divided into a finite set of discrete areas-of-interest (AOIs). For a given time interval, we compute the proportion of time spent fixating each AOI, resulting in an N-dimensional vector, where N is the number of AOIs. These proportions can be converted to integer counts by multiplying by Tau divided by the average fixation duration, a parameter that we fix at 283 milliseconds. We compare different intervals by computing the chi-squared statistic. The p-value associated with the statistic is the likelihood of observing the data under the hypothesis that the data in the two intervals were generated by a single process with a single set of probabilities governing the fixation of each AOI. We cluster the intervals, first by merging adjacent intervals that are sufficiently similar, optionally shifting the boundary between non-merged intervals to maximize the difference. Then we compare and cluster non-adjacent intervals. The method is evaluated using synthetic data generated by a hand-crafted set of activities. While the method generally finds more activities than put into the simulation, we have obtained agreement as high as 80 percent between the inferred activity labels and ground truth.

Eye Movements↗

Optimizing Integrated Arrival, Departure and Surface Operations Under Uncertainty

In airports and surrounding terminal airspaces, the integration of arrival, departure and surface scheduling and routing have the potential to improve the operations efficiency. Recent research had developed mixed-integer-linear programming algorithm-based scheduler for integrated arrival and departure operations in the presence of uncertainty. This paper extends to the surface previous research performed by the authors to integrate taxiway and runway operations. The developed algorithm is capable of computing optimal aircraft schedules and routings that reflects the integration of air and ground operations. A preliminary study case is conducted for a set of thirteen aircraft evolving in a model of the Los Angeles International airport and surrounding terminal areas. Using historical data, a representative traffic scenario is constructed and probabilistic distributions of pushback delay and arrival gate delay are obtained. To assess the benefits of optimization, a First- Come-First-Serve algorithm approach comparison is realized. Evaluation results demonstrate that the optimization can help identifying runway sequencing and schedule that reduce gate waiting time without increasing average taxi times.

Bosson, Christabelle↗

Integration of Uncertain Ramp Area Aircraft Trajectories and Generation of Optimal Taxiway Schedules at Charlotte Douglas (CLT) Airport

The integration of aircraft maneuver characteristics into an optimal taxiway scheduling solution is challenging due to the uncertainties that are intrinsic to ramp area aircraft trajectories. To address the challenge, we build a stochastic model of ramp area aircraft trajectories that is used to generate a probabilistic measure of conflict within the Charlotte Douglas International Airport (CLT) ramp area. Parameters of the conflict distributions are estimated and passed to a Mixed Integer Linear Program that solves for an optimal taxiway schedule constrained to be conflict free in the presence of trajectory uncertainties. Here we extend our previous research by accounting for departing and arriving aircraft whereas our prior formulation only accounted for departing aircraft.

taxiway schedule↗

IKOS: Sound Static Program Analysis

IKOS (Inference Kernel for Open Static Analyzers) is a static analyzer for C/C++ based on the theory of Abstract Interpretation. It can detect or prove the absence of runtime errors (e.g, buffer overflows, integer overflows, null pointer dereferences, etc.) in the source code. IKOS uses Abstract Interpretation techniques to compute an over-approximation of all the reachable states of the program, thus it cannot miss a bug. In this talk, I will give an overview of the tool, then show how to apply it to a large software. I will present ikos-view, a web interface to examine the analysis results. I will discuss about methods to improve the analysis, such as adding code annotations, modeling library functions, and avoiding specific code patterns.

Arthaud, Maxime↗

Stability Analysis of the Flow Over a Swept Forward-Facing Step Using PIV Base Flows

Step excrescences are a type of surface imperfection encountered on swept wings of commercial aircraft, commonly because accessibility requirements prevent creating the wing’s surface from a single panel. If the step height is too large, super-critical, the flow can undergo an early transition to turbulence, which can be highly detrimental for the performance of the wing. In the case of a forward-facing step on a swept wing in a low-disturbance environment, stationary crossflow vortices can develop a significant amplitude upstream of the step and hence dominate the structure of the boundary-layer flow over the step. The main goal of the present investigation is to illuminate the path to transition supported by the fascinatingly complex flow field in the direct downstream vicinity of a step with a super critical height. The high-resolution, stereographic Particle Image Velocimetry (PIV) measurement dataset presently available for this flow field provides a complete description of the laminar flow for the execution of BiGlobal stability analysis in a plane parallel to the step. Although the notorious sensitivity of stability results to the description of the base flow demands a very careful uncertainty analysis of those results, it is argued that this very fact can be leveraged to produce new insight into the supported perturbation dynamics. In performing the analysis, several unsteady mode families are discovered that display the explosive perturbation expected for early transition to be induced. In considering domain widths equal to an integer-multiple of the incident crossflow-vortex wavelength and analyzing an extent of 5 crossflow-vortex wavelengths parallel to the step, it is found that the stability results converge while increasing the domain width. It is demonstrated, moreover, that the results for the wider domains can be approximated by appropriately averaging the results on neighboring single-crossflow-vortex-wavelength domains covering the same region. Besides being useful for computational purposes, this observed property suggests interpreting the instability mechanism as a distorted primary mechanism rather than a “proper” secondary mechanism. This follows in the context of the secondary in-stability analysis of three-dimensional boundary layers, because the secondary mechanism is usually characterized by being localized in a pocket of strong shear, while the distorted primary mechanism typically has an infinite support in the direction parallel to the step. Even though the growth rates are found to be sensitive to the interrogation-window size inherent to the PIV post-processing procedure, the spatial structure of the eigenfunctions is found to be relatively insensitive. Lastly, the spatial structure of the eigenfunctions corresponding to all velocity components are matched with the shape functions determined by computing the Spectral Proper Orthogonal Decomposition (SPOD) of a time-resolved measurement of the perturbation content.

forward-facing step↗

Scheduling Position, Navigation and Time Service Requests from Non-dedicated Lunar Constellations

This paper presents a centralized scheduler that satisfies user requests for Position, Navigation, and Time (PNT) services from an ad-hoc, non-dedicated orbital constellation around the Moon. Traditional, dedicated GNSS networks provide service 24/7, which allows users to acquire localization services at-will. For ad-hoc networks, a coordinated schedule is needed to ensure Quality of Service (QoS) guarantees for user localization, while satisfying non-dedicated assets’ usage constraints. This scheduler bridges this coordination gap by leveraging Mixed Integer-Linear Programming (MILP) to schedule this “as-needed” localization service while respecting the constraints on each asset. In upcoming decades there is expected to be a substantial increase in Lunar missions. Many of these missions will feature low-cost surface assets near the moon’s polar regions and small-sat science missions in orbit. Most missions need PNT capabilities to ensure safe operations and meet their science objectives, but low-cost missions may not be able to support the large power, mass, and weight that a weak GNSS or DSN based navigation solution would entail. Asset localization has been demonstrated using a decentralized extended Kalman Filter (DEKF) in the previously presented Lunar Autonomous PNT System (LAPS). Within the LAPS simulation environment, a module has been developed to generate the coordinated user-asset schedules described above; this Service Scheduler Module (SSM) allows for complete end-to-end testing of the entire system. Within SSM, a user service request consists of a location on the Lunar surface, a cumulative service duration, and a window in which service must occur. SSM takes as input these requests and the LAPS-predicted positional degree of precision as the QoS for each available set of orbital assets. A simple, baseline MILP model is formulated to provide the highest-precision service balanced across all requests. To reflect the non-dedicated nature of the constellation, this baseline model is augmented with additional asset-specific load capacity constraints or availability constraints. The load capacity constraints limit total time spent providing service, and the availability constraints reflect blockout times or availability windows when the assets are not otherwise occupied. SSM outputs two schedules: the user schedule to indicate their service times and expected QoS, and a satellite schedule to be transmitted to the orbiting constellation, describing when each non-dedicated asset provides PNT service. SSM is predominantly implemented in MATLAB and allows the use of any MILP solver to generate the resulting schedules. This paper describes the SSM - LAPS interface, how the output of LAPS is used to construct the MILP, and how SSM provides user localization service while satisfying constraints. It will also demonstrate the tool’s flexibility for formulating schedules for the end user and the constellation, focusing on scenarios that match real-world proposed missions. It will detail how SSM can be used to compare the addition of load capacity constraints, satellite availability constraints, and QoS guarantees for the users. Finally, we describe how SSM can be used to support the design of the ad-hoc constellation itself. The resulting integrated capability will support the design of future ad-hoc Lunar PNT networks, enabling high-quality, low-cost Lunar exploration

Swarm↗

Microwave Photoelasticity: Exploiting Multiple Resonances to Measure Stress Changes within Yttria-Partially-Stabilized-Zirconia

The NASA Glenn Research Center is developing non-destructive-testing (NDT) methods to enable the measurement of stresses embedded in optically opaque materials using microwave radiation in a free-space quasi-optical system. This methodology tracks microwave resonances observed in reflected scattering parameters extracted from materials under load. In this paper, we report the successful measurement of the stress-optic-coefficient of bulk yttria-partially stabilized zirconia (YTZP) ceramic of C = 1.42 x 10-4 ± 6.65 x 10-6 (1/GPa), across W-Band (80-100 GHz), and determined that this result is independent of sample thickness. The primary goal of this research is to establish a methodology to quantify and assess the life expectancy of ceramic thermal and environmental barrier coating (TBCs/EBCs). Bulk YTZP samples can undergo multiple resonances within a contiguous measurement bandwidth, each corresponding to an integer multiple wave number ∝. This allows for the acquisition and analysis of multiple stress measurement points within a single sample. As an additional benefit, one can approximate the refractive index of YTZP across a wide bandwidth by observing multiple resonances produced by a set of samples with varying thicknesses. Using this approach, the refractive index of bulk YTZP was found to be n = 5.80 ± 0.043 across the 85-115 GHz frequency band.

Seth W. Waldstein↗

Planning Satellite Swarm Measurements for Climate Models: Comparing Dynamic Constraint Processing and MILP Methods

We present D-SHIELD, a challenging climate science application to plan coordinated measurements (observations) for a constellation of satellites, each containing two different sensors, each with 61 pointing angle options. The L-band and P-band radar sensors collect data fed into a soil moisture model which tracks and predicts soil moisture across 1.67 million Ground Positions (GP). Soil moisture is an important predictor of wildfires, and then a predictor of floods, landslides and debris flow after a fire. Each measurement covers multiple GP due to the sensor footprint. Each GP has a "model error" which represents the uncertainty of the the soil moisture state prediction. Model error changes at different rates for each GP as the time since last observation increases and after significant events like rain. The planner's goal is to select measurements which maximize soil moisture model improvement (reduce model uncertainty). This problem is combinatorically explosive, involving many degrees of freedom for planner choices. Good domain heuristics can find solutions within a reasonable time for our application needs but cannot be proven optimal. In this paper we compare two different planning approaches to this problem: Dynamic Constraint Processing (DCP) and Mixed Integer Linear Programming (MILP). We match inputs and metrics for both DCP and MILP algorithms to enable a direct apples-to-apples comparison. We demonstrate and discuss the trades between DCP flexibility and performance vs. MILP's promise of provable optimality.

Rich Levinson↗

First-Order Runtime Verification using BDDs

Runtime Verification (RV) expedites the analyses of execution traces for detecting system errors and for statistical and quality analysis. Having started modestly, with checking temporal properties that are based on propositional (yes/no) values, the current practice of RV often involves properties that are parametrized by the data observed in the input trace. The specifications are based on various formalisms, such as automata, temporal logics, rule systems, and stream processing. Checking execution traces that are data intensive against a specification that imposes strong dependencies between the data, poses a nontrivial challenges; in particular if runtime verification has to be performed online, while many events that carry data appear within small time proximities. Towards achieving this goal, it was recently suggested to represent relations over the observed data values, based on BDDs, where data elements are enumerated and then converted into bit vectors. This representation provided a very simple and natural extension of an RV algorithm from propositional to first-order LTL, but more importantly, was shown to contribute to the memory compactness and to the speed, as was demonstrated using a corresponding implementation. We extend here the capabilities of BDD-based RV with the ability to express timing constraints, where the monitored events include (integer) clock values. We show how to efficiently operate on BDDs that represent both relations on (enumerations of) values and time dependencies, as required by the addition of the time constraints. We demonstrate our algorithm with an efficient implementation and provide experimental results.

Peled, Doron↗

Transit Timing Variations for Planets Near Eccentricity-Type Mean Motion Resonances

We derive the transit timing variations (TTVs) of two planets near a second-order mean motion resonance (MMR) on nearly circular orbits. We show that the TTVs of each planet are given by sinusoids with a frequency of jn(sub 2) - ( j - 2)n(sub 1), where j ≽ 3 is an integer characterizing the resonance and n(sub 2) and n(sub 1) are the mean motions of the outer and inner planets, respectively. The amplitude of the TTV depends on the mass of the perturbing planet, relative to the mass of the star, and on both the eccentricities and longitudes of pericenter of each planet. The TTVs of the two planets are approximated anti-correlated, with phases of ϕ and ≈ϕ + π, where the phase ϕ also depends on the eccentricities and longitudes of pericenter. Therefore, the TTVs caused by proximity to a second-order MMR do not in general uniquely determine both planet masses, eccentricities, and pericenters. This is completely analogous to the case of TTVs induced by two planets near a first-order MMR. We explore how other TTV signals, such as the short-period synodic TTV or a first-order resonant TTV, in combination with the second-order resonant TTV, can break degeneracies. Finally, we derive approximate formulae for the TTVs of planets near any order eccentricity-type MMR; this shows that the same basic sinusoidal TTV structure holds for all eccentricity-type resonances. Our general formula reduces to previously derived results near first-order MMRs.

Celestial mechanics↗