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,135 records · Page 63

Photon flux requirements for EUV reticle imaging microscopy in the 22 and 16 nm nodes

EUV-wavelength actinic microscopy yields detailed information about EUV mask patterns, architectures, defects, and the performance of defect repair strategies, without the complications of photoresist imaging. The measured aerial image intensity profiles provide valuable feedback to improve mask and lithography system modeling methods. In order to understand the photon-flux-dependent pattern measurement limits of EUV mask-imaging microscopy, we have investigated the effects of shot noise on aerial image linewidth measurements for lines in the 22 and 16-nm generations. Using a simple model of image formation near the resolution limit, we probe the influence of photon shot noise on the measured, apparent line roughness. With this methodology, we arrive at general flux density requirements independent of the specific EUV microscope configurations. Analytical and statistical analysis of aerial image simulations in the 22 and 16-nm generations reveal the trade-offs between photon energy density (controllable with exposure time), effective pixel dimension on the CCO (controlled by the microscope's magnification ratio), and image log slope (ILS). We find that shot-noise-induced linewidth roughness (LWR) varies imersely with the square root of the photon energy density, and is proportional to the imaging magnification ratio. While high magnification is necessary for adequate spatial resolution, for a given flux density, higher magnification ratios have diminishing benefits. With practical imaging parameters, we find that in order to achieve an LWR (3{sigma}) value of 5% of linewidth for dense, 88-nm mask features with 80% aerial image contrast and 13.5-nm effective pixel width (1000x magnification ratio), a peak photon flux of approximately 1400 photons per pixel per exposure is required.

36 MATERIALS SCIENCE↗

Fault tolerant hypercube computer system architecture

A fault-tolerant multiprocessor computer system of the hypercube type comprising a hierarchy of computers of like kind which can be functionally substituted for one another as necessary is disclosed. Communication between the working nodes is via one communications network while communications between the working nodes and watch dog nodes and load balancing nodes higher in the structure is via another communications network separate from the first. A typical branch of the hierarchy reporting to a master node or host computer comprises, a plurality of first computing nodes; a first network of message conducting paths for interconnecting the first computing nodes as a hypercube. The first network provides a path for message transfer between the first computing nodes; a first watch dog node; and a second network of message connecting paths for connecting the first computing nodes to the first watch dog node independent from the first network, the second network provides an independent path for test message and reconfiguration affecting transfers between the first computing nodes and the first switch watch dog node. There is additionally, a plurality of second computing nodes; a third network of message conducting paths for interconnecting the second computing nodes as a hypercube. The third network provides a path for message transfer between the second computing nodes; a fourth network of message conducting paths for connecting the second computing nodes to the first watch dog node independent from the third network. The fourth network provides an independent path for test message and reconfiguration affecting transfers between the second computing nodes and the first watch dog node; and a first multiplexer disposed between the first watch dog node and the second and fourth networks for allowing the first watch dog node to selectively communicate with individual ones of the computing nodes through the second and fourth networks; as well as, a second watch dog node operably connected to the first multiplexer whereby the second watch dog node can selectively communicate with individual ones of the computing nodes through the second and fourth networks. The branch is completed by a first load balancing node; and a second multiplexer connected between the first load balancing node and the first and second watch dog nodes, allowing the first load balancing node to selectively communicate with the first and second watch dog nodes.

Madan, Herb S.↗

Power converter circuitry for photovoltaic devices

Power converter circuitry includes a direct current (DC) input comprising a first DC input node and a second DC input node, an alternating current (AC) output comprising a first AC output node coupled to the first DC input node and a second AC output node, a first boost switch coupled between the second DC input node and a boost intermediate node, a second boost switch coupled between the boost intermediate node and a common node, a boost inductor coupled between the boost intermediate node and the first DC input node, a link capacitor coupled between the second DC input node and the common node, a first half-bridge switch coupled between the second DC input node and a half-bridge intermediate node, a second half-bridge switch coupled between the half-bridge intermediate node and the common node, and a half-bridge inductor coupled between the half-bridge intermediate node and the second AC output node.

Ayyanar, Rajapandian↗

Systems and methods for optimal power flow on a radial network

Node controllers and power distribution networks in accordance with embodiments of the invention enable distributed power control. One embodiment includes a node controller including a distributed power control application; a plurality of node operating parameters describing the operating parameter of a node and a set of at least one node selected from the group consisting of an ancestor node and at least one child node; wherein send node operating parameters to nodes in the set of at least one node; receive operating parameters from the nodes in the set of at least one node; calculate a plurality of updated node operating parameters using an iterative process to determine the updated node operating parameters using the node operating parameters that describe the operating parameters of the node and the set of at least one node, where the iterative process involves evaluation of a closed form solution; and adjust node operating parameters.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Simulation for Prediction of Entry Article Demise (SPEAD): an Analysis Tool for Spacecraft Safety Analysis and Ascent/Reentry Risk Assessment

For the purpose of performing safety analysis and risk assessment for a probable offnominal suborbital/orbital atmospheric reentry resulting in vehicle breakup, a synthesis of trajectory propagation coupled with thermal analysis and the evaluation of node failure is required to predict the sequence of events, the timeline, and the progressive demise of spacecraft components. To provide this capability, the Simulation for Prediction of Entry Article Demise (SPEAD) analysis tool was developed. This report discusses the capabilities, modeling, and validation of the SPEAD analysis tool. SPEAD is applicable for Earth or Mars, with the option for 3 or 6 degrees-of-freedom (DOF) trajectory propagation. The atmosphere and aerodynamics data are supplied in tables, for linear interpolation of up to 4 independent variables. The gravitation model can include up to 20 zonal harmonic coefficients. The modeling of a single motor is available and can be adapted to multiple motors. For thermal analysis, the aerodynamic radiative and free-molecular/continuum convective heating, black-body radiative cooling, conductive heat transfer between adjacent nodes, and node ablation are modeled. In a 6- DOF simulation, the local convective heating on a node is a function of Mach, angle-ofattack, and sideslip angle, and is dependent on 1) the location of the node in the spacecraft and its orientation to the flow modeled by an exposure factor, and 2) the geometries of the spacecraft and the node modeled by a heating factor and convective area. Node failure is evaluated using criteria based on melting temperature, reference heat load, g-load, or a combination of the above. The failure of a liquid propellant tank is evaluated based on burnout flux from nucleate boiling or excess internal pressure. Following a component failure, updates are made as needed to the spacecraft mass and aerodynamic properties, nodal exposure and heating factors, and nodal convective and conductive areas. This allows the trajectory to be propagated seamlessly in a single run, inclusive of the trajectories of components that have separated from the spacecraft. The node ablation simulates the decreasing mass and convective/reference areas, and variable heating factor. A built-in database provides the thermo-mechanical properties of For the purpose of performing safety analysis and risk assessment for a probable offnominal suborbital/orbital atmospheric reentry resulting in vehicle breakup, a synthesis of trajectory propagation coupled with thermal analysis and the evaluation of node failure is required to predict the sequence of events, the timeline, and the progressive demise of spacecraft components. To provide this capability, the Simulation for Prediction of Entry Article Demise (SPEAD) analysis tool was developed. This report discusses the capabilities, modeling, and validation of the SPEAD analysis tool. SPEAD is applicable for Earth or Mars, with the option for 3 or 6 degrees-of-freedom (DOF) trajectory propagation. The atmosphere and aerodynamics data are supplied in tables, for linear interpolation of up to 4 independent variables. The gravitation model can include up to 20 zonal harmonic coefficients. The modeling of a single motor is available and can be adapted to multiple motors. For thermal analysis, the aerodynamic radiative and free-molecular/continuum convective heating, black-body radiative cooling, conductive heat transfer between adjacent nodes, and node ablation are modeled. In a 6- DOF simulation, the local convective heating on a node is a function of Mach, angle-ofattack, and sideslip angle, and is dependent on 1) the location of the node in the spacecraft and its orientation to the flow modeled by an exposure factor, and 2) the geometries of the spacecraft and the node modeled by a heating factor and convective area. Node failure is evaluated using criteria based on melting temperature, reference heat load, g-load, or a combination of the above. The failure of a liquid propellant tank is evaluated based on burnout flux from nucleate boiling or excess internal pressure. Following a component failure, updates are made as needed to the spacecraft mass and aerodynamic properties, nodal exposure and heating factors, and nodal convective and conductive areas. This allows the trajectory to be propagated seamlessly in a single run, inclusive of the trajectories of components that have separated from the spacecraft. The node ablation simulates the decreasing mass and convective/reference areas, and variable heating factor. A built-in database provides the thermo-mechanical properties of

