Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Constraint Checking”

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 91 records · Page 5

Atmospheric angular momentum and the length of day - A common fluctuation with a period near 50 days

Four astronomical measures of changes in the length of day obtained in 1979 have been shown to exhibit the same, approximately 50-day fluctuation. To find whether this fluctuation was persistent, and of meteorological origin, lunar laser ranging observations and wind data deduced from sources distributed over the globe were analyzed. A high degree of correlation was found between the two sets of data. It is implied that the 50-day period fluctuations in length of day are real and related to meteorological effects. Observed changes in length of day can provide a constraint for models for atmospheric flow, and a partial check for global analyses of such motions.

Langley, R. B.↗

The Non-Axisymmetric Milky Way

The Dwek et al. model represents the current state-of-the-art model for the stellar structure of our Galaxy. The improvements we have made to this model take a number of forms: (1) the construction of a more detailed dust model so that we can extend our modeling to the galactic plane; (2) simultaneous fits to the bulge and the disk; (3) the construction of the first self-consistent model for a galactic bar; and (4) the development and application of algorithms for constructing nonparametric bar models. The improved Galaxy model has enabled a number of exciting science projects. In Zhao et al., we show that the number and duration of microlensing events seen by the OGLE and MACHO collaborations towards the bulge were consistent with the predictions of our bar model. In Malhotra et al., we constructed an infrared Tully-Fisher (TF) relation for the local group. We found the tightest TF relation ever seen in any band and in any group of galaxies. The tightness of the correlation places strong constraints on galaxy formation models and provides a independent check of the Cepheid distance scale.

Spergel, David N.↗

Application of Sequential Quadratic Programming to Minimize Smart Active Flap Rotor Hub Loads

In an analytical study, SMART active flap rotor hub loads have been minimized using nonlinear programming constrained optimization methodology. The recently developed NLPQLP system (Schittkowski, 2010) that employs Sequential Quadratic Programming (SQP) as its core algorithm was embedded into a driver code (NLP10x10) specifically designed to minimize active flap rotor hub loads (Leyland, 2014). Three types of practical constraints on the flap deflections have been considered. To validate the current application, two other optimization methods have been used: i) the standard, linear unconstrained method, and ii) the nonlinear Generalized Reduced Gradient (GRG) method with constraints. The new software code NLP10x10 has been systematically checked out. It has been verified that NLP10x10 is functioning as desired. The following are briefly covered in this paper: relevant optimization theory; implementation of the capability of minimizing a metric of all, or a subset, of the hub loads as well as the capability of using all, or a subset, of the flap harmonics; and finally, solutions for the SMART rotor. The eventual goal is to implement NLP10x10 in a real-time wind tunnel environment.

HUB LOADS↗

Explainable discrepancy checker and diagnosis for digital Twin-based supervisory control system

By virtually representing a physical object and process, a digital twin (DT) enables optimal autonomous operations by combining classical and novel frameworks in sensors, state predictions, and multi-input/multi-output systems. A DT’s values depend on how well models estimate quantities of interest and on how uncertainty is handled. Moreover, DTs often combine physics-based and data-driven models with mixed fidelities, where classical uncertainty quantification (UQ) struggles with many sources of uncertainty and real-time constraints. Here, this work presents a UQ-based discrepancy checking and diagnosis tool for a DT-based supervisory control system. The tool is developed using metadata from an automated DT development process to learn correlations between sources of uncertainties and outcomes. During operation, it compares predictions with measurements, attributes discrepancies to dominant sources, and recommends parameter and configuration updates. We verify the workflow on a synthetic temperature-control problem and deploy it on a virtual Thermal Energy Delivery System, reducing mismatch and improving control robustness.

22 - GENERAL STUDIES OF NUCLEAR REACTORS↗

Dynamic analysis of fully constrained Cable-Driven Parallel Robots for automated prefabricated component installation

