Search NASA⌕ Search

SEARCH · Search NASA

Results for “Context algorithm”

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 145 records · Page 8

Differential Ranging Experiments with NASA’s High-Gain Deep Space Network Antennas

Radar experiments are currently under way at the Goldstone Deep Space Communications Complex (GDSCC) to determine the range of cis-lunar objects using a single high-gain 34m antenna transmitting 20 kW at X-band wavelengths, and two 34m receivers located at the GDSCC. The 34m antennas of the Deep Space Network (DSN) have effective fields-of-view of approximately 1 milli-radians, hence predetermined pointing predicts with accuracies on the order of 1 milli-degree are required. The extremely accurate 1 nano-second timing distribution of the DSN network enables sub-meter level ranging in the radial direction, by measuring delays in phase-modulated pseudonoise (PN) echoes reflected from the target. In this paper we demonstrate experimental verification of the proposed techniques by post-processing radar reflections obtained from a decommissioned geo-synchronous satellite. The characteristics of correlation-based delay measurements obtained simultaneously with two different receiving antennas are described. These are the fundamental quantities used to form the “time difference of arrival” (TDOA) observables commonly used in GPS positioning algorithms, and the results interpreted in the context of hyperbolic position location that could be used in the future to monitor spacecraft in cis-lunar space.

Cheung, Kar-Ming↗

Harnessing Condorcet Methods to Improve Decision-making Based on Ranked Data

Decision-makers must often choose between multiple alternatives based on their relative merits across a variety of criteria. These multiple-criteria decision-making (MCDM) problems must be approached in an objective, measurable, and transparent fashion to obtain well-supported outcomes. The challenge of using sets of ranked data to identify the optimal choice is not unlike the challenge of using ranked ballots to identify the winner of an election in a preference voting system. As such, the methods of rank aggregation used in elections can be applied to help resolve MCDM problems. Previous research into the design of elections and ballots has yielded many algorithms with well-understood properties. A subset of these, called Condorcet methods, reliably identify the “Condorcet winner,” if it exists, giving the result that would defeat any other in a pairwise comparison. That, in addition to several other desirable qualities, makes Condorcet methods like the Schulze method, Ranked Pairs, and Copeland’s method, effective and scalable means for tackling MCDM problems. These rank aggregation methods have been implemented in JavaScript functions for incorporation into a web-based MCDM decision tool. These algorithms can be applied in a wide variety of contexts (for example, determining the “best” environmental remediation method or selecting a subcontractor) to facilitate effective decision-making. The performance of the JavaScript Condorcet prototype tool was compared across the implemented algorithms and with both a non-Condorcet rank aggregation method as well as an implementation of the Simple Multi-Attribute Rating Technique (SMART) algorithm.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

On the Feasibility of Simulation-Driven Portfolio Scheduling for Cyberinfrastructure Runtime Systems

Runtime systems that automate the execution of applications on distributed cyberinfrastructures need to make scheduling decisions. Researchers have proposed many scheduling algorithms, but most of them are designed based on analytical models and assumptions that may not hold in practice. The literature is thus rife with algorithms that have been evaluated only within the scope of their underlying assumptions but whose practical effectiveness is unclear. It is thus difficult for developers to decide which algorithm to implement in their runtime systems.To obviate the above difficulty, we propose an approach by which the runtime system executes, throughout application execution, simulations of this very execution. Each simulation is for a different algorithm in a scheduling algorithm portfolio, and the best algorithm is selected based on simulation results. The main objective of this work is to evaluate the feasibility and potential merit of this portfolio scheduling approach, even in the presence of simulation inaccuracy, when compared to the traditional one-algorithm approach. We perform this evaluation via a case study in the context of scientific workflows. Our main finding is that portfolio scheduling can outperform the best one-algorithm approach even in the presence of relatively large simulation inaccuracies.

Casanova, Henri↗

Causal explicit algorithm for heat conduction in a plasma

