Search NASA⌕ Search

SEARCH · Search NASA

Results for “Optimal sizing method”

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 613 records · Page 34
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Project Title: Demonstration High Temperature Superconducting NonPlanar Stellarator Magnet with Advanced Manufactured Assemblies

This is the final report for the project “Demonstration High Temperature Superconducting Non- Planar Stellarator Magnet with Advanced Manufactured Assemblies”, funded by DOE, and performed by Type One Energy from September, 2020, to March 2024 involving the Fusion Technology Institute at the University of Wisconsin–Madison, the Plasma Science and Fusion Center (PSFC) at the Massachusetts Institute of Technology (MIT) and Commonwealth Fusion Systems (CFS) to design and fabricate the first non-planar HTS (REBCO) coil for a high-field stellarator based on the SPARC tokamak’s VIPER cable concept. Stellarators at high fields make high-temperature superconducting magnets necessary for a compact fusion device. But the asymmetric and non-planar nature of its components, especially the magnets make it difficult for scalable producibility. To address these challenges, two promising technologies have emerged: advanced manufacturing (AM) for the supporting plates for forming the magnets, and high-temperature superconducting (HTS) cables inside the plates. AM has advanced enough to produce stellarator components with the necessary geometric complexity, size, and the precision, leading to potentially significant reductions in production time, cost, and waste. The cost of HTS tape has decreased dramatically, and progress in HTS planar magnet development has reached a point where it can be proposed for application to complex 3D non-planar magnets. The main objective of this project is to develop, demonstrate and pre-commercialize a novel, non-planar HTS coil shape that remains superconducting to achieve production scalable reductions in time and cost and performance. The proposed technology is based on the novel concept of a precision sub-scale HTS nonplanar coil assembly. This project focuses on the design, fabrication, material optimization of cable design, and validation and demonstration of the high current carrying capability of superconducting magnets and their support in a complex 3D shape needed for application to stellarator magnetic plasma confinement. The specific objectives of this research program include: (1) The successful application of metal AM to build a precision sub-scale HTS nonplanar coil, (2) An HTS cable and cross-section design that can conform to the required nonplanar coil shape (bend radii as tight as 10-cm) and remains superconducting at an engineering current density of 1.35 kA/cm 2 at 77 K and 1 tesla at the conductor (5 kA in the cable). To achieve the above challenging goals, we have formed a multidisciplinary research team consisting of members from Type One Energy and UW-Madison, MIT PSFC and CFS with complementary skills and strong facilities. The team worked collaboratively on fundamental and applied research on the following three major technical areas: (1) Design, fabrication, and optimization of non-planar HTS Cable The ultimate goal of the project is to determine if commercial REBCO tapes and additive manufacturing can be used to fabricate high field (≥ 10T) non-planar coils with tight bending radii (≃ 100mm) and with a degradation of the critical current (Ic) smaller than 20% with respect to the expected performance. We started with shorter length cable to evaluate the scalability of the production process and eventually reached multiple turns for higher magnetic fields. Our findings suggest that a stellarator coil system of a relevant size, characterized by its asymmetric and non-planar components, can be fabricated using a formed cable in plate method. This system can be simulated using a large-scale modeling approach. The use of hybrid modeling 3 techniques will be pivotal in reducing the complexity of the model and in assessing expected performance in designs. (2) Modeling and simulation of the non-planar HTS Cable Multiphysics simulations are performed using the commercial software and are carried out in self-field conditions, involving 2D and 3D models and twisted around one slot of twist-pitched VIPER cable. Multiphysics simulations are mainly focused on the coil for the critical current evaluation, the magnetic field map, self-Lorentz forces and mechanical, and magnetothermal behavior and the quench dynamics. The detailed model and prediction of the superconducting performance of a stellarator-relevant demonstration cable from numerical simulations supports the results from the actual testing backing the results. A detailed description and results are provided in the later sections. (3) Design, fabrication, and optimization of support for the non-planar HTS Cable The team developed an additive manufactured (AM) coil positioning plate that formed into the required non-planar geometry (with bend radii as tight as 10-cm) and to acceptable tolerances required for a stellarator magnet: (+0.25-mm from ideal on dimensions of coil positioning plates and up to +1-mm from ideal for position of wound coil). The plate materials is also included in this selection process from fabrication and 3D printing perspective and commensurate with eventual application to a fusion reactor. From the cost effectiveness point of view, the HTS coil and plate has the potential to cost less than that made in conventional methods with less waste (<75% waste) reducing time (<50%) and cost (<50%), especially as the AM field matures. The application of advanced manufacturing in the construction of the support plates will also lead to cost reduction, as the cables can be easily replaced, thereby making the assembly modular. With such high primary cost and time savings, high current densities and magnetic field, the funded R&D work has validated the designs, proven the feasibility, and characterized the performance of the HTS coil and plate assembly, paving the way for a relevant-size stellarator coil system.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2020

