Engineering PapersSearch

SEARCH · Engineering Papers

Results for “constraints”

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 55 records · Page 3

Dark Energy Survey Year 3 Results: Cosmological Constraints from Cluster Abundances, Weak Lensing, and Galaxy Clustering

Galaxy clusters provide a unique probe of the late-time cosmic structure and serve as a powerful independent test of the $\Lambda$CDM model. This work presents the first set of cosmological constraints derived with ~16,000 optically selected redMaPPer clusters across nearly 5,000 $\rm{deg}^2$ using DES Year 3 data sets. Our analysis leverages a consistent modeling framework for galaxy cluster cosmology and DES-Y3 joint analyses of galaxy clustering and weak lensing (3x2pt), ensuring direct comparability with the DES-Y3 3x2pt analysis. We obtain constraints of $S_8 = 0.864 \pm 0.035$ and $\Omega_{\rm{m}} = 0.265^{+0.019}_{-0.031}$ from the cluster-based data vector. We find that cluster constraints and 3x2pt constraints are consistent under the $\Lambda$CDM model with a Posterior Predictive Distribution (PPD) value of $0.53$. The consistency between clusters and 3x2pt provides a stringent test of $\Lambda$CDM across different mass and spatial scales. Jointly analyzing clusters with 3x2pt further improves cosmological constraints, yielding $S_8 = 0.811^{+0.022}_{-0.020}$ and $\Omega_{\rm{m}} = 0.294^{+0.022}_{-0.033}$, a $24\%$ improvement in the $\Omega_{\rm{m}}-S_8$ figure-of-merit over 3x2pt alone. Moreover, we find no significant deviation from the Planck CMB constraints with a probability to exceed (PTE) value of $0.6$, significantly reducing previous $S_8$ tension claims. Finally, combining DES 3x2pt, DES clusters, and Planck CMB places an upper limit on the sum of neutrino masses of $\sum m_\nu < 0.26$ eV at 95% confidence under the $\Lambda$CDM model. These results establish optically selected clusters as a key cosmological probe and pave the way for cluster-based analyses in upcoming Stage-IV surveys such as LSST, Euclid, and Roman.

79 ASTRONOMY AND ASTROPHYSICS

A motion-constraint logic for moving-base simulators based on variable filter parameters

A motion-constraint logic for moving-base simulators has been developed that is a modification to the linear second-order filters generally employed in conventional constraints. In the modified constraint logic, the filter parameters are not constant but vary with the instantaneous motion-base position to increase the constraint as the system approaches the positional limits. With the modified constraint logic, accelerations larger than originally expected are limited while conventional linear filters would result in automatic shutdown of the motion base. In addition, the modified washout logic has frequency-response characteristics that are an improvement over conventional linear filters with braking for low-frequency pilot inputs. During simulated landing approaches of an externally blown flap short take-off and landing (STOL) transport using decoupled longitudinal controls, the pilots were unable to detect much difference between the modified constraint logic and the logic based on linear filters with braking.

Miller, G. K., Jr.

Optimum vibrating beams with stress and deflection constraints

The fundamental frequency of vibration of an Euler-Bernoulli or a Timoshenko beam of a specified constant volume is maximized subject to the constraint that under a prescribed loading the maximum stress or maximum deflection at any point along the beam axis will not exceed a specified value. In contrast with the inequality constraint which controls the minimum cross-section, the present inequality constraints lead to more meaningful designs. The inequality constraint on stresses is as easily implemented as the minimum cross-section constraint but the inequality constraint on deflection uses a treatment which is an extension of the matrix partitioning technique of prescribing displacements in finite element analysis.

Kamat, M. P.

Preliminary design of composite wings for buckling, strength and displacement constraints

An unstiffened panel buckling constraint for balanced, symmetric laminated composites is included on the global design level in a mathematical programming structural optimization procedure for designing wing structures. Constraints are introduced by penalty functions, and Newton's method based on approximate second derivatives of the penalty terms is used as the search algorithm to obtain minimum-mass designs. Constraint approximations used during the optimization process contribute to the computational efficiency of the procedure. A criterion is developed that identifies the appropriate conservative form of the constraint approximations that are used with the optimization procedure. Minimum-mass design results are obtained for a multispar high-aspect-ratio wing subjected to material strength, minimum-gage, displacement, panel buckling and twist constraints. The material systems considered for the examples are all graphite-epoxy, graphite-epoxy with boron-epoxy spar caps, and all aluminum. The composite material designs are shown to have an advantage over the aluminum designs since they can often satisfy additional constraints with only small mass increases.