Hyperbolic heat conduction extends standard Spitzer-Harm heat conduction by including a term proportional to the time derivative of the heat flux. The new term arises from a kinetic derivation of the heat flux that includes higher order corrections. Here we present a causal explicit numerical algorithm for solving the nonlinear hyperbolic heat conduction equation in an unmagnetized plasma. The maximum stable timestep for the causal explicit algorithm scales linearly with the cell size, owing to the hyperbolic nature of the problem. This is in contrast to the quadratic scaling of the maximum stable timestep with the cell size for the parabolic forward time centered space algorithm. The favorable scaling of the timestep with the cell size enables a practical explicit implementation of heat conduction in high-performance massively parallel plasma codes. In particular, we have implemented the causal explicit algorithm in the laser plasma interaction code pF3D. We verify the CE algorithm and analyze its convergence rate by simulating a harmonic mode, which has an analytic solution within the context of the HHC model. We also compare simulations using the CE algorithm to those using the forward time centered space algorithm on a pair of test problems: evolution in time of a Gaussian temperature perturbation in a uniform plasma and heat transport in the presence of inverse bremsstrahlung heating by a Gaussian laser speckle.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

A Framework to Debug Diagnostic Matrices

Diagnostics is an important concept in system health and monitoring of space operations. Many of the existing diagnostic algorithms utilize system knowledge in the form of diagnostic matrix (D-matrix, also popularly known as diagnostic dictionary, fault signature matrix or reachability matrix) gleaned from physical models. But, sometimes, this may not be coherent to obtain high diagnostic performance. In such a case, it is important to modify this D-matrix based on knowledge obtained from other sources such as time-series data stream (simulated or maintenance data) within the context of a framework that includes the diagnostic/inference algorithm. A systematic and sequential update procedure, diagnostic modeling evaluator (DME) is proposed to modify D-matrix and wrapper logic considering least expensive solution first. This iterative procedure includes conditions ranging from modifying 0s and 1s in the matrix, or adding/removing the rows (failure sources) columns (tests). We will experiment this framework on datasets from DX challenge 2009.

Model-based↗

Innovative Features of NASA's Celestial Mapping System to Support Exploration in the Lunar South Pole

Introduction: NASA's Celestial Mapping System (CMS) is developed to address the need for 3D tools for planetary science investigations, mission planning, in-situ operations, in a 3D-first design constructed around a unified view of a planetary globe. At present CMS provides many critical functionalities that include 1) Equipment planning and optimized placement on Lunar surface 2) Line of sight (visibility ) analysis 3) Powerful measurement tools based on 3D terrain with realistic 3D models to represent rovers, astronauts and equipment 4) Visualization of de-rived mapping products (e.g. resource maps), and 5) Data engine for hosting new observations that are not available in other contemporary lunar data tools. CMS is built on the foundation of powerful NASA WorldWind globe engines. In near future, users will be able to simultaneously deploy CMS onto multiple hardware configurations and platforms such as Windows, Linux, iOS and Android. The users will also have the flexibility to update to the latest imagery and terrain datasets as they are being acquired (in real time) before and/or during the exploration mission. CMS is also capable of consumption and analysis of data from locally hosted and external sources. It supports Open Geospatial Consorti-um (OGC) data and file standards, with current integrations of datasets from the Astrogeology Science Center of USGS which include global and local data acquired from NASA (LRO, Clementine, Lunar Orbiter) and JAXA (SELENE/Kaguya) with the capability of integrating more datasets. With development experience in both the end-user application and planetary engine side, CMS is also able to adapt to newer Lunar cartography standards as they develop and become recognized by international geospatial panels. Overcoming Polar Distortions: 3D geospatial applications traditionally suffer from significant distortion of imagery at the poles due to following reasons – 1) distortions in the source imagery 2) Incompatible tessellation algorithm on the poles 3) map projections. In the lunar context, with the focus on the South pole, this is not acceptable. The CMS team is researching ways to address polar distortion of imagery with new tessellation algorithms and by reprojecting the data using projections that are more accurate in polar scenarios. Figure1 shows the potential error introduced by different tessellation methods, represented by the red and green circles for Shoemaker crater. There is ~2 Km difference in the placement of the crater. Line of Sight Analysis and Traverse Planning: We have developed a built-in line of sight analysis (LOS) tool in CMS that analyzes the terrain profile and obstructions and provides the visibility of a given terrain for a remote observer. Figure 2 shows the viewshed analysis on the PSR in Nobile region. The PSR was created with help of HORUS generated images. The yellow pin shows the observer location outside the PSR. The yellow area shows the visible part of PSR. The obstructed area with no visibility for the observer is shown in red. This analysis was ex-tended further to set different heights for various observers and then perform the viewshed analysis. Combining the different visibility profiles can help designing improved traverses within the crater.

