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,153 records · Page 64

Using virtual sensors to accommodate industrial asset control systems during cyber attacks

In some embodiments, an industrial asset may be associated with a plurality of monitoring nodes, each monitoring node generating a series of monitoring node values over time that represent operation of the industrial asset. A threat detection computer may determine that an attacked monitoring node is currently being attacked. Responsive to this determination, a virtual sensor coupled to the plurality of monitoring nodes may estimate a series of virtual node values for the attacked monitoring node(s) based on information received from monitoring nodes that are not currently being attacked. The virtual sensor may then replace the series of monitoring node values from the attacked monitoring node(s) with the virtual node values. Note that in some embodiments, virtual node values may be estimated for a particular node even before it is determined that the node is currently being attacked.

Mestha, Lalit Keshav↗

Clinical Response of Pelvic and Para-aortic Lymphadenopathy to a Radiation Boost in the Definitive Management of Locally Advanced Cervical Cancer

Purpose: Optimal treatment with radiation for metastatic lymphadenopathy in locally advanced cervical cancer remains controversial. We investigated the clinical dose response threshold for pelvic and para-aortic lymph node boost using radiographic imaging and clinical outcomes. Methods and Materials: Between 2007 and 2011, 68 patients were treated for locally advanced cervical cancer; 40 patients had clinically involved pelvic and/or para-aortic lymph nodes. Computed tomography (CT) or 18F-labeled fluorodeoxyglucose-positron emission tomography scans obtained pre- and postchemoradiation for 18 patients were reviewed to assess therapeutic radiographic response of individual lymph nodes. External beam boost doses to involved nodes were compared to treatment response, assessed by change in size of lymph nodes by short axis and change in standard uptake value (SUV). Patterns of failure, time to recurrence, overall survival (OS), and disease-free survival (DFS) were determined. Results: Sixty-four lymph nodes suspicious for metastatic involvement were identified. Radiation boost doses ranged from 0 to 15 Gy, with a mean total dose of 52.3 Gy. Pelvic lymph nodes were treated with a slightly higher dose than para-aortic lymph nodes: mean 55.3 Gy versus 51.7 Gy, respectively. There was no correlation between dose delivered and change in size of lymph nodes along the short axis. All lymph nodes underwent a decrease in SUV with a complete resolution of abnormal uptake observed in 68%. Decrease in SUV was significantly greater for lymph nodes treated with ≥54 Gy compared to those treated with <54 Gy (P=.006). Median follow-up was 18.7 months. At 2 years, OS and DFS for the entire cohort were 78% and 50%, respectively. Locoregional control at 2 years was 84%. Conclusions: A biologic response, as measured by the change in SUV for metastatic lymph nodes, was observed at a dose threshold of 54 Gy. We recommend that involved lymph nodes be treated to this minimum dose.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

SU-E-T-409: Intensity Modulated Robotic Radiotherapy

Purpose: As compared with the IRIS-based models, the MLC-based CyberKnife system allows more efficient treatment delivery due to its improved coverage of large lesions and intensity modulation. The treatment delivery efficiency is mainly determined by the number of selected nodes. This study aimed to demonstrate that relatively small sets of optimally selected nodes could produce high-quality plans. Methods: The full body path of the CyberKnife system consists of 110 nodes, from which we selected various sets for 4 prostate cancer cases using our in-house beamselection software. With the selected nodes we generated IMRT plans using our in-house beamlet-based inverse-planning optimization program. We also produced IMRT plans using the MultiPlan treatment planning system (version 5.0) for the same cases. Furthermore, the nodes selected by MultiPlan were used to produce plans with our own optimization software so that we could compare the quality of the selected sets of nodes. Results: Our beam-selection program selected one node-set for each case, with the number of nodes ranging from 23 to 34. The IMRT plans based on the selected nodes and our in-house optimization program showed adequate target coverage, with favorable critical structure sparing for the cases investigated. Compared with the plans using the nodes selected by MultiPlan, the plans generated with our selected beams provided superior rectum/bladder sparing for 75% of the cases. The plans produced by MultiPlan with various numbers of nodes also suggested that the plan quality was not compromised significantly when the number of nodes was reduced. Conclusion: Our preliminary results showed that with beamletbased planning optimization, one could produce high-quality plans with an optimal set of nodes for MLC-based robotic radiotherapy. Furthermore, our beam-selection strategy could help further improve critical structure sparing.

60 APPLIED LIFE SCIENCES↗

Masked Proportional Routing

