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 757 records · Page 42

Resistive Switching of Spinel Li 4 Ti 5 O 12 Lithium-Ion Battery Material for Neuromorphic Computing

The rapid rise of AI has exposed significant limitations in conventional Von Neumann computing architecture, particularly in regard to speed and energy efficiency. To address these challenges, researchers are exploring a brain-inspired neuromorphic architecture that mimics biological neural networks, enabling massive parallel processing with reduced power consumption for complex AI computational demands. Recent interest has focused on utilizing battery electrodes and solid electrolyte materials for their resistive switching properties in developing a neuromorphic architecture. These properties are precisely tuned through local- and bulk-level chemical composition modifications via voltage bias stimuli. In this study, we demonstrate fabricating a three-terminal lithium-ion electrochemical transistor based on lithium titanium oxide (Li 4 Ti 5 O 12 ), a popular lithium-ion battery anode material. We deposited and characterized LTO thin films using RF sputtering, demonstrating a 6 orders of magnitude increase in electronic conductivity upon lithiation, with conductivity plateauing after 20% lithiation. Density functional theory calculations revealed transformation from the insulating to conducting state, supported by experimental characterization through X-Ray Photoelectron Spectroscopy (XPS) and Direct Current (DC) polarization analyses. The fabricated transistor consisted of LTO as the channel layer, gold as source/drain terminals, lithium phosphorus oxynitride (LiPON) as the lithium-ion conductor, and copper as the gate terminal. The device exhibited clear hysteresis in transfer characteristics due to lithium insertion/extraction processes. Long-term potentiation (LTP) and long-term depression (LTD) measurements showed an asymmetric ratio of 1.425 and maximum/minimum conductance ratio of 7.83. When implemented in a deep neural network (DNN) for MNIST handwritten digit recognition, the device achieved 92.03% accuracy over 20 training epochs. Detailed transport mechanism analysis revealed the crucial role of oxygen vacancies and interface effects in device operation. Our preliminary findings establish LTO-based lithium-ion electrochemical transistors as promising candidates for energy-efficient neuromorphic computing applications, offering potential solutions to traditional Von Neumann architecture limitations.

25 ENERGY STORAGE↗

Three-dimensional solutions of supersymmetrical intertwining relations and pairs of isospectral Hamiltonians

The general solution of supersymmetrical intertwining relations for three-dimensional Schroedinger operators is built using the class of second order supercharges with nondegenerate constant metric. This solution includes several models with arbitrary parameters. We are interested only in quantum systems which are not amenable to separation of variables, i.e., cannot be reduced to lower dimensional problems. All constructed Hamiltonians are partially integrable - each of them commutes with a symmetry operator of fourth order in momenta. The same models can be considered also for complex values of parameters leading to a class of non-Hermitian isospectral Hamiltonians.

97 MATHEMATICS AND COMPUTING↗

How the Size and Density of Charge-Transfer Excitons Depend on Heterojunction’s Architecture

We have characterized the size, intensity, density, and distribution of charge-transfer (CT) excitons as a function of the acceptor–donor architecture of prototypical organic interfaces. This characterization was done by computational analysis of 17 models of varying numbers, positions, and orientations of the donor and acceptor molecules. The models’ building blocks were phenyl-C61-butyric acid methyl ester (PCBM) fullerene acceptors and dual-band donor polymers composed of thiophene, benzothiadiazole, and benzotriazole subunits. The electronic structure of the donor–acceptor complexes was computed with the time-dependent long-range-corrected density-functional tight-binding method and analyzed with the fragment-based one-electron transition density matrix. In all models, the complexes with edge-on orientation have denser spectra of low-energy CT states lying below the absorption bands compared to the complexes with face-on orientation. This CT-state distribution in edge-on complexes provides a gate to efficiently populate cold CT excitons. Moreover, the cold CT excitons have a higher degree of charge separation in the edge-on than in the face-on complexes. The CT amount and the CT exciton size generally increase with the energy of the CT states, although the electron remains localized on a single molecule in cold CT states. Delocalization over two PCBM molecules was observed for high-energy CT states. The exciton size also depends on the orientation. Larger excitons are produced by the delocalization of the electrons perpendicularly to the interface. When the delocalization is parallel, the smaller electron–hole distances yield moderately sized CT excitons.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Collective neural network behavior in a dynamically driven disordered system of superconducting loops