Geospatial Mapping↗

Innovative Features of NASA's Celestial Mapping System to Support Exploration in the Lunar South Pole

Introduction: NASA's Celestial Mapping System (CMS) is developed to address the need for 3D tools for planetary science investigations, mission planning, in-situ operations, in a 3D-first design constructed around a unified view of a planetary globe. At present CMS provides many critical functionalities that include 1) Equipment planning and optimized placement on Lunar surface 2) Line of sight (visibility ) analysis 3) Powerful measurement tools based on 3D terrain with realistic 3D models to represent rovers, astronauts and equipment 4) Visualization of de-rived mapping products (e.g. resource maps), and 5) Data engine for hosting new observations that are not available in other contemporary lunar data tools. CMS is built on the foundation of powerful NASA WorldWind globe engines. In near future, users will be able to simultaneously deploy CMS onto multiple hardware configurations and platforms such as Windows, Linux, iOS and Android. The users will also have the flexibility to update to the latest imagery and terrain datasets as they are being acquired (in real time) before and/or during the exploration mission. CMS is also capable of consumption and analysis of data from locally hosted and external sources. It supports Open Geospatial Consorti-um (OGC) data and file standards, with current integrations of datasets from the Astrogeology Science Center of USGS which include global and local data acquired from NASA (LRO, Clementine, Lunar Orbiter) and JAXA (SELENE/Kaguya) with the capability of integrating more datasets. With development experience in both the end-user application and planetary engine side, CMS is also able to adapt to newer Lunar cartography standards as they develop and become recognized by international geospatial panels. Overcoming Polar Distortions: 3D geospatial applications traditionally suffer from significant distortion of imagery at the poles due to following reasons – 1) distortions in the source imagery 2) Incompatible tessellation algorithm on the poles 3) map projections. In the lunar context, with the focus on the South pole, this is not acceptable. The CMS team is researching ways to address polar distortion of imagery with new tessellation algorithms and by reprojecting the data using projections that are more accurate in polar scenarios. Figure1 shows the potential error introduced by different tessellation methods, represented by the red and green circles for Shoemaker crater. There is ~2 Km difference in the placement of the crater. Line of Sight Analysis and Traverse Planning: We have developed a built-in line of sight analysis (LOS) tool in CMS that analyzes the terrain profile and obstructions and provides the visibility of a given terrain for a remote observer. Figure 2 shows the viewshed analysis on the PSR in Nobile region. The PSR was created with help of HORUS generated images. The yellow pin shows the observer location outside the PSR. The yellow area shows the visible part of PSR. The obstructed area with no visibility for the observer is shown in red. This analysis was ex-tended further to set different heights for various observers and then perform the viewshed analysis. Combining the different visibility profiles can help designing improved traverses within the crater.

Geospatial Mapping↗

A Bilevel Approach for Identifying the Worst Contingencies for Nonconvex Alternating Current Power Systems

We address the bilevel optimization problem of identifying the most critical attacks to an alternating current (AC) power flow network. The upper-level binary maximization problem consists of choosing an attack that is treated as a parameter in the lower-level defender minimization problem. Instances of the lower-level global minimization problem by themselves are NP-hard due to the nonconvex AC power flow constraints, and bilevel solution approaches commonly apply a convex relaxation or approximation to allow for tractable bilevel reformulations at the cost of underestimating some power system vulnerabilities. Our main contribution is to provide an alternative branch-and-bound algorithm whose upper bounding mechanism (in a maximization context) is based on a reformulation that avoids relaxation of the AC power flow constraints in the lower-level defender problem. Lower bounding is provided with semidefinite programming (SDP) relaxed solutions to the lower-level problem. We establish finite termination with guarantees of either a globally optimal solution to the original bilevel problem, or a globally optimal solution to the SDP-relaxed bilevel problem which is included in a vetted list of upper-level attack solutions, at least one of which is a globally optimal solution to the bilevel problem. We demonstrate through computational experiments applied to IEEE case instances both the relevance of our contribution, and the effectiveness of our contributed algorithm for identifying power system vulnerabilities without resorting to convex relaxations of the lower-level problem. We conclude with a discussion of future extensions and improvements.

