Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Heuristic Evaluation”

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 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

Pufferscale: Rescaling HPC Data Services for High Energy Physics Applications

User-space HPC data services are emerging as an appealing alternative to traditional parallel file systems, because of their ability to be tailored to application needs while eliminating unnecessary overheads incurred by POSIX compliance. The High Energy Physics (HEP) community is progressively turning towards such services to enable high-throughput accesses under heavy concurrency to billions of event data produced by instruments and consumed by subsequent analysis workflows. Such services would benefit from the possibility to be rescaled up and down to adapt to changing workloads, as experimental campaigns progress, in order to optimize resource usage. This paper formalizes rescaling a distributed storage system as a multi objective optimization problem considering three criteria: load balance, data balance, and duration of the rescaling operation. We propose a heuristic for rapidly finding a good approximate solution, while allowing users to weight the criteria as needed. The heuristic is evaluated with Pufferscale, a new rescaling manager for microservice-based distributed storage systems. To validate our approach in a real-world ecosystem, we showcase the use of Pufferscale as a means to enable storage malleability in the HEPnOS storage system for HEP applications.

Distributed Storage System↗
NASA NTRS1987

Mathematical programming formulations for satellite synthesis

The problem of satellite synthesis can be described as optimally allotting locations and sometimes frequencies and polarizations, to communication satellites so that interference from unwanted satellite signals does not exceed a specified threshold. In this report, mathematical programming models and optimization methods are used to solve satellite synthesis problems. A nonlinear programming formulation which is solved using Zoutendijk's method and a gradient search method is described. Nine mixed integer programming models are considered. Results of computer runs with these nine models and five geographically compatible scenarios are presented and evaluated. A heuristic solution procedure is also used to solve two of the models studied. Heuristic solutions to three large synthesis problems are presented. The results of our analysis show that the heuristic performs very well, both in terms of solution quality and solution time, on the two models to which it was applied. It is concluded that the heuristic procedure is the best of the methods considered for solving satellite synthesis problems.

Bhasin, Puneet↗
NASA NTRS1993

Investigation of the launch pad abort capabilities of the HL-20 lifting body

The capability of the HL-20 lifting body spacecraft to perform an abort maneuver from the launch pad to a horizontal landing was studied at NASA Langley Research Center. This study involved both piloted and batch simulation models of the vehicle. A point-mass model of the vehicle was used for trajectory optimization studies. The piloted simulation was performed in the Visual Motion Simulator in fixed-base mode. A candidate maneuver was developed and refined for the worst-case launch-pad-to-landing-site geometry using an iterative procedure of off-line maneuver analysis followed by piloted evaluations and heuristic improvements to the candidate maneuver. The resulting maneuver demonstrates the launch site abort capability of the HL-20 and dictates requirements for nominal abort motor performance. The sensitivity of the maneuver to variations in several design parameters was documented.

Jackson, E. B.↗
NASA NTRS1994

Launch-pad abort capabilities of the HL-20 lifting body

The capability of the HL-20 lifting body to perform an abort maneuver from the launch pad to a horizontal landing was studied. The study involved both piloted and batch simulation models of the vehicle. A point-mass model of the vehicle was used for trajectory optimization studies. The piloted simulation was performed in the Langley Visual/Motion Simulator in the fixed-base mode. A candidate maneuver was developed and refined for the worst-case launch-pad-to-landing-site geometry with an iterative procedure of off-line maneuver analysis followed by piloted evaluations and heuristic improvements to the candidate maneuver. The resulting maneuver demonstrates the launch-site abort capability of the HL-20 and dictates requirements for nominal abort-motor performance. The sensitivity of the maneuver to variations in several design parameters was documented.

Jackson, E. Bruce↗
NASA NTRS1996

Site Partitioning for Redundant Arrays of Distributed Disks

Redundant arrays of distributed disks (RADD) can be used in a distributed computing system or database system to provide recovery in the presence of disk crashes and temporary and permanent failures of single sites. In this paper, we look at the problem of partitioning the sites of a distributed storage system into redundant arrays in such a way that the communication costs for maintaining the parity information are minimized. We show that the partitioning problem is NP-hard. We then propose and evaluate several heuristic algorithms for finding approximate solutions. Simulation results show that significant reduction in remote parity update costs can be achieved by optimizing the site partitioning scheme.

Mourad, Antoine N.↗
NASA NTRS1989

Optimal placement of excitations and sensors by simulated annealing

The optimal placement of discrete actuators and sensors is posed as a combinatorial optimization problem. Two examples for truss structures were used for illustration; the first dealt with the optimal placement of passive dampers along existing truss members, and the second dealt with the optimal placement of a combination of a set of actuators and a set of sensors. Except for the simplest problems, an exact solution by enumeration involves a very large number of function evaluations, and is therefore computationally intractable. By contrast, the simulated annealing heuristic involves far fewer evaluations and is best suited for the class of problems considered. As an optimization tool, the effectiveness of the algorithm is enhanced by introducing a number of rules that incorporate knowledge about the physical behavior of the problem. Some of the suggested rules are necessarily problem dependent.