Ling, Lisa↗

Broadcasting a message in a parallel computer

Methods, systems, and products are disclosed for broadcasting a message in a parallel computer that includes: transmitting, by the logical root to all of the nodes directly connected to the logical root, a message; and for each node except the logical root: receiving the message; if that node is the physical root, then transmitting the message to all of the child nodes except the child node from which the message was received; if that node received the message from a parent node and if that node is not a leaf node, then transmitting the message to all of the child nodes; and if that node received the message from a child node and if that node is not the physical root, then transmitting the message to all of the child nodes except the child node from which the message was received and transmitting the message to the parent node.

97 MATHEMATICS AND COMPUTING↗

Broadcasting a message in a parallel computer

Methods, systems, and products are disclosed for broadcasting a message in a parallel computer that includes: transmitting, by the logical root to all of the nodes directly connected to the logical root, a message; and for each node except the logical root: receiving the message; if that node is the physical root, then transmitting the message to all of the child nodes except the child node from which the message was received; if that node received the message from a parent node and if that node is not a leaf node, then transmitting the message to all of the child nodes; and if that node received the message from a child node and if that node is not the physical root, then transmitting the message to all of the child nodes except the child node from which the message was received and transmitting the message to the parent node.

97 MATHEMATICS AND COMPUTING↗

