Search NASA⌕ Search

SEARCH · Search NASA

Results for “VECTOR CURRENTS”

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,333 records · Page 74

Identifying and Explaining Anomalous Activity in Surveillance Video with Compression Algorithms

The primary purpose of this document is to outline the progress made on the LDRD titled “Identifying and Explaining Anomalous Activity in Surveillance Video with Compression Algorithms” in FY22 and FY23. In this LDRD, we explored the usage of compression-based analytics to identify anomalous activity in video. We developed a novel algorithm, Spatio-Temporal N-Gram PPM (STNG PPM) that accounts for spatially and temporally aware anomalies in video. We extracted features using motions vectors from video as well as operating on the raw features. STNG PPM is comparable to many deep learning approaches but does not require specialized hardware (GPUs) to run efficiently. We also examine the evaluation metrics and propose novel measures addressing faults in the current evaluation measures.

97 MATHEMATICS AND COMPUTING↗

Enhancements to Program LAURA for computation of three-dimensional hypersonic flow

Changes to Program Laura (Langley Aerothermodynamic Upwind Relaxation Algorithm) are presented which enhance both stability and accuracy of the algorithm. A discussion of iteration/sweeping strategies and their relation to computer architectures is included to best exploit the capabilities of serial, vector, and parallel processor machines. Test cases for Mach 10 perfect gas flow and Mach 32 real gas flow in chemical nonequilibrium over a blunt, raked elliptic cone using the thin-layer Navier-Stokes equations are presented in order to demonstrate the current improved capabilities. Algorithm changes include the use of volume averaging, application of a symmetric total variation diminishing (TVD) scheme, and stronger interaction between the grid/shock alignment routine and the relaxation algorithm. Good comparisons with heat transfer and pitching moment data at three different angles of attack for the Mach 10 tests serve to further validate the present algorithm. Parameters are defined which control the coupling of the specie continuity equations with the solution of the mixture conservation equations. A discussion of the consequences involved in the choice of strong versus weak coupling is presented, and a sample nonequilibrium calculation on a fine grid over a full scale model of the Aeroassist Flight Experiment (AFE) demonstrates current capabilities.

Gnoffo, Peter A.↗

Incorporation of a progressive failure analysis method in the CSM testbed software system

Analysis of the postbuckling behavior of composite shell structures pose many difficult and challenging problems in the field of structural mechanics. Current analysis methods perform well for most cases in predicting the postbuckling response of undamaged components. To predict component behavior accurately at higher load levels, the analysis must include the effects of local material failures. The CSM testbed software system is a highly modular structural analysis system currently under development at Langley Research Center. One of the primary goals of the CSM testbed is to provide a software environment for the development of advanced structural analysis methods and modern numerical methods which will exploit advanced computer architecture such as parallel-vector processors. Development of a progressive failure analysis method consists of the design and implementation of a processor which will perform the ply-level progressive failure analysis and the development of a geometrically nonlinear analysis procedure which incorporates the progressive failure processor. Regarding the development of the progressive failure processor, two components are required: failure criteria and a degradation model. For the initial implementation, the failure criteria of Hashin will be used. For a matrix failure which typically indicates the development of transverse matrix cracks, the ply properties will be degraded. Work to date includes the design of the progressive failure analysis processor and initial plans for the controlling geometrically nonlinear analysis procedure. The implementation of the progressive failure analysis has begun. Access to the model database and the Hashin failure criteria are completed. Work is in progress on the input/output operations for the processor related data and the finite element model updating procedures. In total the progressive failure processor is approximately one-third complete.

Arenburg, Robert T.↗

Forecasting Coronal Mass Ejections from Vector Magnetograms