Salama, Moktar↗
NASA NTRS1995

Spectral ordering techniques for incomplete LU preconditoners for CG methods

The effectiveness of an incomplete LU (ILU) factorization as a preconditioner for the conjugate gradient method can be highly dependent on the ordering of the matrix rows during its creation. Detailed justification for two heuristics commonly used in matrix ordering for anisotropic problems is given. The bandwidth reduction and weak connection following heuristics are implemented through an ordering method based on eigenvector computations. This spectral ordering is shown to be a good representation of the heuristics. Analysis and test cases in two and three dimensional diffusion problems demonstrate when ordering is important, and when an ILU decomposition will be ordering insensitive. The applicability of the heuristics is thus evaluated and placed on a more rigorous footing.

Clift, Simon S.↗
NASA NTRS2003

Task Assignment Heuristics for Parallel and Distributed CFD Applications

This paper proposes a task graph (TG) model to represent a single discrete step of multi-block overset grid computational fluid dynamics (CFD) applications. The TG model is then used to not only balance the computational workload across the overset grids but also to reduce inter-grid communication costs. We have developed a set of task assignment heuristics based on the constraints inherent in this class of CFD problems. Two basic assignments, the smallest task first (STF) and the largest task first (LTF), are first presented. They are then systematically costs. To predict the performance of the proposed task assignment heuristics, extensive performance evaluations are conducted on a synthetic TG with tasks defined in terms of the number of grid points in predetermined overlapping grids. A TG derived from a realistic problem with eight million grid points is also used as a test case.

Lopez-Benitez, Noe↗
NASA NTRS2010

Configuring Airspace Sectors with Approximate Dynamic Programming

In response to changing traffic and staffing conditions, supervisors dynamically configure airspace sectors by assigning them to control positions. A finite horizon airspace sector configuration problem models this supervisor decision. The problem is to select an airspace configuration at each time step while considering a workload cost, a reconfiguration cost, and a constraint on the number of control positions at each time step. Three algorithms for this problem are proposed and evaluated: a myopic heuristic, an exact dynamic programming algorithm, and a rollouts approximate dynamic programming algorithm. On problem instances from current operations with only dozens of possible configurations, an exact dynamic programming solution gives the optimal cost value. The rollouts algorithm achieves costs within 2% of optimal for these instances, on average. For larger problem instances that are representative of future operations and have thousands of possible configurations, excessive computation time prohibits the use of exact dynamic programming. On such problem instances, the rollouts algorithm reduces the cost achieved by the heuristic by more than 15% on average with an acceptable computation time.

Bloem, Michael↗
DOE OSTI2024

Characterizing and communicating uncertainty: lessons from NASA’s Carbon Monitoring System

Navigating uncertainty is a critical challenge in all fields of science, especially when translating knowledge into real-world policies or management decisions. However, the wide variance in concepts and definitions of uncertainty across scientific fields hinders effective communication. As a microcosm of diverse fields within Earth Science, NASA’s Carbon Monitoring System (CMS) provides a useful crucible in which to identify cross-cutting concepts of uncertainty. The CMS convened the Uncertainty Working Group (UWG), a group of specialists across disciplines, to evaluate and synthesize efforts to characterize uncertainty in CMS projects. This paper represents efforts by the UWG to build a heuristic framework designed to evaluate data products and communicate uncertainty to both scientific and non-scientific end users. We consider four pillars of uncertainty: origins, severity, stochasticity versus incomplete knowledge, and spatial and temporal autocorrelation. Using a common vocabulary and a generalized workflow, the framework introduces a graphical heuristic accompanied by a narrative, exemplified through contrasting case studies. Envisioned as a versatile tool, this framework provides clarity in reporting uncertainty, guiding users and tempering expectations. Beyond CMS, it stands as a simple yet powerful means to communicate uncertainty across diverse scientific communities.

54 ENVIRONMENTAL SCIENCES↗
NASA NTRS2009

A Comparative Study of Randomized Constraint Solvers for Random-Symbolic Testing

The complexity of constraints is a major obstacle for constraint-based software verification. Automatic constraint solvers are fundamentally incomplete: input constraints often build on some undecidable theory or some theory the solver does not support. This paper proposes and evaluates several randomized solvers to address this issue. We compare the effectiveness of a symbolic solver (CVC3), a random solver, three hybrid solvers (i.e., mix of random and symbolic), and two heuristic search solvers. We evaluate the solvers on two benchmarks: one consisting of manually generated constraints and another generated with a concolic execution of 8 subjects. In addition to fully decidable constraints, the benchmarks include constraints with non-linear integer arithmetic, integer modulo and division, bitwise arithmetic, and floating-point arithmetic. As expected symbolic solving (in particular, CVC3) subsumes the other solvers for the concolic execution of subjects that only generate decidable constraints. For the remaining subjects the solvers are complementary.

