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 1,171 records · Page 65

Concurrent hypercube system with improved message passing

A network of microprocessors, or nodes, are interconnected in an n-dimensional cube having bidirectional communication links along the edges of the n-dimensional cube. Each node's processor network includes an I/O subprocessor dedicated to controlling communication of message packets along a bidirectional communication link with each end thereof terminating at an I/O controlled transceiver. Transmit data lines are directly connected from a local FIFO through each node's communication link transceiver. Status and control signals from the neighboring nodes are delivered over supervisory lines to inform the local node that the neighbor node's FIFO is empty and the bidirectional link between the two nodes is idle for data communication. A clocking line between neighbors, clocks a message into an empty FIFO at a neighbor's node and vica versa. Either neighbor may acquire control over the bidirectional communication link at any time, and thus each node has circuitry for checking whether or not the communication link is busy or idle, and whether or not the receive FIFO is empty. Likewise, each node can empty its own FIFO and in turn deliver a status signal to a neighboring node indicating that the local FIFO is empty. The system includes features of automatic message rerouting, block message transfer and automatic parity checking and generation.

Peterson, John C.↗

Using LDPC Code Constraints to Aid Recovery of Symbol Timing

A method of utilizing information available in the constraints imposed by a low-density parity-check (LDPC) code has been proposed as a means of aiding the recovery of symbol timing in the reception of a binary-phase-shift-keying (BPSK) signal representing such a code in the presence of noise, timing error, and/or Doppler shift between the transmitter and the receiver. This method and the receiver architecture in which it would be implemented belong to a class of timing-recovery methods and corresponding receiver architectures characterized as pilotless in that they do not require transmission and reception of pilot signals. Acquisition and tracking of a signal of the type described above have traditionally been performed upstream of, and independently of, decoding and have typically involved utilization of a phase-locked loop (PLL). However, the LDPC decoding process, which is iterative, provides information that can be fed back to the timing-recovery receiver circuits to improve performance significantly over that attainable in the absence of such feedback. Prior methods of coupling LDPC decoding with timing recovery had focused on the use of output code words produced as the iterations progress. In contrast, in the present method, one exploits the information available from the metrics computed for the constraint nodes of an LDPC code during the decoding process. In addition, the method involves the use of a waveform model that captures, better than do the waveform models of the prior methods, distortions introduced by receiver timing errors and transmitter/ receiver motions. An LDPC code is commonly represented by use of a bipartite graph containing two sets of nodes. In the graph corresponding to an (n,k) code, the n variable nodes correspond to the code word symbols and the n-k constraint nodes represent the constraints that the code places on the variable nodes in order for them to form a valid code word. The decoding procedure involves iterative computation of values associated with these nodes. A constraint node represents a parity-check equation using a set of variable nodes as inputs. A valid decoded code word is obtained if all parity-check equations are satisfied. After each iteration, the metrics associated with each constraint node can be evaluated to determine the status of the associated parity check. Heretofore, normally, these metrics would be utilized only within the LDPC decoding process to assess whether or not variable nodes had converged to a codeword. In the present method, it is recognized that these metrics can be used to determine accuracy of the timing estimates used in acquiring the sampled data that constitute the input to the LDPC decoder. In fact, the number of constraints that are satisfied exhibits a peak near the optimal timing estimate. Coarse timing estimation (or first-stage estimation as described below) is found via a parametric search for this peak. The present method calls for a two-stage receiver architecture illustrated in the figure. The first stage would correct large time delays and frequency offsets; the second stage would track random walks and correct residual time and frequency offsets. In the first stage, constraint-node feedback from the LDPC decoder would be employed in a search algorithm in which the searches would be performed in successively narrower windows to find the correct time delay and/or frequency offset. The second stage would include a conventional first-order PLL with a decision-aided timing-error detector that would utilize, as its decision aid, decoded symbols from the LDPC decoder. The method has been tested by means of computational simulations in cases involving various timing and frequency errors. The results of the simulations ined in the ideal case of perfect timing in the receiver.

Jones, Christopher↗

Wireless Avionics Packet to Support Fault Tolerance for Flight Applications

