Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “DATA PROCESSOR”

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 451 records · Page 25

Recent advances in describing and driving crystal nucleation using machine learning and artificial intelligence

With the advent of faster computer processors and especially graphics processing units (GPUs) over the last few decades, the use of data-intensive machine learning (ML) and artificial intelligence (AI) has increased greatly, and the study of crystal nucleation has been one of the beneficiaries. In this study, we outline how ML and AI have been applied to address four outstanding difficulties of crystal nucleation: how to discover better reaction coordinates (RCs) for describing accurately non-classical nucleation situations; the development of more accurate force fields for describing the nucleation of multiple polymorphs or phases for a single system; more robust identification methods for determining crystal phases and structures; and as a method to yield improved course-grained models for studying nucleation.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

CMS readiness for multi-core workload scheduling

In the present run of the LHC, CMS data reconstruction and simulation algorithms benefit greatly from being executed as multiple threads running on several processor cores. The complexity of the Run 2 events requires parallelization of the code to reduce the memory-per- core footprint constraining serial execution programs, thus optimizing the exploitation of present multi-core processor architectures. The allocation of computing resources for multi-core tasks, however, becomes a complex problem in itself. The CMS workload submission infrastructure employs multi-slot partitionable pilots, built on HTCondor and GlideinWMS native features, to enable scheduling of single and multi-core jobs simultaneously. This provides a solution for the scheduling problem in a uniform way across grid sites running a diversity of gateways to compute resources and batch system technologies. This paper presents this strategy and the tools on which it has been implemented. The experience of managing multi-core resources at the Tier-0 and Tier-1 sites during 2015, along with the deployment phase to Tier-2 sites during early 2016 is reported. The process of performance monitoring and optimization to achieve efficient and flexible use of the resources is also described.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

SU-E-J-117: Verification Method for the Detection Accuracy of Automatic Winston Lutz Test

Purpose: Winston Lutz test (WLT) has been a standard QA procedure performed prior to SRS treatment, to verify the mechanical iso-center setup accuracy upon different Gantry/Couch movements. Several detection algorithms exist,for analyzing the ball-radiation field alignment automatically. However, the accuracy of these algorithms have not been fully addressed. Here, we reveal the possible errors arise from each step in WLT, and verify the software detection accuracy with the Rectilinear Phantom Pointer (RLPP), a tool commonly used for aligning treatment plan coordinate with mechanical iso-center. Methods: WLT was performed with the radio-opaque ball mounted on a MIS and irradiated onto EDR2 films. The films were scanned and processed with an in-house Matlab program for automatic iso-center detection. Tests were also performed to identify the errors arise from setup, film development and scanning process. The radioopaque ball was then mounted onto the RLPP, and offset laterally and longitudinally in 7 known positions ( 0, ±0.2, ±0.5, ±0.8 mm) manually for irradiations. The gantry and couch was set to zero degree for all irradiation. The same scanned images were processed repeatedly to check the repeatability of the software. Results: Miminal discrepancies (mean=0.05mm) were detected with 2 films overlapped and irradiated but developed separately. This reveals the error arise from film processor and scanner alone. Maximum setup errors were found to be around 0.2mm, by analyzing data collected from 10 irradiations over 2 months. For the known shift introduced using the RLPP, the results agree with the manual offset, and fit linearly (R{sup 2}>0.99) when plotted relative to the first ball with zero shift. Conclusion: We systematically reveal the possible errors arise from each step in WLT, and introduce a simple method to verify the detection accuracy of our in-house software using a clinically available tool.

60 APPLIED LIFE SCIENCES↗

Linear optimal power flow system and method

An electric power system or power grid is optimized using a computer-implemented tool the represents in computer memory the optimization function and at least one constraint, which the processor operates upon using a linear programming solver algorithm. The constraints are represented in memory as data structures that include both real and reactive power terms, corresponding to at least one of a power flow model and a transmission line model. The transmission line model is represented using a piecewise linear representation. The power flow model may also include for each node in the power system a real power loss term representing transmission line loss allocated to that node.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Simple coarse graining and sampling strategies for image recognition

