Search NASA⌕ Search

SEARCH · Search NASA

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 883 records · Page 49

Analysis of Tempered Fractional Operators

Tempered fractional operators provide an improved predictive capability for modeling anomalous effects that cannot be captured by standard partial differential equations. These effects include subdiffusion and superdiffusion (i.e. the mean square displacement in a diffusion process is proportional to a fractional power of the time), that often occur in, e.g., geoscience and hydrology. We analyze tempered fractional operators within the nonlocal vector calculus framework in order to assimilate them to the rigorous mathematical structure developed for nonlocal models. First, we show they are special instances of generalized nonlocal operators by means of a proper choice of the nonlocal kernel. Then, we present a plan for showing tempered fractional operators are equivalent to truncated fractional operators. These truncated operators are useful because they are less computationally intensive than the tempered operators.

97 MATHEMATICS AND COMPUTING↗

Random Forest Regressor-Based Approach for Detecting Fault Location and Duration in Power Systems

Power system failures or outages due to short-circuits or “faults” can result in long service interruptions leading to significant socio-economic consequences. It is critical for electrical utilities to quickly ascertain fault characteristics, including location, type, and duration, to reduce the service time of an outage. Existing fault detection mechanisms (relays and digital fault recorders) are slow to communicate the fault characteristics upstream to the substations and control centers for action to be taken quickly. Fortunately, due to availability of high-resolution phasor measurement units (PMUs), more event-driven solutions can be captured in real time. In this paper, we propose a data-driven approach for determining fault characteristics using samples of fault trajectories. A random forest regressor (RFR)-based model is used to detect real-time fault location and its duration simultaneously. This model is based on combining multiple uncorrelated trees with state-of-the-art boosting and aggregating techniques in order to obtain robust generalizations and greater accuracy without overfitting or underfitting. Four cases were studied to evaluate the performance of RFR: 1. Detecting fault location (case 1), 2. Predicting fault duration (case 2), 3. Handling missing data (case 3), and 4. Identifying fault location and length in a real-time streaming environment (case 4). A comparative analysis was conducted between the RFR algorithm and state-of-the-art models, including deep neural network, Hoeffding tree, neural network, support vector machine, decision tree, naive Bayesian, and K-nearest neighborhood. Experiments revealed that RFR consistently outperformed the other models in detection accuracy, prediction error, and processing time.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Interactive image processing for meteorological applications at NASA/Goddard Space Flight Center

The paper reviews the development of the AOIPS (Atmospheric and Oceanographic Information Processing System) system for the interactive manipulation of meteorological satellite images. A block diagram of the system is presented; both software and hardware considerations are examined; and attention is given to the Image 100 processing system and to the interactive terminal. As a example the paper examines the functions of Metpak (the software package) which involve cloud tracking and wind vector generation.

Billingsley, J. B.↗

Satellite to study earth's magnetic field

The Magnetic Field Satellite (Magsat) designed to measure the near earth magnetic field and crustal anomalies is briefly described. A scalar magnetometer to measure the magnitude of the earth's crustal magnetic field and a vector magnetometer to measure magnetic field direction as well as magnitude are included. The mission and its objectives are summarized along with the data collection and processing system.

Source record↗

Evidence for quasi-stationary reconnection at the dayside magnetopause

The paper investigates several highly unusual encounters with the earth's magnetopause, that occurred during an approximately 5-hour period on November 22-23, 1979, when the ISEE 1 and 2 were near orbit apogee. A large decrease in the dynamic pressure exerted by the solar wind resulted in an expansion of the magnetosphere to and beyond the apogee of the ISEE 1 and 2 orbit, and the subsolar magnetopause of about 20.4 earth radii is farther than normal in geocentric distance by a factor of about 2. Field rotations varying from about 80 to 120 deg were involved in the transition from the magnetosheath to the magnetosphere, and hodograms of the tangential component of the magnetic field vector suggest that the magnetopause was a rotational discontinuity. These observations indicate that on occasion reconnection at the dayside magnetopause can be a quasi-stationary process.

Gosling, J. T.↗

Gravitational effects in dendritic growth

The theories of diffusion-controlled dendritic crystallization will be reviewed briefly, along with recently published critical experiments on the kinetics and morphology of dendritic growth in pure substances. The influence of the gravitational body force on dendrite growth kinetics will be shown to be highly dependent on the growth orientation with respect to the gravity vector and on the level of the thermal supercooling. In fact, an abrupt transition occurs at a critical supercooling, above which diffusional transport dominates the growth process and below which convective transport dominates. Our most recent work on binary mixtures shows that dilute solute additions influence the crystallization process indirectly, by altering the interfacial stability, rather than by directly affecting the transport mode. Directions for future studies in this field will also be discussed.

