Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Scalable”

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 523 records · Page 29

Designs for scalable construction of hybrid quantum photonic cavities

Nanophotonic resonators are central to numerous applications, from efficient spin–photon interfaces to laser oscillators and precision sensing. A leading approach consists of photonic crystal (PhC) cavities, which have been realized in a wide range of dielectric materials. However, translating proof-of-concept devices into a functional system entails a number of additional challenges, inspiring new approaches that combine resonators with wavelength-scale confinement and high quality factors; scalable integration with integrated circuits and photonic circuits; electrical or mechanical cavity tuning; and, in many cases, a need for heterogeneous integration with functional materials such as III–V semiconductors or diamond color centers for spin–photon interfaces. Here we introduce a concept that generates a finely tunable PhC cavity at a selected wavelength between two heterogeneous optical materials whose properties satisfy the above requirements. The cavity is formed by stamping a hard-to-process material with simple waveguide geometries on top of an easy-to-process material consisting of dielectric grating mirrors and active tuning capability. We simulate our concept for the particularly challenging design problem of multiplexed quantum repeaters based on arrays of cavity-coupled diamond color centers, achieving theoretically calculated unloaded quality factors of 106, mode volumes as small as 1.2(λ/neff)3, and maintaining >60% total on-chip collection efficiency of fluorescent photons. We further introduce a method of low-power piezoelectric tuning of these hybrid diamond cavities, simulating optical resonance shifts up to ∼760 GHz and color center fluorescence tuning of 5 GHz independent of cavity tuning. These results will motivate integrated photonic cavities toward larger scale systems-compatible designs.

Greenspon, Andrew S. (ORCID:0000000296317568)↗

Implementation of scalable suspended superinductors

Superinductors have become a crucial component in the superconducting circuit toolbox, playing a key role in the development of more robust qubits. Enhancing the performance of these devices can be achieved by suspending the superinductors from the substrate, thereby reducing stray capacitance. Here, we present a fabrication framework for constructing superconducting circuits with suspended superinductors in planar architectures. To validate the effectiveness of this process, we systematically characterize both resonators and qubits with suspended arrays of Josephson junctions, ultimately confirming the high quality of the superinductive elements. In addition, this process is broadly compatible with other types of superinductors and circuit designs. Furthermore, our results not only pave the way for scalable superconducting architectures utilizing superinductors but also provide the primitive for future investigation of loss mechanisms associated with the device substrate.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Scalable optical quantum computer

A way of designing a scalable optical quantum computer based on the photon echo effect is proposed. Individual rare earth ions Pr{sup 3+}, regularly located in the lattice of the orthosilicate (Y{sub 2}SiO{sub 5}) crystal, are suggested to be used as optical qubits. Operations with qubits are performed using coherent and incoherent laser pulses. The operation protocol includes both the method of measurement-based quantum computations and the technique of optical computations. Modern hybrid photon echo protocols, which provide a sufficient quantum efficiency when reading recorded states, are considered as most promising for quantum computations and communications. (quantum computer)

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Expeditious, scalable solution growth of metal oxide films by combustion blade coating for flexible electronics

Metal oxide (MO) semiconductor thin films prepared from solution typically require multiple hours of thermal annealing to achieve optimal lattice densification, efficient charge transport, and stable device operation, presenting a major barrier to roll-to-roll manufacturing. Here, we report a highly efficient, cofuel-assisted scalable combustion blade-coating (CBC) process for MO film growth, which involves introducing both a fluorinated fuel and a preannealing step to remove deleterious organic contaminants and promote complete combustion. Ultrafast reaction and metal–oxygen–metal (M-O-M) lattice condensation then occur within 10–60 s at 200–350 °C for representative MO semiconductor [indium oxide (In 2 O 3 ), indium-zinc oxide (IZO), indium-gallium-zinc oxide (IGZO)] and dielectric [aluminum oxide (Al 2 O 3 )] films. Furthermore, wafer-scale CBC fabrication of IGZO-Al 2 O 3 thin-film transistors (TFTs) (60-s annealing) with field-effect mobilities as high as ~25 cm 2 V –1 s –1 and negligible threshold voltage deterioration in a demanding 4,000-s bias stress test are realized. Combined with polymer dielectrics, the CBC-derived IGZO TFTs on polyimide substrates exhibit high flexibility when bent to a 3-mm radius, with performance bending stability over 1,000 cycles.