A conceptually simple way to recognize images is to directly compare test-set data and training-set data. The accuracy of this approach is limited by the method of comparison used, and by the extent to which the training-set data covers the required configuration space. Here we show that this coverage can be substantially increased using simple strategies of coarse graining (replacing groups of images by their centroids) and sampling (using distinct sets of centroids in combination). We use the MNIST data set to show that coarse graining can be used to convert a subset of training images into about an order of magnitude fewer image centroids, with no loss of accuracy of classification of test-set images by direct (nearest-neighbor) classification. Distinct batches of centroids can be used in combination as a means of sampling configuration space, and can classify test-set data more accurately than can the unaltered training set. The approach works most naturally with multiple processors in parallel.

97 MATHEMATICS AND COMPUTING↗

Acoustic Source Localization via Distributed Sensor Networks using Tera-scale Optical-Core Devices

For real-time acoustic source localization applications, one of the primary challenges is the considerable growth in computational complexity associated with the emergence of ever larger, active or passive, distributed sensor networks. The complexity of the calculations needed to achieve accurate source localization increases dramatically with the size of sensor arrays, resulting in substantial growth of computational requirements that cannot be met with standard hardware. One option to meet this challenge builds upon the emergence of digital optical-core devices. The objective of this work was to explore the implementation of key building block algorithms used in underwater source localization on an optical-core digital processing platform recently introduced by Lenslet Inc. They investigate key concepts of threat-detection algorithms such as Time Difference Of Arrival (TDOA) estimation via sensor data correlation in the time domain with the purpose of implementation on the optical-core processor. they illustrate their results with the aid of numerical simulation and actual optical hardware runs. The major accomplishments of this research, in terms of computational speedup and numerical accurcy achieved via the deployment of optical processing technology, should be of substantial interest to the acoustic signal processing community.

99 GENERAL AND MISCELLANEOUS↗

Accurate, Fast and Scalable Kernel Ridge Regression on Parallel and Distributed Systems