Starnes, J. H., Jr.

Stress constraints in optimality criteria design

Procedures described emphasize the processing of stress constraints within optimality criteria designs for low structural weight with stress and compliance constraints. Prescreening criteria are used to partition stress constraints into either potentially active primary sets or passive secondary sets that require minimal processing. Side constraint boundaries for passive constraints are derived by projections from design histories to modify conventional stress-ratio boundaries. Other procedures described apply partial structural modification reanalysis to design variable groups to correct stress constraint violations of unfeasible designs. Sample problem results show effective design convergence and, in particular, advantages for reanalysis in obtaining lower feasible design weights.

Levy, R.

A structure-based model of semantic integrity constraints for relational data bases

Data base management systems (DBMSs) are in widespread use because of the ease and flexibility with which users access large volumes of data. Ensuring data accuracy through integrity constraints is a central aspect of DBMS use. However, many DBMSs still lack adequate integrity support. In additon, a comprehensive theoretical basis for such support the role of a constraint classification system - has yet to be developed. This paper presents a formalism that classifies semantic integrity constraints based on the structure of the relational model. Integrity constraints are characterized by the portion of the data base structure they access, whether one or more relations, attributes, or tuples. Thus, the model is completely general, allowing the arbitrary specification of any constraint. Examples of each type of constraint are illustrated using a small engineering data base, and various implementation issues are discussed.

Rasdorf, William J.

Modeling of control forces for kinematical constraints in the dynamics of multibody systems: A new approach

Conventionally kinematical constraints in multibody systems are treated similar to geometrical constraints and are modeled by constraint reaction forces which are perpendicular to constraint surfaces. However, in reality, one may want to achieve the desired kinematical conditions by control forces having different directions in relation to the constraint surfaces. The conventional equations of motion for multibody systems subject to kinematical constraints are generalized by introducing general direction control forces. Conditions for the selections of the control force directions are also discussed. A redundant robotic system subject to prescribed end-effector motion is analyzed to illustrate the methods proposed.

Ider, Sitki Kemal

Optimal impulsive time-fixed orbital rendezvous and interception with path constraints

Minimum-fuel, impulsive, time-fixed solutions are obtained for the problem of orbital rendezvous and interception with interior path constraints. Transfers between coplanar circular orbits in an inverse-square gravitational field are considered, subject to a circular path constraint representing a minimum or maximum permissible orbital radius. Primer vector theory is extended to incorporate path constraints. The optimal number of impulses, their times and positions, and the presence of initial or final coasting arcs are determined. The existence of constraint boundary arcs and boundary points is investigated as well as the optimality of a class of singular arc solutions. To illustrate the complexities introduced by path constraints, an analysis is made of optimal rendezvous in field-free space subject to a minimum radius constraint.

Taur, D.-R.

Effects of constraint on crack growth under aircraft spectrum loading

The objective is to study the effects of constraint on fatigue crack growth under aircraft spectrum loading. A plasticity-induced crack-closure model that accounts for constraint variations during the transition from flat-to-slant crack growth was used to correlate crack-growth rate data under constant-amplitude loading and to calculate crack growth under simulated aircraft spectrum loading. The model was applied to several thin-sheet aluminum alloy materials. Under laboratory air conditions, the transition was shown to be related to the size of the cyclic plastic zone based on the effective stress-intensity factor range for several sheet materials and thicknesses. Results from three-dimensional, elastic-plastic, finite-element analyses of a flat, straight-through crack in a thin-sheet aluminum alloy specimen showed a constraint loss similar to that assumed in the model. Using test data and the closure model, the location of the constraint-loss regime in terms of growth rate and the value of the constraint factor at these rates were determined by trial and error. The model was then used to calculate crack growth under the TWIST spectrum. The calculated results agreed reasonably well with test data. In general, the model predicted shorter crack-growth lives than tests under the TWIST spectrum by about 40 percent. For the TWIST spectrum clipped at Level 3, the calculated lives were within about 20 percent. The results demonstrated that constraint variations, especially for thin-sheet alloys, should be accounted for to predict crack growth under typical aircraft spectra.

Newman, J. C., Jr.

Importance of parametrizing constraints in quantum-mechanical variational calculations

In variational calculations of quantum mechanics, constraints are sometimes imposed explicitly on the wave function. These constraints, which are deduced by physical arguments, are often not uniquely defined. In this work, the advantage of parametrizing constraints and letting the variational principle determine the best possible constraint for the problem is pointed out. Examples are carried out to show the surprising effectiveness of the variational method if constraints are parameterized. It is also shown that misleading results may be obtained if a constraint is not parameterized.

