Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Programmable”

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 91 records · Page 5

The quality control programme for ITk strip tracker module assembly

The assembly of the ATLAS Inner Tracker requires the construction of 19,000 silicon strip sensor detector modules in eight different geometries. Modules will be assembled and tested at 31 institutes on four continents from sensors, readout chips, and flexes. In order to adhere to the module specifications defined for sufficient tracking performance, a rigorous programme of quality control (QC) was established to cover components at every stage of assembly. Here, this contribution presents an overview of the QC programme for ITk strip tracker modules, issues encountered during the pre-production phase (5% of the production volume), and their solutions.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

De novo design of programmable inducible promoters

Abstract Ligand-responsive allosteric transcription factors (aTF) play a vital role in genetic circuits and high-throughput screening because they transduce biochemical signals into gene expression changes. Programmable control of gene expression from aTF-regulated promoter is important because different downstream effector genes function optimally at different expression levels. However, tuning gene expression of native promoters is difficult due to complex layers of homeostatic regulation encoded within them. We engineered synthetic promoters de novo by embedding operator sites with varying affinities and radically reshaped binding preferences within a minimal, constitutive Escherichia coli promoter. Multiplexed cell-based screening of promoters for three TetR-like aTFs generated with this approach gave rich diversity of gene expression levels, dynamic ranges and ligand sensitivities and were 50- to 100-fold more active over their respective native promoters. Machine learning on our dataset revealed that relative position of the core motif and bases flanking the core motif play an important role in modulating induction response. Our generalized approach yields customizable and programmable aTF-regulated promoters for engineering cellular pathways and enables the discovery of new small molecule biosensors.

59 BASIC BIOLOGICAL SCIENCES↗

Skyrmion-Based Programmable Logic Device with Complete Boolean Logic Functions

A skyrmionic programmable logic device (SkrPLD) with complete Boolean logic functions is proposed and analyzed by micromagnetic simulations. The SkrPLD is based on an antiferromagnet/ferromagnet bilayer structure, in which the antiferromagnetic layer supports the interfacial Dzyaloshinskii–Moriya interaction and the out-of-plane exchange bias field for stabilizing a zero-field skyrmion. By varying the local exchange bias field, artificial pinning sites are introduced for trapping the skyrmions. Depending on the input currents and the initial position of skyrmions at different pinning sites, different logic functions can be realized. Micromagnetic simulations show that the proposed SkrPLD has robust performance even under thermal fluctuations and inhomogeneity effects. Our work can provide insights for the design of programmable spin logic devices.

74 ATOMIC AND MOLECULAR PHYSICS↗

Experimental realization of classical Z 2 spin liquids in a programmable quantum device

We build and probe a Z 2 spin liquid in a programmable quantum device, the D-Wave DW-2000Q. Specifically, we observe the classical eight-vertex and six-vertex (spin ice) states and transitions between them. To realize this state of matter, we design a Hamiltonian with combinatorial gauge symmetry using only pairwise-qubit interactions and a transverse field, i.e., interactions which are accessible in this quantum device. The combinatorial gauge symmetry remains exact along the full quantum annealing path, landing the system onto the classical eight-vertex model at the endpoint of the path. The output configurations from the device allow us to directly observe the loop structure of the classical model. Moreover, we deform the Hamiltonian so as to vary the weights of the eight vertices and show that we can selectively attain the classical six-vertex (ice) model, or drive the system into a ferromagnetic state. Additionally, we present studies of the classical phase diagram of the system as a function of the eight-vertex deformations and effective temperature, which we control by varying the relative strengths of the programmable couplings, and we show that the experimental results are consistent with theoretical analysis. Finally, we identify additional capabilities that, if added to these devices, would allow us to realize Z 2 quantum spin liquids on which to build topological qubits.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Compact Ferroelectric Programmable Majority Gate for Compute-in-Memory Applications

In this study, a compact and novel ferroelectric (FE) programmable majority gate is proposed and its novel application in Binary Neural Network (BNNs) is investigated. We demonstrate: i) by integrating N metal-ferroelectric-metal (MFM) capacitors on the gate of a transistor (1T-N-MFM structure), a nonvolatile and programmable majority (MAJ) gate that performs MAJ of AND between the gate input and polarization is realized; ii) validation the functionality of our 3-input MAJ of AND gate through comprehensive theoretical and experimental investigations; iii) a compact implementation of 3-input MAJ of XNOR gate that leverages only five of our 3-input MAJ of AND gates connected in parallel; iv) application of MAJ of XNOR gates to replace the XNOR gates and the first layer of the adder tree in the BNNs for up to 21x area saving on top of eliminating the energy-hungry memory accesses due to the compute-in-memory nature.

