Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “reachability”

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

Vulnerability of dynamic systems

Directed graphs are associated with dynamic systems in order to determine in any given system if each state can be reached by at least one input (input reachability), or can each state reach at least one output (output reachability). Then, the structural perturbations of a dynamic system are identified as lines or points removals from the corresponding digraph, and a system is considered vulnerable at those lines or points of the digraph whose removal destroys its input or output reachability. A suitable framework is formulated for resolving the problems of reachability and vulnerability which applies to both linear and nonlinear systems alike.

Siljak, D. D.↗

Entropic lens on stabilizer states

The n-qubit stabilizer states are those left invariant by a 2 n -element subset of the Pauli group. The Clifford group is the group of unitaries which take stabilizer states to stabilizer states; a physically motivated generating set, the Hadamard, phase, and controlled-not (cnot) gates which comprise the Clifford gates, impose a graph structure on the set of stabilizers. We explicitly construct these structures, the “reachability graphs,” at n ≤ 5. When we consider only a subset of the Clifford gates, the reachability graphs separate into multiple, often complicated, connected components. Seeking an understanding of the entropic structure of the stabilizer states, which is ultimately built up by cnot gate applications on two qubits, we are motivated to consider the restricted subgraphs built from the Hadamard and cnot gates acting on only two of the n qubits. We show how the two subgraphs already present at two qubits are embedded into more complicated subgraphs at three and four qubits. We argue that no additional types of subgraph appear beyond four qubits, but that the entropic structures within the subgraphs can grow progressively more complicated as the qubit number increases. Starting at four qubits, some of the stabilizer states have entropy vectors which are not allowed by holographic entropy inequalities. Here, we comment on the nature of the transition between holographic and nonholographic states within the stabilizer reachability graphs.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

HBMax: Optimizing Memory Efficiency for Parallel Influence Maximization on Multicore Architectures

The goal of influence maximization is to select k most-influential vertices or seeds in a network, where influence is defined by a given diffusion process. The problem has a number of important applications such as viral marketing, information spread, and epidemic control. Although computing optimal seed set is NP-Hard, due to the submodular nature of the problem efficient approximation algorithms exist. However, even state-of-the-art parallel implementations are limited by a sampling step that incurs large memory footprints. This in turn limits the problem size reach and approximation quality. In this work, we study the memory footprint of the sampling process collecting reverse reachability information in the IMM algorithm over large real-world social networks. We present an adaptive and memory-efficient optimization approach for a state-of-the-art multi-threaded parallel influence maximization algorithm. Our approach,HuffMax, uses a portion of the reverse reachable (RR) sets collected by the algorithm to learn the characteristics of the graph. Then, it compresses the intermediate reverse reachability information with Huffman coding, and queries directly on the compressed data to preserve the memory savings obtained through compression. We also propose an efficient sampling strategy based on the distribution of RR sets, which can further reduce the computation time for typical social networks with long-tail distributions. Considering a NUMA architecture, we scale up our solution on 128-core CPUs and reduce the memory footprint by up to 45.7% with negligible time overhead (or even faster) and without perceivable loss of accuracy.

Chen, Xinyu↗

The 1990 annual statistics and highlights report

The National Space Science Data Center (NSSDC) has archived over 6 terabytes of space and Earth science data accumulated over nearly 25 years. It now expects these holdings to nearly double every two years. The science user community needs rapid access to this archival data and information about data. The NSSDC has been set on course to provide just that. Five years ago the NSSDC came on line, becoming easily reachable for thousands of scientists around the world through electronic networks it managed and other international electronic networks to which it connected. Since that time, the data center has developed and implemented over 15 interactive systems, operational nearly 24 hours per day, and is reachable through DECnet, TCP/IP, X25, and BITnet communication protocols. The NSSDC is a clearinghouse for the science user to find data needed through the Master Directory system whether it is at the NSSDC or deposited in over 50 other archives and data management facilities around the world. Over 13,000 users accessed the NSSDC electronic systems, during the past year. Thousands of requests for data have been satisfied, resulting in the NSSDC's sending out a volume of data last year that nearly exceeded a quarter of its holdings. This document reports on some of the highlights and distribution statistics for most of the basic NSSDC operational services for fiscal year 1990. It is intended to be the first of a series of annual reports on how well NSSDC is doing in supporting the space and Earth science user communities.

Green, James L.↗

Program Models Propagation Of Failures