This paper presents a dynamic analysis and validation framework to assess a fully constrained six-anchor Cable-Driven Parallel Robot (CDPR) for automated installation of prefabricated facade components. Compared with conventional eight-anchor systems, the six-anchor configuration simplifies setup and reduces cost, but it also reduces control authority, shrinks the wrench-feasible workspace, and tightens orientation limits. Consequently, it is unclear a priori whether dynamically feasible trajectories exist to move the end effector from pickup to the facade. A constrained trajectory optimization is formulated to enforce the system dynamics, cable-tension bounds, and pose/velocity limits, and the framework is evaluated in simulation at three levels: (i) an idealized reference model, (ii) a lab-scale prototype model incorporating measured anchor misalignments and identified damping, and (iii) a full-scale three-story building model with load decomposition for structural feasibility checks. Across these scenarios, the analysis shows that optimal, constraint-satisfying trajectories exist that move the end effector from pickup to installation while maintaining a near-plumb, level orientation at the final pose. Collectively, this multi-scale dynamic analysis and validation framework supports the deployment readiness of the six-anchor CDPR and provides a prototype-based sensitivity case study of how measured anchor placement deviations affect feasibility.

CDPR↗

Robust wind farm layout optimization

Wake interactions in wind farms cause losses in annual energy production (AEP) on the order of 10%. Wind farm designers optimize the layout of the farm to mitigate wake losses, especially in the dominant site-specific wind directions. As wind turbines and wind farms grow in scale, optimization becomes more complex. Offshore wind farms regularly comprise more than 100 wind turbines and are characterized by complex boundaries due to shipping lanes, neighboring wind farms, and other constraints. Layout optimization methods are broadly split between gradient-based and gradient-free approaches. Gradient-based approaches can converge quickly and perform well for smaller, academic problems but are often sensitive to initial conditions and tuning parameters and require expert knowledge to use. On the other hand, gradient-free approaches can be more robust to problem complexities. We present a robust layout optimization approach based on a random search algorithm. The algorithm is intended for those who are not optimization experts and has few tuning parameters that need specification to achieve satisfactory results. Unlike off-the-shelf methods, which use generally available, non-domain-specific optimization routines that accept as inputs an optimization function and constraint definitions, this approach takes advantage of the relative computational costs of the different evaluations by evaluating cheaper computations first (boundary and minimum distance constraints) and running expensive AEP evaluations only if all other checks pass. Moreover, an outer genetic algorithm allows multiple solutions to evolve in parallel, enabling rapid solution development on high-performance computers. We discuss the relative ease of selecting necessary tuning parameters and demonstrate the efficacy of the genetic random search on a complex layout problem consisting of placing 70 turbines in a nonconvex and unconnected boundary region.

17 WIND ENERGY↗

Non-isothermal laminar flow of gases through cooled tubes.

Numerical solutions of the laminar-flow equations in differential form are presented for gas flows through cooled tubes. For nearly isothermal flow there is good agreement with available experimental data, as is also found for the case of a large amount of wall cooling. This correspondence along with a check on the satisfaction of the global momentum and energy constraints allowed an appraisal of the effect of wall cooling on flow through tubes. In general, the effect of wall cooling was to decrease the wall friction and the change in pressure along tubes, but the average heat-transfer coefficient did not vary much.

Back, L. H.↗

Tools for Coordinated Planning Between Observatories

With the realization of NASA's era of great observatories, there are now more than three space-based telescopes operating in different wavebands. This situation provides astronomers with a unique opportunity to simultaneously observe with multiple observatories. Yet scheduling multiple observatories simultaneously is highly inefficient when compared to observations using only one single observatory. Thus, programs using multiple observatories are limited not due to scientific restrictions, but due to operational inefficiencies. At present, multi-observatory programs are conducted by submitting observing proposals separately to each concerned observatory. To assure that the proposed observations can be scheduled, each observatory's staff has to check that the observations are valid and meet all the constraints for their own observatory; in addition, they have to verify that the observations satisfy the constraints of the other observatories. Thus, coordinated observations require painstaking manual collaboration among the observatory staff at each observatory. Due to the lack of automated tools for coordinated observations, this process is time consuming, error-prone, and the outcome of the requests is not certain until the very end. To increase observatory operations efficiency, such manpower intensive processes need to undergo re-engineering. To overcome this critical deficiency, Goddard Space Flight Center's Advanced Architectures and Automation Branch is developing a prototype effort called the Visual Observation Layout Tool (VOLT). The main objective of the VOLT project is to provide visual tools to help automate the planning of coordinated observations by multiple astronomical observatories, as well as to increase the scheduling probability of all observations.