In a 17 vector magnetogram study of 12 bipolar active regions (Falconer, Moore, & Gary, 2002, ApJ in press), we correlated four quantitative global magnetic measures with the Coronal Mass Ejections (CME) productivity of the active region. The global measures included a measure of active region size, the total magnetic flux phi and three measures of an active region global nonpotentiality 1) the net current (I (sub N)), 2) the length of the strong-shear, strong-field main neutral line (L(sub SS)) and 3) and the normalized twist (alpha = muIN/PHI). The CME productivity was determined from YOHKOH/SXT observations, Geostationary Operational Environmental Satellite (GOES), and when possible Solar and Heliospheric Observatory/Large Angle and Spectrometric Coronagraph Experiment (SOHO/LASCO) observations within 12 days of the day of the magnetogram. We found that the three measures of global nonpotentiality (I(sub N), L(sub SS), alpha) were all well correlated (greater than 99% confidence level) with an active region's CME productivity. The sample size was to small to confirm if there was a statistical significant correlation of the globally nonscientist measures with future CME activity (i.e. from the date of the magnetogram forward). We are doubling our sample, and will report on the statistical significance of global nonpotentiality as a predictor of future CME productivity. The new active regions are all from the first year of the upgraded MSFC vector magnetograms. This work, is funded by NSF through the Space Weather Program, by NASA through the Living with the Star, Targeted Research and Technology, and by NASA Solar Physics Supporting Research and Technology Program. The upgrade to the MSFC vector magnetograph was supported by the High Energy Solar Spectroscopic Imager (HESSI) mission.

Falconer, D. A.↗

Aerodynamic Design Study of Advanced Multistage Axial Compressor

As a direct response to the need for further performance gains from current multistage axial compressors, an investigation of advanced aerodynamic design concepts that will lead to compact, high-efficiency, and wide-operability configurations is being pursued. Part I of this report describes the projected level of technical advancement relative to the state of the art and quantifies it in terms of basic aerodynamic technology elements of current design systems. A rational enhancement of these elements is shown to lead to a substantial expansion of the design and operability space. Aerodynamic design considerations for a four-stage core compressor intended to serve as a vehicle to develop, integrate, and demonstrate aerotechnology advancements are discussed. This design is biased toward high efficiency at high loading. Three-dimensional blading and spanwise tailoring of vector diagrams guided by computational fluid dynamics (CFD) are used to manage the aerodynamics of the high-loaded endwall regions. Certain deleterious flow features, such as leakage-vortex-dominated endwall flow and strong shock-boundary-layer interactions, were identified and targeted for improvement. However, the preliminary results were encouraging and the front two stages were extracted for further aerodynamic trimming using a three-dimensional inverse design method described in part II of this report. The benefits of the inverse design method are illustrated by developing an appropriate pressure-loading strategy for transonic blading and applying it to reblade the rotors in the front two stages of the four-stage configuration. Multistage CFD simulations based on the average passage formulation indicated an overall efficiency potential far exceeding current practice for the front two stages. Results of the CFD simulation at the aerodynamic design point are interrogated to identify areas requiring additional development. In spite of the significantly higher aerodynamic loadings, advanced CFD-based tools were able to effectively guide the design of a very efficient axial compressor under state-of-the-art aeromechanical constraints.

Larosiliere, Louis M.↗

Neuregulin: First Steps Towards a Structure

Neuregulins are growth factor domain proteins with diverse bioactivities, such as cell proliferation, receptor binding, and differentiation. Neureguh- 1 binds to two members of the ErbB class I tyrosine kinase receptors, ErbB3 and ErbB4. A number of human cancers overexpress the ErbB receptors, and neuregulin can modulate the growth of certain cancer types. Neuregulin-1 has been shown to promote the migration of invasive gliomas of the central nervous system. Neuregulin has also been implicated in schizophrenia, multiple sclerosis and abortive cardiac abnormalities. The full function of neuregulin-1 is not known. In this study we are inserting a cDNA clone obtained from American Type Culture Collection into E.coli expression vectors to express neuregulin- 1 protein. Metal chelate affinity chromatography is used for recombinant protein purification. Crystallization screening will proceed for X-ray diffraction studies following expression, optimization, and protein purification. In spite of medical and scholarly interest in the neuregulins, there are currently no high-resolution structures available for these proteins. Here we present the first steps toward attaining a high-resolution structure of neuregulin- 1, which will help enable us to better understand its function

Ferree, D. S.↗

