Search NASA⌕ Search

SEARCH · Search NASA

Results for “Bounded”

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 433 records · Page 24

Casein kinase II protein kinase is bound to lamina-matrix and phosphorylates lamin-like protein in isolated pea nuclei

A casein kinase II (CK II)-like protein kinase was identified and partially isolated from a purified envelope-matrix fraction of pea (Pisum sativum L.) nuclei. When [gamma-32P]ATP was directly added to the envelope-matrix preparation, the three most heavily labeled protein bands had molecular masses near 71, 48, and 46 kDa. Protein kinases were removed from the preparation by sequential extraction with Triton X-100, EGTA, 0.3 M NaCl, and a pH 10.5 buffer, but an active kinase still remained bound to the remaining lamina-matrix fraction after these treatments. This kinase had properties resembling CK II kinases previously characterized from animal and plant sources: it preferred casein as an artificial substrate, could use GTP as efficiently as ATP as the phosphoryl donor, was stimulated by spermine, was calcium independent, and had a catalytic subunit of 36 kDa. Some animal and plant CK II kinases have regulatory subunits near 29 kDa, and a lamina-matrix-bound protein of this molecular mass was recognized on immunoblot by anti-Drosophila CK II polyclonal antibodies. Also found associated with the envelope-matrix fraction of pea nuclei were p34cdc2-like and Ca(2+)-dependent protein kinases, but their properties could not account for the protein kinase activity bound to the lamina. The 71-kDa substrate of the CK II-like kinase was lamin A-like, both in its molecular mass and in its cross-reactivity with anti-intermediate filament antibodies. Lamin phosphorylation is considered a crucial early step in the entry of cells into mitosis, so lamina-bound CK II kinases may be important control points for cellular proliferation.

NASA Discipline Plant Biology↗

What Information Theory Says about Bounded Rational Best Response

Probability Collectives (PC) provides the information-theoretic extension of conventional full-rationality game theory to bounded rational games. Here an explicit solution to the equations giving the bounded rationality equilibrium of a game is presented. Then PC is used to investigate games in which the players use bounded rational best-response strategies. Next it is shown that in the continuum-time limit, bounded rational best response games result in a variant of the replicator dynamics of evolutionary game theory. It is then shown that for team (shared-payoff) games, this variant of replicator dynamics is identical to Newton-Raphson iterative optimization of the shared utility function.

Wolpert, David H.↗

Upper bounds to error probabilities of coded systems over AWGN and fading channels

A family of upper bounds to error probabilities of coded systems on the additive white Gaussian noise channel was recently proposed by Divsalar. Their calculation depends only on the weight spectrum of the code words. We first elaborate upon these bounds to show how they can be further tightened by using numerical integration instead of a Chernoff bound, and by reducing the number of code words to be included in the bound. Next, we extend them to finding channels.

coded systems↗

Safe Upper-Bounds Inference of Energy Consumption for Java Bytecode Applications

Many space applications such as sensor networks, on-board satellite-based platforms, on-board vehicle monitoring systems, etc. handle large amounts of data and analysis of such data is often critical for the scientific mission. Transmitting such large amounts of data to the remote control station for analysis is usually too expensive for time-critical applications. Instead, modern space applications are increasingly relying on autonomous on-board data analysis. All these applications face many resource constraints. A key requirement is to minimize energy consumption. Several approaches have been developed for estimating the energy consumption of such applications (e.g. [3, 1]) based on measuring actual consumption at run-time for large sets of random inputs. However, this approach has the limitation that it is in general not possible to cover all possible inputs. Using formal techniques offers the potential for inferring safe energy consumption bounds, thus being specially interesting for space exploration and safety-critical systems. We have proposed and implemented a general frame- work for resource usage analysis of Java bytecode [2]. The user defines a set of resource(s) of interest to be tracked and some annotations that describe the cost of some elementary elements of the program for those resources. These values can be constants or, more generally, functions of the input data sizes. The analysis then statically derives an upper bound on the amount of those resources that the program as a whole will consume or provide, also as functions of the input data sizes. This article develops a novel application of the analysis of [2] to inferring safe upper bounds on the energy consumption of Java bytecode applications. We first use a resource model that describes the cost of each bytecode instruction in terms of the joules it consumes. With this resource model, we then generate energy consumption cost relations, which are then used to infer safe upper bounds. How energy consumption for each bytecode instruction is measured is beyond the scope of this paper. Instead, this paper is about how to infer safe energy consumption estimations assuming that those energy consumption costs are provided. For concreteness, we use a simplified version of an existing resource model [1] in which an energy consumption cost for individual Java opcodes is defined.