Jones, Jeremy↗

Science Planning for Multi-Spacecraft Coordinated Observations

Fulfilling the promise of an era of great observatories, NASA now has more than three space-based astronomical telescopes operating in different wavebands. This situation provides astronomers with a unique opportunity to simultaneously observe with multiple observatories. Yet scheduling multiple observatories simultaneously is highly inefficient when compared to single observatory observations. Thus, programs using multiple observatories are limited not due to scientific restrictions, but due to operational inefficiencies. Each year, a number of proposals are accepted by a space-based observatory for conduction of astronomical observations and gathering of science data for the study of galactic events. Since each space-based observatory uses a set of instruments designed to operate in specific energy regions, most such studies are conducted by submitting observation proposals to multiple observatories, with requests to coordinate among themselves. To assure that the proposed observations can be scheduled, each observatory's staff has to check that the observations are valid and meet all the constraints for their own observatory; in addition, they have to verify that the observations satisfy the constraints of the other observatories. Thus, coordinated observations require painstaking manual collaboration among the observatory staff at each observatory. In order to exploit new paradigms for observatory operation, the Goddard Space Flight Center's Advanced Architectures and Automation Branch has developed a prototype tool called the Visual Observation Layout Tool (VOLT). The main objective of VOLT is to provide a visual tool to automate the science planning of coordinated observations for multiple spacecraft, as well as to increase the scheduling probability of observations. However, VOLT is also useful for single observatory planning to optimize observatory control. Three space-based missions are interested in using VOLT (the Hubble Space Telescope, the Chandra X-Ray Observatory, and the Far Ultraviolet Spectroscopic Explorer). The VOLT team members have collaborated with these missions to gather requirements and obtain feedback on their mission planning processes. VOLT has been developed as a cross-platform Java client application for use by scientists and observatory science planning staff to visualize scheduling options and constraints. It also supports a lightweight graphical user interface for remote viewing via a Web front end. Additionally, it uniquely supports the ability to interact with multiple, diverse scheduling packages in order to determine windows of opportunity for observations and visually portray the constraints of each observation request. VOLT enables science data capture scenarios which are currently either impossible, or which require extensive time and manpower to coordinate amongst multiple observatories. it supports early detection of planning conflicts by generating coordinated solutions based on observatory schedulability and constraints. The project development approach has included frequent prototype demonstrations to our interested missions to obtain feedback after each release of the software. We will present an overview of our lessons learned in infusing the VOLT tool into the operations of the missions we have collaborated with and a brief demonstration of the software.

Maks, Lori↗

Verification of Java Programs using Symbolic Execution and Invariant Generation

Software verification is recognized as an important and difficult problem. We present a norel framework, based on symbolic execution, for the automated verification of software. The framework uses annotations in the form of method specifications an3 loop invariants. We present a novel iterative technique that uses invariant strengthening and approximation for discovering these loop invariants automatically. The technique handles different types of data (e.g. boolean and numeric constraints, dynamically allocated structures and arrays) and it allows for checking universally quantified formulas. Our framework is built on top of the Java PathFinder model checking toolset and it was used for the verification of several non-trivial Java programs.

Pasareanu, Corina↗

Proceedings of the First NASA Formal Methods Symposium