Chung, Kwong T.

Constraint monitoring in TOSCA

The Job-Shop Scheduling Problem (JSSP) deals with the allocation of resources over time to factory operations. Allocations are subject to various constraints (e.g., production precedence relationships, factory capacity constraints, and limits on the allowable number of machine setups) which must be satisfied for a schedule to be valid. The identification of constraint violations and the monitoring of constraint threats plays a vital role in schedule generation in terms of the following: (1) directing the scheduling process; and (2) informing scheduling decisions. This paper describes a general mechanism for identifying constraint violations and monitoring threats to the satisfaction of constraints throughout schedule generation.

Beck, Howard

Magnetotail dynamics under isobaric constraints

Using linear theory and nonlinear MHD simulations, we investigate the resistive and ideal MHD stability of two-dimensional plasma configurations under the isobaric constraint dP/dt = 0, which in ideal MHD is equivalent to conserving the pressure function P = P(A), where A denotes the magnetic flux. This constraint is satisfied for incompressible modes, such as Alfven waves, and for systems undergoing energy losses. The linear stability analysis leads to a Schroedinger equation, which can be investigated by standard quantum mechanics procedures. We present an application to a typical stretched magnetotail configuration. For a one-dimensional sheet equilibrium characteristic properties of tearing instability are rediscovered. However, the maximum growth rate scales with the 1/7 power of the resistivity, which implies much faster growth than for the standard tearing mode (assuming that the resistivity is small). The same basic eigen-mode is found also for weakly two-dimensional equilibria, even in the ideal MHD limit. In this case the growth rate scales with the 1/4 power of the normal magnetic field. The results of the linear stability analysis are confirmed qualitatively by nonlinear dynamic MHD simulations. These results suggest the interesting possibility that substorm onset, or the thinning in the late growth phase, is caused by the release of a thermodynamic constraint without the (immediate) necessity of releasing the ideal MHD constraint. In the nonlinear regime the resistive and ideal developments differ in that the ideal mode does not lead to neutral line formation without the further release of the ideal MHD constraint; instead a thin current sheet forms. The isobaric constraint is critically discussed. Under perhaps more realistic adiabatic conditions the ideal mode appears to be stable but could be driven by external perturbations and thus generate the thin current sheet in the late growth phase, before a nonideal instability sets in.

Birn, Joachim

Constraints on the Energy Content of the Universe from a Combination of Galaxy Cluster Observables