97 MATHEMATICS AND COMPUTING↗

Online Convex Optimization of Programmable Quantum Computers to Simulate Time-Varying Quantum Channels

Simulating quantum channels is a fundamental primitive in quantum computing, since quantum channels define general (trace-preserving) quantum operations. An arbitrary quantum channel cannot be exactly simulated using a finite-dimensional programmable quantum processor, making it important to develop optimal approximate simulation techniques. In this paper, we study the challenging setting in which the channel to be simulated varies adversarially with time. We propose the use of matrix exponentiated gradient descent (MEGD), an online convex optimization method, and analytically show that it achieves a sublinear regret in time. Through experiments, we validate the main results for time-varying dephasing channels using a programmable generalized teleportation processor.

97 MATHEMATICS AND COMPUTING↗

An externally and internally deformable, programmable lung motion phantom

Purpose: Most clinically deployed strategies for respiratory motion management in lung radiotherapy (e.g., gating and tracking) use external markers that serve as surrogates for tumor motion. However, typical lung phantoms used to validate these strategies are based on a rigid exterior and a rigid or a deformable-interior. Such designs do not adequately represent respiration because the thoracic anatomy deforms internally as well as externally. In order to create a closer approximation of respiratory motion, the authors describe the construction and experimental testing of an externally as well as internally deformable, programmable lung phantom. Methods: The outer shell of a commercially available lung phantom (RS-1500, RSD, Inc.) was used. The shell consists of a chest cavity with a flexible anterior surface, and embedded vertebrae, rib-cage and sternum. A custom-made insert was designed using a piece of natural latex foam block. A motion platform was programmed with sinusoidal and ten patient-recorded lung tumor trajectories. The platform was used to drive a rigid foam “diaphragm” that compressed/decompressed the phantom interior. Experimental characterization comprised of determining the reproducibility and the external–internal correlation of external and internal marker trajectories extracted from kV x-ray fluoroscopy. Experiments were conducted to illustrate three example applications of the phantom—(i) validating the geometric accuracy of the VisionRT surface photogrammetry system; (ii) validating an image registration tool, NiftyReg; and (iii) quantifying the geometric error due to irregular motion in four-dimensional computed tomography (4DCT). Results: The phantom correctly reproduced sinusoidal and patient-derived motion, as well as realistic respiratory motion-related effects such as hysteresis. The reproducibility of marker trajectories over multiple runs for sinusoidal as well as patient traces, as characterized by fluoroscopy, was within 0.25 mm RMS error. The motion trajectories of internal and external radio-opaque markers as measured by fluoroscopy were found to be highly correlated (R > 0.95). Using the phantom, it was demonstrated that the motion trajectories of regions-of-interest on the surface as measured by VisionRT are highly consistent with corresponding fluoroscopically acquired surface marker trajectories, with RMS errors within 0.26 mm. Furthermore, it was shown that the trajectories of external and internal marker trajectories derived from NiftyReg deformation vector fields were within 1 mm root mean square errors comparing to trajectories obtained by segmenting markers from individual fluoro frames. Finally, it was shown that while 4DCT can be used to localize internal markers for sinusoidal motion with reasonable accuracy, the localization error increases significantly (by a factor of ∼2) in the presence of cycle-to-cycle variations that are observed in patient-derived respiratory motion. Conclusions: The authors have developed a realistic externally and internally deformable, programmable lung phantom that will serve as a valuable tool for clinical and investigational motion management studies in thoracic and abdominal radiation therapies.

60 APPLIED LIFE SCIENCES↗

Tweezer-programmable 2D quantum walks in a Hubbard-regime lattice

Quantum walks provide a framework for designing quantum algorithms that is both intuitive and universal. To leverage the computational power of these walks, it is important to be able to programmably modify the graph a walker traverses while maintaining coherence. We do this by combining the fast, programmable control provided by optical tweezers with the scalable, homogeneous environment of an optical lattice. With these tools we study continuous-time quantum walks of single atoms on a square lattice and perform proof-of-principle demonstrations of spatial search with these walks. When scaled to more particles, the capabilities demonstrated can be extended to study a variety of problems in quantum information science, including performing more effective versions of spatial search using a larger graph with increased connectivity.

Science & Technology - Other Topics↗

Radiation-Hardened Circuitry Using Mask-Programmable Analog Arrays (September 2014 Milestone Report)

