Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Guaranteed performance”

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 145 records · Page 8
All sourcesNASA NTRSDOE OSTI
NASA NTRS2014

Output Feedback M-MRAC Backstepping With Aerospace Applications

The paper presents a certainty equivalence output feedback backstepping adaptive control design method for the systems of any relative degree with unmatched uncertainties without over-parametrization. It uses a fast prediction model to estimate the unknown parameters, which is independent of the control design. It is shown that the system's input and output tracking errors can be systematically decreased by the proper choice of the design parameters. The approach is applied to aerospace control problems and tested in numerical simulations.

Output feedback adaptive control↗
NASA NTRS2015

M-MRAC for SPHERES

This paper presents application of the modified reference model MRAC (M-MRAC) method to control the relative position and orientation of a cluster of satellites known collectively as the Synchronized Position Hold, Engage, Reorient Experimental Satellites (SPHERES). The approach uses fast estimation algorithms to achieve guaranteed tracking of reference commands for both input and output signals in the presence of uncertainties in mass and inertia data and external disturbances. The tracking errors can be systematically decreased by the proper selection of the design parameters in the identification model. The generated control signals have acceptable magnitudes and exhibit no oscillations. The benefits of the method are demonstrated in numerical simulations.

Relative motion↗
DOE OSTI2020

M&V in ESPC: The U.S. Federal Experience and Implications for Developing ESPC Markets

The United States Federal Government has been conducting guaranteed savings energy savings performance contracts for over 20 years and now relies on ESPC for the majority of its energy efficiency work. Along with a related financed project type, these deals resulted in $4.2 billion of project investment in the five years ending in 2016, a pace that has even accelerated since. Measurement and verification (M&V) on the projects is the key to assuring savings realization and persistence. Perceived as a weakness or burdensome added cost in the early years of the program, M&V has become a strength. All energy conservation measures (ECMs) have some form of measurement – defined as a measured baseline establishment followed by at least one measurement of the main energy-saving parameter taken in the performance period for each ECM. The government’s in-house energy consulting office, the Federal Energy Management Program (FEMP), now recommends measurement of these “Option A” M&V ECMs throughout the contract term, usually annually. Moreover, a significantly higher percentage of projects are now characterized by more ambitious M&V, including Option B (all parameter measurement) for most generation (including renewable) and some efficiency measures, and more frequent Option C (whole facility utility bill analysis) for “deep retrofit” projects with multiple, interactive ECMs. Coincident with this progress in M&V has been a much greater embracing of ESPC by the federal agencies, resulting in the enormous rate of projects now executed. This paper traces the evolution of M&V in federal ESPC and argues that the heightened credibility of the savings has contributed significantly to the procurement vehicle’s long-term viability. This focus on savings integrity via M&V has been learned over two decades for U.S. federal ESPC, but countries with developing ESPC markets would be wise to emphasize it as their markets emerge, allowing them to avoid some of the “growing pains” experienced in the U.S.

Coleman, Philip↗
DOE OSTI2024

Geometry-aware training of factorized layers in tensor Tucker format

Reducing parameter redundancies in neural network architectures is crucial for achieving feasible computational and memory requirements during train and inference of large networks. Given its easy implementation and flexibility, one promising approach is layer factorization, which reshapes weight tensors into a matrix format and parameterizes it as the product of two rank-r matrices. However, this family of approaches often requires an initial full-model warm-up phase, prior knowledge of a feasible rank, and it is sensitive to parameter initialization.In this work, we introduce a novel approach to train the factors of a Tucker decomposition of the weight tensors. Our training proposal proves to be optimal in locally approximating the original unfactorized dynamics and stable for the initialization. Furthermore, the rank of each mode is dynamically updated during training.We provide a theoretical analysis of the algorithm, showing convergence, approximation and local descent guarantees. The method's performance is further illustrated through a variety of experiments, showing remarkable training compression rates and comparable or even better performance than the full baseline and alternative layer factorization strategies.