In this protocol and packet format, data traffic is monitored by all network interfaces to determine the health of transmitter and subsystems. When failures are detected, the network inter face applies its recover y policies to provide continued service despite the presence of faults. The protocol, packet format, and inter face are independent of the data link technology used. The current demonstration system supports both commercial off-the-shelf wireless connections and wired Ethernet connections. Other technologies such as 1553 or serial data links can be used for the network backbone. The Wireless Avionics packet is divided into three parts: a header, a data payload, and a checksum. The header has the following components: magic number, version, quality of service, time to live, sending transceiver, function code, payload length, source Application Data Interface (ADI) address, destination ADI address, sending node address, target node address, and a sequence number. The magic number is used to identify WAV packets, and allows the packet format to be updated in the future. The quality of service field allows routing decisions to be made based on this value and can be used to route critical management data over a dedicated channel. The time to live value is used to discard misrouted packets while the source transceiver is updated at each hop. This information is used to monitor the health of each transceiver in the network. To identify the packet type, the function code is used. Besides having a regular data packet, the system supports diagnostic packets for fault detection and isolation. The payload length specifies the number of data bytes in the payload, and this supports variable-length packets in the network. The source ADI is the address of the originating interface. This can be used by the destination application to identify the originating source of the packet where the address consists of a subnet, subsystem class within the subnet, a subsystem unit, and the local ADI number. The destination ADI is used to route the packet to its ultimate destination. At each hop, the sending interface uses the destination address to determine the next node for the data. The sending node is the node address of the interface that is broadcasting the packet. This field is used to determine the health of the subsystem that is sending the packet. In the case of a packet that traverses several intermediate nodes, it may be the node address of the intermediate node. The target node is the node address of the next hop for the packet. It may be an intermediate node, or the final destination for the packet. The sequence number is used to identify duplicate packets. Because each interface has multiple transceivers, the same packet will appear at both receivers. The sequence number allows the interface to correlate the reception and forward a single, unique packet for additional processing. The subnet field allows data traffic to be partitioned into segregated local networks to support large networks while keeping each subnet at a manageable size. This also keeps the routing table small enough so routing can be done by a simple table lookup in an FPGA device. The subsystem class identifies members of a set of redundant subsystems, and, in a hot standby configuration, all members of the subsystem class will receive the data packets. Only the active subsystem will generate data traffic. Specific units in a class of redundant units can be identified and, if the hot standby configuration is not used, packets will be directed to a specific subsystem unit.

Block, Gary L.↗

Use of Generalized Fluid System Simulation Program (GFSSP) for Teaching and Performing Senior Design Projects at the Educational Institutions

