Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “STORED”

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 1,711 records · Page 95

SU-E-T-675: Remote Dosimetry with a Novel PRESAGE Formulation

Purpose: 3D-gel dosimetry provides high-resolution treatment validation; however, scanners aren’t widely available. In remote dosimetry, dosimeters are shipped out from a central base institution to a remote site for irradiation, then shipped back for scanning and analysis, affording a convenient service for treatment validation to institutions lacking the necessary equipment and resources. Previous works demonstrated the high-resolution performance and temporal stability of PRESAGE. Here the newest formulation is investigated for remote dosimetry use. Methods: A new formulation of PRESAGE was created with the aim of improved color stability post irradiation. Dose sensitivity was determined by irradiating cuvettes on a Varian Linac (6MV) from 0–15Gy and measuring change in optical density at 633nm. Sensitivity readings were tracked over time in a temperature control study to determine long-term stability. A large volume study was performed to evaluate the accuracy for remote dosimetry. A 1kg dosimeter was pre-scanned, irradiated on-site with an 8Gy 4field box treatment, post-scanned and shipped to Princess Margaret Hospital for remote reading on an identical scanner. Results: Dose sensitivities ranged from 0.0194–0.0295 ΔOD/(Gy*cm)—similar to previous formulations. Post-irradiated cuvettes stored at 10°C retained 100% initial sensitivity over 5 days and 98.6% over 10 weeks while cuvettes stored at room temperature fell to 95.8% after 5 days and 37.4% after 10 weeks. The immediate and 5-day scans of the 4field box dosimeter data was reconstructed, registered to the corresponding eclipse dose-distribution, and compared with analytical tools in CERR. Immediate and 5-day scans looked visually similar. Line profiles revealed close agreement aside from a slight elevation in dose at the edge in the 5-day readout. Conclusion: The remote dosimetry formulation exhibits excellent temporal stability in small volumes. While immediate and 5-day readout scans of large volume dosimeters show promising agreement, further development is required to reduce an apparent time dependent edge elevation.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

TestDose: A nuclear medicine software based on Monte Carlo modeling for generating gamma camera acquisitions and dosimetry

Purpose: The TestDose platform was developed to generate scintigraphic imaging protocols and associated dosimetry by Monte Carlo modeling. TestDose is part of a broader project (www.dositest.com) whose aim is to identify the biases induced by different clinical dosimetry protocols. Methods: The TestDose software allows handling the whole pipeline from virtual patient generation to resulting planar and SPECT images and dosimetry calculations. The originality of their approach relies on the implementation of functional segmentation for the anthropomorphic model representing a virtual patient. Two anthropomorphic models are currently available: 4D XCAT and ICRP 110. A pharmacokinetic model describes the biodistribution of a given radiopharmaceutical in each defined compartment at various time-points. The Monte Carlo simulation toolkit GATE offers the possibility to accurately simulate scintigraphic images and absorbed doses in volumes of interest. The TestDose platform relies on GATE to reproduce precisely any imaging protocol and to provide reference dosimetry. For image generation, TestDose stores user’s imaging requirements and generates automatically command files used as input for GATE. Each compartment is simulated only once and the resulting output is weighted using pharmacokinetic data. Resulting compartment projections are aggregated to obtain the final image. For dosimetry computation, emission data are stored in the platform database and relevant GATE input files are generated for the virtual patient model and associated pharmacokinetics. Results: Two samples of software runs are given to demonstrate the potential of TestDose. A clinical imaging protocol for the Octreoscan™ therapeutical treatment was implemented using the 4D XCAT model. Whole-body “step and shoot” acquisitions at different times postinjection and one SPECT acquisition were generated within reasonable computation times. Based on the same Octreoscan™ kinetics, a dosimetry computation performed on the ICRP 110 model is also presented. Conclusions: The proposed platform offers a generic framework to implement any scintigraphic imaging protocols and voxel/organ-based dosimetry computation. Thanks to the modular nature of TestDose, other imaging modalities could be supported in the future such as positron emission tomography.