97 MATHEMATICS AND COMPUTING↗

Monthly Oceanic Rainfall Derived from Space-Borne Microwave Data

A technique for estimating monthly oceanic rainfall rate using multi-channel microwave measurements has been developed. This technique is applied to the Special Sensor Microwave Imager (SSM/I) data since 1987 to infer monthly rainfall for the Global Precipitation Climatology Project (GPCP). A modified version of this algorithm is now being applied to the TRMM Microwave Imager (TMI) data. There are three prominent features of this algorithm. First, the knowledge of the form of the rainfall intensity probability density function used to augment the measurements. Second, utilizing a linear combination of the 19.35 and 22.235 GHz channels to deemphasize the effect of water vapor. Third, an objective technique has been developed to estimate the rain layer thickness from the 19.35 and 22.23 5 GHz brightness temperature histograms, TMI data with better spatial resolution and 24 hour sampling (vs. sun-synchronized sampling, which is limited to two narrow intervals of local solar time for DMSP satellites) prompt us to study the similarity and difference between these two rainfall estimates. One year of rainfall data (January to December 1998) are used in this study. The mean differences of these two rain estimates are typically less than 15%. Statistical tests are administrated to evaluate the differences between rainfall estimates from SSM/I and TMI data. Differences between TMI and SSM/I rain estimates are discussed in the context of radiative transfer calculations and rainfall estimate algorithm.

Chang, Alfred T. C.↗

A Discussion of Using a Reconfigurable Processor to Implement the Discrete Fourier Transform

This paper presents the design and implementation of the Discrete Fourier Transform (DFT) algorithm on a reconfigurable processor system. While highly applicable to many engineering problems, the DFT is an extremely computationally intensive algorithm. Consequently, the eventual goal of this work is to enhance the execution of a floating-point precision DFT algorithm by off loading the algorithm from the computing system. This computing system, within the context of this research, is a typical high performance desktop computer with an may of field programmable gate arrays (FPGAs). FPGAs are hardware devices that are configured by software to execute an algorithm. If it is desired to change the algorithm, the software is changed to reflect the modification, then download to the FPGA, which is then itself modified. This paper will discuss methodology for developing the DFT algorithm to be implemented on the FPGA. We will discuss the algorithm, the FPGA code effort, and the results to date.

White, Michael J.↗

Review of TRMM/GPM Rainfall Algorithm Validation

A review is presented concerning current progress on evaluation and validation of standard Tropical Rainfall Measuring Mission (TRMM) precipitation retrieval algorithms and the prospects for implementing an improved validation research program for the next generation Global Precipitation Measurement (GPM) Mission. All standard TRMM algorithms are physical in design, and are thus based on fundamental principles of microwave radiative transfer and its interaction with semi-detailed cloud microphysical constituents. They are evaluated for consistency and degree of equivalence with one another, as well as intercompared to radar-retrieved rainfall at TRMM's four main ground validation sites. Similarities and differences are interpreted in the context of the radiative and microphysical assumptions underpinning the algorithms. Results indicate that the current accuracies of the TRMM Version 6 algorithms are approximately 15% at zonal-averaged / monthly scales with precisions of approximately 25% for full resolution / instantaneous rain rate estimates (i.e., level 2 retrievals). Strengths and weaknesses of the TRMM validation approach are summarized. Because the dew of convergence of level 2 TRMM algorithms is being used as a guide for setting validation requirements for the GPM mission, it is important that the GPM algorithm validation program be improved to ensure concomitant improvement in the standard GPM retrieval algorithms. An overview of the GPM Mission's validation plan is provided including a description of a new type of physical validation model using an analytic 3-dimensional radiative transfer model.

Smith, Eric A.↗