NWPEsSe: an Adaptive-Learning Global Optimization Algorithm for Nanosized Cluster Systems

Global optimization constitutes an important and fundamental problem in theoretical studies in many chemical fields, such as catalysis, materials or separations problems. In this paper, a novel algorithm has been developed for the global optimization of large systems including neat and ligated clusters in gas phase, and supported clusters in periodic boundary conditions. The method is based on an updated artificial bee colony (ABC) algorithm method, that allows for adaptive-learning during the search process. The new algorithm is tested against four classes of systems of diverse chemical nature: gas phase Au_55, ligated Au_8^(2+), Au_8 supported on graphene oxide and defected rutile, and a large cluster assembly ?[Co?_6 Te_8 (PEt_3 )_6][C_60 ]_n, with sizes ranging between 1 to 3 nm and containing up to 1300 atoms. Reliable global minima (GMs) are obtained for all cases, either confirming published data or reporting new lower energy structures. The algorithm and interface to other codes in the form of an independent program, Northwest Potential Energy Search Engine (NWPEsSe), is freely available and it provides a powerful and efficient approach for global optimization of nanosized cluster systems. The work described in this publication was performed at Pacific Northwest National Laboratory (PNNL), which is operated by Battelle for the United States Department of Energy (DOE) under Contract DE-AC05-76RL0180. J. Z. and V.-A. G. acknowledge support from DOE, Office of Science, Office of Basic Energy Sci-ences, Chemical, Geological and Biological Sciences Division and computing resources from PNNL’s Research Computing Facility and the National Energy Research Scientific Computing Center.

Zhang, Jun↗
DOE OSTI2023

Exploring temporal community evolution: algorithmic approaches and parallel optimization for dynamic community detection

Abstract Dynamic (temporal) graphs are a convenient mathematical abstraction for many practical complex systems including social contacts, business transactions, and computer communications. Community discovery is an extensively used graph analysis kernel with rich literature for static graphs. However, community discovery in a dynamic setting is challenging for two specific reasons. Firstly, the notion of temporal community lacks a widely accepted formalization, and only limited work exists on understanding how communities emerge over time. Secondly, the added temporal dimension along with the sheer size of modern graph data necessitates new scalable algorithms. In this paper, we investigate how communities evolve over time based on several graph metrics under a temporal formalization. We compare six different algorithmic approaches for dynamic community detection for their quality and runtime. We identify that a vertex-centric (local) optimization method works as efficiently as the classical modularity-based methods. To its advantage, such local computation allows for the efficient design of parallel algorithms without incurring a significant parallel overhead. Based on this insight, we design a shared-memory parallel algorithm DyComPar , which demonstrates between 4 and 18 fold speed-up on a multi-core machine with 20 threads, for several real-world and synthetic graphs from different domains.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Reduced scaling formulation of CASPT2 analytical gradients using the supporting subspace method