60 APPLIED LIFE SCIENCES↗

Carbon-based Supercapacitors Produced by Activation of Graphene

Supercapacitors, also called ultracapacitors or electrochemical capacitors, store electrical charge on high-surface-area conducting materials. Their widespread use is limited by their low energy storage density and relatively high effective series resistance. Using chemical activation of exfoliated graphite oxide, we synthesized a porous carbon with a Brunauer-Emmett-Teller surface area of up to 3100 square meters per gram, a high electrical conductivity, and a low oxygen and hydrogen content. This sp{sup 2}-bonded carbon has a continuous three-dimensional network of highly curved, atom-thick walls that form primarily 0.6- to 5-nanometer-width pores. Two-electrode supercapacitor cells constructed with this carbon yielded high values of gravimetric capacitance and energy density with organic and ionic liquid electrolytes. The processes used to make this carbon are readily scalable to industrial levels.

08 HYDROGEN↗

Nitrogen-doped mesoporous carbon of extraordinary capacitance for electrochemical energy storage

Store more energy with a touch of nitrogen In contrast to batteries, capacitors typically can store less power, but they can capture and release that power much more quickly. Lin et al. fabricated a porous carbon material that was then doped with nitrogen. This raised the energy density of the carbon more than threefold—an increase that was retained in full capacitors, without losing their ability to deliver power quickly. Science , this issue p. 1508

Lin, Tianquan↗

Spin filtering at COSY and perspectives for PAX

The high physics potential of experiments with stored polarized antiprotons led to the proposal of the PAX [1] experiment (Polarized Antiproton eXperiment) for the High Energy Storage Ring (HESR) of the new FAIR facility at GSI (Darmstadt/Germany). It is proposed to polarize a stored antiproton beam by means of spin filtering by a polarized hydrogen gas target. The feasibility of spin filtering with protons using a transversely polarized hydrogen gas target has been demonstrated in the FILTEX experiment [2] and recently confirmed at the COSY ring in Jülich. A spin filtering experiment using a longitudinally polarized hydrogen gas target is planned after the installation of a siberian snake in 2014. Further measurements including the investigation of pd-breakup reactions [3] and a test of the time reversal (TRIC) [4] are planned using the developed experimental setup. A proposal for a spin-filtering experiment with antiprotons at AD/CERN [5] has been submitted to the CERN SPS comitee to investigate the spin-dependence of the pbar-p and pbar-d interaction. This knowledge is necessary to properly design a dedicated Antiproton-Polarizer Ring.

43 PARTICLE ACCELERATORS↗

Comparative investigation of InGaP/GaAs/GaAsBi and InGaP/GaAs heterojunction bipolar transistors

In this article the characteristics of In{sub 0.49}Ga{sub 0.51}P/GaAs/GaAs{sub 0.975}Bi{sub 0.025} and In{sub 0.49}Ga{sub 0.51}P/GaAs heterojunction bipolar transistor (HBTs) are demonstrated and compared by two-dimensional simulated analysis. As compared to the traditional InGaP/GaAs HBT, the studied InGaP/GaAs/GaAsBi HBT exhibits a higher collector current, a lower base-emitter (B–E) turn-on voltage, and a relatively lower collector-emitter offset voltage of only 7 mV. Because the more electrons stored in the base is further increased in the InGaP/GaAs/GaAsBi HBT, it introduces the collector current to increase and the B–E turn-on voltage to decrease for low input power applications. However, the current gain is slightly smaller than the traditional InGaP/GaAs HBT attributed to the increase of base current for the minority carriers stored in the GaAsBi base.

36 MATERIALS SCIENCE↗

Model Predictive Control for Urban Traffic Signals with Stability Guarantees