A Vehicle Management End-to-End Testing and Analysis Platform for Validation of Mission and Fault Management Algorithms to Reduce Risk for NASAs Space Launch System

The engineering development of the National Aeronautics and Space Administration's (NASA) new Space Launch System (SLS) requires cross discipline teams with extensive knowledge of launch vehicle subsystems, information theory, and autonomous algorithms dealing with all operations from pre-launch through on orbit operations. The nominal and off-nominal characteristics of SLS's elements and subsystems must be understood and matched with the autonomous algorithm monitoring and mitigation capabilities for accurate control and response to abnormal conditions throughout all vehicle mission flight phases, including precipitating safing actions and crew aborts. This presents a large and complex systems engineering challenge, which is being addressed in part by focusing on the specific subsystems involved in the handling of off-nominal mission and fault tolerance with response management. Using traditional model-based system and software engineering design principles from the Unified Modeling Language (UML) and Systems Modeling Language (SysML), the Mission and Fault Management (M&FM) algorithms for the vehicle are crafted and vetted in Integrated Development Teams (IDTs) composed of multiple development disciplines such as Systems Engineering (SE), Flight Software (FSW), Safety and Mission Assurance (S&MA) and the major subsystems and vehicle elements such as Main Propulsion Systems (MPS), boosters, avionics, Guidance, Navigation, and Control (GNC), Thrust Vector Control (TVC), and liquid engines. These model-based algorithms and their development lifecycle from inception through FSW certification are an important focus of SLS's development effort to further ensure reliable detection and response to off-nominal vehicle states during all phases of vehicle operation from pre-launch through end of flight. To test and validate these M&FM algorithms a dedicated test-bed was developed for full Vehicle Management End-to-End Testing (VMET). For addressing fault management (FM) early in the development lifecycle for the SLS program, NASA formed the M&FM team as part of the Integrated Systems Health Management and Automation Branch under the Spacecraft Vehicle Systems Department at the Marshall Space Flight Center (MSFC). To support the development of the FM algorithms, the VMET developed by the M&FM team provides the ability to integrate the algorithms, perform test cases, and integrate vendor-supplied physics-based launch vehicle (LV) subsystem models. Additionally, the team has developed processes for implementing and validating the M&FM algorithms for concept validation and risk reduction. The flexibility of the VMET capabilities enables thorough testing of the M&FM algorithms by providing configurable suites of both nominal and off-nominal test cases to validate the developed algorithms utilizing actual subsystem models such as MPS, GNC, and others. One of the principal functions of VMET is to validate the M&FM algorithms and substantiate them with performance baselines for each of the target vehicle subsystems in an independent platform exterior to the flight software test and validation processes. In any software development process there is inherent risk in the interpretation and implementation of concepts from requirements and test cases into flight software compounded with potential human errors throughout the development and regression testing lifecycle. Risk reduction is addressed by the M&FM group but in particular by the Analysis Team working with other organizations such as S&MA, Structures and Environments, GNC, Orion, Crew Office, Flight Operations, and Ground Operations by assessing performance of the M&FM algorithms in terms of their ability to reduce Loss of Mission (LOM) and Loss of Crew (LOC) probabilities. In addition, through state machine and diagnostic modeling, analysis efforts investigate a broader suite of failure effects and associated detection and responses to be tested in VMET to ensure reliable failure detection, and confirm responses do not create additional risks or cause undesired states through interactive dynamic effects with other algorithms and systems. VMET further contributes to risk reduction by prototyping and exercising the M&FM algorithms early in their implementation and without any inherent hindrances such as meeting FSW processor scheduling constraints due to their target platform - the ARINC 6535-partitioned Operating System, resource limitations, and other factors related to integration with other subsystems not directly involved with M&FM such as telemetry packing and processing. The baseline plan for use of VMET encompasses testing the original M&FM algorithms coded in the same C++ language and state machine architectural concepts as that used by FSW. This enables the development of performance standards and test cases to characterize the M&FM algorithms and sets a benchmark from which to measure their effectiveness and performance in the exterior FSW development and test processes. This paper is outlined in a systematic fashion analogous to a lifecycle process flow for engineering development of algorithms into software and testing. Section I describes the NASA SLS M&FM context, presenting the current infrastructure, leading principles, methods, and participants. Section II defines the testing philosophy of the M&FM algorithms as related to VMET followed by section III, which presents the modeling methods of the algorithms to be tested and validated in VMET. Its details are then further presented in section IV followed by Section V presenting integration, test status, and state analysis. Finally, section VI addresses the summary and forward directions followed by the appendices presenting relevant information on terminology and documentation.