This is a report of the activities involving Task 2 of the NEET 2 project Radiation Hardened Circuitry Using Mask-Programmable Analog Arrays. Using the analog blocks available in our currently pre-configured Via-Configured Array (VCA), we will perform a detailed schematic design of our system to include the signal-processing blocks for temperature, radiation and pressure. Control and data acquisition will be implemented with the Spartan-6 Field-Programmable Gate Array (FPGA) as well as wired serial communications with a remote computer to be used with this project. In addition, batteries and associated voltage regulators will be selected for powering the system. Fabrication may include a polyimide, printed circuit board (PCB) for improved radiation and temperature tolerance. The PCB will go through a layout process by one of the organizations we utilize for this function and be fabricated by another external vendor. Population of the system board will be performed using one of our in-house technicians or an outside vendor we commonly use. Five prototype systems (sensors, electronics board, battery power supply, and personal computer (PC) serial communications port) will be constructed to support the testing objectives of this work. Quality assurance will be performed at each step by both the submitters and the vendors.

36 MATERIALS SCIENCE↗

UPC++ Programmer’s Guide (v1.0 2017.9)

UPC++ is a C++11 library that provides Asynchronous Partitioned Global Address Space (APGAS) programming. It is designed for writing parallel programs that run efficiently and scale well on distributed-memory parallel computers. The APGAS model is single program, multiple-data (SPMD), with each separate thread of execution (referred to as a rank, a term borrowed from MPI) having access to local memory as it would in C++. However, APGAS also provides access to a global address space, which is allocated in shared segments that are distributed over the ranks. UPC++ provides numerous methods for accessing and using global memory. In UPC++, all operations that access remote memory are explicit, which encourages programmers to be aware of the cost of communication and data movement. Moreover, all remote-memory access operations are by default asynchronous, to enable programmers to write code that scales well even on hundreds of thousands of cores.

97 MATHEMATICS AND COMPUTING↗

UPC++ Programmer’s Guide, v1.0-2018.3.0

UPC++ is a C++11 library that provides Partitioned Global Address Space (PGAS) programming. It is designed for writing parallel programs that run efficiently and scale well on distributed-memory parallel computers. The PGAS model is single program, multiple-data (SPMD), with each separate thread of execution (referred to as a rank, a term borrowed from MPI) having access to local memory as it would in C++. However, PGAS also provides access to a global address space, which is allocated in shared segments that are distributed over the ranks. UPC++ provides numerous methods for accessing and using global memory. In UPC++, all operations that access remote memory are explicit, which encourages programmers to be aware of the cost of communication and data movement. Moreover, all remote-memory access operations are by default asynchronous, to enable programmers to write code that scales well even on hundreds of thousands of cores.

97 MATHEMATICS AND COMPUTING↗

Tank Farm Safety Programmable System Software Management Plan

This Software Management Plan (SMP) applies to the configurable programmable logic controller (PLC) software configured as the Tank Farms Safety Programmable System (TFSPS). The TFSPS is identified as a safety-significant (SS) system to prevent loss of the safety function of SS structures, systems, and components (SSC). The TFSPS software is classified as grade level A configurable safety software. The TFSPS consists of safety instrumented systems (SIS) and safety instrumented alarm (SIA) systems.The purpose of this management plan is to describe how Washington River Protection Solutions (WRPS) will configure and manage the TFSPS software and the associated software life cycle (SLC). TFSPS software shall be configured by Process and Control Systems Engineering (P&CSE) as grade level A safety software for use by Production Operations as the primary stakeholders.

97 MATHEMATICS AND COMPUTING↗

UPC++ Programmer’s Guide (v1.0-2019.3.0)

UPC++ is a C++11 library that provides Partitioned Global Address Space (PGAS) programming. It is designed for writing parallel programs that run efficiently and scale well on distributed-memory parallel computers. The PGAS model is single program, multiple-data (SPMD), with each separate constituent process having access to local memory as it would in C++. However, PGAS also provides access to a global address space, which is allocated in shared segments that are distributed over the processes. UPC++ provides numerous methods for accessing and using global memory. In UPC++, all operations that access remote memory are explicit, which encourages programmers to be aware of the cost of communication and data movement. Moreover, all remote-memory access operations are by default asynchronous, to enable programmers to write code that scales well even on hundreds of thousands of cores.

97 MATHEMATICS AND COMPUTING↗

UPC++ v1.0 Programmer’s Guide (Revision 2019.9.0)