We present a reduced scaling and exact reformulation of state specific complete active space second-order perturbation (CASPT2) analytical gradients in terms of the MP2 and Fock derivatives using the supporting subspace method. This work follows naturally from the supporting subspace formulation of the CASPT2 energy in terms of the MP2 energy using dressed orbitals and Fock builds. For a given active space configuration, the terms corresponding to the MP2-gradient can be evaluated with O(N5) operations, while the rest of the calculations can be computed with O(N3) operations using Fock builds, Fock gradients, and linear algebra. When tensor-hyper-contraction is applied simultaneously, the computational cost can be further reduced to O(N4) for a fixed active space size. The new formulation enables efficient implementation of CASPT2 analytical gradients by leveraging the existing graphical processing unit (GPU)-based MP2 and Fock routines. We present benchmark results that demonstrate the accuracy and performance of the new method. Example applications of the new method in ab initio molecular dynamics simulation and constrained geometry optimization are given.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2018

Optimizing Tensor Contractions in CCSD(T) for Efficient Execution on GPUs

Tensor contractions are higher dimensional analogs of matrix multiplications, used in many computational contexts such as high order models in quantum chemistry, deep learning, nite element methods etc. In contrast to the wide availability of high-performance libraries for matrix multiplication on GPUs, the same is not true for tensor contractions. In this paper, we address the optimization of a set of symmetrized tensor contractions that form the computational bottleneck in the CCSD(T) coupled-cluster method in computational chemistry suites like NWChem. Some of the challenges in optimizing tensor contractions that arise in practice from the variety of dimensionalities and shapes for tensors include effective mapping of the high-dimensional iteration space to threads, choice of data buffering in shared-memory and registers, and tile sizes for multi-level tiling. Furthermore, in the case of symmetrized tensor contractions in CCSD(T), it is also a challenge to fuse contractions to reduce data movement cost by exploiting reuse of intermediate tensors. In this paper, we developed an efficient GPU implementation of the tensor contractions in CCSD(T) using shared-memory buffering, register tiling, loop fusion and register transpose. Experimental results demonstrate significant improvement over the current state-of-the-art.

Kim, Jinsung↗
DOE OSTI2025

Optimization of a Mixed Fleet of Aerial Drones for Medical Supplies: A Case Study of Blood Delivery Logistics

Aerial drones have emerged as an innovative solution for faster transportation of time-sensitive items (e.g., emergency medical supplies), potentially reducing the transmission of contagious diseases and enhancing healthcare availability through contactless autonomous delivery. We study fleet sizing and efficient scheduling of a mixed fleet of drones for delivering time-sensitive medical items having distinct release and due times to minimize the required fleet size and fleet composition, the required number of additional batteries, and the total energy consumption. We continuously track the remaining battery energy of drones to determine the optimal timing for battery replacement, rather than replacing the battery at each node. Using actual drone flight test data, we employed a machine learning (ML) method to estimate the energy consumption of different drone types during flight segments for different operating parameters. We present a novel mixed-integer programming model to efficiently formulate the problem that integrates the estimated energy consumption functions from ML. We propose a new greedy heuristic (GH) algorithm and a customized genetic algorithm (GA) for solving large-scale instances of this problem faster. Results demonstrate that the GH algorithm is substantially faster than the accelerated CPLEX and the GA, while sacrificing the solution quality by a small amount. Results based on an actual blood sample delivery case study from Pendleton, Oregon, United States, show that using a mixed fleet of drones reduces the total cost and total energy consumption up to 18.18% and 28.7%, respectively, compared to using a homogeneous fleet.

29 - ENERGY PLANNING, POLICY AND ECONOMY↗
DOE OSTI2025

Computational Algorithms for Unit Commitment with AC Power Flows (Final Report)

