Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Embedded computing”

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 487 records · Page 27

Precision string phenomenology

Calabi-Yau compactifications of the E 8 × E 8 heterotic string provide a promising route to recovering the four-dimensional particle physics described by the Standard Model. While the topology of the Calabi-Yau space determines the overall matter content in the low-energy effective field theory, further details of the compactification geometry are needed to calculate the normalized physical couplings and masses of elementary particles. In this work, we present numerical computations of physical Yukawa couplings in a number of heterotic models in the standard embedding and demonstrate the existence of natural hierarchies, a coveted feature in string model building. Published by the American Physical Society 2025

Berglund, Per (ORCID:0000000316754133)↗

Hypergames and Cyber-Physical Security for Control Systems

The identification of the Stuxnet worm in 2010 provided a highly publicized example of a cyber attack that physically damaged an industrial control system. This raised public awareness about the possibility of similar attacks against other industrial targets—including critical infrastructure. Here, we use hypergames to analyze how strategic perturbations of sensor readings and calibrated parameters can be used to manipulate a system that employs optimal control. Hypergames form an extension of game theory that enables us to model strategic interactions where the players may have significantly different perceptions of the game(s) they are playing. Past work with hypergames has focused on relatively simple interactions consisting of a small set of discrete choices for each player. Here, we apply single-stage hypergames to larger systems with continuous variables. We find that manipulating constraints can be a more effective attacker strategy than manipulating objective function parameters. Moreover, the attacker need not change the underlying system to carry out a successful attack—it may be sufficient to deceive the defender controlling the system. It is possible to scale our approach up to even larger systems, but this will depend on the characteristics of the system in question, and we identify several characteristics that will make those systems amenable to hypergame analysis.

97 MATHEMATICS AND COMPUTING↗

Cell Dancoff-based embedded self-shielding capability for doubly heterogeneous particulate fuels in SCALE/Polaris

Polaris is a two-dimensional (2D) transport lattice physics capability in the SCALE code system for light-water reactor (LWR) analysis. SCALE/Polaris is being extended to treat doubly heterogeneous particulate fuels in LWRs with accident-tolerant fuels and prismatic high-temperature gas-cooled reactor (HTGR) fuel. Recently, a Dancoff-based Wigner-Seitz approximation capability based on the embedded self-shielding method (DWA-ESSM) was implemented into Polaris for efficient computation. A new double heterogeneity treatment capability based on DWA-ESSM in conjunction with the Hebert's collision probability method for double heterogeneity was developed and implemented for Polaris. The new capability was verified by performing benchmark calculations for the prismatic HTGR fuel compact problems with various design parameters through a code-to-code comparison between the Polaris and continuous-energy Monte Carlo results. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

The Case for Optimized Edge-Centric Tractography at Scale

The anatomic validity of structural connectomes remains a significant uncertainty in neuroimaging. Edge-centric tractography reconstructs streamlines in bundles between each pair of cortical or subcortical regions. Although edge bundles provides a stronger anatomic embedding than traditional connectomes, calculating them for each region-pair requires exponentially greater computation. We observe that major speedup can be achieved by reducing the number of streamlines used by probabilistic tractography algorithms. To ensure this does not degrade connectome quality, we calculate the identifiability of edge-centric connectomes between test and re-test sessions as a proxy for information content. We find that running PROBTRACKX2 with as few as 1 streamline per voxel per region-pair has no significant impact on identifiability. Variation in identifiability caused by streamline count is overshadowed by variation due to subject demographics. This finding even holds true in an entirely different tractography algorithm using MRTrix. Incidentally, we observe that Jaccard similarity is more effective than Pearson correlation in calculating identifiability for our subject population.

59 BASIC BIOLOGICAL SCIENCES↗

Dissociation rate of bromine diatomics in an argon heat bath

The evolution of a collection of 300 K bromine diatomics embedded in a heat bath of argon atoms at 1800 K was studied by computer, and a dissociation-rate constant for the reaction Br2 + BR + Ar yields Br + Ar was determined. Previously published probability distributions for energy and angular momentum transfers in classical three-dimensional Br2-Ar collisions were used in conjunction with a newly developed Monte Carlo scheme for this purpose. Results are compared with experimental shock-tube data and the predictions of several other theoretical models. A departure from equilibrium is obtained which is significantly greater than that predicted by any of these other theories.

Razner, R.↗

Integral equation solution for transonic and subsonic aerodynamics