Topics covered include: Model Checking - My 27-Year Quest to Overcome the State Explosion Problem; Applying Formal Methods to NASA Projects: Transition from Research to Practice; TLA+: Whence, Wherefore, and Whither; Formal Methods Applications in Air Transportation; Theorem Proving in Intel Hardware Design; Building a Formal Model of a Human-Interactive System: Insights into the Integration of Formal Methods and Human Factors Engineering; Model Checking for Autonomic Systems Specified with ASSL; A Game-Theoretic Approach to Branching Time Abstract-Check-Refine Process; Software Model Checking Without Source Code; Generalized Abstract Symbolic Summaries; A Comparative Study of Randomized Constraint Solvers for Random-Symbolic Testing; Component-Oriented Behavior Extraction for Autonomic System Design; Automated Verification of Design Patterns with LePUS3; A Module Language for Typing by Contracts; From Goal-Oriented Requirements to Event-B Specifications; Introduction of Virtualization Technology to Multi-Process Model Checking; Comparing Techniques for Certified Static Analysis; Towards a Framework for Generating Tests to Satisfy Complex Code Coverage in Java Pathfinder; jFuzz: A Concolic Whitebox Fuzzer for Java; Machine-Checkable Timed CSP; Stochastic Formal Correctness of Numerical Algorithms; Deductive Verification of Cryptographic Software; Coloured Petri Net Refinement Specification and Correctness Proof with Coq; Modeling Guidelines for Code Generation in the Railway Signaling Context; Tactical Synthesis Of Efficient Global Search Algorithms; Towards Co-Engineering Communicating Autonomous Cyber-Physical Systems; and Formal Methods for Automated Diagnosis of Autosub 6000.

Denney, Ewen↗

Pilotless Frame Synchronization Using LDPC Code Constraints

A method of pilotless frame synchronization has been devised for low- density parity-check (LDPC) codes. In pilotless frame synchronization , there are no pilot symbols; instead, the offset is estimated by ex ploiting selected aspects of the structure of the code. The advantag e of pilotless frame synchronization is that the bandwidth of the sig nal is reduced by an amount associated with elimination of the pilot symbols. The disadvantage is an increase in the amount of receiver data processing needed for frame synchronization.

Jones, Christopher↗

Modeling Regular Replacement for String Constraint Solving

Bugs in user input sanitation of software systems often lead to vulnerabilities. Among them many are caused by improper use of regular replacement. This paper presents a precise modeling of various semantics of regular substitution, such as the declarative, finite, greedy, and reluctant, using finite state transducers (FST). By projecting an FST to its input/output tapes, we are able to solve atomic string constraints, which can be applied to both the forward and backward image computation in model checking and symbolic execution of text processing programs. We report several interesting discoveries, e.g., certain fragments of the general problem can be handled using less expressive deterministic FST. A compact representation of FST is implemented in SUSHI, a string constraint solver. It is applied to detecting vulnerabilities in web applications

Fu, Xiang↗

Keyboard Emulation For Computerized Instrumentation

Keyboard emulator has interface at same level as manual keyboard entry. Since communication and control take place at high intelligence level in instrument, all instrument circuitry fully utilized. Little knowledge of instrument circuitry necessary, since only task interface performs is key closure. All existing logic and error checking still performed by instrument, minimizing workload of laboratory microcomputer. Timing constraints for interface operation minimal at keyboard entry level.

Wiegand, P. M.↗

Cross Correlating Cosmological Probes for LSST & CMB-S4

The upcoming years will be populated with state-of-the-art Stage-IV cosmological surveys. This paper forecasts the cosmological information we expect to constrain using probes from the Rubin Observatory Legacy Survey of Space and Time (LSST) and CMB-S4. We explore the effectiveness of different large-scale-structure probes, including the power spectra of galaxy weak lensing, galaxy position, Cosmic Microwave Background (CMB) lensing, and their cross-correlations. We use correlated lognormal simulations with the expected redshift distributions, galaxy number densities, and noise levels of the LSST survey. For CMB weak lensing, we use CMB-S4 lensing simulations with anticipated noise levels to obtain the expected error bars of each probe. We investigate the constraining power of the cosmological parameters for the individual probes and their combinations in an idealized scenario. We do not take into account astrophysical and observational parameters such as galaxy bias variations and photometric redshift un- certainties. Overall, we find the auto-correlated probes hold stronger constraints on cosmological parameters than the cross-correlated probes due to kernel differences. However, the cross-correlation of galaxy clustering and CMB lensing is very comparable to the auto-correlation of galaxy clustering with only an 8% stronger constraint in S8. It will be important for future surveys to use these auto and cross probes in combination due to the different astrophysical and systematic effects involved in CMB and late-time galaxy data. When systematics are added to this analysis, the cross probes will serve as a check for systematic biases in individual probes. In addition, we find a significant increase in constraint using all four probes in combination. This can be illustrated by the increase in constraint of S8 by 93.2% comparing galaxy clustering auto-correlation to a combination of all probes. Our study is a first step toward forecasting the high-precision cosmological constraints we expect to obtain using the next generation of large-scale structure probes.