Complexity analysis of pipeline mapping problems in distributed heterogeneous networks

Largescale scientific applications require using various system resources to execute complex computing pipelines in distributed networks to support collaborative research. System resources are typically shared in the Internet or over dedicated connections based on their location, availability, capability, and capacity. Optimizing the network performance of computing pipelines in such distributed environments is critical to the success of these applications. We consider two types of largescale distributed applications: (1) interactive applications where a single dataset is sequentially processed along a pipeline; and (2) streaming applications where a series of datasets continuously flow through a pipeline. The computing pipelines of these applications consist of a number of modules executed in a linear order in network environments with heterogeneous resources under different constraints. Our goal is to find an efficient mapping scheme that allocates the modules of a pipeline to network nodes for minimum endtoend delay or maximum frame rate. We formulate the pipeline mappings in distributed environments as optimization problems and categorize them into six classes with different optimization goals and mapping constraints: (1) Minimum Endtoend Delay with No Node Reuse (MEDNNR), (2) Minimum Endtoend Delay with Contiguous Node Reuse (MEDCNR), (3) Minimum Endtoend Delay with Arbitrary Node Reuse (MEDANR), (4) Maximum Frame Rate with No Node Reuse or Share (MFRNNRS), (5) Maximum Frame Rate with Contiguous Node Reuse and Share (MFRCNRS), and (6) Maximum Frame Rate with Arbitrary Node Reuse and Share (MFRANRS). Here, 'contiguous node reuse' means that multiple contiguous modules along the pipeline may run on the same node and 'arbitrary node reuse' imposes no restriction on node reuse. Note that in interactive applications, a node can be reused but its resource is not shared. We prove that MEDANR is polynomially solvable and the rest are NP-complete. MEDANR, where either contiguous or noncontiguous modules in the pipeline can be mapped onto the same node, is essentially the Maximum n-hop Shortest Path problem, and can be solved using a dynamic programming method. In MEDNNR and MFRNNRS, any network node can be used only once, which requires selecting the same number of nodes for onetoone onto mapping. We show its NP-completeness by reducing from the Hamiltonian Path problem. Node reuse is allowed in MEDCNR, MFRCNRS and MFRANRS, which are similar to the Maximum n-hop Shortest Path problem that considers resource sharing. We prove their NP-completeness by reducing from the Disjoint-Connecting-Path Problem and Widest path with the Linear Capacity Constraints problem, respectively.