Two methods are presented to solve for the subsonic and transonic flows around airfoils. The first method is based on the integral solution of the full-potential equation with a shock-capturing technique only or with shock capturing-shock fitting technique. In the second method, the integral soluton of the full potential equation is coupled with an embedded region of Euler equations around the shock location. The second method is a computationally efficient technique for flows with strong shocks where the entropy increase and vorticity production across the shock are not small. Several numerical examples are presented and compared with the experimental data and other computational results.

Kandil, Osama A.↗

Applications of ISES for vegetation and land use

Remote sensing relative to applications involving vegetation cover and land use is reviewed to consider the potential benefits to the Earth Observing System (Eos) of a proposed Information Sciences Experiment System (ISES). The ISES concept has been proposed as an onboard experiment and computational resource to support advanced experiments and demonstrations in the information and earth sciences. Embedded in the concept is potential for relieving the data glut problem, enhancing capabilities to meet real-time needs of data users and in-situ researchers, and introducing emerging technology to Eos as the technology matures. These potential benefits are examined in the context of state-of-the-art research activities in image/data processing and management.

Wilson, R. Gale↗

Performance analysis of a generalized concurrent error detection procedure

A general procedure for error detection in complex systems, called the data block capture and analysis monitoring process, is described and analyzed. It is assumed that, in addition to being exposed to potential external fault sources, a complex system will in general always contain embedded hardware and software fault mechanisms which can cause the system to perform incorrect computations and/or produce incorrect output. Thus, in operation, the system continuously moves back and forth between error and no-error states. These external fault sources or internal fault mechanisms are extremely difficult to detect. The data block capture and analysis monitoring process is concerned with detecting deviations from the normal performance of the system, known as errors, which are symptomatic of fault conditions. The process consists of repeatedly recording a fixed amount of data from a set of predetermined observation lines of the system being monitored (i.e., capturing a block of data) and then analyzing the captured block in an attempt to determine whether the system is functioning correctly. The performances of linear, quadratic, and logarithmic data analysis algorithms are rigorously characterized in terms of the probability of correctly detecting an error, the expectation and variance of the number of false alarms per error, and the expectation and variance of the latency in detection of errors. Insight into the nature of the general problem of error detection is obtained.

Blough, Douglas M.↗

Robonaut's Flexible Information Technology Infrastructure

Robonaut, NASA's humanoid robot, is designed to work as both an astronaut assistant and, in certain situations, an astronaut surrogate. This highly dexterous robot performs complex tasks under telepresence control that could previously only be carried out directly by humans. Currently with 47 degrees of freedom (DOF), Robonaut is a state-of-the-art human size telemanipulator system. while many of Robonaut's embedded components have been custom designed to meet packaging or environmental requirements, the primary computing systems used in Robonaut are currently commercial-off-the-shelf (COTS) products which have some correlation to flight qualified computer systems. This loose coupling of information technology (IT) resources allows Robonaut to exploit cost effective solutions while floating the technology base to take advantage of the rapid pace of IT advances. These IT systems utilize a software development environment, which is both compatible with COTS hardware as well as flight proven computing systems, preserving the majority of software development for a flight system. The ability to use highly integrated and flexible COTS software development tools improves productivity while minimizing redesign for a space flight system. Further, the flexibility of Robonaut's software and communication architecture has allowed it to become a widely used distributed development testbed for integrating new capabilities and furthering experimental research.

Askew, Scott↗

Policy Process Editor for P3BM Software

A computer program enables generation, in the form of graphical representations of process flows with embedded natural-language policy statements, input to a suite of policy-, process-, and performance-based management (P3BM) software. This program (1) serves as an interface between users and the Hunter software, which translates the input into machine-readable form; and (2) enables users to initialize and monitor the policy-implementation process. This program provides an intuitive graphical interface for incorporating natural-language policy statements into business-process flow diagrams. Thus, the program enables users who dictate policies to intuitively embed their intended process flows as they state the policies, reducing the likelihood of errors and reducing the time between declaration and execution of policy.

James, Mark↗

Formal Verification of Termination Criteria for​ First-Order Recursive Functions

This talk presents a formalization of several termination criteria for first-order recursive functions. The formalization, which is developed in the Prototype Verification System (PVS), includes the specification and proof of equivalence of semantic termination, Turing termination, size change principle, calling context graphs, and matrix-weighted graphs. These termination criteria are defined on a computational model that consists of a basic functional language called PVS0, which is an embedding of recursive first-order functions. Through this embedding, the native mechanism for checking termination of recursive functions in PVS could be soundly extended with semi-automatic termination criteria such as calling contexts graphs.

