Search NASA⌕ Search

SEARCH · Search NASA

Results for “Robustness analysis”

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 1,369 records · Page 76

Closed Loop Guidance Trade Study for Space Launch System Block-1B Vehicle

NASA is currently building the Space Launch System (SLS) Block-1 launch vehicle for the Exploration Mission 1 (EM-1) test flight. The design of the next evolution of SLS, Block-1B, is well underway. The Block-1B vehicle is more capable overall than Block-1; however, the relatively low thrust-to-weight ratio of the Exploration Upper Stage (EUS) presents a challenge to the Powered Explicit Guidance (PEG) algorithm used by Block-1. To handle the long burn durations (on the order of 1000 seconds) of EUS missions, two algorithms were examined. An alternative algorithm, OPGUID, was introduced, while modifications were made to PEG. A trade study was conducted to select the guidance algorithm for future SLS vehicles. The chosen algorithm needs to support a wide variety of mission operations: ascent burns to LEO, apogee raise burns, trans-lunar injection burns, hyperbolic Earth departure burns, and contingency disposal burns using the Reaction Control System (RCS). Additionally, the algorithm must be able to respond to a single engine failure scenario. Each algorithm was scored based on pre-selected criteria, including insertion accuracy, algorithmic complexity and robustness, extensibility for potential future missions, and flight heritage. Monte Carlo analysis was used to select the final algorithm. This paper covers the design criteria, approach, and results of this trade study, showing impacts and considerations when adapting launch vehicle guidance algorithms to a broader breadth of in-space operations.

Von der Porten, Paul↗

Real-World Testing of LiDAR-Inertial Based Navigation and Mapping for Precision Landing

The fusion of LiDAR and inertial measurements duringspacecraft descent and landing can be used to estimate alander’s navigation state and map the terrain below. Together,these data products can be used to enable safe and preciselanding on celestial bodies for which a priori orbital reconnaissanceis insufficient for hazard detection and avoidance.Unlike camera images used in visual terrain relative navigation,LiDAR scans are insensitive to changes in illumination; as aresult, the technique can be used to land in poorly lit areas,or at times of day when the lighting conditions are incongruentwith existing orbital imagery. In this paper, we extend previouswork in which we introduced a factor graph based smoothingapproach for LiDAR-inertial navigation and mapping. Whereasthe algorithms were previously tested on simulated data, thispaper presents testing on real-world data. Data from theAutonomous Landing Hazard Avoidance Technology (ALHAT)airplane flight tests in the Yucca Flats and Death Valley in2009 (FT3), the Morpheus vertical take off and landing flighttests at Kennedy Space Center in 2014 (FT6), and the landingof Perseverance and Ingenuity on Mars in 2021 (M2020) wereused to evaluate algorithm performance. In this paper, weextend our LiDAR-inertial technique to work with a variety ofranging technologies: single point laser altimetry (FT3), denseflash LiDAR (FT6), and six-beam radar (M2020). A thoroughperformance analysis for all three datasets is presented. Datasetpreparation, improvements in algorithm robustness, and outlierrejection, which were necessitated by the transition to realworlddata, are discussed.

Trawny, Nikolas↗

Computing contingency statistics in parallel : design trade-offs and limiting cases.

Statistical analysis is typically used to reduce the dimensionality of and infer meaning from data. A key challenge of any statistical analysis package aimed at large-scale, distributed data is to address the orthogonal issues of parallel scalability and numerical stability. Many statistical techniques, e.g., descriptive statistics or principal component analysis, are based on moments and co-moments and, using robust online update formulas, can be computed in an embarrassingly parallel manner, amenable to a map-reduce style implementation. In this paper we focus on contingency tables, through which numerous derived statistics such as joint and marginal probability, point-wise mutual information, information entropy, and X{sup 2} independence statistics can be directly obtained. However, contingency tables can become large as data size increases, requiring a correspondingly large amount of communication between processors. This potential increase in communication prevents optimal parallel speedup and is the main difference with moment-based statistics (which we discussed in [1]) where the amount of inter-processor communication is independent of data size. Here we present the design trade-offs which we made to implement the computation of contingency tables in parallel.We also study the parallel speedup and scalability properties of our open source implementation. In particular, we observe optimal speed-up and scalability when the contingency statistics are used in their appropriate context, namely, when the data input is not quasi-diffuse.

99 GENERAL AND MISCELLANEOUS↗

