Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “computational complexity”

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 919 records · Page 51

Cascading Failures in Interdependent Networks with Multiple Supply-Demand Links and Functionality Thresholds

Various social, financial, biological and technological systems can be modeled by interdependent networks. It has been assumed that in order to remain functional, nodes in one network must receive the support from nodes belonging to different networks. So far these models have been limited to the case in which the failure propagates across networks only if the nodes lose all their supply nodes. In this paper we develop a more realistic model for two interdependent networks in which each node has its own supply threshold, i.e., they need the support of a minimum number of supply nodes to remain functional. In addition, we analyze different conditions of internal node failure due to disconnection from nodes within its own network. We show that several local internal failure conditions lead to similar nontrivial results. When there are no internal failures the model is equivalent to a bipartite system, which can be useful to model a financial market. We explore the rich behaviors of these models that include discontinuous and continuous phase transitions. Using the generating functions formalism, we analytically solve all the models in the limit of infinitely large networks and find an excellent agreement with the stochastic simulations.

97 MATHEMATICS AND COMPUTING↗

Reducing Cascading Failure Risk by Increasing Infrastructure Network Interdependence

Increased coupling between critical infrastructure networks, such as power and communication systems, has important implications for the reliability and security of these systems. To understand the effects of power-communication coupling, several researchers have studied models of interdependent networks and reported that increased coupling can increase vulnerability. However, these conclusions come largely from models that have substantially different mechanisms of cascading failure, relative to those found in actual power and communication networks, and that do not capture the benefits of connecting systems with complementary capabilities. In order to understand the importance of these details, this paper compares network vulnerability in simple topological models and in models that more accurately capture the dynamics of cascading in power systems. First, we compare a simple model of topological contagion to a model of cascading in power systems and find that the power grid model shows a higher level of vulnerability, relative to the contagion model. Second, we compare a percolation model of topological cascading in coupled networks to three different models of power networks coupled to communication systems. Again, the more accurate models suggest very different conclusions than the percolation model. In all but the most extreme case, the physics-based power grid models indicate that increased power-communication coupling decreases vulnerability. This is opposite from what one would conclude from the percolation model, in which zero coupling is optimal. Only in an extreme case, in which communication failures immediately cause grid failures, did we find that increased coupling can be harmful. Together, these results suggest design strategies for reducing the risk of cascades in interdependent infrastructure systems.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Choosing experiments to accelerate collective discovery

Scientists perform a tiny subset of all possible experiments. What characterizes the experiments they choose? What are the consequences of those choices for the pace of scientific discovery? We model scientific knowledge as a network and science as a sequence of experiments designed to gradually uncover it. By analyzing millions of biomedical articles published over 30 y, we find that biomedical scientists pursue conservative research strategies exploring the local neighborhood of central, important molecules. Although such strategies probably serve scientific careers, we show that they slow scientific advance, especially in mature fields, where more risk and less redundant experimentation would accelerate discovery of the network. Lastly, we also consider institutional arrangements that could help science pursue these more efficient strategies.

97 MATHEMATICS AND COMPUTING↗

A lightweight network anomaly detection technique

While the network anomaly detection is essential in network operations and management, it becomes further challenging to perform the first line of detection against the exponentially increasing volume of network traffic. In this paper, we develop a technique for the first line of online anomaly detection with two important considerations: (i) availability of traffic attributes during the monitoring time, and (ii) computational scalability for streaming data. The presented learning technique is lightweight and highly scalable with the beauty of approximation based on the grid partitioning of the given dimensional space. With the public traffic traces of KDD Cup 1999 and NSL-KDD, we show that our technique yields 98.5% and 83% of detection accuracy, respectively, only with a couple of readily available traffic attributes that can be obtained without the help of post-processing. Finally, the results are at least comparable with the classical learning methods including decision tree and random forest, with approximately two orders of magnitude faster learning performance.

97 MATHEMATICS AND COMPUTING↗

Computer-Assisted Monitoring Of A Complex System

Propulsion System Advisor (PSA) computer-based system assists engineers and technicians in analyzing masses of sensory data indicative of operating conditions of space shuttle propulsion system during pre-launch and launch activities. Designed solely for monitoring; does not perform any control functions. Although PSA developed for highly specialized application, serves as prototype of noncontrolling, computer-based subsystems for monitoring other complex systems like electric-power-distribution networks and factories.