Security-constrained unit commitment (SCUC) is a key component in power system operations. When AC power flow constraints are considered in the SCUC model (AC-SCUC), the problem becomes extremely difficult due to its discrete and non-convex nature, as described in “Grid Optimization Competition Challenge 3 Problem Formulation (GOCC)”. There are four main challenges: (i) Discrete decisions regarding unit online/offline status and start-up/shut-down procedures for every single unit. The number of discrete decision variables increases considerably when a system integrates multiple generators; (ii) Configuration-based combined-cycle formulations, and multi-commodity models that include ramping products, spin/non-spin products, and regulation up/down products. The combined-cycle units introduce additional discrete decision variables and auxiliary service products further complicate the model by connecting multi-commodity products’ continuous and discrete variables; (iii) SCUC models with AC power flow constraints are far more complex due to massive bilinear terms in the large-scale nonlinear power balance equations. The nonlinear power balance equations are further complicated by the discrete step control variables of shunts; (iv) N − 1 contingency analysis. The size of the model increases linearly with the number of contingencies considered, greatly increasing the size of the optimization model. Accordingly, there is an emergent need to develop a robust algorithm capable of deriving a high-quality solution in a short time and passing through contingency tests simultaneously. In this project, we explore innovative techniques to address this challenging problem by integrating advanced polyhedral theory, approximation methods, relaxation strategies, decomposition techniques, and parallel computing. Each technique approaches the problem from a different perspective, leveraging its specific strengths to tackle distinct challenges. Each individual method has demonstrated its effectiveness in the PI’s previous research. Their integration is expected to significantly reduce the computational time required to solve the proposed complex problem. Successful completion of this project has the potential to transform the industry by enhancing optimization solvers capable of handling large-scale day-ahead energy market clearing models within strict time constraints, while incorporating AC power flow constraints. This advancement will lead to reduced overall generation costs and, consequently, increased social welfare.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
NASA NTRS1988

Development and validation of an advanced low-order panel method

A low-order potential-flow panel code, PMARC, for modeling complex three-dimensional geometries, is currently being developed at NASA Ames Research Center. The PMARC code was derived from a code named VSAERO that was developed for Ames Research Center by Analytical Methods, Inc. In addition to modeling potential flow over three-dimensional geometries, the present version of PMARC includes several advanced features such as an internal flow model, a simple jet wake model, and a time-stepping wake model. Data management within the code was optimized by the use of adjustable size arrays for rapidly changing the size capability of the code, reorganization of the output file and adopting a new plot file format. Preliminary versions of a geometry preprocessor and a geometry/aerodynamic data postprocessor are also available for use with PMARC. Several test cases are discussed to highlight the capabilities of the internal flow model, the jet wake model, and the time-stepping wake model.

Ashby, Dale L.↗
DOE OSTI2020

OPTIMAL CONTROL AND ENERGY-SAVING ANALYSIS OF COMMON PRESSURE RAIL ARCHITECTURES: HHEA & STEAM

In recent years several novel hydraulic architectures have been proposed with the intention of significantly increasing system efficiency. Two of these architectures, Steigerung der Energieeffizienz in der Arbeitshydraulik mobiler Arbeitsmaschinen (STEAM), and the Hybrid Hydraulic-Electric Architecture (HHEA), use a system of multiple common pressure rails (CPRs) to serve the multiple degrees-of-freedom of the machine. The key difference is that STEAM throttles hydraulic power from these rails while HHEA combines electric and hydraulic power to meet actuator demands. As a throttle-less architecture, HHEA is expected to save more energy than STEAM at the expense of added complexity. Therefore, it is useful to quantify this additional energy saving. Both systems have discrete operational choices corresponding to how the CPRs are utilized for each actuator. It is necessary to determine optimal operation for each of these architectures for analysis and fair comparison. Techniques for optimal operation of the HHEA have been developed previously from the Langrange multiplier method. Applying the same optimal control method to STEAM encountered some technical challenge leading to the optimal control algorithm not being able to satisfy certain constraints. The issue is analyzed and solved by adding noise to the optimization. Using this proposed algorithm, case studies are performed to compare the energy-saving potentials of STEAM and HHEA for two sizes of excavators and a wheel-loader performing representative duty cycles. The baseline is a standard load-sensing architecture. Results show that STEAM and HHEA can reduce energy consumption between 35-65% and 50-80% respectively

24 POWER TRANSMISSION AND DISTRIBUTION↗
NASA NTRSDate not supplied