Takaki, Mitsuo↗
DOE OSTI2022

A data-centric weak supervised learning for highway traffic incident detection

Using the data from loop detector sensors for near-real-time detection of traffic incidents on highways is crucial to averting major traffic congestion. While recent supervised machine learning methods offer solutions to incident detection by leveraging human-labeled incident data, the false alarm rate is often too high to be used in practice. Specifically, the inconsistency in the human labeling of the incidents significantly affects the performance of supervised learning models. To that end, we focus on a data-centric approach to improve the accuracy and reduce the false alarm rate of traffic incident detection on highways. We develop a weak supervised learning workflow to generate high-quality training labels for the incident data without the ground truth labels, and we use those generated labels in the supervised learning setup for final detection. This approach comprises three stages. First, we introduce a data preprocessing and curation pipeline that processes traffic sensor data to generate high-quality training data through leveraging labeling functions, which can be domain knowledge-related or simple heuristic rules. Second, we evaluate the training data generated by weak supervision using three supervised learning models-random forest, k-nearest neighbors, and a support vector machine ensemble-and long short-term memory classifiers. The results show that the accuracy of all of the models improves significantly after using the training data generated by weak supervision. Third, we develop an online real-time incident detection approach that leverages the model ensemble and the uncertainty quantification while detecting incidents. Finally, we show that our proposed weak supervised learning workflow achieves a high incident detection rate (0.90) and low false alarm rate (0.08).

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2019

A Tactical Scheduler for Surface Metering Under Minimum Departure Interval Restrictions

Minimum Departure Interval (MDI) and Miles-In-Trail (MIT) are common traffic management tools. They both require minimum separation between departures to meet specific traffic conditions. The MDI restriction is a time separation requirement between departures, usually on the same Standard Instrument Departure (SID), whereas the MIT restriction is a distance separation requirement between aircraft, including but not limited to departure flights, to meet specific criteria associated with flight path or destination. At Incheon International Airport (IATA code: ICN) in South Korea, MDIs are imposed on 92% of departure flights. They involve specific criteria including not only having identical SID, but also satisfying other conditions, imposed on the flight path and destination. To address complicated MDI constraints, Korea Aerospace Research Institute (KARI) has been developing and improving a tactical scheduler for surface metering at ICN to provide appropriate target times for pushbacks and takeoffs for departure flights under MDIs. This paper describes the MDI requirements at ICN, the development of a heuristic scheduling algorithm to work with the MDI restrictions, and the performance evaluation of the algorithm through fast-time simulations. The performance evaluation results indicate that the proposed heuristic algorithm can provide the surface metering schedules that comply with the MDI restrictions without significant performance degradation.

DMAN (Departure Management)↗
NASA NTRS2021

Machine Learning Based Path Planning for Improved Rover Navigation

Enhanced AutoNav (ENav), the baseline surface navigation software for NASA’s Perseverance rover, sorts a list of candidate paths for the rover to traverse, then uses the Approximate Clearance Evaluation (ACE) algorithm to evaluate whether the most highly ranked paths are safe. ACE is crucial for maintaining the safety of the rover, but is computationally expensive. If the most promising candidates in the list of paths are all found to be infeasible, ENav must continue to search the list and run time-consuming ACE evaluations until a feasible path is found. In this paper, we present two heuristics that, given a terrain heightmap around the rover, produce cost estimates that more effectively rank the candidate paths before ACE evaluation. The first heuristic uses Sobel operators and convolution to incorporate the cost of traversing high-gradient terrain. The second heuristic uses a machine learning (ML) model to predict areas that will be deemed untraversable by ACE. We used physics simulations to collect training data for the ML model and to run Monte Carlo trials to quantify navigation performance across a variety of terrains with various slopes and rock distributions. Compared to ENav's baseline performance, integrating the heuristics can lead to a significant reduction in ACE evaluations and average computation time per planning cycle, increase path efficiency, and maintain or improve the rate of successful traverses. This strategy of targeting specific bottlenecks with ML while maintaining the original ACE safety checks provides an example of how ML can be infused into planetary science missions and other safety-critical software.

Yue, Yisong↗
DOE OSTI2020

A Topology Optimization Framework to Facilitate Adoption of Advanced District Thermal Energy Systems