Traditional traffic signal control focuses more on the optimization aspects whereas the stability and robustness of the closed-loop system are less studied. This paper aims to establish the stability properties of traffic signal control systems through the analysis of a practical model predictive control (MPC) scheme, which models the traffic network with the conservation of vehicles based on a store-and forward model and attempts to balance the traffic densities. More precisely, this scheme guarantees the exponential stability of the closed-loop system under state and input constraints when the inflow is feasible and traffic demand can be fully accessed. Practical exponential stability is achieved in case of small uncertain traffic demand by a modification of the previous scheme. Simulation results of a small-scale traffic network validate the theoretical analysis.

ADVANCED PROPULSION SYSTEMS,MATHEMATICS AND COMPUT↗

Modifiable Array Data Structures for Mesh Topology

Topological data structures are useful in many areas, including the various mesh data structures used in finite element and finite volume applications. Here, we present a mesh data structure which is both flexible enough to support general mesh adaptivity and is compactly stored in a few large arrays. This structure can efficiently store full topological information for meshes with mixed element types. It allows both constant-time adjacency queries and constant-time addition and removal of mesh entities. We compare this structure to similar structures for finite elements and graphics and present its performance for adjacency queries. We also present its use in adaptive simulation applications.

97 MATHEMATICS AND COMPUTING↗

Streaming Compression of Scientific Data via Weak-SINDy

Here, in this paper, a streaming weak-SINDy algorithm is developed specifically for compressing streaming scientific data. The production of scientific data, either via simulation or experiments, is undergoing a stage of exponential growth, which makes data compression important and often necessary for storing and utilizing large scientific data sets. As opposed to classical “offline” compression algorithms that perform compression on a readily available data set, streaming compression algorithms compress data “online” while the data generated from simulation or experiments is still flowing through the system. This feature makes streaming compression algorithms well suited for scientific data compression, where storing the full data set offline is often infeasible. This work proposes a new streaming compression algorithm, streaming weak-SINDy, which takes advantage of the underlying data characteristics during compression. The streaming weak-SINDy algorithm constructs feature matrices and target vectors in the online stage via a streaming integration method in a memory efficient manner. The feature matrices and target vectors are then used in the offline stage to build a model through a regression process that aims to recover equations that govern the evolution of the data. For compressing high-dimensional streaming data, we adopt a streaming proper orthogonal decomposition (POD) process to reduce the data dimension and then use the streaming weak-SINDy algorithm to compress the temporal data of the POD expansion. We propose modifications to the streaming weak-SINDy algorithm to accommodate the dynamically updated POD basis. By combining the built model from the streaming weak-SINDy algorithm and a small amount of data samples, the full data flow could be reconstructed accurately at a low memory cost, as shown in the numerical tests.

97 MATHEMATICS AND COMPUTING↗

Half-life determination of heavy ions in a storage ring considering feeding and depleting background processes

Heavy-ion storage rings have relatively large momentum acceptance which allows for multiple ion species to circulate at the same time. This needs to be considered in radioactive decay measurements of highly charged ions, where atomic charge exchange reactions can significantly alter the intensities of parent and daughter ions. In this study, we investigate this effect using the decay curves of ion numbers in the recent 205 Tl 81+ bound-state beta decay experiment conducted using the Experimental Storage Ring at GSI Darmstadt. To understand the intricate dynamics of ion numbers, we present a set of differential equations that account for various atomic and nuclear reaction processes—bound state beta decay, atomic electron recombination and capture, and electron ionization. By incorporating appropriate boundary conditions, we develop a set of differential equations that accurately simulate the decay curves of various simultaneously stored ions in the storage ring: 205 Tl 81+ , 205 Pb 81+ , 205 Pb 82+ , 200 Hg 79+ , and 200 Hg 80+ . Through a quantitative comparison between simulations and experimental data, we provide insights into the detailed reaction mechanisms governing stored heavy ions within the storage ring. Our approach effectively models charge-changing processes, reduces the complexity of the experimental setup, and provides a simpler method for measuring the decay half-lives of highly charged ions in storage rings.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Nonlinear dynamics of proton beams with hollow electron lens in the CERN high-luminosity LHC

