Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “random networks”

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 145 records · Page 8

Machine learning results and code

Results for all the Four MLP-NN, RF, XGBR, and RF algorithms for each of geophysical array`s and machine learning python code is provided.

58 GEOSCIENCES↗

The structure of boron in boron fibres

The structure of noncrystalline, chemically vapour-deposited boron fibres was investigated by computer modelling the experimentally obtained X-ray diffraction patterns. The diffraction patterns from the models were computed using the Debye scattering equation. The modelling was done utilizing the minimum nearest-neighbour distance, the density of the model, and the broadening and relative intensity of the various peaks as boundary conditions. The results suggest that the fibres consist of a continuous network of randomly oriented regions of local atomic order, about 2 nm in diameter, containing boron atoms arranged in icosahedra. Approximately half of these regions have a tetragonal structure and the remaining half a distorted rhombohedral structure. The model also indicates the presence of many partial icosahedra and loose atoms not associated with any icosahedra. The partial icosahedra and loose atoms indicated in the present model are in agreement with the relaxing sub-units which have been suggested to explain the anelastic behavior of fibre boron and the loosely bound boron atoms which have been postulated to explain the strengthening mechanism in boron fibres during thermal treatment.

Bhardwaj, J.↗

Characterization of low thermal conductivity PAN-based carbon fibers

The microstructure and surface chemistry of eight low thermal conductivity (LTC) PAN-based carbon fibers were determined and compared with PAN-based fibers heat treated to higher temperatures. Based on wide-angle x ray diffraction, the LTC PAN fibers all appear to have a similar turbostratic structure with large 002 d-spacings, small crystallite sizes, and moderate preferred orientation. Limited small-angle x ray scattering (SAXS) results indicate that, with the exception of LTC fibers made by BASF, the LTC fibers do not have well developed pores. Transmission electron microscopy shows that the texture of the two LTC PAN-based fibers studied (Amoco T350/23X and /25X) consists of multiple sets of parallel, wavy, bent layers that interweave with each other forming a complex three dimensional network oriented randomly around the fiber axis. X ray photoelectron spectroscopy (XPS) analysis finds correlations between heat treated temperatures and the surface composition chemistry of the carbon fiber samples.

Katzman, Howard A.↗

Structures with high number density of carbon nanotubes and 3-dimensional distribution

A composite is described having a three dimensional distribution of carbon nanotubes. The critical aspect of such composites is a nonwoven network of randomly oriented fibers connected at their junctions to afford macropores in the spaces between the fibers. A variety of fibers may be employed, including metallic fibers, and especially nickel fibers. The composite has quite desirable properties for cold field electron emission applications, such as a relatively low turn-on electric field, high electric field enhancement factors, and high current densities. The composites of this invention also show favorable properties for other an electrode applications. Several methods, which also have general application in carbon nanotube production, of preparing these composites are described and employ a liquid feedstock of oxyhydrocarbons as carbon nanotube precursors.

Chen, Zheng↗

Exploring Connectivity in Sequence Space of Functional RNA

Emergence of replicable genetic molecules was one of the marking points in the origin of life, evolution of which can be conceptualized as a walk through the space of all possible sequences. A theoretical concept of fitness landscape helps to understand evolutionary processes through assigning a value of fitness to each genotype. Then, evolution of a phenotype is viewed as a series of consecutive, single-point mutations. Natural selection biases evolution toward peaks of high fitness and away from valleys of low fitness. whereas neutral drift occurs in the sequence space without direction as mutations are introduced at random. Large networks of neutral or near-neutral mutations on a fitness landscape, especially for sufficiently long genomes, are possible or even inevitable. Their detection in experiments, however, has been elusive. Although a few near-neutral evolutionary pathways have been found, recent experimental evidence indicates landscapes consist of largely isolated islands. The generality of these results, however, is not clear, as the genome length or the fraction of functional molecules in the genotypic space might have been insufficient for the emergence of large, neutral networks. Thorough investigation on the structure of the fitness landscape is essential to understand the mechanisms of evolution of early genomes. RNA molecules are commonly assumed to play the pivotal role in the origin of genetic systems. They are widely believed to be early, if not the earliest, genetic and catalytic molecules, with abundant biochemical activities as aptamers and ribozymes, i.e. RNA molecules capable, respectively, to bind small molecules or catalyze chemical reactions. Here, we present results of our recent studies on the structure of the sequence space of RNA ligase ribozymes selected through in vitro evolution. Several hundred thousands of sequences active to a different degree were obtained by way of deep sequencing. Analysis of these sequences revealed several large clusters defined such that every sequence in a cluster can be reached from any other sequence in the same cluster through a series of single point mutations. Sequences in a single cluster appear to adopt more than one secondary structure. The mechanism of refolding within a single cluster was examined. To shed light on possible evolutionary paths in the space of ribozymes, the connectivity between clusters was investigated. The effect of length of RNA molecules on the structure of the fitness landscape and possible evolutionary paths was examined by way of comparing functional sequences of 20 and 80 nucleobases in length. It was found that sequences of different lengths shared secondary structure motifs that were presumed responsible for catalytic activity, with increasing complexity and global structural rearrangements emerging in longer molecules.

Wei, Chenyu↗

Using Deep Learning to Automate Inference of Meteoroid Pre-Entry Properties

Properly assessing the asteroid threat depends on the knowledge of asteroid pre-entry parameters, such as size, velocity, mass, density, and strength. Although a vast number of possible bodies to study exist, such characterization of asteroid populations is currently limited by substantial costs associated with space rendezvous missions and rare meteorite findings. As asteroids fragment, ablate, and decelerate in the atmosphere, they emit light detectable by ground-based and space-borne instruments. Earth’s atmosphere, thus, becomes an accessible laboratory that enables impactor risk assessments by facilitating inference of the pre-entry parameters. These asteroid pre-entry conditions are typically deduced by modeling the entry and breakup physics that best reproduce the observed light or energy deposition curve. However, this process requires extensive manual trial-and-error of uncertain modeling parameters. Automating meteor modeling and inference would improve property distributions used in risk assessments and enable population characterization as more light curves become more readily available through the presence of space assets and ground-based camera networks. We previously developed a genetic algorithm to automate meteor modeling by using the fragment-cloud model (FCM) to search for the values of the FCM input parameters (e.g., diameter) that generate energy deposition profiles that match the observed one. Now, we apply deep learning to infer asteroid diameter, velocity, and density from observed energy deposition curves. We trained and tested our neural network models with synthetic energy deposition curves modeled using the FCM rubble pile implementation. We present an application of a 1D convolutional neural network and compare its performance to other attempted regressors and machine learning techniques, such as a fully connected neural network and Random Forest regression, to demonstrate its capabilities. We validate our model weights and approach using the Chelyabinsk, Tagish Lake, Benešov, Košice, and Lost City meteors.

Tarano, Ana Maria↗

Multiscale Modeling of Fracture Strength in Fibrous Thermal Protection System Materials

This work presents a multiscale modeling approach to predict the fracture strength of fibrous Thermal Protection System (TPS) materials. The model assumes that system failure is initiated at the joints between individual fibers. We investigated three distinct TPS compositions: amorphous silica, alumina and aluminosilicate fibers. Molecular dynamics (MD) simulations were employed to determine the fracture strength values of these fiber joints for both material systems. These fracture strength values were then integrated into simulations of 3D randomly populated fiber structures, where tensile load transfer occurs through the fiber joints. These microscale properties are upscaled through a renormalization approach [1] to predict macroscale tensile strength of 3D random fiber networks, accounting for joint-dominated failure and effective load-bearing area. The study concludes by demonstrating the resulting strength variation as a function of material composition, fiber density, and morphology. We also show validation of results by comparing them against explicit fiber finite element (FE) modeling [2] where fiber joint fracture is represented by cohesive elements.

Jaehyun Cho↗

Compositions having reduced thermal conductivities and methods of making the same

The present disclosure relates to a composition that includes a film having a network of randomly aligned carbon nanotubes, where the carbon nanotubes have an average diameter between about 0.6 nm and about 2.0 nm and the carbon nanotubes form bundles having an average diameter between about 3 nm and about 50 nm. In addition, the composition is characterized by a power factor α 2 σ between 1 μW/mK 2 and about 3500 μW/mK 2 and by ZT=α 2 σT/k between about 0.02 and about 2.0 over a temperature range between about 100 K and about 500 K.

Blackburn, Jeffrey Lee↗

Formation of Disordered Cocontinuous Phases by Randomly Linked Star Copolymers

Cocontinuous polymeric nanostructures have garnered significant interest due to their ability to combine different properties of two separate polymer domains. Randomly linked copolymer networks have proven to be especially robust for formation of disordered cocontinuous phases across wide composition ranges (≈30 wt % or more). While theoretical treatments of microphase-separated networks have focused primarily on the role of random elastic forces imposed on the self-assembled nanostructures by virtue of the network architecture, experimental studies seeking to disentangle these contributions from other potential effects, such as dispersity in preferred interfacial curvatures, have been scarce. To provide insight into this matter, we here study the self-assembly of randomly linked star copolymers (RSCs), constructed by linking premade polymer arms of polystyrene (PS) and poly(d,l-lactide) (PLA) using 3, 4, and 6-functional connectors. This architecture yields similar distributions of preferred curvature as networks made using corresponding difunctional strands, but lacks the elastic forces imposed by a network architecture. Gravimetry and small-angle X-ray scattering, coupled with scanning electron microscopy, were performed to identify the percolation of PS/PLA RSCs. Remarkably, the 4-arm RSC system exhibited a disordered cocontinuous window of ≈25 wt %, indicating that dispersity in preferred curvature can in some cases be sufficient to robustly drive formation of this morphology. However, the other RSC architectures showed smaller cocontinuous ranges, which we interpret in terms of the influence of homopolymer stars in the 3-arm case and the narrower distribution of preferred interfacial curvatures in the 6-arm case. Finally, thin layers of interconnected porous PS were achieved by solution-processing, suggesting that RSCs have the potential to serve as a robust and easily processable cocontinuous polymeric nanomaterials in both bulk and membrane geometries.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Using the Metropolis algorithm to explore the loss surface of a recurrent neural network

In the limit of small trial moves the Metropolis Monte Carlo algorithm is equivalent to gradient descent on the energy function in the presence of Gaussian white noise. This observation was originally used to demonstrate a correspondence between Metropolis Monte Carlo moves of model molecules and overdamped Langevin dynamics, but it also applies in the context of training a neural network: making small random changes to the weights of a neural network, accepted with the Metropolis probability, with the loss function playing the role of energy, has the same effect as training by explicit gradient descent in the presence of Gaussian white noise. We explore this correspondence in the context of a simple recurrent neural network. We also explore regimes in which this correspondence breaks down, where the gradient of the loss function becomes very large or small. In these regimes the Metropolis algorithm can still effect training, and so can be used as a probe of the loss function of a neural network in regimes in which gradient descent struggles. We also show that training can be accelerated by making purposely-designed Monte Carlo trial moves of neural-network weights.

Casert, Corneel↗

Testing convolutional neural network based deep learning systems: a statistical metamorphic approach

Machine learning technology spans many areas and today plays a significant role in addressing a wide range of problems in critical domains,i.e., healthcare, autonomous driving, finance, manufacturing, cybersecurity,etc. Metamorphic testing (MT) is considered a simple but very powerful approach in testing such computationally complex systems for which either an oracle is not available or is available but difficult to apply. Conventional metamorphic testing techniques have certain limitations in verifying deep learning-based models (i.e., convolutional neural networks (CNNs)) that have a stochastic nature (because of randomly initializing the network weights) in their training. In this article, we attempt to address this problem by using a statistical metamorphic testing (SMT) technique that does not require software testers to worry about fixing the random seeds (to get deterministic results) to verify the metamorphic relations (MRs). We propose seven MRs combined with different statistical methods to statistically verify whether the program under test adheres to the relation(s) specified in the MR(s). We further use mutation testing techniques to show the usefulness of the proposed approach in the healthcare space and test two CNN-based deep learning models (used for pneumonia detection among patients). The empirical results show that our proposed approach uncovers 85.71% of the implementation faults in the classifiers under test (CUT). Furthermore, we also propose an MRs minimization algorithm for the CUT, thus saving computational costs and organizational testing resources.

Computer Science↗

Microphase Separation of Randomly Linked Branched Polystyrene/Polylactic Acid for Formation of Cocontinuous Nanostructures

Cocontinuous polymeric nanomaterials have gained attention for their ability to preserve distinct properties of constituent microphases within a single material. Randomly linked copolymer networks have shown very wide stability windows for disordered cocontinuous phases (extending over ≈ 30 wt % in composition), but the reliance on a network architecture prevents subsequent solution- or melt-processing. Furthermore, the key factors contributing to cocontinuity have remained unclear. We recently found that randomly linked star copolymers (RSCs) can exhibit a cocontinuous window as wide as 25 wt % in the case of 4-arm stars, suggesting that while a network architecture is not essential for the formation of disordered cocontinuous phases, the presence of random elastic forces in such architectures may indeed facilitate their formation. In addition, the behavior was found to be highly sensitive to arm number, with 6-arm RSCs exhibiting almost no cocontinuous phase. These results raised a key mechanistic question regarding the contribution of random elastic forces, originating from strands that bridge between junctions, in stabilizing disordered cocontinuous phases. In the current study, we synthesized randomly linked branched copolymers (RBCs) of polystyrene (PS) and poly(D,L-lactic acid) (PLA), which represent an intermediate architecture between networks and stars. This approach allows for the introduction of elastic contributions from strands bridging between different junctions, while still maintaining the processability advantages of a non-network architecture. The cocontinuous regions of the PS/PLA RBCs, with varying polymer and linker functionalities (f p and f l , respectively), were characterized by small-angle X-ray scattering, gravimetry, and scanning electron microscopy. We found that the cocontinuous windows of RBCs typically expanded with increasing elastic contributions and exhibited reduced sensitivity to junction-functionality compared to RSCs. Notably, RBCs with f p = 1.50 and f l = 3, which had large molecular weights due to proximity to the gel point, achieved a cocontinuous window of ≈ 34 wt %, which is almost twice as wide as analogous 3-arm RSCs and comparable to randomly linked networks. Leveraging this robust cocontinuity and solution-processability, we fabricated a film of interconnected nanoporous PS.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Neural network based adaptive control of nonlinear plants using random search optimization algorithms

This paper presents a method for utilizing artificial neural networks for direct adaptive control of dynamic systems with poorly known dynamics. The neural network weights (controller gains) are adapted in real time using state measurements and a random search optimization algorithm. The results are demonstrated via simulation using two highly nonlinear systems.

Boussalis, Dhemetrios↗

Benchmarking Bayesian Optimization Frameworks and Acquisition Strategies for Materials Discovery and Autonomous Laboratories

Bayesian optimization (BO) can accelerate materials discovery by guiding expensive experiments toward the most promising processing conditions. We systematically compare five BO surrogate and framework combinations (Gaussian processes in Ax, Gaussian processes and Monte-Carlo neural networks in BayBE, random forests in Lolopy, and tree-structured Parzen (TPE) estimators in Hyperopt) on three benchmarks that mimic common materials design tasks (a discrete solid-electrolyte composition space, a hybrid discrete/continuous laminate-composite design problem solved with micromechanics modeling, and the continuous Ishigami analytic function which is a standard optimization benchmark). Each BO surrogate is paired with posterior mean, probability of improvement, and expected improvement acquisition functions and run for 100 trials from randomized initial samples with uniform random search providing a control. Across five random seeds per setting, BayBE’s Gaussian-process surrogate with expected improvement consistently reached ≥95 % of the known optimum in the fewest evaluations, while Lolopy’s random forest matched or exceeded GP performance on purely categorical or mixed spaces at a higher computational cost. Posterior mean alone often stagnated at local optima, underscoring the need for exploration, whereas probability and expected improvement balanced exploration and exploitation leading to better optimization in fewer trials. Execution times ranged from milliseconds for TPE to minutes for neural-network and random-forest surrogates. These results establish baseline expectations for BO in automated materials laboratories and highlight expected improvement with Gaussian processes as a reliable first choice, with random forests offering a strong alternative when categorical variables dominate. The benchmark suite and code are released to facilitate future surrogate, acquisition, and constraint-handling research in data-driven materials optimization.

Bayesian optimization↗

Efficient Sampling of Complex Interdependent and Multiplex Networks

Efficient sampling of interdependent and multiplex infrastructure networks is critical for effectively applying failure and recovery algorithms in real-world settings, as well as to generate property-preserving reduced-order graph-based ensembles that address topological uncertainties. In this paper, we first explore the performance, i.e. the success in preserving graph properties, of graph sampling algorithms for interdependent and multiplex networks with synthetic and real-world graphs. We simulate sampling algorithms under different parameter settings. These settings include probabilistic graph generators, coupling patterns, and various performance metrics. Our results show that while Random Node and Random Walk sampling algorithms perform best for interdependent networks, Random Edge and Forest Fire sampling algorithms perform best for multiplex networks. Second, we propose and implement a novel similarity-based sampling algorithm for multiplex networks that samples only log(N) number of layers of an N-layer multiplex network while yielding computational savings with performance guarantees. Experimental results show that similarity sampling outperforms complete sampling of all layers while decreasing performance costs from a linear scale to a logarithmic one. Our results also indicate that similarity-based sampling outperforms complete sampling and random selection in nearly all scenarios when tested with real-world data.

Subasi, Omer↗