Search NASA⌕ Search

SEARCH · Search NASA

Results for “SEQUENTIAL MACHINE”

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 73 records · Page 4
All sourcesNASA NTRSDOE OSTI
NASA NTRS1991

Sequence-invariant state machines

A synthesis method and an MOS VLSI architecture are presented to realize sequential circuits that have the ability to implement any state machine having N states and m inputs, regardless of the actual sequence specified in the flow table. The design method utilizes binary tree structured (BTS) logic to implement regular and dense circuits. The desired state sequence can be hardwired with power supply connections or can be dynamically reallocated if stored in a register. This allows programmable VLSI controllers to be designed with a compact size and performance approaching that of dedicated logic. Results of ICV implementations are reported and an example sequence-invariant state machine is contrasted with implementations based on traditional methods.

Whitaker, Sterling R.↗
NASA NTRS1994

A Navier-Strokes Chimera Code on the Connection Machine CM-5: Design and Performance

We have implemented a three-dimensional compressible Navier-Stokes code on the Connection Machine CM-5. The code is set up for implicit time-stepping on single or multiple structured grids. For multiple grids and geometrically complex problems, we follow the 'chimera' approach, where flow data on one zone is interpolated onto another in the region of overlap. We will describe our design philosophy and give some timing results for the current code. A parallel machine like the CM-5 is well-suited for finite-difference methods on structured grids. The regular pattern of connections of a structured mesh maps well onto the architecture of the machine. So the first design choice, finite differences on a structured mesh, is natural. We use centered differences in space, with added artificial dissipation terms. When numerically solving the Navier-Stokes equations, there are liable to be some mesh cells near a solid body that are small in at least one direction. This mesh cell geometry can impose a very severe CFL (Courant-Friedrichs-Lewy) condition on the time step for explicit time-stepping methods. Thus, though explicit time-stepping is well-suited to the architecture of the machine, we have adopted implicit time-stepping. We have further taken the approximate factorization approach. This creates the need to solve large banded linear systems and creates the first possible barrier to an efficient algorithm. To overcome this first possible barrier we have considered two options. The first is just to solve the banded linear systems with data spread over the whole machine, using whatever fast method is available. This option is adequate for solving scalar tridiagonal systems, but for scalar pentadiagonal or block tridiagonal systems it is somewhat slower than desired. The second option is to 'transpose' the flow and geometry variables as part of the time-stepping process: Start with x-lines of data in-processor. Form explicit terms in x, then transpose so y-lines of data are in-processor. Form explicit terms in y, then transpose so z-lines are in processor. Form explicit terms in z, then solve linear systems in the z-direction. Transpose to the y-direction, then solve linear systems in the y-direction. Finally transpose to the x direction and solve linear systems in the x-direction. This strategy avoids inter-processor communication when differencing and solving linear systems, but requires a large amount of communication when doing the transposes. The transpose method is more efficient than the non-transpose strategy when dealing with scalar pentadiagonal or block tridiagonal systems. For handling geometrically complex problems the chimera strategy was adopted. For multiple zone cases we compute on each zone sequentially (using the whole parallel machine), then send the chimera interpolation data to a distributed data structure (array) laid out over the whole machine. This information transfer implies an irregular communication pattern, and is the second possible barrier to an efficient algorithm. We have implemented these ideas on the CM-5 using CMF (Connection Machine Fortran), a data parallel language which combines elements of Fortran 90 and certain extensions, and which bears a strong similarity to High Performance Fortran. We make use of the Connection Machine Scientific Software Library (CMSSL) for the linear solver and array transpose operations.

Jespersen, Dennis C.↗
NASA NTRS1981

Relative performance of algorithms for autonomous satellite orbit determination

Limited word size in contemporary microprocessors causes numerical problems in autonomous satellite navigation applications. Numerical error introduced in navigation computations performed on small wordlength machines can cause divergence of sequential estimation algorithms. To insure filter reliability, square root algorithms have been adopted in many applications. The optimal navigation algorithm requires a careful match of the estimation algorithm, dynamic model, and numerical integrator. In this investigation, the relationship of several square root filters and numerical integration methods is evaluated to determine their relative performance for satellite navigation applications. The numerical simulations are conducted using the Phase I GPS constellation to determine the orbit of a LANDSAT-D type satellite. The primary comparison is based on computation time and relative estimation accuracy.