Navas, Jorge↗

The Effects of Geometric and Loading Imperfections on the Response and Lower-Bound Buckling Load of a Compression-Loaded Cylindrical Shell

Results from a numerical study of the buckling response of a thin-walled compressionloaded isotropic circular cylindrical shell with initial geometric and loading imperfections are used to determine a lower bound buckling load estimate suitable for preliminary design. The lower bound prediction techniques presented herein include an imperfection caused by a lateral perturbation load, an imperfection in the shape of a single stress-free dimple (similar to the lateral pertubation imperfection), and a distributed load imperfection that induces a nonuniform load in the shell. The ABAQUS finite element code is used for the analyses. Responses of the cylinders for selected imperfection amplitudes and imperfection types are considered, and the effect of each imperfection is compared to the response of a geometrically perfect cylinder. The results indicate that compression-loaded shells subjected to a lateral perturbation load or a single dimple imperfection, and a nonuniform load imperfection, exhibit similar buckling behavior and lower bound trends and the predicted lower bounds are much less conservative than the corresponding design recommendation NASA SP-8007 for the design of buckling-critical shells. In addition, the lateral perturbation technique and the distributed load imperfection produce response characteristics that are physically meaningful and can be validated via laboratory testing.

Kriegesmann, Benedikt↗

An Upper Bound on Orbital Debris Collision Probability When Only One Object has Position Uncertainty Information

Upper bounds on high speed satellite collision probability, P (sub c), have been investigated. Previous methods assume an individual position error covariance matrix is available for each object. The two matrices being combined into a single, relative position error covariance matrix. Components of the combined error covariance are then varied to obtain a maximum P (sub c). If error covariance information for only one of the two objects was available, either some default shape has been used or nothing could be done. An alternative is presented that uses the known covariance information along with a critical value of the missing covariance to obtain an approximate but useful P (sub c) upper bound. There are various avenues along which an upper bound on the high speed satellite collision probability has been pursued. Typically, for the collision plane representation of the high speed collision probability problem, the predicted miss position in the collision plane is assumed fixed. Then the shape (aspect ratio of ellipse), the size (scaling of standard deviations) or the orientation (rotation of ellipse principal axes) of the combined position error ellipse is varied to obtain a maximum P (sub c). Regardless as to the exact details of the approach, previously presented methods all assume that an individual position error covariance matrix is available for each object and the two are combined into a single, relative position error covariance matrix. This combined position error covariance matrix is then modified according to the chosen scheme to arrive at a maximum P (sub c). But what if error covariance information for one of the two objects is not available? When error covariance information for one of the objects is not available the analyst has commonly defaulted to the situation in which only the relative miss position and velocity are known without any corresponding state error covariance information. The various usual methods of finding a maximum P (sub c) do no good because the analyst defaults to no knowledge of the combined, relative position error covariance matrix. It is reasonable to think, given an assumption of no covariance information, an analyst might still attempt to determine the error covariance matrix that results in an upper bound on the P (sub c). Without some guidance on limits to the shape, size and orientation of the unknown covariance matrix, the limiting case is a degenerate ellipse lying along the relative miss vector in the collision plane. Unless the miss position is exceptionally large or the at-risk object is exceptionally small, this method results in a maximum P (sub c) too large to be of practical use. For example, assuming that the miss distance is equal to the current ISS alert volume along-track (+ or -) distance of 25 kilometers and that the at-risk area has a 70 meter radius. The maximum (degenerate ellipse) P (sub c) is about 0.00136. At 40 kilometers, the maximum P (sub c) would be 0.00085 which is still almost an order of magnitude larger than the ISS maneuver threshold of 0.0001. In fact, a miss distance of almost 340 kilometers is necessary to reduce the maximum P (sub c) associated with this degenerate ellipse to the ISS maneuver threshold value. Such a result is frequently of no practical value to the analyst. Some improvement may be made with respect to this problem by realizing that while the position error covariance matrix of one of the objects (usually the debris object) may not be known the position error covariance matrix of the other object (usually the asset) is almost always available. Making use of the position error covariance information for the one object provides an improvement in finding a maximum P (sub c) which, in some cases, may offer real utility. The equations to be used are presented and their use discussed.