Improving Computational Efficiency of Prognostics Algorithms in Resource-Constrained Settings

The field of prognostics and health management provides quantitative methods for monitoring and predicting the health of physical systems. Prognostics algorithms are useful in that they can be employed to assess the current state of a system, propagate the system state throughout time, and predict potential anomalies or failures that may occur. However, effective prognosis can be challenging to achieve in resource-constrained settings due to computational limitations and high computational latency, leading to obsolete predictions. Thus, computationally efficient and accurate algorithms are necessary for some prognostics applications. In this work, we implement three new algorithmic approaches to prediction (sampling methods, variable prediction time step, variable prediction sample size) with the goal of improving computational efficiency while minimizing decrease in model accuracy. To quantitatively analyze our results, we examine a use-case of degradation of a Lithium-ion battery. Notably, through this work it was found that none of the sampling approaches had a significant impact on computational efficiency or model accuracy in predicting EOD of the battery. However, our results show that prediction accuracy is highly dependent on the time step used, and that an appropriate time step can optimize both model accuracy and simulation efficiency. Finally, implementing a variable sample size also affected prediction, and our results show that tuning both the magnitude and timing of the sample size adjustment in an application-specific manner may prove useful in some applications. Taken together, our findings highlight the challenge of performing prognostics in resource-constrained settings, and illustrate the potential of developing new prediction algorithms to improve computational efficiency of prognosis.

Prognostics↗
NASA NTRS2016

Optimizing Mars Sphere of Influence Maneuvers for NASA's Evolvable Mars Campaign

NASA's Human Spaceflight Architecture Team is refining human exploration architectures that will extend human presence to the Martian surface. For both Mars orbital and surface missions, NASA's Evolvable Mars Campaign assumes that cargo and crew can be delivered repeatedly to the same destination. Up to this point, interplanetary trajectories have been optimized to minimize the total propulsive requirements of the in-space transportation systems, while the pre-deployed assets and surface systems are optimized to minimize their respective propulsive requirements separate from the in-space transportation system. There is a need to investigate the coupled problem of optimizing the interplanetary trajectory and optimizing the maneuvers within Mars's sphere of influence. This paper provides a description of the ongoing method development, analysis and initial results of the effort to resolve the discontinuity between the interplanetary trajectory and the Mars sphere of influence trajectories. Assessment of Phobos and Deimos orbital missions shows the in-space transportation and crew taxi allocations are adequate for missions in the 2030s. Because the surface site has yet to be selected, the transportation elements must be sized to provide enough capability to provide surface access to all landing sites under consideration. Analysis shows access to sites from elliptical parking orbits with a lander that is designed for sub-periapsis landing location is either infeasible or requires expensive orbital maneuvers for many latitude ranges. In this case the locus of potential arrival perigee vectors identifies the potential maximum north or south latitudes accessible. Higher arrival velocities can decrease reorientation costs and increase landing site availability. Utilizing hyperbolic arrival and departure vectors in the optimization scheme will increase transportation site accessibility and provide more optimal solutions.

Merrill, Raymond G.↗
DOE OSTI2021

Optimization models for integrated biorefinery operations

Variations of physical and chemical characteristics of biomass lead to an uneven flow of biomass in a biorefinery, which reduces equipment utilization and increases operational costs. Uncertainty of biomass supply and high processing costs increase the risk of investing in the US’s cellulosic biofuel industry. We propose a stochastic programming model to streamline processes within a biorefinery. A chance constraint models system’s reliability requirement that the reactor is operating at a high utilization rate given uncertain biomass moisture content, particle size distribution, and equipment failure. The model identifies operating conditions of equipment and inventory level to maintain a continuous flow of biomass to the reactor. Furthermore, the sample average approximation method approximates the chance constraint and a bisection search-based heuristic solves this approximation. A case study is developed using real-life data collected at Idaho National Laboratory’s biomass processing facility. An extensive computational analysis indicates that sequencing of biomass bales based on moisture level, increasing storage capacity, and managing particle size distribution, increases utilization of the reactor and reduces operational costs.