Glicksman, M. E.↗

Modeling and control of beam-like structures

The most popular finite element codes are based upon appealing theories of convergence of modal frequencies. For example, the popularity of cubic elements for beam-like structures is due to the rapid convergence of modal frequencies and stiffness properties. However, for those problems in which the primary consideration is the accuracy of response of the structure at specified locations it is more important to obtain accuracy in the modal costs than in the modal frequencies. The modal cost represents the contribution of a mode in the norm of the response vector. This paper provides a complete modal cost analysis for beam-like continua. Upper bounds are developed for mode truncation errors in the model reduction process and modal cost analysis dictates which modes to retain in order to reduce the model for control design purposes.

Hu, A.↗

A parallel finite-difference method for computational aerodynamics

A finite-difference scheme for solving complex three-dimensional aerodynamic flow on parallel-processing supercomputers is presented. The method consists of a basic flow solver with multigrid convergence acceleration, embedded grid refinements, and a zonal equation scheme. Multitasking and vectorization have been incorporated into the algorithm. Results obtained include multiprocessed flow simulations from the Cray X-MP and Cray-2. Speedups as high as 3.3 for the two-dimensional case and 3.5 for segments of the three-dimensional case have been achieved on the Cray-2. The entire solver attained a factor of 2.7 improvement over its unitasked version on the Cray-2. The performance of the parallel algorithm on each machine is analyzed.

Swisshelm, Julie M.↗

A distributed Petri Net controller for a dual arm testbed

This thesis describes the design and functionality of a Distributed Petri Net Controller (DPNC). The controller runs under X Windows to provide a graphical interface. The DPNC allows users to distribute a Petri Net across several host computers linked together via a TCP/IP interface. A sub-net executes on each host, interacting with the other sub-nets by passing a token vector from host to host. One host has a command window which monitors and controls the distributed controller. The input to the DPNC is a net definition file generated by Great SPN. Thus, a net may be designed, analyzed and verified using this package before implementation. The net is distributed to the hosts by tagging transitions that are host-critical with the appropriate host number. The controller will then distribute the remaining places and transitions to the hosts by generating the local nets, the local marking vectors and the global marking vector. Each transition can have one or more preconditions which must be fulfilled before the transition can fire, as well as one or more post-processes to be executed after the transition fires. These implement the actual input/output to the environment (machines, signals, etc.). The DPNC may also be used to simulate a Great SPN net since stochastic and deterministic firing rates are implemented in the controller for timed transitions.

Bjanes, Atle↗

A Numerical Optimization Approach for Tuning Fuzzy Logic Controllers

This paper develops a method to tune fuzzy controllers using numerical optimization. The main attribute of this approach is that it allows fuzzy logic controllers to be tuned to achieve global performance requirements. Furthermore, this approach allows design constraints to be implemented during the tuning process. The method tunes the controller by parameterizing the membership functions for error, change-in-error and control output. The resulting parameters form a design vector which is iteratively changed to minimize an objective function. The minimal objective function results in an optimal performance of the system. A spacecraft mounted science instrument line-of-sight pointing control is used to demonstrate results.

Woodard, Stanley E.↗

Parallelizing the Unpacking and Clustering of Detector Data for Reconstruction of Charged Particle Tracks on Multi-core CPUs and Many-core GPUs

We present results from parallelizing the unpacking and clustering steps of the raw data from the silicon strip modules for reconstruction of charged particle tracks. Throughput is further improved by concurrently processing multiple events using nested OpenMP parallelism on CPU or CUDA streams on GPU. The new implementation along with earlier work in developing a parallelized and vectorized implementation of the combinatoric Kalman filter algorithm has enabled efficient global reconstruction of the entire event on modern computer architectures. We demonstrate the performance of the new implementation on Intel Xeon and NVIDIA GPU architectures.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

System Finds Horizontal Location of Center of Gravity