99 GENERAL AND MISCELLANEOUS↗

Habitable Working and Living Spaces in the Deep Space Science Vessel

The Deep Space Science Vessel (DSSV) is a conceptual design of a very large spacecraft intended as a mobile microgravity science platform. It represents an effort to conceptualize the systems and internal architectures needed to support a forty-eight-person crew for multi-year missions throughout the inner solar system and potentially beyond. The general arrangement of the DSSV is a modular spacecraft. Considering only the pressurized, habitable elements, the DSSV includes two large pressurized modules (Hab and Lab) docked together along with eight smaller node modules completing the habitable configuration. The Hab and Lab modules are docked side by side, with the longitudinal axes parallel to each other and a single docking port connecting them. A node module is docked to each dome on the Hab and Lab modules, such that the two small node modules on each end of the large Hab and Lab domes are docked both to each other and to the Hab and Lab. This creates a “racetrack” translation path on the interior. The other four node modules are docked at the center of the Hab and Lab modules, two on each side, creating another “racetrack” translation path perpendicular to the first one. The DSSV has a generally vertical orientation. Within the Hab and Lab modules the decks are perpendicular to the longitudinal axis. The node modules are oriented with their longitudinal axes perpendicular to those of the Hab and Lab modules, so the nodes have a horizontal internal orientation. Decks are numbered one through nine, with decks two and eight representing the “top” and “bottom” domes of the Hab and Lab modules. The Hab Module decks encompass the ship’s galley, crew quarters, waste, hygiene, portions of crew exercise, and group recreation. The Lab Module contains food production facilities, the life science lab, the ship’s infirmary, the physical science lab, and the maintenance and fabrication workshop. The Node Modules serve a number of different functions. The two Exercise Nodes are docked to deck five of both the Hab and Lab modules and contain most of the aerobic and resistive exercise devices. Also docked to deck five but on the opposite side of the Hab and Lab modules are the Observation Deck and Space Café. These two node modules provide social gathering space for small numbers of crew. The Mission Operations Node is on deck nine directly above the Galley and contains spacecraft monitoring and commanding capabilities. Docked to it is the EVA Operations Node, which contains suit maintenance and storage. (The airlock is a separate, external element docked to the EVA Operations Node.) The Subsystems Node is on deck one beneath the maintenance and fabrication workshop. Docked to it is the Stowage Node. This node does not house DSSV primary stowage, but is a staging point where stowage brought in from logistics modules can be sorted, unpacked, or repacked as needed prior to distribution to the appropriate sections of the spacecraft.

Deep Space Habitat↗

Identifying failure in a tree network of a parallel computer

Methods, parallel computers, and products are provided for identifying failure in a tree network of a parallel computer. The parallel computer includes one or more processing sets including an I/O node and a plurality of compute nodes. For each processing set embodiments include selecting a set of test compute nodes, the test compute nodes being a subset of the compute nodes of the processing set; measuring the performance of the I/O node of the processing set; measuring the performance of the selected set of test compute nodes; calculating a current test value in dependence upon the measured performance of the I/O node of the processing set, the measured performance of the set of test compute nodes, and a predetermined value for I/O node performance; and comparing the current test value with a predetermined tree performance threshold. If the current test value is below the predetermined tree performance threshold, embodiments include selecting another set of test compute nodes. If the current test value is not below the predetermined tree performance threshold, embodiments include selecting from the test compute nodes one or more potential problem nodes and testing individually potential problem nodes and links to potential problem nodes.

Archer, Charles J↗

Distributed optimal power flow processes for unbalanced radial distribution networks

Node controllers and power distribution networks in accordance with embodiments of the invention enable distributed power control on an unbalanced network. One embodiment includes a node controller including a distributed power control application; a plurality of node operating parameters describing the operating parameter of a node in an unbalanced network; wherein the processor is configured by the distributed power control application to: send node operating parameters to nodes in the set of at least one node; receive operating parameters from the nodes in the set of at least one node; calculate a plurality of updated node operating parameters using an iterative process to determine updated node operating parameters using the node operating parameters that describe the operating parameters of the node, and the operating parameters of the set of at least one node, where each iteration in the iterative process involves evaluation of a subproblem; and adjust node operating parameters.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Distributed control of electric power grids