Computing contingency statistics in parallel : design trade-offs and limiting cases.

Statistical analysis is typically used to reduce the dimensionality of and infer meaning from data. A key challenge of any statistical analysis package aimed at large-scale, distributed data is to address the orthogonal issues of parallel scalability and numerical stability. Many statistical techniques, e.g., descriptive statistics or principal component analysis, are based on moments and co-moments and, using robust online update formulas, can be computed in an embarrassingly parallel manner, amenable to a map-reduce style implementation. In this paper we focus on contingency tables, through which numerous derived statistics such as joint and marginal probability, point-wise mutual information, information entropy, and {chi}{sup 2} independence statistics can be directly obtained. However, contingency tables can become large as data size increases, requiring a correspondingly large amount of communication between processors. This potential increase in communication prevents optimal parallel speedup and is the main difference with moment-based statistics (which we discussed in [1]) where the amount of inter-processor communication is independent of data size. Here we present the design trade-offs which we made to implement the computation of contingency tables in parallel. We also study the parallel speedup and scalability properties of our open source implementation. In particular, we observe optimal speed-up and scalability when the contingency statistics are used in their appropriate context, namely, when the data input is not quasi-diffuse.

99 GENERAL AND MISCELLANEOUS↗

Computing contingency statistics in parallel.

Statistical analysis is typically used to reduce the dimensionality of and infer meaning from data. A key challenge of any statistical analysis package aimed at large-scale, distributed data is to address the orthogonal issues of parallel scalability and numerical stability. Many statistical techniques, e.g., descriptive statistics or principal component analysis, are based on moments and co-moments and, using robust online update formulas, can be computed in an embarrassingly parallel manner, amenable to a map-reduce style implementation. In this paper we focus on contingency tables, through which numerous derived statistics such as joint and marginal probability, point-wise mutual information, information entropy, and {chi}{sup 2} independence statistics can be directly obtained. However, contingency tables can become large as data size increases, requiring a correspondingly large amount of communication between processors. This potential increase in communication prevents optimal parallel speedup and is the main difference with moment-based statistics where the amount of inter-processor communication is independent of data size. Here we present the design trade-offs which we made to implement the computation of contingency tables in parallel.We also study the parallel speedup and scalability properties of our open source implementation. In particular, we observe optimal speed-up and scalability when the contingency statistics are used in their appropriate context, namely, when the data input is not quasi-diffuse.

99 GENERAL AND MISCELLANEOUS↗

Environmental Systems Microbiology of Contaminated Environments

Environmental Systems Microbiology is well positioned to move forward in dynamic complex system analysis probing new questions and developing new insight into the function, robustness and resilience in response to anthropogenic perturbations. Recent studies have demonstrated that natural bacterial communities can be used as quantitative biosensors in both groundwater and deep ocean water, predicting oil concentration from the Gulf of Mexico Deep Water Horizon spill and from groundwater at nuclear production waste sites (16, 17, 25). Since the first demonstration of catabolic gene expression in soil remediation (34) it has been clear that extension beyond organismal abundance to process and function of microbial communities as a whole using the whole suite of omic tools available to the post genomic era. Metatranscriptomics have been highlighted as a prime vehicle for understanding responses to environmental drivers (35) in complex systems and with rapidly developing metabolomics, full functional understanding of complex community biogeochemical cycling is an achievable goal. Perhaps more exciting is the dynamic nature of these systems and their complex adaptive strategies that may lead to new control paradigms and emergence of new states and function in the course of a changing environment.

Sayler, Gary↗

ESBWR - Robust design for natural circulation and stability performance effectiveness

ESBWR is a 4500 MWt Generation III+ natural circulation reactor with an array of robust design features and passive safety systems to deliver highly effective plant performance during normal operation and to keep the reactor safe during postulated transients and accidents. With the submittal of the latest revision of the Design Control Document (DCD) to US Nuclear Regulatory Commission, ESBWR is nearing the completion of the US design certification process. This paper focuses on the natural circulation-driven plant performance aspects during normal operation, and stability evaluation of the robust ESBWR design. The TRACG computer code is used for the analysis of ESBWR plant performance, safety analysis, and stability margins. The paper describes the evaluation of ESBWR stability performance during normal power operation including operation in the Core Power-Feed Water Temperature Operating Domain. For ESBWR the normal power operation condition has the highest power/flow ratio and is limiting from the perspective of stability. The paper includes results from detailed evaluation of the most limiting decay ratio for out-of-phase regional oscillations calculated by perturbing the core inlet flow rate in this out-of-phase mode about the line of symmetry for the azimuthal harmonic mode. The paper also summarizes the ESBWR regional mode stability evaluations during a limiting transient (Loss of Feedwater Heating), and during ATWS (Anticipated Transient without Scram). Nominal decay ratios of limiting Channel oscillation, Core wide oscillation and Regional oscillation are within the maximum acceptance criterion of 0.8, at 95% content and 95% confidence. These stability evaluation results indicate decay ratio is within design limits. The paper also describes the evaluation of ESBWR stability performance during plant startup, and summarizes the defense-in-depth stability solution for ESBWR. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Improving PCM Waste Management Through New Approaches to Screening for LLW Treatment and Disposal - 20145