Progressive Classification Using Support Vector Machines

An algorithm for progressive classification of data, analogous to progressive rendering of images, makes it possible to compromise between speed and accuracy. This algorithm uses support vector machines (SVMs) to classify data. An SVM is a machine learning algorithm that builds a mathematical model of the desired classification concept by identifying the critical data points, called support vectors. Coarse approximations to the concept require only a few support vectors, while precise, highly accurate models require far more support vectors. Once the model has been constructed, the SVM can be applied to new observations. The cost of classifying a new observation is proportional to the number of support vectors in the model. When computational resources are limited, an SVM of the appropriate complexity can be produced. However, if the constraints are not known when the model is constructed, or if they can change over time, a method for adaptively responding to the current resource constraints is required. This capability is particularly relevant for spacecraft (or any other real-time systems) that perform onboard data analysis. The new algorithm enables the fast, interactive application of an SVM classifier to a new set of data. The classification process achieved by this algorithm is characterized as progressive because a coarse approximation to the true classification is generated rapidly and thereafter iteratively refined. The algorithm uses two SVMs: (1) a fast, approximate one and (2) slow, highly accurate one. New data are initially classified by the fast SVM, producing a baseline approximate classification. For each classified data point, the algorithm calculates a confidence index that indicates the likelihood that it was classified correctly in the first pass. Next, the data points are sorted by their confidence indices and progressively reclassified by the slower, more accurate SVM, starting with the items most likely to be incorrectly classified. The user can halt this reclassification process at any point, thereby obtaining the best possible result for a given amount of computation time. Alternatively, the results can be displayed as they are generated, providing the user with real-time feedback about the current accuracy of classification.

Wagstaff, Kiri↗

The Way Point Planning Tool: Real Time Flight Planning for Airborne Science

Airborne real time observation are a major component of NASA's Earth Science research and satellite ground validation studies. For mission scientist, planning a research aircraft mission within the context of meeting the science objective is a complex task because it requires real time situational awareness of the weather conditions that affect the aircraft track. Multiple aircraft are often involved in the NASA field campaigns the coordination of the aircraft with satellite overpasses, other airplanes and the constantly evolving dynamic weather conditions often determine the success of the campaign. A flight planning tool is needed to provide situational awareness information to the mission scientist and help them plan and modify the flight tracks successfully. Scientists at the University of Alabama Huntsville and the NASA Marshal Space Flight Center developed the Waypoint Planning Tool (WPT), an interactive software tool that enables scientist to develop their own flight plans (also known as waypoints), with point and click mouse capabilities on a digital map filled with time raster and vector data. The development of this Waypoint Planning Tool demonstrates the significance of mission support in responding to the challenges presented during NASA field campaigns. Analyses during and after each campaign helped identify both issues and new requirements, initiating the next wave of development. Currently the Waypoint Planning Tool has gone through three rounds of development and analysis processes. The development of this waypoint tool is directly affected by the technology advances on GIS/Mapping technologies. From the standalone Google Earth application and simple KML functionalities to the Google Earth Plugin and Java Web Start/Applet on web platform, as well as to the rising open source GIS tools with new JavaScript frameworks, the Waypoint planning Tool has entered its third phase of technology advancement. The newly innovated, cross-platform, modular designed JavaScript-controled Waypoint tool is planned to be integrated with the NASA Airborne Science Mission Tool Suite. Adapting new technologies for the Waypoint Planning Tool ensures its success in helping scientist reach their mission objectives. This presentation will discuss the development process of the Waypoint Planning Tool in responding to field campaign challenges, identifying new information technologies, and describing the capabilities and features of the Waypoint Planning Tool with the real time aspect, interactive nature, and the resultant benefits to the airborne science community.

He, Yubin↗

Microarcsecond relative astrometry from the ground with a diffractive pupil