Tapley, B. D.↗
DOE OSTI2024

Positioning Accuracy in a Concurrent Robot-CNC Hybrid Manufacturing System

Abstract Additive manufacturing (AM) has gained notoriety for offering advantages over traditional manufacturing methods, such as increased design complexity and flexibility. However, it has not found widespread use beyond rapid prototyping. One hindrance to the acceptance of AM processes in industry is the time and cost of fabrication per component. While metal AM by itself can be inexpensive, extra manufacturing steps in the form of subtractive manufacturing (SM) may need to be performed to reach final part tolerances, leading to hybrid additive-subtractive manufacturing (HASM) of a part, which increases time and cost. A potential area to reduce cost is through increasing the efficiency of the HASM process by conducting additive and subtractive manufacturing simultaneously. Usually, HASM is performed in a process where AM is completed in one machine or cell and transferred to another machine or cell for SM in a sequential assembly line process. This efficiency decreases part cost, but high aspect ratio parts or parts with internal geometry that require interleaved additive deposition and machining cannot be produced. One unexplored solution to simultaneous HASM that allows for interleaved operations is to operate the deposition head and machining spindle concurrently within the same machine envelope, known as concurrent HASM (CHASM). In this type of process, both AM and SM occur simultaneously on a batch of small parts or a single large part, maintaining a high efficiency without sacrificing the full range of complex geometries that AM allows for. A potential approach to the single-machine method could be to combine a robot and mill within the same envelope. A challenge to this approach, however, is control of both systems. Most machine controllers have limited external communication or, if a robot has been integrated, only offer movement of either the robot or mill at any given time. As a result, systems must pause either the AM or SM process to switch between them rather than working simultaneously. The present work investigates the positional accuracy of such a CHASM system comprised of a robotic arm and a 3-axis mill. Open-loop tests with limited communication between machines are performed on the system to verify positional error during concurrent robot-mill movements. Under certain conditions, it is demonstrated that position error can stay within 2 mm for the duration of a single layer; however, these tests show that, generally, the open-loop positioning performance of the system is inadequate for CHASM without part-specific hand-tuning of parameters. Based on these results, a set of requirements for successful robot-CNC CHASM is proposed for future integrations.

Goodwin, Jesse↗
NASA NTRS1986

Multigrid methods in structural mechanics

Although the application of multigrid methods to the equations of elasticity has been suggested, few such applications have been reported in the literature. In the present work, multigrid techniques are applied to the finite element analysis of a simply supported Bernoulli-Euler beam, and various aspects of the multigrid algorithm are studied and explained in detail. In this study, six grid levels were used to model half the beam. With linear prolongation and sequential ordering, the multigrid algorithm yielded results which were of machine accuracy with work equivalent to 200 standard Gauss-Seidel iterations on the fine grid. Also with linear prolongation and sequential ordering, the V(1,n) cycle with n greater than 2 yielded better convergence rates than the V(n,1) cycle. The restriction and prolongation operators were derived based on energy principles. Conserving energy during the inter-grid transfers required that the prolongation operator be the transpose of the restriction operator, and led to improved convergence rates. With energy-conserving prolongation and sequential ordering, the multigrid algorithm yielded results of machine accuracy with a work equivalent to 45 Gauss-Seidel iterations on the fine grid. The red-black ordering of relaxations yielded solutions of machine accuracy in a single V(1,1) cycle, which required work equivalent to about 4 iterations on the finest grid level.

Raju, I. S.↗
DOE OSTI2026

Particle Filter Based Inference Testing