Gibbins, Grace↗

Protograph LDPC Codes with Node Degrees at Least 3

In this paper we present protograph codes with a small number of degree-3 nodes and one high degree node. The iterative decoding threshold for proposed rate 1/2 codes are lower, by about 0.2 dB, than the best known irregular LDPC codes with degree at least 3. The main motivation is to gain linear minimum distance to achieve low error floor. Also to construct rate-compatible protograph-based LDPC codes for fixed block length that simultaneously achieves low iterative decoding threshold and linear minimum distance. We start with a rate 1/2 protograph LDPC code with degree-3 nodes and one high degree node. Higher rate codes are obtained by connecting check nodes with degree-2 non-transmitted nodes. This is equivalent to constraint combining in the protograph. The condition where all constraints are combined corresponds to the highest rate code. This constraint must be connected to nodes of degree at least three for the graph to have linear minimum distance. Thus having node degree at least 3 for rate 1/2 guarantees linear minimum distance property to be preserved for higher rates. Through examples we show that the iterative decoding threshold as low as 0.544 dB can be achieved for small protographs with node degrees at least three. A family of low- to high-rate codes with minimum distance linearly increasing in block size and with capacity-approaching performance thresholds is presented. FPGA simulation results for a few example codes show that the proposed codes perform as predicted.

low density parity check (LDPC)↗

Simultaneous x-ray diffraction measurements of nine pressure calibrants to 140 GPa

Accurate pressure calibration is fundamental to quantitative high-pressure science, yet inconsistencies among widely used secondary pressure scales persist. In this work, we report simultaneous synchrotron x-ray diffraction meatogether in diamond anvil cells to 140 GPa. This simultaneous-measurement strategy minimizes transitive errors and run-to-run inconsistencies inherent to paired-measurement approaches, yielding direct experimental volume-volume (V-V) relations among the calibrants. These V-V relations link the compression state of each phase to that of every other phase measured in the same experiment. By anchoring these V-V relations to the reduced 300 K equation of state (EOS) of copper derived from ramp-compression measurements, we derive an internally consistent set of Cu-referenced pressure scales via Vinet EOS fits. Because the primary experimental result is the V-V dataset, it provides an EOS-independent constraint that can be rereferenced if primary standards are revised. The dataset further enables a direct experimental cross-check of consistency between the adopted reduced 300 K Cu EOS and the corresponding reduced 300 K ramp-derived EOSs for Pt, Au, Ta, and hcp-Fe under a fixed V-V constraint. The residuals quantify small, material-dependent mismatches between each phase EOS and the Cu reference EOS.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Observation Planning Made Simple with Science Opportunity Analyzer (SOA)

As NASA undertakes the exploration of the Moon and Mars as well as the rest of the Solar System while continuing to investigate Earth's oceans, winds, atmosphere, weather, etc., the ever-existing need to allow operations users to easily define their observations increases. Operation teams need to be able to determine the best time to perform an observation, as well as its duration and other parameters such as the observation target. In addition, operations teams need to be able to check the observation for validity against objectives and intent as well as spacecraft constraints such as turn rates and acceleration or pointing exclusion zones. Science Opportunity Analyzer (SOA), in development for the last six years, is a multi-mission toolset that has been built to meet those needs. The operations team can follow six simple steps and define his/her observation without having to know the complexities of orbital mechanics, coordinate transformations, or the spacecraft itself.

observation planning operations↗