Frisbee, Joseph H., Jr.↗

Kodiak: An Implementation Framework for Branch and Bound Algorithms

Recursive branch and bound algorithms are often used to refine and isolate solutions to several classes of global optimization problems. A rigorous computation framework for the solution of systems of equations and inequalities involving nonlinear real arithmetic over hyper-rectangular variable and parameter domains is presented. It is derived from a generic branch and bound algorithm that has been formally verified, and utilizes self-validating enclosure methods, namely interval arithmetic and, for polynomials and rational functions, Bernstein expansion. Since bounds computed by these enclosure methods are sound, this approach may be used reliably in software verification tools. Advantage is taken of the partial derivatives of the constraint functions involved in the system, firstly to reduce the branching factor by the use of bisection heuristics and secondly to permit the computation of bifurcation sets for systems of ordinary differential equations. The associated software development, Kodiak, is presented, along with examples of three different branch and bound problem types it implements.

Smith, Andrew P.↗

Pre-Test Assessment of the Upper Bound of the Drag Coefficient Repeatability of a Wind Tunnel Model

A new method is presented that computes a pre{test estimate of the upper bound of the drag coefficient repeatability of a wind tunnel model. This upper bound is a conservative estimate of the precision error of the drag coefficient. For clarity, precision error contributions associated with the measurement of the dynamic pressure are analyzed separately from those that are associated with the measurement of the aerodynamic loads. The upper bound is computed by using information about the model, the tunnel conditions, and the balance in combination with an estimate of the expected output variations as input. The model information consists of the reference area and an assumed angle of attack. The tunnel conditions are described by the Mach number and the total pressure or unit Reynolds number. The balance inputs are the partial derivatives of the axial and normal force with respect to all balance outputs. Finally, an empirical output variation of 1.0 microV/V is used to relate both random instrumentation and angle measurement errors to the precision error of the drag coefficient. Results of the analysis are reported by plotting the upper bound of the precision error versus the tunnel conditions. The analysis shows that the influence of the dynamic pressure measurement error on the precision error of the drag coefficient is often small when compared with the influence of errors that are associated with the load measurements. Consequently, the sensitivities of the axial and normal force gages of the balance have a significant influence on the overall magnitude of the drag coefficient's precision error. Therefore, results of the error analysis can be used for balance selection purposes as the drag prediction characteristics of balances of similar size and capacities can objectively be compared. Data from two wind tunnel models and three balances are used to illustrate the assessment of the precision error of the drag coefficient.

drag coefficient measurement↗

The Conformation of Bound GMPPNP Suggests a Mechanism for Gating the Active Site of the SRP GTPase

The signal recognition particle (SRP) is a phylogenetically conserved ribonucleoprotein that mediates cotranslational targeting of secreted and membrane proteins to the membrane. Targeting is regulated by GTP binding and hydrolysis events that require direct interaction between structurally homologous 'NG' GTPase domains of the SRP signal recognition subunit and its membrane-associated receptor, SR{alpha}. Structures of both the apo and GDP bound NG domains of the prokaryotic SRP54 homolog, Ffh, and the prokaryotic receptor homolog, FtsY, have been determined. The structural basis for the GTP-dependent interaction between the two proteins, however, remains unknown. We report here two structures of the NG GTPase of Ffh from Thermus aquaticus bound to the nonhydrolyzable GTP analog GMPPNP. Both structures reveal an unexpected binding mode in which the {beta}-phosphate is kinked away from the binding site and magnesium is not bound. Binding of the GTP analog in the canonical conformation found in other GTPase structures is precluded by constriction of the phosphate binding P loop. The structural difference between the Ffh complex and other GTPases suggests a specific conformational change that must accompany movement of the nucleotide from an inactive to an active binding mode. Conserved side chains of the GTPase sequence motifs unique to the SRP subfamily may function to gate formation of the active GTP bound conformation. Exposed hydrophobic residues provide an interaction surface that may allow regulation of the GTP binding conformation, and thus activation of the GTPase, during the association of SRP with its receptor.

59 BASIC BIOLOGICAL SCIENCES↗

Verifying the error bound of numerical computation implemented in computer systems

A verification tool receives a finite precision definition for an approximation of an infinite precision numerical function implemented in a processor in the form of a polynomial of bounded functions. The verification tool receives a domain for verifying outputs of segments associated with the infinite precision numerical function. The verification tool splits the domain into at least two segments, wherein each segment is non-overlapping with any other segment and converts, for each segment, a polynomial of bounded functions for the segment to a simplified formula comprising a polynomial, an inequality, and a constant for a selected segment. The verification tool calculates upper bounds of the polynomial for the at least two segments, beginning with the selected segment and reports the segments that violate a bounding condition.

97 MATHEMATICS AND COMPUTING↗

Angular‐Momentum Transfer Mediated by a Vibronic‐Bound‐State

Abstract The notion that phonons can carry pseudo‐angular momentum has many major consequences, including topologically protected phonon chirality, Berry curvature of phonon band structure, and the phonon Hall effect. When a phonon is resonantly coupled to an orbital state split by its crystal field environment, a so‐called vibronic bound state forms. Here, a vibronic bound state is observed in NaYbSe 2 , a quantum spin liquid candidate. In addition, field and polarization dependent Raman microscopy is used to probe an angular momentum transfer of Δ J z = ±ℏ between phonons and the crystalline electric field mediated by the vibronic bound stat. This angular momentum transfer between electronic and lattice subsystems provides new pathways for selective optical addressability of phononic angular momentum via electronic ancillary states.

36 MATERIALS SCIENCE↗

Bounding the Role of Black Carbon in the Climate System: A Scientific Assessment

Black carbon aerosol plays a unique and important role in Earth’s climate system. Black carbon is a type of carbonaceous material with a unique combination of physical properties. Predominant sources are combustion related; namely, fossil fuels for transportation, solid fuels for industrial and residential uses, and open burning of biomass. Total global emissions of black carbon using bottom-up inventory methods are 7500 Gg yr-1 in the year 2000 with an uncertainty range of 2000 to 29000. This assessment provides an evaluation of black-carbon climate forcing that is comprehensive in its inclusion of all known and relevant processes and that is quantitative in providing best estimates and uncertainties of the main forcing terms: direct solar absorption, influence on liquid, mixed-phase, and ice clouds, and deposition on snow and ice. These effects are calculated with models, but when possible, they are evaluated with both microphysical measurements and field observations. Global atmospheric absorption attributable to black carbon is too low in many models, and should be increased by about about 60%. After this scaling, the best estimate for the industrial-era (1750 to 2005) direct radiative forcing of black carbon is +0.43 W m-2 with 90% uncertainty bounds of (+0.17, +0.68) W m-2. Total direct forcing by all black carbon sources in the present day is estimated as +0.49 (+0.20, +0.76) W m-2. Direct radiative forcing alone does not capture important rapid adjustment mechanisms. A framework is described and used for quantifying climate forcings and their rapid responses and feedbacks. The best estimate of industrial-era (1750 to 2005) climate forcing of black carbon through all forcing mechanisms is +0.77 W m-2 with 90% uncertainty bounds of +-0.06 to +1.53 W m-2. Thus, there is a 96% probability that black carbon emissions, independent of co-emitted species, have a positive forcing and warm the climate. With a value of +0.77 W m-2, black carbon is likely the second most important individual climate-forcing agent in the industrial era, following carbon dioxide. Sources that emit black carbon also emit other short- lived species that may either cool or warm climate. Climate forcings from co-emitted species are estimated and used in the framework described herein. When the principal effects of co- emissions, including cooling agents such as sulfur dioxide, are included in net forcing, energy-related sources (fossil-fuel and biofuel) have a net climate forcing of +0.004 (-0.62 to +0.57) W m-2 during the first year after emission. For a few of these sources, such as diesel engines and possibly residential biofuels, warming is strong enough that eliminating all emissions from these sources would reduce net climate forcing (i.e., produce cooling). When open burning emissions, which emit high levels of organic matter, are included in the total, the best estimate of net industrial-era climate forcing by all black- carbon-rich sources becomes slightly negative (-0.08 W m-2 with 90% uncertainty bounds of -1.23 to +0.81 W m-2). The uncertainties in net climate forcing from black-carbon-rich sources are substantial, largely due to lack of knowledge about cloud interactions with both black carbon and co-emitted organic carbon. In prioritizing potential black-carbon mitigation actions, non-science factors, such as technical feasibility, costs, policy design, and implementation feasibility play important roles. The major sources of black carbon are presently in different stages with regard to the feasibility for near-term mitigation. This assessment, by evaluating the large number and complexity of the associated physical and radiative processes in black-carbon climate forcing, sets a baseline from which to improve future climate forcing estimates.

assessment↗

Proximal Galerkin: A Structure-Preserving Finite Element Method for Pointwise Bound Constraints

The proximal Galerkin finite element method is a high-order, low iteration complexity, nonlinear numerical method that preserves the geometric and algebraic structure of pointwise bound constraints in infinite-dimensional function spaces. This paper introduces the proximal Galerkin method and applies it to solve free boundary problems, enforce discrete maximum principles, and develop a scalable, mesh-independent algorithm for optimal design with pointwise bound constraints. This paper also introduces the latent variable proximal point (LVPP) algorithm, from which the proximal Galerkin method derives. When analyzing the classical obstacle problem, we discover that the underlying variational inequality can be replaced by a sequence of second-order partial differential equations (PDEs) that are readily discretized and solved with, e.g., the proximal Galerkin method. Throughout this work, we arrive at several contributions that may be of independent interest. These include (1) a semilinear PDE we refer to as the entropic Poisson equation; (2) an algebraic/geometric connection between high-order positivity-preserving discretizations and certain infinite-dimensional Lie groups; and (3) a gradient-based, bound-preserving algorithm for two-field, density-based topology optimization. The complete proximal Galerkin methodology combines ideas from nonlinear programming, functional analysis, tropical algebra, and differential geometry and can potentially lead to new synergies among these areas as well as within variational and numerical analysis. Open-source implementations of our methods accompany this work to facilitate reproduction and broader adoption.

97 MATHEMATICS AND COMPUTING↗

New results from a number operator interpretation of the compositeness of bound and resonant states

A novel theoretical approach to the problem of the compositeness (X) of a resonance or bound state is developed on the basis of the expectation values of the number operators of the free particles in the continuum. This formalism is specially suitable for effective field theories in which the bare elementary states are integrated out but that give rise to resonance and bound states when implemented in nonperturbative calculations. We demonstrate that X=1 for finite-range energy-independent potentials, either regular or singular. A non-trivial example for an energy-dependent potential is discussed where it is shown that X is independent of any type of cutoff regulator employed. The generalization of these techniques to relativistic states is developed. We also explain how to obtain a meaningful compositeness with respect to the open channels for resonances, even if it is complex in a first turn, by making use of suitable phase-factor transformations. Defining elementariness as X=0, we derive a new universal criterion for the elementariness of a bound state. Along the same lines, a necessary condition for a resonance to be qualified as elementary is given. The application of the formalism here developed might be of considerable practical interest.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Generative AI models for learning flow maps of stochastic dynamical systems in bounded domains

Simulating stochastic differential equations (SDEs) in bounded domains, presents significant computational challenges due to particle exit phenomena, which requires accurate modeling of interior stochastic dynamics and boundary interactions. Despite the success of machine learning-based methods in learning SDEs, existing learning methods are not applicable to SDEs in bounded domains because they cannot accurately capture the particle exit dynamics. We present a unified hybrid data-driven approach that combines a conditional diffusion model with an exit prediction neural network to capture both interior stochastic dynamics and boundary exit phenomena. Our ML model consists of two major components: a neural network that learns exit probabilities using binary cross-entropy loss with rigorous convergence guarantees, and a training-free diffusion model that generates state transitions for non-exiting particles using closed-form score functions. The two components are integrated through a probabilistic sampling algorithm that determines particle exit at each time step and generates appropriate state transitions. Here, the performance of the proposed approach is demonstrated via three test cases: a one-dimensional simplified problem for theoretical verification, a two-dimensional advection-diffusion problem in a bounded domain, and a three-dimensional problem of interest to magnetically confined fusion plasmas.

Bounded domains↗

Optical and Magneto-Optical Properties of Donor-Bound Excitons in Vacancy-Engineered Colloidal Nanocrystals

Controlled insertion of electronic states within the band gap of semiconductor nanocrystals (NCs) is a powerful tool for tuning their physical properties. One compelling example is II–VI NCs incorporating heterovalent coinage metals in which hole capture produces acceptor-bound excitons. To date, the opposite donor-bound exciton scheme has not been realized because of the unavailability of suitable donor dopants. Here, we produce a model system for donor-bound excitons in CdSeS NCs engineered with sulfur vacancies (V S ) that introduce a donor state below the conduction band (CB), resulting in long-lived intragap luminescence. V S -localized electrons are almost unaffected by trapping, and suppression of thermal quenching boosts the emission efficiency to 85%. Magneto-optical measurements indicate that the V S are not magnetically coupled to the NC bands and that the polarization properties are determined by the spin of the valence-band photohole, whose spin flip is massively slowed down due to suppressed exchange interaction with the donor-localized electron.

77 NANOSCIENCE AND NANOTECHNOLOGY↗

Anisotropic Response of Defect Bound States to the Magnetic Field in Epitaxial FeSn Films

Crystal defects, whether intrinsic or engineered, drive many fundamental phenomena and novel functionalities of quantum materials. Here, we report symmetry-breaking phenomena induced by Sn vacancy defects on the surface of epitaxial Kagome antiferromagnetic FeSn films using low-temperature scanning tunneling microscopy and spectroscopy. Near the single Sn vacancy, anisotropic quasiparticle interference patterns are observed in the differential conductance dI/dV maps, breaking the 6-fold rotational symmetry of the Kagome layer. Furthermore, the Sn vacancy defects induce bound states that exhibit anomalous Zeeman shift under an out-of-plane magnetic field, where the energy of the bound states moves linearly toward higher energy independent of the direction of the magnetic field. Under an in-plane magnetic field, the shift of the bound state energy also shows a 2-fold oscillating behavior as a function of the azimuth angle. These findings demonstrate defectenabled new functionalities in Kagome antiferromagnets for potential applications in nanoscale spintronic devices.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Two-sided estimates of minimum-error distinguishability of mixed quantum states via generalized Holevo-Curlander bounds

We prove a concise factor-of-2 estimate for the failure rate of optimally distinguishing an arbitrary ensemble of mixed quantum states, generalizing work of Holevo [Theor. Probab. Appl. 23, 411 (1978)] and Curlander [Ph.D. Thesis, MIT, 1979]. A modification to the minimal principle of Cocha and Poor [Proceedings of the 6th International Conference on Quantum Communication, Measurement, and Computing (Rinton, Princeton, NJ, 2003)] is used to derive a suboptimal measurement which has an error rate within a factor of 2 of the optimal by construction. This measurement is quadratically weighted and has appeared as the first iterate of a sequence of measurements proposed by Jezek et al. [Phys. Rev. A 65, 060301 (2002)]. Unlike the so-called pretty good measurement, it coincides with Holevo's asymptotically optimal measurement in the case of nonequiprobable pure states. A quadratically weighted version of the measurement bound by Barnum and Knill [J. Math. Phys. 43, 2097 (2002)] is proven. Bounds on the distinguishability of syndromes in the sense of Schumacher and Westmoreland [Phys. Rev. A 56, 131 (1997)] appear as a corollary. An appendix relates our bounds to the trace-Jensen inequality.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