A method for determining power output levels of a plurality of nodes in an electric power system includes receiving, at a first node of the plurality of nodes, voltage information and multipliers of all neighboring nodes of the first node within the electric power system, determining, by the first node, a local power generation and a local voltage using the voltage information and the multipliers of the neighboring nodes and distributing the local power generation and the local voltage to the neighboring nodes, determining, by the first node, an estimated voltage of each of the neighboring nodes and distributing the estimated voltage to each of the neighboring nodes, and updating, by the first node, a local multiplier using the voltage information received from the neighboring nodes and the estimated voltage of each of the neighboring nodes determined by the node.

Ghosh, Soumyadip↗

Self-healing diffusion quantum Monte Carlo algorithms: methods for direct reduction of the fermion sign error in electronic structure calculations

We develop a formalism and present an algorithm for optimization of the trial wave-function used in fixed-node diffusion quantum Monte Carlo (DMC) methods. The formalism is based on the DMC mixed estimator of the ground state probability density. We take advantage of a basic property of the walker configuration distribution generated in a DMC calculation, to (i) project-out a multi-determinant expansion of the fixed node ground state wave function and (ii) to define a cost function that relates the interacting-ground-state-fixed-node and the non-interacting trial wave functions. We show that (a) locally smoothing out the kink of the fixed-node ground-state wave function at the node generates a new trial wave function with better nodal structure and (b) we argue that the noise in the fixed-node wave function resulting from finite sampling plays a beneficial role, allowing the nodes to adjust towards the ones of the exact many-body ground state in a simulated annealing-like process. Based on these principles, we propose a method to improve both single determinant and multi-determinant expansions of the trial wave function. The method can be generalized to other wave function forms such as pfaffians. We test the method in a model system where benchmark configuration interaction calculations can be performed and most components of the Hamiltonian are evaluated analytically. Comparing the DMC calculations with the exact solutions, we find that the trial wave function is systematically improved. The overlap of the optimized trial wave function and the exact ground state converges to 100% even starting from wave functions orthogonal to the exact ground state. Similarly, the DMC total energy and density converges to the exact solutions for the model. In the optimization process we find an optimal non-interacting nodal potential of density-functional-like form whose existence was predicted in a previous publication [Phys. Rev. B 77 245110 (2008)]. Tests of the method are extended to a model system with a conventional Coulomb interaction where we show we can obtain the exact Kohn-Sham effective potential from the DMC data.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Distributed gradient descent for solving optimal power flow in radial networks

Node controllers and power distribution networks in accordance with embodiments of the invention enable distributed power control. One embodiment includes a node controller comprising a memory containing: a plurality of node operating parameters; and a plurality of node operating parameters describing operating parameters for a set of at least one node selected from the group consisting of at least one downstream node and at least one upstream node; wherein the processor is configured by the node controller application to: receive and store in memory a plurality of coordinator parameters describing operating parameters of a node coordinator by the network interface; and calculate updated node operating parameters using an iterative gradient projection process to determine updated node parameters using node operating parameters that describe operating parameters of node and operating parameters of the set of at least one node, where each iteration is determined by the coordinator parameters.

Gan, Lingwen↗

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.

20 FOSSIL-FUELED POWER PLANTS↗

Autonomous reconfigurable virtual sensing system for cyber-attack neutralization

An industrial asset may be associated with 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 at least one abnormal monitoring node is currently being attacked or experiencing a fault. A virtual sensing estimator may continuously execute an adaptive learning process to create or update virtual sensor models for the monitoring nodes. Responsive to an indication that a monitoring node is currently being attacked or experiencing a fault, the virtual sensing estimator may be dynamically reconfigured to estimate a series of virtual node values for the abnormal monitoring node or nodes based on information from normal monitoring nodes and appropriate virtual sensor models. The series of monitoring node values from the abnormal monitoring node or nodes may then be replaced with the virtual node values.

97 MATHEMATICS AND COMPUTING↗