A major step forward in the management of Plutonium Contaminated Material (PCM) Waste has been taken at the Sellafield site with the introduction of new capabilities to enable wastes previously conservatively designated as PCM Intermediate Level Waste (ILW) to be re-classified for treatment as Low Level Waste (LLW). The Sellafield site, located in the North West of England, within the United Kingdom (UK), has operated plutonium processing plants and waste facilities for almost 70 years. During this time management of the raw PCM waste produced has presented a variety of challenges. The waste is currently processed by high force waste compaction in the Waste Treatment Complex (WTC). The WTC converts 200 litre drums of raw PCM waste into a compacted, grout encapsulated monolith form within stainless steel containment, ready for emplacement within the UK's Geological Disposal Facility (GDF) when it becomes available. To help progress some of the wastes waiting for treatment, recent improvements have been made with the introduction of new waste assay instrumentation which enables the identification of a 'candidate' waste potentially suitable for disposal via the LLW treatment route. Opening a new LLW route for previously designated PCM has been a major advance in PCM waste management policy. It has required a range of technical assessment arrangements to be developed, tested and commissioned and involved the engagement of a wide range of stakeholders. In particular, very detailed technical analysis methods have been developed to ensure that there is a robust and conservative approach to the final sentencing of waste. Following completion of commissioning tests, the first 86 m{sup 3} of previously designated PCM waste was successfully treated through the LLW route and consigned to LLW disposal in June 2019. The direct benefit of sentencing waste to the correct waste route (LLW) is the significant cost savings across the complete range of waste management activities. This work is also strategically important for demonstrating to a range of stakeholders including workforce and regulators, that waste previously designated as PCM can be re-classified in a systematic and justifiable way without increasing risk to personnel or the wider environment. By ensuring that waste is being managed appropriately it will be possible to carry out more remediation work safely, in less time, and at a lower cost. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Cost analysis of laparoscopic lavage compared with sigmoid resection for perforated diverticulitis in the Ladies trial

Abstract Background Laparoscopic peritoneal lavage is an alternative to sigmoid resection in selected patients presenting with purulent peritonitis from perforated diverticulitis. Although recent trials have lacked superiority for lavage in terms of morbidity, mortality was not compromised, and beneficial secondary outcomes were shown. These included shorter duration of surgery, less stoma formation and less surgical reintervention (including stoma reversal) for laparoscopic lavage versus sigmoid resection respectively. The cost analysis of laparoscopic lavage for perforated diverticulitis in the Ladies RCT was assessed in the present study. Methods This study involved an economic evaluation of the randomized LOLA (LaparOscopic LAvage) arm of the Ladies trial (comparing laparoscopic lavage with sigmoid resection in patients with purulent peritonitis due to perforated diverticulitis). The actual resource use per individual patient was documented prospectively and analysed (according to intention-to-treat) for up to 1 year after randomization. Results Eighty-eight patients were randomized to either laparoscopic lavage (46) or sigmoid resection (42). The total medical costs for lavage were lower (mean difference € − 3512, 95 per cent bias-corrected and accelerated c.i. −16 020 to 8149). Surgical reintervention increased costs in the lavage group, whereas stoma reversal increased costs in the sigmoid resection group. Differences in favour of laparoscopy were robust when costs were varied by ±20 per cent in a sensitivity analysis (mean cost difference € − 2509 to −4438). Conclusion Laparoscopic lavage for perforated diverticulitis is more cost-effective than sigmoid resection.

Vennix, S.↗

PVT Analysis With A Deconvolution Algorithm

