PRA/quant-ph submission: Complex instruction set computing architecture for performing accurate quantum Z rotations with less magic.
Abstract not provided.
SEARCH · Engineering Papers
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.
Abstract not provided.
Abstract not provided.
Explore the source record for details and available documents.
Metal-EDTA complexes are commonly existed as biological redox reagents. We havegenerated a series of such complexes, [EDTA•M(III)]- (M = Al, Sc, V-Co), via electrospray ionization and characterized them by cryogenic mass-selected negative ion photoelectron spectroscopy (NIPES) and theoretical calculations. Experiments clearly revealed one more spectral band at low electron binding energy for transition metal complexes with d electrons (M = V-Co) than those without d electrons (M = Al and Sc). Quantum chemical calculations suggested that all of the metal-complexes possess hexacoordinated metal-ligand binding motifs, from which the calculated adiabatic/vertical detachment energy (ADE/VDE) and band gaps are in good agreement with experimental values. Direct spectrum and electronic structure analyses indicted that [EDTA•V(III)]- can be easily oxidized to [EDTA•V(IV)] with the smallest ADE/VDE of 3.95/4.40 eV among these metal-complexes, but further oxidation is hindered by the existence of a 2.30 eV band gap, a fact that accords with the special redox behavior of vanadium-containing species in biology cells. Spin density and molecular orbital analyses reveal that [EDTA•V(III)]- was overwhelmingly detached from vanadium atom, in a stark contrast to [EDTA•Sc(III)/Al(III)]- where the detachment occurred from the EDTA ligand. For all other metal complex anions, from M = Cr to Co, the detachment process is derived from contributions from both the metal and ligand. The intrinsic electronic and geometric structures of these complexes, obtained in this work, provide a molecular foundation to better understand their redox chemistries and specific metal bindings in condensed phases and biology cells.
The computational investigation of the molecular geometries of a pair of manganese(III) spin-crossover complexes is reported. For the geometry of the quintet high-spin state, density functionals significantly overestimate Mn–Namine bond distances, although the geometry for the triplet intermediate-spin state is well described. Here, comparisons with several wave function-based methods demonstrate that this error is due to the limited ability of commonly used density functionals to recover dispersion beyond a certain extent. Among the methods employed for geometry optimization, restricted open-shell Møller–Plesset perturbation theory (MP2) appropriately describes the high-spin geometry but results in a slightly shorter Mn–O distance in both spin states. On the other hand, extended multistate complete active space second-order perturbation theory (XMS-CASPT2) provides a good description of the geometry for the intermediate-spin state but also sufficiently recovers dispersion, performing well for the high-spin state. Despite the fact that the electronic structure of both spin states is dominated by one-electron configuration, XMS-CASPT2 offers a balanced approach, leading to molecular geometries with much better agreement with experiment than MP2 and DFT. A scan along the Mn–N amine bond demonstrates that for these complexes coupled cluster methods (i.e., DLPNO-CCSD(T)) also yield bond distances in agreement with experiment while multiconfiguration pair density functional theory (MC-PDFT) is unable to recover dispersion well enough, analogous to single-reference DFT.
Supporting computational data for the publication titled:L. R. Valerio, S. Roy Chowdhury, R. Lewis, K. E. Knowles,* B. Vlaisavljevich,* and E. M. Matson* “Photoluminescence of a Uranium(IV) Alkoxide Complex", S ubmitted to JACS Au.
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.
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.
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.
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.
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.
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
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.
Scientific simulations can produce enormous amounts of data, making the analysis of results and management of files a difficult task for scientists. The simulation management and analysis system (Smaash) described here is designed to allow scientists to easily capture, store, organize, monitor, and analyze simulation results. The system is automatic, standardized, and secure. Smaash was built using open-source tools and modularized to be independent of the scientific simulation. The web-based front-end allows the scientist to easily interact with the data, and has proved its usefulness in improving the efficiency of a scientific team's workflow. High performance parallel computing allows scientists to solve complex physical problems through computer simulation. However, the massive amounts of data generated and the complex computing environment can create additional complications. A recent review by Ludaescher et al.(2009) describes how scientific workflows can assist scientists in extracting knowledge from these data-intensive operations by automating components within pipelines. Within the fusion community, Klasky et al.(2008) and colleagues have developed a system that handles the storage management, data movement, metadata generation and management, and a means to analyze the results. In response to scientists needs, a simulation management and analysis system (Smaash) was developed at the University of Chicago and Argonne National Laboratory (USA). Smaash provides an integrated way to monitor simulations and analyze computational results; catalog, store, and retrieve simulations; and prepare output for publications. The system is independent of the particular simulation code, accessible from many HPC and browser-based platforms, and built around open-source software tools. Data security and provenance is considered throughout. The analysis components are hidden behind a web-based front end, enabling scientists to focus on their results and not get bogged down by information overload.
A compute processor allocator architecture for allocating compute processors to run applications in a multiple processor computing apparatus is distributed among a subset of processors within the computing apparatus. Each processor of the subset includes a compute processor allocator. The compute processor allocators can share a common database of information pertinent to compute processor allocation. A communication path permits retrieval of information from the database independently of the compute processor allocators.
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.
The Morse-Smale (MS) complex has proven to be a useful tool in extracting and visualizing features from scalar-valued data. However, existing algorithms to compute the MS complex are restricted to either piecewise linear or discrete scalar fields. This paper presents a new combinatorial algorithm to compute MS complexes for two dimensional piecewise bilinear functions defined on quadrilateral meshes. We derive a new invariant of the gradient flow within a bilinear cell and use it to develop a provably correct computation which is unaffected by numerical instabilities. This includes a combinatorial algorithm to detect and classify critical points as well as a way to determine the asymptotes of cell-based saddles and their intersection with cell edges. Finally, we introduce a simple data structure to compute and store integral lines on quadrilateral meshes which by construction prevents intersections and enables us to enforce constraints on the gradient flow to preserve known invariants.