Kernel Ridge Regression (KRR) is a fundamental method in machine learning. Given an n-by-d data matrix as input, a traditional implementation requires Θ(n2) memory to form an n-by-n kernel matrix and Θ(n3) flops to compute the final model. These time and storage costs prohibit KRR from scaling up to large datasets. For example, even on a relatively small dataset (a 520k-by-90 input requiring 357 MB), KRR requires 2 TB memory just to store the kernel matrix. Additionally, the reason is that n usually is much larger than d for real-world applications. On the other hand, weak scaling becomes a problem: if we keep d and n/p fixed as p grows (p is # machines), the memory needed grows as Θ(p) per processor and the flops as Θ(p2) per processor. In the perfect weak scaling situation, both the memory needed and the flops grow as Θ(1) per processor (i.e. memory and flops are constant). The traditional Distributed KRR implementation (DKRR) only achieved 0.32% weak scaling efficiency from 96 to 1536 processors. In this work, we propose two new methods to address these problems: the Balanced KRR (BKRR) and K-means KRR (KKRR). These methods consider alternative ways to partition the input dataset into p different parts, generating p different models, and then selecting the best model among them. Compared to a conventional implementation, KKRR2 (optimized version of KKRR) improves the weak scaling efficiency from 0.32% to 38% and achieves a 591x speedup for getting the same accuracy by using the same data and the same hardware (1536 processors). BKRR2 (optimized version of BKRR) achieves a higher accuracy than the current fastest method using less training time for a variety of datasets. For the applications requiring only approximate solutions, BKRR2 improves the weak scaling efficiency to 92% and achieves 3505x speedup (theoretical speedup: 4096x).

97 MATHEMATICS AND COMPUTING↗

Cryogenic thermal modeling of microwave high density signaling

Superconducting quantum computers require microwave control lines running from room temperature to the mixing chamber of a dilution refrigerator. Adding more lines without preliminary thermal modeling to make predictions risks overwhelming the cooling power at each thermal stage. In this paper, we investigate the thermal load of SC-086/50-SCN-CN semi-rigid coaxial cable, which is commonly used for the control and readout lines of a superconducting quantum computer, as we increase the number of lines to a quantum processor. We investigate the makeup of the coaxial cables, verify the materials and dimensions, and experimentally measure the total thermal conductivity of a single cable as a function of the temperature from cryogenic to room temperature values. We also measure the cryogenic DC electrical resistance of the inner conductor as a function of temperature, allowing for the calculation of active thermal loads due to Ohmic heating. Fitting this data produces a numerical thermal conductivity function used to calculate the static heat loads due to thermal transfer within the wires resulting from a temperature gradient. The resistivity data is used to calculate active heat loads, and we use these fits in a cryogenic model of a superconducting quantum processor in a typical Bluefors XLD1000-SL dilution refrigerator, investigating how the thermal load increases with processor sizes ranging from 100 to 225 qubits. We conclude that the theoretical upper limit of the described architecture is approximately 200 qubits. However, including an engineering margin in the cooling power and the available space for microwave readout circuitry at the mixing chamber, the practical limit is approximately 140 qubits.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Global-View Coefficients: A Data Management Solution for Parallel Quantum Monte Carlo Applications

Quantum Monte Carlo (QMC) applications perform simulation with respect to an initial state of the quantum mechanical system, which is often captured by using a cubic B-spline basis. This representation is stored as a read-only table of coefficients, and accesses to the table are generated at random as part of the Monte Carlo simulation. Current QMC applications, such as QWalk and QMCPACK, replicate this table at every process or node, which limits scalability because increasing the number of processors does not enable larger systems to be run. We present a partitioned global address space (PGAS) approach to transparently managing this data using Global Arrays in a manner that allows the memory of multiple nodes to be aggregated. We develop an automated data management system that significantly reduces communication overheads, enabling new capabilities for QMC codes. Experimental results with QWalk and QMCPACK demonstrate the effectiveness of the data management system.

Niu, Qingpeng↗

An automatic input/output test experience of FPGA-based logic controller with I/O stimulator - 282

This paper describes an automatic testing approach instead of a traditional manual test for an FPGA-based Logic Controller (FLC). It mainly describes an automatic testing of FLC using an I/O stimulator with the initiated manual action. The FLC was developed by Doosan Heavy Industry and KAERI in S. Korea. We also developed a test-bed like I/O stimulator for a burning test based on the operational scenario. Signal sources from the I/O stimulator contain an analog input, an analog output, a digital input and a digital output, a programmable power supply, an RS232C serial interface, and a dual port Ethernet interface. LabVIEW Programming was used for the automatic testing. The FLC consists of a general processor module (FPM-01), a complex processor module (FPM-02), analog input modules (FAI-01), analog output modules (FAO-01), digital input modules (FDI-01), digital output modules (FDO-01), a data link module (FDL-01), and a network module (FNW-01). Among these, in this paper, automatic digital I/O testing and automatic analog I/O testing are described. In addition, for the accuracy of the automatic testing, two graphic recorders are used. One is the output results of general processor based testing, and the other is the output results of complex processor based testing. These are different company products. Redundancy recording was found in the test results. The test results were synchronized internally with the existing I/O stimulator and externally with two graphic recorders. Calibrations of all of the equipment were made before the system testing. Before the testing started, a test plan and the test procedure were set up in advance, and we performed test scenario-based automatic functional testing for the FLC as the qualification process. It can be several executed depending on the scenario and conditional parameters of the test. For validation of the accuracy and reliability in our automated test, manual testing was also performed. Manual tests were conducted in two ways. The first one was a manual test using Fluke 754 and Fluke 715. The other one was using embedded manual features of the I/O stimulator. By performing the automatic input and output testing using the I/O stimulator, the time and expense of FLC testing can be reduced significantly compared with a conventional manual test. We rechecked the automatic test results using Fluke754 manually. (authors)

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Sensor Data Processing for Tracking Underwater Threats Using Terascale Optical Core Devices

A critical aspect of littoral surveillance (including port protection) involves the localization and tracking of underwater threats such as manned or unmanned autonomous underwater vehicles. In this article, we present a methodology for locating underwater threat sources from uncertain sensor network data, and illustrate the threat tracking aspects using active sonars in a matched filter framework. The novelty of the latter paradigm lies in its implementation on a tera-scale optical core processor, EnLight , recently introduced by Lenslet Laboratories. This processor is optimized for array operations, which it performs in a fixed point arithmetic architecture at tera-scale throughput. Using the EnLight 64 prototype processor, our results (i) illustrate the ability to reach a robust tracking accuracy, and (ii) demonstrate that a considerable speed-up (a factor of over 13,000) can be achieved when compared to an Intel XeonTM processor in the computation of sets of 80K-sample complex Fourier transforms that are associated with our matched filter techniques.

45 MILITARY TECHNOLOGY, WEAPONRY, AND NATIONAL DEF↗

High-performance dynamic quantum clustering on graphics processors

Clustering methods in machine learning may benefit from borrowing metaphors from physics. Dynamic quantum clustering associates a Gaussian wave packet with the multidimensional data points and regards them as eigenfunctions of the Schroedinger equation. The clustering structure emerges by letting the system evolve and the visual nature of the algorithm has been shown to be useful in a range of applications. Furthermore, the method only uses matrix operations, which readily lend themselves to parallelization. In this paper, we develop an implementation on graphics hardware and investigate how this approach can accelerate the computations. We achieve a speedup of up to two magnitudes over a multicore CPU implementation, which proves that quantum-like methods and acceleration by graphics processing units have a great relevance to machine learning.

97 MATHEMATICS AND COMPUTING↗

Software Barrier Performance on Dual Quad-Core Opterons

Multi-core processors based SMP servers have become building blocks for Linux clusters in recent years because they can deliver better performance for multi-threaded programs through on-chip multi-threading. However, a relative slow software barrier can hinder the performance of a data-parallel scientific application on a multi-core system. In this paper we study the performance of different software barrier algorithms on a server based on newly introduced AMD quad-core Opteron processors. We study how the memory architecture and the cache coherence protocol of the system influence the performance of barrier algorithms. We present an optimized barrier algorithm derived from the queue-based barrier algorithm. We find that the optimized barrier algorithm achieves speedup of 1.77 over the original queue-based algorithm. In addition, it has speedup of 2.39 over the software barrier generated by the Intel OpenMP compiler.

99 GENERAL AND MISCELLANEOUS↗

Searches for neutrino oscillations in the MiniBooNE experiment: neutrino and antineutrino occurrence analysis of the electron; Búsquedas de oscilaciones de neutrinos en el experimento MiniBooNE: análisis de aparición de neutrinos y antineutrinos del electrón

In this work we implemented the electron neutrino and antineutrino appearance oscillation analyses of the MiniBooNE experiment using the data publicly released by the Collaboration. The calculations were made with algorithms in C++ as well as in graphic processors using CUDA. We performed the analyses corresponding to the publications of 2007 and 2009 in neutrino mode, 2010 in antineutrino mode, and 2013 in neutrino and antineutrino modes, and constructed the confidence intervals in the oscillations parameter space for each case. The contours calculated in this work are indistinguishable from those reported by the MiniBooNE Collaboration when the frequentist corrections of Feldman and Cousins are not taken into account. After implementing these corrections small differences with respect to the official contours appear in the low signal regions, which are ascribed to the fake experiment generation method employed here, and that require further investigation. The best fit probabilities and null point, as the observed event excesses show small variations with respect to those reported in the publications, arising from a difference in the definition of the signal region employed here and forced by the format of the released data, and are consistent within errors. This work was carried out independently to the MiniBooNE Collaboration, and its results are not official. Antes que nada quiero agradecer a mi asesor el Dr. Alexis Aguilar Arévalo, con quien he estado trabajando desde mi servicio social, hace varios años ya. Con él he aprendido una gran variedad de temas: mis primeros programas serios fueron con su guía; principalmente de él adapté mi estilo de redacción de código, me enseñó más física experimental y estadística que lo que aprendí en toda la carrera; formando en mi lo que significa ser un buen experimentalista, mi perspectiva de la física de partículas elementales no podría ser tan amplia como lo es si no fuera por él; enseñándome la historia de los descubrimientos, así como las técnicas experimentales para hacerlos y la teoría que los explica. Mucho trabajo me costó, pero el conocimiento tan amplio que tengo sobre los neutrinos, experimental y teórico, se debe a la enorme paciencia de mi asesor. Mucho le agradezco haberme mandado a Fermilab, en donde fui parte de un activo y amable grupo de trabajo, en donde aprendí una forma distinta de hacer ciencia: mucho más colaborativa. Le agradezco su perfeccionismo y apoyo constante en todos estos años, sin los cuales no hubiera logrado enorgullecerme de esta tesis tanto como lo estoy ahora. Para mi es un rol a seguir, mostrándome la clase de físico en que me quiero convertir. Sobre todo le agradezco su amistad, gracias Alexis.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Unattended Multiplicity Shift Register

The Unattended Multiplicity Shift Register (UMSR) is a specialized pulse counter used primarily to count neutron events originating in neutron detection instruments. While the counter can be used to count any TTL input pulses, its unique ability to record time correlated events and the multiplicity distributions of these events makes it an ideal instrument for counting neutron events in the nuclear fields of material safeguards, waste assay and process monitoring and control. The UMSR combines the Los Alamos National Laboratory (LANL) simple and robust shift register design with a Commercial-Off-The-Shelf (COTS) processor and Ethernet communications. The UMSR is fully compatible with existing International Atomic Energy Agency (IAEA) neutron data acquisition instruments such as the Advance Multiplicity Shift Register (AMSR) and JSR-15. The UMSR has three input channels: a multiplicity shift register input and two auxiliary inputs. The UMSR provides 0V to 2kV of programmable High Voltage (HV) bias and both a 12V and a 5V detector power supply output. A serial over USB communication line to the UMSR allows the use of existing versions of INCC or MIC software while the Ethernet port is compatible with the new IAEA RAINSTORM communication protocol.

Newell, Matt↗

Method of processing an image

A non-transitory computer-readable medium encoded with a computer-readable program, which when executed by a processor, will cause a computer to execute a computational method, the computational method including collecting an image data, wherein the collecting the image data comprises collecting a first plurality of RGB images and a second plurality of hyperspectral images. The method further includes orthorectifying the image data to produce an RGB based orthophoto and a partially rectified hyperspectral orthophoto. The method further includes selecting tie features from each of the RGB based orthophoto and the partially rectified hyperspectral orthophoto. Lastly, the method includes registering the features of the partially rectified hyperspectral orthophoto into the tie features of the RGB based orthophoto.

97 MATHEMATICS AND COMPUTING↗

Method of processing an image

A non-transitory computer-readable medium encoded with a computer-readable program, which when executed by a processor, will cause a computer to execute a computational method, the computational method including collecting an image data, wherein the collecting the image data comprises collecting a first plurality of RGB images and a second plurality of hyperspectral images. The method further includes orthorectifying the image data to produce an RGB based orthophoto and a partially rectified hyperspectral orthophoto. The method further includes selecting tie features from each of the RGB based orthophoto and the partially rectified hyperspectral orthophoto. Lastly, the method includes registering the features of the partially rectified hyperspectral orthophoto into the tie features of the RGB based orthophoto.

97 MATHEMATICS AND COMPUTING↗

Method of processing an image

A non-transitory computer-readable medium encoded with a computer-readable program, which when executed by a processor, will cause a computer to execute a computational method, the computational method including collecting an image data, wherein the collecting the image data comprises collecting a first plurality of RGB images and a second plurality of hyperspectral images. The method further includes orthorectifying the image data to produce an RGB based orthophoto and a partially rectified hyperspectral orthophoto. The method further includes selecting tie features from each of the RGB based orthophoto and the partially rectified hyperspectral orthophoto. Lastly, the method includes registering the features of the partially rectified hyperspectral orthophoto into the tie features of the RGB based orthophoto.

97 MATHEMATICS AND COMPUTING↗