FIRM is software tool for identification of failure and management of risk based on directed-graph ("digraph") approach. Three core algorithms optimized for processing singletons and doubletons and also handle tripletons. FIRM identifies loops in digraphs and displays direct failure paths between any two nodes. Solves for reachability for given node without computing reachability for entire digraph. Represents hybrid between schematic-diagram and fault-tree approaches. Written in C.

Hackler, Donald B.↗

Knowledge Representation Standards and Interchange Formats for Causal Graphs

In many domains, automated reasoning tools must represent graphs of causally linked events. These include fault-tree analysis, probabilistic risk assessment (PRA), planning, procedures, medical reasoning about disease progression, and functional architectures. Each of these fields has its own requirements for the representation of causation, events, actors and conditions. The representations include ontologies of function and cause, data dictionaries for causal dependency, failure and hazard, and interchange formats between some existing tools. In none of the domains has a generally accepted interchange format emerged. The paper makes progress towards interoperability across the wide range of causal analysis methodologies. We survey existing practice and emerging interchange formats in each of these fields. Setting forth a set of terms and concepts that are broadly shared across the domains, we examine the several ways in which current practice represents them. Some phenomena are difficult to represent or to analyze in several domains. These include mode transitions, reachability analysis, positive and negative feedback loops, conditions correlated but not causally linked and bimodal probability distributions. We work through examples and contrast the differing methods for addressing them. We detail recent work in knowledge interchange formats for causal trees in aerospace analysis applications in early design, safety and reliability. Several examples are discussed, with a particular focus on reachability analysis and mode transitions. We generalize the aerospace analysis work across the several other domains. We also recommend features and capabilities for the next generation of causal knowledge representation standards.

Throop, David R.↗

Remote image analysis for Mars Exploration Rover mobility and manipulation operations

NASA's Mars Exploration Rovers are two sixwheeled, 175-kg robotic vehicles which have operated on Mars for over a year as of March 2005. The rovers are controlled by teams who must understand the rover's surroundings and develop command sequences on a daily basis. The tight tactical planning timeline and everchanging environment call for tools that allow quick assessment of potential manipulator targets and traverse goals, since command sequences must be developed in a matter of hours after receipt of new data from the rovers. Reachability maps give a visual indication of which targets are reachable by each rover's manipulator, while slope and solar energy maps show the rover operator which terrain areas are safe and unsafe from different standpoints.

image understanding↗

Verification and Planning Based on Coinductive Logic Programming

Coinduction is a powerful technique for reasoning about unfounded sets, unbounded structures, infinite automata, and interactive computations [6]. Where induction corresponds to least fixed point's semantics, coinduction corresponds to greatest fixed point semantics. Recently coinduction has been incorporated into logic programming and an elegant operational semantics developed for it [11, 12]. This operational semantics is the greatest fix point counterpart of SLD resolution (SLD resolution imparts operational semantics to least fix point based computations) and is termed co- SLD resolution. In co-SLD resolution, a predicate goal p( t) succeeds if it unifies with one of its ancestor calls. In addition, rational infinite terms are allowed as arguments of predicates. Infinite terms are represented as solutions to unification equations and the occurs check is omitted during the unification process. Coinductive Logic Programming (Co-LP) and Co-SLD resolution can be used to elegantly perform model checking and planning. A combined SLD and Co-SLD resolution based LP system forms the common basis for planning, scheduling, verification, model checking, and constraint solving [9, 4]. This is achieved by amalgamating SLD resolution, co-SLD resolution, and constraint logic programming [13] in a single logic programming system. Given that parallelism in logic programs can be implicitly exploited [8], complex, compute-intensive applications (planning, scheduling, model checking, etc.) can be executed in parallel on multi-core machines. Parallel execution can result in speed-ups as well as in larger instances of the problems being solved. In the remainder we elaborate on (i) how planning can be elegantly and efficiently performed under real-time constraints, (ii) how real-time systems can be elegantly and efficiently model- checked, as well as (iii) how hybrid systems can be verified in a combined system with both co-SLD and SLD resolution. Implementations of co-SLD resolution as well as preliminary implementations of the planning and verification applications have been developed [4]. Co-LP and Model Checking: The vast majority of properties that are to be verified can be classified into safety properties and liveness properties. It is well known within model checking that safety properties can be verified by reachability analysis, i.e, if a counter-example to the property exists, it can be finitely determined by enumerating all the reachable states of the Kripke structure.

Bansal, Ajay↗

Rewriting Modulo SMT and Open System Analysis