Collective properties of complex systems composed of many interacting components such as neurons in our brain can be modeled by artificial networks based on disordered systems. We show that a disordered neural network of superconducting loops with Josephson junctions can exhibit computational properties like categorization and associative memory in the time evolution of its state in response to information from external excitations. Superconducting loops can trap multiples of fluxons in many discrete memory configurations defined by the local free energy minima in the configuration space of all possible states. A memory state can be updated by exciting the Josephson junctions to fire or allow the movement of fluxons through the network as the current through them surpasses their critical current thresholds. Simulations performed with a lumped element circuit model of a 4-loop network show that information written through excitations is translated into stable states of trapped flux and their time evolution. Experimental implementation on a high-Tc superconductor YBCO-based 4-loop network shows dynamically stable flux flow in each pathway characterized by the correlations between junction firing statistics. Neural network behavior is observed as energy barriers separating state categories in simulations in response to multiple excitations, and experimentally as junction responses characterizing different flux flow patterns in the network. The state categories that produce these patterns have different temporal stabilities relative to each other and the excitations. This provides strong evidence for time-dependent (short-to-long-term) memories, that are dependent on the geometrical and junction parameters of the loops, as described with a network model.

Josephson junctions↗

DRAS: Deep Reinforcement Learning for Cluster Scheduling in High Performance Computing

Cluster schedulers are crucial in high-performance computing (HPC). They determine when and which user jobs should be allocated to available system resources. Existing cluster scheduling heuristics are developed by human experts based on their experience with specific HPC systems and workloads. However, the increasing complexity of computing systems and the highly dynamic nature of application workloads have placed tremendous burden on manually designed and tuned scheduling heuristics. More aggressive optimization and automation are needed for cluster scheduling in HPC. In this work, we present an automated HPC scheduling agent named DRAS (Deep Reinforcement Agent for Scheduling) by leveraging deep reinforcement learning. DRAS is built on a hierarchical neural network incorporating special HPC scheduling features such as resource reservation and backfilling. An efficient training strategy is presented to enable DRAS to rapidly learn the target environment. Once being provided a specific scheduling objective given by the system manager, DRAS automatically learns to improve its policy through interaction with the scheduling environment and dynamically adjusts its policy as workload changes. We implement DRAS into a HPC scheduling platform called CQGym. CQGym provides a common platform allowing users to flexibly evaluate DRAS and other scheduling methods such as heuristic and optimization methods. Furthermore, the experiments using CQGym with different production workloads demonstrate that DRAS outperforms the existing heuristic and optimization approaches by up to 50%.

97 MATHEMATICS AND COMPUTING↗

Acoustic inverse scattering via Helmholtz operator factorization and optimization

We present a joint acoustic/seismic inverse scattering and finite-frequency (reflection) tomography program, formulated as a coupled set of optimization problems, in terms of inhomogeneous Helmholtz equations. We use a higher order finite difference scheme for these Helmholtz equations to guarantee sufficient accuracy. We adapt a structured approximate direct solver for the relevant systems of algebraic equations, which addresses storage requirements through compression, to yield a complexity for computing the gradients or images in the optimization problems that consists of two parts, viz., the cost for all the matrix factorizations which is roughly O(rN) (for example O(rNlogN) when d = 2) times the number of frequencies, and the cost for all solutions by substitution which is roughly O(N) (for example O(Nlog(rlogN)) when d = 2) times the number of frequencies times the number of sources (events), where N = n{sup d} if n is the number of grid samples in any direction, and r is a parameter depending on the preset accuracy and the problem at hand. With this complexity, the multi-frequency approach to inverse scattering and finite-frequency tomography becomes computationally feasible with large data sets, in dimensions d = 2 and 3.

97 MATHEMATICS AND COMPUTING↗

DAG-Based Software Frameworks for PDEs

The task-based approach to software and parallelism is well-known and has been proposed as a potential candidate, named the silver model, for exascale software. This approach is not yet widely used in the large-scale multi-core parallel computing of complex systems of partial differential equations. After surveying task-based approaches we investigate how well the Uintah software and an extension named Wasatch fit in the task-based paradigm and how well they perform on large scale parallel computers. The conclusion is that these approaches show great promise for petascale but that considerable algorithmic challenges remain.

Directed Acyclic Graph↗

The importance of capturing power system operational details in resource adequacy assessments

