Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “NODES”

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

Glide dislocation nucleation from dislocation nodes at semi-coherent {111} Cu–Ni interfaces

Using atomistic simulations and dislocation theory on a model system of semi-coherent {1 1 1} interfaces, we show that misfit dislocation nodes adopt multiple atomic arrangements corresponding to the creation and redistribution of excess volume at the nodes. We identified four distinctive node structures: volume-smeared nodes with (i) spiral or (ii) straight dislocation patterns, and volume-condensed nodes with (iii) triangular or (iv) hexagonal dislocation patterns. Volume-smeared nodes contain interfacial dislocations lying in the Cu–Ni interface but volume-condensed nodes contain two sets of interfacial dislocations in the two adjacent interfaces and jogs across the atomic layer between the two adjacent interfaces. Finally, under biaxial tension/compression applied parallel to the interface, we show that the nucleation of lattice dislocations is preferred at the nodes and is correlated with the reduction of excess volume at the nodes.

36 MATERIALS SCIENCE↗

Protograph LDPC Codes with Node Degrees at Least 3

In this paper we present protograph codes with a small number of degree-3 nodes and one high degree node. The iterative decoding threshold for proposed rate 1/2 codes are lower, by about 0.2 dB, than the best known irregular LDPC codes with degree at least 3. The main motivation is to gain linear minimum distance to achieve low error floor. Also to construct rate-compatible protograph-based LDPC codes for fixed block length that simultaneously achieves low iterative decoding threshold and linear minimum distance. We start with a rate 1/2 protograph LDPC code with degree-3 nodes and one high degree node. Higher rate codes are obtained by connecting check nodes with degree-2 non-transmitted nodes. This is equivalent to constraint combining in the protograph. The condition where all constraints are combined corresponds to the highest rate code. This constraint must be connected to nodes of degree at least three for the graph to have linear minimum distance. Thus having node degree at least 3 for rate 1/2 guarantees linear minimum distance property to be preserved for higher rates. Through examples we show that the iterative decoding threshold as low as 0.544 dB can be achieved for small protographs with node degrees at least three. A family of low- to high-rate codes with minimum distance linearly increasing in block size and with capacity-approaching performance thresholds is presented. FPGA simulation results for a few example codes show that the proposed codes perform as predicted.

low density parity check (LDPC)↗

Comparison of Node-Centered and Cell-Centered Unstructured Finite-Volume Discretizations: Viscous Fluxes - Part 1

Discretization of the viscous terms in current finite-volume unstructured-grid schemes are compared using node-centered and cell-centered approaches in two dimensions. Accuracy and efficiency are studied for six nominally second-order accurate schemes: a node-centered scheme, cell-centered node-averaging schemes with and without clipping, and cell-centered schemes with unweighted, weighted, and approximately mapped least-square face gradient reconstruction. The grids considered range from structured (regular) grids to irregular grids composed of arbitrary mixtures of triangles and quadrilaterals, including random perturbations of the grid points to bring out the worst possible behavior of the solution. Two classes of tests are considered. The first class of tests involves smooth manufactured solutions on both isotropic and highly anisotropic grids with discontinuous metrics, typical of those encountered in grid adaptation. The second class concerns solutions and grids varying strongly anisotropically over a curved body, typical of those encountered in high-Reynolds number turbulent flow simulations. Results from the first class indicate the face least-square methods, the node-averaging method without clipping, and the node-centered method demonstrate second-order convergence of discretization errors with very similar accuracies per degree of freedom. The second class of tests are more discriminating. The node-centered scheme is always second order with an accuracy and complexity in linearization comparable to the best of the cell-centered schemes. In comparison, the cell-centered node-averaging schemes are less accurate, have a higher complexity in linearization, and can fail to converge to the exact solution when clipping of the node-averaged values is used. The cell-centered schemes using least-square face gradient reconstruction have more compact stencils with a complexity similar to the complexity of the node-centered scheme. For simulations on highly anisotropic curved grids, the least-square methods have to be amended either by introducing a local mapping of the surface anisotropy or modifying the scheme stencil to reflect the direction of strong coupling.

Diskin, Boris↗

Nodal Modeling of Tank Pressurization and Draining using a Multi-Node-Ullage Approach