Advanced district thermal energy systems, which circulate water at temperatures near ambient conditions, and facilitate the utilization of waste heat and renewable thermal sources, can lower the carbon-intensity of urban districts, advancing the U.N. Sustainable Development Goals. Optimization of the network topology — the selection of the best subset of buildings and the best network to connect them, to minimize life cycle cost — can increase adoption of these system in appropriate applications. The potential "solution space" of the topology optimization problem grows factorially with the number of buildings in the district, motivating the consideration of a design heuristic. In this study, a heuristic for the network selection was evaluated with an exhaustive search, for a prototypical four-building district. For the prototypical district considered, the heuristic was effective in selecting an optimal network topology. Additionally, it was found that, in this case, the selection of the subset of buildings was more influential on the life cycle cost than the selection of the network topology. This work is part of a larger effort to develop a topology optimization framework for district thermal energy systems, which is anticipated to address barriers to adoption of ambient-temperature systems.

28 EE - Advanced Manufacturing Office (EE-5A)↗
DOE OSTI2022

Impact of Timing in the Design Process on Students’ Application of Design for Additive Manufacturing Heuristics

The goal of this work is to study the way student designers use design for additive manufacturing (DfAM) rules or heuristics. It can be challenging for novice designers to create successful designs for additive manufacturing (AM), due to its recent surge in popularity and lack of formal education or training. A study was carried out to investigate the way novices apply DfAM heuristics when they receive them at different points in the design process. A design problem was presented to students, and three different groups of student participants were given a lecture on DfAM heuristics at three different points in the design process: before the initial design, between the initial design and redesign, and after the redesign. The novelty and quality of each of the resulting designs were evaluated. Results indicate that although the DfAM heuristics lecture had no impact on the overall quality of the designs generated, participants who were given the heuristics lecture after the initial design session produced designs that were better-suited for 3D printing in the second phase of the design activity. However, receiving this additional information appears to prevent students from creatively iterating upon their initial designs, as participants who received heuristic information between the design sessions experienced a decrease in novelty between the two sessions. Additionally, receiving the heuristics lecture increased all students’ perceptions of their ability to perform DfAM-related tasks. Furthermore, these results validate the practicality of design heuristics in lecture form as AM training tools while also emphasizing the importance of iteration in the design process.

computer-aided design↗
NASA NTRS1994

Redundant Disk Arrays in Transaction Processing Systems

We address various issues dealing with the use of disk arrays in transaction processing environments. We look at the problem of transaction undo recovery and propose a scheme for using the redundancy in disk arrays to support undo recovery. The scheme uses twin page storage for the parity information in the array. It speeds up transaction processing by eliminating the need for undo logging for most transactions. The use of redundant arrays of distributed disks to provide recovery from disasters as well as temporary site failures and disk crashes is also studied. We investigate the problem of assigning the sites of a distributed storage system to redundant arrays in such a way that a cost of maintaining the redundant parity information is minimized. Heuristic algorithms for solving the site partitioning problem are proposed and their performance is evaluated using simulation. We also develop a heuristic for which an upper bound on the deviation from the optimal solution can be established.

Mourad, Antoine Nagib↗
NASA NTRS1996

The Aggregate Representation of Terrestrial Land Covers Within Global Climate Models (GCM)

This project had four initial objectives: (1) to create a realistic coupled surface-atmosphere model to investigate the aggregate description of heterogeneous surfaces; (2) to develop a simple heuristic model of surface-atmosphere interactions; (3) using the above models, to test aggregation rules for a variety of realistic cover and meteorological conditions; and (4) to reconcile biosphere-atmosphere transfer scheme (BATS) land covers with those that can be recognized from space; Our progress in meeting these objectives can be summarized as follows. Objective 1: The first objective was achieved in the first year of the project by coupling the Biosphere-Atmosphere Transfer Scheme (BATS) with a proven two-dimensional model of the atmospheric boundary layer. The resulting model, BATS-ABL, is described in detail in a Masters thesis and reported in a paper in the Journal of Hydrology Objective 2: The potential value of the heuristic model was re-evaluated early in the project and a decision was made to focus subsequent research around modeling studies with the BATS-ABL model. The value of using such coupled surface-atmosphere models in this research area was further confirmed by the success of the Tucson Aggregation Workshop. Objective 3: There was excellent progress in using the BATS-ABL model to test aggregation rules for a variety of realistic covers. The foci of attention have been the site of the First International Satellite Land Surface Climatology Project Field Experiment (FIFE) in Kansas and one of the study sites of the Anglo-Brazilian Amazonian Climate Observational Study (ABRACOS) near the city of Manaus, Amazonas, Brazil. These two sites were selected because of the ready availability of relevant field data to validate and initiate the BATS-ABL model. The results of these tests are given in a Masters thesis, and reported in two papers. Objective 4: Progress far exceeded original expectations not only in reconciling BATS land covers with those that can be recognized from space, but also in then applying remotely-sensed land cover data to map aggregate values of BATS parameters for heterogeneous covers and interpreting these parameters in terms of surface-atmosphere exchanges.

Shuttleworth, W. James↗