The practical use of astrometry to detect exoplanets via the reflex motion of the parent star depends critically on the elimination of systematic floors in imaging systems. In the diffractive pupil technique proposed for space-based detection of exo-earths, extended diffraction spikes generated by a dotted primary mirror are referenced against a wide-field grid of background stars to calibrate changing optical distortion and achieve microarcsecond astrometric precision on bright targets (Guyon et al. 2010). We describe applications of this concept to ground-based uncrowded astrometry using a diffractive, monopupil telescope and a wide-field camera to image as many as {approx}4000 background reference stars. Final relative astrometric precision is limited by differential tip/tilt jitter caused by high altitude layers of turbulence. A diffractive 3-meter telescope is capable of reaching {approx}35 {micro}as relative astrometric error per coordinate perpendicular to the zenith vector in three hours on a bright target star (I < 10) in fields of moderate stellar density ({approx}40 stars arcmin{sup -2} with I < 23). Smaller diffractive apertures (D < 1 m) can achieve 100-200 {micro}as performance with the same stellar density and exposure time and a large telescope (6.5-10 m) could achieve as low as 10 {micro}as, nearly an order of magnitude better than current space-based facilities. The diffractive pupil enables the use of larger fields of view through calibration of changing optical distortion as well as brighter target stars (V < 6) by preventing star saturation. Permitting the sky to naturally roll to average signals over many thousands of pixels can mitigate the effects of detector imperfections.

79 ASTRONOMY AND ASTROPHYSICS↗

Hadronic D decays involving even-parity light mesons

We study the hadronic D meson decays into a pseudoscalar meson P and an even-parity meson M, where M represents a scalar meson S, an axial-vector meson A, or a tensor meson T. These decays are first analyzed in the flavor-diagram approach. Fits to the SP modes with S being a nonstrange scalar meson show that neither the simple qq picture nor the q{sup 2}q{sup 2} scheme is favored by data. Current measurements on the AP decays are insufficient for a meaningful analysis. Some TP data are inconsistent with the others. In certain cases, the W-annihilation diagrams indicated by the data are unexpectedly large. As a comparison, we also compute their decay rates in the factorization approach using form factors extracted from the covariant light-front model. We find that factorization works well for Cabibbo-allowed D{sup +{yields}}SP, AP decays free of the weak annihilation contributions (W-exchange or W-annihilation). For the other SP and AP modes, it is necessary to include weak annihilation contributions to account for the data. However, factorization fails for D{yields}TP decays for some unknown reason; the predicted rates are in general too small by at least 2 orders of magnitude compared to experiment. We also examine the finite-width effects of resonances. Some decay modes which are kinematically forbidden become physically allowed due to the finite width of the resonance. We show that the branching fraction of D{sup +{yields}{sigma}{pi}+} extracted from three-body decays is enhanced by a factor of 2, whereas B(D{sup 0{yields}}f{sub 2}(1270)K{sup 0}) is reduced by a factor of 4 by finite-width effects.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

MimicGAN: Robust Projection onto Image Manifolds with Corruption Mimicking

In the past few years, Generative Adversarial Networks (GANs) have dramatically advanced our ability to represent and parameterize high-dimensional, non-linear image manifolds. As a result, they have been widely adopted across a variety of applications, ranging from challenging inverse problems like image completion, to problems such as anomaly detection and adversarial defense. A recurring theme in many of these applications is the notion of projecting an image observation onto the manifold that is inferred by the generator. In this context, Projected Gradient Descent (PGD) has been the most popular approach, which essentially optimizes for a latent vector that minimizes the discrepancy between a generated image and the given observation. However, PGD is a brittle optimization technique that fails to identify the right projection (or latent vector) when the observation is corrupted, or perturbed even by a small amount. Such corruptions are common in the real world, for example images in the wild come with unknown crops, rotations, missing pixels, or other kinds of non-linear distributional shifts which break current encoding methods, rendering downstream applications unusable. To address this, we propose corruption mimicking—a new robust projection technique, that utilizes a surrogate network to approximate the unknown corruption directly at test time, without the need for additional supervision or data augmentation. The proposed method is significantly more robust than PGD and other competing methods under a wide variety of corruptions, thereby enabling a more effective use of GANs in real-world applications. Finally, more importantly, we show that our approach produces state-of-the-art performance in several GAN-based applications—anomaly detection, domain adaptation, and adversarial defense, that benefit from an accurate projection.