The purpose of the pressurization system in liquid rocket propulsion is to control the pressure in the gas space of the propellant tank (known as the ullage space) and the propellant mass flowrate to the engine. A mathematical model is required to predict the amount of pressurant necessary to ensure that pressure and temperature levels inside the tank remain within acceptable limits and that the propellant pressure leaving the tank satisfies the net positive suction pressure (NPSP) requirement of the pump feeding the engine. Nodal codes typically model tank pressurization and draining using a single node to represent the ullage and a single node to represent the propellant. As the tank drains, the ullage node grows and the propellant node shrinks. The heat transfer between ullage to wall and ullage to propellant is governed by natural convection. Designers of liquid propulsion systems often use empirical correlations to estimate the “Collapse Factor” which represents the ratio of pressurant required with heat transfer and the amount of pressurant required without heat transfer. A single node ullage model of tank pressurization was developed using GFSSP to compute the collapse factor reasonably well and later was used to model tank pressurization during test firing of the FASTRAC rocket engine. The predicted tank pressure compared well with the test data. In the early 1970’s, pressurization and drain tests with liquid methane were performed at NASA Lewis Research Center in a vacuum chamber. A 5 ft diameter spherical aluminum tank was tested to drain from 95% to 5% full using gaseous helium, hydrogen, nitrogen and methane as pressurant. Tests were conducted with different pressurant inlet temperatures and drain times. Measured data include pressurant requirement, amount of pressurant condensed, and ullage and wall temperatures at various heights in the ullage space at the end of draining. A single node GFSSP model was developed to simulate helium pressurization of the methane tank. Predicted helium consumption was 8-23% less than measured. The average error of the six test cases was 16%. A single ullage node with multiple solid node model was developed using Thermal Desktop. Predicted helium consumption compares with the test data within 2%. This paper describes the development of a GFSSP multi-node ullage model of the test configuration and compares the predicted pressurant consumption for both helium and autogenous pressurization using gaseous methane with experimental as well as TD predictions.

Nodal Model↗

Method and apparatus for obtaining stack traceback data for multiple computing nodes of a massively parallel computer system

A data collector for a massively parallel computer system obtains call-return stack traceback data for multiple nodes by retrieving partial call-return stack traceback data from each node, grouping the nodes in subsets according to the partial traceback data, and obtaining further call-return stack traceback data from a representative node or nodes of each subset. Preferably, the partial data is a respective instruction address from each node, nodes having identical instruction address being grouped together in the same subset. Preferably, a single node of each subset is chosen and full stack traceback data is retrieved from the call-return stack within the chosen node.

Gooding, Thomas Michael↗

Reducing power consumption while synchronizing a plurality of compute nodes during execution of a parallel application

Methods, apparatus, and products are disclosed for reducing power consumption while synchronizing a plurality of compute nodes during execution of a parallel application that include: beginning, by each compute node, performance of a blocking operation specified by the parallel application, each compute node beginning the blocking operation asynchronously with respect to the other compute nodes; reducing, for each compute node, power to one or more hardware components of that compute node in response to that compute node beginning the performance of the blocking operation; and restoring, for each compute node, the power to the hardware components having power reduced in response to all of the compute nodes beginning the performance of the blocking operation.

97 MATHEMATICS AND COMPUTING↗

Implementing asyncronous collective operations in a multi-node processing system

A method, system, and computer program product are disclosed for implementing an asynchronous collective operation in a multi-node data processing system. In one embodiment, the method comprises sending data to a plurality of nodes in the data processing system, broadcasting a remote get to the plurality of nodes, and using this remote get to implement asynchronous collective operations on the data by the plurality of nodes. In one embodiment, each of the nodes performs only one task in the asynchronous operations, and each nodes sets up a base address table with an entry for a base address of a memory buffer associated with said each node. In another embodiment, each of the nodes performs a plurality of tasks in said collective operations, and each task of each node sets up a base address table with an entry for a base address of a memory buffer associated with the task.

97 MATHEMATICS AND COMPUTING↗

Self-pacing direct memory access data transfer operations for compute nodes in a parallel computer

Methods, apparatus, and products are disclosed for self-pacing DMA data transfer operations for nodes in a parallel computer that include: transferring, by an origin DMA on an origin node, a RTS message to a target node, the RTS message specifying an message on the origin node for transfer to the target node; receiving, in an origin injection FIFO for the origin DMA from a target DMA on the target node in response to transferring the RTS message, a target RGET descriptor followed by a DMA transfer operation descriptor, the DMA descriptor for transmitting a message portion to the target node, the target RGET descriptor specifying an origin RGET descriptor on the origin node that specifies an additional DMA descriptor for transmitting an additional message portion to the target node; processing, by the origin DMA, the target RGET descriptor; and processing, by the origin DMA, the DMA transfer operation descriptor.