This paper proposes rewriting modulo SMT, a new technique that combines the power of SMT solving, rewriting modulo theories, and model checking. Rewriting modulo SMT is ideally suited to model and analyze infinite-state open systems, i.e., systems that interact with a non-deterministic environment. Such systems exhibit both internal non-determinism, which is proper to the system, and external non-determinism, which is due to the environment. In a reflective formalism, such as rewriting logic, rewriting modulo SMT can be reduced to standard rewriting. Hence, rewriting modulo SMT naturally extends rewriting-based reachability analysis techniques, which are available for closed systems, to open systems. The proposed technique is illustrated with the formal analysis of: (i) a real-time system that is beyond the scope of timed-automata methods and (ii) automatic detection of reachability violations in a synchronous language developed to support autonomous spacecraft operations.

Rocha, Camilo↗

Spacesuit and Mobility Performance Changes

The complex interactions between the human body and spacesuit lead to changes inmovement patterns and mobility performancesof the wearer. In general, factors including the geometric properties, such as shape and size, mechanical properties of the suit, and pressurization of the suit are known to be associated with altered movement patterns as compared to an unsuited human.However, their relative contributions have not been explicitly quantified from the mobility performance perspectives. The goal of this study wasthus to assessthe effects fromthe different types of mobility constraintconditions, namely by wearing either a 3D printed hard upper torso (HUT) assembly orfully pressurized spacesuit. The outcome was also compared against the unsuited motions. For this study, an xEMU (exploration Extravehicular Mobility Unit) suitwas considered, which is the next generation spacesuit developed by NASA. In each test condition, the subject was asked to move the arm and hand as prescribedfor different task types, and the corresponding body segment locations were recordedusing a 3D motion capture system. The following three tasks were performedand analyzed: 1) Outward one-handed reaches:the subject in a standing pose made sweeping motions with the extended right arm from the extreme end-to-end positions, including side-to-side at different elevations and top-to-bottom at different azimuths. 2) Outward two-handed reaches:similarto the previous task, howeverthe subject kept the hands together during the motions in order to assessthe areas that can be reached by both hands. 3) Inward one-handed reaches:the subject made right-hand reach motions to the surface of the HUT.The hand traces collected from each task were modeled by a template shape parametrically deformed with a radial basis function. This process enabled foran abstraction of the hand traces into a smooth surface envelope representing the maximally reachable area of the test subject, of which the shapes and sizes were compared across the different test conditions. The preliminary analysis has shown that theoverall size of reachenvelopes decreases in a pressurized suit compared to 3D printed mockup HUT and unsuited conditions. The specific shape of the envelopes, which were determined by the reachable and unreachable zones, alsovary with the testconditions, and the differences werepronounced with the inward reaches to the HUT surface. The latter observation ispotentially relatedto the increased demandfor shoulder and elbow flexions.Overcomingthe resistance from the pressurizedsoft goods and mechanical constraints of the shoulder assemblywas seen to be associated with the difference in motion patterns between the suited and unsuited conditions. Overall, the information quantified from this study is expected to provide structured metrics for spacesuit mobility, which can improve design optimization and human-system integration.

K Han Kim↗

Robust trajectory-constrained frequency control for microgrids considering model linearization error

Grid supportive modes integrated within inverter-based resources can improve the frequency response of renewable-rich microgrids. The synthesis of grid supportive modes to guarantee frequency trajectory constraints under a predefined disturbance set is challenging but essential. To tackle this challenge, a numerical optimal control (NOC)-based control synthesis methodology is proposed. Without loss of generality, a wind-diesel fed microgrid is studied, where we aim to design grid supportive functions in the wind turbine. In the control design, linearized models are used, and the linearization-induced errors are quantitatively analyzed by reachability and interval arithmetics and represented in the form of interval uncertainties. Then, the NOC problem can be formulated into a robust mixed-integer linear program. The control structure is strategically configured into two levels to realize online deployment. The proposed control is verified on the modified 33-node microgrid with a full-order three-phase nonlinear model in Simulink. In conclusion, the simulation results show the effectiveness of the proposed control paradigm and the necessity of considering linearization-induced uncertainty.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Towards Automated Assessment of Vulnerability Exposures in Security Operations

Current approaches for risk analysis of software vulnerabilities using manual assessment and numeric scoring do not complete fast enough to keep pace with the maintenance work rate to patch and mitigate the vulnerabilities. This paper proposes a new approach to modeling software vulnerability risk in the context of the network environment and firewall configuration. In the approach, vulnerability features are automatically matched up with networking, target asset, and adversary features to determine whether adversaries can exploit a vulnerability. The ability of adversaries to reach a vulnerability is modeled by automatically identifying the network services associated with vulnerabilities through a pipeline of machine learning and natural language processing and automatically analyzing network reachability. Our results show that the pipeline can identify network services accurately. We also find that only a small number of vulnerabilities pose real risks to a system. However, if left unmitigated, adversarial reach to vulnerabilities may extend to nullify the effect of firewall countermeasures.

