Pure-Rotational fs/ps CARS Measurements of Temperature and Concentration using a Second-Harmonic Bandwidth-Compressed Probe.
Abstract not provided.
SEARCH · Engineering Papers
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.
Abstract not provided.
Abstract not provided.
Abstract not provided.
Abstract not provided.
Abstract not provided.
Abstract not provided.
Explore the source record for details and available documents.
To take advantage of the smaller scale, higher density regime of fusion an efficient method for achieving the compressional heating required to reach fusion gain conditions must be found. What is proposed is a more flexible metallic liner compression scheme that minimizes the kinetic energy required to reach fusion. It is believed that it is possible to accomplish this at sub-megajoule energies. This however will require operation at very small scale. To have a realistic hope of inexpensive, repetitive operation, it is essential to have the liner kinetic energy under a megajoule which allows for the survivability of the vacuum and power systems. At small scale the implosion speed must be reasonably fast to maintain the magnetized plasma (FRC) equilibrium during compression. For limited liner kinetic energy, it becomes clear that the thinnest liner imploded to the smallest radius consistent with the requirements for FRC equilibrium lifetime is desired. The proposed work is directed toward accomplishing this goal. Typically an axial (Z) current is employed for liner compression. There are however several advantages to using a θ-pinch coil. With the θ-pinch the liner currents are inductively driven which greatly simplifies the apparatus and vacuum system, and avoids difficulties with the post implosion vacuum integrity. With fractional flux leakage, the foil liner automatically provides for the seed axial compression field. To achieve it with optimal switching techniques, and at an accelerated pace however will require additional funding. This extra expense is well justified as the compression technique that will be enabled by this funding is unique in the ability to implode individual segments of the liner at different times. This is highly advantageous as the liner can be imploded in a manner that maximizes the energy transfer to the FRC. Production of shaped liner implosions for additional axial compression can thus be readily accomplished with the modified power modules. The additional energy and switching capability proposed will thus provide for optimal utilization of the liner energy. The following tasks were outlined for the three year effort: (1) Design and assemble the foil liner compression test structure and chamber including the compression bank and test foils [Year 1]. (2) Perform foil liner compression experiments and obtain performance data over a range on liner dimensions and bank parameters [Year 2]. (3) Carry out compression experiments of the FRC plasma to Megagauss fields and measure key fusion parameters [Year 3]. (4) Develop numerical codes and analyze experimental results, and determine the physics and scaling for future work [Year 1-3]. The principle task of the project was to design and assemble the foil liner FRC formation chamber, the full compression test structure and chamber including the compression bank. This task was completed successfully. The second task was to test foils in the test facility constructed in year one and characterize the performance obtained from liner compression. These experimental measurements were then compared with analytical predictions, and numerical code results. The liner testing was completed and compared with both the analytical results as well as the code work performed with the 3D structural dynamics package of ANSYS Metaphysics®. This code is capable of modeling the dynamic behavior of materials well into the non-linear regime (e.g. a bullet hit plate glass). The liner dynamic behavior was found to be remarkably close to that predicted by the 3D structural dynamics results. Incorporating a code that can also include the magnetics and plasma physics has also made significant progress at the UW. The remaining test bed construction and assembly task is was completed, and the FRC formation and merging experiments were carried out as planned. The liner compression of the FRC to Megagauss fields was not performed due to not obtaining a sufficiently long lived FRC during the final year of the grant. Modifications planned to correct this deficiency included a larger FRC source as well as a much larger liner driver energy storage system. Due to discontinuation of the grant neither of these improvements were carried out.
The goal of this project has been to develop a lossless compression algorithm for message-passing libraries that can accelerate HPC systems by reducing the communication time. Because both compression and decompression have to be performed in software in real time, the algorithm has to be extremely fast while still delivering a good compression ratio. During the first half of this project, they designed a new compression algorithm called FPC for scientific double-precision data, made the source code available on the web, and published two papers describing its operation, the first in the proceedings of the Data Compression Conference and the second in the IEEE Transactions on Computers. At comparable average compression ratios, this algorithm compresses and decompresses 10 to 100 times faster than BZIP2, DFCM, FSD, GZIP, and PLMI on the three architectures tested. With prediction tables that fit into the CPU's L1 data acache, FPC delivers a guaranteed throughput of six gigabits per second on a 1.6 GHz Itanium 2 system. The C source code and documentation of FPC are posted on-line and have already been downloaded hundreds of times. To evaluate FPC, they gathered 13 real-world scientific datasets from around the globe, including satellite data, crash-simulation data, and messages from HPC systems. Based on the large number of requests they received, they also made these datasets available to the community (with permission of the original sources). While FPC represents a great step forward, it soon became clear that its throughput was too slow for the emerging 10 gigabits per second networks. Hence, no speedup can be gained by including this algorithm in an MPI library. They therefore changed the aim of the second half of the project. Instead of implementing FPC in an MPI library, they refocused their efforts to develop a parallel compression algorithm to further boost the throughput. After all, all modern high-end microprocessors contain multiple CPUs on a single die and will undoubtedly contain even larger numbers of CPUs in the future. Hence, a compute node in a parallel system is likely to have multiple processors per interconnection link. Thus, they investigated how to best exploit multiple CPUs to compress and decompress data for a single link, i.e., they developed a parallel version of the FPC algorithm called pFPC. On a 4-core 3 GHz Xeon system, pFPC exceeds 10 gigabits per second both in compression and decompression throughput while still reaching a compression ratio of 18%, which is reasonable for their double-precision floating-point datasets. At half this throughput, it achieves a 41% compression ratio. Moreover, the algorithm scales well to four cores and promises even higher throughputs on larger machines. Additional results and a description of the pFPC algorithm have recently been published in the proceedings of the Data Compression Conference. The C source code of pFPC is also publicly available.
Efficient handling of large volumes of data is a necessity for exascale scientific applications and database systems. To address the growing imbalance between the amount of available storage and the amount of data being produced by high speed (FLOPS) processors on the system, data must be compressed to reduce the total amount of data placed on the file systems. General-purpose loss less compression frameworks, such as zlib and bzlib2, are commonly used on datasets requiring loss less compression. Quite often, however, many scientific data sets compress poorly, referred to as hard-to-compress datasets, due to the negative impact of highly entropic content represented within the data. An important problem in better loss less data compression is to identify the hard-to-compress information and subsequently optimize the compression techniques at the byte-level. To address this challenge, we introduce the In-Situ Orthogonal Byte Aggregate Reduction Compression (ISOBAR-compress) methodology as a preconditioner of loss less compression to identify and optimize the compression efficiency and throughput of hard-to-compress datasets.
Data compression could ameliorate the I/O pressure of data-intensive scientific applications. Unfortunately, the conventional wisdom of naively applying data compression to the file or block brings the dilemma between efficient random accesses and high compression ratios. File-level compression barely supports efficient random accesses to the compressed data: any retrieval request need trigger the decompression from the beginning of the compressed file. Block-level compression provides flexible random accesses to the compressed blocks, but introduces extra overhead when applying the compressor to each and every block that results in a degraded overall compression ratio. This paper extends our prior work that introduces virtual chunks offering efficient random accesses to the compressed scientific data without sacrificing the compression ratio. Virtual chunks are logical blocks pointed at by appended references without breaking the physical continuity of the file content. These references allow the decompression to start from an arbitrary position (efficient random accesses), while no per-block overhead is introduced because the file’s physical entirety is retained (high compression ratio). One limitation of virtual chunk is it only supports static references. This paper presents the algorithms, analysis, and evaluations of dynamic virtual chunks to deal with the cases where the references are updated dynamically.
Purpose: While abdominal compression (AC) can be used to reduce respiratory liver motion in patients receiving helical tomotherapy for hepatocellular carcinoma, the nature and extent of this effect is not well described. The purpose of this study was to evaluate the changes in magnitude of three-dimensional liver motion with abdominal compression using four-dimensional (4D) computed tomography (CT) images of several plate positions. Methods: From January 2012 to October 2015, 72 patients with intrahepatic carcinoma and divided into four groups underwent 4D-CT scans to assess respiratory liver motion. Of the 72 patients, 19 underwent abdominal compression of the cephalic area between the subxiphoid and umbilicus (group A), 16 underwent abdominal compression of the caudal region between the subxiphoid area and the umbilicus (group B), 11 patients underwent abdominal compression of the caudal umbilicus (group C), and 26 patients remained free breathing (group D). 4D-CT images were sorted into ten-image series, according to the respiratory phase from the end inspiration to the end expiration, and then transferred to treatment planning software. All liver contours were drawn by a single physician and confirmed by a second physician. Liver relative coordinates were automatically generated to calculate the liver respiratory motion in different axial directions to compile the 10 ten contours into a single composite image. Differences in respiratory liver motion were assessed with a one-way analysis of variance test of significance. Results: The average respiratory liver motion in the Y axial direction was 4.53 ± 1.16, 7.56 ± 1.30, 9.95 ± 2.32, and 9.53 ± 2.62 mm in groups A, B, C, and D, respectively, with a significant change among the four groups (p < 0.001). Abdominal compression was most effective in group A (compression plate on the subxiphoid area), with liver displacement being 2.53 ± 0.93, 4.53 ± 1.16, and 2.14 ± 0.92 mm on the X-, Y-, and Z-axes, respectively. There was no significant difference in respiratory liver motion between group C (displacement: 3.23 ± 1.47, 9.95 ± 2.32, and 2.92 ± 1.10 mm on the X-, Y-, and Z-axes, respectively) and group D (displacement: 3.35 ± 1.55, 9.53 ± 2.62, and 3.35 ± 1.73 mm on the X-, Y-, and Z-axes, respectively). Abdominal compression was least effective in group C (compression on caudal umbilicus), with liver motion in this group similar to that of free-breathing patients (group D). Conclusions: 4D-CT scans revealed significant liver motion control via abdominal compression of the subxiphoid area; however, this control of liver motion was not observed with compression of the caudal umbilicus. The authors, therefore, recommend compression of the subxiphoid area in patients undergoing external radiotherapy for intrahepatic carcinoma.
Purpose: To quantify the effect of abdominal compression on duodenal motion during pancreatic radiotherapy. Methods: Seven patients treated for pancreatic cancer were selected for analysis. Four patients were treated with abdominal compression and three without. The duodenum was contoured by the same physician on each CBCT (five CBCTs for patients with compression, four for non-compression patients). CBCTs were rigidly registered using a soft tissue match and contours were copied to the delivered plans which were all radical (BED > 50 Gy). The distance between the duodenum on the planning CT and each CBCT was quantified by calculating the root mean square (RMS) distance. The DVHs of each abdominal compression patient was converted to an EQD2 DVH (alpha/beta = 10) using an in-house tool and volumes receiving at least 25, 35, 45, and 50 Gy were recorded. Results: The maximum variation in duodenal volumes on the CBCTs for the four abdominal compression patients were 19.1 cm{sup 3} (32.8%), 19.1 cm{sup 3} (20.6%), 19.9 cm{sup 3} (14.3%), and 12.9 cm{sup 3} (27.3%) compared to 15.2 cm{sup 3} (17.6%), 34.7 cm{sup 3} (83.4%), and 56 cm{sup 3} (60.2%) for non-compression patients. The average RMS distance between the duodenum on the planning CT and each CBCT for all abdominal compression patients was 0.3 cm compared to 0.7 cm for non-compressed patients. The largest (and average) difference between the planning CT and CBCTs in volume of duodenum receiving more than 25, 35, 45 and 50 Gy for abdominal compression patients was 11% (5%), 9% (3%), 9% (2%), and 6% (1%). Conclusion: Abdominal compression reduces variation in volume and absolute position of the duodenum throughout treatment. This is seen as an improvement but does not eliminate the need to consider dosimetric effects of motion. Abdominal compression is particularly useful in SBRT when only a few fractions are delivered. Alon Witztum is supported by an MRC/Gray Institute DPhil Studentship. Daniel Holyoake is supported by a CRUK/Nuffield Clinical Research Fellowship. Sam Warren and Mike Partridge are supported by CRUK grant C5255/A15935. Maria Hawkins received an MRC Fellowship MC-PC-12001/2.
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.
Unprecedented densities and temperatures are now achieved in compressions of plasma, by lasers and by pulsed power, in major experimental facilities. These compressions, carried out at the largest scale at the National Ignition Facility and at the Z Pulsed Power Facility, have important applications, including fusion, X-ray production, and materials research. Several experimental and simulation results suggest that the plasma in some of these compressions is turbulent. In fact, measurements suggest that in certain laboratory plasma compressions the turbulent energy is a dominant energy component. Similarly, turbulence is dominant in some compressing astrophysical plasmas, such as in molecular clouds. Turbulence need not be dominant to be important; even small quantities could greatly influence experiments that are sensitive to mixing of non-fuel into fuel, such as compressions seeking fusion ignition. Despite its important role in major settings, bulk plasma turbulence under compression is insufficiently understood to answer or even to pose some of the most fundamental questions about it. This thesis both identifies and answers key questions in compressing turbulent motion, while providing a description of the behavior of three-dimensional, isotropic, compressions of homogeneous turbulence with a plasma viscosity. This description includes a simple, but successful, new model for the turbulent energy of plasma undergoing compression. The unique features of compressing turbulence with a plasma viscosity are shown, including the sensitivity of the turbulence to plasma ionization, and a sudden viscous dissipation'' effect which rapidly converts plasma turbulent energy into thermal energy. This thesis then examines turbulence in both laboratory compression experiments and molecular clouds. It importantly shows: the possibility of exploiting turbulence to make fusion or X-ray production more efficient; conditions under which hot-spot turbulence can be prevented; and a lower bound on the growth of turbulence in molecular clouds. This bound raises questions about the level of dissipation in existing molecular cloud models. Finally, the observations originally motivating the thesis, Z-pinch measurements suggesting dominant turbulent energy, are reexamined by self-consistently accounting for the impact of the turbulence on the spectroscopic analysis. This is found to strengthen the evidence that the multiple observations describe a highly turbulent plasma state.
The next-generation radio astronomy instruments are providing a massive increase in sensitivity and coverage, largely through increasing the number of stations in the array and the frequency span sampled. The two primary problems encountered when processing the resultant avalanche of data are the need for abundant storage and the constraints imposed by I/O, as I/O bandwidths drop significantly on cold storage. An example of this is the data deluge expected from the SKA Telescopes of more than 60 PB per day, all to be stored on the buffer filesystem. While compressing the data is an obvious solution, the impacts on the final data products are hard to predict. In this paper, we chose an error-controlled compressor – MGARD – and applied it to simulated SKA-Mid and real pathfinder visibility data, in noise-free and noise-dominated regimes. As the data have an implicit error level in the system temperature, using an error bound in compression provides a natural metric for compression. MGARD ensures the compression incurred errors adhere to the user-prescribed tolerance. To measure the degradation of images reconstructed using the lossy compressed data, we proposed a list of diagnostic measures, exploring the trade-off between these error bounds and the corresponding compression ratios, as well as the impact on science quality derived from the lossy compressed data products through a series of experiments. We studied the global and local impacts on the output images for continuum and spectral line examples. We found relative error bounds of as much as 10%, which provide compression ratios of about 20, have a limited impact on the continuum imaging as the increased noise is less than the image RMS, whereas a 1% error bound (compression ratio of 8) introduces an increase in noise of about an order of magnitude less than the image RMS. For extremely sensitive observations and for very precious data, we would recommend a 0.1% error bound with compression ratios of about 4. These have noise impacts two orders of magnitude less than the image RMS levels. At these levels, the limits are due to instabilities in the deconvolution methods. We compared the results to the alternative compression tool DYSCO, in both the impacts on the images and in the relative flexibility. MGARD provides better compression for similar error bounds and has a host of potentially powerful additional features.