Polyvinyl Toluene (PVT) plastic scintillator is the most common gamma ray detector material used for large systems when only gross counting is needed because of its low cost, robustness, and relative sensitivity. PVT does provide some energy information about the incident photons, as has been demonstrated through the development of Energy Windowing analysis. There is a more sophisticated energy analysis algorithm developed by Symetrica, Inc., and they have demonstrated the application of their deconvolution algorithm to PVT with very promising results. The thrust of such a deconvolution algorithm used with PVT is to allow for identification and rejection of naturally occurring radioactive material, reducing alarm rates, rather than the complete identification of all radionuclides, which is the goal of spectroscopic portal monitors. Under this condition, there could be a significant increase in sensitivity to threat materials. The advantage of this approach is an enhancement to the low cost, robust detection capability of PVT-based radiation portal monitor systems. The success of this method could provide an inexpensive upgrade path for a large number of deployed PVT-based systems to provide significantly improved capability at a much lower cost than deployment of NaI(Tl)-based systems of comparable sensitivity.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

PRIMA-X Final Report

The PRIMA-X (Performance Retargeting of Instrumentation, Measurement, and Analysis Technologies for Exascale Computing) project is the successor of the DOE PRIMA (Performance Refactoring of Instrumentation, Measurement, and Analysis Technologies for Petascale Computing) project, which addressed the challenge of creating a core measurement infrastructure that would serve as a common platform for both integrating leading parallel performance systems (notably TAU and Scalasca) and developing next-generation scalable performance tools. The PRIMA-X project shifts the focus away from refactorization of robust performance tools towards a re-targeting of the parallel performance measurement and analysis architecture for extreme scales. The massive concurrency, asynchronous execution dynamics, hardware heterogeneity, and multi-objective prerequisites (performance, power, resilience) that identify exascale systems introduce fundamental constraints on the ability to carry forward existing performance methodologies. In particular, there must be a deemphasis of per-thread observation techniques to significantly reduce the otherwise unsustainable flood of redundant performance data. Instead, it will be necessary to assimilate multi-level resource observations into macroscopic performance views, from which resilient performance metrics can be attributed to the computational features of the application. This requires a scalable framework for node-level and system-wide monitoring and runtime analyses of dynamic performance information. Also, the interest in optimizing parallelism parameters with respect to performance and energy drives the integration of tool capabilities in the exascale environment further. Initially, PRIMA-X was a collaborative project between the University of Oregon (lead institution) and the German Research School for Simulation Sciences (GRS). Because Prof. Wolf, the PI at GRS, accepted a position as full professor at Technische Universität Darmstadt (TU Darmstadt) starting February 1st, 2015, the project ended at GRS on January 31st, 2015. This report reflects the work accomplished at GRS until then. The work of GRS is expected to be continued at TU Darmstadt. The first main accomplishment of GRS is the design of different thread-level aggregation techniques. We created a prototype capable of aggregating the thread-level information in performance profiles using these techniques. The next step will be the integration of the most promising techniques into the Score-P measurement system and their evaluation. The second main accomplishment is a substantial increase of Score-P’s scalability, achieved by improving the design of the system-tree representation in Score-P’s profile format. We developed a new representation and a distributed algorithm to create the scalable system tree representation. Finally, we developed a lightweight approach to MPI wait-state profiling. Former algorithms either needed piggy-backing, which can cause significant runtime overhead, or tracing, which comes with its own set of scaling challenges. Our approach works with local data only and, thus, is scalable and has very little overhead.

97 MATHEMATICS AND COMPUTING↗

PRIMA-X - Performance Retargeting of Instrumentation, Measurement, and Analysis Technologies for Exascale Computing