UPC++ is a C++11 library that provides Partitioned Global Address Space (PGAS) programming. It is designed for writing parallel programs that run efficiently and scale well on distributed-memory parallel computers. The PGAS model is single program, multiple-data (SPMD), with each separate constituent process having access to local memory as it would in C++. However, PGAS also provides access to a global address space, which is allocated in shared segments that are distributed over the processes. UPC++ provides numerous methods for accessing and using global memory. In UPC++, all operations that access remote memory are explicit, which encourages programmers to be aware of the cost of communication and data movement. Moreover, all remote-memory access operations are by default asynchronous, to enable programmers to write code that scales well even on hundreds of thousands of cores.

97 MATHEMATICS AND COMPUTING↗

UPC++ v1.0 Programmer’s Guide, Revision 2020.10.0

UPC++ is a C++11 library that provides Partitioned Global Address Space (PGAS) programming. It is designed for writing parallel programs that run efficiently and scale well on distributed-memory parallel computers. The PGAS model is single program, multiple-data (SPMD), with each separate constituent process having access to local memory as it would in C++. However, PGAS also provides access to a global address space, which is allocated in shared segments that are distributed over the processes. UPC++ provides numerous methods for accessing and using global memory. In UPC++, all operations that access remote memory are explicit, which encourages programmers to be aware of the cost of communication and data movement. Moreover, all remote-memory access operations are by default asynchronous, to enable programmers to write code that scales well even on hundreds of thousands of cores.

97 MATHEMATICS AND COMPUTING↗

UPC++ v1.0 Programmer’s Guide, Revision 2021.9.0

UPC++ is a C++ library that provides Partitioned Global Address Space (PGAS) programming. It is designed for writing parallel programs that run efficiently and scale well on distributed-memory parallel computers. The PGAS model is single program, multiple-data (SPMD), with each separate constituent process having access to local memory as it would in C++. PGAS additionally provides one-sided Remote Memory Access (RMA) to a global address space, which is allocated in shared segments that are distributed over the processes. UPC++ also features Remote Procedure Call (RPC) communication, making it easy to move computation to operate on data that resides on remote processes. In UPC++, all communication operations are explicit, which encourages programmers to be aware of the cost of communication and data movement. Moreover, all communication operations are asynchronous by default, to enable programmers to write code that scales well even on hundreds of thousands of cores.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗

Compiling Quantum Circuits for Dynamically Field-Programmable Neutral Atoms Array Processors

Dynamically field-programmable qubit arrays (DPQA) have recently emerged as a promising platform for quantum information processing. In DPQA, atomic qubits are selectively loaded into arrays of optical traps that can be reconfigured during the computation itself. Leveraging qubit transport and parallel, entangling quantum operations, different pairs of qubits, even those initially far away, can be entangled at different stages of the quantum program execution. Such reconfigurability and non-local connectivity present new challenges for compilation, especially in the layout synthesis step which places and routes the qubits and schedules the gates. In this paper, we consider a DPQA architecture that contains multiple arrays and supports 2D array movements, representing cutting-edge experimental platforms. Within this architecture, we discretize the state space and formulate layout synthesis as a satisfiability modulo theories problem, which can be solved by existing solvers optimally in terms of circuit depth. For a set of benchmark circuits generated by random graphs with complex connectivities, our compiler OLSQ-DPQA reduces the number of two-qubit entangling gates on small problem instances by 1.7x compared to optimal compilation results on a fixed planar architecture. To further improve scalability and practicality of the method, we introduce a greedy heuristic inspired by the iterative peeling approach in classical integrated circuit routing. Using a hybrid approach that combined the greedy and optimal methods, we demonstrate that our DPQA-based compiled circuits feature reduced scaling overhead compared to a grid fixed architecture, resulting in 5.1X less two-qubit gates for 90 qubit quantum circuits. These methods enable programmable, complex quantum circuits with neutral atom quantum computers, as well as informing both future compilers and future hardware choices.

Physics↗

UPC++ Programmer’s Guide, v1.0-2018.9.0

UPC++ is a C++11 library that provides Partitioned Global Address Space (PGAS) programming. It is designed for writing parallel programs that run efficiently and scale well on distributed-memory parallel computers. The PGAS model is single program, multiple-data (SPMD), with each separate constituent process having access to local memory as it would in C++. However, PGAS also provides access to a global address space, which is allocated in shared segments that are distributed over the processes. UPC++ provides numerous methods for accessing and using global memory. In UPC++, all operations that access remote memory are explicit, which encourages programmers to be aware of the cost of communication and data movement. Moreover, all remote-memory access operations are by default asynchronous, to enable programmers to write code that scales well even on hundreds of thousands of cores.

97 MATHEMATICS AND COMPUTING↗