The primary intent of PAR-FIT (Particle Filter based Inference Testing) is to provide hard inductive evidence that a machine learning model is capable and proven for an individual test input. By examining training data used to form the underlying model functional correlation, an estimate of the reliability that a model will make the correct prediction can be made. The Sequential Probability Ratio Test is used to derive a qualitative evaluation for reliability based on hypothesis testing. The PAR-FIT framework achieves this by implementing a particle filter and the sequential probability ratio test algorithms on the machine learning model training data to determine relevancy of new individual test samples to the training dataset. The kernel function evaluates the local proximity and density of training data used to derive a prediction outcome. Particles are used to probabilistically determine which training data to evaluate for proximity. For test samples that are within a close proximity to and surrounded by multiple training data points, the evaluated reliability of the prediction is high. For test samples that are anomalies not represented by the training dataset, in low density data clusters, or are far from existing data points, the evaluated reliability is low as insufficient training evidence exists to suggest the model is capable of making the correct prediction. Sequential Probability Ratio Test is further used to determine when a hypothesis on whether a signal can be rejected or accepted for use. The ratio test collects sequence information from the particle filter to test whether the signal is anomalous or normal via hypothesis testing of the underlying distributions.

Chen, Edward [Idaho National Laboratory (INL), Ida↗
NASA NTRS1990

Automated synthesis of sequence invariant state machines

A computer aided design (CAD) tool for the design of very large scale integration (VLSI) synchronous sequential controllers is presented. Both the design and layout of the state machine are automatically generated. The program is process independent allowing a choice of design rules to base generation upon. An incremental layout creation approach was implemented which makes the tool useful in a wide range of layout applications. Flow table descriptions are input to characterize the desired machine and a layout archive is output.

Buehler, D.↗
DOE OSTI2026

Extending Component Lifetime And Improving Inverter Reliability (ECLAIIR)

Inverter reliability remains one of the most persistent challenges limiting the performance, availability, and economic viability of utility‑scale photovoltaic (PV) plants. Industry data consistently show that inverters account for the highest share of corrective maintenance events and unplanned outages across PV fleets. These failures result in energy losses, increased O&M costs, and reduced confidence in long‑term solar asset performance. Motivated by these challenges, this project—Extending Component Lifetime and Improving Inverter Reliability (ECLAIIR)—was undertaken to systematically investigate inverter degradation and failure mechanisms, develop predictive maintenance capabilities, and establish data‑driven pathways to improve service life and reduce the Levelized Cost of Energy (LCOE) for large‑scale PV systems. The primary goal of the project was to identify pre‑failure signatures in string inverters using both lab‑based accelerated lifetime testing and field‑based data and to develop predictive maintenance algorithms that can anticipate inverter faults before they occur. Through collaboration with inverter testing laboratory, solar PV plant owner, and failure‑analysis experts, the project advanced the technical understanding of inverter reliability. By instrumenting inverters with thermistors, humidity sensors, power‑quality meters, and acoustic sensors, the research established how multiple sensing modalities can reliably detect deviations from normal behavior hours to days before failure. These findings substantially enhance scientific understanding of inverter failure kinetics and provide the PV industry with the most comprehensive cross‑OEM characterization of early‑stage failure indicators reported to date. Technically, the project demonstrated the effectiveness of predictive maintenance by developing and validating the PreDICT (Predictive Diagnostics of PV Inverters Using Condition Monitoring and Trend Analysis) framework—a multi‑layer diagnostic architecture combining peer‑to‑peer analytics, historical trend modeling, and advanced machine‑learning techniques such as the Sequential Conditional Variational Autoencoder (SCVAE). This predictive model achieved more than 90% accuracy in detecting pre‑failure conditions and provided up to four days of lead time before inverter failure in field scenarios. Economically, the project’s LCOE analysis showed that predictive maintenance can reduce lifetime energy losses and minimize corrective maintenance interventions. Modeling indicated that, depending on inverter failure rates and replacement timelines, predictive maintenance can significantly reduce LCOE impacts associated with inverter downtime: from as high as 19.4% under conventional maintenance strategies to 0.1%–10.17% when predictive analytics are adopted. These results confirm that predictive maintenance is both technically feasible and economically advantageous for utilities and plant operators. The project’s findings also have broad public benefit. By improving inverter reliability and reducing downtime, predictive maintenance directly increases electricity generation from existing PV assets. Enhanced reliability lowers operational costs for utilities, which can translate over time into lower energy costs for consumers. Furthermore, the project’s technical publications, conference presentations, and industry workshops ensure that knowledge gained is shared broadly across the solar industry, supporting workforce development and enabling utilities of all sizes to adopt modern asset‑health monitoring practices. The retrofitting case study and service‑life prediction framework further support informed decision‑making for aging PV fleets, helping operators extend system life and reduce electronic waste. In summary, the ECLAIIR project significantly advanced the state of knowledge on inverter degradation, demonstrated the technical and economic value of predictive maintenance, and delivered actionable tools and insights that support more reliable, cost‑effective, and sustainable PV plant operation. The outcomes of this project will continue to inform utility practices, guide inverter design improvements, and strengthen the long‑term performance of solar assets nationwide.

14 SOLAR ENERGY↗
DOE OSTI2022

Framework for Optimization, Quantification of Uncertainty and Surrogates – Updated Capabilities

This poster presents updated capabilities within the FOQUS Toolset, covering core features as well as project-based applications. Specifically, the poster highlights advancements in FOQUS integration with cloud-based clients, plugin support for machine learning tools and external simulations, sequential design of experiments, and advanced support for dynamic process models. The applications demonstrate the breadth of FOQUS predictive capabilities for chemical, energy and economic system analysis.

Paul, Brandon↗
DOE OSTI2025

Entanglement engineering of optomechanical systems by reinforcement learning

Entanglement is fundamental to quantum information science and technology, yet controlling and manipulating entanglement—so-called entanglement engineering—for arbitrary quantum systems remains a formidable challenge. There are two difficulties: the fragility of quantum entanglement and its experimental characterization. We develop a model-free deep reinforcement-learning (RL) approach to entanglement engineering, in which feedback control together with weak continuous measurement and partial state observation is exploited to generate and maintain desired entanglement. We employ quantum optomechanical systems with linear or nonlinear photon–phonon interactions to demonstrate the workings of our machine-learning-based entanglement engineering protocol. In particular, the RL agent sequentially interacts with one or multiple parallel quantum optomechanical environments, collects trajectories, and updates the policy to maximize the accumulated reward to create and stabilize quantum entanglement over an arbitrary amount of time. The machine-learning-based model-free control principle is applicable to the entanglement engineering of experimental quantum systems in general.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Non-autoregressive time-series methods for stable parametric reduced-order models

Advection-dominated dynamical systems, characterized by partial differential equations, are found in applications ranging from weather forecasting to engineering design where accuracy and robustness are crucial. There has been significant interest in the use of techniques borrowed from machine learning to reduce the computational expense and/or improve the accuracy of predictions for these systems. These rely on the identification of a basis that reduces the dimensionality of the problem and the subsequent use of time series and sequential learning methods to forecast the evolution of the reduced state. Often, however, machine-learned predictions after reduced-basis projection are plagued by issues of stability stemming from incomplete capture of multiscale processes as well as due to error growth for long forecast durations. To address these issues, we have developed a non-autoregressive time series approach for predicting linear reduced-basis time histories of forward models. In particular, we demonstrate that non-autoregressive counterparts of sequential learning methods such as long short-term memory (LSTM) considerably improve the stability of machine-learned reduced-order models. Further, we evaluate our approach on the inviscid shallow water equations and show that a non-autoregressive variant of the standard LSTM approach that is bidirectional in the principal component directions obtains the best accuracy for recreating the nonlinear dynamics of partial observations. Moreover-and critical for many applications of these surrogates-inference times are reduced by three orders of magnitude using our approach, compared with both the equation-based Galerkin projection method and the standard LSTM approach.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Iterative hybrid manufacture of a titanium alloy component

Here, this paper describes an iterative hybrid (additive + subtractive) manufacturing approach for a titanium alloy (Ti6Al4V) part using a laser hotwire directed energy deposition system (LHWDED) and a traditional four-axis milling machine tool. The term iterative hybrid manufacturing is used to described hybrid manufacturing where the additive and subtractive operations occur in multiple stages rather than sequentially. It is currently common to produce an entire part by sequential hybrid manufacturing by additively manufacturing (AM) an entire preform geometry that then requires post processing by another machine tool to create final part features. By contrast, a part produced by iterative hybrid manufacturing (IHM) does not produce the entire preform geometry in a single AM process. Instead, a portion of the entire preform geometry is manufactured by an AM process, then that portion is transferred to another machine tool which creates features in that portion, and then that machined portion is transferred back to the AM machine to complete another AM process. There is no limit to the number of iterations that an IHM process can have. IHM offers several advantages over sequential hybrid manufacturing such as the use of shorter and stiffer subtractive tooling, better access to part geometries that require subtractive processes, and the separation of the AM heat source from the subtractive machine tool. A titanium alloy demonstration part was successfully manufactured by IHM with three iterations using a shared pallet system between the AM machine tool and the subtractive machine tool.

Hybrid manufacturing↗
NASA NTRS1981

Image registration system in the Landsat-D production environment

It is the purpose of the considered system to take pieces of imagery, called control point chips (CPC), whose geodetic location has been previously determined and stored, and locate their position in later imagery of the same area. The registration processes are carried out partially on a DEC VAX 780 computer and partially on a Floating Point Systems Array Processor. Typically sets of 20 control points are processed at a time. To process these as sets, and to optimize the use of both machines, operations are grouped into loops instead of a sequential processing for each point. Attention is given to cloud cover assessment, enhancement, correlation techniques, pixel registration, and subpixel registration.

Kiss, P.↗
NASA NTRS1995

Transferring ecosystem simulation codes to supercomputers

Many ecosystem simulation computer codes have been developed in the last twenty-five years. This development took place initially on main-frame computers, then mini-computers, and more recently, on micro-computers and workstations. Supercomputing platforms (both parallel and distributed systems) have been largely unused, however, because of the perceived difficulty in accessing and using the machines. Also, significant differences in the system architectures of sequential, scalar computers and parallel and/or vector supercomputers must be considered. We have transferred a grassland simulation model (developed on a VAX) to a Cray Y-MP/C90. We describe porting the model to the Cray and the changes we made to exploit the parallelism in the application and improve code execution. The Cray executed the model 30 times faster than the VAX and 10 times faster than a Unix workstation. We achieved an additional speedup of 30 percent by using the compiler's vectoring and 'in-line' capabilities. The code runs at only about 5 percent of the Cray's peak speed because it ineffectively uses the vector and parallel processing capabilities of the Cray. We expect that by restructuring the code, it could execute an additional six to ten times faster.

Skiles, J. W.↗
NASA NTRSDate not supplied

The Additive Manufacturing Moment Measure - A Parallel Computation Technique for Determining Build Variance in the Laser Powder Bed Fusion Process

Additive manufacturing (AM) has unique process attributes that facilitate the creation of optimized, complex, and unique parts for aerospace applications. However, the multi-scale and complicated building process for AM parts can cause unexpected build conditions that result in microstructural variability within the deposited material. The need for richer datasets and computational modeling capabilities to improve AM process reliability is a consequence of this microstructural variability. A computational approach, referred to as the Additive Manufacturing Moment Measure (AM3), addresses this need by leveraging the way AM processes fuse material in precise, incremental steps. During the layering sequence, each previous step contributes to the condition of the current step at the center of the heat source. The precise steps can be selected to systematically create a time-space point field with co-located machine input and in-situ sensor data. The sequential nature of the AM process, coupled with nearest neighbor calculations, allows for a fully parallel computation for part-scale build profile analysis. The AM3 concept introduced here enables part-scale assessment directly from build files and in-situ process monitoring sensors alike. The AM moment measures were calculated for build point fields and compared with co-located in-situ and ex-situ nondestructive evaluation and optical microscopy observations. These comparisons permit a better understanding of how the sequential process actions can affect the quality of a laser powder bed fusion (LPBF) build. Details of the AM3technique will be discussed and compared to measured LPBF part characteristics. The AM3 results indicate a strong potential to advance the qualification process for aerospace applications.

Additive Manufacturing↗