The PRIMA-X (Performance Retargeting of Instrumentation, Measurement, and Analysis Technologies for Exascale Computing) project is the successor of the DOE PRIMA (Performance Refactoring of Instrumentation, Measurement, and Analysis Technologies for Petascale Computing) project, which addressed the challenge of creating a core measurement infrastructure that would serve as a common platform for both integrating leading parallel performance systems (notably TAU and Scalasca) and developing next-generation scalable performance tools. The PRIMA-X project shifts the focus away from refactorization of robust performance tools towards a re-targeting of the parallel performance measurement and analysis architecture for extreme scales. The massive concurrency, asynchronous execution dynamics, hardware heterogeneity, and multi-objective prerequisites (performance, power, resilience) that identify exascale systems introduce fundamental constraints on the ability to carry forward existing performance methodologies. In particular, there must be a deemphasis of per-thread observation techniques to significantly reduce the otherwise unsustainable flood of redundant performance data. Instead, it will be necessary to assimilate multi-level resource observations into macroscopic performance views, from which resilient performance metrics can be attributed to the computational features of the application. This requires a scalable framework for node-level and system-wide monitoring and runtime analyses of dynamic performance information. Also, the interest in optimizing parallelism parameters with respect to performance and energy drives the integration of tool capabilities in the exascale environment further. Initially, PRIMA-X was a collaborative project between the University of Oregon (lead institution) and the German Research School for Simulation Sciences (GRS). Because Prof. Wolf, the PI at GRS, accepted a position as full professor at Technische Universitaet Darmstadt (TU Darmstadt) starting February 1st, 2015, the work of GRS was continued at TU Darmstadt. This report covers the work at TU Darmstadt after the transition. The first main accomplishment of TU Darmstadt is the development of different techniques to aggregate performance data on the level of threads. TU Darmstadt evaluated different schemes designed at GRS during the first phase of this project and integrated them into Score-P, a widely used performance measurement framework for HPC applications. The second main accomplishment is a substantial increase of Score-P’s scalability, achieved by improving its internal representation of the underlying system. Third, we extended our performance-modeling tool Extra-P to automatically create models with more than one input parameter (e.g., process count and input size), which was previously impossible. These models allow the performance behavior of an application to be extrapolated to larger machines. Specific applications of the new multi-parameter capability realized in this project include modeling the isoefficiency function of task-based applications and a novel co-design methodology. Further extensions of Extra-P comprise online modeling functionality, automatic refinement of the model search space, and segmented performance modeling. Further contributions include new locality metrics for both shared- and distributed-memory applications, a new way of measuring the impact of inter-application inference on the execution time of an application, and finally an automatic method that selects appropriate OpenMP constructs for the parallelization of sequential code and classifies the affected variables based on their sharing semantics.

97 MATHEMATICS AND COMPUTING↗

Robust control design with real parameter uncertainty using absolute stability theory

The purpose of this thesis is to investigate an extension of mu theory for robust control design by considering systems with linear and nonlinear real parameter uncertainties. In the process, explicit connections are made between mixed mu and absolute stability theory. In particular, it is shown that the upper bounds for mixed mu are a generalization of results from absolute stability theory. Both state space and frequency domain criteria are developed for several nonlinearities and stability multipliers using the wealth of literature on absolute stability theory and the concepts of supply rates and storage functions. The state space conditions are expressed in terms of Riccati equations and parameter-dependent Lyapunov functions. For controller synthesis, these stability conditions are used to form an overbound of the H2 performance objective. A geometric interpretation of the equivalent frequency domain criteria in terms of off-axis circles clarifies the important role of the multiplier and shows that both the magnitude and phase of the uncertainty are considered. A numerical algorithm is developed to design robust controllers that minimize the bound on an H2 cost functional and satisfy an analysis test based on the Popov stability multiplier. The controller and multiplier coefficients are optimized simultaneously, which avoids the iteration and curve-fitting procedures required by the D-K procedure of mu synthesis. Several benchmark problems and experiments on the Middeck Active Control Experiment at M.I.T. demonstrate that these controllers achieve good robust performance and guaranteed stability bounds.

How, Jonathan P.↗

Simulation of CNT-AFM tip based on finite element analysis for targeted probe of the biological cell

Carbon nanotubes (CNTs) are potentially ideal tips for atomic force microscopy (AFM) due to the robust mechanical properties, nano scale diameter and also their ability to be functionalized by chemical and biological components at the tip ends. This contribution develops the idea of using CNTs as an AFM tip in computational analysis of the biological cell’s. Finite element analysis employed for each section and displacement of the nodes located in the contact area was monitored by using an output database (ODB). This reliable integration of CNT-AFM tip process provides a new class of high performance nanoprobes for single biological cell analysis.

77 NANOSCIENCE AND NANOTECHNOLOGY↗

Convergence Analysis of the Alternating Anderson–Picard Method for Nonlinear Fixed-Point Problems