36 MATERIALS SCIENCE↗

Prevalence and scalable control of localized networks

The ability to control network dynamics is essential for ensuring desirable functionality of many technological, biological, and social systems. Such systems often consist of a large number of network elements, and controlling large-scale networks remains challenging because the computation and communication requirements increase prohibitively fast with network size. Here, we introduce a notion of network locality that can be exploited to make the control of networks scalable, even when the dynamics are nonlinear. We show that network locality is captured by an information metric and is almost universally observed across real and model networks. In localized networks, the optimal control actions and system responses are both shown to be necessarily concentrated in small neighborhoods induced by the information metric. This allows us to develop localized algorithms for determining network controllability and optimizing the placement of driver nodes. This also allows us to develop a localized algorithm for designing local feedback controllers that approach the performance of the corresponding best global controllers, while incurring a computational cost orders-of-magnitude lower. Here, we validate the locality, performance, and efficiency of the algorithms in Kuramoto oscillator networks, as well as three large empirical networks: synchronization dynamics in the Eastern US power grid, epidemic spreading mediated by the global air-transportation network, and Alzheimer’s disease dynamics in a human brain network. Taken together, our results establish that large networks can be controlled with computation and communication costs comparable to those for small networks.

42 ENGINEERING↗

Design and characterization of mutant and wildtype huntingtin proteins produced from a toolkit of scalable eukaryotic expression systems

The gene mutated in individuals with Huntington's disease (HD) encodes the 348-kDa huntingtin (HTT) protein. Pathogenic HD CAG-expansion mutations create a polyglutamine (polyQ) tract at the N terminus of HTT that expands above a critical threshold of ~35 glutamine residues. The effect of these HD mutations on HTT is not well understood, in part because it is difficult to carry out biochemical, biophysical, and structural studies of this large protein. To facilitate such studies, we have generated expression constructs for the scalable production of HTT in multiple eukaryotic expression systems in this work. Our set of HTT expression clones comprised both N- and C-terminally FLAG-tagged HTT constructs with polyQ lengths representative of the general population, HD patients, and juvenile HD patients, as well as the more extreme polyQ expansions used in some HD tissue and animal models. Our expression system yielded milligram quantities of pure recombinant HTT protein, including many of the previously mapped post-translational modifications. We characterized both apo and HTT–HTT-associated protein 40 (HAP40) complex samples produced with this HD resource, demonstrating that this toolkit can be used to generate physiologically meaningful HTT complexes. We further demonstrate that these resources can produce sufficient material for protein-intensive experiments, such as small-angle X-ray scattering, providing biochemical insight into full-length HTT protein structure. The work outlined and the tools generated here lay a foundation for further biochemical and structural work on the HTT protein and for studying its functional interactions with other biomolecules.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Scalable Bayesian Nonparametric Clustering and Classification

We develop a scalable multi-step Monte Carlo algorithm for inference under a large class of nonparametric Bayesian models for clustering and classification. Each step is “embarrassingly parallel” and can be implemented using the same Markov chain Monte Carlo sampler. The simplicity and generality of our approach makes inference for a wide range of Bayesian nonparametric mixture models applicable to large datasets. Specifically, we apply the approach to inference under a product partition model with regression on covariates. We show results for inference with two motivating data sets: a large set of electronic health records (EHR) and a bank telemarketing dataset. We find interesting clusters and competitive classification performance relative to other widely used competing classifiers. Supplementary materials for this article are available online.