Beil, Bob J.↗

V IV O and V IV Species Formed in Aqueous Solution by the Tridentate Glutaroimide–Dioxime Ligand – An Instrumental and Computational Characterization

Complexation of V IV in aqueous solution with glutaroimide–dioxime (H 3 L), a ligand proposed for the possible sequestration of uranium from seawater, was studied by the combined application of spectroscopic (EPR and UV/Vis), spectrometric (ESI‐MS), electrochemical (CV), and computational (DFT) techniques. The results indicate that a rare non‐oxido V IV species, with formula [V IV L 2 ] 2– , is formed in the pH range 3–5. It transforms into a usual V IV O complex, [V IV OL(OH)] 2– , at pH > 6. The non‐oxido species is characterized by a “ type 3 ” EPR spectrum with A z ≈ 126 × 10 –4 cm –1 and a UV/Vis signal with ε > 2000 m –1 cm –1 in the visible region. The detection of V V species by ESI‐MS spectrometry was related to two possible oxidation processes, the first one in solution and the second one in‐source during the recording of the spectra. The cyclic voltammogram of [V IV L 2 ] 2– shows two quasi‐reversible processes, at E 1/2 = –0.75 V and E 1/2 = 0.03 V, assigned to the V IV /V III reduction and V IV /V V oxidation, respectively. All the experimental results were verified by DFT calculations, which indicated that the geometry of the non‐oxido V IV complex is intermediate between an octahedron and a trigonal prism and allowed us to predict its 51 V hyperfine coupling (HFC) tensor A , the electron absorption spectrum, the two redox processes in the cyclic voltammogram, and the electronic structure that, in turn, determines its EPR and UV/Vis behavior.

Sanna, Daniele↗

Supporting Data: A Four‐Coordinate Pr 4+ Imidophosphorane Complex

Supporting computational data for the publication titled: A. C. Boggiano, S. Roy Chowdhury, M. D. Roy, M. G. Bernbeck, S. M. Greer, B. Vlaisavljevich,* and H. S. La Pierre* “A Four-Coordinate Pr4+ Imidophosphorane Complex" Angew. Chem. Int. Ed., 2024, e202409789. DOI: 10.1002/anie.202409789

Boggiano, Andrew C.↗

Managing code transformations for better performance portability

Code optimization is an intricate task that is getting more complex as computing systems evolve. Managing the program optimization process, including the implementation and evaluation of code variants, is tedious, inefficient, and errors are likely to be introduced in the process. Moreover, because each platform typically requires a different sequence of transformations to fully harness its computing power, the optimization process complexity grows as new platforms are adopted. To address these issues, systems and frameworks have been proposed to automate the code optimization process. They, however, have not been widely adopted and are primarily used by experts with deep knowledge about underlying architecture and compiler intricacies. This article describes the requirements that we believe necessary for making automatic performance tuning more broadly used, especially in complex, long-lived high-performance computing applications. Besides discussing limitations of current systems and strategies to overcome these, we describe the design of a system that is able to semi-automatically generate efficient platform-specific code. In the proposed system, the code optimization is programmer-guided, separately from application code, on an external file in what we call optimization programming. The language to program the optimization process is able to represent complex collections of transformations and, as a result, generate efficient platform-specific code. A database manages different optimized versions of code regions, providing a pragmatic approach to performance portability, and the framework itself has separate components, allowing the optimized code to be used on systems without installing all of the modules required for the code generation. We present experiments on two different platforms to illustrate the generation of efficient platform-specific code that performs comparable to hand-optimized, vendor-provided code.

Computer Science↗

Computation of Sensitivity Derivatives of Navier-Stokes Equations using Complex Variables