Anderson acceleration (AA) has been widely used to solve nonlinear fixed-point problems due to its rapid convergence. This work focuses on a variant of AA in which multiple Picard iterations are performed between each AA step, referred to as the Alternating Anderson–Picard (AAP) method. Furthermore, despite introducing more “slow” Picard iterations, this method has been shown to be efficient and even more robust in both linear and nonlinear cases. However, there is a lack of theoretical analysis for AAP in the nonlinear case. In this paper, we address this gap by establishing the equivalence between AAP and a multisecant-GMRES method that uses GMRES to solve a multisecant linear system at each iteration. From this perspective, we show that AAP “converges” to the Newton-GMRES method. Specifically, as the residual approaches zero, the multisecant matrix, the approximate Jacobian inverse, the search direction, and the optimization gain of AAP converge to their counterparts in the Newton-GMRES method. These connections provide insights for analyzing the asymptotic convergence properties of AAP. Consequently, we show that AAP is locally 𝑞-linear convergent and provide an upper bound for the convergence factor of AAP. To validate the theoretical results, numerical examples are provided.

Anderson acceleration↗

Morphology and particle size (MaPS) exercise: testing the applications of image analysis and morphology descriptions for nuclear forensics

Image analysis techniques have been applied and shown to be a valuable tool in nuclear forensics analysis. The interlaboratory exercise reported here has tested quantitative and qualitative approaches for characterizing nuclear materials. Particle size, surface features and morphology descriptions were compared by four laboratories on a common image set generated by Scanning Electron Microscopy and Digital Light Microscopy. Quantitative analysis of the image sets through the Morphological Analysis for MAterials software highlighted the strength of image analysis, but also that the application of the software alone can introduce significant bias in the analysis. Qualitative morphology descriptions following the process outlined by Tamasi et al. (J Radioanal Nuclear Chem 307:1611–1619, 2015) were compared with a discussion on the robustness and reproducibility of the results. Finally, future work should continue to focus on proficiency and standardization of image analysis through continued exercises within the extended nuclear forensics community.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Development of a Sulfur Tolerant CHG Process (CRADA 442) (Final Report)

The Pacific Northwest Laboratory (PNNL) has developed the Catalytic Hydrothermal Gasification (CHG) technology, which can convert low-value organics dispersed in aqueous streams, such as the aqueous phase byproduct from hydrothermal liquefaction (HTL) of wet wastes, to a mixture of methane, H 2 , and CO 2 . The current CHG catalyst, ruthenium (Ru) on a graphite substrate, was selected for its effectiveness as a reducing catalyst. However, the target waste aqueous feedstock, the HTL aqueous phase from wet wastes, such as sewage sludge, contains a fair amount of sulfur in both organic and inorganic forms. Like many other reduced metal catalysts, Ru is deactivated or poisoned by exposure to sulfur, among other contaminants. In general, a deactivated Ru catalyst cannot be reactivated or restored except by removing and returning it for remanufacturing. Therefore, there is an urgent need for a sulfur-resistant catalyst to enable CHG processing of the HTL aqueous waste stream. PNNL, with support from SoCalGas CRADA, has developed a sulfur resistant CHG catalyst and demonstrated a stable CHG process for converting HTL aqueous phases from wet wastes. Here, we report the major accomplishments of the project: • We have demonstrated that sulfided Ru based catalysts is stable during CHG of HTL aqueous waste stream, with a requirement of activity improvement. • We have developed a new catalyst, with 0.5-2 wt.% Ru loading, showing better activity compared to the baseline 6.7 wt.% RuSx/C catalyst. • With the new catalysts, the single-pass COD reduction is approximately 60% and two-pass COD reduction can reach approximately 85%. • The process is robust in terms of being effective across a wide range of organic species in the feedstock. • Techno-economic analysis was conducted to evaluate the economic impact of catalyst advancement and identify further improvement requirements. This type of catalyst shows great potential to be efficient and robust for CHG with low catalyst cost.

03 NATURAL GAS↗

Integrated tools for control-system analysis

The basic functions embedded within a user friendly software package (MATRIXx) are used to provide a high level systems approach to the analysis of linear control systems. Various control system analysis configurations are assembled automatically to minimize the amount of work by the user. Interactive decision making is incorporated via menu options and at selected points, such as in the plotting section, by inputting data. There are five evaluations such as the singular value robustness test, singular value loop transfer frequency response, Bode frequency response, steady-state covariance analysis, and closed-loop eigenvalues. Another section describes time response simulations. A time response for random white noise disturbance is available. The configurations and key equations used for each type of analysis, the restrictions that apply, the type of data required, and an example problem are described. One approach for integrating the design and analysis tools is also presented.

Ostroff, Aaron J.↗