97 MATHEMATICS AND COMPUTING↗

A scalable new mechanism to store, query and serve the ATLAS detector description through a REST web API

Until now, geometry information for the detector description of the ATLAS experiment was only defined in C++ code, stored in online relational databases integrated into the experiment's frameworks or described in files with text-based markup languages. In all cases, to build and use the complete detector geometry, a full software stack was needed. In this paper, we present a new and scalable mechanism to store the geometry data and to query and serve the detector description data through a web interface and a REST API. This new approach decouples the geometry information from the experiment's framework. Moreover, it provides new functionalities to users, who can now search for specific volumes and get partial detector description, or filter geometry data based on custom criteria. We present two approaches to build a REST API to serve geometry data, based on two different technologies used in other fields and communities: The graph database Neo4j and the search engine ElasticSearch. We describe their characteristics, and we compare them in a HEP context.

47 OTHER INSTRUMENTATION↗

Stability and scalability of the CMS Global Pool: Pushing HTCondor and glideinWMS to new limits

The CMS Global Pool, based on HTCondor and glideinWMS, is the main computing resource provisioning system for all CMS workflows, including analysis, Monte Carlo production, and detector data reprocessing activities. The total resources at Tier-1 and Tier-2 grid sites pledged to CMS exceed 100,000 CPU cores, while another 50,000 to 100,000 CPU cores are available opportunistically, pushing the needs of the Global Pool to higher scales each year. These resources are becoming more diverse in their accessibility and configuration over time. Furthermore, the challenge of stably running at higher and higher scales while introducing new modes of operation such as multi-core pilots, as well as the chaotic nature of physics analysis workflows, places huge strains on the submission infrastructure. This paper details some of the most important challenges to scalability and stability that the CMS Global Pool has faced since the beginning of the LHC Run II and how they were overcome.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Scalability study of solid xenon