97 MATHEMATICS AND COMPUTING↗

Collective optical Thomson scattering in pulsed-power driven high energy density physics experiments (invited)

Optical collective Thomson scattering is used to diagnose magnetized high energy density physics experiments at the Magpie pulsed-power generator at Imperial College London. The system uses an amplified pulse from the 2nd harmonic of a Nd:YAG laser (3 J, 8 ns, 532 nm) to probe a wide diversity of hightemperature plasma objects; with densities in the range of 10 17 -10 19 cm -3 and temperatures between 10 eV and a few keV. The scattered light is collected from 100 μm-scale volumes within the plasmas, which are imaged onto optical fiber arrays. Multiple collection systems observe these volumes from different directions, providing simultaneous probing with different scattering K-vectors (and different associated α-parameters, typically in the range 0.5 – 3) allowing independent measurements of separate velocity components of the bulk plasma flow. The fiber arrays are coupled to an imaging spectrometer with a gated ICCD. The spectrometer is configured to view the ion-acoustic waves (IAWs) of the collective Thomson scattered spectrum. Fits to the spectra with the theoretical spectral density function S(K,ω) yield measurements of the local plasma temperatures and velocities. Fitting is constrained by independent measurements of the electron density from laser interferometry, and the corresponding spectra for different scattering vectors. Furthermore, this TS diagnostic has been successfully implemented on a wide range of experiments, revealing temperature and flow velocity transitions across magnetized shocks, inside rotating plasma jets and imploding wire arrays, as well as providing direct measurements of drift velocities inside a magnetic reconnection current sheet.

47 OTHER INSTRUMENTATION↗

Angular distribution of solar wind magnetic field vector at 1 AU

We study the angular distribution of the solar wind magnetic field vector at 1 AU and its solar cycle dependence using ACE observations. A total of twelve 27.27 day (the duration of a solar rotation) intervals during the solar maximum, the solar minimum, as well as the ascending and descending phases of solar cycle 23 are examined. For all selected intervals, we obtain the angular distribution function f{sub τ}(α), where α is the angle between the instantaneous solar wind magnetic field vector and the average background magnetic field vector, and τ is the period length for the averaging. Our results show that in all periods f{sub τ}(α) has two populations, one at small angles and one at large angles. We suggest that the second population is due to the presence of current sheets in the solar wind. The solar-cycle dependence of f{sub τ}(α) and a τ-scaling property of the second population of f{sub τ}(α) are discussed. The τ scaling shows a clear dependence on the solar wind type. The implication of f{sub τ}(α) for particle acceleration at interplanetary shocks driven by coronal mass ejections, such as those in solar energetic particle events, is also discussed.

79 ASTRONOMY AND ASTROPHYSICS↗

Programming Strategies for Irregular Algorithms on the Emu Chick

The Emu Chick prototype implements migratory memory-side processing in a novel hardware system. Rather than transferring large amounts of data across the system interconnect, the Emu Chick moves lightweight thread contexts to near-memory cores before the beginning of each remote memory read. Previous work has characterized the performance of the Chick prototype in terms of memory bandwidth and programming differences from more typical, non-migratory platforms, but there has not yet been an analysis of algorithms on this system. This work evaluates irregular algorithms that could benefit from the lightweight, memory-side processing of the Chick and demonstrates techniques and optimization strategies for achieving performance in sparse matrix-vector multiply operation (SpMV), breadth-first search (BFS), and graph alignment across up to eight distributed nodes encompassing 64 nodelets in the Chick system. We also define and justify relative metrics to compare prototype FPGA-based hardware with established ASIC architectures. The Chick currently supports up to 68x scaling for graph alignment, 80 MTEPS for BFS on balanced graphs, and 50% of measured STREAM bandwidth for SpMV.

Hein, Eric↗

The Mission Oriented Terminal Area Simulation (MOTAS)