97 MATHEMATICS AND COMPUTING↗

Performing optimized collective operations in an irregular subcommunicator of compute nodes in a parallel computer

In a parallel computer, performing optimized collective operations in an irregular subcommunicator of compute nodes may be carried out by: identifying, within the irregular subcommunicator, regular neighborhoods of compute nodes; selecting, for each neighborhood from the compute nodes of the neighborhood, a local root node; assigning each local root node to a node of a neighborhood-wide tree topology; mapping, for each neighborhood, the compute nodes of the neighborhood to a local tree topology having, at its root, the local root node of the neighborhood; and performing a one way, rooted collective operation within the subcommunicator including: performing, in one phase, the collective operation within each neighborhood; and performing, in another phase, the collective operation amongst the local root nodes.

Davis, Kristan D.↗

Blockchain Secured Alternative to Mixed Routing / Non-Routing Nodes Wireless Sensor Network Topologies for Industrial Settings

Mesh networking of wireless sensors implies that individual sensor nodes will be able to communicate with neighboring nodes thereby forming a communication fabric. In the case of traditional wireless sensors, their radio frequency coverage – or RF footprint – is defined by the maximum separation distance between neighboring nodes while still achieving some level of, typically degrading from maximum, information transfer (throughput). Security issues arise in the situations where the sensor nodes are deployed near the physical boundary of an industrial site (edge nodes). In the more general case of the sensors relying on omnidirectional antennas, the edge nodes’ RF footprint may extend beyond the edge of the facility. If the edge nodes perform as routing nodes, then it may be possible for similar sensors/devices outside of the facility boundary to join the network. Here, while various schemes have been implemented to address this security issue, we report on the possibility of using blockchain for security of such edge nodes.

47 OTHER INSTRUMENTATION↗

Performing optimized collective operations in a irregular subcommunicator of compute nodes in a parallel computer

In a parallel computer, performing optimized collective operations in an irregular subcommunicator of compute nodes may be carried out by: identifying, within the irregular subcommunicator, regular neighborhoods of compute nodes; selecting, for each neighborhood from the compute nodes of the neighborhood, a local root node; assigning each local root node to a node of a neighborhood-wide tree topology; mapping, for each neighborhood, the compute nodes of the neighborhood to a local tree topology having, at its root, the local root node of the neighborhood; and performing a one way, rooted collective operation within the subcommunicator including: performing, in one phase, the collective operation within each neighborhood; and performing, in another phase, the collective operation amongst the local root nodes.

Davis, Kristan Suzanne D.↗

Characterization, Structure, and Reactivity of Hydroxyl Groups on Metal‐Oxide Cluster Nodes of Metal–Organic Frameworks: Structural Diversity and Keys to Reactivity and Catalysis

Among the most stable metal–organic frameworks (MOFs) are those incorporating nodes that are metal oxide clusters with frames such as Zr 6 O 8 . This review is a summary of the structure, bonding, and reactivity of MOF node hydroxyl groups, emphasizing those bonded to nodes containing aluminum and zirconium ions. Hydroxyl groups are often present on these nodes, sometimes balancing the charges of the metal ions. They arise during MOF syntheses in aqueous media or in post-synthesis treatments. They are identified with infrared and 1 H nuclear magnetic resonance spectroscopies and characterized by their reactivities with polar compounds such as alcohols. Terminal OH, paired µ 2 -OH, and aqua groups on nodes are catalytic sites in numerous reactions. Relatively unreactive hydroxyl groups (such as isolated µ 2 -OH groups) may replace reactive groups and inhibit catalysis; some node hydroxyl groups (e.g., µ 3 -OH) are mere spectators in catalysis. There are similarities between MOF node hydroxyl groups and those on the surfaces of bulk metal oxides, zeolites, and enzymes, but the comparisons are mostly inexact, and much remains to be understood about MOF node hydroxyl group chemistry. It is posited that understanding and controlling this chemistry will lead to tailored MOFs and improved adsorbents and catalysts.

36 MATERIALS SCIENCE↗

Correlation of N-myc downstream-regulated gene 1 subcellular localization and lymph node metastases of colorectal neoplasms