Distributed approach for determining a path connecting adjacent network nodes, for probabilistically or deterministically transporting an entity, with entity characteristic mu from a source node to a destination node. Each node i is directly connected to an arbitrary number J(mu) of nodes, labeled or numbered j=jl, j2, .... jJ(mu). In a deterministic version, a J(mu)-component baseline proportion vector p(i;mu) is associated with node i. A J(mu)-component applied proportion vector p*(i;mu) is determined from p(i;mu) to preclude an entity visiting a node more than once. Third and fourth J(mu)-component vectors, with components iteratively determined by Target(i;n(mu);mu),=alpha(mu).Target(i;n(mu)-1;mu)j+beta(mu).p* (i;mu)j and Actual(i;n(mu);+a(mu)j. Actual(i;n(mu)-l;mu)j+beta(mu).Sent(i;j'(mu);n(mu)-1;mu)j, are computed, where n(mu) is an entity sequence index and alpha(mu) and beta(mu) are selected numbers. In one embodiment, at each node i, the node j=j'(mu) with the largest vector component difference, Target(i;n(mu);mu)j'- Actual (i;n(mu);mu)j'. is chosen for the next link for entity transport, except in special gap circumstances, where the same link is optionally used for transporting consecutively arriving entities. The network nodes may be computer-controlled routers that switch collections of packets, frames, cells or other information units. Alternatively, the nodes may be waypoints for movement of physical items in a network or for transformation of a physical item. The nodes may be states of an entity undergoing state transitions, where allowed transitions are specified by the network and/or the destination node.

David H Wolpert↗

EXTENSIBLE DATABASE FRAMEWORK FOR MANAGEMENT OF UNSTRUCTURED AND SEMI-STRUCTURED DOCUMENTS

Method and system for querying a collection of Unstructured or semi-structured documents to identify presence of, and provide context and/or content for, keywords and/or keyphrases. The documents are analyzed and assigned a node structure, including an ordered sequence of mutually exclusive node segments or strings. Each node has an associated set of at least four, five or six attributes with node information and can represent a format marker or text, with the last node in any node segment usually being a text node. A keyword (or keyphrase) is specified. and the last node in each node segment is searched for a match with the keyword. When a match is found at a query node, or at a node determined with reference to a query node, the system displays the context andor the content of the query node.

Gawdiak, Yuri O.↗

Channel hopping method of interference avoidance for a wireless communication network and wireless communication system employing the same

A wireless communication system includes a wireless master node having a plurality of channels, and a number of wireless slave nodes having a plurality of the channels. The master node and the slave nodes are structured to wirelessly communicate over a particular channel. The master node and the slave nodes are structured to decide to hop to a different channel. The master node and the slave nodes are structured to select: (a) the different channel, in order to be as far away as possible from a number of the channels, which are known to cause interference to wireless communications between the master node and the slave nodes, or (b) the different channel, in order to be as close as possible to one of the channels of a different master node, which is compatible with the former master node, but without the different channel being employed by the different master node.

42 ENGINEERING↗

Managing cluster-level performance variability without a centralized controller

Systems, apparatuses, and methods for managing cluster-level performance variability without a centralized controller are described. Each node of a multi-node cluster tracks a maximum and minimum progress across the plurality of nodes for a workload executed by the cluster. Each node also tracks its local progress on its current task. Each node also utilizes a comparison of the local progress to reported maximum and minimum progress across the cluster to identify a critical, or slow, node and whether to increase or reduce an amount of power allocated to the node. The nodes append information about the maximum and minimum progress to messages sent to other nodes to report their knowledge of maximum and minimum progress with other nodes. A node updates its local information if the node receives a message from another node with more up-to-date information about the state of progress across the cluster.

Piga, Leonardo↗

Role of a Modulator in the Synthesis of Phase-Pure NU-1000

NU-1000 is a robust, mesoporous metal–organic framework (MOF) with hexazirconium nodes ([Zr 6 O 16 H 16 ] 8+ , referred to as oxo–Zr 6 nodes) that can be synthesized by combining a solution of ZrOCl 2 ·8H 2 O and a benzoic acid modulator in N,N-dimethylformamide with a solution of linker (1,3,6,8-tetrakis(p-benzoic acid)pyrene, referred to as H 4 TBAPy) and by aging at an elevated temperature. Typically, the resulting crystals are primarily composed of NU-1000 domains that crystallize with a more dense phase that shares structural similarity with NU-901, which is an MOF composed of the same linker molecules and nodes. Density differences between the two polymorphs arise from the differences in the node orientation: in NU-1000, the oxo–Zr 6 nodes rotate 120° from node to node, whereas in NU-901, all nodes are aligned in parallel. Considering this structural difference leads to the hypothesis that changing the modulator from benzoic acid to a larger and more rigid biphenyl-4-carboxylic acid might lead to a stronger steric interaction between the modulator coordinating on the oxo–Zr6 node and misaligned nodes or linkers in the large pore and inhibit the growth of the more dense NU-901-like material, resulting in phase-pure NU-1000. Side-by-side reactions comparing the products of synthesis using benzoic acid or biphenyl-4-carboxylic acid as a modulator produce structurally heterogeneous crystals and phase-pure NU-1000 crystals. It can be concluded that the larger and more rigid biphenyl-4-carboxylate inhibits the incorporation of nodes with an alignment parallel to the neighboring nodes already residing in the crystal.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

System for solving diagnosis and hitting set problems

The diagnosis problem arises when a system's actual behavior contradicts the expected behavior, thereby exhibiting symptoms (a collection of conflict sets). System diagnosis is then the task of identifying faulty components that are responsible for anomalous behavior. To solve the diagnosis problem, the present invention describes a method for finding the minimal set of faulty components (minimal diagnosis set) that explain the conflict sets. The method includes acts of creating a matrix of the collection of conflict sets, and then creating nodes from the matrix such that each node is a node in a search tree. A determination is made as to whether each node is a leaf node or has any children nodes. If any given node has children nodes, then the node is split until all nodes are leaf nodes. Information gathered from the leaf nodes is used to determine the minimal diagnosis set.

Fijany, Amir↗

TPSAS-NF1676L-12321-DND

The operation of some networks, such as air transportation networks, can be complicated by congestion through a small subset of nodes. The congestion may be influenced by the connectivity of the network, or by the presence of constraints restricting the flow through particular nodes. This work investigates the effects of both connectivity and node flow constraints on the operation of a network. We develop the Minimax Node Load Problem (MNLP), a multicommodity flow model which minimizes the worst-case flow through any node in a given input network. The optimal solution to this problem provides us with the minimax node load, which we propose as a measure of network congestion. Keeping the number of nodes fixed, we first increase connectivity in a series of networks, and observe that topologies with more distributed connections result in a reduction in the minimax node load. However, when connectivity is increased further, the reductions diminish and are accompanied by solutions with undesirable qualities such as longer commodity paths. We then perform a second set of experiments over the same network, constraining flow through different subsets of nodes at different magnitudes of flow restriction, finding that (1) more constrained nodes lead to the largest increases in minimax node load and (2) constraints on the most connected nodes have the greatest effect on both congestion and commodity path length.

Douglas W Lee↗

TPSAS-NF1676L-12264-DND

The operation of some networks, such as air transportation networks, can be complicated by congestion through a small subset of nodes. The congestion may be influenced by the connectivity of the network, or by the presence of constraints restricting the flow through particular nodes. This work investigates the effects of both connectivity and node flow constraints on the operation of a network. We develop the Minimax Node Load Problem (MNLP), a multicommodity flow model which minimizes the worst-case flow through any node in a given input network. The optimal solution to this problem provides us with the minimax node load, which we propose as a measure of network congestion. Keeping the number of nodes fixed, we first increase connectivity in a series of networks, and observe that topologies with more distributed connections result in a reduction in the minimax node load. However, when connectivity is increased further, the reductions diminish and are accompanied by solutions with undesirable qualities such as longer commodity paths. We then perform a second set of experiments over the same network, constraining flow through different subsets of nodes at different magnitudes of flow restriction, finding that (1) more constrained nodes lead to the largest increases in minimax node load and (2) constraints on the most connected nodes have the greatest effect on both congestion and commodity path length.

Douglas Lee↗

Performing process migration with allreduce operations

Compute nodes perform allreduce operations that swap processes at nodes. A first allreduce operation generates a first result and uses a first process from a first compute node, a second process from a second compute node, and zeros from other compute nodes. The first compute node replaces the first process with the first result. A second allreduce operation generates a second result and uses the first result from the first compute node, the second process from the second compute node, and zeros from others. The second compute node replaces the second process with the second result, which is the first process. A third allreduce operation generates a third result and uses the first result from first compute node, the second result from the second compute node, and zeros from others. The first compute node replaces the first result with the third result, which is the second process.

Archer, Charles Jens↗

Compiling software for a hierarchical distributed processing system

Compiling software for a hierarchical distributed processing system including providing to one or more compiling nodes software to be compiled, wherein at least a portion of the software to be compiled is to be executed by one or more nodes; compiling, by the compiling node, the software; maintaining, by the compiling node, any compiled software to be executed on the compiling node; selecting, by the compiling node, one or more nodes in a next tier of the hierarchy of the distributed processing system in dependence upon whether any compiled software is for the selected node or the selected node's descendents; sending to the selected node only the compiled software to be executed by the selected node or selected node's descendent.

97 MATHEMATICS AND COMPUTING↗

Send-side matching of data communications messages

Send-side matching of data communications messages in a distributed computing system comprising a plurality of compute nodes, including: issuing by a receiving node to source nodes a receive message that specifies receipt of a single message to be sent from any source node, the receive message including message matching information, a specification of a hardware-level mutual exclusion device, and an identification of a receive buffer; matching by two or more of the source nodes the receive message with pending send messages in the two or more source nodes; operating by one of the source nodes having a matching send message the mutual exclusion device, excluding messages from other source nodes with matching send messages and identifying to the receiving node the source node operating the mutual exclusion device; and sending to the receiving node from the source node operating the mutual exclusion device a matched pending message.

97 MATHEMATICS AND COMPUTING↗

Send-side matching of data communications messages

Send-side matching of data communications messages includes a plurality of compute nodes organized for collective operations, including: issuing by a receiving node to source nodes a receive message that specifies receipt of a single message to be sent from any source node, the receive message including message matching information, a specification of a hardware-level mutual exclusion device, and an identification of a receive buffer; matching by two or more of the source nodes the receive message with pending send messages in the two or more source nodes; operating by one of the source nodes having a matching send message the mutual exclusion device, excluding messages from other source nodes with matching send messages and identifying to the receiving node the source node operating the mutual exclusion device; and sending to the receiving node from the source node operating the mutual exclusion device a matched pending message.

97 MATHEMATICS AND COMPUTING↗

Adaptive, self-tuning virtual sensing system for cyber-attack neutralization

An industrial asset may have a plurality of monitoring nodes, each monitoring node generating a series of monitoring node values over time representing current operation of the industrial asset. An abnormality detection computer may determine that an abnormal monitoring node is currently being attacked or experiencing a fault. An autonomous, resilient estimator may continuously execute an adaptive learning process to create or update virtual sensor models for that monitoring node. Responsive to an indication that a monitoring node is currently being attacked or experiencing a fault, a level of neutralization may be automatically determined. The autonomous, resilient estimator may then be dynamically reconfigured to estimate a series of virtual node values based on information from normal monitoring nodes, appropriate virtual sensor models, and the determined level of neutralization. The series of monitoring node values from the abnormal monitoring node or nodes may then be replaced with the virtual node values.

Abbaszadeh, Masoud↗

Magnetic Resonance Lymphography Findings in Patients With Biochemical Recurrence After Prostatectomy and the Relation With the Stephenson Nomogram

Purpose: To estimate the occurrence of positive lymph nodes on magnetic resonance lymphography (MRL) in patients with a prostate-specific antigen (PSA) recurrence after prostatectomy and to investigate the relation between score on the Stephenson nomogram and lymph node involvement on MRL. Methods and Materials: Sixty-five candidates for salvage radiation therapy were referred for an MRL to determine their lymph node status. Clinical and histopathologic features were recorded. For 49 patients, data were complete to calculate the Stephenson nomogram score. Receiver operating characteristic (ROC) analysis was performed to determine how well this nomogram related to the MRL result. Analysis was done for the whole group and separately for patients with a PSA <1.0 ng/mL to determine the situation in candidates for early salvage radiation therapy, and for patients without pathologic lymph nodes at initial lymph node dissection. Results: MRL detected positive lymph nodes in 47 patients. ROC analysis for the Stephenson nomogram yielded an area under the curve (AUC) of 0.78 (95% confidence interval, 0.61-0.93). Of 29 patients with a PSA <1.0 ng/mL, 18 had a positive MRL. Of 37 patients without lymph node involvement at initial lymph node dissection, 25 had a positive MRL. ROC analysis for the Stephenson nomogram showed AUCs of 0.84 and 0.74, respectively, for these latter groups. Conclusion: MRL detected positive lymph nodes in 72% of candidates for salvage radiation therapy, in 62% of candidates for early salvage radiation therapy, and in 68% of initially node-negative patients. The Stephenson nomogram showed a good correlation with the MRL result and may thus be useful for identifying patients with a PSA recurrence who are at high risk for lymph node involvement.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

An Information Theoretic Approach to Identify Dominant Voltage Influencers for Unbalanced Distribution Systems

Smart distribution grid with multiple renewable energy sources can experience random voltage fluctuations due to variable generation, which may result in voltage violations. Traditional voltage control algorithms are inadequate to handle fast voltage variations. Therefore, new dynamic control methods are being developed that can significantly benefit from the knowledge of dominant voltage influencer (DVI) nodes. DVI nodes for a particular node of interest refer to nodes that have a relatively high impact on the voltage fluctuations at that node. Conventional power flow-based algorithms to identify DVI nodes are computationally complex, which limits their use in real-time applications. This paper proposes a novel information theoretic voltage influencing score (VIS) that quantifies the voltage influencing capacity of nodes with DERs/active loads in a three phase unbalanced distribution system. VIS is then employed to rank the nodes and identify the DVI set. VIS is derived analytically in a computationally efficient manner and its efficacy to identify DVI nodes is validated using the IEEE 37-node test system. It is shown through experiments that KL divergence and Bhattacharyya distance are effective indicators of DVI nodes with an identifying accuracy of more than 90%. Additionally, the computation burden is also reduced by an order of 5, thus providing the foundation for efficient voltage control.

42 ENGINEERING↗