This paper describes the experience of the authors in using the Generalized Fluid System Simulation Program (GFSSP) in teaching Design of Thermal Systems class at University of Alabama in Huntsville. GFSSP is a finite volume based thermo-fluid system network analysis code, developed at NASA/Marshall Space Flight Center, and is extensively used in NASA, Department of Defense, and aerospace industries for propulsion system design, analysis, and performance evaluation. The educational version of GFSSP is freely available to all US higher education institutions. The main purpose of the paper is to illustrate the utilization of this user-friendly code for the thermal systems design and fluid engineering courses and to encourage the instructors to utilize the code for the class assignments as well as senior design projects. The need for a generalized computer program for thermofluid analysis in a flow network has been felt for a long time in aerospace industries. Designers of thermofluid systems often need to know pressures, temperatures, flow rates, concentrations, and heat transfer rates at different parts of a flow circuit for steady state or transient conditions. Such applications occur in propulsion systems for tank pressurization, internal flow analysis of rocket engine turbopumps, chilldown of cryogenic tanks and transfer lines, and many other applications of gas-liquid systems involving fluid transients and conjugate heat and mass transfer. Computer resource requirements to perform time-dependent, three-dimensional Navier-Stokes computational fluid dynamic (CFD) analysis of such systems are prohibitive and therefore are not practical. Available commercial codes are generally suitable for steady state, single-phase incompressible flow. Because of the proprietary nature of such codes, it is not possible to extend their capability to satisfy the above-mentioned needs. Therefore, the Generalized Fluid System Simulation Program (GFSSP1) has been developed at NASA Marshall Space Flight Center (MSFC) as a general fluid flow system solver capable of handling phase changes, compressibility, mixture thermodynamics and transient operations. It also includes the capability to model external body forces such as gravity and centrifugal effects in a complex flow network. The objectives of GFSSP development are: a) to develop a robust and efficient numerical algorithm to solve a system of equations describing a flow network containing phase changes, mixing, and rotation; and b) to implement the algorithm in a structured, easy-to-use computer program. The analysis of thermofluid dynamics in a complex network requires resolution of the system into fluid nodes and branches, and solid nodes and conductors as shown in Figure 1. Figure 1 shows a schematic and GFSSP flow circuit of a counter-flow heat exchanger. Hot nitrogen gas is flowing through a pipe, colder nitrogen is flowing counter to the hot stream in the annulus pipe and heat transfer occurs through metal tubes. The problem considered is to calculate flowrates and temperature distributions in both streams. GFSSP has a unique data structure, as shown in Figure 2, that allows constructing all possible arrangements of a flow network with no limit on the number of elements. The elements of a flow network are boundary nodes where pressure and temperature are specified, internal nodes where pressure and temperature are calculated, and branches where flowrates are calculated. For conjugate heat transfer problems, there are three additional elements: solid node, ambient node, and conductor. The solid and fluid nodes are connected with solid-fluid conductors. GFSSP solves the conservation equations of mass and energy, and equation of state in internal nodes to calculate pressure, temperature and resident mass. The momentum conservation equation is solved in branches to calculate flowrate. It also solves for energy conservation equations to calculate temperatures of solid nodes. The equations are coupled and nonlinear; therefore, they are solved by an iterative numerical scheme. GFSSP employs a unique numerical scheme known as simultaneous adjustment with successive substitution (SASS), which is a combination of Newton-Raphson and successive substitution methods. The mass and momentum conservation equations and the equation of state are solved by the Newton-Raphson method while the conservation of energy and species are solved by the successive substitution method. GFSSP is linked with two thermodynamic property programs, GASP2 and WASP3 and GASPAK4, that provide thermodynamic and thermophysical properties of selected fluids. Both programs cover a range of pressure and temperature that allows fluid properties to be evaluated for liquid, liquid-vapor (saturation), and vapor region. GASP and WASP provide properties of 12 fluids. GASPAK includes a library of 36 fluids. GFSSP has three major parts. The first part is the graphical user interface (GUI), visual thermofluid analyzer of systems and components (VTASC). VTASC allows users to create a flow circuit by a 'point and click' paradigm. It creates the GFSSP input file after the completion of the model building process. GFSSP's GUI provides the users a platform to build and run their models. It also allows post-processing of results. The network flow circuit is first built using three basic elements: boundary node, internal node, and branch.

Majumdar, A. K.↗

Cross-ontological analytics for alignment of different classification schemes

Quantification of the similarity between nodes in multiple electronic classification schemes is provided by automatically identifying relationships and similarities between nodes within and across the electronic classification schemes. Quantifying the similarity between a first node in a first electronic classification scheme and a second node in a second electronic classification scheme involves finding a third node in the first electronic classification scheme, wherein a first product value of an inter-scheme similarity value between the second and third nodes and an intra-scheme similarity value between the first and third nodes is a maximum. A fourth node in the second electronic classification scheme can be found, wherein a second product value of an inter-scheme similarity value between the first and fourth nodes and an intra-scheme similarity value between the second and fourth nodes is a maximum. The maximum between the first and second product values represents a measure of similarity between the first and second nodes.

Posse, Christian↗

Locating hardware faults in a data communications network of a parallel computer

Hardware faults location in a data communications network of a parallel computer. Such a parallel computer includes a plurality of compute nodes and a data communications network that couples the compute nodes for data communications and organizes the compute node as a tree. Locating hardware faults includes identifying a next compute node as a parent node and a root of a parent test tree, identifying for each child compute node of the parent node a child test tree having the child compute node as root, running a same test suite on the parent test tree and each child test tree, and identifying the parent compute node as having a defective link connected from the parent compute node to a child compute node if the test suite fails on the parent test tree and succeeds on all the child test trees.

Archer, Charles J↗

Message passing with a limited number of DMA byte counters

