Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “VECTOR PROCESSING”

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,225 records · Page 68

Controlling Flexible Robot Arms Using High Speed Dynamics Process

A robot manipulator controller for a flexible manipulator arm having plural bodies connected at respective movable hinges and flexible in plural deformation modes corresponding to respective modal spatial influence vectors relating deformations of plural spaced nodes of respective bodies to the plural deformation modes, operates by computing articulated body quantities for each of the bodies from respective modal spatial influence vectors, obtaining specified body forces for each of the bodies, and computing modal deformation accelerations of the nodes and hinge accelerations of the hinges from the specified body forces, from the articulated body quantities and from the modal spatial influence vectors. In one embodiment of the invention, the controller further operates by comparing the accelerations thus computed to desired manipulator motion to determine a motion discrepancy, and correcting the specified body forces so as to reduce the motion discrepancy. The manipulator bodies and hinges are characterized by respective vectors of deformation and hinge configuration variables, and computing modal deformation accelerations and hinge accelerations is carried out for each one of the bodies beginning with the outermost body by computing a residual body force from a residual body force of a previous body and from the vector of deformation and hinge configuration variables, computing a resultant hinge acceleration from the body force, the residual body force and the articulated hinge inertia, and revising the residual body force modal body acceleration.

Jain, Abhinandan↗

Quasi-Steady Acceleration Direction Indicator in Three Dimensions

Many materials processing and fluids physics experiments conducted in a microgravity environment require knowledge of the orientation of the low-frequency acceleration vector. This need becomes especially acute for space experiments such as directional solidification of a molten semiconductor, which is extremely sensitive to orientation and may involve tens of hours of operations of a materials furnace. These low-frequency acceleration data have been measured for many Shuttle missions with the Orbital Acceleration Research Experiment. Previous attempts at using fluid chambers for acceleration measurements have met with limited success due to pointing and vehicle attitude complications. An acceleration direction indicator is described, which is comprised of two orthogonal short cylinders of fluid, each with a small bubble. The motion and the position of the bubble within the chamber will indicate the direction of the acceleration experienced at the sensor location. The direction of the acceleration vector may then be calculated from these data. The frequency response of such an instrument may be tailored for particular experiments with the proper selection of fluid and gas parameters, surface type, and geometry. A three-dimensional system for sensing and displaying the low-frequency acceleration direction via an innovative technique described in this paper has advantages in terms of size, mass, and power compared with electronic instrumentation systems.

DeLombard, Richard↗

Performance of BLAS 3, FFTs and NAS Parallel Benchmarks on Cray T3D

Recently, a Cray T3D Emulator has been made available on the Cray Y-MP and C90 computers. The Pittsburgh Supercomputer Center has acquired a CRAY T3D system and many other centers like Jet Propulsion Laboratory (JPL) will have it by the end of 1994. The Cray T3D system is the firstphase system in Cray Research, Inc.'s (CRI) three-phase massively parallel processing (MPP) program. This system features a heterogeneous architecture that closely couples DEC's ALPHA microprocessors and CRI's parallel-vector technology, i.e. the Cray Y-MP and Cray C90. The Cray T3D Emulator will give prospective users a valuable experience in developing high performance applications on the MPP system. This emulator runs programs written in CRI's MPP Fortran programming model (data sharing and work sharing) or Parallel Virtual Machine (PVM) programming model. It will help the users to study data layout, data locality, and data reference patterns thereby providing feedback which will enable one to write more efficient parallel codes. An overview of the Cray T3D hardware, software, and three of its available programming models is presented.The Cray Fortran Programming Model comprising (a) Data Sharing, (b) Worksharing and (c) Message Passing, will be discussed with examples. We have also implemented distributed BLAS 3 (matrix-matrix multiplication) in data parallel model (using only CSHIFT); worksharing model using block distribution and collapsed distribution; and message passing model using PVM. We have also implemented 2D and 3D FFTs for radix-2 using PVM. The performance of NAS Parallel 'Benchmarks (NPB) on CRAY T3D will be compared with other highly parallel systems such as CM-5, Paragon, C90 etc.

Saini, Subhash↗

High Performance Programming Using Explicit Shared Memory Model on Cray T3D1