Termination↗

Technical Characterization and Benefit Evaluation of 5G-Enabled Grid Data Transport and Applications

This report summarizes the Year 1 work of Pacific Northwest National Laboratory’s (PNNL’s) 5G Fabricated Resource and Asset Management Encompassment for energy infrastructure (Energy FRAME) project funded by the Department of Energy Office of Science’s Advanced Scientific Computing Research Program. 5G is a breakthrough technology that enables a fully mobile and connected society, and a 5G-enabled digital continuum will be one of the critical foundations for a clean energy economy and grid modernization. In collaboration with PNNL’s Advanced Wireless Communication team and Center for Advanced Technology Evaluation team, the project team has been evaluating the system performance of 5G testbeds in the PNNL 5G Innovation Studio, and has formulated a co-simulation test case of power system transmission, distribution, and communication (T&D&C) networks considering 5G technology and high penetration of distributed energy resources. The methodology developed in the 5G Energy FRAME project can be customized to fit different future grid scenarios to evaluate multiple (dynamic) configurations (computing, sensing, communication, environment) for different stakeholders. In summary, our main technical highlights in project Year 1 are as follows: 1) Technical characterization of 5G standalone architectures, 2) Formulation of co-simulation test case of T&D&C networks embedded with 5G, 3) Initial benefit evaluation of 5G communication platform for grid use cases, and 4) Additional extended discussions on edge computing, artificial intelligence and machine learning, and high-performance computing and cloud computing adoptions. In addition, a collection of system performance data is shared through the publicly available weblink, https://www.pnnl.gov/projects/5g-energy-frame/publications

24 POWER TRANSMISSION AND DISTRIBUTION↗

Planet Formation by Gas-assisted Accretion of Small Solids

We compute the accretion efficiency of small solids, with radii 1 cm ≤ R s ≤ 10 m, on planets embedded in gaseous disks. Planets have masses 3 ≤ M p ≤ 20 Earth masses (M ⊕ ) and orbit within 10 au of a solar mass star. Disk thermodynamics is modeled via 3D radiation-hydrodynamics calculations that typically resolve the planetary envelopes. Both icy and rocky solids are considered, explicitly modeling their thermodynamic evolution. The maximum efficiencies of 1 ≤ R s ≤ 100 cm particles are generally ≲10%, whereas 10 m solids tend to accrete efficiently or be segregated beyond the planet’s orbit. A simplified approach is applied to compute the accretion efficiency of small cores, with masses M p ≤ 1 M ⊕ and without envelopes, for which efficiencies are approximately proportional to $M^{2/3}_{p}$. The mass flux of solids, estimated from unperturbed drag-induced drift velocities, provides typical accretion rates dM p /dt ≲ 10 -5 M ⊕ yr -1 . In representative disk models with an initial gas-to-dust mass ratio of 70–100 and total mass of 0.05–0.06 M ⊙ , the solids’ accretion falls below 10 -6 M ⊕ yr -1 after 1–1.5 Myr. The derived accretion rates, as functions of time and planet mass, are applied to formation calculations that compute dust opacity self-consistently with the delivery of solids to the envelope. Assuming dust-to-solid coagulation times of ≈0.3 Myr and disk lifetimes of ≈3.5 Myr, heavy-element inventories in the range 3–7 M ⊕ require that ≈90–150 M ⊕ of solids cross the planet’s orbit. The formation calculations encompass a variety of outcomes, from planets a few times M ⊕ , predominantly composed of heavy elements, to giant planets. The peak luminosities during the epoch of the solids’ accretion range from ≈10 -7 to ≈10 -6 L ⊙ .

79 ASTRONOMY AND ASTROPHYSICS↗

Computation of incompressible viscous flows through artificial heart devices with moving boundaries

The extension of computational fluid dynamics techniques to artificial heart flow simulations is illustrated. Unsteady incompressible Navier-Stokes equations written in 3-D generalized curvilinear coordinates are solved iteratively at each physical time step until the incompressibility condition is satisfied. The solution method is based on the pseudo compressibility approach and uses an implicit upwind differencing scheme together with the Gauss-Seidel line relaxation method. The efficiency and robustness of the time accurate formulation of the algorithm are tested by computing the flow through model geometries. A channel flow with a moving indentation is computed and validated with experimental measurements and other numerical solutions. In order to handle the geometric complexity and the moving boundary problems, a zonal method and an overlapping grid embedding scheme are used, respectively. Steady state solutions for the flow through a tilting disk heart valve was compared against experimental measurements. Good agreement was obtained. The flow computation during the valve opening and closing is carried out to illustrate the moving boundary capability.

