Search NASA⌕ Search

SEARCH · Search NASA

Results for “Node selection”

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 235 records · Page 13

Smart controller with phantom inductor current sensing for switched mode power supplies

Voltage on the output terminal of an inductor is obtained as a first input signal to a control block (CB); the inductor has an input terminal connected to a power switch and driver block at a switching node. A sense input voltage is obtained on an output terminal of a sensing circuit that is not directly connected to the switching node, as a second input signal to the CB. A voltage is generated on a first output terminal of the CB and is selected such that the CB can use its first and second input signals to infer the current through the inductor. A pulse width modulation (PWM) signal is generated on a second output terminal of the CB, based on the inferred current through the inductor; the second output signal from the CB is provided to a PWM input terminal of the power switch and driver block.

Zhang, Xin↗

Planning air transport network in Appalachia

Main issues to be considered in designing an air transport system are discussed, and a model for the selection of an optimal air network for a region is presented. It was desired to have the ability to consider a dense network of nodes and air routes and variations in schedules on routes, which in combination would represent virtually all conceivable alternatives. Linear and integer programming were chosen as the most promising analysis methodologies. Integer programming was found to be intractable, while linear programming provided efficient solutions. The model was applied to studying the feasibility of a STOL network in West Virginia. Based on allowable paths, an examination of intercity demands, and established growth points, desired levels of service expressed as minimum flights were determined for certain city pairs.

Carter, E. C.↗

Multivariate Methods for Prediction of Geologic Sample Composition with Laser-Induced Breakdown Spectroscopy

Laser-induced breakdown spectroscopy (LIBS) uses pulses of laser light to ablate a material from the surface of a sample and produce an expanding plasma. The optical emission from the plasma produces a spectrum which can be used to classify target materials and estimate their composition. The ChemCam instrument on the Mars Science Laboratory (MSL) mission will use LIBS to rapidly analyze targets remotely, allowing more resource- and time-intensive in-situ analyses to be reserved for targets of particular interest. ChemCam will also be used to analyze samples that are not reachable by the rover's in-situ instruments. Due to these tactical and scientific roles, it is important that ChemCam-derived sample compositions are as accurate as possible. We have compared the results of partial least squares (PLS), multilayer perceptron (MLP) artificial neural networks (ANNs), and cascade correlation (CC) ANNs to determine which technique yields better estimates of quantitative element abundances in rock and mineral samples. The number of hidden nodes in the MLP ANNs was optimized using a genetic algorithm. The influence of two data preprocessing techniques were also investigated: genetic algorithm feature selection and averaging the spectra for each training sample prior to training the PLS and ANN algorithms. We used a ChemCam-like laboratory stand-off LIBS system to collect spectra of 30 pressed powder geostandards and a diverse suite of 196 geologic slab samples of known bulk composition. We tested the performance of PLS and ANNs on a subset of these samples, choosing to focus on silicate rocks and minerals with a loss on ignition of less than 2 percent. This resulted in a set of 22 pressed powder geostandards and 80 geologic samples. Four of the geostandards were used as a validation set and 18 were used as the training set for the algorithms. We found that PLS typically resulted in the lowest average absolute error in its predictions, but that the optimized MLP ANN and the CC ANN often gave results comparable to PLS. Averaging the spectra for each training sample and/or using feature selection to choose a small subset of wavelengths to use for predictions gave mixed results, with degraded performance in some cases and similar or slightly improved performance in other cases. However, training time was significantly reduced for both PLS and ANN methods by implementing feature selection, making this a potentially appealing method for initial, rapid-turn-around analyses necessary for Chemcam's tactical role on MSL. Choice of training samples has a strong influence on the accuracy of predictions. We are currently investigating the use of clustering algorithms (e.g. k-means, neural gas, etc.) to identify training sets that are spectrally similar to the unknown samples that are being predicted, and therefore result in improved predictions

Morris, Richard↗

Wireless Augmented Reality Communication System

A portable unit is for video communication to select a user name in a user name network. A transceiver wirelessly accesses a communication network through a wireless connection to a general purpose node coupled to the communication network. A user interface can receive user input to log on to a user name network through the communication network. The user name network has a plurality of user names, at least one of the plurality of user names is associated with a remote portable unit, logged on to the user name network and available for video communication.