Huff, Philip↗

Charged loops at the cosmological collider with chemical potential

Cosmological collider physics allows the detection of heavy particles at inflationary scales through their imprints on primordial non-Gaussianities. We study the chemical potential mechanism applied to a pair of charged scalars. We analytically evaluate the resulting one-loop contribution to the bispectrum, using the spectral decomposition. In this way we are able to determine the parametric dependencies for both the signal and the background. We show that a signal strength ${f}_{\text{NL}}\sim \mathcal{O}(0.01)$ can be obtained within theoretical control, potentially reachable by 21 cm tomography. As an application we consider the colored Higgs bosons in SU(5) supersymmetric orbifold grand unification with masses M ≲ 10$^{15}$ GeV.

Bodas, Arushi [Chicago U., EFI; Fermilab] (ORCID:0↗

Quantum computational phase transition in combinatorial problems

Quantum Approximate Optimization algorithm (QAOA) aims to search for approximate solutions to discrete optimization problems with near-term quantum computers. As there are no algorithmic guarantee possible for QAOA to outperform classical computers, without a proof that bounded-error quantum polynomial time (BQP) ≠ nondeterministic polynomial time (NP), it is necessary to investigate the empirical advantages of QAOA. We identify a computational phase transition of QAOA when solving hard problems such as SAT—random instances are most difficult to train at a critical problem density. We connect the transition to the controllability and the complexity of QAOA circuits. Moreover, we find that the critical problem density in general deviates from the SAT-UNSAT phase transition, where the hardest instances for classical algorithms lies. Then, we show that the high problem density region, which limits QAOA’s performance in hard optimization problems (reachability deficits), is actually a good place to utilize QAOA: its approximation ratio has a much slower decay with the problem density, compared to classical approximate algorithms. Indeed, it is exactly in this region that quantum advantages of QAOA over classical approximate algorithms can be identified.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Techniques for studying materials under extreme states of high energy density compression

The properties of materials under extreme conditions of pressure and density are of key interest to a number of fields, including planetary geophysics, materials science, and inertial confinement fusion. In geophysics, the equations of state of planetary materials, such as hydrogen and iron, under ultrahigh pressure and density provide a better understanding of their formation and interior structure [Celliers et al., “Insulator-metal transition in dense fluid deuterium,” Science 361, 677–682 (2018) and Smith et al., “Equation of state of iron under core conditions of large rocky exoplanets,” Nat. Astron. 2, 591–682 (2018)]. The processes of interest in these fields occur under conditions of high pressure (100 GPa–100 TPa), high temperature (>3000 K), and sometimes at high strain rates (>103 s−1) depending on the process. With the advent of high energy density (HED) facilities, such as the National Ignition Facility (NIF), Linear Coherent Light Source, Omega Laser Facility, and Z, these conditions are reachable and numerous experimental platforms have been developed. To measure compression under ultrahigh pressure, stepped targets are ramp-compressed and the sound velocity, measured by the velocity interferometer system for any reflector diagnostic technique, from which the stress-density of relevant materials is deduced at pulsed power [M. D. Knudson and M. P. Desjarlais, “High-precision shock wave measurements of deuterium: Evaluation of exchange-correlation functionals at the molecular-to-atomic transition,” Phys. Rev. Lett. 118, 035501 (2017)] and laser [Smith et al., “Equation of state of iron under core conditions of large rocky exoplanets,” Nat. Astron. 2, 591–682 (2018)] facilities. To measure strength under high pressure and strain rates, experimenters measure the growth of Rayleigh–Taylor instabilities using face-on radiography [Park et al., “Grain-size-independent plastic flow at ultrahigh pressures and strain rates,” Phys. Rev. Lett. 114, 065502 (2015)]. The crystal structure of materials under high compression is measured by dynamic x-ray diffraction [Rygg et al., “X-ray diffraction at the national ignition facility,” Rev. Sci. Instrum. 91, 043902 (2020) and McBride et al., “Phase transition lowering in dynamically compressed silicon,” Nat. Phys. 15, 89–94 (2019)]. Medium range material temperatures (a few thousand degrees) can be measured by extended x-ray absorption fine structure techniques, Yaakobi et al., “Extended x-ray absorption fine structure measurements of laser-shocked V and Ti and crystal phase transformation in Ti,” Phys. Rev. Lett. 92, 095504 (2004) and Ping et al., “Solid iron compressed up to 560 GPa,” Phys. Rev. Lett. 111, 065501 (2013), whereas more extreme temperatures are measured using x-ray Thomson scattering or pyrometry. This manuscript will review the scientific motivations, experimental techniques, and the regimes that can be probed for the study of materials under extreme HED conditions.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Analog and symbolic computation through the Koopman framework

We develop a Koopman operator framework for studying the computational structure of dynamical systems. Specifically, we show that the resolvent of the Koopman operator provides a natural abstraction of halting, yielding a ‘Koopman halting problem’ that is recursively enumerable in general. For symbolic systems, such as those defined on Cantor space, this operator formulation captures reachability between clopen sets, while for equicontinuous systems we prove that the Koopman halting problem is decidable. Our framework demonstrates that absorbing (halting) states in coarse-grained finite automata correspond to Koopman eigenfunctions with eigenvalue one, while cycles in the transition graph impose spectral constraints associated with periodic dynamics. These results provide a unifying perspective on computation in symbolic and analog systems, showing how computational universality is reflected in operator spectra, invariant subspaces, and algebraic structures. Beyond symbolic dynamics, this operator-theoretic lens opens pathways to analyze the computational properties of a broader class of dynamical systems, including polynomial and analog models, and suggests that computational hardness may admit dynamical signatures in terms of Koopman spectral structure.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Unraveling trace anomaly of supradense matter via neutron star compactness scaling

The trace anomaly Δ ≡ 1/3 −𝑃/𝜖 =1/3 −𝜙 quantifies the possibly broken conformal symmetry in supradense matter under pressure 𝑃 at energy density 𝜖. Perturbative QCD (pQCD) predicts a vanishing Δ at extremely high energy or baryon densities when the conformal symmetry is realized but its behavior at intermediate densities reachable in neutron stars (NSs) is still very uncertain. The extraction of Δ from NS observations strongly depends on the employed model for nuclear equation of state (EOS). Using the IPAD-TOV method based on an intrinsic and perturbative analysis of the dimensionless (IPAD) Tolman-Oppenheimer-Volkoff (TOV) equations that are further verified numerically by using 10 5 EOSs generated randomly with a metamodel in a very broad EOS parameter space constrained by terrestrial nuclear experiments and astrophysical observations, here we first show that the compactness 𝜉 ≡ 𝐺⁡𝑀 NS /𝑅⁢𝑐 2 ≡ 𝑀 NS /𝑅 of a NS with mass 𝑀 NS and radius 𝑅 scales very accurately with $\bar{Π}$ c ≡ $Π$ c · (1 +18⁢X/25) ≡ X/(1 +3⁢X 2 +4⁢X) · (1 +18⁢X/25) where X ≡ 𝜙 c = 𝑃 c /𝜖 c is the ratio of pressure over energy density at NS centers. The scaling of NS compactness thus enables one to readily read off the central trace anomaly Δ c = 1/3 −X directly from the observational data of either the mass-radius or red-shift measurements. Finally, we then demonstrate indeed that the available NS data themselves from recent X-ray and gravitational wave observations can determine model insensitively the trace anomaly as a function of energy density in NS cores, providing a stringent test of existing NS models and a clear guidance in a new direction for further understanding the nature and EOS of supradense matter.

nuclear astrophysics↗

Bounding entanglement entropy with Clifford double cosets

Following on our previous work studying the orbits of quantum states under Clifford circuits via reachability graphs, we introduce contracted graphs whose vertices represent classes of quantum states with the same entropy vector. These contracted graphs represent the double cosets of the Clifford group, where the left cosets are built from the stabilizer subgroup of the starting state and the right cosets are built from the entropy-preserving operators. We study contracted graphs for stabilizer states, as well as 𝑊 states and Dicke states, discussing how the diameter of a state's contracted graph constrains the entropic diversity of its two-qubit Clifford orbit. We derive an upper bound on the number of entropy vectors that can be generated using any 𝑛-qubit Clifford circuit, for any quantum state. Here, we speculate on the holographic implications for the relative proximity of gravitational duals of states within the same Clifford orbit. Although we concentrate on how entropy evolves under the Clifford group, our double-coset formalism, and thus the contracted graph picture, is extendable to generic gate sets and generic state properties.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