Kiris, Cetin↗

Computational neural learning formalisms for manipulator inverse kinematics

An efficient, adaptive neural learning paradigm for addressing the inverse kinematics of redundant manipulators is presented. The proposed methodology exploits the infinite local stability of terminal attractors - a new class of mathematical constructs which provide unique information processing capabilities to artificial neural systems. For robotic applications, synaptic elements of such networks can rapidly acquire the kinematic invariances embedded within the presented samples. Subsequently, joint-space configurations, required to follow arbitrary end-effector trajectories, can readily be computed. In a significant departure from prior neuromorphic learning algorithms, this methodology provides mechanisms for incorporating an in-training skew to handle kinematics and environmental constraints.

Gulati, Sandeep↗

Optimal calibration of gates in trapped-ion quantum computers

Abstract To harness the power of quantum computing, it is essential that a quantum computer provide maximal possible fidelity for a quantum circuit. To this end, much work has been done in the context of qubit routing or embedding, i.e., mapping circuit qubits to physical qubits based on gate performance metrics to optimize the fidelity of execution. Here, we take an alternative approach that leverages a unique capability of a trapped-ion quantum computer, i.e., the all-to-all qubit connectivity. We develop a method to determine a fixed number (budget) of quantum gates that, when calibrated, will maximize the fidelity of a batch of input quantum programs. This dynamic allocation of calibration resources on randomly accessible gates, determined using our heuristics, increases, for a wide range of calibration budget, the average fidelity from 70% or lower to 90% or higher for a typical batch of jobs on an 11-qubit device, in which the fidelity of calibrated and uncalibrated gates are taken to be 99% and 90%, respectively. Our heuristics are scalable, more than 2.5 orders of magnitude faster than a randomized method for synthetic benchmark circuits generated based on real-world use cases.

Maksymov, Andrii (ORCID:0000000282442851)↗

Projector-Free Capped-Fragment Scheme within Density Functional Embedding Theory for Covalent and Ionic Compounds

Quantum-mechanics-(QM)-based simulations now routinely aid in understanding and even discovering new chemistries involving molecules and materials exhibiting desired functionalities. Ab initio correlated wavefunction (CW) theories systematically improve QM methods, with many exhibiting high accuracy. However, execution of CW methods requires expensive computations that typically scale poorly with system size. Divide-and-conquer approaches partition large systems into smaller fragments; a lower level of theory treats fragment interactions while a preferred higher level of theory describes the important fragment. These methods offer ways to incorporate CWs into chemical simulations of large systems, e.g., biomolecules, surfaces, large inorganic clusters, bulk crystals, etc. Here we propose a partitioning protocol that utilizes capping atoms to saturate severed covalent bonds at fragment interfaces and density functional embedding theory (DFET) to describe fragment interactions. The capping groups in each fragment provide an ad-hoc potential that approximates the effects of the environment. An embedding potential optimized via DFET then serves as an augmentation of the capping group to simulate the effects of the environment. We concurrently use an auxiliary fragment (a separate system comprised of only the combined capping groups) to account for, and thereby correct, the electron density contributions of all the capping groups added to all of the fragments. This method depends only on the capped-subsystem and auxiliary-fragment electron densities, forgoing, as with the original DFET developed for metallic systems, orbital-based projector approaches that determine a nonlocal action of the embedding potential onto the fragment electrons. By using an auxiliary fragment, the method maintains a purely electron-density-dependent embedding potential, substantially lessening the cost and leading to simpler implementation. In this work, we demonstrate the utility of our capped-DFET and ensuing capped embedded CW method in two contrasting systems, namely, an organic molecule and an ionic metal oxide cluster.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Poincaré complex diagonals and the Bass trace conjecture

For a finitely dominated Poincaré duality space M, we show how the first author's total obstruction μ M to the existence of a Poincaré embedding of the diagonal map M→M×M relates to the Reidemeister trace of the identity map of M. We then apply this relationship to show that μ M vanishes when suitable conditions on the fundamental group of M are satisfied.

97 MATHEMATICS AND COMPUTING↗