Zangrando, Emanuele [Gran Sasso Science Institute ↗
NASA NTRS1994

Software reliability studies

There are many software reliability models which try to predict future performance of software based on data generated by the debugging process. Our research has shown that by improving the quality of the data one can greatly improve the predictions. We are working on methodologies which control some of the randomness inherent in the standard data generation processes in order to improve the accuracy of predictions. Our contribution is twofold in that we describe an experimental methodology using a data structure called the debugging graph and apply this methodology to assess the robustness of existing models. The debugging graph is used to analyze the effects of various fault recovery orders on the predictive accuracy of several well-known software reliability algorithms. We found that, along a particular debugging path in the graph, the predictive performance of different models can vary greatly. Similarly, just because a model 'fits' a given path's data well does not guarantee that the model would perform well on a different path. Further we observed bug interactions and noted their potential effects on the predictive process. We saw that not only do different faults fail at different rates, but that those rates can be affected by the particular debugging stage at which the rates are evaluated. Based on our experiment, we conjecture that the accuracy of a reliability prediction is affected by the fault recovery order as well as by fault interaction.

Hoppa, Mary Ann↗
DOE OSTI2021

Exploratory analysis and performance prediction of big data transfer in High-performance Networks

Big data transfer in large-scale scientific and business applications is increasingly carried out over connections with guaranteed bandwidth provisioned in High-performance Networks (HPNs) via advance bandwidth reservation. Provisioning agents need to carefully schedule data transfer requests, compute network paths, and allocate appropriate bandwidths. Such reserved bandwidths, if not fully utilized, could be simply wasted due to the exclusive access during the approved time window, and cause extra overhead and complexity for resource management. This calls for accurate performance prediction to reserve bandwidths that match actual needs and avoid over-provisioning. We employ machine learning algorithms to predict big data transfer performance based on extensive performance measurements collected in the past several years from data transfer tests using different protocols and toolkits between various end sites on several real-life physical or emulated testbeds. We first analyze the performance patterns in response to a comprehensive list of parameters in end-host systems, network connections, and data transfer applications, which motivate the use of machine learning and also help us identify the effects of latent factors. We then propose threshold- and clustering-based methods to eliminate negative effects of latent factors in data preprocessing and build a robust performance predictor based on customized domain-oriented loss functions. The performance of the proposed methods is verified by extensive experiments using SVR and RFR as well as theoretical analysis of the general performance bound.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Resilient Observer Design for Cyber-Physical Systems with Data-Driven Measurement Pruning

Resilient observer design for Cyber-Physical Systems (CPS) in the presence of adversarial false data injection attacks (FDIA) is an active area of research. The existing state-of-the-art algorithms tend to break down as more and more knowledge of the system is built into the attack model; also as the percentage of attacked nodes increases. From the view of optimization theory, the problem is often cast as a classical error correction problem for which a theoretical limit of has been established as the maximum percentage attacked nodes for which state recovery is guaranteed. Beyond this limit, the performance of -minimization based schemes, for instance, deteriorates rapidly. Similar performance degradation occurs for other types of resilient observers beyond certain percentages of attacked nodes. In order to increase the corresponding percentage of attacked nodes for which state recoveries can be guaranteed, researchers have begun to incorporate prior information into the underlying resilient observer design framework. For the most pragmatic cases, this prior information is often obtained through a data-driven machine learning process. Existing results have shown a strong positive correlation between the maximum attacked percentages that can be tolerated and the accuracy of the data-driven model. Motivated by these results, this chapter examines the case for pruning algorithms designed to improve the Positive Prediction Value (PPV) of the resulting prior information, given stochastic uncertainty characteristics of the underlying machine learning model. Theoretical quantification of the achievable improvement is given. Simulation results show that the pruning algorithm significantly increases the maximum correctable percentage of attacked nodes, even for machine learning model whose prediction power is comparable to the random flip of a coin.

Resilient Observer, Cyber-physical Systems, Data-D↗
DOE OSTI2020

Performance Prediction of Big Data Transfer Through Experimental Analysis and Machine Learning

Big data transfer in next-generation scientific applications is now commonly carried out over connections with guaranteed bandwidth provisioned in High-performance Networks (HPNs) through advance bandwidth reservation. To use HPN resources efficiently, provisioning agents need to carefully schedule data transfer requests and allocate appropriate bandwidths. Such reserved bandwidths, if not fully utilized by the requesting user, could be simply wasted or cause extra overhead and complexity in management due to exclusive access. This calls for the capability of performance prediction to reserve bandwidth resources that match actual needs. Towards this goal, we employ machine learning algorithms to predict big data transfer performance based on extensive performance measurements, which are collected over a span of several years from a large number of data transfer tests using different protocols and toolkits between various end sites on several real-life physical or emulated HPN testbeds. We first identify a comprehensive list of attributes involved in a typical big data transfer process, including end host system configurations, network connection properties, and control parameters of data transfer methods. We then conduct an in-depth exploratory analysis of their impacts on application-level throughput, which provides insights into big data transfer performance and motivates the use of machine learning. We also investigate the applicability of machine learning algorithms and derive their general performance bounds for performance prediction of big data transfer in HPNs. Experimental results show that, with appropriate data preprocessing, the proposed machine learning-based approach achieves 95% or higher prediction accuracy in up to 90% of the cases with very noisy real-life performance measurements.

Yun, Daqing↗
DOE OSTI2020

Performance Prediction of Big Data Transfer Through Experimental Analysis and Machine Learning

Big data transfer in next-generation scientific ap- plications is now commonly carried out over connections with guaranteed bandwidth provisioned in High-performance Net- works (HPNs) through advance bandwidth reservation. To use HPN resources efficiently, provisioning agents need to carefully schedule data transfer requests and allocate appropriate band- widths. Such reserved bandwidths, if not fully utilized by the requesting user, could be simply wasted or cause extra overhead and complexity in management due to exclusive access. This calls for the capability of performance prediction to reserve bandwidth resources that match actual needs. Towards this goal, we employ machine learning algorithms to predict big data transfer perfor- mance based on extensive performance measurements, which are collected over a span of several years from a large number of data transfer tests using different protocols and toolkits between various end sites on several real-life physical or emulated HPN testbeds. We first identify a comprehensive list of attributes involved in a typical big data transfer process, including end host system configurations, network connection properties, and control parameters of data transfer methods. We then conduct an in-depth exploratory analysis of their impacts on application- level throughput, which provides insights into big data transfer performance and motivates the use of machine learning. We also investigate the applicability of machine learning algorithms and derive their general performance bounds for performance prediction of big data transfer in HPNs. Experimental results show that, with appropriate data preprocessing, the proposed machine learning-based approach achieves 95% or higher pre- diction accuracy in up to 90% of the cases with very noisy real-life performance measurements.

Yun, Daqing↗
DOE OSTI2024

Developing a new ethylene glycol/H 2 O pretreatment system to achieve efficient enzymatic hydrolysis of sugarcane bagasse cellulose and recover highly active lignin: Countercurrent extraction

Improving pretreatment efficiency is a critical premise in achieving efficient biomass conversion, and obtaining high-performance natural polymers is the guarantee of high-value conversion of biomass. Here, in this study, a new pilot-scale continuous countercurrent pretreatment reaction unit about ethylene glycol-alkali solution was designed for pretreating sugarcane bagasse in order to achieve efficient separation of the three major components of lignocellulose when expanding the scale of pretreatment, reduce lignin deposition on the fiber surface, and obtain highly active lignin and excellent enzymatic hydrolysis efficiency of cellulose. X-ray diffractometer (XRD), X-ray photoelectron spectrometer (XPS), brunauer-emmett-teller (BET) and scanning electron microscope (SEM) methods are used to analyze the structural properties of sugarcane bagasse before and after pretreatment, and high-performance liquid chromatography (HPLC) is used to analyze the monosaccharide components in the enzymatic solution. In addition, the structural properties of the recovered lignin are analyzed by gel permeation chromatography (GPC), 31 P NMR and 2D-HSQC-NMR methods. The results indicate that the system can gain a high cellulose recovery of 92.99% along with a lignin removal of 95.33%, and recovered lignin has low lignin carbohydrate complexes, low condensation, and rich in phenolic hydroxyl groups for 1.95 mmol/g. Meanwhile, the countercurrent pretreatment system can effectively reduce the deposition of lignin on the cellulose surface, which is evidently superior to the non-countercurrent pretreatment and facilitates the efficiency of enzymatic saccharification of substrate, achieving a high glucose yield of 99% as well as a total sugar yield of 91.11%. The method efficiently separates biomass in a green manner, and solid residues are easily hydrolyzed, showing potential for industrial-scale production.

09 BIOMASS FUELS↗
DOE OSTI2025

Assessing methods in fusion and fitting for time series construction in remote sensing-based earth observations

This study evaluates the comparative performance of spatiotemporal fusion and time-series fitting methods for constructing high-spatiotemporal-resolution remote sensing time-series data. Due to in-class similarity of fusion methods and fitting methods, we employ the Fit-FC (Fitting, spatial Filtering, and residual Compensation) model as a representative fusion method and the linear harmonic fitting model as a representative fitting method. Both Fit-FC and the linear harmonic fitting are widely used for high-spatiotemporal-resolution time-series data construction, and we modify the original Fit-FC model to enable automatic time-series fusion. To ensure data representativeness, we use 3 years (2019–2021) of Harmonized Landsat and Sentinel-2 surface reflectance datasets and Terra MCD43A4 products. Eight experimental regions are selected worldwide to guarantee generalization of the comparative performance between fusion and fitting methods, covering diverse land-use types (cropland, developed land, forest, and grassland) and varying climatological conditions. Time-series of NDVI and surface reflectance are analyzed under both actual observations and simulated data-missing scenarios. The constructed time-series data reveals that (1) the modified Fit-FC and linear harmonic fitting model achieve excellent performance in constructing high-resolution time-series images; (2) the fusion method outperforms the fitting method in constructing time-series of NDVI and surface reflectance images in cropland-, forest-, and grassland-dominated regions; (3) both methods achieve comparable performance in developed-dominated regions; (4) the fusion method is more robust to missing data, and better captures abrupt phenological transitions under conditions of continuous missing data; (5) the fitting method is computationally more efficient, making it suitable for large-scale time-series image reconstruction. This study provides valuable insights for selecting optimal strategies to generate high-resolution time-series images across diverse application scenarios and lays a foundation for extensions to other vegetation indices or land surface variables.

54 ENVIRONMENTAL SCIENCES↗
NASA NTRS1995

A microeconomic scheduler for parallel computers

We describe a scheduler based on the microeconomic paradigm for scheduling on-line a set of parallel jobs in a multiprocessor system. In addition to the classical objectives of increasing the system throughput and reducing the response time, we consider fairness in allocating system resources among the users, and providing the user with control over the relative performances of his jobs. We associate with every user a savings account in which he receives money at a constant rate. When a user wants to run a job, he creates an expense account for that job to which he transfers money from his savings account. The job uses the funds in its expense account to obtain the system resources it needs for execution. The share of the system resources allocated to the user is directly related to the rate at which the user receives money; the rate at which the user transfers money into a job expense account controls the job's performance. We prove that starvation is not possible in our model. Simulation results show that our scheduler improves both system and user performances in comparison with two different variable partitioning policies. It is also shown to be effective in guaranteeing fairness and providing control over the performance of jobs.

Stoica, Ion↗
NASA NTRS1975

On a numerical sufficiency test for monotonic convergence of finite element models

Finite element analyses characterized by monotonic convergence include the discipline for meaningful measurements of convergence rate and consequently economical extrapolation. Few proposers of element models guarantee monotonic convergence for their elements. Thus, a need exists for an automatic test to classify available element models. This paper describes such a test - a test can be performed using a digital computer to guarantee that a particular element model imbues monotonicity. It describes the test and its basis. It examines seven element models for a rectangular membrane to illustrate the value of the tests. Besides confirming results already known, the application yields new data. It 'proves' monotonicity for two improved models, defines the range of element proportions for which another element can be guaranteed to exhibit monotonicity, and suggests that another element is deficient. In the special case of absolutely convergent membrane displacement models, proof of monotonicity is a necessary and sufficient condition to insure that upper bound estimates of strain energy are developed. Accordingly, the test furnishes a proof of bound solutions independently of requirements on displacement continuity the element basis may or may not satisfy.

Melosh, R. J.↗
NASA NTRS1986

A Priority Protocol for Token-Ring Networks

New priority protocol controls access to token-ring local-area network (LAN) of digital-communication stations over widely ranging mix of low- and high-priority traffic. Protocol, called round-robin priority scheme (RRPS), introduces only small overhead and therefore degrades system performance only minimally. Key messages guaranteed access to local-area network during peak loads.

Liu, H. T.↗
NASA NTRS1987

Survey on large scale system control methods

The problem inherent to large scale systems such as power network, communication network and economic or ecological systems were studied. The increase in size and flexibility of future spacecraft has put those dynamical systems into the category of large scale systems, and tools specific to the class of large systems are being sought to design control systems that can guarantee more stability and better performance. Among several survey papers, reference was found to a thorough investigation on decentralized control methods. Especially helpful was the classification made of the different existing approaches to deal with large scale systems. A very similar classification is used, even though the papers surveyed are somehow different from the ones reviewed in other papers. Special attention is brought to the applicability of the existing methods to controlling large mechanical systems like large space structures. Some recent developments are added to this survey.

Mercadal, Mathieu↗
NASA NTRS1991

Control of a varying thrust spacecraft for autonomous space rendezvous

Before the use of autonomous rendezvous will be allowed as a substitute for man-in-the-loop control, adequate safety and mission performance will have to be guaranteed. Most autopilots for autonomous rendezvous of spacecraft assume constant thrust reaction control system (RCS) thrusters. This assumption implies either true constant thrust RCS thrusters or thrusters whose thrust levels vary very slowly. The ongoing work described in this presentation examines the autonomous rendezvous problem when varying thrust RCS thrusters are inherent in the system equations of motion.

Dawson, Travis E., Jr.↗
NASA NTRS2008

Decentralized Control of Sound Radiation using a High-Authority/Low-Authority Control Strategy with Anisotropic Actuators

This paper describes a combined control strategy designed to reduce sound radiation from stiffened aircraft-style panels. The control architecture uses robust active damping in addition to high-authority linear quadratic Gaussian (LQG) control. Active damping is achieved using direct velocity feedback with triangularly shaped anisotropic actuators and point velocity sensors. While active damping is simple and robust, stability is guaranteed at the expense of performance. Therefore the approach is often referred to as low-authority control. In contrast, LQG control strategies can achieve substantial reductions in sound radiation. Unfortunately, the unmodeled interaction between neighboring control units can destabilize decentralized control systems. Numerical simulations show that combining active damping and decentralized LQG control can be beneficial. In particular, augmenting the in-bandwidth damping supplements the performance of the LQG control strategy and reduces the destabilizing interaction between neighboring control units.

Schiller, Noah H.↗
NASA NTRS1996

Design of Robust Adaptive Unbalance Response Controllers for Rotors with Magnetic Bearings

Experimental results have recently demonstrated that an adaptive open loop control strategy can be highly effective in the suppression of unbalance induced vibration on rotors supported in active magnetic bearings. This algorithm, however, relies upon a predetermined gain matrix. Typically, this matrix is determined by an optimal control formulation resulting in the choice of the pseudo-inverse of the nominal influence coefficient matrix as the gain matrix. This solution may result in problems with stability and performance robustness since the estimated influence coefficient matrix is not equal to the actual influence coefficient matrix. Recently, analysis tools have been developed to examine the robustness of this control algorithm with respect to structured uncertainty. Herein, these tools are extended to produce a design procedure for determining the adaptive law's gain matrix. The resulting control algorithm has a guaranteed convergence rate and steady state performance in spite of the uncertainty in the rotor system. Several examples are presented which demonstrate the effectiveness of this approach and its advantages over the standard optimal control formulation.

Knospe, Carl R.↗