The design stored beam energy in the CERN high-luminosity large hadron collider (HL-LHC) upgrade is about 700 MJ, with about 36 MJ in the beam tails, according to estimates based on scaling considerations from measurements at the LHC. Such a large amount of stored energy in the beam tails poses serious challenges on its control and safe disposal. In particular, orbit jitters can cause significant losses on primary collimators, which can lead to accidental beam dumps, magnet quenches, or even permanent damage to collimators and other accelerator elements. Thus, active control of the diffusion speed of halo particles is necessary and the use of hollow electron lenses (HELs) represents the most promising approach to handle overpopulated tails at the HL-LHC. HEL is a very powerful and advanced tool that can be used for controlled depletion of beam tails, thus enhancing the performance of beam halo collimation. For these reasons, HELs have been recently included in the HL-LHC baseline. In this paper, we present detailed beam dynamics calculations performed with the goal of defining HEL specifications and operational scenarios for HL-LHC. The prospects for effective halo control in HL-LHC are presented.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

On-the-Fly Decompression and Rendering of Multiresolution Terrain

We present a streaming geometry compression codec for multiresolution, uniformly-gridded, triangular terrain patches that supports very fast decompression. Our method is based on linear prediction and residual coding for lossless compression of the full-resolution data. As simplified patches on coarser levels in the hierarchy already incur some data loss, we optionally allow further quantization for more lossy compression. The quantization levels are adaptive on a per-patch basis, while still permitting seamless, adaptive tessellations of the terrain. Our geometry compression on such a hierarchy achieves compression ratios of 3:1 to 12:1. Our scheme is not only suitable for fast decompression on the CPU, but also for parallel decoding on the GPU with peak throughput over 2 billion triangles per second. Each terrain patch is independently decompressed on the fly from a variable-rate bitstream by a GPU geometry program with no branches or conditionals. Thus we can store the geometry compressed on the GPU, reducing storage and bandwidth requirements throughout the system. In our rendering approach, only compressed bitstreams and the decoded height values in the view-dependent 'cut' are explicitly stored on the GPU. Normal vectors are computed in a streaming fashion, and remaining geometry and texture coordinates, as well as mesh connectivity, are shared and re-used for all patches. We demonstrate and evaluate our algorithms on a small prototype system in which all compressed geometry fits in the GPU memory and decompression occurs on the fly every rendering frame without any cache maintenance.

99 GENERAL AND MISCELLANEOUS↗

Designing a Secure Storage Repository for Sharing Scientific Datasets using Public Clouds

As Cloud platforms gain increasing traction among scientific and business communities for outsourcing storage, computing and content delivery, there is also growing concern about the associated loss of control over private data hosted in the Cloud. In this paper, we present an architecture for a secure data repository service designed on top of a public Cloud infrastructure to support multi-disciplinary scientific communities dealing with personal and human subject data, motivated by the smart power grid domain. Our repository model allows users to securely store and share their data in the Cloud without revealing the plain text to unauthorized users, the Cloud storage provider or the repository itself. The system masks file names, user permissions and access patterns while providing auditing capabilities with provable data updates.

Kumbhare, Alok↗

Exploiting Points-to Maps for De-/Serialization Code Generation

Serialization code generators for C++ have restrictions on the implementation of dynamic arrays and void/function pointers. If the target program is not implemented with these restrictions, de- velopers have to manually change the source code to facilitate se- rialization code generation. Unfortunately, such changes hamper the benefits of code generation, and they are not localized. This pa- per presents the de-/serialization code generator Ser++ that does not restrict the implementation of these pointer types and, hence, eliminates the need to adapt the source code for serialization code generation. Ser++ can be considered an aspect weaver that i) traces the pointers, ii) identifies the statements in which properties regard- ing the serialization of pointer attributes can be extracted and, finally, iii) weaves the code to store these properties at runtime. It generates the de-/serialization functions in such a way that they serialize the pointer attributes according to the stored values of the properties. We have successfully used Ser++ to generate de- /serialization methods for a computer architecture and a power- flow simulator, without any modifications to the existing source code.

Serialization↗