A method for passing messages in a parallel computer system constructed as a plurality of compute nodes interconnected as a network where each compute node includes a DMA engine but includes only a limited number of byte counters for tracking a number of bytes that are sent or received by the DMA engine, where the byte counters may be used in shared counter or exclusive counter modes of operation. The method includes using rendezvous protocol, a source compute node deterministically sending a request to send (RTS) message with a single RTS descriptor using an exclusive injection counter to track both the RTS message and message data to be sent in association with the RTS message, to a destination compute node such that the RTS descriptor indicates to the destination compute node that the message data will be adaptively routed to the destination node. Using one DMA FIFO at the source compute node, the RTS descriptors are maintained for rendezvous messages destined for the destination compute node to ensure proper message data ordering thereat. Using a reception counter at a DMA engine, the destination compute node tracks reception of the RTS and associated message data and sends a clear to send (CTS) message to the source node in a rendezvous protocol form of a remote get to accept the RTS message and message data and processing the remote get (CTS) by the source compute node DMA engine to provide the message data to be sent.

97 MATHEMATICS AND COMPUTING↗

Performing a scatterv operation on a hierarchical tree network optimized for collective operations

Performing a scatterv operation on a hierarchical tree network optimized for collective operations including receiving, by the scatterv module installed on the node, from a nearest neighbor parent above the node a chunk of data having at least a portion of data for the node; maintaining, by the scatterv module installed on the node, the portion of the data for the node; determining, by the scatterv module installed on the node, whether any portions of the data are for a particular nearest neighbor child below the node or one or more other nodes below the particular nearest neighbor child; and sending, by the scatterv module installed on the node, those portions of data to the nearest neighbor child if any portions of the data are for a particular nearest neighbor child below the node or one or more other nodes below the particular nearest neighbor child.

97 MATHEMATICS AND COMPUTING↗

Determining collective barrier operation skew in a parallel computer

Determining collective barrier operation skew in a parallel computer that includes a number of compute nodes organized into an operational group includes: for each of the nodes until each node has been selected as a delayed node: selecting one of the nodes as a delayed node; entering, by each node other than the delayed node, a collective barrier operation; entering, after a delay by the delayed node, the collective barrier operation; receiving an exit signal from a root of the collective barrier operation; and measuring, for the delayed node, a barrier completion time. The barrier operation skew is calculated by: identifying, from the compute nodes' barrier completion times, a maximum barrier completion time and a minimum barrier completion time and calculating the barrier operation skew as the difference of the maximum and the minimum barrier completion time.

97 MATHEMATICS AND COMPUTING↗

Determining collective barrier operation skew in a parallel computer

Determining collective barrier operation skew in a parallel computer that includes a number of compute nodes organized into an operational group includes: for each of the nodes until each node has been selected as a delayed node: selecting one of the nodes as a delayed node; entering, by each node other than the delayed node, a collective barrier operation; entering, after a delay by the delayed node, the collective barrier operation; receiving an exit signal from a root of the collective barrier operation; and measuring, for the delayed node, a barrier completion time. The barrier operation skew is calculated by: identifying, from the compute nodes' barrier completion times, a maximum barrier completion time and a minimum barrier completion time and calculating the barrier operation skew as the difference of the maximum and the minimum barrier completion time.

97 MATHEMATICS AND COMPUTING↗

Virtual sensor supervised learning for cyber-attack neutralization

An industrial asset may have monitoring nodes that generate current monitoring node values. A dynamic, resilient estimator may split a temporal monitoring node space into normal and one or more abnormal subspaces associated with different kinds of attack vectors. According to some embodiments, a neutralization model is constructed and trained for each attack vector using supervised learning and the associated abnormal subspace. In other embodiments, a single model is created using out-of-range values for abnormal monitoring nodes. Responsive to an indication of a particular abnormal monitoring node or nodes, the system may automatically invoke the appropriate neutralization model to determine estimated values of the particular abnormal monitoring node or nodes (e.g., by selecting the correct model or using out-of-range values). The series of current monitoring node values from the abnormal monitoring node or nodes may then be replaced with the estimated values.

97 MATHEMATICS AND COMPUTING↗

Application of SPH Factors to PHWR Lattice Homogenization