Accurate computation of sensitivity derivatives is becoming an important item in Computational Fluid Dynamics (CFD) because of recent emphasis on using nonlinear CFD methods in aerodynamic design, optimization, stability and control related problems. Several techniques are available to compute gradients or sensitivity derivatives of desired flow quantities or cost functions with respect to selected independent (design) variables. Perhaps the most common and oldest method is to use straightforward finite-differences for the evaluation of sensitivity derivatives. Although very simple, this method is prone to errors associated with choice of step sizes and can be cumbersome for geometric variables. The cost per design variable for computing sensitivity derivatives with central differencing is at least equal to the cost of three full analyses, but is usually much larger in practice due to difficulty in choosing step sizes. Another approach gaining popularity is the use of Automatic Differentiation software (such as ADIFOR) to process the source code, which in turn can be used to evaluate the sensitivity derivatives of preselected functions with respect to chosen design variables. In principle, this approach is also very straightforward and quite promising. The main drawback is the large memory requirement because memory use increases linearly with the number of design variables. ADIFOR software can also be cumber-some for large CFD codes and has not yet reached a full maturity level for production codes, especially in parallel computing environments.

Vatsa, Veer N.↗

Spectroscopic and Computational Evidence of Uranium Dihydrogen Complexes

Dihydrogen complexation, a phenomenon with robust precedent in the transition metal series, is spectroscopically detected for a uranium(III) complex and thereby extended for the first time to the 5f series. The vacant coordination site and low valence of (C 5 H 4 SiMe 3 ) 3 U prove to be key to the reversible formation of (C 5 H 4 SiMe 3 ) 3 U–H 2 (complex 1), and the paramagnetism of the f 3 center facilitates the detection of complex 1 by NMR spectroscopy. Density functional theory calculations reveal that the delocalization of the 5f electron density from (C 5 H 4 SiMe 3 ) 3 U onto the side-on dihydrogen ligand is crucial to complex formation, an unusual bonding situation for an actinide acid–base complex. Here, the spectroscopic and computational results are compared to those reported for lanthanide metallocenes to yield insight into the nature of–and future possibilities for–f-element dihydrogen complexation.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Optimal net-load balancing in smart grids with high PV penetration

Mitigating mismatches in supply demand curve is critical for smooth power grid operation. Traditionally, load curtailment techniques such as Demand Response (DR) have been used for this purpose. However, smart grids with high PV penetration sometimes exhibit supply surplus causing over-voltages. Thus, load curtailment techniques cannot be the only component of a net-load balancing framework. Supply curtailment techniques such as Volt-Var Optimizations are complex and computationally expensive. This increases the complexity of net-load balancing systems used by the grid operator and limits their scalability. Recently, new technologies have been developed that enable the rapid and selective connection of PV modules of an installation to the grid. Taking advantage of these advancements, we develop a unified optimal net-load balancing framework which performs both load and solar curtailment. We show that when the available curtailment values are discrete, this problem is NP-hard and develop bounded approximation algorithms for minimizing the curtailment cost. Our algorithms produce fast solutions, given the tight timing constraints required for grid operation. We also incorporate the notion of fairness to ensure that curtailment is evenly distributed among all the nodes. Finally, we develop an online algorithm which performs net-load balancing using only data available for the current interval. Using both theoretical analysis and practical evaluations, we show that our net-load balancing algorithms provide solutions which are close to optimal in a small amount of time.

14 SOLAR ENERGY↗

Computing the shape gradient of stellarator coil complexity with respect to the plasma boundary

Coil complexity is a critical consideration in stellarator design. The traditional two-step optimization approach, in which the plasma boundary is optimized for physics properties and the coils are subsequently optimized to be consistent with this boundary, can result in plasma shapes which cannot be produced with sufficiently simple coils. To address this challenge, we propose a method to incorporate considerations of coil complexity in the optimization of the plasma boundary. Coil complexity metrics are computed from the current potential solution obtained with the REGCOIL code (Landreman, Nucl. Fusion , vol. 57, 2017, 046003). While such metrics have previously been included in derivative-free fixed-boundary optimization (Drevlak et al. , Nucl. Fusion , vol. 59, 2018, 016010), we compute the local sensitivity of these metrics with respect to perturbations of the plasma boundary using the shape gradient (Landreman & Paul, Nucl. Fusion , vol. 58, 2018, 076023). We extend REGCOIL to compute derivatives of these metrics with respect to parameters describing the plasma boundary. In keeping with previous research on winding surface optimization (Paul et al. , Nucl. Fusion , vol. 58, 2018, 076015), the shape derivatives are computed with a discrete adjoint method. In contrast with the previous work, derivatives are computed with respect to the plasma surface parameters rather than the winding surface parameters. To further reduce the resolution required to compute the shape gradient, we present a more efficient representation of the plasma surface which uses a single Fourier series to describe the radial distance from a coordinate axis and a spectrally condensed poloidal angle. This representation is advantageous over the standard cylindrical representation used in the VMEC code (Hirshman & Whitson, Phys. Fluids , vol. 26, 1983, pp. 3553–3568), as it provides a uniquely defined poloidal angle, eliminating a null space in the optimization of the plasma surface. In comparison with previous spectral condensation methods (Hirshman & Breslau, Phys. Plasmas , vol. 5, 1998, p. 2664), the modified poloidal angle is obtained algebraically rather than through the solution of a nonlinear optimization problem. The resulting shape gradient highlights features of the plasma boundary that are consistent with simple coils and can be used to couple coil and fixed-boundary optimization.