A new simulation facility is described in which flight management and flight operations research studies can be conducted in a highly realistic terminal area environment. The historical evolution and justification of the facility is discussed, along with the design configuration of the system hardware and software. Details are provided on the traffic management features of the terminal area model as well as the human controller and multicockpit interface capabilities. The facility is currently operational with two cockpit simulators, two air traffic control (ATC) stations, four pseudo pilot stations (PPS), a metering and spacing system of traffic flow control management, and terminal area models providing two route structure environments: area navigation (RNAV) for advanced-equipped aircraft and vectoring for conventionally-equipped aircraft. Plans for future experiments utilizing the facility are discussed.

Naftel, P. B.↗

Neural network classification of questionable EGRET events

High energy gamma rays (greater than 20 MeV) pair producing in the spark chamber of the Energetic Gamma Ray Telescope Experiment (EGRET) give rise to a characteristic but highly variable 3-D locus of spark sites, which must be processed to decide whether the event is to be included in the database. A significant fraction (about 15 percent or 10(exp 4) events/day) of the candidate events cannot be categorized (accept/reject) by an automated rule-based procedure; they are therefore tagged, and must be examined and classified manually by a team of expert analysts. We describe a feedforward, back-propagation neural network approach to the classification of the questionable events. The algorithm computes a set of coefficients using representative exemplars drawn from the preclassified set of questionable events. These coefficients map a given input event into a decision vector that, ideally, describes the correct disposition of the event. The net's accuracy is then tested using a different subset of preclassified events. Preliminary results demonstrate the net's ability to correctly classify a large proportion of the events for some categories of questionables. Current work includes the use of much larger training sets to improve the accuracy of the net.

Meetre, C. A.↗

Efficacy of Code Optimization on Cache-based Processors

The current common wisdom in the U.S. is that the powerful, cost-effective supercomputers of tomorrow will be based on commodity (RISC) micro-processors with cache memories. Already, most distributed systems in the world use such hardware as building blocks. This shift away from vector supercomputers and towards cache-based systems has brought about a change in programming paradigm, even when ignoring issues of parallelism. Vector machines require inner-loop independence and regular, non-pathological memory strides (usually this means: non-power-of-two strides) to allow efficient vectorization of array operations. Cache-based systems require spatial and temporal locality of data, so that data once read from main memory and stored in high-speed cache memory is used optimally before being written back to main memory. This means that the most cache-friendly array operations are those that feature zero or unit stride, so that each unit of data read from main memory (a cache line) contains information for the next iteration in the loop. Moreover, loops ought to be 'fat', meaning that as many operations as possible are performed on cache data-provided instruction caches do not overflow and enough registers are available. If unit stride is not possible, for example because of some data dependency, then care must be taken to avoid pathological strides, just ads on vector computers. For cache-based systems the issues are more complex, due to the effects of associativity and of non-unit block (cache line) size. But there is more to the story. Most modern micro-processors are superscalar, which means that they can issue several (arithmetic) instructions per clock cycle, provided that there are enough independent instructions in the loop body. This is another argument for providing fat loop bodies. With these restrictions, it appears fairly straightforward to produce code that will run efficiently on any cache-based system. It can be argued that although some of the important computational algorithms employed at NASA Ames require different programming styles on vector machines and cache-based machines, respectively, neither architecture class appeared to be favored by particular algorithms in principle. Practice tells us that the situation is more complicated. This report presents observations and some analysis of performance tuning for cache-based systems. We point out several counterintuitive results that serve as a cautionary reminder that memory accesses are not the only factors that determine performance, and that within the class of cache-based systems, significant differences exist.

VanderWijngaart, Rob F.↗

Three-dimensional magnetic bubble memory system

A compact memory uses magnetic bubble technology for providing data storage. A three-dimensional arrangement, in the form of stacks of magnetic bubble layers, is used to achieve high volumetric storage density. Output tracks are used within each layer to allow data to be accessed uniquely and unambiguously. Storage can be achieved using either current access or field access magnetic bubble technology. Optical sensing via the Faraday effect is used to detect data. Optical sensing facilitates the accessing of data from within the three-dimensional package and lends itself to parallel operation for supporting high data rates and vector and parallel processing.

Stadler, Henry L.↗