Highlights: •We clarified NDRG1 subcellular location in colorectal cancer. •We found the changes of NDRG1 distribution during colorectal cancer progression. •We clarified the correlation between NDRG1 distribution and lymph node metastasis. •It is possible that NDRG1 subcellular localization may determine its function. •Maybe NDRG1 is valuable early diagnostic markers for metastasis. -- Abstract: In colorectal neoplasms, N-myc downstream-regulated gene 1 (NDRG1) is a primarily cytoplasmic protein, but it is also expressed on the cell membrane and in the nucleus. NDRG1 is involved in various stages of tumor development in colorectal cancer, and it is possible that the different subcellular localizations may determine the function of NDRG1 protein. Here, we attempt to clarify the characteristics of NDRG1 protein subcellular localization during the progression of colorectal cancer. We examined NDRG1 expression in 49 colorectal cancer patients in cancerous, non-cancerous, and corresponding lymph node tissues. Cytoplasmic and membrane NDRG1 expression was higher in the lymph nodes with metastases than in those without metastases (P < 0.01). Nuclear NDRG1 expression in colorectal neoplasms was significantly higher than in the normal colorectal mucosa, and yet the normal colorectal mucosa showed no nuclear expression. Furthermore, our results showed higher cytoplasmic NDRG1 expression was better for differentiation, and higher membrane NDRG1 expression resulted in a greater possibility of lymph node metastasis. These data indicate that a certain relationship between the cytoplasmic and membrane expression of NDRG1 in lymph nodes exists with lymph node metastasis. NDRG1 expression may translocate from the membrane of the colorectal cancer cells to the nucleus, where it is involved in lymph node metastasis. Combination analysis of NDRG1 subcellular expression and clinical variables will help predict the incidence of lymph node metastasis.

60 APPLIED LIFE SCIENCES↗

Patterns of Retropharyngeal Node Metastasis in Nasopharyngeal Carcinoma

Purpose: To explore the pattern of metastasis to retropharyngeal lymph nodes (RLN) and its relationship with tumor range in nasopharyngeal carcinoma (NPC) patients by using magnetic resonance imaging. Methods and Materials: Magnetic resonance images of 618 NPC patients were reviewed. Nodes were classified as metastatic on the basis of size criteria, the presence of nodal necrosis, and extracapsular spread. Results: A total of 597 involved RLN were detected in 392 patients (63.4%). The sites of RLN metastasis included occipital bone, 37 (6.2%); first cervical vertebra (C1), 453 (75.9%); second cervical vertebra (C2), 104 (17.4%); and third cervical vertebra (C3), 3 (0.5%). The incidence of RLN involvement was less than that of Level IIb node involvement (72.2% vs. 86.5%) in 543 patients with lymphadenopathy. The incidence of RLN metastasis was significantly higher in cases of parapharyngeal space invasion or involvement of Level II, Level III, Level IV, and/or Level V nodes and significantly lower in N0 and Stage I disease. Conversely, the incidence of RLN metastasis did not differ significantly among T1, 2, 3, and 4 disease or among Stage II, III, and IV disease. Conclusions: Level IIb nodes, rather than RLN, seem to be the first-echelon nodes in NPC. The incidence of RLN metastasis decreases steadily from level C1 to level C3. Retropharyngeal lymph node metastasis correlates well with involvement of the parapharyngeal space and metastases to Level II, III, IV, and/or V nodes but not with T stage.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Wireless Sensor Networks - Node Localization for Various Industry Problems

Fast, effective monitoring following airborne releases of toxic substances is critical to mitigate risks to threatened population areas. Wireless sensor nodes at fixed predetermined locations may monitor such airborne releases and provide early warnings to the public. A challenging algorithmic problem is determining the locations to place these sensor nodes while meeting several criteria: 1) provide complete coverage of the domain, and 2) create a topology with problem dependent node densities, while 3) minimizing the number of sensor nodes. This manuscript presents a novel approach to determining optimal sensor placement, Advancing Front mEsh generation with Constrained dElaunay Triangulation and Smoothing (AFECETS) that addresses these criteria. A unique aspect of AFECETS is the ability to determine wireless sensor node locations for areas of high interest (hospitals, schools, high population density areas) that require higher density of nodes for monitoring environmental conditions, a feature that is difficult to find in other research work. The AFECETS algorithm was tested on several arbitrary shaped domains. AFECETS simulation results show that the algorithm 1) provides significant reduction in the number of nodes, in some cases over 40%, compared to an advancing front mesh generation algorithm, 2) maintains and improves optimal spacing between nodes, and 3) produces simulation run times suitable for real-time applications.

42 ENGINEERING↗

Characterizing the performance of node-aware strategies for irregular point-to-point communication on heterogeneous architectures