09 BIOMASS FUELS↗
DOE OSTI2026

Data Summarization and Inference at Scale

This is the final report for the DOE ASCR grant SC-0022260, Data Summarization and Inference at Scale, PI: Alex Pothen, Purdue University. The goal of the project was to solve data-intensive and compute-intensive problems in the physical sciences, engineering, information science, data science, etc. by designing and implementing new algorithms that could work with a subset of the data. The four subgoals were: (a) The solution of problems where the data is too large to be stored in the memory of a computer. In this streaming model of computation, the data arrives as a stream of elements to the computer, each element is processed as it arrives, and a decision is made to discard the data or to store it; only a small subset of the data proportional to the size of the output solution is stored, and when all the data has been streamed, a solution to the problem is computed from the stored subset. (b) The use of machine learning methods to compute solutions to data-intensive problems. The use of GPUs is critical to obtain high performance on machine learning tasks, but their memory sizes are smaller relative to that of CPUs. For large-scale problems, the data is sampled many times, and small samples are used with repetition, for robustness, to compute solutions to inference tasks. This sampling reduces the memory required to solve the problem, but attention is needed to avoid slow convergence to the solutions, and reduced accuracy of inference. We propose submodular optimization, Large Language Models, and physics-informed neural networks to enable GPU computations here. (c) Modeling and visualization of high-dimensional data using interpretable features. Clinical proteomic data sets from immunology for the detection of cancer and other diseases are temporal and high-dimensional, and algorithms for visualizing these data sets using clinically interpretable features are lacking. We propose methods that compute distances based on the optimal transportation problem and graph edit distances to address this problem. We also propose the use of optimal transport-based distances, spatial statistics, and network structure to classify image data sets, We apply these algorithms to electron micrographs of the peripheral nervous system in the digestive tract. (d) The design of data-intensive algorithms on emerging architectures, specifically, noisy, intermediate-scale quantum (NISQ) devices. Quantum computers offer the possibility of exploring large solution spaces due to the principle of superposition, but current quantum computers are limited by few qubits, short coherence times due to noise, poor interconections among the qubits, etc. We propose the use of the divide and conquer paradigm to solve large-scale problems, wherein collections of small subproblems are solved on the quantum devices, and the solutions to the subproblems are integrated into a solution for the original problem on a classical computer.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

An in-depth field validation of “DUSST”: A novel low-maintenance soiling measurement device

This study presents indoor and field validation results for two versions of the “DUSST” optical soiling sensor, intended to be a low-cost and low-maintenance device for measuring photovoltaic soiling losses. Indoor testing covers irradiance calibration and temperature dependencies, which are necessary to achieve high accuracy, low uncertainty field measurements. Field testing includes an array of different environments including Saudi Arabia, California, Utah, and Colorado. DUSST versions include a configuration with a 530-nm light emitting diode (LED) (discussed in previous work) and a unit with seven white LEDs and a polycarbonate collimating optic. The new design increases light intensity fivefold and demonstrates a single linear calibration coefficient is effective to measure soiling losses as high as 75%. Field data from Utah and California demonstrate that daily soiling loss measurements and soiling rate calculations closely match both reference cell and full-size module measurements of soiling losses and soiling rates. Corrective methods employed on the Utah DUSST sensor suggest that it is possible to achieve measurement errors as low as ±0.1% at two standard deviations. Field data from both Colorado and Saudi Arabia demonstrate that LED lens soiling can occur and that further design optimizations are needed. The lesson learned from all the field deployment locations suggests directions for future design improvements.

14 SOLAR ENERGY↗
DOE OSTI2020

Achieving high volumetric EDLC carbons via hydrothermal carbonization and cyclic activation