Devereaux, Ann↗

Wireless Augmented Reality Communication System

A portable unit is for video communication to select a user name in a user name network. A transceiver wirelessly accesses a communication network through a wireless connection to a general purpose node coupled to the communication network. A user interface can receive user input to log on to a user name network through the communication network. The user name network has a plurality of user names, at least one of the plurality of user names is associated with a remote portable unit, logged on to the user name network and available for video communication.

Devereaux, Ann↗

Location Selection of Fast-Charging Station for Heavy-Duty EVs Using GIS and Grid Analysis: Preprint

This work presents a systematic methodology for the location selection of fast-charging stations for heavy-duty Electric Vehicles (EVs) based on both geospatial and electrical grid analysis. The geo-spatial analysis is based on real-world geographic information system (GIS) data of road networks and existing supportive infrastructures. The grid analysis is implemented based on node level analysis of potential impacts on voltages and power losses in distribution system. A case study using realistic three-phase unbalanced distribution feeder from California and extracted real-world GIS data is used to demonstrate the intuitiveness and effectiveness of the proposed methodology for the location selection of fast charging station for heavy duty EVs.

47 OTHER INSTRUMENTATION↗

Three-State Majority-vote Model on Scale-Free Networks and the Unitary Relation for Critical Exponents

Abstract We investigate the three-state majority-vote model for opinion dynamics on scale-free and regular networks. In this model, an individual selects an opinion equal to the opinion of the majority of its neighbors with probability 1 − q , and different to it with probability q . The parameter q is called the noise parameter of the model. We build a network of interactions where z neighbors are selected by each added site in the system, a preferential attachment network with degree distribution k − λ , where λ = 3 for a large number of nodes N . In this work, z is called the growth parameter. Using finite-size scaling analysis, we obtain that the critical exponents $$\beta /\bar{\nu }$$ β / ν ¯ and $$\gamma /\bar{\nu }$$ γ / ν ¯ associated with the magnetization and the susceptibility, respectively. Using Monte Carlo simulations, we calculate the critical noise parameter q c as a function of z for the scale-free networks and obtain the phase diagram of the model. We find that the critical exponents add up to unity when using a special volumetric scaling, regardless of the dimension of the network of interactions. We verify this result by obtaining the critical noise and the critical exponents for the two and three-state majority-vote model on cubic lattice networks.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

MemXCT: Design, Optimization, Scaling, and Reproducibility of X-Ray Tomography Imaging

Here, this work extends our previous research entitled "MemXCT: Memory-centric X-ray CT Reconstruction with Massive Parallelization" that was originally published at SC19 conference (Hidayetoglu et al., 2019) with reproducibility of the computational imaging performance. X-ray computed tomography (XCT) is regularly used at synchrotron light sources to study the internal morphology of materials at high resolution. However, experimental constraints, such as radiation sensitivity, can result in noisy or undersampled measurements. Further, depending on the resolution, sample size and data acquisition rates, the resulting noisy dataset can be in the order of terabytes. Advanced iterative reconstruction techniques can produce high-quality images from noisy measurements, but their computational requirements have made their use an exception rather than the rule. We propose a novel memory-centric approach that avoids redundant computations at the expense of additional memory complexity. We develop a memory-centric iterative reconstruction system, MemXCT, that uses an optimized SpMV implementation with two-level pseudo-Hilbert ordering and multi-stage input buffering. We evaluate MemXCT on various supercomputer architectures involving KNL and GPU. MemXCT can reconstruct a large (11Kx11K) mouse brain tomogram in 10 seconds using 4096 KNL nodes (256K cores). The results presented in our original article at the SC19 were based on large-scale supercomputing resources. The MemXCT application was selected for the Student Cluster Competition (SCC) Reproducibility Challenge and evaluated on a variety of cloud computing resources by universities around the world in the SC20 conference. We summarize the results of the top-ranked SCC Reproducibility Challenge teams and identify the most pertinent measures for ensuring the reproducibility of our experiments in this article.

47 OTHER INSTRUMENTATION↗

Evaluating Trade-offs in Potential Exascale Interconnect Topologies