An instrumentation system rapidly and repeatedly determines the horizontal location of the center of gravity of a laboratory vehicle that slides horizontally on three air bearings (see Figure 1). Typically, knowledge of the horizontal center-of-mass location of such a vehicle is needed in order to balance the vehicle properly for an experiment and/or to assess the dynamic behavior of the vehicle. The system includes a load cell above each air bearing, electronic circuits that generate digital readings of the weight on each load cell, and a computer equipped with software that processes the readings. The total weight and, hence, the mass of the vehicle are computed from the sum of the load-cell weight readings. Then the horizontal position of the center of gravity is calculated straightforwardly as the weighted sum of the known position vectors of the air bearings, the contribution of each bearing being proportional to the weight on that bearing. In the initial application for which this system was devised, the center- of-mass calculation is particularly simple because the air bearings are located at corners of an equilateral triangle. However, the system is not restricted to this simple geometry. The system acquires and processes weight readings at a rate of 800 Hz for each load cell. The total weight and the horizontal location of the center of gravity are updated at a rate of 800/3 approx. equals 267 Hz. In a typical application, a technician would use the center-of-mass output of this instrumentation system as a guide to the manual placement of small weights on the vehicle to shift the center of gravity to a desired horizontal position. Usually, the desired horizontal position is that of the geometric center. Alternatively, this instrumentation system could be used to provide position feedback for a control system that would cause weights to be shifted automatically (see Figure 2) in an effort to keep the center of gravity at the geometric center.

Johnston, Albert S.↗

Measurement of the VH,H → ττ process with the ATLAS detector at 13 TeV

A measurement of the Standard Model Higgs boson produced in association with a W or Z boson and decaying into a pair of τ-leptons is presented. This search is based on proton-proton collision data collected at $\sqrt{s}$ = 13 TeV by the ATLAS experiment at the LHC corresponding to an integrated luminosity of 140 fb -1 . For the Higgs boson candidate, only final states with at least one τ-lepton decaying hadronically (τ→hadrons+ν τ ) are considered. For the vector bosons, only leptonic decay channels are considered: Z→ℓℓ and W→ℓν ℓ , with ℓ=e,μ. An excess of events over the expected background is found with an observed (expected) significance of 4.2 (3.6) standard deviations, providing evidence of the Higgs boson produced in association with a vector boson and decaying into a pair of τ-leptons. The ratio of the measured cross-section to the Standard Model prediction is μ$_{VH}^{ττ}$=1.28$_{-0.29}^{+0.30}$(stat.)$_{-0.21}^{+0.25}$(syst.). This result represents the most accurate measurement of the VH(ττ) process achieved to date.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Computing rank‐revealing factorizations of matrices stored out‐of‐core

This paper describes efficient algorithms for computing rank-revealing factorizations of matrices that are too large to fit in main memory (RAM), and must instead be stored on slow external memory devices such as disks (out-of-core or out-of-memory). Traditional algorithms for computing rank-revealing factorizations (such as the column pivoted QR factorization and the singular value decomposition) are very communication intensive as they require many vector-vector and matrix-vector operations, which become prohibitively expensive when data is not in RAM. Randomization allows to reformulate new methods so that large contiguous blocks of the matrix are processed in bulk. The paper describes two distinct methods. The first is a blocked version of column pivoted Householder QR, organized as a “left-looking” method to minimize the number of the expensive write operations. The second method results employs a UTV factorization. It is organized as an algorithm-by-blocks to overlap computations and I/O operations. As it incorporates power iterations, it is much better at revealing the numerical rank. Numerical experiments on several computers demonstrate that the new algorithms are almost as fast when processing data stored on slow memory devices as traditional algorithms are for data stored in RAM.

97 MATHEMATICS AND COMPUTING↗

Efficiency Improvement in a Busy Radiology Practice: Determination of Musculoskeletal Magnetic Resonance Imaging Protocol Using Deep-Learning Convolutional Neural Networks

The purposes of this study are to evaluate the feasibility of protocol determination with a convolutional neural networks (CNN) classifier based on short-text classification and to evaluate the agreements by comparing protocols determined by CNN with those determined by musculoskeletal radiologists. Following institutional review board approval, the database of a hospital information system (HIS) was queried for lists of MRI examinations, referring department, patient age, and patient gender. These were exported to a local workstation for analyses: 5258 and 1018 consecutive musculoskeletal MRI examinations were used for the training and test datasets, respectively. The subjects for pre-processing were routine or tumor protocols and the contents were word combinations of the referring department, region, contrast media (or not), gender, and age. The CNN Embedded vector classifier was used with Word2Vec Google news vectors. The test set was tested with each classification model and results were output as routine or tumor protocols. The CNN determinations were evaluated using the receiver operating characteristic (ROC) curves. The accuracies were evaluated by a radiologist-confirmed protocol as the reference protocols. The optimal cut-off values for protocol determination between routine protocols and tumor protocols was 0.5067 with a sensitivity of 92.10%, a specificity of 95.76%, and an area under curve (AUC) of 0.977. The overall accuracy was 94.2% for the ConvNet model. All MRI protocols were correct in the pelvic bone, upper arm, wrist, and lower leg MRIs. Deep-learning-based convolutional neural networks were clinically utilized to determine musculoskeletal MRI protocols. CNN-based text learning and applications could be extended to other radiologic tasks besides image interpretations, improving the work performance of the radiologist.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Therapeutic targeting of membrane-associated proteins in central nervous system tumors