The Cray T3D system is the first-phase system in Cray Research, Inc.'s (CRI) three-phase massively parallel processing (MPP) program. This system features a heterogeneous architecture that closely couples DEC's Alpha microprocessors and CRI's parallel-vector technology, i.e., the Cray Y-MP and Cray C90. An overview of the Cray T3D hardware and available programming models is presented. Under Cray Research adaptive Fortran (CRAFT) model four programming methods (data parallel, work sharing, message-passing using PVM, and explicit shared memory model) are available to the users. However, at this time data parallel and work sharing programming models are not available to the user community. The differences between standard PVM and CRI's PVM are highlighted with performance measurements such as latencies and communication bandwidths. We have found that the performance of neither standard PVM nor CRI s PVM exploits the hardware capabilities of the T3D. The reasons for the bad performance of PVM as a native message-passing library are presented. This is illustrated by the performance of NAS Parallel Benchmarks (NPB) programmed in explicit shared memory model on Cray T3D. In general, the performance of standard PVM is about 4 to 5 times less than obtained by using explicit shared memory model. This degradation in performance is also seen on CM-5 where the performance of applications using native message-passing library CMMD on CM-5 is also about 4 to 5 times less than using data parallel methods. The issues involved (such as barriers, synchronization, invalidating data cache, aligning data cache etc.) while programming in explicit shared memory model are discussed. Comparative performance of NPB using explicit shared memory programming model on the Cray T3D and other highly parallel systems such as the TMC CM-5, Intel Paragon, Cray C90, IBM-SP1, etc. is presented.

Simon, Horst D.↗

NEPP Processor Enclave: Testing Artificial Intelligence & Machine Learning

Computational device families are converging and multiple EEE components are required for a complete HPC subsystem. The components of this “processor enclave” are sensitive to radiation effects and therefore must be characterized for mission assurance. NEPP’s standardized approach to testing the Processor Enclave includes math, graphics, and AI and Machine Learning test vectors and device hardware capable of these applications.

Radiation testing↗

Universal Decoder for PPM of any Order

A recently developed algorithm for demodulation and decoding of a pulse-position- modulation (PPM) signal is suitable as a basis for designing a single hardware decoding apparatus to be capable of handling any PPM order. Hence, this algorithm offers advantages of greater flexibility and lower cost, in comparison with prior such algorithms, which necessitate the use of a distinct hardware implementation for each PPM order. In addition, in comparison with the prior algorithms, the present algorithm entails less complexity in decoding at large orders. An unavoidably lengthy presentation of background information, including definitions of terms, is prerequisite to a meaningful summary of this development. As an aid to understanding, the figure illustrates the relevant processes of coding, modulation, propagation, demodulation, and decoding. An M-ary PPM signal has M time slots per symbol period. A pulse (signifying 1) is transmitted during one of the time slots; no pulse (signifying 0) is transmitted during the other time slots. The information intended to be conveyed from the transmitting end to the receiving end of a radio or optical communication channel is a K-bit vector u. This vector is encoded by an (N,K) binary error-correcting code, producing an N-bit vector a. In turn, the vector a is subdivided into blocks of m = log2(M) bits and each such block is mapped to an M-ary PPM symbol. The resultant coding/modulation scheme can be regarded as equivalent to a nonlinear binary code. The binary vector of PPM symbols, x is transmitted over a Poisson channel, such that there is obtained, at the receiver, a Poisson-distributed photon count characterized by a mean background count nb during no-pulse time slots and a mean signal-plus-background count of ns+nb during a pulse time slot. In the receiver, demodulation of the signal is effected in an iterative soft decoding process that involves consideration of relationships among photon counts and conditional likelihoods of m-bit vectors of coded bits. Inasmuch as the likelihoods of all the m-bit vectors of coded bits mapping to the same PPM symbol are correlated, the best performance is obtained when the joint mbit conditional likelihoods are utilized. Unfortunately, the complexity of decoding, measured in the number of operations per bit, grows exponentially with m, and can thus become prohibitively expensive for large PPM orders. For a system required to handle multiple PPM orders, the cost is even higher because it is necessary to have separate decoding hardware for each order. This concludes the prerequisite background information. In the present algorithm, the decoding process as described above is modified by, among other things, introduction of an lbit marginalizer sub-algorithm. The term "l-bit marginalizer" signifies that instead of m-bit conditional likelihoods, the decoder computes l-bit conditional likelihoods, where l is fixed. Fixing l, regardless of the value of m, makes it possible to use a single hardware implementation for any PPM order. One could minimize the decoding complexity and obtain an especially simple design by fixing l at 1, but this would entail some loss of performance. An intermediate solution is to fix l at some value, greater than 1, that may be less than or greater than m. This solution makes it possible to obtain the desired flexibility to handle any PPM order while compromising between complexity and loss of performance.

Moision, Bruce E.↗