A novel activation method involving hydrothermal carbonization (HTC) and a pressure-induced low temperature oxidation has been demonstrated for cellulose derived HTC char by using hydrogen peroxide as an active di-oxygen source. The optimized porosity versus gravimetric capacitance results from cellulose derived HTC char synthesized at 220 °C. Almost homogeneous and small particle size micro-ellipse/sphere, relatively high surface area and narrow pore size distributions lead to a high bulk density, i.e. 0.73 g cm -3 , of coating type electrodes, which is much denser than those manufactured from steam activated carbons for supercapacitor industry, i.e., 0.52 g cm -3 . The resulting carbon prepared herein achieves a relatively high volumetric capacitance in an organic electrolyte-based supercapacitor reaching a competitive value of industrial system with the features of environment friendly, cost-effective as well as high yield, and less energy consumption.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2018

On the Calculation of the Debye Temperature and Crystal–Liquid Phase Transition Temperature of a Binary Substitution Alloy

A method of estimating the interatomic pair interaction potential parameters for a binary substitution alloy with consideration for the deviation of its lattice parameter from the Vegard law is proposed. This method is used as a basis to calculate the Debye temperature and Grüneisen parameters of a SiGe alloy. It is shown that all these function nonlinearly variate with a change in the germanium concentration. Based on this technique and Lindemann's melting criterion, a method for calculating the liquidus and solidus temperatures of a disordered substitution alloy is proposed. The method is tested on the SiGe alloy and demonstrates good agreement with experimental data. It is shown that when the size of a nanocrystal of a solid substitution solution decreases, the difference between the liquidus and solidus temperatures decreases the more, the more noticeably the nanocrystal shape is deflected from the most energetically optimal shape.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2021

Optimal dimensionality selection for independent component analysis of transcriptomic data

Independent component analysis is an unsupervised machine learning algorithm that separates a set of mixed signals into a set of statistically independent source signals. Applied to high-quality gene expression datasets, independent component analysis effectively reveals both the source signals of the transcriptome as co-regulated gene sets, and the activity levels of the underlying regulators across diverse experimental conditions. Two major variables that affect the final gene sets are the diversity of the expression profiles contained in the underlying data, and the user-defined number of independent components, or dimensionality, to compute. Availability of high-quality transcriptomic datasets has grown exponentially as high-throughput technologies have advanced; however, optimal dimensionality selection remains an open question. We computed independent components across a range of dimensionalities for four gene expression datasets with varying dimensions (both in terms of number of genes and number of samples). We computed the correlation between independent components across different dimensionalities to understand how the overall structure evolves as the number of user-defined components increases. We then measured how well the resulting gene clusters reflected known regulatory mechanisms, and developed a set of metrics to assess the accuracy of the decomposition at a given dimension. We found that over-decomposition results in many independent components dominated by a single gene, whereas under-decomposition results in independent components that poorly capture the known regulatory structure. From these results, we developed a new method, called OptICA, for finding the optimal dimensionality that controls for both over- and under-decomposition. Specifically, OptICA selects the highest dimension that produces a low number of components that are dominated by a single gene. We show that OptICA outperforms two previously proposed methods for selecting the number of independent components across four transcriptomic databases of varying sizes. OptICA avoids both over-decomposition and under-decomposition of transcriptomic datasets resulting in the best representation of the organism’s underlying transcriptional regulatory network.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
NASA NTRS1975

A random search algorithm for laboratory computers

The small laboratory computer is ideal for experimental control and data acquisition. Postexperimental data processing is often performed on large computers because of the availability of sophisticated programs, but costs and data compatibility are negative factors. Parameter optimization can be accomplished on the small computer, offering ease of programming, data compatibility, and low cost. A previously proposed random-search algorithm ('random creep') was found to be very slow in convergence. A method is proposed (the 'random leap' algorithm) which starts in a global search mode and automatically adjusts step size to speed convergence. A FORTRAN executive program for the random-leap algorithm is presented which calls a user-supplied function subroutine. An example of a function subroutine is given which calculates maximum-likelihood estimates of receiver operating-characteristic parameters from binary response data. Other applications in parameter estimation, generalized least squares, and matrix inversion are discussed.

Curry, R. E.↗