This study looks at the high-level trade-offs for interconnect architectures that are likely to be available in HPC machines in the 2021-2022 timeframe. The study uses multiple simulation models to look at the effects of varying machine size, injection bandwidth and topology for a selected set of benchmark communication patterns. The studies show the sensitivity of various applications to these network parameters. This study can help inform decisions on node size versus number of nodes, which topology is most efficient for our applications, how much injection bandwidth to provision, etc. These simulations only look at interconnects with maximally configured global bandwidth, and studies of networks configured with less will be the subject of future milestones.

97 MATHEMATICS AND COMPUTING↗

Scalable/Secure Cooperative Algorithms and Framework for Extremely-high Penetration Solar Integration (SolarExPert) (Final Technical Report)

This SolarExPert project has developed a Sustainable Grid Platform (SGP) with scalable architecture of distributed control and optimization. The SGP consists of the following major functions: 1) an advanced grid architecture with hierarchical and distributed communication and control, combined with the OpenFMB standard and implemented on the Multi-Agent OpenDSS (MA-OpenDSS) platform; 2) an online distributed stochastic optimal power flow; 3) an online distributed system state estimation algorithm; 4) the distributed Volt/VAR optimization and frequency control algorithms; 5) the distributed distribution system restoration strategy. The developed SGP together with advanced functions are tested in 1 million (1M)-node distribution system on the MA-OpenDSS platform. Furthermore, the models and algorithms are tested in 100,000-node system HiL simulation, and also in P-HiL implementation with 100 physical devices. The developed functions haven been validated and tested on the selected actual distribution feeder with the data collected from the field of Maui Meadows in Hawaii. The distributed PV hosting capacities with cooperative Volt/VAR and Volt/VAR/Watt control are estimated and compared to provide recommendations for customers and the utility company.

14 SOLAR ENERGY↗

PDnetwork

PDnetwork is an interactive online tool designed to visualize the evolution of the co-authorship network in the field of peridynamics. In this network, each node represents a peridynamics author, and each link represents co-authorship between authors. The tool allows users to obtain collaborative measures for authors using selected network metrics and visualize collaborations for specific authors. Additionally, it provides rankings for authors based on selected collaboration metrics and includes links to the author profiles in the Scopus publication database.