Pressurized Heavy-Water Reactors (PHWRs) are heavy-water moderated and cooled. They consist of a horizontal, cylindrical, non-pressurized calandria vessel which contains the heavy-water moderator and is penetrated axially by fuel channels. Fuel channels consist of two concentric tubes separated by a gas gap: an inner tube called the pressure tube, and an outer tube called the calandria tube. The pressure tubes hold the fuel bundles, which are cooled by the flow of coolant at high temperature and pressure. The coolant flows in opposite directions in adjacent channels. The gap between the pressure and calandria tubes ensures that the temperature of the moderator remains relatively low, below 80 deg. C. For a CANDU 6 reactor, there are 380 fuel channels, each holding 12 37-element fuel bundles, approximately 10-cm in diameter and 50-cm long each. The fuel pins are arranged in three concentric rings (consisting of 6, 12 and 18 pins respectively), plus a central pin. The distance between channels (lattice pitch) is approximately 28.6 cm. Production core-level neutronics calculations are usually performed in a Cartesian geometry using few group diffusion and a simplified core model, whereby neutronics properties are homogenized over large regions called nodes. For Light Water reactors (LWRs), the two-dimensional axial (x-y) projection of a node corresponds to one fuel assembly. For PHWRs, a node usually consists of one fuel bundle and its associated moderator. For LWRs, advanced core-level calculations based on advanced node-level homogenization methods, such as Generalized Equivalence Theory (GET) or Super-homogenisation (SPH), improve the accuracy of full-core calculations compared to - standard homogenization. For rectangular fuel-pin arrangements, SPH can be used to perform pin-cell level homogenization which allows subsequent core-level diffusion calculations to be performed using fine Cartesian meshes. For PHWRs, the distribution of fuel pins in concentric rings makes the use of Cartesian mesh refinement impractical. However, SPH can still be applied, albeit using a coarser node subdivision, by dividing the heterogeneous node into 3x3 sub-regions in such a way that the central sub-region includes the entire fuel channel. This work investigates the use of SPH homogenization using a 3x3 subdivision of the PHWR node. Preliminary results show that the use of SPH factors does not yield more accurate results than standard homogenization when applied to PHWR nodes using a 3x3 subdivision. The explanation appears to lie in the fact that SPH factors are dependent on node-boundary leakage. Future investigations to confirm the leakage-dependence of SPH factors are recommended. Accuracy improvements may also be achievable by using smaller SPH regions at the periphery of the PHWR node, in an attempt to reduce the SPH factors' dependence on node-boundary leakage. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Determining Which Patients Require Irradiation of the Supraclavicular Nodal Area After Surgery for N1 Breast Cancer

Purpose: We designed this study to determine which patients have a high risk of supraclavicular node recurrence in N1 breast cancer previously treated with surgery but not having received supraclavicular radiation therapy (SCRT) and to identify which patients needed SCRT. Methods and Materials: We performed a retrospective review of 448 pathologic N1 breast cancer patients treated with mastectomy or breast-conserving treatment, but without SCRT, between 1994 and 2003. Mastectomy was performed in 302 patients (67.4%). The median number of axillary nodes dissected was 17 (range, 5-53). Systemic chemotherapy was administered in 443 patients (98.9%), and 144 patients received radiation after breast-conserving surgery. The median follow-up was 88 months (range, 15-170 months). Results: At follow-up, the treatment failed in 101 patients (22.5%), and 39 patients (8.7%) had supraclavicular node recurrence. Prognostic factors in supraclavicular node recurrence included lymphovascular invasion (p < 0.0001), extracapsular extension (p < 0.0001), the number of involved axillary nodes (p = 0.0003), and the level of involved axillary nodes (p = 0.012) in univariate and multivariate analyses. The total number of prognostic factors correlated well with supraclavicular node recurrence. In the analysis of 5-year supraclavicular node recurrence-free survival, patients with two or more factors showed a significantly higher recurrence rate than did patients with fewer than two factors (96.8% and 72.9%, respectively; p < 0.0001). Conclusions: The prognostic factors associated with supraclavicular node recurrence were lymphovascular invasion, extracapsular extension, and the number and level of involved axillary nodes. Patients with two or more prognostic factors might benefit from SCRT.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Bladder Cancer Patterns of Pelvic Failure: Implications for Adjuvant Radiation Therapy