Trevino, Luis↗

A Vehicle Management End-to-End Testing and Analysis Platform for Validation of Mission and Fault Management Algorithms to Reduce Risk for NASA's Space Launch System

The development of the Space Launch System (SLS) launch vehicle requires cross discipline teams with extensive knowledge of launch vehicle subsystems, information theory, and autonomous algorithms dealing with all operations from pre-launch through on orbit operations. The characteristics of these systems must be matched with the autonomous algorithm monitoring and mitigation capabilities for accurate control and response to abnormal conditions throughout all vehicle mission flight phases, including precipitating safing actions and crew aborts. This presents a large complex systems engineering challenge being addressed in part by focusing on the specific subsystems handling of off-nominal mission and fault tolerance. Using traditional model based system and software engineering design principles from the Unified Modeling Language (UML), the Mission and Fault Management (M&FM) algorithms are crafted and vetted in specialized Integrated Development Teams composed of multiple development disciplines. NASA also has formed an M&FM team for addressing fault management early in the development lifecycle. This team has developed a dedicated Vehicle Management End-to-End Testbed (VMET) that integrates specific M&FM algorithms, specialized nominal and off-nominal test cases, and vendor-supplied physics-based launch vehicle subsystem models. The flexibility of VMET enables thorough testing of the M&FM algorithms by providing configurable suites of both nominal and off-nominal test cases to validate the algorithms utilizing actual subsystem models. The intent is to validate the algorithms and substantiate them with performance baselines for each of the vehicle subsystems in an independent platform exterior to flight software test processes. In any software development process there is inherent risk in the interpretation and implementation of concepts into software through requirements and test processes. Risk reduction is addressed by working with other organizations such as S&MA, Structures and Environments, GNC, Orion, the Crew Office, Flight Operations, and Ground Operations by assessing performance of the M&FM algorithms in terms of their ability to reduce Loss of Mission and Loss of Crew probabilities. In addition, through state machine and diagnostic modeling, analysis efforts investigate a broader suite of failure effects and detection and responses that can be tested in VMET and confirm that responses do not create additional risks or cause undesired states through interactive dynamic effects with other algorithms and systems. VMET further contributes to risk reduction by prototyping and exercising the M&FM algorithms early in their implementation and without any inherent hindrances such as meeting FSW processor scheduling constraints due to their target platform - ARINC 653 partitioned OS, resource limitations, and other factors related to integration with other subsystems not directly involved with M&FM. The plan for VMET encompasses testing the original M&FM algorithms coded in the same C++ language and state machine architectural concepts as that used by Flight Software. This enables the development of performance standards and test cases to characterize the M&FM algorithms and sets a benchmark from which to measure the effectiveness of M&FM algorithms performance in the FSW development and test processes. This paper is outlined in a systematic fashion analogous to a lifecycle process flow for engineering development of algorithms into software and testing. Section I describes the NASA SLS M&FM context, presenting the current infrastructure, leading principles, methods, and participants. Section II defines the testing philosophy of the M&FM algorithms as related to VMET followed by section III, which presents the modeling methods of the algorithms to be tested and validated in VMET. Its details are then further presented in section IV followed by Section V presenting integration, test status, and state analysis. Finally, section VI addresses the summary and forward directions followed by the appendices presenting relevant information on terminology and documentation.

Trevino, Luis↗

Contextual classification of multispectral image data

A general method is presented for exploiting both spatial and spectral information when classifying multispectral image data. This statistical classification algorithm utilizes the tendency of certain ground cover classes to be more likely to occur in some contexts than others. The theoretical model assumes the two-dimensional array of random observations and a 0-1 loss function, a distribution of the p-context array that is spatially invariant, and class-conditional independence for the observations. The problems that prevent the immediate use of this context classifier are the need for a generally applicable method for making adequate estimates of the context distribution and a reduction in the computational intensivity of the classifier. The former problem is being approached by a method that raises the relative frequency value for each class configuration to a power and uses the result as the context distribution estimate. The second is being approached by searching for a less computationally intensive algorithm.