Dahal, Biraj [Georgia Institute of Technology, Atl↗

Orbit determination study results for the Venus Radar Mapper orbiter

The Venus Radar Mapper (VRM), to be launched by the U.S. in July 1988 is described and Doppler-only and Doppler plus N-Delta-VLBI data analyses are contrasted in order to evaluate the importance of VLBI data to VRM orbit determination (OD). VRM OD study results are summarized by showing the accuracy of various orbital parameters for ten cases selected over a 243-day primary mission. It is concluded that VLBI data were responsible for improving the knowledge of the longitude of the ascending node with respect to the plane of the sky by a factor of 5 to 10 throughout (excluding superior conjunction) this primary mission. It is noted that there is a certain sensitivity to where along the orbit the VLBI data are acquired.

Esposito, P. B.↗

Conforming versus non-conforming boundary elements in three-dimensional elastostatics

A critical comparison of two basic formulations in three-dimensional elastostatics, using conforming and nonconforming boundary elements, is presented. The basic structure of the boundary element method is developed. The peculiarities that both types of boundary elements present in relation to the numerical implementation are discussed. Through selected examples, key issues such as the computational advantages and disadvantages of both formulations, mesh discretization and accuracy questions, and optimal location of the collocation nodes in the case of nonconforming elements are addressed. It is shown that conforming elements are able to produce more accurate results than nonconforming ones, with substantial economy in the final size of the system equations.

Manolis, G. D.↗

Tracking transactions using extended memory features

An approach is disclosed that tracks memory transactions by a node. The approach establishes a transaction processing state corresponding to common virtual addresses accessed by a processing threads. Transactions are executed by the threads. A selected transaction is allowed to complete. In response to detecting a conflict in the transaction processing state, completion of a non-selected transaction is inhibited.

Kahle, James Allan↗

OpenACC Profiling Support for Clang and LLVM using Clacc and TAU

Since its launch in 2010, OpenACC has evolved into one of the most widely used portable programming models for accelerators on HPC systems today. Clacc is a project funded by the US Exascale Computing Project (ECP) to bring OpenACC support for C and C++ to the popular Clang and LLVM compiler infrastructure. In this paper, we describe Clacc's support for the OpenACC Profiling Interface, a critical component of the OpenACC specification that standardizes an interface that profiling tools and libraries can depend upon across OpenACC implementations. As part of Clacc's general strategy to build OpenACC support upon OpenMP, we describe how Clacc builds OpenACC Profiling Interface support upon an extended version of OMPT. We then describe how a major profiling and tracing toolkit within ECP, the TAU Performance System, takes advantage of this support. We also describe TAU's selective instrumentation support for OpenACC. Finally, using Clacc and TAU, we present example visualizations for several SPEC ACCEL OpenACC benchmarks running on an IBM AC922 node, and we show that the associated performance overhead is negligible.

Coti, Camille↗

Location Selection of Fast-Charging Station for Heavy-Duty EVs Using GIS and Grid Analysis

This work presents a systematic methodology for the location selection of fast-charging stations for heavy-duty electric vehicles (EVs) based on both geospatial and electric grid analysis. The geospatial analysis is based on real-world geographic information system (GIS) data of road networks and existing supportive infrastructures. The grid analysis is implemented based on node-level analysis of potential impacts on voltages and power losses in the distribution system. A case study using a realistic, three-phase, unbalanced distribution feeder from California and extracted real-world GIS data is used to demonstrate the intuitiveness and effectiveness of the proposed methodology for the location selection of fast-charging stations for heavy-duty EVs considering both electric and existing transportation infrastructures.

47 OTHER INSTRUMENTATION↗

A MultiGPU Performance-Portable Solution for Array Programming Based on Kokkos

Today, multiGPU nodes are widely used in high-performance computing and data centers. However, current programming models do not provide simple, transparent, and portable support for automatically targeting multiple GPUs within a node on application areas of array programming. In this paper, we describe a new application programming interface based on the Kokkos programming model to enable array computation on multiple GPUs in a transparent and portable way across both NVIDIA and AMD GPUs. We implement different variations of this technique to accommodate the exchange of stencils (array boundaries) among different GPU memory spaces, and we provide autotuning to select the proper number of GPUs, depending on the computational cost of the operations to be computed on arrays, that is completely transparent to the programmer. We evaluate our multiGPU extension on Summit (#5 TOP500), with six NVIDIA V100 Volta GPUs per node, and Crusher that contains identical hardware/software as Frontier (#1 TOP500), with four AMD MI250X GPUs, each with 2 Graphics Compute Dies (GCDs)for a total of 8 GCDs per node. We also compare the performance of this solution against the use of MPI + Kokkos, which is the cur-rent de facto solution for multiple GPUs in Kokkos. Our evaluation shows that the new Kokkos solution provides good scalability for many GPUs and a faster and simpler solution (from a programming productivity perspective) than MPI + Kokkos.

Valero Lara, Pedro↗

Deep graph representations embed network information for robust disease marker identification

We report that the accurate disease diagnosis and prognosis based on omics data rely on the effective identification of robust prognostic and diagnostic markers that reflect the states of the biological processes underlying the disease pathogenesis and progression. In this article, we present GCNCC, a Graph Convolutional Network-based approach for Clustering and Classification, that can identify highly effective and robust network-based disease markers. Based on a geometric deep learning framework, GCNCC learns deep network representations by integrating gene expression data with protein interaction data to identify highly reproducible markers with consistently accurate prediction performance across independent datasets possibly from different platforms. GCNCC identifies these markers by clustering the nodes in the protein interaction network based on latent similarity measures learned by the deep architecture of a graph convolutional network, followed by a supervised feature selection procedure that extracts clusters that are highly predictive of the disease state. By benchmarking GCNCC based on independent datasets from different diseases (psychiatric disorder and cancer) and different platforms (microarray and RNA-seq), we show that GCNCC outperforms other state-of-the-art methods in terms of accuracy and reproducibility.

59 BASIC BIOLOGICAL SCIENCES↗