Purpose: Local-regional failures (LFs) after cystectomy with or without chemotherapy are common in locally advanced disease. Adjuvant radiation therapy (RT) could reduce LFs, but toxicity has discouraged its use. Modern RT techniques with improved normal tissue sparing have rekindled interest but require knowledge of pelvic failure patterns to design treatment volumes. Methods and Materials: Five-year LF rates after radical cystectomy plus pelvic node dissection with or without chemotherapy were determined for 8 pelvic sites among 442 urothelial bladder carcinoma patients. The impact of pathologic stage, margin status, nodal involvement, and extent of node dissection on failure patterns was assessed using competing risk analysis. We calculated the percentage of patients whose sites of LF would have been completely encompassed within various hypothetical clinical target volumes (CTVs) for postoperative radiation. Results: Compared with stage {<=}pT2, stage {>=}pT3 patients had higher 5-year LF rates in virtually all pelvic sites. Among stage {>=}pT3 patients, margin status significantly altered the failure pattern whereas extent of node dissection and nodal positivity did not. In stage {>=}pT3 patients with negative margins, failure occurred predominantly in the iliac/obturator nodes and uncommonly in the cystectomy bed and/or presacral nodes. Of these patients in whom failure subsequently occurred, 76% would have had all LF sites encompassed within CTVs covering only the iliac/obturator nodes. In stage {>=}pT3 with positive margins, cystectomy bed and/or presacral nodal failures increased significantly. Only 57% of such patients had all LF sites within CTVs limited to the iliac/obturator nodes, but including the cystectomy bed and presacral nodes in the CTV when margins were positive increased the percentage of LFs encompassed to 91%. Conclusions: Patterns of failure within the pelvis are summarized to facilitate design of adjuvant RT protocols. These data suggest that RT should target at least the iliac/obturator nodes in stage {>=}pT3 with negative margins; coverage of the presacral nodes and cystectomy bed may be necessary for stage {>=}pT3 with positive margins.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Inorganic “Conductive Glass” Approach to Rendering Mesoporous Metal–Organic Frameworks Electronically Conductive and Chemically Responsive

A representative mesoporous metal–organic-framework (MOF) material, NU-1000, has been rendered electronically conductive via a robust inorganic approach that permits retention of MOF crystallinity and porosity. The approach is based on condensed-phase grafting of molecular tin species onto the MOF nodes via irreversible reaction with hydroxyl and aqua ligands presented at the node surface, a self-limiting process termed solvothermal installation (of metal ions) in MOFs (SIM, a solution-phase analog of atomic layer deposition in MOFs). Treatment of the modified MOF with aerated steam at 120 °C converts the grafted tin molecules to tetratin(IV)oxy clusters, with the clusters being sited between insulating pairs of zirconia-like nodes (the zirconium component being key to endowing the parent material with requisite chemical and thermal stability). By introducing new O–H presenting ligands on the modified-MOF node, the high-temperature steam step additionally serves to reset the material to reactive form, thus enabling a second self-limiting tin-grafting step to be run (and after further steam treatment, enabling a third). Difference-envelop-density (DED) analyses of synchrotron-derived X-ray scattering data, with and without installed tin species, show that the clusters formed after one cycle are spatially isolated, but that repetitive SIM cycling adds metal and oxygen ions in a way that enshrouds nodes, links clusters, and yields continuous one-dimensional strands of oxy-tin(IV), oriented exclusively along the c axis of the MOF. Two-probe conductivity measurements show that the parent MOF and the version containing isolated oxy-tin(IV) clusters are electrically insulating, but that the versions featuring continuous strands show an electrical conductivity of 1.8 × 10–7 S/cm after three Sn-SIM cycles. When combined with interdigitated microelectrodes, the solvent-free and conductive-glass-modified material (three Sn-SIM cycles) displays a substantial and persistent increase in electrical conductivity during exposure to 5% H2, indicating a role for dissociated H2 as an electronic dopant. The increase can be repetitively reversed by alternating H2 with air, illustrating the ability of the conductive MOF to function as a resistive sensor for H2 and suggesting further potential applications that may capitalize on the combination of high volumetric surface area, high mesoporosity, high chemical and thermal stability, and significant electrical conductivity.

bio-inspired↗

A physics-constrained neural ordinary differential equations approach for robust learning of stiff chemical kinetics