Traditional methods for assessing the resource adequacy (RA) of a power system are becoming obsolete due to emerging trends such as the increasing deployment of variable renewable energy and storage. Consequently, analysts are recommending that RA be assessed using a Monte Carlo simulation approach that models chronological power system operations over many instances of possible operating conditions. However, this approach is necessarily more complex and computationally demanding, which is an obstacle to real-world implementation. Here, in this study, we investigate which operational details of power systems are important to capture in order to accurately evaluate a system's RA, versus details that add complexity but do not meaningfully affect RA results. To do so, we develop a probabilistic RA assessment framework by adapting an existing production cost model and apply it to a case study based on the IEEE Reliability Test System. Our results indicate that multi-year data, storage dispatch, and transmission limits are key details to incorporate. Accurate RA results can be obtained using non-economic dispatch strategies as long as they are coordinated with detailed operational strategies. We also demonstrate how popular expectation-based RA metrics can mask important differences in the characteristics of loss of load events.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Sequential Bond Dissociation Energies of Th + (CO) x , x = 3–6: Guided Ion Beam Collision-Induced Dissociation and Quantum Computational Studies

Collision-induced dissociation (CID) of [Th,xC,xO] + , x = 3–6, with Xe is performed using a guided ion beam tandem mass spectrometer (GIBMS). Products are formed exclusively by the loss of CO ligands. Analyses of the kinetic energy-dependent CID product cross sections yield bond dissociation energies (BDEs) of (CO) x–1 Th + –CO at 0 K as 1.09 ± 0.05, 0.82 ± 0.07, 0.63 ± 0.05, and 0.70 ± 0.05 eV, respectively. Different structures of [Th,xC,xO] + were explored using various electronic structure methods, and BDEs for CO ligand loss from precursor [Th,xC,xO] + complexes were computed. Both experimental and theoretical results corroborate that the structures of [Th,xC,xO] + , x = 3–6, formed experimentally are homoleptic thorium cation carbonyl complexes, Th + (CO) x . The nonmonotonic trend in experimental BDEs is reproduced theoretically, although ambiguities in the spin states of the x = 4–6 complexes (doublet or quartet) remain. BDEs calculated at the coupled cluster with single, double, and perturbative triple excitations (CCSD(T))/cc-pVXZ//B3LYP/cc-PVXZ (X = T and Q) level and a complete basis set (CBS) extrapolation agree reasonably well with the experimental values for all complexes. Thorium oxide ketenylidene carbonyl cations, OTh + CCO(CO) y , y = 1–4, were calculated to be the most stable structures of [Th,xC,xO] + , x = 3–6, respectively; however, these are not observed in our experiment. Potential energy profiles (PEPs) having either quartet or doublet spin calculated at the B3LYP/cc-pVQZ level suggest that the failure to observe OTh + CCO(CO) y , y = 1–4, is the result of a barrier corresponding to the C–C bond formation, making the formation of OTh + CCO(CO) y inaccessible kinetically under the present experimental conditions.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Agent-Based Socio-Hydrological Hybrid Modeling for Water Resource Management

Hybrid socio-hydrological modeling has become indispensable for managing water resources in an increasingly unstable ecology caused by human activity. Most work on the subject has been focused on either qualitative socio-political recommendations with an unbounded list of vague factors or complex sociological and hydrological models with many assumptions and specialized usability. Here in this paper, we propose a simple agent-based socio-hydrological decision modeling framework for coupling dynamics associated with social behavior and groundwater contamination. The study shows that using social health risk, instead of contaminant concentration, as an optimization variable improves water management decisions aimed at maximizing social wellbeing. The social models and computational framework are designed with enough flexibility and simplicity to encourage extensions to more general socio-hydrological dynamics without compromising either computability or complexity for better data-/model-driven environmental management.

54 ENVIRONMENTAL SCIENCES↗

Structural modeling and validation of laminated stacks in magnetic gearing applications

Laminated structures are commonly employed in magnetic gears based on their ability to direct magnetic flux, while inhibiting eddy currents. Unfortunately, the stiffness of the laminated structure is much lower than a solid part, which can lead to unacceptable deflections, given the large magnetic forces and small air gaps in magnetic gears. Finite element analysis of laminations to accurately predict these deflections can be computationally expensive due to the small elements needed to model the thin lamination dimensions. These analyses also have some uncertainty due to the assignment of bonding stiffness. This paper presents a means of accurately modelling the deflection of a laminated stack with reduced complexity and computational time, which is compared to experimental results. Here, the resulting methods are then used to assess the magnetic and mechanical advantages of different designs for the modulating pieces of a magnetic gear.

