Orbital operations study - A triadic decimal digit printer-reader unit, preliminary design considerations Technical report no. 6
Triadic digit reader and printer for automatic data processing system
READING MACHINE↗
SEARCH · Search NASA
Results for “decimated”
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.
Decimated Input Ensembles for Improved Generalization
Recently, many researchers have demonstrated that using classifier ensembles (e.g., averaging the outputs of multiple classifiers before reaching a classification decision) leads to improved performance for many difficult generalization problems. However, in many domains there are serious impediments to such "turnkey" classification accuracy improvements. Most notable among these is the deleterious effect of highly correlated classifiers on the ensemble performance. One particular solution to this problem is generating "new" training sets by sampling the original one. However, with finite number of patterns, this causes a reduction in the training patterns each classifier sees, often resulting in considerably worsened generalization performance (particularly for high dimensional data domains) for each individual classifier. Generally, this drop in the accuracy of the individual classifier performance more than offsets any potential gains due to combining, unless diversity among classifiers is actively promoted. In this work, we introduce a method that: (1) reduces the correlation among the classifiers; (2) reduces the dimensionality of the data, thus lessening the impact of the 'curse of dimensionality'; and (3) improves the classification performance of the ensemble.
Tumer, Kagan↗
Non-Maximally Decimated Filter Banks Enable Adaptive Frequency Hopping for Unmanned Aircraft Vehicles
In the last few years, radio technologies for unmanned aircraft vehicle (UAV) have advanced very rapidly. The increasing need to fly unmanned aircraft systems (UAS) in the national airspace system (NAS) to perform missions of vital importance to national security, defense, and science has pushed ahead the design and implementation of new radio platforms. However, a lot still has to be done to improve those radios in terms of performance and capabilities. In addition, an important aspect to account for is hardware cost and the feasibility to implement these radios using commercial off-the-shelf (COTS) components. UAV radios come with numerous technical challenges and their development involves contributions at different levels of the design. Cognitive algorithms need to be developed in order to perform agile communications using appropriate frequency allocation while maintaining safe and efficient operations in the NAS and, digital reconfigurable architectures have to be designed in order to ensure a prompt response to environmental changes. Command and control (C2) communications have to be preserved during "standard" operations while crew operations have to be minimized. It is clear that UAV radios have to be software-defined systems, where size, weight and power consumption (SWaP) are critical parameters. This paper provides preliminary results of the efforts performed to design a fully digital radio architecture as part of a NASA Phase I STTR. In this paper, we will explain the basic idea and technical principles behind our dynamic/adaptive frequency hopping radio for UAVs. We will present our Simulink model of the dynamic FH radio transmitter design for UAV communications and show simulation results and FPGA system analysis.
UAV↗
Digital Filter ASIC for NASA Deep Space Radio Science
This paper is about the implementation of an 80 MHz, 16-bit, multi-stage digital filter to decimate by 1600, providing a 50 kHz output with bandpass ripple of less than +/-0.1 dB. The chip uses two decimation by five units and six decimations by two executed by a single decimation by two units. The six decimations by two consist of six halfband filters, five having 30-taps and one having 51-taps. Use of a 16x16 register file for the digital delay lines enables implementation in the Vitesse 350K gate array.
Digital Filter↗
Optimized FPGA Implementation of Multi-Rate FIR Filters Through Thread Decomposition
Multi-rate finite impulse response (MRFIR) filters are among the essential signal-processing components in spaceborne instruments where finite impulse response filters are often used to minimize nonlinear group delay and finite precision effects. Cascaded (multistage) designs of MRFIR filters are further used for large rate change ratio in order to lower the required throughput, while simultaneously achieving comparable or better performance than single-stage designs. Traditional representation and implementation of MRFIR employ polyphase decomposition of the original filter structure, whose main purpose is to compute only the needed output at the lowest possible sampling rate. In this innovation, an alternative representation and implementation technique called TD-MRFIR (Thread Decomposition MRFIR) is presented. The basic idea is to decompose MRFIR into output computational threads, in contrast to a structural decomposition of the original filter as done in the polyphase decomposition. A naive implementation of a decimation filter consisting of a full FIR followed by a downsampling stage is very inefficient, as most of the computations performed by the FIR state are discarded through downsampling. In fact, only 1/M of the total computations are useful (M being the decimation factor). Polyphase decomposition provides an alternative view of decimation filters, where the downsampling occurs before the FIR stage, and the outputs are viewed as the sum of M sub-filters with length of N/M taps. Although this approach leads to more efficient filter designs, in general the implementation is not straightforward if the numbers of multipliers need to be minimized. In TD-MRFIR, each thread represents an instance of the finite convolution required to produce a single output of the MRFIR. The filter is thus viewed as a finite collection of concurrent threads. Each of the threads completes when a convolution result (filter output value) is computed, and activated when the first input of the convolution becomes available. Thus, the new threads get spawned at exactly the rate of N/M, where N is the total number of taps, and M is the decimation factor. Existing threads retire at the same rate of N/M. The implementation of an MRFIR is thus transformed into a problem to statically schedule the minimum number of multipliers such that all threads can be completed on time. Solving the static scheduling problem is rather straightforward if one examines the Thread Decomposition Diagram, which is a table-like diagram that has rows representing computation threads and columns representing time. The control logic of the MRFIR can be implemented using simple counters. Instead of decomposing MRFIRs into subfilters as suggested by polyphase decomposition, the thread decomposition diagrams transform the problem into a familiar one of static scheduling, which can be easily solved as the input rate is constant.
Kobayashi, Kayla N.↗
SIRIUS: Enabling Progressive Data Exploration for Extreme-Scale Scientific Data
Scientific simulations on high performance computing (HPC) platforms generate large quantities of data. To bridge the widening gap between compute and I/O, and enable data to be more efficiently stored and analyzed, simulation outputs need to be refactored, reduced, and appropriately mapped to storage tiers. However, a systematic solution to support these steps has been lacking in the current HPC software ecosystem. To that end, this paper develops SIRIUS, a progressive JPEG-like data management scheme for storing and analyzing big scientific data. It co-designs data decimation, compression, and data storage, taking the hardware characteristics of each storage tier into considerations. With reasonably low overhead, our approach refactors simulation data, using either topological or uniform decimation, into a much smaller, reduced-accuracy base dataset, and a series of deltas that is used to augment the accuracy if needed. The base dataset and deltas are compressed and written to multiple storage tiers. Data saved on different tiers can then be selectively retrieved to restore the level of accuracy that satisfies data analytics. Thus, SIRIUS provides a paradigm shift towards elastic data analytics and enables end users to make trade-offs between analysis speed and accuracy on-the-fly. This paper further develops algorithms to preserve statistics for data decimation, a common requirement for reducing data. Here, we assess the impact of SIRIUS on unstructured triangular meshes, a pervasive data model used in scientific simulations. In particular, we evaluate two realistic use cases: the blob detection in fusion and high-pressure area extraction in computational fluid dynamics.
97 MATHEMATICS AND COMPUTING↗
RELAP5-3D Restart and Backup Verification Testing
Existing testing methodology for RELAP5-3D employs a set of test cases collected over two decades to test a variety of code features and run on a Linux or Windows platform. However, this set has numerous deficiencies in terms of code coverage, detail of comparison, running time, and testing fidelity of RELAP5-3D restart and backup capabilities. The test suite covers less than three quarters of the lines of code in the relap directory and just over half those in the environmental library. Even in terms of code features, many are not covered. Moreover, the test set runs many problems long past the point necessary to test the relevant features. It requires standard problems to run to completion. This is unnecessary for features can be tested in a short-running problem. For example, many trips and controls can be tested in the first few time steps, as can a number of fluid flow options. The testing system is also inaccurate. For the past decade, the diffem script has been the primary tool for checking that printouts from two different RELAP5-3D executables agree. This tool compares two output files to verify that all characters are the same except for those relating to date, time and a few other excluded items. The variable values printed on the output file are accurate to no more than eight decimal places. Therefore, calculations with errors in decimal places beyond those printed remain undetected. Finally, fidelity of restart is not tested except in the PVM sub-suite and backup is not specifically tested at all. When a restart is made from any midway point of the base-case transient, the restart must produce the same values. When a backup condition occurs, the code repeats advancements with the same time step. A perfect backup can be tested by forcing RELAP5 to perform a backup by falsely setting a backup condition flag at a user-specified-time. Comparison of the calculations of that run and those produced by the same input w/o the spurious condition should be identical. Backup testing is more difficult the other kinds of testing described above because it requires additional coding to implement. The testing system constructed and described in this document resolves all of these issues. A matrix of test features and short-running cases that exercise them is presented. A small information file that contains sufficient data to verify calculations to the last decimal place and bit is produced. This testing system is used to test base cases (called null testing) as well as restart and backup cases. The programming that implements these new capabilities is presented.
22 GENERAL STUDIES OF NUCLEAR REACTORS↗
The autocorrelation structure of Tausworthe pseudorandom number generators
An algorithm for determining the autocorrelation structure of a new sequence generated from an original sequence by proper decimation (a shift with each q-th term of the original sequence used) is presented, once autocorrelations for any repeating number sequence are known. The autocorrelation structure of the Tausworthe random number generator (RNG), based on proper decimation by q, is accepted as a RNG structure in which a proper decimation generates a long interval over which autocorrelations are small for all shifts. It is shown that if L bits of an N-bit Tausworthe RNG are L-bit binary numbers, L + 1 levels of correlation will exist, and L levels of correlation will each occur twice per RNG cycle length.
Neuman, F.↗
Robust Fuzzy Controllers Using FPGAs
Electro-mechanical device controllers typically come in one of three forms, proportional (P), Proportional Derivative (PD), and Proportional Integral Derivative (PID). Two methods of control are discussed in this paper; they are (1) the classical technique that requires an in-depth mathematical use of poles and zeros, and (2) the fuzzy logic (FL) technique that is similar to the way humans think and make decisions. FL controllers are used in multiple industries; examples include control engineering, computer vision, pattern recognition, statistics, and data analysis. Presented is a study on the development of a PD motor controller written in very high speed hardware description language (VHDL), and implemented in FL. Four distinct abstractions compose the FL controller, they are the fuzzifier, the rule-base, the fuzzy inference system (FIS), and the defuzzifier. FL is similar to, but different from, Boolean logic; where the output value may be equal to 0 or 1, but it could also be equal to any decimal value between them. This controller is unique because of its VHDL implementation, which uses integer mathematics. To compensate for VHDL's inability to synthesis floating point numbers, a scale factor equal to 10(sup (N/4) is utilized; where N is equal to data word size. The scaling factor shifts the decimal digits to the left of the decimal point for increased precision. PD controllers are ideal for use with servo motors, where position control is effective. This paper discusses control methods for motion-base platforms where a constant velocity equivalent to a spectral resolution of 0.25 cm(exp -1) is required; however, the control capability of this controller extends to various other platforms.
Monroe, Author Gene S., Jr.↗
Gaps labeling theorem for the bubble-diamond self-similar graphs
Abstract Motivated by the appearance of fractals in several areas of physics, especially in solid state physics and the physics of aperiodic order, and in other sciences, including the quantum information theory, we present a detailed spectral analysis for a new class of fractal-type diamond graphs, referred to as bubble-diamond graphs, and provide a gap-labeling theorem in the sense of Bellissard for the corresponding probabilistic graph Laplacians using the technique of spectral decimation. Labeling the gaps in the Cantor set by the normalized eigenvalue counting function, also known as the integrated density of states, we describe the gap labels as orbits of a second dynamical system that reflects the branching parameter of the bubble construction and the decimation structure. The spectrum of the natural Laplacian on limit graphs is shown generically to be pure point supported on a Cantor set, though one particular graph has a mixture of pure point and singularly continuous components.
Physics↗
Tensor network method for reversible classical computation
We develop a tensor network technique that can solve universal reversible classical computational problems, formulated as vertex models on a square lattice [Nat. Commun. 8, 15303 (2017)]. By encoding the truth table of each vertex constraint in a tensor, the total number of solutions compatible with partial inputs and outputs at the boundary can be represented as the full contraction of a tensor network. We introduce an iterative compression-decimation (ICD) scheme that performs this contraction efficiently. The ICD algorithm first propagates local constraints to longer ranges via repeated contraction-decomposition sweeps over all lattice bonds, thus achieving compression on a given length scale. It then decimates the lattice via coarse-graining tensor contractions. Repeated iterations of these two steps gradually collapse the tensor network and ultimately yield the exact tensor trace for large systems, without the need for manual control of tensor dimensions. Our protocol allows us to obtain the exact number of solutions for computations where a naive enumeration would take astronomically long times.
75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
Spatiotemporally Adaptive Compression for Scientific Dataset with Feature Preservation – A Case Study on Simulation Data with Extreme Climate Events Analysis
Scientific discoveries are increasingly constrained by limited storage space and I/O capacities. For time-series simulations and experiments, their data often need to be decimated over timesteps to accommodate storage and I/O limitations. In this paper, we propose a technique that addresses storage costs while improving post-analysis accuracy through spatiotemporal adaptive, error-controlled lossy compression. We investigate the trade-off between data precision and temporal output rates, revealing that reducing data precision and increasing timestep frequency lead to more accurate analysis outcomes. Additionally, we integrate spatiotemporal feature detection with data compression and demonstrate that performing adaptive error-bounded compression in higher dimensional space enables greater compression ratios, leveraging the error propagation theory of a transformation-based compressor. To evaluate our approach, we conduct experiments using the well-known E3SM climate simulation code and apply our method to compress variables used for cyclone tracking. Our results show a significant reduction in storage size while enhancing the quality of cyclone tracking analysis, both quantitatively and qualitatively, in comparison to the prevalent timestep decimation approach. Compared to three state-of-the-art lossy compressors lacking feature preservation capabilities, our adaptive compression framework improves perfectly matched cases in TC tracking by 26.4-51.3% at medium compression ratios and by 77.3-571.1% at large compression ratios, with a merely 5–11% computational overhead.
Gong, Qian↗
SU-E-T-10: A Dosimetric Comparison of Copper to Lead-Alloy Apertures for Electron Beam Therapy
Purpose: To evaluate dosimetric differences of copper compared to conventional lead-alloy apertures for electron beam therapy. Methods: Copper apertures were manufactured by .decimal, Inc. and matching lead-alloy, Cerrobend, apertures were constructed for 32 square field sizes (2×2 – 20×20 cm{sup 2}) for five applicator sizes (6×6–25×25 cm{sup 2}). Percent depth-dose and off-axis-dose profiles were measured using an electron diode in water with copper and Cerrobend apertures for a subset of aperture sizes (6×6, 10×10, 25×25 cm{sup 2}) and energies (6, 12, 20 MeV). Dose outputs were measured for all field size-aperture combinations and available energies (6–20 MeV). Measurements were taken at 100 and 110 cm SSDs. Using this data, 2D planar absolute dose distributions were constructed and compared. Passing criteria were ±2% of maximum dose or 1-mm distance-to-agreement for 99% of points. Results: A gamma analysis of the beam dosimetry showed 93 of 96 aperture size, applicator, energy, and SSD combinations passed the 2%/1mm criteria. Failures were found for small field size-large applicator combinations at 20 MeV and 100-cm SSD. Copper apertures showed a decrease in bremsstrahlung production due to copper's lower atomic number compared to Cerrobend (greatest difference was 2.5% at 20 MeV). This effect was most prominent at the highest energies with large amounts of shielding material present (small field size-large applicator). Also, an increase in electrons scattered from the collimator edge of copper compared to Cerrobend resulted in an increased dose at the field edge for copper at shallow depths (greatest increase was 1% at 20 MeV). Conclusion: Apertures for field sizes ≥6×6 cm{sup 2} at any energy, or for small fields (≤4×4 cm{sup 2}) at energies <20 MeV, showed dosimetric differences less than 2%/1mm for more than 99% of points. All field size-applicator size-energy combinations passed 3%/1mm criteria for 100% of points. Work partially funded by .decimal, Inc. (Sanford, FL)
07 ISOTOPE AND RADIATION SOURCES↗
Extracting the Data From the LCM vk4 Formatted Output File
These are slides about extracting the data from the LCM vk4 formatted output file. The following is covered: vk4 file produced by Keyence VK Software, custom analysis, no off the shelf way to read the file, reading the binary data in a vk4 file, various offsets in decimal lines, finding the height image data, directly in MATLAB, binary output beginning of height image data, color image information, color image binary data, color image decimal and binary data, MATLAB code to read vk4 file (choose a file, read the file, compute offsets, read optical image, laser optical image, read and compute laser intensity image, read height image, timing, display height image, display laser intensity image, display RGB laser optical images, display RGB optical images, display beginning data and save images to workspace, gamma correction subroutine), reading intensity form the vk4 file, linear in the low range, linear in the high range, gamma correction for vk4 files, computing the gamma intensity correction, observations.
96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗
Quantifying Moss Response to Metal Contaminant Exposure Using Laser-Induced Fluorescence
Tracing sources of contamination, including potentially toxic elements (PTEs), has historically been achieved through sampling and analysis of soil or biota, which are labor-intensive, costly, and destructive methods. Thus, availability of a non-destructive in situ remote sensing method for monitoring metals deposited in biota is of great interest. Laser-induced fluorescence (LIF) is an emerging spectroscopic and imaging technique that documents changes in molecular energy level in plants as a biological response to metal contamination. For a proof-of-concept study and preliminary experiment, moss was selected for experimentation due to its long history of use in tracing atmospheric deposition of PTEs. Consecutive treatments of copper chloride (CuCl2) were administered to three moss samples, simulating wet deposition every 48 h over 10 days until reaching cumulative Cu concentrations of 2.690 to 8.075 μmol/cm2. While these Cu amounts are above environmentally relevant concentrations, they allowed the best conditions for testing and fine tuning of the imaging and data processing protocols presented in this paper. Moss fluorescence was induced using both 532 nm green and 355 nm UV lasers. A CMOS camera captured images of the LIF response, and red–green–blue (RGB) decimal code values were extracted for each pixel in the images, and pixel densities of color channels from treated and untreated moss samples were compared. Results show a shift towards lower color decimal codes corresponding to increased Cu concentration. We developed and contrasted multiple quantitative analyses of color distributions and demonstrated that LIF shows great promise for remote sensing of Cu accumulation in moss at μmol/cm2 levels. Though currently, the method would be limited to highly toxic sites, it illustrates the possibility and provides a framework for development of higher-sensitivity methods to detect nmol/cm2 that are viable for urban contamination level monitoring.
63 RADIATION, THERMAL, AND OTHER ENVIRON. POLLUTAN↗
Universal interface enables one recorder to serve numerous measuring instruments
Circuit handles data, regardless of polarity and amplitude, in 10-line decimal form or in any form of binary coded decimal. When measuring instruments have common chassis grounds, Zener diodes prevent low-leak circulating currents from unbalancing the circuit.
Donlin, N. E.↗
Extended precision software packages
A description of three extended precision packages is presented along with three small conversion subroutines which can be used in conjunction with the extended precision packages. These extended packages represent software packages written in FORTRAN 4. They contain normalized or unnormalized floating point arithmetic with symmetric rounding and arbitrary mantissa lengths, and normalized floating point interval arithmetic with appropriate rounding. The purpose of an extended precision package is to enable the user to use and manipulate numbers with large decimal places as well as those with small decimal places where precision beyond double precision is required.
Phillips, E. J.↗
Commensurate states on incommensurate lattices
A simple one-dimensional model related to flux quantization on superconducting networks or charged particles on a substrate is proposed to investigate whether commensurate states can exist on incommensurate lattices. For both periodic and quasi-crystalline patterns, a set of low-energy states is found which is related to decimation symmetry and periodicity. It is suggested that the present quasi-periodic arrays which possess a decimation operation can be generalized to more-dimensional quasi-crystalline systems.
Grest, Gary S.↗