The high computational cost associated with solving for detailed chemistry poses a significant challenge for predictive computational fluid dynamics (CFD) simulations of turbulent reacting flows. While deep learning techniques have been explored to develop faster surrogate models, they often fail to integrate reliably with CFD solvers. This instability arises because traditional deep learning approaches optimize for training error without ensuring compatibility with ordinary differential equation (ODE) solvers, resulting in accumulation of errors over time. Recently, neuralODE (NODE) based approaches have been shown to be a promising technique to emulate and accelerate detailed chemistry computations. Here, in the present work, we extend this NODE framework for stiff chemical kinetics by incorporating mass conservation constraints directly into the loss function during training. This ensures that the total mass as well as the individual elemental species masses are conserved in an a-posteriori manner. Proof-of-concept studies are performed with the novel physics-constrained NODE (PC-NODE) approach for homogeneous autoignition of hydrogen-air mixture over a range of composition and thermodynamic conditions. It is demonstrated that the PC-NODE framework not only improves the physical consistency of the resulting data-driven model with respect to mass conservation criteria, but also improves training efficiency. PC-NODE is shown to achieve 2–100× speedup relative to the hydrogen-air detailed chemical mechanism depending on the type of the ODE solver (implicit or explicit) used during autoregressive inference tests. Lastly, a-posteriori studies are performed wherein the trained PC-NODE model is coupled with a CFD solver. It is shown that higher accuracy is achieved with PC-NODE relative to the purely data-driven NODE approach. Moreover, PC-NODE also exhibits robustness and generalizability to unseen initial conditions from within (interpolative capability) as well as outside (extrapolative capability) the training regime.

computational combustion↗

THEORY OF SOLAR MERIDIONAL CIRCULATION AT HIGH LATITUDES

We build a hydrodynamic model for computing and understanding the Sun's large-scale high-latitude flows, including Coriolis forces, turbulent diffusion of momentum, and gyroscopic pumping. Side boundaries of the spherical 'polar cap', our computational domain, are located at latitudes {>=} 60 Degree-Sign . Implementing observed low-latitude flows as side boundary conditions, we solve the flow equations for a Cartesian analog of the polar cap. The key parameter that determines whether there are nodes in the high-latitude meridional flow is {epsilon} = 2{Omega}n{pi}H{sup 2}/{nu}, where {Omega} is the interior rotation rate, n is the radial wavenumber of the meridional flow, H is the depth of the convection zone, and {nu} is the turbulent viscosity. The smaller the {epsilon} (larger turbulent viscosity), the fewer the number of nodes in high latitudes. For all latitudes within the polar cap, we find three nodes for {nu} = 10{sup 12} cm{sup 2} s{sup -1}, two for 10{sup 13}, and one or none for 10{sup 15} or higher. For {nu} near 10{sup 14} our model exhibits 'node merging': as the meridional flow speed is increased, two nodes cancel each other, leaving no nodes. On the other hand, for fixed flow speed at the boundary, as {nu} is increased the poleward-most node migrates to the pole and disappears, ultimately for high enough {nu} leaving no nodes. These results suggest that primary poleward surface meridional flow can extend from 60 Degree-Sign to the pole either by node merging or by node migration and disappearance.

79 ASTRONOMY AND ASTROPHYSICS↗

Active Betweenness Cardinality: Algorithms and Applications

Centrality rankings such as degree, closeness, betweenness, Katz, PageRank, etc. are commonly used to identify critical nodes in a graph. These methods are based on two assumptions that restrict their wider applicability. First, they assume the exact topology of the network is available. Secondly, they do not take into account the activity over the network and only rely on its topology. However, in many applications, the network is autonomous, vast, and distributed, and it is hard to collect the exact topology. At the same time, the underlying pairwise activity between node pairs is not uniform and node criticality strongly depends on the activity on the underlying network. In this paper, we propose active betweenness cardinality, as a new measure, where the node criticalities are based on not the static structure, but the activity of the network. We show how this metric can be computed efficiently by using only local information for a given node and how we can find the most critical nodes starting from only a few nodes. We also show how this metric can be used to monitor a network and identify failed nodes. We present experimental results to show effectiveness by demonstrating how the failed nodes can be identified by measuring active betweenness cardinality of a few nodes in the system.

97 MATHEMATICS AND COMPUTING↗