42 ENGINEERING↗

Growing field of materials informatics: databases and artificial intelligence

The paradigm of molecular discovery in the chemical and pharmaceutical industry has followed a repetitive succession of screening and synthesis, involving the analysis of individual molecules that were both natural and produced. This ability to generate and screen libraries of compounds has found an echo in solid-state physics with the demand to explore and produce new materials for testing. In response to this demand, a golden age of materials discovery is being developed, with progress on important areas of both basic science and device applications. The confluence of theoretical and simulation methods, together with the availability of computation resources, has established the “materials genome” approach that is used by a growing number of research groups around the world with the goal of innovating on materials through systematic discovery. Here, an overview of this group of methodologies in tackling the ever-increasing complexity of computational materials science simulations is provided. Computational simulation is highlighted as a major component of rational design and synthesis of new materials with targeted properties, describing progress on databases and large data treatment. Tools for new materials discovery, including progress on the deployment of new data repositories, the implementation of high-throughput simulation approaches, and the development of artificial intelligence algorithms, are discussed.

36 MATERIALS SCIENCE↗

Global optimization algorithms to compute thermodynamic equilibria in large complex systems with performance considerations

Several global optimization methods are reviewed that attempt to ensure that the integral Gibbs energy of a closed isothermal isobaric system is a global minimum to satisfy the necessary and sufficient conditions for thermodynamic equilibrium. In particular, the integral Gibbs energy function of a multicomponent system containing non-ideal phases may be highly non-linear and non-convex, which makes finding a global minimum a challenge. Consequently, a poor numerical approach may lead one to the false belief of equilibrium. Furthermore, confirming that one reaches a global minimum and that this is achieved with satisfactory computational performance becomes increasingly more challenging in systems containing many chemical elements and a correspondingly large number of species and phases. Several numerical methods that have been used for this specific purpose are reviewed with a benchmark study of three of the more promising methods using five case studies of varying complexity. A modification of the conventional Branch and Bound method is presented that is well suited to a wide array of thermodynamic applications, including complex phases with many constituents and sublattices, and ionic phases that must adhere to charge neutrality constraints. Also, a novel method is presented that efficiently solves the system of linear equations that exploits the unique structure of the Hessian matrix, which reduces the calculation from a O(N 3 ) operation to a O(N) operation. As a result, this combined approach demonstrates efficiency, reliability and capabilities that are favorable for integration of thermodynamic computations into multi-physics codes with inherent performance considerations.

97 MATHEMATICS AND COMPUTING↗

Parallelized hybrid optimization methods for nonsmooth problems using NOMAD and linesearch

Two parallelized hybrid methods are presented for single-function optimization problems with side constraints. The optimization problems are difficult not only due to possible existence of local minima and nonsmoothness of functions, but also due to the fact that objective function and constraint values for a solution vector can only be obtained by querying a black box whose execution requires considerable computational effort. Examples are optimization problems in Engineering where objective function and constraint values are computed via complex simulation programs, and where local minima exist and smoothness of functions is not assured. The hybrid methods consist of the well-known method NOMAD and two new methods called DENCON and DENPAR that are based on the linesearch scheme CS-DFN. The hybrid methods compute for each query a set of solution vectors that are evaluated in parallel. The hybrid methods have been tested on a set of difficult optimization problems produced by a certain seeding scheme for multiobjective optimization. We compare computational results with solution by NOMAD, DENCON, and DENPAR as stand-alone methods. It turns out that among the stand-alone methods, NOMAD is significantly better than DENCON and DENPAR. However, the hybrid methods are definitely better than NOMAD.

97 MATHEMATICS AND COMPUTING↗

Spin-free formulation of the multireference driven similarity renormalization group: A benchmark study of first-row diatomic molecules and spin-crossover energetics