Realistic Covariance Prediction for the Earth Science Constellation

Routine satellite operations for the Earth Science Constellation (ESC) include collision risk assessment between members of the constellation and other orbiting space objects. One component of the risk assessment process is computing the collision probability between two space objects. The collision probability is computed using Monte Carlo techniques as well as by numerically integrating relative state probability density functions. Each algorithm takes as inputs state vector and state vector uncertainty information for both objects. The state vector uncertainty information is expressed in terms of a covariance matrix. The collision probability computation is only as good as the inputs. Therefore, to obtain a collision calculation that is a useful decision-making metric, realistic covariance matrices must be used as inputs to the calculation. This paper describes the process used by the NASA/Goddard Space Flight Center's Earth Science Mission Operations Project to generate realistic covariance predictions for three of the Earth Science Constellation satellites: Aqua, Aura and Terra.

Duncan, Matthew↗

Spinning no-scale $${\mathcal {F}}$$-SU(5) in the right direction

Abstract The Fermi National Accelerator Laboratory (FNAL) recently announced confirmation of the Brookhaven National Lab (BNL) measurements of the $$g-2$$ g - 2 of the muon that uncovered a discrepancy with the theoretically calculated Standard Model value. We suggest an explanation for the combined BNL+FNAL 4.2 $$\sigma $$ σ deviation within the supersymmetric grand unification theory (GUT) model No-Scale $${\mathcal {F}}$$ F - $$SU(5)$$ S U ( 5 ) supplemented with a string derived TeV-scale extra $$10+\overline{10}$$ 10 + 10 ¯ vector-like multiplet and charged vector-like singlet $$(XE,XE^c)$$ ( X E , X E c ) , dubbed flippons. We introduced these vector-like particles into No-Scale Flipped SU (5) many years ago, and as a result, the renormalization group equation (RGE) running was immediately shaped to produce a distinctive and rather beneficial two-stage gauge coupling unification process to avoid the Landau pole and lift unification to the string scale, in addition to contributing through 1-loop to the light Higgs boson mass. The flippons have long stood ready to tackle another challenge, and now do so yet again, where the charged vector-like “lepton”/singlet couples with the muon, the supersymmetric down-type Higgs $$H_d$$ H d , and a singlet S , using a chirality flip to easily accommodate the muonic $$g-2$$ g - 2 discrepancy in No-Scale $${\mathcal {F}}$$ F - $$SU(5)$$ S U ( 5 ) . Considering the phenomenological success of this string derived model over the prior 11 years that remains accommodative of all presently available LHC limits plus all other experimental constraints, including no fine-tuning, and the fact that for the first time a Starobinsky-like inflationary model consistent with all cosmological data was derived from superstring theory in No-Scale Flipped SU (5), we believe it is imperative to reconcile the BNL+FNAL developments within the model space.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

$W/Z$ + jets results from CDF

The CDF Collaboration has a comprehensive program of studying the production of vector bosons, W and Z, in association with energetic jets. Excellent understanding of the standard model W/Z+jets and W/Z+c,b-jets processes is of paramount importance for the top quark physics and for the Higgs boson and many new physics searches. We review the latest CDF results on Z-boson production in association with inclusive and b-quark jets, study of the p{sub T} balance in Z+jet events, and a measurement of the W+charm production cross section. The results are based on 4-5 fb{sup -1} of data and compared to various Monte Carlo and next-to-leading order perturbative QCD predictions.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

FPGA Coprocessor for Accelerated Classification of Images

An effort related to that described in the preceding article focuses on developing a spaceborne processing platform for fast and accurate onboard classification of image data, a critical part of modern satellite image processing. The approach again has been to exploit the versatility of recently developed hybrid Virtex-4FX field-programmable gate array (FPGA) to run diverse science applications on embedded processors while taking advantage of the reconfigurable hardware resources of the FPGAs. In this case, the FPGA serves as a coprocessor that implements legacy C-language support-vector-machine (SVM) image-classification algorithms to detect and identify natural phenomena such as flooding, volcanic eruptions, and sea-ice break-up. The FPGA provides hardware acceleration for increased onboard processing capability than previously demonstrated in software. The original C-language program demonstrated on an imaging instrument aboard the Earth Observing-1 (EO-1) satellite implements a linear-kernel SVM algorithm for classifying parts of the images as snow, water, ice, land, or cloud or unclassified. Current onboard processors, such as on EO-1, have limited computing power, extremely limited active storage capability and are no longer considered state-of-the-art. Using commercially available software that translates C-language programs into hardware description language (HDL) files, the legacy C-language program, and two newly formulated programs for a more capable expanded-linear-kernel and a more accurate polynomial-kernel SVM algorithm, have been implemented in the Virtex-4FX FPGA. In tests, the FPGA implementations have exhibited significant speedups over conventional software implementations running on general-purpose hardware.