Tilton, J. C.↗

Scalable Knowledge Graph Analytics at 136 Petaflop/s

We are motivated by newly proposed methods for data mining large-scale corpora of scholarly publications, such as the full biomedical literature, which may consist of tens of millions of papers spanning decades of research. In this setting, analysts seek to discover how concepts relate to one another. They construct graph representations from annotated text databases and then formulate the relationship-mining problem as one of computing all-pairs shortest paths (APSP), which becomes a significant bottleneck. In this context, we present a new high-performance algorithm and implementation of the Floyd-Warshall algorithm for distributed-memory parallel computers accelerated by GPUs, which we call DSNAPSHOT (Distributed Accelerated Semiring All-Pairs Shortest Path). For our largest experiments, we ran DSNAPSHOT on a connected input graph with millions of vertices using 4, 096nodes (24,576GPUs) of the Oak Ridge National Laboratory's Summit supercomputer system. We find DSNAPSHOT achieves a sustained performance of 136×1015 floating-point operations per second (136petaflop/s) at a parallel efficiency of 90% under weak scaling and, in absolute speed, 70% of the best possible performance given our computation (in the single-precision tropical semiring or “min-plus” algebra). Looking forward, we believe this novel capability will enable the mining of scholarly knowledge corpora when embedded and integrated into artificial intelligence-driven natural language processing workflows at scale.

Kannan, Ramakrishnan {ramki}↗

Cycle-Consistent Adversarial Networks for Realistic Pervasive Change Generation in Remote Sensing Imagery

This paper introduces a new method of generating realistic pervasive changes in the context of evaluating the effectiveness of change detection algorithms in controlled settings. The method - a cycle-consistent adversarial network (CycleGAN) - requires low quantities of training data to generate realistic changes. Here we show an application of CycleGAN in creating realistic snow-covered scenes of multispectral Sentinel-2 imagery, and demonstrate how these images can be used as a test bed for anomalous change detection algorithms.

97 MATHEMATICS AND COMPUTING↗

A Study of QCD Radiation in VBF Higgs Production with Vincia and Pythia

We discuss and illustrate the properties of several parton-shower algorithms available in Pythia and Vincia, in the context of Higgs production via vector boson fusion (VBF). In particular, the distinctive colour topology of VBF processes allows to define observables sensitive to the coherent radiation pattern of additional jets. We study a set of such observables, using the Vincia sector-antenna shower as our main reference, and contrast it to Pythia's transverse-momentum-ordered DGLAP shower as well as Pythia's dipole-improved shower. We then investigate the robustness of these predictions as successive levels of higher-order perturbative matrix elements are incorporated, including next-to-leading-order matched and tree-level merged calculations, using Powheg Box and Sherpa respectively to generate the hard events.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Using a focal-plane array to estimate antenna pointing errors

The use of extra collecting horns in the focal plane of an antenna as a means of determining the Direction of Arrival (DOA) of the signal impinging on it, provided it is within the antenna beam, is considered. Our analysis yields a relatively simple algorithm to extract the DOA from the horns' outputs. An algorithm which, in effect, measures the thermal noise of the horns' signals and determines its effect on the uncertainty of the extracted DOA parameters is developed. Both algorithms were implemented in software and tested in simulated data. Based on these tests, it is concluded that this is a viable approach to the DOA determination. Though the results obtained are of general applicability, the particular motivation for the present work is their application to the pointing of a mechanically deformed antenna. It is anticipated that the pointing algorithm developed for a deformed antenna could be obtained as a small perturbation of the algorithm developed for an undeformed antenna. In this context, it should be pointed out that, with a deformed antenna, the array of horns and its associated circuitry constitute the main part of the deformation-compensation system. In this case, the pointing system proposed may be viewed as an additional task carried out by the deformation-compensation hardware.

Zohar, S.↗