We report a spin-free formulation of the multireference (MR) driven similarity renormalization group (DSRG) based on the ensemble normal ordering of Mukherjee and Kutzelnigg (1997). This ensemble averages over all microstates of a given total spin quantum number, and therefore, it is invariant with respect to SU(2) transformations. As such, all equations may be reformulated in terms of spin-free quantities and they closely resemble those of spin-adapted closed-shell coupled cluster (CC) theory. The current implementation is used to assess the accuracy of various truncated MR-DSRG methods (perturbation theory up to third order and iterative methods with single and double excitations) in computing the constants of 33 first-row diatomic molecules. The accuracy trends for these first-row diatomics are consistent with our previous benchmark on a small subset of closed-shell diatomic molecules. We then present the first MR-DSRG application on transition-metal complexes by computing the spin splittings of the [Fe(H 2 O) 6 ] 2+ and [Fe(NH 3 ) 6 ] 2+ molecules. A focal point analysis (FPA) shows that third-order perturbative corrections are essential to achieve reasonably converged energetics. The FPA based on the linearized MR-DSRG theory with one- and two-body operators and up to a quintuple- ζ basis set predicts the spin splittings of [Fe(H 2 O) 6 ] 2+ and [Fe(NH 3 ) 6 ] 2+ to be –35.7 and –17.1 kcal mol –1 , respectively, showing good agreement with the results of local CC theory with singles, doubles, and perturbative triples.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Structure of the Majorana Clifford group

In quantum information science, Clifford operators and stabilizer codes play a central role for systems of qubits (or qudits). In this study, we study their analogs for systems composed of Majorana fermions. In this case, a crucial role is played by fermion parity symmetry, which is an unbreakable symmetry present in any system with fundamentally fermionic degrees of freedom. We prove that the subgroup of parity-preserving Majorana Cliffords can be represented by the orthogonal group over the binary field 𝔽 2 , and we show how it can be generated by braiding operators and used to construct any (even-parity) Majorana stabilizer code. We also analyze the frame potential for this so-called p-Clifford group when acting on a fixed-parity sector of the Hilbert space, proving that it is equivalent to the frame potential of the ordinary Clifford group acting on the same sector.

Computational complexity↗

A combinatorial method for tracing objects using semantics of their shape.

We present a shape-first approach to finding automobiles and trucks in overhead images and include results from our analysis of an image from the Overhead Imaging Research Dataset [1]. For the OIRDS, our shape-first approach traces candidate vehicle outlines by exploiting knowledge about an overhead image of a vehicle: a vehicle's outline fits into a rectangle, this rectangle is sized to allow vehicles to use local roads, and rectangles from two different vehicles are disjoint. Our shape-first approach can efficiently process high-resolution overhead imaging over wide areas to provide tips and cues for human analysts, or for subsequent automatic processing using machine learning or other analysis based on color, tone, pattern, texture, size, and/or location (shape first). In fact, computationally-intensive complex structural, syntactic, and statistical analysis may be possible when a shape-first work flow sends a list of specific tips and cues down a processing pipeline rather than sending the whole of wide area imaging information. This data flow may fit well when bandwidth is limited between computers delivering ad hoc image exploitation and an imaging sensor. As expected, our early computational experiments find that the shape-first processing stage appears to reliably detect rectangular shapes from vehicles. More intriguing is that our computational experiments with six-inch GSD OIRDS benchmark images show that the shape-first stage can be efficient, and that candidate vehicle locations corresponding to features that do not include vehicles are unlikely to trigger tips and cues. We found that stopping with just the shape-first list of candidate vehicle locations, and then solving a weighted, maximal independent vertex set problem to resolve conflicts among candidate vehicle locations, often correctly traces the vehicles in an OIRDS scene.

99 GENERAL AND MISCELLANEOUS↗

On the equivalence of some spectral sequences for Serre fibrations

Several different constructions of a spectral sequence for a Serre fibration {pi}:E{yields}B over a compact simply connected manifold B are considered in this paper. Namely, we consider the spectral sequence for the minimal model ({Lambda}Vx{Lambda}W,d) of the fibration, along with the spectral sequences arising from the Cech filtration in the complexes C*(U,A*{sub PL}({pi}{sup -1}(U))) and C*(U,S*({pi}{sup -1}(U))), where U=(U) is a covering of the base B. It is known that all these spectral sequences have the same terms E{sub 2}*{sup ,}*=H*(X)xH{sup *}(F) and converge to the cohomology of the total space E. A new natural isomorphism of these spectral sequences is constructed in every term E{sub r} with r{>=}2. It is also proved that in the case of a smooth locally trivial fibration these spectral sequences are isomorphic to the spectral sequences of the complex of smooth forms {Omega}*(E) and of the Cech-de Rham complex. It is therefore established that all these constructions give the same spectral sequence, starting from the E{sub 2} term. Bibliography: 9 titles.

97 MATHEMATICS AND COMPUTING↗