We demonstrate that constraints on cosmological parameters from the distribution of clusters as a function of redshift (dN/dz) are complementary to accurate angular diameter distance (D(sub A)) measurements to clusters, and their combination significantly tightens constraints on the energy density content of the Universe. The number counts can be obtained from X-ray and/or SZ (Sunyaev-Ze'dovich effect) surveys, and the angular diameter distances can be determined from deep observations of the intra-cluster gas using their thermal bremsstrahlung X-ray emission and the SZ effect. We combine constraints from simulated cluster number counts expected from a 12 deg(sup 2) SZ cluster survey and constraints from simulated angular diameter distance measurements based on the X-ray/SZ method assuming a statistical accuracy of 10% in the angular diameter distance determination of 100 clusters with redshifts less than 1.5. We find that Omega(sub m), can be determined within about 25%, Omega(sub lambda) within 20% and w within 16%. We show that combined dN/dz+(sub lambda) constraints can be used to constrain the different energy densities in the Universe even in the presence of a few percent redshift dependent systematic error in D(sub lambda). We also address the question of how best to select clusters of galaxies for accurate diameter distance determinations. We show that the joint dN/dz+ D(lambda) constraints on cosmological parameters for a fixed target accuracy in the energy density parameters are optimized by selecting clusters with redshift upper cut-offs in the range 0.55 approx. less than 1. Subject headings: cosmological parameters - cosmology: theory - galaxies:clusters: general

Molnar, Sandor M.

Constraint Embedding for Multibody System Dynamics

This paper describes a constraint embedding approach for the handling of local closure constraints in multibody system dynamics. The approach uses spatial operator techniques to eliminate local-loop constraints from the system and effectively convert the system into tree-topology systems. This approach allows the direct derivation of recursive O(N) techniques for solving the system dynamics and avoiding the expensive steps that would otherwise be required for handling the closedchain dynamics. The approach is very effective for systems where the constraints are confined to small-subgraphs within the system topology. The paper provides background on the spatial operator O(N) algorithms, the extensions for handling embedded constraints, and concludes with some examples of such constraints.

Jain, Abhinandan

The Behavior, Constraint, and Scenario (BeCoS) Tool: A Web-Based Software Application for Modeling Behaviors and Scenarios

The Behavior, Constraint, and Scenario (BeCoS) tool has been developed to allow engineers to specify system and component behaviors. The tool is a web application that is developed in JavaScript and uses the React framework for the user interface and Redux for maintaining application state. The foundation of the tool is its underlying ontology, which expands upon a previously-defined behavior ontology with a scenario ontology. The behavior ontology includes elements like behaving elements, state variables, parameters, and constraints, while the scenario ontology includes core constructs like activities, temporal constraints, and timepoints. BeCoS allows users to easily create behaving elements and to specify their state variables, parameters, state machines, and constraints. BeCoS also allows users to develop temporal constraint networks that specify constraints on component states over time. BeCoS is a prototype tool that has been deployed and tested by systems engineers on the Europa Clipper project, which generated several use cases and helped steer its current developmental effort. By enabling systems engineers to specify behavior in a semantically-rigorous manner, BeCoS is an enabling technology for analyses that previously could not be performed, and when exporting its model to other tools, allows for consistent behavior models to be used.

Ingham, Michel D.

The Behavior, Constraint, and Scenario (BeCoS) Tool: A Web-Based Software Application for Modeling Behaviors and Scenarios

The Behavior, Constraint, and Scenario (BeCoS) tool has been developed to allow engineers to specify system and component behaviors. The tool is a web application that is developed in JavaScript and uses the React framework for the user interface and Redux for maintaining application state. The foundation of the tool is its underlying ontology, which expands upon a previously-defined behavior ontology with a scenario ontology. The behavior ontology includes elements like behaving elements, state variables, parameters, and constraints, while the scenario ontology includes core constructs like activities, temporal constraints, and timepoints. BeCoS allows users to easily create behaving elements and to specify their state variables, parameters, state machines, and constraints. BeCoS also allows users to develop temporal constraint networks that specify constraints on component states over time. BeCoS is a prototype tool that has been deployed and tested by systems engineers on the Europa Clipper project, which generated several use cases and helped steer its current developmental effort. By enabling systems engineers to specify behavior in a semantically-rigorous manner, BeCoS is an enabling technology for analyses that previously could not be performed, and when exporting its model to other tools, allows for consistent behavior models to be used.

Inghams, Michel D.

REACTER 2.0: Quantum-Informed Reaction Constraints and Automated Interaction Typing

REACTER is a heuristic method for modeling chemical reactions in classical molecular dynamics simulations, implemented in LAMMPS as fix bond/react. The authors recently extended LAMMPS to support alphanumeric labels for atom types, bond types etc., which enables the pre- and post-reaction templates required by the REACTER protocol to be portable between different simulations and greatly simplifies the task of creating simulation-ready reaction templates. To further increase the generality of reaction templates, support for wildcard characters within atom types has been added, along with the automatic assignment of interaction types for new bonds, angles, etc. based on the involved atom types. In some cases, this feature can express a class of reactions with one pair of reaction templates, where previously dozens may have been required. Advanced reaction constraints have also been added, including an Arrhenius constraint to enforce an effective activation energy, a root-mean-square-deviation option for complex geometrical constraints, as well as a custom constraint that leverages LAMMPS’ powerful built-in variable framework. Other new features include variable support for various inputs (e.g., to allow reaction rates or cutoffs to be dependent on overall conversion), on-the-fly update of molecule IDs, and the ability to create new atoms positioned with respect to the reaction site. The new features are applied to modeling polymeric, thermosetting and composite materials, and advanced applications of the new reaction constraints are demonstrated. For example, REACTER is shown to accurately reproduce mechanically-induced bond breaking, as characterized by third-order DFT-based tight-binding (DFTB3) simulations, via a constraint on the total potential energy of the involved atoms.

polymer simulations

Producing Satisfactory Solutions to Scheduling Problems: An Iterative Constraint Relaxation Approach

One drawback to using constraint-propagation in planning and scheduling systems is that when a problem has an unsatisfiable set of constraints such algorithms typically only show that no solution exists. While, technically correct, in practical situations, it is desirable in these cases to produce a satisficing solution that satisfies the most important constraints (typically defined in terms of maximizing a utility function). This paper describes an iterative constraint relaxation approach in which the scheduler uses heuristics to progressively relax problem constraints until the problem becomes satisfiable. We present empirical results of applying these techniques to the problem of scheduling spacecraft communications for JPL/NASA antenna resources.

Constraint Satisfaction Problems CSP constraint pr