A model for optimizing file access patterns using spatio-temporal parallelism. In: UltraVis '13 Proceedings of the 8th International Workshop on Ultrascale Visualization, Article No. 4

For many years now, I/O read time has been recognized as the primary bottleneck for parallel visualization and analysis of large-scale data. In this paper, we introduce a model that can estimate the read time for a file stored in a parallel filesystem when given the file access pattern. Read times ultimately depend on how the file is stored and the access pattern used to read the file. The file access pattern will be dictated by the type of parallel decomposition used. We employ spatio-temporal parallelism, which combines both spatial and temporal parallelism, to provide greater flexibility to possible file access patterns. Using our model, we were able to configure the spatio-temporal parallelism to design optimized read access patterns that resulted in a speedup factor of approximately 400 over traditional file access patterns.

Nouanesengsy, Boonthanome↗

Moment representation in the lattice Boltzmann method on massively parallel hardware

The widely-used lattice Boltzmann method (LBM) for computational fluid dynamics is highly scalable, but also significantly memory bandwidth-bound on current architectures. This paper presents a new regularized LBM implementation that reduces the memory footprint by only storing macroscopic, moment-based data. We show that the amount of data that must be stored in memory during a simulation is reduced by up to 47%. We also present a technique for cache-aware data re-utilization and show that optimizing cache utilization to limit data motion results in a similar improvement in time to solution. These new algorithms are implemented in the hemodynamics solver HARVEY and demonstrated using both idealized and realistic biological geometries. We develop a performance model for the moment representation algorithm and evaluate the performance on Summit.

Vardhan, Madhurima↗

Characterizing Output Bottlenecks of a Production Supercomputer: Analysis and Implications

This article studies the I/O write behaviors of the Titan supercomputer and its Lustre parallel file stores under production load. The results can inform the design, deployment, and configuration of file systems along with the design of I/O software in the application, operating system, and adaptive I/O libraries.We propose a statistical benchmarking methodology to measure write performance across I/O configurations, hardware settings, and system conditions. Moreover, we introduce two relative measures to quantify the write-performance behaviors of hardware components under production load. In addition to designing experiments and benchmarking on Titan, we verify the experimental results on one real application and one real application I/O kernel, XGC and HACC IO, respectively. These two are representative and widely used to address the typical I/O behaviors of applications.In summary, we find that Titan’s I/O system is variable across the machine at fine time scales. This variability has two major implications. First, stragglers lessen the benefit of coupled I/O parallelism (striping). Peak median output bandwidths are obtained with parallel writes to many independent files, with no striping or write sharing of files across clients (compute nodes). I/O parallelism is most effective when the application—or its I/O libraries—distributes the I/O load so that each target stores files for multiple clients and each client writes files on multiple targets in a balanced way with minimal contention. Second, our results suggest that the potential benefit of dynamic adaptation is limited. In particular, it is not fruitful to attempt to identify “good locations” in the machine or in the file system: component performance is driven by transient load conditions and past performance is not a useful predictor of future performance. For example, we do not observe diurnal load patterns that are predictable.

97 MATHEMATICS AND COMPUTING↗

HQ-Sim: High-performance State Vector Simulation of Quantum Circuits on Heterogeneous HPC Systems

Quantum circuit simulations are applied in more and more circum- stances as the quantum computing community becomes broader. It helps researchers to evaluate quantum algorithms and relieve the burden of limited quantum computing resources. However, most of the state-of-the-art quantum simulators utilize either CPU or GPU to store and calculate the state vector, which results in resource starvation. Moreover, the maximum number of qubits supported by the simulator is bounded by the memory, since the memory utilization increases exponentially with the number of qubits. In this study, we leverage Heterogeneous computing to utilize both CPU and GPU to store and update state vectors. We also integrate lossy data compression to reduce memory requirements. Specifically, we develop a heterogeneous framework that has a dynamic scheduler to fully utilize the computing resources. We apply lossy compression to chunked state vector to make the maximum number of qubits higher than the regular simulators, the compression also benefits the data movement between CPU and GPU.

Zhang, Boyuan↗