Pingree, Paula J.↗

An Optical Bit-Counting Algorithm

This paper addresses the omnipresent problem of counting bits - an operation discussed since the very early stages of the establishing of computer science. The need for a quick bit-counting method acquires a special significance with the proliferation of search engines on the Internet. It arises in several other computer applications. This is especially true in information retrieval in which an array of binary vectors is used to represent a characteristic function (CF) of a set of qualified documents. The number of "I"s in the CF equals the cardinality of the set. The process of repeated evaluations of this cardinality is a pivotal point in choosing a rational strategy for deciding whether to constrain or broaden the search criteria to ensure selection of the desired items. Another need for bit-counting occurs when trying to determine the differences between given files, (images or text), in terms of the Hamming distance. An Exclusive OR operation applied to a pair of files results in a binary vector array of mismatches that must be counted.

Mack, Marilyn↗

SU-E-J-243: Possibility of Exposure Dose Reduction of Cone-Beam Computed Tomography in An Image Guided Patient Positioning System by Using Various Noise Suppression Filters

Purpose: To investigate the possibility of exposure dose reduction of the cone-beam computed tomography (CBCT) in an image guided patient positioning system by using 6 noise suppression filters. Methods: First, a reference dose (RD) and low-dose (LD)-CBCT (X-ray volume imaging system, Elekta Co.) images were acquired with a reference dose of 86.2 mGy (weighted CT dose index: CTDIw) and various low doses of 1.4 to 43.1 mGy, respectively. Second, an automated rigid registration for three axes was performed for estimating setup errors between a planning CT image and the LD-CBCT images, which were processed by 6 noise suppression filters, i.e., averaging filter (AF), median filter (MF), Gaussian filter (GF), bilateral filter (BF), edge preserving smoothing filter (EPF) and adaptive partial median filter (AMF). Third, residual errors representing the patient positioning accuracy were calculated as an Euclidean distance between the setup error vectors estimated using the LD-CBCT image and RD-CBCT image. Finally, the relationships between the residual error and CTDIw were obtained for 6 noise suppression filters, and then the CTDIw for LD-CBCT images processed by the noise suppression filters were measured at the same residual error, which was obtained with the RD-CBCT. This approach was applied to an anthropomorphic pelvic phantom and two cancer patients. Results: For the phantom, the exposure dose could be reduced from 61% (GF) to 78% (AMF) by applying the noise suppression filters to the CBCT images. The exposure dose in a prostate cancer case could be reduced from 8% (AF) to 61% (AMF), and the exposure dose in a lung cancer case could be reduced from 9% (AF) to 37% (AMF). Conclusion: Using noise suppression filters, particularly an adaptive partial median filter, could be feasible to decrease the additional exposure dose to patients in image guided patient positioning systems.

60 APPLIED LIFE SCIENCES↗

Quantification of Powder Spreading Process for Metal Additive Manufacturing

In powder bed additive manufacturing (AM), the powder spreading process can lead to inhomogeneity in layer height, porosity level, and particle size distribution. Hence, creating homogeneous layers is the first task for optimal printing. The conventional assessment methods for powder quality are limited to a measurement of powder morphology, flowability, particle size distribution, surface roughness, and packing density. However, those techniques may not be the most appropriate to quantify the powder bed characteristics since it is not able to capture local particle configuration and does not provide any vectoral information (e.g., arrangement of contacts between particles during spreading). In this project, we: 1) developed a powder spreading model using discrete element method (DEM) for multiple-layered process, 2) experimentally measure powder spreading dynamics including static angle of repose (AOR) and dynamic AOR in order to calibrate and subsequently validate the model, and 3) investigated the effect of particle spreading process parameters on spatial powder bed structure and quality using scalar (e.g., porosity, surface roughness, coordination number, and particle size distribution) and tensorial (e.g., directionality of inter-particle contacts) methods for a comprehensive quantification of powder bed.

36 MATERIALS SCIENCE↗

Investigating the point seismic array concept with seismic rotation measurements.