Physics↗

Complex optimization for big computational and experimental neutron datasets

Here, we present a framework to use high performance computing to determine accurate solutions to the inverse optimization problem of big experimental data against computational models. We demonstrate how image processing, mathematical regularization, and hierarchical modeling can be used to solve complex optimization problems on big data. We also demonstrate how both model and data information can be used to further increase solution accuracy of optimization by providing confidence regions for the processing and regularization algorithms. Finally, we use the framework in conjunction with the software package SIMPHONIES to analyze results from neutron scattering experiments on silicon single crystals, and refine first principles calculations to better describe the experimental data.

36 MATERIALS SCIENCE↗

Is Model-Based Development a Favorable Approach for Complex and Safety-Critical Computer Systems on Commercial Aircraft?

A system is safety-critical if its failure can endanger human life or cause significant damage to property or the environment. State-of-the-art computer systems on commercial aircraft are highly complex, software-intensive, functionally integrated, and network-centric systems of systems. Ensuring that such systems are safe and comply with existing safety regulations is costly and time-consuming as the level of rigor in the development process, especially the validation and verification activities, is determined by considerations of system complexity and safety criticality. A significant degree of care and deep insight into the operational principles of these systems is required to ensure adequate coverage of all design implications relevant to system safety. Model-based development methodologies, methods, tools, and techniques facilitate collaboration and enable the use of common design artifacts among groups dealing with different aspects of the development of a system. This paper examines the application of model-based development to complex and safety-critical aircraft computer systems. Benefits and detriments are identified and an overall assessment of the approach is given.

Torres-Pomales, Wilfredo↗

Spectroscopic and computational investigations of organometallic complexation of group 12 transition metals by methanobactins from Methylocystis sp. SB2

Methanotrophic bacteria catalyze the aerobic oxidation of methane to methanol using Cu-containing enzymes, thereby exerting a modulating influence on the global methane cycle. To facilitate the acquisition of Cu ions, some methanotrophic bacteria secrete small modified peptides known as “methanobactins,” which strongly bind Cu and function as an extracellular Cu recruitment relay, analogous to siderophores and Fe. In addition to Cu, methanobactins form complexes with other late transition metals, including the Group 12 transition metals Zn, Cd, and Hg, although the interplay among solution-phase configurations, metal interactions, and the spectroscopic signatures of methanobactin-metal complexes remains ambiguous. In this study, the complexation of Zn, Cd, and Hg by methanobactin from Methylocystis sp. strain SB2 was studied using a combination of absorbance, fluorescence, extended x-ray absorption fine structure (EXAFS) spectroscopy, and time-dependent density functional theory (TD-DFT) calculations. We report changes in sample absorbance and fluorescence spectral dynamics, which occur on a wide range of experimental timescales and characterize a clear stoichiometric complexation dependence. Mercury L3-edge EXAFS and TD-DFT calculations suggest a linear model for Hg--S coordination, and TD-DFT suggests a tetrahedral model for Zn 2+ and Cd 2+ . We observed an enhancement in the fluorescence of methanobactin upon interaction with transition metals and propose a mechanism of complexation-hindered isomerization drawing inspiration from the wild-type Green Fluorescent Protein active site. Collectively, our results represent the first combined computational and experimental spectroscopy study of methanobactins and shed new light on molecular interactions and dynamics that characterize complexes of methanobactins with Group 12 transition metals.

59 BASIC BIOLOGICAL SCIENCES↗