The activity of the most complex system, the central nervous system (CNS) is profoundly regulated by a huge number of membrane-associated proteins (MAP). A minor change stimulates immense chemical changes and the elicited response is organized by MAP, which acts as a receptor of that chemical or channel enabling the flow of ions. Slight changes in the activity or expression of these MAPs lead to severe consequences such as cognitive disorders, memory loss, or cancer. CNS tumors are heterogeneous in nature and hard-to-treat due to random mutations in MAPs; like as overexpression of EGFRvIII/TGFβR/VEGFR, change in adhesion molecules α5β3 integrin/SEMA3A, imbalance in ion channel proteins, etc. Extensive research is under process for developing new therapeutic approaches using these proteins such as targeted cytotoxic radiotherapy, drug-delivery, and prodrug activation, blocking of receptors like GluA1, developing viral vector against cell surface receptor. The combinatorial approach of these strategies along with the conventional one might be more potential. Henceforth, our review focuses on in-depth analysis regarding MAPs aiming for a better understanding for developing an efficient therapeutic approach for targeting CNS tumors.

60 APPLIED LIFE SCIENCES↗

Search for electroweak-scale dijet resonances using trigger-level analysis with the ATLAS detector in 132 fb −1 of 𝑝⁢𝑝 collisions at $\sqrt{𝑠}$ = 13 TeV

This article reports on a search for dijet resonances using 132 fb −1 of 𝑝⁢𝑝 collision data recorded at $\sqrt{𝑠}$ = 13 TeV by the ATLAS detector at the Large Hadron Collider. The search is performed solely on jets reconstructed within the ATLAS trigger to overcome bandwidth limitations imposed on conventional single-jet triggers, which would otherwise reject data from decays of sub-TeV dijet resonances. Collision events with two jets satisfying transverse momentum thresholds of 𝑝 T ≥ 85 GeV and jet rapidity separation of |𝑦*| <0.6 are analysed for dijet resonances with invariant masses from 375 to 1800 GeV. A data-driven background estimate is used to model the dijet mass distribution from multijet processes. No significant excess above the expected background is observed. Upper limits are set at 95% confidence level on coupling values for a benchmark leptophobic axial-vector 𝑍′ model and on the production cross section for a new resonance contributing a Gaussian-distributed line-shape to the dijet mass distribution.

hadron colliders↗

Custom Accessors: Enabling Scalable Data Ingestion, (Re-)Organization, and Analysis on Distributed Systems

The emerging class of high velocity and high volume data analytic workflows comprise interwoven data ingestion, organization, and processing stages, with ingestion and organization steps often contributing comparable or even higher computational costs than actual processing steps. Since complex workflows consist of a variety of phases that view and use data differently, being able to construct efficient, scalable, distributed data structures (arrays, vectors, sets, maps, and multi-maps) is essential and requires custom methods to extend and shrink containers, analyze and position data, and, maintain globallyconsistent meta-data. In this paper, we propose a novel datastructure access paradigm based on the concept of Accessors. At a high level, accessors are customizable callable objects that can modify the behavior of insert, read, update, and delete operations for distributed containers while preserving atomicity guarantees. Accessors provide a very clean and natural way to implement a variety of programming patterns, e.g., conditional insertion/deletion and cascading computations, which would be otherwise hard (or even impossible) to express in parallel and distributed settings without using locks. We demonstrate the practicality and usefulness of our approach with two representative use cases and study the performance of these applications on a distributed High-Performance Computing system. Our analysis highlights that our proposed abstraction allows for an effective overlapping and concurrent execution of different workflow steps (e.g., data ingestion and analysis), which in a conventional analytics pipeline would execute sequentially, contributing cumulatively to the overall latency.

Castellana, Vito G. [BATTELLE (PACIFIC NW LAB)] (O↗