Supercomputer architectures are trending toward higher computational throughput due to the inclusion of heterogeneous compute nodes. These multi-GPU nodes increase on-node computational efficiency, while also increasing the amount of data to be communicated and the number of potential data flow paths. In this work, we characterize the performance of irregular point-to-point communication with MPI on heterogeneous compute environments through performance modeling, demonstrating the limitations of standard communication strategies for both device-aware and staging-through-host communication techniques. Presented models suggest staging communicated data through host processes then using node-aware communication strategies for high inter-node message counts. Notably, the models also predict that node-aware communication utilizing all available CPU cores to communicate inter-node data leads to the most performant strategy when communicating with a high number of nodes. Furthermore, model validation is provided via a case study of irregular point-to-point communication patterns in distributed sparse matrix–vector products. Importantly, we include a discussion on the implications model predictions have on communication strategy design for emerging supercomputer architectures.

97 MATHEMATICS AND COMPUTING↗

Exploring the Effects of Node Topology, Connectivity, and Metal Identity on the Binding of Nerve Agents and Their Hydrolysis Products in Metal–Organic Frameworks

Recent studies have shown that metal–organic frameworks (MOFs) built from hexanuclear M(IV) oxide cluster nodes are effective catalysts for nerve agent hydrolysis, where the properties of the active sites on the nodes can strongly influence the reaction energetics. The connectivity and metal identity of these M6 nodes can be easily tuned, offering extensive opportunities for computational screening to predict promising new materials. Thus, we used density functional theory (DFT) to examine the effects of node topology, connectivity, and metal identity on the binding energies of multiple nerve agents and their corresponding hydrolysis products. By computing an optimization metric based on the relative binding strengths of key hydrolysis reaction species (water, agent, and bidentate-bound products), we predicted optimal M6 nodes for hydrolyzing specific nerve agent and simulant molecules, where our results are in qualitative agreement with observed experimental trends. This analysis highlighted the notion that no single metal or node topology is optimal for all possible organophosphates, suggesting that MOFs should be selected based on the agent of interest. Using the large amount of data generated from our DFT calculations, we then derived quantitative structure–activity relationship (QSAR) models to help explain the complex trends observed in the binding energies. Through linear regression, we identified the most important descriptors for describing the binding of nerve agents and their hydrolysis products to M6 nodes. These results suggested that both molecular and node properties, including both structural and chemical features, collectively contribute to the binding energetics. By performing a thorough statistical analysis, we showed that our QSAR models are capable of making quantitatively accurate binding energy predictions for nerve agents and their hydrolysis products in a wide variety of M(IV)-MOFs. In conclusion, the insights gained herein can be used to guide future experiments for the synthesis of MOFs with enhanced catalytic activity for organophosphate hydrolysis.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Tuning Catalytic Sites on Zr 6 O 8 Metal–Organic Framework Nodes via Ligand and Defect Chemistry Probed with tert -Butyl Alcohol Dehydration to Isobutylene

Metal–organic frameworks (MOFs) have drawn wide attention as candidate catalysts, but some essential questions about their nature and performance have barely been addressed. (1) How do OH groups on MOF nodes act as catalytic sites? (2) What are the relationships among these groups, node defects, and MOF stability, and how do reaction conditions influence them? (3) What are the interplays between catalytic properties and transport limitations? To address these questions, we report an experimental and theoretical investigation of the catalytic dehydration of tert -butyl alcohol (TBA) used to probe the activities of OH groups of Zr 6 O 8 nodes in the MOFs UiO-66 and MOF-808, which have different densities of vacancy sites and different pore sizes. The results show that (1) terminal node OH groups are formed as formate and/or acetate ligands present initially on the nodes react with TBA to form esters, (2) these OH groups act as catalytic sites for TBA dehydration to isobutylene, and (3) TBA also reacts to break node–linker bonds to form esters and thereby unzip the MOFs. The small pores of UiO-66 limit the access of TBA and the reaction with the formate/acetate ligands bound within the pores, whereas the larger pores of MOF-808 facilitate transport and favor reaction in the MOF interior. However, after removal of the formate and acetate ligands by reaction with methanol to form esters, interior active sites in UiO-66 become accessible for the reaction of TBA, with the activity depending on the density of defect sites with terminal OH groups. The number of vacancies on the nodes is important in determining a tradeoff between the catalytic activity of a MOF and its resistance to unzipping. Computations at the level of density functional theory show how the terminal OH groups on node vacancies act as Brønsted bases, facilitating TBA dehydration via a carbocation intermediate in an E1 mechanism; the calculations further illuminate the comparable chemistry of the unzipping.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