We report a demonstration of the scalability of optically transparent xenon in the solid phase for use as a particle detector above a kilogram scale. We employed a cryostat cooled by liquid nitrogen combined with a xenon purification and chiller system. A modified {\it Bridgeman's technique} reproduces a large scale optically transparent solid xenon.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Scalable shear-exfoliation of high-quality phosphorene nanoflakes with reliable electrochemical cycleability in nano batteries

Atomically thin black phosphorus (called phosphorene) holds great promise as an alternative to graphene and other two-dimensional transition-metal dichalcogenides as an anode material for lithium-ion batteries (LIBs). But, bulk black phosphorus (BP) suffers from rapid capacity fading and poor rechargeable performance. This work reports for the first time the use of in situ transmission electron microscopy (TEM) to construct nanoscale phosphorene LIBs. This enables direct visualization of the mechanisms underlying capacity fading in thick multilayer phosphorene through real-time capture of delithiation-induced structural decomposition, which serves to reduce electrical conductivity thus causing irreversibility of the lithiated phases. Furthermore, we demonstrate that few-layer-thick phosphorene successfully circumvents the structural decomposition and holds superior structural restorability, even when subject to multi-cycle lithiation/delithiation processes and concomitant huge volume expansion. This finding provides breakthrough insights into thickness-dependent lithium diffusion kinetics in phosphorene. More importantly, a scalable liquid-phase shear exfoliation route has been developed to produce high-quality ultrathin phosphorene using simple means such as a high-speed shear mixer or even a household kitchen blender with the shear rate threshold of ~1.25 × 10 4 s -1 . Our results reported here will pave the way for industrial-scale applications of rechargeable phosphorene LIBs.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Robust and scalable uncertainty estimation with conformal prediction for machine-learned interatomic potentials

Abstract Uncertainty quantification (UQ) is important to machine learning (ML) force fields to assess the level of confidence during prediction, as ML models are not inherently physical and can therefore yield catastrophically incorrect predictions. Established a-posteriori UQ methods, including ensemble methods, the dropout method, the delta method, and various heuristic distance metrics, have limitations such as being computationally challenging for large models due to model re-training. In addition, the uncertainty estimates are often not rigorously calibrated. In this work, we propose combining the distribution-free UQ method, known as conformal prediction (CP), with the distances in the neural network’s latent space to estimate the uncertainty of energies predicted by neural network force fields. We evaluate this method (CP+latent) along with other UQ methods on two essential aspects, calibration, and sharpness, and find this method to be both calibrated and sharp under the assumption of independent and identically-distributed (i.i.d.) data. We show that the method is relatively insensitive to hyperparameters selected, and test the limitations of the method when the i.i.d. assumption is violated. Finally, we demonstrate that this method can be readily applied to trained neural network force fields with traditional and graph neural network architectures to obtain estimates of uncertainty with low computational costs on a training dataset of 1 million images to showcase its scalability and portability. Incorporating the CP method with latent distances offers a calibrated, sharp and efficient strategy to estimate the uncertainty of neural network force fields. In addition, the CP approach can also function as a promising strategy for calibrating uncertainty estimated by other approaches.

74 ATOMIC AND MOLECULAR PHYSICS↗

Scalable edge clustering of dynamic graphs via weighted line graphs

Timestamped relational datasets consisting of records (or connections) between pairs of entities are ubiquitous in network science. For applications like peer-to-peer communication, email, various social network interactions, and computer network security, it is useful to organize these records into groups based on how and when they are occurring. Weighted line graphs offer a natural way to model how records are related in such datasets but for large real-world graph topologies, building and utilizing the line graph is prohibitively expensive. Here, we present the framework to cluster the edges of a dynamic graph via the associated line graph that contains two major contributions. The first is a method to work with the line graph implicitly and the second is a distributed scale implementation of an agglomerative hierarchical graph clustering algorithm. We outline a novel hierarchical dynamic graph edge clustering approach that efficiently breaks massive relational datasets into small sets of edges containing events at various timescales. This is in stark contrast to traditional graph clustering algorithms that prioritize highly connected (clique-like) community structures. Our approach relies on constructing a sufficient subgraph of a weighted line graph and applying a hierarchical agglomerative clustering. This approach is related to scalable techniques from spatial clustering, nonlinear-dimension reduction, topological data analysis, and draws particular inspiration from HDBSCAN. As an edge clustering, this method yields an overlapping node clustering. Our algorithm is parallelizable and we demonstrate efficient clustering of a billion-scale, real-world dynamic graph into small edge sets that correlate in topology and time. The entire clustering process for a graph with tens of billions of edges takes just a few minutes of run time on 256 nodes of a distributed compute environment. We argue how the output of the edge clustering is useful for a multitude of data visualization and powerful machine learning tasks, both involving the original massive dynamic graph data and metadata associated with the nodes and edges. Finally, we describe how this approach can be extended to dynamic hypergraphs and dynamic graphs/hypergraphs with unstructured data living on vertices and edges.

Data Analysis↗

nf-core/proteinfamilies: a scalable pipeline for the generation of protein families

The growth of metagenomics-derived amino acid sequence data has transformed our understanding of protein function, microbial diversity, and evolutionary relationships. However, the vast majority of these proteins remain functionally uncharacterized. Grouping the millions of such uncharacterized sequences with the few experimentally characterized ones allows the transfer of annotations, while the inspection of conserved residues with multiple sequence alignments can provide clues to function, even in the absence of existing functional information. To address the challenges associated with this data surge and the need to group sequences, we present a scalable, open-source, parametrizable Nextflow pipeline (nf-core/proteinfamilies) that generates nascent protein families or assigns new proteins to existing families. The computational benchmarks demonstrated that resource usage scales approximately linearly with input size, and the biological benchmarks showed that the generated protein families closely resemble manually curated families in widely used databases.

Nextflow↗

Protein-assisted scalable mechanochemical exfoliation of few-layer biocompatible graphene nanosheets

A facile method to produce few-layer graphene (FLG) nanosheets is developed using protein-assisted mechanical exfoliation. The predominant shear forces that are generated in a planetary ball mill facilitate the exfoliation of graphene layers from graphite flakes. The process employs a commonly known protein, bovine serum albumin (BSA), which not only acts as an effective exfoliation agent but also provides stability by preventing restacking of the graphene layers. The latter is demonstrated by the excellent long-term dispersibility of exfoliated graphene in an aqueous BSA solution, which exemplifies a common biological medium. The development of such potentially scalable and toxin-free methods is critical for producing cost-effective biocompatible graphene, enabling numerous possible biomedical and biological applications. A methodical study was performed to identify the effect of time and varying concentrations of BSA towards graphene exfoliation. The fabricated product has been characterized using Raman spectroscopy, powder X-ray diffraction, transmission electron microscopy and scanning electron microscopy. The BSA-FLG dispersion was then placed in media containing Astrocyte cells to check for cytotoxicity. It was found that lower concentrations of BSA-FLG dispersion had only minute cytotoxic effects on the Astrocyte cells.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Mode Multiplexing for Scalable Cavity-Enhanced Operations in Neutral-Atom Arrays

Neutral-atom arrays provide a versatile platform for quantum information processing. However, in large-scale arrays, efficient photon collection remains a bottleneck for key tasks such as fast, nondestructive qubit readout and remote entanglement distribution. We propose a cavity-based approach that enables fast, parallel operations over many atoms using multiple modes of a single optical cavity. By selectively shifting the relevant atomic transitions, each atom can be coupled to a distinct cavity mode, allowing independent simultaneous processing. We present practical system designs that support cavity-mode multiplexing with up to 50 modes, enabling rapid mid-circuit syndrome extraction and significantly enhancing entanglement distribution rates between remote atom arrays. This approach offers a scalable solution to core challenges in neutral-atom arrays, advancing the development of practical quantum technologies.

Aqua, Ziv [Massachusetts Institute of Technology (↗

Searching for axion dark matter with array-scalable single magnon detectors

We introduce an array-scalable, magnon-based detector to search for the spin-dependent interactions of electron-coupled axion dark matter with mass in the 1−100 μ⁢eV range. These axions can excite single magnons in magnetic targets, such as yttrium iron garnet (YIG) spheres, which are subsequently sensed by the detector. In our concept, this sensing is implemented by coupling the magnons in the YIG spheres to magnetic-field-resilient single-electron charge-qubits, whose state is then interrogated with a quantum nondemolition measurement. Using standard superconducting fabrication techniques, it is possible to integrate many YIG sphere-qubit sensors, forming a large detector array. We outline the detector design and operation for our concept, and determine its sensitivity to axion dark matter. We find that using available technology can already exceed the sensitivity of previous ferromagnetic haloscopes, and further improvements in performance would search for electron-coupled axion dark matter in unexplored parameter space.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Toward scalable quantum computations of atomic nuclei

We solve the nuclear two-body and three-body bound states via quantum simulations of pionless effective field theory on a lattice in position space. While the employed lattice remains small, the usage of local Hamiltonians including two- and three-body forces ensures that the number of Pauli terms scales linearly with increasing numbers of lattice sites. We use an adaptive ansatz grown from unitary coupled cluster theory to parametrize the ground states of the deuteron and 3 He, compute their corresponding energies, and analyze the scaling of the required computational resources. Our quantum simulations reproduce exact benchmarks for 2 H and 3 He within 100 keV, requiring at most 30 layers in the ansatz and thus resulting in modest circuit depths. Additionally, we find the number of shots required to reach a given precision scales linearly in the lattice size and more mildly in the system size. Furthermore, based on the agreement with exact benchmarks and mild scaling, we conclude that this can be an efficient, scalable approach for quantum computations of nuclear ground states, particularly to prepare initial states for quantum phase estimation or other filtering algorithms.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