Spatially-distributed arrays of seismometers are often utilized to infer the speed and direction of incident seismic waves. Conventionally, individual seismometers of the array measure one or more orthogonal components of rectilinear particle motion (displacement, velocity, or acceleration). The present work demonstrates that measure of both the particle velocity vector and the particle rotation vector at a single point receiver yields sufficient information to discern the type (compressional or shear), speed, and direction of an incident plane seismic wave. Hence, the approach offers the intriguing possibility of dispensing with spatially-extended received arrays, with their many problematic deployment, maintenance, relocation, and post-acquisition data processing issues. This study outlines straightforward mathematical theory underlying the point seismic array concept, and implements a simple cross-correlation scanning algorithm for determining the azimuth of incident seismic waves from measured acceleration and rotation rate data. The algorithm is successfully applied to synthetic seismic data generated by an advanced finite-difference seismic wave propagation modeling algorithm. Application of the same azimuth scanning approach to data acquired at a site near Yucca Mountain, Nevada yields ambiguous, albeit encouraging, results. Practical issues associated with rotational seismometry are recognized as important, but are not addressed in this investigation.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Universality for a global property of the eigenvectors of Wigner matrices

Let M{sub n} be an n×n real (resp. complex) Wigner matrix and U{sub n}Λ{sub n}U{sub n}{sup *} be its spectral decomposition. Set (y{sub 1},y{sub 2}⋯,y{sub n}){sup T}=U{sub n}{sup *}x, where x = (x{sub 1}, x{sub 2}, ⋅⋅⋅, x{sub n}){sup T} is a real (resp. complex) unit vector. Under the assumption that the elements of M{sub n} have 4 matching moments with those of GOE (resp. GUE), we show that the process X{sub n}(t)=√((βn)/2 )∑{sub i=1}{sup ⌊nt⌋}(|y{sub i}|{sup 2}−1/n ) converges weakly to the Brownian bridge for any x satisfying ‖x‖{sub ∞} → 0 as n → ∞, where β = 1 for the real case and β = 2 for the complex case. Such a result indicates that the orthogonal (resp. unitary) matrices with columns being the eigenvectors of Wigner matrices are asymptotically Haar distributed on the orthogonal (resp. unitary) group from a certain perspective.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

In-medium modification of meson properties in a chiral quark model

Two-photon decays of vector mesons and dilepton decays of scalar mesons which are forbidden in a vacuum and can occur in dense baryonic matter due to the explicit violation of Lorentz symmetry are described within a quark model of the Nambu-Jona-Lasinio type. The temperature and chemical potential dependence of these processes is investigated.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

A robust geometry estimation method for spiral, sequential and circular cone-beam micro-CT

Purpose: The authors propose a novel method for misalignment estimation of micro-CT scanners using an adaptive genetic algorithm. Methods: The proposed algorithm is able to estimate the rotational geometry, the direction vector of table movement and the displacement between different imaging threads of a dual source or even multisource scanner. The calibration procedure does not rely on dedicated calibration phantoms and a sequence scan of a single metal bead is sufficient to geometrically calibrate the whole imaging system for spiral, sequential, and circular scan protocols. Dual source spiral and sequential scan protocols in micro-computed tomography result in projection data that-besides the source and detector positions and orientations-also require a precise knowledge of the table direction vector to be reconstructed properly. If those geometric parameters are not known accurately severe artifacts and a loss in spatial resolution appear in the reconstructed images as long as no geometry calibration is performed. The table direction vector is further required to ensure that consecutive volumes of a sequence scan can be stitched together and to allow the reconstruction of spiral data at all. Results: The algorithm's performance is evaluated using simulations of a micro-CT system with known geometry and misalignment. To assess the quality of the algorithm in a real world scenario the calibration of a micro-CT scanner is performed and several reconstructions with and without geometry estimation are presented. Conclusions: The results indicate that the algorithm successfully estimates all geometry parameters, misalignment artifacts in the reconstructed volumes vanish, and the spatial resolution is increased as can be shown by the evaluation of modulation transfer function measurements.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Lepton-pair production at hadron colliders at N 3 LO in QCD

We compute for the first time the complete corrections at N 3 LO in the strong coupling constant to the inclusive neutral-current Drell-Yan process including contributions from both photon and Z-boson exchange. Our main result is the computation of the QCD corrections to the inclusive production cross section of an axial-vector boson to third order in the strong coupling in a variant of QCD with five massless quark flavours. Since the axial anomaly does not cancel for an odd number of flavours, we also consistently include non-decoupling effects in the top-quark mass through three loops. We perform a phenomenological study of our results, and we present for the first time predictions for the inclusive Drell-Yan process at the LHC at this order in QCD perturbation theory.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