National Library of Energy BETA

Sample records for hp network node

  1. U-204: HP Network Node Manager i Input Validation Hole Permits Cross-Site Scripting Attacks

    Broader source: Energy.gov [DOE]

    Potential security vulnerabilities have been identified with HP Network Node Manager I (NNMi) for HP-UX, Linux, Solaris, and Windows. The vulnerabilities could be remotely exploited resulting in cross site scripting (XSS).

  2. U-229: HP Network Node Manager i Input Validation Flaw Permits Cross-Site Scripting Attacks

    Broader source: Energy.gov [DOE]

    Potential security vulnerabilities have been identified with HP Network Node Manager i (NNMi) for HP-UX, Linux, Solaris, and Windows. The vulnerabilities could be remotely exploited resulting in cross site scripting (XSS).

  3. Reconfigureable network node

    DOE Patents [OSTI]

    Vanderveen, Keith B.; Talbot, Edward B.; Mayer, Laurence E.

    2008-04-08

    Nodes in a network having a plurality of nodes establish communication links with other nodes using available transmission media, as the ability to establish such links becomes available and desirable. The nodes predict when existing communications links will fail, become overloaded or otherwise degrade network effectiveness and act to establish substitute or additional links before the node's ability to communicate with the other nodes on the network is adversely affected. A node stores network topology information and programmed link establishment rules and criteria. The node evaluates characteristics that predict existing links with other nodes becoming unavailable or degraded. The node then determines whether it can form a communication link with a substitute node, in order to maintain connectivity with the network. When changing its communication links, a node broadcasts that information to the network. Other nodes update their stored topology information and consider the updated topology when establishing new communications links for themselves.

  4. Modular sensor network node

    DOE Patents [OSTI]

    Davis, Jesse Harper Zehring; Stark, Jr., Douglas Paul; Kershaw, Christopher Patrick; Kyker, Ronald Dean

    2008-06-10

    A distributed wireless sensor network node is disclosed. The wireless sensor network node includes a plurality of sensor modules coupled to a system bus and configured to sense a parameter. The parameter may be an object, an event or any other parameter. The node collects data representative of the parameter. The node also includes a communication module coupled to the system bus and configured to allow the node to communicate with other nodes. The node also includes a processing module coupled to the system bus and adapted to receive the data from the sensor module and operable to analyze the data. The node also includes a power module connected to the system bus and operable to generate a regulated voltage.

  5. IEEE 342 Node Low Voltage Networked Test System

    SciTech Connect (OSTI)

    Schneider, Kevin P.; Phanivong, Phillippe K.; Lacroix, Jean-Sebastian

    2014-07-31

    The IEEE Distribution Test Feeders provide a benchmark for new algorithms to the distribution analyses community. The low voltage network test feeder represents a moderate size urban system that is unbalanced and highly networked. This is the first distribution test feeder developed by the IEEE that contains unbalanced networked components. The 342 node Low Voltage Networked Test System includes many elements that may be found in a networked system: multiple 13.2kV primary feeders, network protectors, a 120/208V grid network, and multiple 277/480V spot networks. This paper presents a brief review of the history of low voltage networks and how they evolved into the modern systems. This paper will then present a description of the 342 Node IEEE Low Voltage Network Test System and power flow results.

  6. Performance of wireless sensor networks under random node failures

    SciTech Connect (OSTI)

    Bradonjic, Milan; Hagberg, Aric; Feng, Pan

    2011-01-28

    Networks are essential to the function of a modern society and the consequence of damages to a network can be large. Assessing network performance of a damaged network is an important step in network recovery and network design. Connectivity, distance between nodes, and alternative routes are some of the key indicators to network performance. In this paper, random geometric graph (RGG) is used with two types of node failure, uniform failure and localized failure. Since the network performance are multi-facet and assessment can be time constrained, we introduce four measures, which can be computed in polynomial time, to estimate performance of damaged RGG. Simulation experiments are conducted to investigate the deterioration of networks through a period of time. With the empirical results, the performance measures are analyzed and compared to provide understanding of different failure scenarios in a RGG.

  7. U-274: HP Network Node Manager I (NNMi) for HP-UX, Linux, Solaris, and Windows, Remote Disclosure of Information

    Broader source: Energy.gov [DOE]

    Vulnerabilities can be exploited by malicious people to cause a DoS (Denial of Service) and potentially compromise a vulnerable system.

  8. Neural node network and model, and method of teaching same

    DOE Patents [OSTI]

    Parlos, Alexander G.; Atiya, Amir F.; Fernandez, Benito; Tsai, Wei K.; Chong, Kil T.

    1995-01-01

    The present invention is a fully connected feed forward network that includes at least one hidden layer 16. The hidden layer 16 includes nodes 20 in which the output of the node is fed back to that node as an input with a unit delay produced by a delay device 24 occurring in the feedback path 22 (local feedback). Each node within each layer also receives a delayed output (crosstalk) produced by a delay unit 36 from all the other nodes within the same layer 16. The node performs a transfer function operation based on the inputs from the previous layer and the delayed outputs. The network can be implemented as analog or digital or within a general purpose processor. Two teaching methods can be used: (1) back propagation of weight calculation that includes the local feedback and the crosstalk or (2) more preferably a feed forward gradient decent which immediately follows the output computations and which also includes the local feedback and the crosstalk. Subsequent to the gradient propagation, the weights can be normalized, thereby preventing convergence to a local optimum. Education of the network can be incremental both on and off-line. An educated network is suitable for modeling and controlling dynamic nonlinear systems and time series systems and predicting the outputs as well as hidden states and parameters. The educated network can also be further educated during on-line processing.

  9. Neural node network and model, and method of teaching same

    DOE Patents [OSTI]

    Parlos, A.G.; Atiya, A.F.; Fernandez, B.; Tsai, W.K.; Chong, K.T.

    1995-12-26

    The present invention is a fully connected feed forward network that includes at least one hidden layer. The hidden layer includes nodes in which the output of the node is fed back to that node as an input with a unit delay produced by a delay device occurring in the feedback path (local feedback). Each node within each layer also receives a delayed output (crosstalk) produced by a delay unit from all the other nodes within the same layer. The node performs a transfer function operation based on the inputs from the previous layer and the delayed outputs. The network can be implemented as analog or digital or within a general purpose processor. Two teaching methods can be used: (1) back propagation of weight calculation that includes the local feedback and the crosstalk or (2) more preferably a feed forward gradient decent which immediately follows the output computations and which also includes the local feedback and the crosstalk. Subsequent to the gradient propagation, the weights can be normalized, thereby preventing convergence to a local optimum. Education of the network can be incremental both on and off-line. An educated network is suitable for modeling and controlling dynamic nonlinear systems and time series systems and predicting the outputs as well as hidden states and parameters. The educated network can also be further educated during on-line processing. 21 figs.

  10. Node Augmentation Technique in Bayesian Network Evidence Analysis and Marshaling

    SciTech Connect (OSTI)

    Keselman, Dmitry; Tompkins, George H; Leishman, Deborah A

    2010-01-01

    Given a Bayesian network, sensitivity analysis is an important activity. This paper begins by describing a network augmentation technique which can simplifY the analysis. Next, we present two techniques which allow the user to determination the probability distribution of a hypothesis node under conditions of uncertain evidence; i.e. the state of an evidence node or nodes is described by a user specified probability distribution. Finally, we conclude with a discussion of three criteria for ranking evidence nodes based on their influence on a hypothesis node. All of these techniques have been used in conjunction with a commercial software package. A Bayesian network based on a directed acyclic graph (DAG) G is a graphical representation of a system of random variables that satisfies the following Markov property: any node (random variable) is independent of its non-descendants given the state of all its parents (Neapolitan, 2004). For simplicities sake, we consider only discrete variables with a finite number of states, though most of the conclusions may be generalized.

  11. Error recovery to enable error-free message transfer between nodes of a computer network

    DOE Patents [OSTI]

    Blumrich, Matthias A.; Coteus, Paul W.; Chen, Dong; Gara, Alan; Giampapa, Mark E.; Heidelberger, Philip; Hoenicke, Dirk; Takken, Todd; Steinmacher-Burow, Burkhard; Vranas, Pavlos M.

    2016-01-26

    An error-recovery method to enable error-free message transfer between nodes of a computer network. A first node of the network sends a packet to a second node of the network over a link between the nodes, and the first node keeps a copy of the packet on a sending end of the link until the first node receives acknowledgment from the second node that the packet was received without error. The second node tests the packet to determine if the packet is error free. If the packet is not error free, the second node sets a flag to mark the packet as corrupt. The second node returns acknowledgement to the first node specifying whether the packet was received with or without error. When the packet is received with error, the link is returned to a known state and the packet is sent again to the second node.

  12. The Network Completion Problem: Inferring Missing Nodes and Edges in Networks

    SciTech Connect (OSTI)

    Kim, M; Leskovec, J

    2011-11-14

    Network structures, such as social networks, web graphs and networks from systems biology, play important roles in many areas of science and our everyday lives. In order to study the networks one needs to first collect reliable large scale network data. While the social and information networks have become ubiquitous, the challenge of collecting complete network data still persists. Many times the collected network data is incomplete with nodes and edges missing. Commonly, only a part of the network can be observed and we would like to infer the unobserved part of the network. We address this issue by studying the Network Completion Problem: Given a network with missing nodes and edges, can we complete the missing part? We cast the problem in the Expectation Maximization (EM) framework where we use the observed part of the network to fit a model of network structure, and then we estimate the missing part of the network using the model, re-estimate the parameters and so on. We combine the EM with the Kronecker graphs model and design a scalable Metropolized Gibbs sampling approach that allows for the estimation of the model parameters as well as the inference about missing nodes and edges of the network. Experiments on synthetic and several real-world networks show that our approach can effectively recover the network even when about half of the nodes in the network are missing. Our algorithm outperforms not only classical link-prediction approaches but also the state of the art Stochastic block modeling approach. Furthermore, our algorithm easily scales to networks with tens of thousands of nodes.

  13. U-214: HP Network Node Manager Java JDK / JRE Multiple Vulnerabilities

    Broader source: Energy.gov [DOE]

    Vulnerabilities could be remotely exploited resulting in unauthorized information disclosure, modification, Denial of Service (DoS).

  14. Support Nodes

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Support Nodes Support Nodes xe6blade.png Hopper has nodes connected to the internal Gemini network that provide functions that support the compute nodes. These include job launch...

  15. Determining a bisection bandwidth for a multi-node data communications network

    DOE Patents [OSTI]

    Faraj, Ahmad A.

    2010-01-26

    Methods, systems, and products are disclosed for determining a bisection bandwidth for a multi-node data communications network that include: partitioning nodes in the network into a first sub-network and a second sub-network in dependence upon a topology of the network; sending, by each node in the first sub-network to a destination node in the second sub-network, a first message having a predetermined message size; receiving, by each node in the first sub-network from a source node in the second sub-network, a second message; measuring, by each node in the first sub-network, the elapsed communications time between the sending of the first message and the receiving of the second message; selecting the longest elapsed communications time; and calculating the bisection bandwidth for the network in dependence upon the number of the nodes in the first sub-network, the predetermined message size of the first test message, and the longest elapsed communications time.

  16. Lambda network having 2.sup.m-1 nodes in each of m stages with each node coupled to four other nodes for bidirectional routing of data packets between nodes

    DOE Patents [OSTI]

    Napolitano, Jr., Leonard M.

    1995-01-01

    The Lambda network is a single stage, packet-switched interprocessor communication network for a distributed memory, parallel processor computer. Its design arises from the desired network characteristics of minimizing mean and maximum packet transfer time, local routing, expandability, deadlock avoidance, and fault tolerance. The network is based on fixed degree nodes and has mean and maximum packet transfer distances where n is the number of processors. The routing method is detailed, as are methods for expandability, deadlock avoidance, and fault tolerance.

  17. Wireless Sensor Networks - Node Localization for Various Industry Problems

    DOE Public Access Gateway for Energy & Science Beta (PAGES Beta)

    Derr, Kurt; Manic, Milos

    2015-06-01

    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 Smoothingmore » (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.« less

  18. Wireless Sensor Networks - Node Localization for Various Industry Problems

    SciTech Connect (OSTI)

    Derr, Kurt; Manic, Milos

    2015-06-01

    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.

  19. Synchronization in node of complex networks consist of complex chaotic system

    SciTech Connect (OSTI)

    Wei, Qiang, E-mail: qiangweibeihua@163.com [Beihua University computer and technology College, BeiHua University, Jilin, 132021, Jilin (China); Digital Images Processing Institute of Beihua University, BeiHua University, Jilin, 132011, Jilin (China); Faculty of Electronic Information and Electrical Engineering, Dalian University of Technology, Dalian, 116024 (China); Xie, Cheng-jun [Beihua University computer and technology College, BeiHua University, Jilin, 132021, Jilin (China); Digital Images Processing Institute of Beihua University, BeiHua University, Jilin, 132011, Jilin (China); Liu, Hong-jun [School of Information Engineering, Weifang Vocational College, Weifang, 261041 (China); Li, Yan-hui [The Library, Weifang Vocational College, Weifang, 261041 (China)

    2014-07-15

    A new synchronization method is investigated for node of complex networks consists of complex chaotic system. When complex networks realize synchronization, different component of complex state variable synchronize up to different scaling complex function by a designed complex feedback controller. This paper change synchronization scaling function from real field to complex field for synchronization in node of complex networks with complex chaotic system. Synchronization in constant delay and time-varying coupling delay complex networks are investigated, respectively. Numerical simulations are provided to show the effectiveness of the proposed method.

  20. Lambda network having 2{sup m{minus}1} nodes in each of m stages with each node coupled to four other nodes for bidirectional routing of data packets between nodes

    DOE Patents [OSTI]

    Napolitano, L.M. Jr.

    1995-11-28

    The Lambda network is a single stage, packet-switched interprocessor communication network for a distributed memory, parallel processor computer. Its design arises from the desired network characteristics of minimizing mean and maximum packet transfer time, local routing, expandability, deadlock avoidance, and fault tolerance. The network is based on fixed degree nodes and has mean and maximum packet transfer distances where n is the number of processors. The routing method is detailed, as are methods for expandability, deadlock avoidance, and fault tolerance. 14 figs.

  1. Minimally buffered data transfers between nodes in a data communications network

    DOE Patents [OSTI]

    Miller, Douglas R.

    2015-06-23

    Methods, apparatus, and products for minimally buffered data transfers between nodes in a data communications network are disclosed that include: receiving, by a messaging module on an origin node, a storage identifier, a origin data type, and a target data type, the storage identifier specifying application storage containing data, the origin data type describing a data subset contained in the origin application storage, the target data type describing an arrangement of the data subset in application storage on a target node; creating, by the messaging module, origin metadata describing the origin data type; selecting, by the messaging module from the origin application storage in dependence upon the origin metadata and the storage identifier, the data subset; and transmitting, by the messaging module to the target node, the selected data subset for storing in the target application storage in dependence upon the target data type without temporarily buffering the data subset.

  2. Providing full point-to-point communications among compute nodes of an operational group in a global combining network of a parallel computer

    DOE Patents [OSTI]

    Archer, Charles J; Faraj, Ahmad A; Inglett, Todd A; Ratterman, Joseph D

    2013-04-16

    Methods, apparatus, and products are disclosed for providing full point-to-point communications among compute nodes of an operational group in a global combining network of a parallel computer, each compute node connected to each adjacent compute node in the global combining network through a link, that include: receiving a network packet in a compute node, the network packet specifying a destination compute node; selecting, in dependence upon the destination compute node, at least one of the links for the compute node along which to forward the network packet toward the destination compute node; and forwarding the network packet along the selected link to the adjacent compute node connected to the compute node through the selected link.

  3. Providing nearest neighbor point-to-point communications among compute nodes of an operational group in a global combining network of a parallel computer

    DOE Patents [OSTI]

    Archer, Charles J.; Faraj, Ahmad A.; Inglett, Todd A.; Ratterman, Joseph D.

    2012-10-23

    Methods, apparatus, and products are disclosed for providing nearest neighbor point-to-point communications among compute nodes of an operational group in a global combining network of a parallel computer, each compute node connected to each adjacent compute node in the global combining network through a link, that include: identifying each link in the global combining network for each compute node of the operational group; designating one of a plurality of point-to-point class routing identifiers for each link such that no compute node in the operational group is connected to two adjacent compute nodes in the operational group with links designated for the same class routing identifiers; and configuring each compute node of the operational group for point-to-point communications with each adjacent compute node in the global combining network through the link between that compute node and that adjacent compute node using that link's designated class routing identifier.

  4. Information-based self-organization of sensor nodes of a sensor network

    DOE Patents [OSTI]

    Ko, Teresa H.; Berry, Nina M.

    2011-09-20

    A sensor node detects a plurality of information-based events. The sensor node determines whether at least one other sensor node is an information neighbor of the sensor node based on at least a portion of the plurality of information-based events. The information neighbor has an overlapping field of view with the sensor node. The sensor node sends at least one communication to the at least one other sensor node that is an information neighbor of the sensor node in response to at least one information-based event of the plurality of information-based events.

  5. Configuring compute nodes of a parallel computer in an operational group into a plurality of independent non-overlapping collective networks

    DOE Patents [OSTI]

    Archer, Charles J.; Inglett, Todd A.; Ratterman, Joseph D.; Smith, Brian E.

    2010-03-02

    Methods, apparatus, and products are disclosed for configuring compute nodes of a parallel computer in an operational group into a plurality of independent non-overlapping collective networks, the compute nodes in the operational group connected together for data communications through a global combining network, that include: partitioning the compute nodes in the operational group into a plurality of non-overlapping subgroups; designating one compute node from each of the non-overlapping subgroups as a master node; and assigning, to the compute nodes in each of the non-overlapping subgroups, class routing instructions that organize the compute nodes in that non-overlapping subgroup as a collective network such that the master node is a physical root.

  6. A Robust and Flexible Design for GCEP Unattended Online Enrichment Monitoring: An OLEM Collection Node Network

    SciTech Connect (OSTI)

    Younkin, James R; March-Leuba, Jose A; Garner, James R

    2013-01-01

    shelf (COTS) components and summarized the OLEM collection node data security provisions. This paper will discuss a secure and redundant network of OLEM collection nodes, auxiliary detection units and supporting junction boxes distributed throughout a facility for monitoring enrichment on product, feed and tails unit header pipes; the purpose and capability of the built-in Electronic Optical Sealing System (EOSS) network gateway; and a network approach for obtaining reliable and authenticated pressure measurements.

  7. Tera-node Network Technology (TASK 4) Network Infrastructure Activities (NIA) final report

    SciTech Connect (OSTI)

    Postel, John; Bannister, Joe

    2000-03-15

    The TNT project developed software technologies in scalable personal telecommunications (SPT), Reservation Protocol 2 (RSVP2), Scalable Computing Infrastructure (SCOPE), and Network Infrastructure Activities (NIA). SPT = developed many innovative protocols to support the use of videoconferencing applications on the Internet. RSVP2 = developed a new reference model and further standardization of RSVP. SCOPE = developed dynamic resource discovery techniques and distributed directory services in support of resource allocation for large distributed systems and computations. NIA = provided policy, operational, and support to the transitioning Internet.

  8. HP XC System Cast Briefing

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Linux in High Performance Computing vendor perspective Scott McClellan CTO/HPTCD Salishan Conference - April '03 page 2 HP Confidential Perspective * My Role/Background - CTO of the HPTCD division in the new HP - Background: * pm-HP (1984); commercial computing; OS development (lead architect MPE); telecom(carrier-grade severs & HA architect); joined HPTCD in June/'02 * This presentation represents my personal opinion, not the official position of HP. * HP is - HW vendor (servers - Total

  9. System and method for merging clusters of wireless nodes in a wireless network

    DOE Patents [OSTI]

    Budampati, Ramakrishna S.; Gonia, Patrick S.; Kolavennu, Soumitri N.; Mahasenan, Arun V.

    2012-05-29

    A system includes a first cluster having multiple first wireless nodes. One first node is configured to act as a first cluster master, and other first nodes are configured to receive time synchronization information provided by the first cluster master. The system also includes a second cluster having one or more second wireless nodes. One second node is configured to act as a second cluster master, and any other second nodes configured to receive time synchronization information provided by the second cluster master. The system further includes a manager configured to merge the clusters into a combined cluster. One of the nodes is configured to act as a single cluster master for the combined cluster, and the other nodes are configured to receive time synchronization information provided by the single cluster master.

  10. Data Transfer Nodes

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Data Transfer Nodes Data Transfer Nodes PDSF has dedicated nodes for grid services and data transfers named pdsfdtn1.nersc.gov and pdsfdtn2.nersc.gov. Both nodes have 10 Gb/s network connections to the NERSC network. Please avoid using the interactive nodes for bulk data transfer. Not only can it be disruptive to other users but the network connection is only 1 Gb/s so it will take longer. For transfers using /project and/or HPSS use the NERSC data transfer nodes - see the NERSC data transfer

  11. Embedding global barrier and collective in torus network with each node combining input from receivers according to class map for output to senders

    DOE Patents [OSTI]

    Chen, Dong; Coteus, Paul W; Eisley, Noel A; Gara, Alan; Heidelberger, Philip; Senger, Robert M; Salapura, Valentina; Steinmacher-Burow, Burkhard; Sugawara, Yutaka; Takken, Todd E

    2013-08-27

    Embodiments of the invention provide a method, system and computer program product for embedding a global barrier and global interrupt network in a parallel computer system organized as a torus network. The computer system includes a multitude of nodes. In one embodiment, the method comprises taking inputs from a set of receivers of the nodes, dividing the inputs from the receivers into a plurality of classes, combining the inputs of each of the classes to obtain a result, and sending said result to a set of senders of the nodes. Embodiments of the invention provide a method, system and computer program product for embedding a collective network in a parallel computer system organized as a torus network. In one embodiment, the method comprises adding to a torus network a central collective logic to route messages among at least a group of nodes in a tree structure.

  12. Compute Nodes

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Nodes Quad CoreAMDOpteronprocessor Compute Node Configuration 9,572 nodes 1 quad-core AMD 'Budapest' 2.3 GHz processor per node 4 cores per node (38,288 total cores) 8 GB...

  13. Multiple node remote messaging

    DOE Patents [OSTI]

    Blumrich, Matthias A.; Chen, Dong; Gara, Alan G.; Giampapa, Mark E.; Heidelberger, Philip; Ohmacht, Martin; Salapura, Valentina; Steinmacher-Burow, Burkhard; Vranas, Pavlos

    2010-08-31

    A method for passing remote messages in a parallel computer system formed as a network of interconnected compute nodes includes that a first compute node (A) sends a single remote message to a remote second compute node (B) in order to control the remote second compute node (B) to send at least one remote message. The method includes various steps including controlling a DMA engine at first compute node (A) to prepare the single remote message to include a first message descriptor and at least one remote message descriptor for controlling the remote second compute node (B) to send at least one remote message, including putting the first message descriptor into an injection FIFO at the first compute node (A) and sending the single remote message and the at least one remote message descriptor to the second compute node (B).

  14. Login Nodes

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Login Nodes Login Nodes Franklin has 10 login nodes directly connected to the compute nodes. Another login node, named "Freedom," is connected "externally." Login nodes are used to edit files, compile codes, and submit job scripts to the batch system to run on the "compute nodes." Internal Login Nodes Quick Facts When you ssh to franklin.nersc.gov, you are connecting to an internal "login node." Franklin has 10 internal login nodes (this is largely

  15. Compute Nodes

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Compute Nodes Compute Nodes Quad CoreAMDOpteronprocessor Compute Node Configuration 9,572 nodes 1 quad-core AMD 'Budapest' 2.3 GHz processor per node 4 cores per node (38,288 total cores) 8 GB DDR3 800 MHz memory per node Peak Gflop rate 9.2 Gflops/core 36.8 Gflops/node 352 Tflops for the entire machine Each core has their own L1 and L2 caches, with 64 KB and 512KB respectively 2 MB L3 cache shared among the 4 cores Compute Node Software By default the compute nodes run a restricted low-overhead

  16. Login Nodes

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Login Nodes Login Nodes Login Node Quick Facts When you ssh to hopper.nersc.gov, you are connecting to a "login node." Login nodes are used to edit files, compile codes, and submit job scripts to the batch system to run on the "compute nodes." Hopper has 12 login nodes (this is largely transparent to users). 4 quad-core AMD 2.4 GHz Opteron processers (16 cores total) on 8 of the login nodes 4 8-core AMD 2.0 GHz Opteron processors (32 cores total) on 4 of the login nodes. Each

  17. Compute nodes

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Compute nodes Compute nodes Click here to see more detailed hierachical map of the topology of a compute node. Last edited: 2015-03-30 20:55:24...

  18. Login Nodes

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Login Nodes Login Nodes Login Node Quick Facts When you ssh to any NERSC computer system (such as ssh edison.nersc.gov), you are connecting to a "login node." The login nodes sit behind a load balancer. New connections are assigned to a login node on a round robin fashion with the exception that if you've connected to a system recently, the load balancer will attempt to put you on the same login node as your previous connection. Login nodes are used to edit files, compile codes, and

  19. Crystal Structure of the HP1-EMSY Complex Reveals an Unusual Mode of HP1 Binding

    SciTech Connect (OSTI)

    Huang,Y.; Myers, M.; Xu, R.

    2006-01-01

    Heterochromatin protein-1 (HP1) plays an essential role in both the assembly of higher-order chromatin structure and epigenetic inheritance. The C-terminal chromo shadow domain (CSD) of HP1 is responsible for homodimerization and interaction with a number of chromatin-associated nonhistone proteins, including EMSY, which is a BRCA2-interacting protein that has been implicated in the development of breast and ovarian cancer. We have determined the crystal structure of the HP1{beta} CSD in complex with the N-terminal domain of EMSY at 1.8 Angstroms resolution. Surprisingly, the structure reveals that EMSY is bound by two HP1 CSD homodimers, and the binding sequences differ from the consensus HP1 binding motif PXVXL. This structural information expands our understanding of HP1 binding specificity and provides insights into interactions between HP1 homodimers that are likely to be important for heterochromatin formation.

  20. Extra-Large Memory Nodes

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    qsub -I -X -q regxlmem -l nodes1:ppn1 -l walltime01:00:00 -l mem16GB Use of NX X-windows forwarding is normally slow due to the network latency. NERSC provide the NX...

  1. U-137: HP Performance Manager Unspecified Bug Lets Remote Users...

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    vulnerability has been identified with HP Performance Manager running on HP-UX, Linux, Solaris, and Windows. The vulnerability could be exploited remotely to execute...

  2. HP Ex Parte Memo on Proposed Rulemaking for Battery Chargers...

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    HP Ex Parte Memo on Proposed Rulemaking for Battery Chargers and External Power Supplies HP Ex Parte Memo on Proposed Rulemaking for Battery Chargers and External Power Supplies...

  3. HP Ex Parte Memo on Proposed Rulemaking for Battery Chargers...

    Office of Environmental Management (EM)

    HP Ex Parte Memo on Proposed Rulemaking for Battery Chargers and External Power Supplies HP Ex Parte Memo on Proposed Rulemaking for Battery Chargers and External Power Supplies ...

  4. U-203: HP Photosmart Bug Lets Remote Users Deny Service

    Broader source: Energy.gov [DOE]

    A vulnerability was reported in HP Photosmart. A remote user can cause denial of service conditions.

  5. Active Diesel Emission Control Technology for Sub-50 HP Engines...

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    Sub-50 HP Engines with Low Exhaust Temperature Profiles Active Diesel Emission Control Technology for Sub-50 HP Engines with Low Exhaust Temperature Profiles A new type of emission ...

  6. U-010:HP Onboard Administrator Unspecified Flaw Lets Remote Users...

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    0:HP Onboard Administrator Unspecified Flaw Lets Remote Users Gain Access U-010:HP Onboard Administrator Unspecified Flaw Lets Remote Users Gain Access October 13, 2011 - 8:15am...

  7. Synchronizing compute node time bases in a parallel computer

    DOE Patents [OSTI]

    Chen, Dong; Faraj, Daniel A; Gooding, Thomas M; Heidelberger, Philip

    2015-01-27

    Synchronizing time bases in a parallel computer that includes compute nodes organized for data communications in a tree network, where one compute node is designated as a root, and, for each compute node: calculating data transmission latency from the root to the compute node; configuring a thread as a pulse waiter; initializing a wakeup unit; and performing a local barrier operation; upon each node completing the local barrier operation, entering, by all compute nodes, a global barrier operation; upon all nodes entering the global barrier operation, sending, to all the compute nodes, a pulse signal; and for each compute node upon receiving the pulse signal: waking, by the wakeup unit, the pulse waiter; setting a time base for the compute node equal to the data transmission latency between the root node and the compute node; and exiting the global barrier operation.

  8. Synchronizing compute node time bases in a parallel computer

    DOE Patents [OSTI]

    Chen, Dong; Faraj, Daniel A; Gooding, Thomas M; Heidelberger, Philip

    2014-12-30

    Synchronizing time bases in a parallel computer that includes compute nodes organized for data communications in a tree network, where one compute node is designated as a root, and, for each compute node: calculating data transmission latency from the root to the compute node; configuring a thread as a pulse waiter; initializing a wakeup unit; and performing a local barrier operation; upon each node completing the local barrier operation, entering, by all compute nodes, a global barrier operation; upon all nodes entering the global barrier operation, sending, to all the compute nodes, a pulse signal; and for each compute node upon receiving the pulse signal: waking, by the wakeup unit, the pulse waiter; setting a time base for the compute node equal to the data transmission latency between the root node and the compute node; and exiting the global barrier operation.

  9. U-013: HP Data Protector Multiple Unspecified Vulnerabilities

    Broader source: Energy.gov [DOE]

    Multiple vulnerabilities were reported in HP Data Protector. A remote user can execute arbitrary code on the target system.

  10. From: Mulveny, Jennifer [mailto:jennifer.mulveny@hp.com]

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    Mulveny, Jennifer [mailto:jennifer.mulveny@hp.com] Sent: Tuesday, April 17, 2012 4:04 PM To: Mulveny, Jennifer; Exparte Communications Cc: Watt, Steve; Kido, Michael Subject: RE: HP Ex Parte Memo on Proposed Rulemaking for Battery Chargers and External Power Supplies This following notes summarize the discussion that HP held via teleconference with the Department of Energy on April 10, 2012. Hewlett-Packard Company (HP) appreciates the opportunity to comment on the new DOE rulemaking for Battery

  11. Node and GPU Configuration

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Configuration Node and GPU Configuration Compute Nodes and GPU Cards Dirac is a 50 GPU node cluster connected with QDR IB. Each GPU node also contains 2 Intel 5530 2.4 GHz, 8MB cache, 5.86GT/sec QPI Quad core Nehalem processors (8 cores per node) and 24GB DDR3-1066 Reg ECC memory. 44 nodes: 1 NVIDIA Tesla C2050 (code named Fermi) GPU with 3GB of memory and 448 parallel CUDA processor cores. 4 nodes: 1 C1060 NVIDIA Tesla GPU with 4GB of memory and 240 parallel CUDA processor cores. 1 node: 4

  12. Optimizing Data Transfer Nodes

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Optimizing Data Transfer Nodes using Packet Pacing Nathan Hanford University of California ... An important performance problem that we foresee with Data Transfer Nodes (DTNs) in the ...

  13. Extra-Large Memory Nodes

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Extra-Large Memory Nodes Extra-Large Memory Nodes Extra-Large Memory Nodes Overview Carver has two "extra-large" memory nodes; each node has four 8-core Intel X7550 ("Nehalem EX")...

  14. HP Ex Parte Memo on Proposed Rulemaking for Battery Chargers...

    Broader source: Energy.gov (indexed) [DOE]

    to comment on the new DOE rulemaking for Battery Chargers and External Power Supplies. ... HP Ex Parte Memo on Proposed Rulemaking for Battery Chargers and External Power Supplies ...

  15. T-588: HP Virtual SAN Appliance Stack Overflow

    Office of Energy Efficiency and Renewable Energy (EERE)

    A vulnerability has been reported in HP StorageWorks P4000 Virtual SAN Appliance Software, which can be exploited by malicious people to compromise a vulnerable system.

  16. Data Transfer Nodes

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Transfer » Data Transfer Nodes Data Transfer Nodes A redirector page has been set up without anywhere to redirect to. Last edited: 2016-04-29 11:35:12

  17. Interactive (login) Nodes

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Interactive (login) Nodes Interactive (login) Nodes There are 3 interactive nodes at PDSF, pdsf[6-8].nersc.gov, that should be accessed via ssh to pdsf.nersc.gov. These are the gateways to accessing the rest of PDSF. Users can submit batch jobs as well as view and manipulate their files and directories from the interactive nodes. The configuration of the interactive nodes is shown in the table below. Processor Clock Speed (GHz) Architecture Cores Total Memory (GB) Scratch Space (GB) Intel Xeon

  18. Identifying messaging completion in a parallel computer by checking for change in message received and transmitted count at each node

    DOE Patents [OSTI]

    Archer, Charles J.; Hardwick, Camesha R.; McCarthy, Patrick J.; Wallenfelt, Brian P.

    2009-06-23

    Methods, parallel computers, and products are provided for identifying messaging completion on a parallel computer. The parallel computer includes a plurality of compute nodes, the compute nodes coupled for data communications by at least two independent data communications networks including a binary tree data communications network optimal for collective operations that organizes the nodes as a tree and a torus data communications network optimal for point to point operations that organizes the nodes as a torus. Embodiments include reading all counters at each node of the torus data communications network; calculating at each node a current node value in dependence upon the values read from the counters at each node; and determining for all nodes whether the current node value for each node is the same as a previously calculated node value for each node. If the current node is the same as the previously calculated node value for all nodes of the torus data communications network, embodiments include determining that messaging is complete and if the current node is not the same as the previously calculated node value for all nodes of the torus data communications network, embodiments include determining that messaging is currently incomplete.

  19. Method and apparatus for routing data in an inter-nodal communications lattice of a massively parallel computer system by routing through transporter nodes

    DOE Patents [OSTI]

    Archer, Charles Jens; Musselman, Roy Glenn; Peters, Amanda; Pinnow, Kurt Walter; Swartz, Brent Allen; Wallenfelt, Brian Paul

    2010-11-16

    A massively parallel computer system contains an inter-nodal communications network of node-to-node links. An automated routing strategy routes packets through one or more intermediate nodes of the network to reach a destination. Some packets are constrained to be routed through respective designated transporter nodes, the automated routing strategy determining a path from a respective source node to a respective transporter node, and from a respective transporter node to a respective destination node. Preferably, the source node chooses a routing policy from among multiple possible choices, and that policy is followed by all intermediate nodes. The use of transporter nodes allows greater flexibility in routing.

  20. V-144: HP Printers Let Remote Users Access Files on the Printer...

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    4: HP Printers Let Remote Users Access Files on the Printer V-144: HP Printers Let Remote Users Access Files on the Printer April 29, 2013 - 12:27am Addthis PROBLEM: HP Printers...

  1. Data Transfer Nodes

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Data Transfer Nodes HPSS Data Archive IO Resources for Scientific Applications at NERSC Optimizing IO performance on the Lustre file system IO Formats Science Databases Sharing ...

  2. U-142: HP Onboard Administrator Bugs Let Remote Users Gain Access...

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    2: HP Onboard Administrator Bugs Let Remote Users Gain Access, Obtain Information, and Conduct URL Redirection Attacks U-142: HP Onboard Administrator Bugs Let Remote Users Gain...

  3. V-146: HP Service Manager Bugs Permit Cross-Site Scripting and...

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    6: HP Service Manager Bugs Permit Cross-Site Scripting and Information Disclosure Attacks V-146: HP Service Manager Bugs Permit Cross-Site Scripting and Information Disclosure...

  4. V-218: HP Service Manager Unspecified Flaw Lets Remote Users...

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    U-010:HP Onboard Administrator Unspecified Flaw Lets Remote Users Gain Access U-029: TCPIP Services for OpenVMS POPIMAP Service Bug Lets Remote Users Gain Unauthorized Access...

  5. Perlick: ENERGY STAR Referral (HP72ROO-S)

    Broader source: Energy.gov [DOE]

    DOE referred Perlick refrigerator HP72ROO-S to EPA, brand manager of the ENERGY STAR program, for appropriate action after DOE testing revealed that the model does not meet ENERGY STAR requirements.

  6. Perlick: ENERGY STAR Referral (HP48RO-S)

    Broader source: Energy.gov [DOE]

    DOE referred Perlick refrigerator HP48RO-S to EPA, brand manager of the ENERGY STAR program, for appropriate action after DOE testing revealed that the model does not meet ENERGY STAR requirements.

  7. Tonopah Test Range EGS graphics tracking display system: HP370

    SciTech Connect (OSTI)

    Meyer, R.H.; Bauhs, K.C.

    1994-08-01

    This report describes the HP370 component of the Enhanced Graphics System (EGS) used at Tonopah Test Range (TTR). Selected Radar data is fed into the computer systems and the resulting tracking symbols are displayed on high-resolution video monitors in real time. These tracking symbols overlay background maps and are used for monitoring/controlling various flight vehicles. This report discusses both the operational aspects and the internal configuration of the HP370 Workstation portion of the EGS system.

  8. HP Supercomputer at NREL Garners Top Honor - News Feature | NREL

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    HP Supercomputer at NREL Garners Top Honor October 13, 2014 This photo shows three men in suits standing in front of a data center. GSA Administrator Dan Tangherlini (left), NREL Associate Lab Director Bryan Hannegan, and NREL Director Dan Arvizu discuss the high performance computer Peregrine during a tour of the ESIF. NREL collaborated with HP and Intel to develop the innovative warm-water, liquid-cooled supercomputer, which recently won an R&D 100 award. Peregrine is the first

  9. SiNode Systems

    Broader source: Energy.gov [DOE]

    SiNode Systems is a battery materials venture developing silicon-graphene anodes for the next generation of lithium-ion batteries. SiNode anodes offer higher battery capacity and faster charging rates, all while being produced via a low cost solution chemistry-based manufacturing process.

  10. Distributed downhole drilling network

    DOE Patents [OSTI]

    Hall, David R.; Hall, Jr., H. Tracy; Fox, Joe; Pixton, David S.

    2006-11-21

    A high-speed downhole network providing real-time data from downhole components of a drilling strings includes a bottom-hole node interfacing to a bottom-hole assembly located proximate the bottom end of a drill string. A top-hole node is connected proximate the top end of the drill string. One or several intermediate nodes are located along the drill string between the bottom-hole node and the top-hole node. The intermediate nodes are configured to receive and transmit data packets transmitted between the bottom-hole node and the top-hole node. A communications link, integrated into the drill string, is used to operably connect the bottom-hole node, the intermediate nodes, and the top-hole node. In selected embodiments, a personal or other computer may be connected to the top-hole node, to analyze data received from the intermediate and bottom-hole nodes.

  11. Interactive (login) Nodes

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    There are 3 interactive nodes at PDSF, pdsf6-8.nersc.gov, that should be accessed via ssh to pdsf.nersc.gov. These are the gateways to accessing the rest of PDSF. Users can ...

  12. Methods and apparatus using commutative error detection values for fault isolation in multiple node computers

    DOE Patents [OSTI]

    Almasi, Gheorghe [Ardsley, NY; Blumrich, Matthias Augustin [Ridgefield, CT; Chen, Dong [Croton-On-Hudson, NY; Coteus, Paul [Yorktown, NY; Gara, Alan [Mount Kisco, NY; Giampapa, Mark E. [Irvington, NY; Heidelberger, Philip [Cortlandt Manor, NY; Hoenicke, Dirk I. [Ossining, NY; Singh, Sarabjeet [Mississauga, CA; Steinmacher-Burow, Burkhard D. [Wernau, DE; Takken, Todd [Brewster, NY; Vranas, Pavlos [Bedford Hills, NY

    2008-06-03

    Methods and apparatus perform fault isolation in multiple node computing systems using commutative error detection values for--example, checksums--to identify and to isolate faulty nodes. When information associated with a reproducible portion of a computer program is injected into a network by a node, a commutative error detection value is calculated. At intervals, node fault detection apparatus associated with the multiple node computer system retrieve commutative error detection values associated with the node and stores them in memory. When the computer program is executed again by the multiple node computer system, new commutative error detection values are created and stored in memory. The node fault detection apparatus identifies faulty nodes by comparing commutative error detection values associated with reproducible portions of the application program generated by a particular node from different runs of the application program. Differences in values indicate a possible faulty node.

  13. Vulnerability of critical infrastructures : identifying critical nodes.

    SciTech Connect (OSTI)

    Cox, Roger Gary; Robinson, David Gerald

    2004-06-01

    The objective of this research was the development of tools and techniques for the identification of critical nodes within critical infrastructures. These are nodes that, if disrupted through natural events or terrorist action, would cause the most widespread, immediate damage. This research focuses on one particular element of the national infrastructure: the bulk power system. Through the identification of critical elements and the quantification of the consequences of their failure, site-specific vulnerability analyses can be focused at those locations where additional security measures could be effectively implemented. In particular, with appropriate sizing and placement within the grid, distributed generation in the form of regional power parks may reduce or even prevent the impact of widespread network power outages. Even without additional security measures, increased awareness of sensitive power grid locations can provide a basis for more effective national, state and local emergency planning. A number of methods for identifying critical nodes were investigated: small-world (or network theory), polyhedral dynamics, and an artificial intelligence-based search method - particle swarm optimization. PSO was found to be the only viable approach and was applied to a variety of industry accepted test networks to validate the ability of the approach to identify sets of critical nodes. The approach was coded in a software package called Buzzard and integrated with a traditional power flow code. A number of industry accepted test networks were employed to validate the approach. The techniques (and software) are not unique to power grid network, but could be applied to a variety of complex, interacting infrastructures.

  14. Extra-Large Memory Nodes

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Extra-Large Memory Nodes Extra-Large Memory Nodes Extra-Large Memory Nodes Overview Carver has two "extra-large" memory nodes; each node has four 8-core Intel X7550 ("Nehalem EX") 2.0 GHz processors (32 cores total) and 1TB memory. These nodes are available through the queue "reg_xlmem". They can be used for interactive and batch jobs that require large amount of memory (16GB per core or more). reg_xlmem queue Please refer to the "Queues and Policies" page

  15. V-141: HP ElitePad 900 Secure Boot Bug Lets Local Users Boot...

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    1: HP ElitePad 900 Secure Boot Bug Lets Local Users Boot to Other Operating Systems V-141: HP ElitePad 900 Secure Boot Bug Lets Local Users Boot to Other Operating Systems April...

  16. V-166: HP-UX Directory Server Discloses Passwords to Remote Authentica...

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    6: HP-UX Directory Server Discloses Passwords to Remote Authenticated and Local Users V-166: HP-UX Directory Server Discloses Passwords to Remote Authenticated and Local Users May...

  17. HP Ex Parte Memo on Proposed Rulemaking for Battery Chargers and External Power Supplies

    Broader source: Energy.gov [DOE]

    Hewlett-Packard Company (HP) appreciates the opportunity to comment on the new DOE rulemaking for Battery Chargers and External Power Supplies. Thank you for taking the time to speak with us. HP...

  18. HP Ex Parte Memo on Proposed Rulemaking for Battery Chargers and External

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    Power Supplies | Department of Energy HP Ex Parte Memo on Proposed Rulemaking for Battery Chargers and External Power Supplies HP Ex Parte Memo on Proposed Rulemaking for Battery Chargers and External Power Supplies Hewlett-Packard Company (HP) appreciates the opportunity to comment on the new DOE rulemaking for Battery Chargers and External Power Supplies. Thank you for taking the time to speak with us. HP believes that existing voluntary Market Access Requirements, such as EPEAT and ENERGY

  19. U-135: HP WBEM Discloses Diagnostic Data to Remote and Local Users

    Broader source: Energy.gov [DOE]

    Two vulnerabilities were reported in HP WBEM. A remote or local user can gain access to diagnostic data.

  20. V-218: HP Service Manager Unspecified Flaw Lets Remote Users Gain Unauthorized Access

    Broader source: Energy.gov [DOE]

    This security update resolves a vulnerability in the HP Service Manager which allows people to have access to unauthorized information

  1. U-208: HP Operations Agent Bugs Let Remote Users Execute Arbitrary Code

    Broader source: Energy.gov [DOE]

    Two vulnerabilities were reported in HP Operations Agent. A remote user can execute arbitrary code on the target system

  2. U-017: HP MFP Digital Sending Software Lets Local Users Obtain Potentially Sensitive Information

    Broader source: Energy.gov [DOE]

    A vulnerability was reported in HP MFP Digital Sending Software. A local user can obtain potentially sensitive information.

  3. Executing scatter operation to parallel computer nodes by repeatedly broadcasting content of send buffer partition corresponding to each node upon bitwise OR operation

    DOE Patents [OSTI]

    Archer, Charles J.; Ratterman, Joseph D.

    2009-11-06

    Executing a scatter operation on a parallel computer includes: configuring a send buffer on a logical root, the send buffer having positions, each position corresponding to a ranked node in an operational group of compute nodes and for storing contents scattered to that ranked node; and repeatedly for each position in the send buffer: broadcasting, by the logical root to each of the other compute nodes on a global combining network, the contents of the current position of the send buffer using a bitwise OR operation, determining, by each compute node, whether the current position in the send buffer corresponds with the rank of that compute node, if the current position corresponds with the rank, receiving the contents and storing the contents in a reception buffer of that compute node, and if the current position does not correspond with the rank, discarding the contents.

  4. Enforcement Policy Statement: Off Mode Standards for CAC/HP | Department of

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    Energy Policy Statement: Off Mode Standards for CAC/HP Enforcement Policy Statement: Off Mode Standards for CAC/HP July 8, 2014 DOE will not seek civil penalties for violation of the off mode electrical power consumption standard for central air conditioners or central air conditioning heat pumps (CAC/HP) until 180 days following publication of a final rule establishing a test method for measuring off mode electrical power consumption for CAC/HP. Enforcement Policy: Off Mode Standards for

  5. T-643: HP OpenView Storage Data Protector Unspecified Code Execution Vulnerability

    Broader source: Energy.gov [DOE]

    A vulnerability has been reported in HP OpenView Storage Data Protector, which can be exploited by malicious people to compromise a vulnerable system.

  6. T-538: HP OpenView Storage Data Protector Bug Lets Remote Users Execute Arbitrary Code

    Broader source: Energy.gov [DOE]

    A vulnerability was reported in HP OpenView Storage Data Protector. A remote user can execute arbitrary code on the target system.

  7. V-210: HP LaserJet Pro Printer Bug Lets Remote Users Access Data

    Broader source: Energy.gov [DOE]

    A potential security vulnerability has been identified with certain HP LaserJet Pro printers. The vulnerability could be exploited remotely to gain unauthorized access to data.

  8. T-590: HP Diagnostics Input Validation Hole Permits Cross-Site Scripting Attacks

    Broader source: Energy.gov [DOE]

    A potential security vulnerability has been identified in HP Diagnostics. The vulnerability could be exploited remotely resulting in cross site scripting (XSS).

  9. U-275: HP IBRIX X9000 Storage Discloses Information to Remote Users

    Broader source: Energy.gov [DOE]

    A potential security vulnerability has been identified with HP IBRIX X9000 Storage. The vulnerability could be remotely exploited to allow disclosure of information.

  10. T-608: HP Virtual Server Environment Lets Remote Authenticated Users Gain Elevated Privileges

    Broader source: Energy.gov [DOE]

    A potential security vulnerability has been identified in HP Virtual Server Environment for Windows. The vulnerability could be exploited remotely to elevate privileges.

  11. Absolute properties of the triple star HP Aurigae

    SciTech Connect (OSTI)

    Lacy, Claud H. Sandberg; Burks, Charles L.; Torres, Guillermo; Wolf, Marek E-mail: clburks@email.uark.edu E-mail: wolf@cesnet.cz

    2014-01-01

    New photometric, spectroscopic, and eclipse timing observations of the eclipsing binary star HP Aur allow for very accurate orbital determinations, even in the presence of a third body and transient starspot activity. The eclipsing binary masses are determined to an accuracy of ±0.4% and the radii to ±0.6%. The masses are 0.9543 ± 0.0041 and 0.8094 ± 0.0036 solar masses, and the radii are 1.0278 ± 0.0042 and 0.7758 ± 0.0034 solar radii, respectively. The orbital period in the outer orbit is accurately determined for the first time: 4.332 ± 0.011 yr. A comparison with current theories of stellar evolution shows that the components' absolute properties can be well-matched by the current models at an age of about 7 billion years.

  12. A Unix Print Filter for Controlling an HP Laserjet Printer

    SciTech Connect (OSTI)

    Hoffman, F.M.

    1992-01-01

    This report describes a Unix print filter designed to control an Hewlett Packard Laserjet or other printer that uses Hewlett Packard's Printer Control Language (HP-PCL). The filter gives users the ability to control print pitch, orientation, and indentation by using standard flags to the Unix lpr command or multiple entries in the /etc/printcap file and allows both ascii and binary (i.e., graphics and down-loadable fonts) files to be printed. Additionally, the filter provides some accounting capability. The supported print pitch and orientation options are described, as are the different configuration options. The code for the filter is included in Appendix A and sample entries for the /etc/printcap file are included in Appendix B and C.

  13. T-570: HP Security Bulletin- HP-UX Running OpenSSL, Remote Execution of Arbitrary Code, Denial of Service (DoS), Authentication Bypass

    Broader source: Energy.gov [DOE]

    A potential security vulnerability has been identified with HP-UX OpenSSL. This vulnerability could be exploited remotely to execute arbitrary code or create a Denial of Service (DoS) or an authentication bypass.

  14. New 1 Terabyte Memory Node

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    New 1 Terabyte Memory Node New 1 Terabyte Memory Node June 17, 2011 by Francesca Verdier A new "extra large" memory node that has four 8-core Nehalem EX processors (32 cores total) and 1TB memory has been deployed in the Carver/Magellan complex. See Memory Considerations on Carver. Subscribe via RSS Subscribe Browse by Date August 2016 June 2016 May 2016 April 2016 January 2016 December 2015 November 2015 October 2015 September 2015 August 2015 July 2015 April 2015 March 2015 January

  15. U-238: HP Service Manager Input Validation Flaw Permits Cross-Site Scripting Attacks

    Broader source: Energy.gov [DOE]

    Cross-site scripting (XSS) vulnerability in HP Service Manager Web Tier 7.11, 9.21, and 9.30, and HP Service Center Web Tier 6.28, allows remote attackers to inject arbitrary web script or HTML via unspecified vectors.

  16. Network

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    ESnet About ESnet Our Mission The Network ESnet History Governance & Policies Career Opportunities ESnet Staff & Org Chart Contact Us Contact Us Technical Assistance: 1 800-33-ESnet (Inside US) 1 800-333-7638 (Inside US) 1 510-486-7600 (Globally) 1 510-486-7607 (Globally) Report Network Problems: trouble@es.net Provide Web Site Feedback: info@es.net About ESnet A Platform for Science Discovery The Energy Sciences Network (ESnet) is a high-performance, unclassified network built to

  17. Parallel-aware, dedicated job co-scheduling within/across symmetric multiprocessing nodes

    DOE Patents [OSTI]

    Jones, Terry R.; Watson, Pythagoras C.; Tuel, William; Brenner, Larry; ,Caffrey, Patrick; Fier, Jeffrey

    2010-10-05

    In a parallel computing environment comprising a network of SMP nodes each having at least one processor, a parallel-aware co-scheduling method and system for improving the performance and scalability of a dedicated parallel job having synchronizing collective operations. The method and system uses a global co-scheduler and an operating system kernel dispatcher adapted to coordinate interfering system and daemon activities on a node and across nodes to promote intra-node and inter-node overlap of said interfering system and daemon activities as well as intra-node and inter-node overlap of said synchronizing collective operations. In this manner, the impact of random short-lived interruptions, such as timer-decrement processing and periodic daemon activity, on synchronizing collective operations is minimized on large processor-count SPMD bulk-synchronous programming styles.

  18. Microfluidic ultrasonic particle separators with engineered node...

    Office of Scientific and Technical Information (OSTI)

    particle separators with engineered node locations and geometries Citation Details In-Document Search Title: Microfluidic ultrasonic particle separators with engineered node ...

  19. Complexed Adsorbed HP1 HP1 L2 L7 L7 L7 L2 H3 H3 National Energy

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Complexed Adsorbed HP1 HP1 L2 L7 L7 L7 L2 H3 H3 National Energy Research Scientific Computing Center 2011 Annual Report Ernest Orlando Lawrence Berkeley National Laboratory 1 Cyclotron Road, Berkeley, CA 94720-8148 This work was supported by the Director, Office of Science, Office of Advanced Scientific Computing Research of the U.S. Department of Energy under Contract No. DE-AC02-05CH11231. National Energy Research Scientific Computing Center 2011 Annual Report The Year in Perspective Research

  20. Global tree network for computing structures enabling global processing operations

    DOE Patents [OSTI]

    Blumrich; Matthias A.; Chen, Dong; Coteus, Paul W.; Gara, Alan G.; Giampapa, Mark E.; Heidelberger, Philip; Hoenicke, Dirk; Steinmacher-Burow, Burkhard D.; Takken, Todd E.; Vranas, Pavlos M.

    2010-01-19

    A system and method for enabling high-speed, low-latency global tree network communications among processing nodes interconnected according to a tree network structure. The global tree network enables collective reduction operations to be performed during parallel algorithm operations executing in a computer structure having a plurality of the interconnected processing nodes. Router devices are included that interconnect the nodes of the tree via links to facilitate performance of low-latency global processing operations at nodes of the virtual tree and sub-tree structures. The global operations performed include one or more of: broadcast operations downstream from a root node to leaf nodes of a virtual tree, reduction operations upstream from leaf nodes to the root node in the virtual tree, and point-to-point message passing from any node to the root node. The global tree network is configurable to provide global barrier and interrupt functionality in asynchronous or synchronized manner, and, is physically and logically partitionable.

  1. SensorNet Node Suite

    Energy Science and Technology Software Center (OSTI)

    2004-09-01

    The software in the SensorNet Node adopts and builds on IEEE 1451 interface principles to read data from and control sensors, stores the data in internal database structures, and transmits it in adapted Web Feature Services protocol packets to the SensorNet database. Failover software ensures that at least one available mode of communication remains alive.

  2. Vehicle Technologies Office Merit Review 2016: 2016 KIVA-hpFE Development:

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    A Robust and Accurate Engine Modeling Software | Department of Energy 2016 KIVA-hpFE Development: A Robust and Accurate Engine Modeling Software Vehicle Technologies Office Merit Review 2016: 2016 KIVA-hpFE Development: A Robust and Accurate Engine Modeling Software Presentation given by Los Alamos National Laboratory (LANL) at the 2016 DOE Vehicle Technologies Office and Hydrogen and Fuel Cells Program Annual Merit Review and Peer Evaluation Meeting about Combustion Engines

  3. Controlling data transfers from an origin compute node to a target compute node

    DOE Patents [OSTI]

    Archer, Charles J.; Blocksome, Michael A.; Ratterman, Joseph D.; Smith, Brian E.

    2011-06-21

    Methods, apparatus, and products are disclosed for controlling data transfers from an origin compute node to a target compute node that include: receiving, by an application messaging module on the target compute node, an indication of a data transfer from an origin compute node to the target compute node; and administering, by the application messaging module on the target compute node, the data transfer using one or more messaging primitives of a system messaging module in dependence upon the indication.

  4. Sandia Compact Sensor Node (SCSN) v. 1.0

    Energy Science and Technology Software Center (OSTI)

    2009-01-07

    The SCSN communication protocol is implemented in software and incorporates elements of Frequency Division Multiple Access (FDMA), Time Division Multiple Access (TDMA), and Carrier Sense Multiple Access (CSMA) to reduce radio message collisions, latency, and power consumption. Alarm messages are expeditiously routed to a central node as a 'star' network with minimum overhead. Other messages can be routed along network links between any two nodes so that peer-to-peer communication is possible. Broadcast messages can bemore » composed that flood the entire network or just specific portions with minimal radio traffic and latency. Two-way communication with sensor nodes, which sleep most of the time to conserve battery life, can occur at seven second intervals. SCSN software also incorporates special algorithms to minimize superfluous radio traffic that can result from excessive intrusion alarm messages. A built-in seismic detector is implemented with a geophone and software that distinguishes between pedestrian and vehicular targets. Other external sensors can be attached to a SCSN using supervised interface lines that are controlled by software. All software is written in the ANSI C language for ease of development, maintenance, and portability.« less

  5. Organization of growing random networks

    SciTech Connect (OSTI)

    Krapivsky, P. L.; Redner, S.

    2001-06-01

    The organizational development of growing random networks is investigated. These growing networks are built by adding nodes successively, and linking each to an earlier node of degree k with an attachment probability A{sub k}. When A{sub k} grows more slowly than linearly with k, the number of nodes with k links, N{sub k}(t), decays faster than a power law in k, while for A{sub k} growing faster than linearly in k, a single node emerges which connects to nearly all other nodes. When A{sub k} is asymptotically linear, N{sub k}(t){similar_to}tk{sup {minus}{nu}}, with {nu} dependent on details of the attachment probability, but in the range 2{lt}{nu}{lt}{infinity}. The combined age and degree distribution of nodes shows that old nodes typically have a large degree. There is also a significant correlation in the degrees of neighboring nodes, so that nodes of similar degree are more likely to be connected. The size distributions of the in and out components of the network with respect to a given node{emdash}namely, its {open_quotes}descendants{close_quotes} and {open_quotes}ancestors{close_quotes}{emdash}are also determined. The in component exhibits a robust s{sup {minus}2} power-law tail, where s is the component size. The out component has a typical size of order lnt, and it provides basic insights into the genealogy of the network.

  6. Three-step H-P adaptve strategy for the incompressible Navier-Stokes equations

    SciTech Connect (OSTI)

    Oden, J.T.; Wu, W.; Ainsworth, M.

    1995-12-31

    Recently, a reliable a posteriori error estimate was developed, mainly based on the element residual method, for a class of steady state incompressible Navier-Stokes equations. In this paper, using this error estimate, a three-step h-p adaptive strategy is developed to solve incompressible flow problems. The goal of developing an h-p adaptive strategy is to obtain accurate approximate solutions while minimizing computational costs. The basic idea of the three-step h-p adaptive strategy is to solve for the system on the three consecutive meshes, i.e. an initial mesh, an intermediate h-p adaptive mesh, and a final h-p adaptive mesh. Each new adaptive mesh is obtained by estimating the error on the previous mesh and executing a single h- or p- refinement procedure on the previous mesh according to the results of the adaptive strategy. Numerical results indicate that the proposed three-step adaptive strategy produces accurate solutions while keeping the total computational costs under control.

  7. Dedicated heterogeneous node scheduling including backfill scheduling

    DOE Patents [OSTI]

    Wood, Robert R.; Eckert, Philip D.; Hommes, Gregg

    2006-07-25

    A method and system for job backfill scheduling dedicated heterogeneous nodes in a multi-node computing environment. Heterogeneous nodes are grouped into homogeneous node sub-pools. For each sub-pool, a free node schedule (FNS) is created so that the number of to chart the free nodes over time. For each prioritized job, using the FNS of sub-pools having nodes useable by a particular job, to determine the earliest time range (ETR) capable of running the job. Once determined for a particular job, scheduling the job to run in that ETR. If the ETR determined for a lower priority job (LPJ) has a start time earlier than a higher priority job (HPJ), then the LPJ is scheduled in that ETR if it would not disturb the anticipated start times of any HPJ previously scheduled for a future time. Thus, efficient utilization and throughput of such computing environments may be increased by utilizing resources otherwise remaining idle.

  8. Message communications of particular message types between compute nodes using DMA shadow buffers

    DOE Patents [OSTI]

    Blocksome, Michael A.; Parker, Jeffrey J.

    2010-11-16

    Message communications of particular message types between compute nodes using DMA shadow buffers includes: receiving a buffer identifier specifying an application buffer having a message of a particular type for transmission to a target compute node through a network; selecting one of a plurality of shadow buffers for a DMA engine on the compute node for storing the message, each shadow buffer corresponding to a slot of an injection FIFO buffer maintained by the DMA engine; storing the message in the selected shadow buffer; creating a data descriptor for the message stored in the selected shadow buffer; injecting the data descriptor into the slot of the injection FIFO buffer corresponding to the selected shadow buffer; selecting the data descriptor from the injection FIFO buffer; and transmitting the message specified by the selected data descriptor through the data communications network to the target compute node.

  9. Network resilience; A measure of network fault tolerance

    SciTech Connect (OSTI)

    Najjar, W. . Dept. of Computer Science); Gaudoit, J.L. . Dept. of Electrical Engineering)

    1990-02-01

    The failure of a node in a multicomputer system will not only reduce the computational power but also alter the network's topology. Network fault tolerance is a measure of the number of failures the network can sustain before a disconnection occurs. It is expressed traditionally as the network's node degree. In this paper, the authors propose a probabilistic measure of network fault tolerance expressed as the probability f a disconnection. Qualitative evaluation of this measure is presented. As expected, the single-node disconnection probability is the dominant factor irrespective of the topology under consideration. They derive an analytical approximation of the disconnection probability and verify it with Monte Carlo simulation. Based on this model, the measures of network resilience and relative network resilience are proposed as probabilistic measures of network fault tolerance. These are then used to evaluate the effects of the disconnection probability on the reliability of the system.

  10. Local rules for protein folding on a triangular lattice and generalized hydrophobicity in the HP model

    SciTech Connect (OSTI)

    Agarwala, R. [National Institutes of Health, Bethesda, MD (United States); Batzoglou, S. [MIT, Cambridge, MA (United States); Dancik, V. [Univ. of Southern California, Los Angeles, CA (United States)] [and others

    1997-06-01

    We consider the problem of determining the three-dimensional folding of a protein given its one-dimensional amino acid sequence. We use the HP model for protein folding proposed by Dill, which models protein as a chain of amino acid residues that are either hydrophobic or polar, and hydrophobic interactions are the dominant initial driving force for the protein folding. Hart and Istrail gave approximation algorithms for folding proteins on the cubic lattice under HP model. In this paper, we examine the choice of a lattice by considering its algorithmic and geometric implications and argue that triangular lattice is a more reasonable choice. We present a set of folding rules for a triangular lattice and analyze the approximation ratio which they achieve. In addition, we introduce a generalization of the HP model to account for residues having different levels of hydrophobicity. After describing the biological foundation for this generalization, we show that in the new model we are able to achieve similar constant factor approximation guarantees on the triangular lattice as were achieved in the standard HP model. While the structures derived from our folding rules are probably still far from biological reality, we hope that having a set of folding rules with different properties will yield more interesting folds when combined.

  11. Collective network for computer structures

    DOE Patents [OSTI]

    Blumrich, Matthias A; Coteus, Paul W; Chen, Dong; Gara, Alan; Giampapa, Mark E; Heidelberger, Philip; Hoenicke, Dirk; Takken, Todd E; Steinmacher-Burow, Burkhard D; Vranas, Pavlos M

    2014-01-07

    A system and method for enabling high-speed, low-latency global collective communications among interconnected processing nodes. The global collective network optimally enables collective reduction operations to be performed during parallel algorithm operations executing in a computer structure having a plurality of the interconnected processing nodes. Router devices are included that interconnect the nodes of the network via links to facilitate performance of low-latency global processing operations at nodes of the virtual network. The global collective network may be configured to provide global barrier and interrupt functionality in asynchronous or synchronized manner. When implemented in a massively-parallel supercomputing structure, the global collective network is physically and logically partitionable according to the needs of a processing algorithm.

  12. Collective network for computer structures

    DOE Patents [OSTI]

    Blumrich, Matthias A.; Coteus, Paul W.; Chen, Dong; Gara, Alan; Giampapa, Mark E.; Heidelberger, Philip; Hoenicke, Dirk; Takken, Todd E.; Steinmacher-Burow, Burkhard D.; Vranas, Pavlos M.

    2011-08-16

    A system and method for enabling high-speed, low-latency global collective communications among interconnected processing nodes. The global collective network optimally enables collective reduction operations to be performed during parallel algorithm operations executing in a computer structure having a plurality of the interconnected processing nodes. Router devices ate included that interconnect the nodes of the network via links to facilitate performance of low-latency global processing operations at nodes of the virtual network and class structures. The global collective network may be configured to provide global barrier and interrupt functionality in asynchronous or synchronized manner. When implemented in a massively-parallel supercomputing structure, the global collective network is physically and logically partitionable according to needs of a processing algorithm.

  13. Global interrupt and barrier networks

    DOE Patents [OSTI]

    Blumrich, Matthias A.; Chen, Dong; Coteus, Paul W.; Gara, Alan G.; Giampapa, Mark E; Heidelberger, Philip; Kopcsay, Gerard V.; Steinmacher-Burow, Burkhard D.; Takken, Todd E.

    2008-10-28

    A system and method for generating global asynchronous signals in a computing structure. Particularly, a global interrupt and barrier network is implemented that implements logic for generating global interrupt and barrier signals for controlling global asynchronous operations performed by processing elements at selected processing nodes of a computing structure in accordance with a processing algorithm; and includes the physical interconnecting of the processing nodes for communicating the global interrupt and barrier signals to the elements via low-latency paths. The global asynchronous signals respectively initiate interrupt and barrier operations at the processing nodes at times selected for optimizing performance of the processing algorithms. In one embodiment, the global interrupt and barrier network is implemented in a scalable, massively parallel supercomputing device structure comprising a plurality of processing nodes interconnected by multiple independent networks, with each node including one or more processing elements for performing computation or communication activity as required when performing parallel algorithm operations. One multiple independent network includes a global tree network for enabling high-speed global tree communications among global tree network nodes or sub-trees thereof. The global interrupt and barrier network may operate in parallel with the global tree network for providing global asynchronous sideband signals.

  14. Efficient implementation of multidimensional fast fourier transform on a distributed-memory parallel multi-node computer

    DOE Patents [OSTI]

    Bhanot, Gyan V.; Chen, Dong; Gara, Alan G.; Giampapa, Mark E.; Heidelberger, Philip; Steinmacher-Burow, Burkhard D.; Vranas, Pavlos M.

    2012-01-10

    The present in invention is directed to a method, system and program storage device for efficiently implementing a multidimensional Fast Fourier Transform (FFT) of a multidimensional array comprising a plurality of elements initially distributed in a multi-node computer system comprising a plurality of nodes in communication over a network, comprising: distributing the plurality of elements of the array in a first dimension across the plurality of nodes of the computer system over the network to facilitate a first one-dimensional FFT; performing the first one-dimensional FFT on the elements of the array distributed at each node in the first dimension; re-distributing the one-dimensional FFT-transformed elements at each node in a second dimension via "all-to-all" distribution in random order across other nodes of the computer system over the network; and performing a second one-dimensional FFT on elements of the array re-distributed at each node in the second dimension, wherein the random order facilitates efficient utilization of the network thereby efficiently implementing the multidimensional FFT. The "all-to-all" re-distribution of array elements is further efficiently implemented in applications other than the multidimensional FFT on the distributed-memory parallel supercomputer.

  15. Efficient implementation of a multidimensional fast fourier transform on a distributed-memory parallel multi-node computer

    DOE Patents [OSTI]

    Bhanot, Gyan V.; Chen, Dong; Gara, Alan G.; Giampapa, Mark E.; Heidelberger, Philip; Steinmacher-Burow, Burkhard D.; Vranas, Pavlos M.

    2008-01-01

    The present in invention is directed to a method, system and program storage device for efficiently implementing a multidimensional Fast Fourier Transform (FFT) of a multidimensional array comprising a plurality of elements initially distributed in a multi-node computer system comprising a plurality of nodes in communication over a network, comprising: distributing the plurality of elements of the array in a first dimension across the plurality of nodes of the computer system over the network to facilitate a first one-dimensional FFT; performing the first one-dimensional FFT on the elements of the array distributed at each node in the first dimension; re-distributing the one-dimensional FFT-transformed elements at each node in a second dimension via "all-to-all" distribution in random order across other nodes of the computer system over the network; and performing a second one-dimensional FFT on elements of the array re-distributed at each node in the second dimension, wherein the random order facilitates efficient utilization of the network thereby efficiently implementing the multidimensional FFT. The "all-to-all" re-distribution of array elements is further efficiently implemented in applications other than the multidimensional FFT on the distributed-memory parallel supercomputer.

  16. The Node Monitoring Component of a Scalable Systems Software Environment

    SciTech Connect (OSTI)

    Samuel James Miller

    2006-08-09

    This research describes Fountain, a suite of programs used to monitor the resources of a cluster. A cluster is a collection of individual computers that are connected via a high speed communication network. They are traditionally used by users who desire more resources, such as processing power and memory, than any single computer can provide. A common drawback to effectively utilizing such a large-scale system is the management infrastructure, which often does not often scale well as the system grows. Large-scale parallel systems provide new research challenges in the area of systems software, the programs or tools that manage the system from boot-up to running a parallel job. The approach presented in this thesis utilizes a collection of separate components that communicate with each other to achieve a common goal. While systems software comprises a broad array of components, this thesis focuses on the design choices for a node monitoring component. We will describe Fountain, an implementation of the Scalable Systems Software (SSS) node monitor specification. It is targeted at aggregate node monitoring for clusters, focusing on both scalability and fault tolerance as its design goals. It leverages widely used technologies such as XML and HTTP to present an interface to other components in the SSS environment.

  17. National Highway Planning Network

    Energy Science and Technology Software Center (OSTI)

    1992-02-02

    NHPN, the National Highway Planning Network, is a database of major highways in the continental United States that is used for national-level analyses of highway transportation issues that require use of a network, such as studies of highway performance, network design, social and environmental impacts of transportation, vehicle routing and scheduling, and mapping. The network is based on a set of roadways digitized by the U. S. Geological Survey (USGS) from the 1980 National Atlasmore » and has been enhanced with additional roads, attribute detail, and topological error corrections to produce a true analytic network. All data have been derived from or checked against information obtained from state and Federal governmental agencies. Two files comprise this network: one describing links and the other nodes. This release, NHPN1.0, contains 44,960 links and 28,512 nodes representing approximately 380,000 miles of roadway.« less

  18. Effect of surface attractive strength on structural transitions of a confined HP lattice protein

    SciTech Connect (OSTI)

    Pattanasiri, Busara; Li, Ying Wai; Wuest, Thomas; Landau, David P

    2015-01-01

    We investigate the influence of surface attractive strength on structural transitions of a hydrophobic-polar (HP) lattice protein confined in a slit formed by two parallel, attractive walls. We apply Wang-Landau sampling together with efficient Monte Carlo updates to estimate the density of states of the system. The conformational transitions, namely, the debridging process and hydrophobic core formation, can be identified by analyzing the specific heat together with several structural observables, such as the numbers of surface contacts, the number of hydrophobic pairs, and radii of gyration in different directions. As temperature decreases, we find that the occurrence of the debridging process is conditional depending on the surface attractive strength. This, in turn, affects the nature of the hydrophobic core formation that takes place at a lower temperature. We illustrate these observations with the aid of a HP protein chain with 48 monomers.

  19. DOEIEV.0005/35 ANL-OHS/HP-83403 FORMERLY UTILIZED MEDIAEC SITES

    Office of Legacy Management (LM)

    p, .' jl&Lj p ' -7 c. .3- 4; .z 1. . . ' 1 DOEIEV.0005/35 ANL-OHS/HP-83403 FORMERLY UTILIZED MEDIAEC SITES REMEDIAL ACTION PROGRAM RADIOLOGICAL SURVEY OF CHEMICALS GROUP, OLIN CORPORATION (Formerly Blockson Chemical Company) JOLIET, ILLINOIS March 27,November 28, 1978 OCCUPATIONAL HEALTH AND SAFETY DIVISION Health Physics Section ARGONNE NATIONAL LABORATORY, ARGONNE, ILLINOIS Operated by THE UNIVERSITY OF CHICAGO for the U. S. DEPARTMENT OF ENERGY under Contract W-31-10%Eng-38 ..__^ --

  20. I stlbjcot; REQUEST H(P1 SPEWAL~GQPA - BIPUCHED WVg.

    Office of Legacy Management (LM)

    JI& 1, 1952 ..: .i I stlbjcot; REQUEST H(P1 SPEWAL~GQPA - BIPUCHED WVg. In-TIlg~FCRU (H' (9) &liRADIATED 'F SLUGS i _ BvergiKortsbotiUbeuadetouo@otatbera~h~kati tbeearliestposalb~dato 60 tbattba.P235ccmberpturnd/ PFW:bjr Distribution: 1.. " ,- 7 !. i Q-s. 1-3 - .4dd.ressw : .I - J. If. kmen, G.E. L .5 - kil &Files/ :

  1. Parameters affecting the resilience of scale-free networks to random failures.

    SciTech Connect (OSTI)

    Link, Hamilton E.; LaViolette, Randall A.; Lane, Terran; Saia, Jared

    2005-09-01

    It is commonly believed that scale-free networks are robust to massive numbers of random node deletions. For example, Cohen et al. in (1) study scale-free networks including some which approximate the measured degree distribution of the Internet. Their results suggest that if each node in this network failed independently with probability 0.99, most of the remaining nodes would still be connected in a giant component. In this paper, we show that a large and important subclass of scale-free networks are not robust to massive numbers of random node deletions. In particular, we study scale-free networks which have minimum node degree of 1 and a power-law degree distribution beginning with nodes of degree 1 (power-law networks). We show that, in a power-law network approximating the Internet's reported distribution, when the probability of deletion of each node is 0.5 only about 25% of the surviving nodes in the network remain connected in a giant component, and the giant component does not persist beyond a critical failure rate of 0.9. The new result is partially due to improved analytical accommodation of the large number of degree-0 nodes that result after node deletions. Our results apply to power-law networks with a wide range of power-law exponents, including Internet-like networks. We give both analytical and empirical evidence that such networks are not generally robust to massive random node deletions.

  2. Microstructural characterization of dissimilar welds between alloy 800 and HP heat-resistant steel

    SciTech Connect (OSTI)

    Dehmolaei, R.; Shamanian, M. Kermanpur, A.

    2008-10-15

    In this study, dissimilar welds between HP heat-resistant steel and Incoloy 800 were made with four different filler materials including: 309 stainless steel and nickel-based Inconel 82, 182 and 617. The microstructure of the base metals, weld metals and their interfaces were characterized by utilizing optical and scanning electron microscopy. Grain boundaries migration in the weld metals was studied. It was found that the migration of grain boundaries in the Inconel 82 weld metal was very extensive. Precipitates of TiC and M{sub 23}C{sub 6} (M = Cr and Mo) in the Inconel 617 weld metal are identified. The necessary conditions for the formation of cracks close to the fusion line of the 309-HP joints are described. Furthermore unmixed zone near the fusion line between HP steel base metal and Inconel 82 weld metal is discussed. An epitaxial growth is characterized at the fusion line of the 309-Alloy 800 and Inconel 617-Alloy 800 joints.

  3. Wang-Landau sampling of the interplay between surface adsorption and folding of HP lattice proteins

    SciTech Connect (OSTI)

    Li, Ying Wai [ORNL] [ORNL; Wuest, Thomas [Swiss Federal Research Institute, Switzerland] [Swiss Federal Research Institute, Switzerland; Landau, David P [University of Georgia, Athens, GA] [University of Georgia, Athens, GA

    2014-01-01

    Generic features associated with the adsorption of proteins on solid surfaces are reviewed within the framework of the hydrophobic-polar (HP) lattice protein model. The thermodynamic behavior and structural properties of various HP protein sequences interacting with attractive surfaces have been studied using extensive Wang-Landau sampling with different types of surfaces, each of which attracts either: all monomers, only hydrophobic (H) monomers, or only polar (P) monomers, respectively. Consequently, different types of folding behavior occur for varied surface strengths. Analysis of the combined patterns of various structural observables, e.g., the derivatives of the numbers of interaction contacts, together with the specific heat, leads to the identification of fundamental categories of folding and transition hierarchies. We also inferred a connection between the transition categories and the relative surface strengths, i.e., the ratios of the surface attractive strengths to the intra-chain attraction among H monomers. We thus believe that the folding hierarchies and identification scheme are generic for different HP sequences interacting with attractive surfaces, regardless of the chain length, sequence, or surface attraction.

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

    DOE Patents [OSTI]

    Archer, Charles J.; Megerian, Mark G.; Ratterman, Joseph D.; Smith, Brian E.

    2010-01-12

    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.

  5. Switch for serial or parallel communication networks

    DOE Patents [OSTI]

    Crosette, D.B.

    1994-07-19

    A communication switch apparatus and a method for use in a geographically extensive serial, parallel or hybrid communication network linking a multi-processor or parallel processing system has a very low software processing overhead in order to accommodate random burst of high density data. Associated with each processor is a communication switch. A data source and a data destination, a sensor suite or robot for example, may also be associated with a switch. The configuration of the switches in the network are coordinated through a master processor node and depends on the operational phase of the multi-processor network: data acquisition, data processing, and data exchange. The master processor node passes information on the state to be assumed by each switch to the processor node associated with the switch. The processor node then operates a series of multi-state switches internal to each communication switch. The communication switch does not parse and interpret communication protocol and message routing information. During a data acquisition phase, the communication switch couples sensors producing data to the processor node associated with the switch, to a downlink destination on the communications network, or to both. It also may couple an uplink data source to its processor node. During the data exchange phase, the switch couples its processor node or an uplink data source to a downlink destination (which may include a processor node or a robot), or couples an uplink source to its processor node and its processor node to a downlink destination. 9 figs.

  6. Switch for serial or parallel communication networks

    DOE Patents [OSTI]

    Crosette, Dario B.

    1994-01-01

    A communication switch apparatus and a method for use in a geographically extensive serial, parallel or hybrid communication network linking a multi-processor or parallel processing system has a very low software processing overhead in order to accommodate random burst of high density data. Associated with each processor is a communication switch. A data source and a data destination, a sensor suite or robot for example, may also be associated with a switch. The configuration of the switches in the network are coordinated through a master processor node and depends on the operational phase of the multi-processor network: data acquisition, data processing, and data exchange. The master processor node passes information on the state to be assumed by each switch to the processor node associated with the switch. The processor node then operates a series of multi-state switches internal to each communication switch. The communication switch does not parse and interpret communication protocol and message routing information. During a data acquisition phase, the communication switch couples sensors producing data to the processor node associated with the switch, to a downlink destination on the communications network, or to both. It also may couple an uplink data source to its processor node. During the data exchange phase, the switch couples its processor node or an uplink data source to a downlink destination (which may include a processor node or a robot), or couples an uplink source to its processor node and its processor node to a downlink destination.

  7. Parallel processing data network of master and slave transputers controlled by a serial control network

    DOE Patents [OSTI]

    Crosetto, Dario B.

    1996-01-01

    The present device provides for a dynamically configurable communication network having a multi-processor parallel processing system having a serial communication network and a high speed parallel communication network. The serial communication network is used to disseminate commands from a master processor (100) to a plurality of slave processors (200) to effect communication protocol, to control transmission of high density data among nodes and to monitor each slave processor's status. The high speed parallel processing network is used to effect the transmission of high density data among nodes in the parallel processing system. Each node comprises a transputer (104), a digital signal processor (114), a parallel transfer controller (106), and two three-port memory devices. A communication switch (108) within each node (100) connects it to a fast parallel hardware channel (70) through which all high density data arrives or leaves the node.

  8. Parallel processing data network of master and slave transputers controlled by a serial control network

    DOE Patents [OSTI]

    Crosetto, D.B.

    1996-12-31

    The present device provides for a dynamically configurable communication network having a multi-processor parallel processing system having a serial communication network and a high speed parallel communication network. The serial communication network is used to disseminate commands from a master processor to a plurality of slave processors to effect communication protocol, to control transmission of high density data among nodes and to monitor each slave processor`s status. The high speed parallel processing network is used to effect the transmission of high density data among nodes in the parallel processing system. Each node comprises a transputer, a digital signal processor, a parallel transfer controller, and two three-port memory devices. A communication switch within each node connects it to a fast parallel hardware channel through which all high density data arrives or leaves the node. 6 figs.

  9. Zone routing in a torus network

    DOE Patents [OSTI]

    Chen, Dong; Heidelberger, Philip; Kumar, Sameer

    2013-01-29

    A system for routing data in a network comprising a network logic device at a sending node for determining a path between the sending node and a receiving node, wherein the network logic device sets one or more selection bits and one or more hint bits within the data packet, a control register for storing one or more masks, wherein the network logic device uses the one or more selection bits to select a mask from the control register and the network logic device applies the selected mask to the hint bits to restrict routing of the data packet to one or more routing directions for the data packet within the network and selects one of the restricted routing directions from the one or more routing directions and sends the data packet along a link in the selected routing direction toward the receiving node.

  10. Signaling completion of a message transfer from an origin compute node to a target compute node

    DOE Patents [OSTI]

    Blocksome, Michael A.; Parker, Jeffrey J.

    2011-05-24

    Signaling completion of a message transfer from an origin node to a target node includes: sending, by an origin DMA engine, an RTS message, the RTS message specifying an application message for transfer to the target node from the origin node; receiving, by the origin DMA engine, a remote get message containing a data descriptor for the message and a completion notification descriptor, the completion notification descriptor specifying a local direct put transfer operation for transferring data locally on the origin node; inserting, by the origin DMA engine in an injection FIFO buffer, the data descriptor followed by the completion notification descriptor; transferring, by the origin DMA engine to the target node, the message in dependence upon the data descriptor; and notifying, by the origin DMA engine, the application that transfer of the message is complete in dependence upon the completion notification descriptor.

  11. Signaling completion of a message transfer from an origin compute node to a target compute node

    DOE Patents [OSTI]

    Blocksome, Michael A.

    2011-02-15

    Signaling completion of a message transfer from an origin node to a target node includes: sending, by an origin DMA engine, an RTS message, the RTS message specifying an application message for transfer to the target node from the origin node; receiving, by the origin DMA engine, a remote get message containing a data descriptor for the message and a completion notification descriptor, the completion notification descriptor specifying a local memory FIFO data transfer operation for transferring data locally on the origin node; inserting, by the origin DMA engine in an injection FIFO buffer, the data descriptor followed by the completion notification descriptor; transferring, by the origin DMA engine to the target node, the message in dependence upon the data descriptor; and notifying, by the origin DMA engine, the application that transfer of the message is complete in dependence upon the completion notification descriptor.

  12. LC Recommendations for Data Transfer Nodes (Technical Report...

    Office of Scientific and Technical Information (OSTI)

    Technical Report: LC Recommendations for Data Transfer Nodes Citation Details In-Document Search Title: LC Recommendations for Data Transfer Nodes Abstract not provided. Authors: ...

  13. FLOP Counts for "Small" Single-Node Miniapplication Tests

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    FLOP Counts for "Small" Single-Node Miniapplication Tests FLOP Counts for "Small" Single-Node Miniapplication Tests These data, obtained using the NERSC Hopper system, are provided...

  14. LC Recommendations for Data Transfer Nodes (Technical Report...

    Office of Scientific and Technical Information (OSTI)

    Technical Report: LC Recommendations for Data Transfer Nodes Citation Details In-Document Search Title: LC Recommendations for Data Transfer Nodes You are accessing a document ...

  15. Dynamically reassigning a connected node to a block of compute nodes for re-launching a failed job

    DOE Patents [OSTI]

    Budnik, Thomas A.; Knudson, Brant L.; Megerian, Mark G.; Miller, Samuel J.; Stockdell, William M.

    2012-03-20

    Methods, systems, and products for dynamically reassigning a connected node to a block of compute nodes for re-launching a failed job that include: identifying that a job failed to execute on the block of compute nodes because connectivity failed between a compute node assigned as at least one of the connected nodes for the block of compute nodes and its supporting I/O node; and re-launching the job, including selecting an alternative connected node that is actively coupled for data communications with an active I/O node; and assigning the alternative connected node as the connected node for the block of compute nodes running the re-launched job.

  16. Line-plane broadcasting in a data communications network of a parallel computer

    DOE Patents [OSTI]

    Archer, Charles J.; Berg, Jeremy E.; Blocksome, Michael A.; Smith, Brian E.

    2010-06-08

    Methods, apparatus, and products are disclosed for line-plane broadcasting in a data communications network of a parallel computer, the parallel computer comprising a plurality of compute nodes connected together through the network, the network optimized for point to point data communications and characterized by at least a first dimension, a second dimension, and a third dimension, that include: initiating, by a broadcasting compute node, a broadcast operation, including sending a message to all of the compute nodes along an axis of the first dimension for the network; sending, by each compute node along the axis of the first dimension, the message to all of the compute nodes along an axis of the second dimension for the network; and sending, by each compute node along the axis of the second dimension, the message to all of the compute nodes along an axis of the third dimension for the network.

  17. Line-plane broadcasting in a data communications network of a parallel computer

    DOE Patents [OSTI]

    Archer, Charles J.; Berg, Jeremy E.; Blocksome, Michael A.; Smith, Brian E.

    2010-11-23

    Methods, apparatus, and products are disclosed for line-plane broadcasting in a data communications network of a parallel computer, the parallel computer comprising a plurality of compute nodes connected together through the network, the network optimized for point to point data communications and characterized by at least a first dimension, a second dimension, and a third dimension, that include: initiating, by a broadcasting compute node, a broadcast operation, including sending a message to all of the compute nodes along an axis of the first dimension for the network; sending, by each compute node along the axis of the first dimension, the message to all of the compute nodes along an axis of the second dimension for the network; and sending, by each compute node along the axis of the second dimension, the message to all of the compute nodes along an axis of the third dimension for the network.

  18. DOEIEV-0005/37 ANL=OHS/HP-83406 FORMERLY UTILIZED MEDIAEC SITES

    Office of Legacy Management (LM)

    //, .<.' I ' 1 TL\ t+, -- DOEIEV-0005/37 ANL=OHS/HP-83406 FORMERLY UTILIZED MEDIAEC SITES REMEDIAL ACTION PROGRAM RADIOLOGICAL SURVEY OF THE FORMER WATERTOWN ARSENAL PROPERTY SITE 34 AND SITE 41 WATERTOWN, MASSACHUSETTS o\o\-0 G /Q e-+ a+ -? q+ mii ' ( . % QL G+ OCCUPATIONAL HEALTH AND SAFETY INViSiON Health Physics Section ARGONNE NATIONAL LABORATORY, ARGONNE, ILLINOIS Operated by THE UNIVERSITY O F CHICAGO for the U. S. DEPARTMENT O F ENERGY under Contract W=314 09.Eng-38 Argonne National

  19. Class network routing

    DOE Patents [OSTI]

    Bhanot, Gyan; Blumrich, Matthias A.; Chen, Dong; Coteus, Paul W.; Gara, Alan G.; Giampapa, Mark E.; Heidelberger, Philip; Steinmacher-Burow, Burkhard D.; Takken, Todd E.; Vranas, Pavlos M.

    2009-09-08

    Class network routing is implemented in a network such as a computer network comprising a plurality of parallel compute processors at nodes thereof. Class network routing allows a compute processor to broadcast a message to a range (one or more) of other compute processors in the computer network, such as processors in a column or a row. Normally this type of operation requires a separate message to be sent to each processor. With class network routing pursuant to the invention, a single message is sufficient, which generally reduces the total number of messages in the network as well as the latency to do a broadcast. Class network routing is also applied to dense matrix inversion algorithms on distributed memory parallel supercomputers with hardware class function (multicast) capability. This is achieved by exploiting the fact that the communication patterns of dense matrix inversion can be served by hardware class functions, which results in faster execution times.

  20. Clock Agreement Among Parallel Supercomputer Nodes

    DOE Data Explorer [Office of Scientific and Technical Information (OSTI)]

    Jones, Terry R.; Koenig, Gregory A.

    This dataset presents measurements that quantify the clock synchronization time-agreement characteristics among several high performance computers including the current world's most powerful machine for open science, the U.S. Department of Energy's Titan machine sited at Oak Ridge National Laboratory. These ultra-fast machines derive much of their computational capability from extreme node counts (over 18000 nodes in the case of the Titan machine). Time-agreement is commonly utilized by parallel programming applications and tools, distributed programming application and tools, and system software. Our time-agreement measurements detail the degree of time variance between nodes and how that variance changes over time. The dataset includes empirical measurements and the accompanying spreadsheets.

  1. Clock Agreement Among Parallel Supercomputer Nodes

    DOE Data Explorer [Office of Scientific and Technical Information (OSTI)]

    Jones, Terry R.; Koenig, Gregory A.

    2014-04-30

    This dataset presents measurements that quantify the clock synchronization time-agreement characteristics among several high performance computers including the current world's most powerful machine for open science, the U.S. Department of Energy's Titan machine sited at Oak Ridge National Laboratory. These ultra-fast machines derive much of their computational capability from extreme node counts (over 18000 nodes in the case of the Titan machine). Time-agreement is commonly utilized by parallel programming applications and tools, distributed programming application and tools, and system software. Our time-agreement measurements detail the degree of time variance between nodes and how that variance changes over time. The dataset includes empirical measurements and the accompanying spreadsheets.

  2. Visual Matrix Clustering of Social Networks

    SciTech Connect (OSTI)

    Wong, Pak C.; Mackey, Patrick S.; Foote, Harlan P.; May, Richard A.

    2013-07-01

    The prevailing choices to graphically represent a social network in todays literature are a node-link graph layout and an adjacency matrix. Both visualization techniques have unique strengths and weaknesses when applied to different domain applications. In this article, we focus our discussion on adjacency matrix and how to turn the matrix-based visualization technique from merely showing pairwise associations among network actors (or graph nodes) to depicting clusters of a social network. We also use node-link layouts to supplement the discussion.

  3. Identifying failure in a tree network of a parallel computer

    DOE Patents [OSTI]

    Archer, Charles J.; Pinnow, Kurt W.; Wallenfelt, Brian P.

    2010-08-24

    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.

  4. Advanced mobile networking, sensing, and controls.

    SciTech Connect (OSTI)

    Feddema, John Todd; Kilman, Dominique Marie; Byrne, Raymond Harry; Young, Joseph G.; Lewis, Christopher L.; Van Leeuwen, Brian P.; Robinett, Rush D. III; Harrington, John J.

    2005-03-01

    This report describes an integrated approach for designing communication, sensing, and control systems for mobile distributed systems. Graph theoretic methods are used to analyze the input/output reachability and structural controllability and observability of a decentralized system. Embedded in each network node, this analysis will automatically reconfigure an ad hoc communication network for the sensing and control task at hand. The graph analysis can also be used to create the optimal communication flow control based upon the spatial distribution of the network nodes. Edge coloring algorithms tell us that the minimum number of time slots in a planar network is equal to either the maximum number of adjacent nodes (or degree) of the undirected graph plus some small number. Therefore, the more spread out that the nodes are, the fewer number of time slots are needed for communication, and the smaller the latency between nodes. In a coupled system, this results in a more responsive sensor network and control system. Network protocols are developed to propagate this information, and distributed algorithms are developed to automatically adjust the number of time slots available for communication. These protocols and algorithms must be extremely efficient and only updated as network nodes move. In addition, queuing theory is used to analyze the delay characteristics of Carrier Sense Multiple Access (CSMA) networks. This report documents the analysis, simulation, and implementation of these algorithms performed under this Laboratory Directed Research and Development (LDRD) effort.

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

    DOE Patents [OSTI]

    Archer, Charles J; Blocksome, Michael A; Ratterman, Joseph D; Smith, Brian E

    2013-10-22

    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.

  6. Local rules for protein folding on a triangular lattice and generalized hydrophobicity in the HP model

    SciTech Connect (OSTI)

    Agarwala, R. [National Institutes of Health, Bethesda, MD (United States); Batzoglou, S. [MIT Lab. for Computer Science, Cambridge, MA (United States); Dancik, V. [Univ. of Southern California, Los Angeles, CA (United States)] [and others

    1997-12-01

    A long standing problem in molecular biology is to determine the three-dimensional structure of a protein, given its amino acid sequence. A variety of simplifying models have been proposed abstracting only the {open_quotes}essential physical properties{close_quotes} of real proteins. In these models, the three dimensional space is often represented by a lattice. Residues which are adjacent in the primary sequence (i.e. covalently linked) must be placed at adjacent points in the lattice. A conformation of a protein is simply a self-avoiding walk along the lattice. The protein folding problem STRING-FOLD is that of finding a conformation of the protein sequence on the lattice such that the overall energy is minimized, for some reasonable definition of energy. This formulation leaves open the choices of a lattice and an energy function. Once these choices are made, one may then address the algorithmic complexity of optimizing the energy function for the lattice. For a variety of such simple models, this minimization problem is in fact NP-hard. In this paper, we consider the Hydrophobic-Polar (HP) Model introduced by Dill. The HP model abstracts the problem by grouping the 20 amino acids into two classes: hydrophobic (or non-polar) residues and hydrophilic (or polar) residues. For concreteness, we will take our input to be a string from (H,P){sup +}, where P represents polar residues, and H represents hydrophobic residues. Dill et.al. survey the literature analyzing this model. 8 refs., 2 figs., 1 tab.

  7. Downhole drilling network using burst modulation techniques

    DOE Patents [OSTI]

    Hall; David R. , Fox; Joe

    2007-04-03

    A downhole drilling system is disclosed in one aspect of the present invention as including a drill string and a transmission line integrated into the drill string. Multiple network nodes are installed at selected intervals along the drill string and are adapted to communicate with one another through the transmission line. In order to efficiently allocate the available bandwidth, the network nodes are configured to use any of numerous burst modulation techniques to transmit data.

  8. Scheduling applications for execution on a plurality of compute nodes of a parallel computer to manage temperature of the nodes during execution

    DOE Patents [OSTI]

    Archer, Charles J; Blocksome, Michael A; Peters, Amanda E; Ratterman, Joseph D; Smith, Brian E

    2012-10-16

    Methods, apparatus, and products are disclosed for scheduling applications for execution on a plurality of compute nodes of a parallel computer to manage temperature of the plurality of compute nodes during execution that include: identifying one or more applications for execution on the plurality of compute nodes; creating a plurality of physically discontiguous node partitions in dependence upon temperature characteristics for the compute nodes and a physical topology for the compute nodes, each discontiguous node partition specifying a collection of physically adjacent compute nodes; and assigning, for each application, that application to one or more of the discontiguous node partitions for execution on the compute nodes specified by the assigned discontiguous node partitions.

  9. Flexible network wireless transceiver and flexible network telemetry transceiver

    DOE Patents [OSTI]

    Brown, Kenneth D.

    2008-08-05

    A transceiver for facilitating two-way wireless communication between a baseband application and other nodes in a wireless network, wherein the transceiver provides baseband communication networking and necessary configuration and control functions along with transmitter, receiver, and antenna functions to enable the wireless communication. More specifically, the transceiver provides a long-range wireless duplex communication node or channel between the baseband application, which is associated with a mobile or fixed space, air, water, or ground vehicle or other platform, and other nodes in the wireless network or grid. The transceiver broadly comprises a communication processor; a flexible telemetry transceiver including a receiver and a transmitter; a power conversion and regulation mechanism; a diplexer; and a phased array antenna system, wherein these various components and certain subcomponents thereof may be separately enclosed and distributable relative to the other components and subcomponents.

  10. System and method for time synchronization in a wireless network

    DOE Patents [OSTI]

    Gonia, Patrick S.; Kolavennu, Soumitri N.; Mahasenan, Arun V.; Budampati, Ramakrishna S.

    2010-03-30

    A system includes multiple wireless nodes forming a cluster in a wireless network, where each wireless node is configured to communicate and exchange data wirelessly based on a clock. One of the wireless nodes is configured to operate as a cluster master. Each of the other wireless nodes is configured to (i) receive time synchronization information from a parent node, (ii) adjust its clock based on the received time synchronization information, and (iii) broadcast time synchronization information based on the time synchronization information received by that wireless node. The time synchronization information received by each of the other wireless nodes is based on time synchronization information provided by the cluster master so that the other wireless nodes substantially synchronize their clocks with the clock of the cluster master.

  11. Thermal network reduction

    SciTech Connect (OSTI)

    Balcomb, J.D.

    1983-01-01

    A method is presented for reducing the number of elements required in a thermal network representation of a building. The method is based on matching the actual building response at two frequencies, the diurnal response and 3-day response. The procedure provides a straightforward methodology for combining all the various materials inside a discrete building zone into a few nodes while retaining a high degree of accuracy in the dynamic response. An example is given showing a comparison between a large network and the reduced network.

  12. Thermal network reduction

    SciTech Connect (OSTI)

    Balcomb, J.D.

    1983-06-01

    A method is presented for reducing the number of elements required in a thermal network representation of a building. The method is based on matching the actual building response at two frequencies, the diurnal response and 3-day response. The procedure provides a straightforward methodology for combining all the various materials inside a discrete building zone into a few nodes while retaining a high degree of accuracy in the dynamic response. An example is given showing a comparison between a large network and the reduced network.

  13. Network Upgrade for the SLC: PEP II Network

    SciTech Connect (OSTI)

    Crane, M.; Call, M.; Clark, S.; Coffman, F.; Himel, T.; Lahey, T.; Miller, E.; Sass, R.; /SLAC

    2011-09-09

    The PEP-II control system required a new network to support the system functions. This network, called CTLnet, is an FDDI/Ethernet based network using only TCP/IP protocols. An upgrade of the SLC Control System micro communications to use TCP/IP and SLCNET would allow all PEP-II control system nodes to use TCP/IP. CTLnet is private and separate from the SLAC public network. Access to nodes and control system functions is provided by multi-homed application servers with connections to both the private CTLnet and the SLAC public network. Monitoring and diagnostics are provided using a dedicated system. Future plans and current status information is included.

  14. Continuum Modeling and Control of Large Nonuniform Wireless Networks via Nonlinear Partial Differential Equations

    DOE Public Access Gateway for Energy & Science Beta (PAGES Beta)

    Zhang, Yang; Chong, Edwin K. P.; Hannig, Jan; Estep, Donald

    2013-01-01

    We inmore » troduce a continuum modeling method to approximate a class of large wireless networks by nonlinear partial differential equations (PDEs). This method is based on the convergence of a sequence of underlying Markov chains of the network indexed by N , the number of nodes in the network. As N goes to infinity, the sequence converges to a continuum limit, which is the solution of a certain nonlinear PDE. We first describe PDE models for networks with uniformly located nodes and then generalize to networks with nonuniformly located, and possibly mobile, nodes. Based on the PDE models, we develop a method to control the transmissions in nonuniform networks so that the continuum limit is invariant under perturbations in node locations. This enables the networks to maintain stable global characteristics in the presence of varying node locations.« less

  15. Dispatching packets on a global combining network of a parallel computer

    DOE Patents [OSTI]

    Almasi, Gheorghe; Archer, Charles J.

    2011-07-19

    Methods, apparatus, and products are disclosed for dispatching packets on a global combining network of a parallel computer comprising a plurality of nodes connected for data communications using the network capable of performing collective operations and point to point operations that include: receiving, by an origin system messaging module on an origin node from an origin application messaging module on the origin node, a storage identifier and an operation identifier, the storage identifier specifying storage containing an application message for transmission to a target node, and the operation identifier specifying a message passing operation; packetizing, by the origin system messaging module, the application message into network packets for transmission to the target node, each network packet specifying the operation identifier and an operation type for the message passing operation specified by the operation identifier; and transmitting, by the origin system messaging module, the network packets to the target node.

  16. Network Maps

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Network Maps Engineering Services The Network Network Maps Network Traffic Volume Historical Network Maps Network Facts & Stats Connected Sites Peering Connections ESnet...

  17. Implementing controlled-unitary operations over the butterfly network

    SciTech Connect (OSTI)

    Soeda, Akihito; Kinjo, Yoshiyuki; Turner, Peter S.; Murao, Mio

    2014-12-04

    We introduce a multiparty quantum computation task over a network in a situation where the capacities of both the quantum and classical communication channels of the network are limited and a bottleneck occurs. Using a resource setting introduced by Hayashi [1], we present an efficient protocol for performing controlled-unitary operations between two input nodes and two output nodes over the butterfly network, one of the most fundamental networks exhibiting the bottleneck problem. This result opens the possibility of developing a theory of quantum network coding for multiparty quantum computation, whereas the conventional network coding only treats multiparty quantum communication.

  18. Method and computer product to increase accuracy of time-based software verification for sensor networks

    DOE Patents [OSTI]

    Foo Kune, Denis; Mahadevan, Karthikeyan

    2011-01-25

    A recursive verification protocol to reduce the time variance due to delays in the network by putting the subject node at most one hop from the verifier node provides for an efficient manner to test wireless sensor nodes. Since the software signatures are time based, recursive testing will give a much cleaner signal for positive verification of the software running on any one node in the sensor network. In this protocol, the main verifier checks its neighbor, who in turn checks its neighbor, and continuing this process until all nodes have been verified. This ensures minimum time delays for the software verification. Should a node fail the test, the software verification downstream is halted until an alternative path (one not including the failed node) is found. Utilizing techniques well known in the art, having a node tested twice, or not at all, can be avoided.

  19. Energy efficient sensor network implementations

    SciTech Connect (OSTI)

    Frigo, Janette R; Raby, Eric Y; Brennan, Sean M; Kulathumani, Vinod; Rosten, Ed; Wolinski, Christophe; Wagner, Charles; Charot, Francois

    2009-01-01

    In this paper, we discuss a low power embedded sensor node architecture we are developing for distributed sensor network systems deployed in a natural environment. In particular, we examine the sensor node for energy efficient processing-at-the-sensor. We analyze the following modes of operation; event detection, sleep(wake-up), data acquisition, data processing modes using low power, high performance embedded technology such as specialized embedded DSP processors and a low power FPGAs at the sensing node. We use compute intensive sensor node applications: an acoustic vehicle classifier (frequency domain analysis) and a video license plate identification application (learning algorithm) as a case study. We report performance and total energy usage for our system implementations and discuss the system architecture design trade offs.

  20. Calculation of Ambient (H*(10)) and Personal (Hp(10)) Dose Equivalent from a 252Cf Neutron Source

    SciTech Connect (OSTI)

    Traub, Richard J.

    2010-03-26

    The purpose of this calculation is to calculate the neutron dose factors for the Sr-Cf-3000 neutron source that is located in the 318 low scatter room (LSR). The dose factors were based on the dose conversion factors published in ICRP-21 Appendix 6, and the Ambient dose equivalent (H*(10)) and Personal dose equivalent (Hp(10)) dose factors published in ICRP Publication 74.

  1. Comparison of properties and microstructures of Trefimetaux and Hycon 3HP{trademark} after neutron irradiation

    SciTech Connect (OSTI)

    Edwards, D.J.; Singh, B.N.; Toft, P.; Eldrup, M.

    1998-09-01

    The precipitation strengthened CuNiBe alloys are among three candidate copper alloys being evaluated for application in the first wall, divertor, and limiter components of ITER. Generally, CuNiBe alloys have higher strength but poorer conductivity compared to CuCrZr and CuAl{sub 2}O{sub 3} alloys. Brush-Wellman Inc. has manufactured an improved version of their Hycon CuNiBe alloy that has higher conductivity while maintaining a reasonable level strength. It is of interest, therefore, to investigate the effect of radiation on the physical and mechanical properties of this alloy. In the present work the authors have investigated the physical and mechanical properties of the Hycon 3HP{trademark} alloy both before and after neutron irradiation and have compared its microstructure and properties with the European CuNiBe candidate alloy manufactured by Trefirmetaux. Tensile specimens of both alloys were irradiated in the DR-3 reactor at Risoe to displacement dose levels up to 0.3 dpa at 100, 250 and 350 C. Both alloys were tensile tested in the unirradiated and irradiated conditions at 100, 250 and 350 C. Both pre- and post-irradiation microstructures of the alloys were investigated in detail using transmission electron microscopy. Fracture surfaces were examined under a scanning electron microscope. Electrical resistivity measurements were made on tensile specimens before and after irradiation; all measurements were made at 23 C. At this point it seems unlikely that CuNiBe alloys can be recommended for applications in neutron environments where the irradiation temperature exceeds 200 C. Applications at temperatures below 200 C might be plausible, but only after careful experiments have determined the dose dependence of the mechanical properties and the effect of sudden temperature excursions on the material to establish the limits on the use of the alloy.

  2. Deadlock-free class routes for collective communications embedded in a multi-dimensional torus network

    SciTech Connect (OSTI)

    Chen, Dong; Eisley, Noel A.; Steinmacher-Burow, Burkhard; Heidelberger, Philip

    2013-01-29

    A computer implemented method and a system for routing data packets in a multi-dimensional computer network. The method comprises routing a data packet among nodes along one dimension towards a root node, each node having input and output communication links, said root node not having any outgoing uplinks, and determining at each node if the data packet has reached a predefined coordinate for the dimension or an edge of the subrectangle for the dimension, and if the data packet has reached the predefined coordinate for the dimension or the edge of the subrectangle for the dimension, determining if the data packet has reached the root node, and if the data packet has not reached the root node, routing the data packet among nodes along another dimension towards the root node.

  3. ALCF Systems 1: On-Node Goals of This Presentation:

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    And compare with that found in commodity HPC hardware. Highlight aspects of the architecture relevant to code optimization. A BGQ node looks like this: Not this: Data Motion,...

  4. Next Generation Natural Gas Vehicle Program Phase I: Clean Air Partners 0.5 g/hp-h NOx Engine Concept; Final Report

    SciTech Connect (OSTI)

    Wong, H. C.

    2003-07-01

    Subcontractor report details work done by Clean Air Partners to develop 0.5 g/hp-h NOx natural gas engine exhaust gas recirculation (EGR) technology for the Next Generation Natural Gas Vehicle Program.

  5. Complexity analysis of pipeline mapping problems in distributed heterogeneous networks

    SciTech Connect (OSTI)

    Lin, Ying; Wu, Qishi; Zhu, Mengxia; Rao, Nageswara S

    2009-04-01

    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

  6. Network support for system initiated checkpoints

    DOE Patents [OSTI]

    Chen, Dong; Heidelberger, Philip

    2013-01-29

    A system, method and computer program product for supporting system initiated checkpoints in parallel computing systems. The system and method generates selective control signals to perform checkpointing of system related data in presence of messaging activity associated with a user application running at the node. The checkpointing is initiated by the system such that checkpoint data of a plurality of network nodes may be obtained even in the presence of user applications running on highly parallel computers that include ongoing user messaging activity.

  7. Impact of electric vehicles on the IEEE 34 node distribution infrastructure

    DOE Public Access Gateway for Energy & Science Beta (PAGES Beta)

    Jiang, Zeming; Shalalfel, Laith; Beshir, Mohammed J.

    2014-10-01

    With the growing penetration of the electric vehicles to our daily life owing to their economic and environmental benefits, there will be both opportunities and challenges to the utilities when adopting plug-in electric vehicles (PEV) to the distribution network. In this study, a thorough analysis based on real-world project is conducted to evaluate the impacts of electric vehicles infrastructure on the grid relating to system load flow, load factor, and voltage stability. IEEE 34 node test feeder was selected and tested along with different case scenarios utilizing the electrical distribution design (EDD) software to find out the potential impacts tomore » the grid.« less

  8. Impact of electric vehicles on the IEEE 34 node distribution infrastructure

    SciTech Connect (OSTI)

    Jiang, Zeming; Shalalfel, Laith; Beshir, Mohammed J.

    2014-10-01

    With the growing penetration of the electric vehicles to our daily life owing to their economic and environmental benefits, there will be both opportunities and challenges to the utilities when adopting plug-in electric vehicles (PEV) to the distribution network. In this study, a thorough analysis based on real-world project is conducted to evaluate the impacts of electric vehicles infrastructure on the grid relating to system load flow, load factor, and voltage stability. IEEE 34 node test feeder was selected and tested along with different case scenarios utilizing the electrical distribution design (EDD) software to find out the potential impacts to the grid.

  9. Multiscale wireless sensor node for impedance-based SHM and low-frequency vibration data acquisition

    SciTech Connect (OSTI)

    Taylor, Stuart G; Farinholt, Kevin M; Park, Gyuhae; Farrar, Charles R; Todd, Michael D

    2009-01-01

    This paper presents recent developments in an extremely compact, wireless impedance sensor node (WID3, Wireless Impedance Device) at Los Alamos National Laboratory for use in impedance-based structural health monitoring (SHM), Sensor diagnostics and low-frequency vibrational data acquisition. The current generation WID3 is equipped with an Analog Devices AD5933 impedance chip that can resolve measurements up to 100 kHz, a frequency range ideal for many SHM applications. An integrated set of multiplexers allows the end user to monitor seven piezoelectric sensors from a single sensor node. The WID3 combines on-board processing using an Atmega1281 microcontroller, data storage using flash memory, wireless communications capabilities, and a series of internal and external triggering options into a single package to realize a truly comprehensive, self-contained wireless active-sensor node for SHM applications. Furthermore, we recently extended the capability of this device by implementing low-frequency analog to digital and digital and analog converters so that the same device can measure structural vibration data. The WID3 requires less than 70 mW of power to operate, and it can operate in various wireless network paradigms. The performance of this miniaturized and portable device is compared to our previous results and its broader capabilities are demonstrated.

  10. Aggregating job exit statuses of a plurality of compute nodes executing a parallel application

    DOE Patents [OSTI]

    Aho, Michael E.; Attinella, John E.; Gooding, Thomas M.; Mundy, Michael B.

    2015-07-21

    Aggregating job exit statuses of a plurality of compute nodes executing a parallel application, including: identifying a subset of compute nodes in the parallel computer to execute the parallel application; selecting one compute node in the subset of compute nodes in the parallel computer as a job leader compute node; initiating execution of the parallel application on the subset of compute nodes; receiving an exit status from each compute node in the subset of compute nodes, where the exit status for each compute node includes information describing execution of some portion of the parallel application by the compute node; aggregating each exit status from each compute node in the subset of compute nodes; and sending an aggregated exit status for the subset of compute nodes in the parallel computer.

  11. Theory of generalized branch and combine clock networks

    SciTech Connect (OSTI)

    El-Amawy, A.; Kulasinghe, P.

    1994-12-31

    In a recent development a new clock distribution scheme, called Branch-and-Combine or BaC, has been introduced. The scheme is the first to guarantee constant skew bound regardless of network size. In this paper we generalize and extend the work on BaC networks. We established some interesting results on clocking paths, node input sequences, node inputs` relative timing, network stability, and skew bound. Furthermore, this study establishes an upper bound on maximum clocking rates for BaC networks which is about double that predicted by earlier studies.

  12. Multi-Node Thermal System Model for Lithium-Ion Battery Packs: Preprint

    SciTech Connect (OSTI)

    Shi, Ying; Smith, Kandler; Wood, Eric; Pesaran, Ahmad

    2015-09-14

    Temperature is one of the main factors that controls the degradation in lithium ion batteries. Accurate knowledge and control of cell temperatures in a pack helps the battery management system (BMS) to maximize cell utilization and ensure pack safety and service life. In a pack with arrays of cells, a cells temperature is not only affected by its own thermal characteristics but also by its neighbors, the cooling system and pack configuration, which increase the noise level and the complexity of cell temperatures prediction. This work proposes to model lithium ion packs thermal behavior using a multi-node thermal network model, which predicts the cell temperatures by zones. The model was parametrized and validated using commercial lithium-ion battery packs. neighbors, the cooling system and pack configuration, which increase the noise level and the complexity of cell temperatures prediction. This work proposes to model lithium ion packs thermal behavior using a multi-node thermal network model, which predicts the cell temperatures by zones. The model was parametrized and validated using commercial lithium-ion battery packs.

  13. Regional Seismic Travel Time Node Get and Set

    Energy Science and Technology Software Center (OSTI)

    2012-10-24

    RSTT_NOGS allows users to easily get and set seismic velocity vs. depth profiles at specified model tessellation nodes. RSTT_NOGS uses the Sandia Seismic Location Baseline Model code that was released under BSD license in 2009.

  14. Measuring the Monitoring User Interactive Experiences on Franklin Interactive Nodes

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Interactive Node Responsiveness Richard Gerber User Services Group National Energy Research Scientific Computing Center Lawrence Berkeley National Laboratory Berkeley, CA June 9, 2008 Introduction Anecdotal reports of slow interactive response on Franklin's login nodes have been documented via comments on the 2007 NERSC User Survey. Users report that sluggish command-line response at times makes it difficult to work. The cause, or causes, of the poor response time is unknown. In an attempt to

  15. Microfluidic ultrasonic particle separators with engineered node locations

    Office of Scientific and Technical Information (OSTI)

    and geometries (Patent) | SciTech Connect ultrasonic particle separators with engineered node locations and geometries Citation Details In-Document Search Title: Microfluidic ultrasonic particle separators with engineered node locations and geometries An ultrasonic microfluidic system includes a separation channel for conveying a sample fluid containing small particles and large particles, flowing substantially parallel, adjacent to a recovery fluid, with which it is in contact. An acoustic

  16. Dirac node arcs in PtSn4

    DOE Public Access Gateway for Energy & Science Beta (PAGES Beta)

    Wu, Yun; Wang, Lin -Lin; Mun, Eundeok; Johnson, D. D.; Mou, Daixiang; Huang, Lunan; Lee, Yongbin; Bud’ko, S. L.; Canfield, P. C.; Kaminski, Adam

    2016-04-04

    In topological quantum materials1,2,3 the conduction and valence bands are connected at points or along lines in the momentum space. A number of studies have demonstrated that several materials are indeed Dirac/Weyl semimetals4,5,6,7,8. However, there is still no experimental confirmation of materials with line nodes, in which the Dirac nodes form closed loops in the momentum space2,3. Here we report the discovery of a novel topological structure—Dirac node arcs—in the ultrahigh magnetoresistive material PtSn4 using laser-based angle-resolved photoemission spectroscopy data and density functional theory calculations. Unlike the closed loops of line nodes, the Dirac node arc structure arises owing tomore » the surface states and resembles the Dirac dispersion in graphene that is extended along a short line in the momentum space. Here, we propose that this reported Dirac node arc structure is a novel topological state that provides an exciting platform for studying the exotic properties of Dirac fermions.« less

  17. Complex network synchronization of chaotic systems with delay coupling

    SciTech Connect (OSTI)

    Theesar, S. Jeeva Sathya Ratnavelu, K.

    2014-03-05

    The study of complex networks enables us to understand the collective behavior of the interconnected elements and provides vast real time applications from biology to laser dynamics. In this paper, synchronization of complex network of chaotic systems has been studied. Every identical node in the complex network is assumed to be in Lur’e system form. In particular, delayed coupling has been assumed along with identical sector bounded nonlinear systems which are interconnected over network topology.

  18. Synchronization in networks of spatially extended systems

    SciTech Connect (OSTI)

    Filatova, Anastasiya E.; Hramov, Alexander E.; Koronovskii, Alexey A.; Boccaletti, Stefano

    2008-06-15

    Synchronization processes in networks of spatially extended dynamical systems are analytically and numerically studied. We focus on the relevant case of networks whose elements (or nodes) are spatially extended dynamical systems, with the nodes being connected with each other by scalar signals. The stability of the synchronous spatio-temporal state for a generic network is analytically assessed by means of an extension of the master stability function approach. We find an excellent agreement between the theoretical predictions and the data obtained by means of numerical calculations. The efficiency and reliability of this method is illustrated numerically with networks of beam-plasma chaotic systems (Pierce diodes). We discuss also how the revealed regularities are expected to take place in other relevant physical and biological circumstances.

  19. Network Activity

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Statistics Network Activity Network Activity PDSF Network Uplinks to NERSC (dual 10 Gbps) NERSC Uplink to ESnet Last edited: 2011-03-31 22:20:59...

  20. Axillary lymph node dose with tangential breast irradiation

    SciTech Connect (OSTI)

    Reed, Daniel R. . E-mail: drreed@u.washington.edu; Lindsley, Skyler Karen; Mann, Gary N.; Austin-Seymour, Mary; Korssjoen, Tammy; Anderson, Benjamin O.; Moe, Roger

    2005-02-01

    Purpose: The advent of sentinel lymph node mapping and biopsy in the staging of breast cancer has resulted in a significant decrease in the extent of axillary nodal surgery. As the extent of axillary surgery decreases, the radiation dose and distribution within the axilla becomes increasingly important for current therapy planning and future analysis of results. This analysis examined the radiation dose distribution delivered to the anatomically defined axillary level I and II lymph node volume and surgically placed axillary clips with conventional tangential breast fields and CT-based three-dimensional (3D) planning. Methods and materials: Fifty consecutive patients with early-stage breast cancer undergoing breast conservation therapy were evaluated. All patients underwent 3D CT-based planning with conventional breast tangential fields designed to encompass the entire breast parenchyma. Using CT-based 3D planning, the dose distribution of the standard tangential breast irradiation fields was examined in relationship to the axillary level I and II lymph node volumes. Axillary level I and II lymph node anatomic volumes were defined by CT and surgical clips placed during complete level I-II lymph node dissection. Axillary level I-II lymph node volume doses were examined on the basis of the prescribed breast radiation dose and 3D dose distribution. Results: All defined breast volumes received {>=}95% of the prescribed dose. By contrast, the 95% isodose line encompassed only an average of 55% (range, 23-87%) of the axillary level I-II lymph node anatomic volume. No patient had complete coverage of the axillary level I-II lymph node region by the 95% isodose line. The mean anatomic axillary level I-II volume was 146.3 cm{sup 3} (range, 83.1-313.0 cm{sup 3}). The mean anatomic axillary level I-II volume encompassed by the 95% isodose line was 84.9 cm{sup 3} (range, 25.1-219.0 cm{sup 3}). The mean 95% isodose coverage of the surgical clip volume was 80%, and the median

  1. Earth System Grid (ESG) Data Node Software Stack

    Energy Science and Technology Software Center (OSTI)

    2009-12-01

    The ESG-CET system consist of two major components: 1) Gateways that support portal services, which serve as interfaces to end-users who can search, discover, and request data and data products, and 2) Data Nodes where the data actually resides. The Data is "published" to the Data Node, which makes the data visible to a Gateway and enables its delivery to end-users. It is expected that Gateways will only be installed by a small number ofmore » centers devoted to serving data (e.g., LLNL/PCMDI, NCAR, GFDL, DADC, DKRZ, ANU, JAMSTEC), whereas it is hoped that most climate modeling centers will install the Data Node software through which they can serve their model output.« less

  2. Microfluidic ultrasonic particle separators with engineered node locations and geometries

    DOE Patents [OSTI]

    Rose, Klint A.; Fisher, Karl A.; Wajda, Douglas A.; Mariella, Jr., Raymond P.; Bailey, Christopher; Dehlinger, Dietrich; Shusteff, Maxim; Jung, Byoungsok; Ness, Kevin D.

    2016-04-26

    An ultrasonic microfluidic system includes a separation channel for conveying a sample fluid containing small particles and large particles, flowing substantially parallel, adjacent to a recovery fluid, with which it is in contact. An acoustic transducer produces an ultrasound standing wave, that generates a pressure field having at least one node of minimum pressure amplitude. An acoustic extension structure is located proximate to said separation channel for positioning said acoustic node off center in said acoustic area and concentrating the large particles in said recovery fluid stream.

  3. Microfluidic ultrasonic particle separators with engineered node locations and geometries

    DOE Patents [OSTI]

    Rose, Klint A; Fisher, Karl A; Wajda, Douglas A; Mariella, Jr., Raymond P; Bailey, Christoppher; Dehlinger, Dietrich; Shusteff, Maxim; Jung, Byoungsok; Ness, Kevin D

    2014-05-20

    An ultrasonic microfluidic system includes a separation channel for conveying a sample fluid containing small particles and large particles, flowing substantially parallel, adjacent to a recovery fluid, with which it is in contact. An acoustic transducer produces an ultrasound standing wave, that generates a pressure field having at least one node of minimum pressure amplitude. An acoustic extension structure is located proximate to said separation channel for positioning said acoustic node off center in said acoustic area and concentrating the large particles in said recovery fluid stream.

  4. Microfluidic ultrasonic particle separators with engineered node locations and geometries

    SciTech Connect (OSTI)

    Rose, Klint A; Fisher, Karl A; Wajda, Douglas A; Mariella, Jr., Raymond P; Bailey, Christopher; Dehlinger, Dietrich; Shusteff, Maxim; Jung, Byoungsok; Ness, Kevin D

    2015-03-31

    An ultrasonic microfluidic system includes a separation channel for conveying a sample fluid containing small particles and large particles, flowing substantially parallel, adjacent to a recovery fluid, with which it is in contact. An acoustic transducer produces an ultrasound standing wave, that generates a pressure field having at least one node of minimum, pressure amplitude. An acoustic extension structure is located proximate to said separation channel for positioning said acoustic node off center in said acoustic area and concentrating the large particles in said recovery fluid stream.

  5. Performing an allreduce operation on a plurality of compute nodes of a parallel computer

    DOE Patents [OSTI]

    Faraj, Ahmad

    2013-02-12

    Methods, apparatus, and products are disclosed for performing an allreduce operation on a plurality of compute nodes of a parallel computer, each node including at least two processing cores, that include: performing, for each node, a local reduction operation using allreduce contribution data for the cores of that node, yielding, for each node, a local reduction result for one or more representative cores for that node; establishing one or more logical rings among the nodes, each logical ring including only one of the representative cores from each node; performing, for each logical ring, a global allreduce operation using the local reduction result for the representative cores included in that logical ring, yielding a global allreduce result for each representative core included in that logical ring; and performing, for each node, a local broadcast operation using the global allreduce results for each representative core on that node.

  6. Performing an allreduce operation on a plurality of compute nodes of a parallel computer

    DOE Patents [OSTI]

    Faraj, Ahmad

    2013-07-09

    Methods, apparatus, and products are disclosed for performing an allreduce operation on a plurality of compute nodes of a parallel computer, each node including at least two processing cores, that include: establishing, for each node, a plurality of logical rings, each ring including a different set of at least one core on that node, each ring including the cores on at least two of the nodes; iteratively for each node: assigning each core of that node to one of the rings established for that node to which the core has not previously been assigned, and performing, for each ring for that node, a global allreduce operation using contribution data for the cores assigned to that ring or any global allreduce results from previous global allreduce operations, yielding current global allreduce results for each core; and performing, for each node, a local allreduce operation using the global allreduce results.

  7. Towards A Network-of-Networks Framework for Cyber Security

    SciTech Connect (OSTI)

    Halappanavar, Mahantesh; Choudhury, Sutanay; Hogan, Emilie A.; Hui, Peter SY; Johnson, John R.; Ray, Indrajit; Holder, Lawrence B.

    2013-06-07

    Networks-of-networks (NoN) is a graph-theoretic model of interdependent networks that have distinct dynamics at each network (layer). By adding special edges to represent relationships between nodes in different layers, NoN provides a unified mechanism to study interdependent systems intertwined in a complex relationship. While NoN based models have been proposed for cyber-physical systems, in this paper we build towards a three-layer NoN model for an enterprise cyber system. Each layer captures a different facet of a cyber system. We then discuss the potential benefits of graph-theoretic analysis enabled from such a model. Our goal is to provide a novel and powerful tool for modeling and analyzing problems in cyber security.

  8. Soft-core processor study for node-based architectures.

    SciTech Connect (OSTI)

    Van Houten, Jonathan Roger; Jarosz, Jason P.; Welch, Benjamin James; Gallegos, Daniel E.; Learn, Mark Walter

    2008-09-01

    Node-based architecture (NBA) designs for future satellite projects hold the promise of decreasing system development time and costs, size, weight, and power and positioning the laboratory to address other emerging mission opportunities quickly. Reconfigurable Field Programmable Gate Array (FPGA) based modules will comprise the core of several of the NBA nodes. Microprocessing capabilities will be necessary with varying degrees of mission-specific performance requirements on these nodes. To enable the flexibility of these reconfigurable nodes, it is advantageous to incorporate the microprocessor into the FPGA itself, either as a hardcore processor built into the FPGA or as a soft-core processor built out of FPGA elements. This document describes the evaluation of three reconfigurable FPGA based processors for use in future NBA systems--two soft cores (MicroBlaze and non-fault-tolerant LEON) and one hard core (PowerPC 405). Two standard performance benchmark applications were developed for each processor. The first, Dhrystone, is a fixed-point operation metric. The second, Whetstone, is a floating-point operation metric. Several trials were run at varying code locations, loop counts, processor speeds, and cache configurations. FPGA resource utilization was recorded for each configuration. Cache configurations impacted the results greatly; for optimal processor efficiency it is necessary to enable caches on the processors. Processor caches carry a penalty; cache error mitigation is necessary when operating in a radiation environment.

  9. Anomaly Detection in Dynamic Networks

    SciTech Connect (OSTI)

    Turcotte, Melissa

    2014-10-14

    Anomaly detection in dynamic communication networks has many important security applications. These networks can be extremely large and so detecting any changes in their structure can be computationally challenging; hence, computationally fast, parallelisable methods for monitoring the network are paramount. For this reason the methods presented here use independent node and edge based models to detect locally anomalous substructures within communication networks. As a first stage, the aim is to detect changes in the data streams arising from node or edge communications. Throughout the thesis simple, conjugate Bayesian models for counting processes are used to model these data streams. A second stage of analysis can then be performed on a much reduced subset of the network comprising nodes and edges which have been identified as potentially anomalous in the first stage. The first method assumes communications in a network arise from an inhomogeneous Poisson process with piecewise constant intensity. Anomaly detection is then treated as a changepoint problem on the intensities. The changepoint model is extended to incorporate seasonal behavior inherent in communication networks. This seasonal behavior is also viewed as a changepoint problem acting on a piecewise constant Poisson process. In a static time frame, inference is made on this extended model via a Gibbs sampling strategy. In a sequential time frame, where the data arrive as a stream, a novel, fast Sequential Monte Carlo (SMC) algorithm is introduced to sample from the sequence of posterior distributions of the change points over time. A second method is considered for monitoring communications in a large scale computer network. The usage patterns in these types of networks are very bursty in nature and don’t fit a Poisson process model. For tractable inference, discrete time models are considered, where the data are aggregated into discrete time periods and probability models are fitted to the

  10. SRC burn test in 700-hp oil-designed boiler. Volume 1. Integrated report. Final technical report

    SciTech Connect (OSTI)

    Not Available

    1983-09-01

    This burn test program was conducted during the period of August 1982 to February 1983 to demonstrate that Solvent Refined Coal (SRC) products can displace petroleum as a boiler fuel in oil- and gas-designed boilers. The test program was performed at the U.S. Department of Energy's Pittsburgh Energy Technology Center (PETC). Three forms of SRC (pulverized SRC, a solution of SRC dissolved in process-derived distillates, and a slurry of SRC and water) and No. 6 Fuel Oil were evaluated in the 700-hp (30 x 10/sup 6/ Btu/hour) watertube, oil-designed boiler facility at PETC. The test program was managed by the International Coal Refining Company (ICRC) and sponsored by the Department of Energy. Other organizations were involved as necessary to provide the expertise required to execute the test program. This final report represents an integrated overview of the test program conducted at PETC. More detailed information with preliminary data can be obtained from separate reports prepared by PETC, Southern Research Institute, Wheelabrator-Frye, Babcock and Wilcox, and Combustion Engineering. These are presented as Annex Volumes A-F. 25 references, 41 figures, 15 tables.

  11. Implementing asyncronous collective operations in a multi-node processing system

    SciTech Connect (OSTI)

    Chen, Dong; Eisley, Noel A.; Heidelberger, Philip; Kumar, Sameer; Salapura, Valentina; Steinmacher-Burow, Burkhard

    2014-07-08

    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.

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

    SciTech Connect (OSTI)

    Blocksome, Michael A

    2015-02-17

    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.

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

    DOE Patents [OSTI]

    Archer, Charles J.; Blocksome, Michael A.; Peters, Amanda E.; Ratterman, Joseph D.; Smith, Brian E.

    2012-04-17

    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.

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

    DOE Patents [OSTI]

    Archer, Charles J.; Blocksome, Michael A.; Peters, Amanda A.; Ratterman, Joseph D.; Smith, Brian E.

    2012-01-10

    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.

  15. Network for minimizing current imbalances in a faradaic battery

    DOE Patents [OSTI]

    Wozniak, Walter; Haskins, Harold J.

    1994-01-01

    A circuit for connecting a faradaic battery with circuitry for monitoring the condition of the battery includes a plurality of voltage divider networks providing battery voltage monitoring nodes and includes compensating resistors connected with the networks to maintain uniform discharge currents through the cells of the battery. The circuit also provides a reduced common mode voltage requirement for the monitoring circuitry by referencing the divider networks to one-half the battery voltage.

  16. Microstructure evolution during service exposure of two cast, heat-resisting stainless steels - HP-Nb modified and 20-32Nb

    SciTech Connect (OSTI)

    Shi, S. Lippold, J.C.

    2008-08-15

    The repair weldability of two types of heat-resistant austenitic stainless steel castings, HP-Nb modified alloys and 20-32Nb alloys, has been evaluated after extended service exposure of these materials at temperatures on the order of 815 deg. C (1500 deg. F). The initial part of this investigation has focused on characterization of the microstructure of these alloys after service exposure times of up to 12 years. Microstructure evolution from the as-cast condition to the service-exposed condition is described. In the as-cast condition, both eutectic NbC and Cr-rich M{sub 7}C{sub 3} carbides were observed in the HP-Nb alloys. In contrast, only eutectic NbC carbides were present in the as-cast 20-32Nb alloys due to a significantly higher atomic ratio of Nb/C as compared to the HP-Nb alloys. In the service-exposed condition, an Ni-Nb silicide and Cr-rich M{sub 23}C{sub 6} were identified in both alloys. The HP-Nb alloys exhibited a much higher total volume fraction of microconstituents than the 20-32Nb alloys and the M{sub 23}C{sub 6} phase was more prevalent than Ni-Nb silicide. In contrast, the Ni-Nb silicide was dominant in the service-exposed 20-32Nb alloys. This difference resulted in a significant increase in the repair welding liquation cracking susceptibility of the 20-32Nb service-exposed alloy.

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

    DOE Patents [OSTI]

    Gooding, Thomas Michael; McCarthy, Patrick Joseph

    2010-03-02

    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.

  18. Hybrid function projective synchronization in complex dynamical networks

    SciTech Connect (OSTI)

    Wei, Qiang; Wang, Xing-yuan, E-mail: wangxy@dlut.edu.cn; Hu, Xiao-peng [Faculty of Electronic Information and Electrical Engineering, Dalian University of Technology, Dalian, 116024 (China)] [Faculty of Electronic Information and Electrical Engineering, Dalian University of Technology, Dalian, 116024 (China)

    2014-02-15

    This paper investigates hybrid function projective synchronization in complex dynamical networks. When the complex dynamical networks could be synchronized up to an equilibrium or periodic orbit, a hybrid feedback controller is designed to realize the different component of vector of node could be synchronized up to different desired scaling function in complex dynamical networks with time delay. Hybrid function projective synchronization (HFPS) in complex dynamical networks with constant delay and HFPS in complex dynamical networks with time-varying coupling delay are researched, respectively. Finally, the numerical simulations show the effectiveness of theoretical analysis.

  19. GM WW HP

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Killer Micros ii: The sofTware sTriKes BacK Burton Smith Technical Fellow Developer Productivity Luncheon, November 15, 2007 BurTon sMiTh Technical fellow eXTreMe coMPuTinG GrouP...

  20. Identifying logical planes formed of compute nodes of a subcommunicator in a parallel computer

    DOE Patents [OSTI]

    Davis, Kristan D.; Faraj, Daniel A.

    2016-03-01

    In a parallel computer, a plurality of logical planes formed of compute nodes of a subcommunicator may be identified by: for each compute node of the subcommunicator and for a number of dimensions beginning with a first dimension: establishing, by a plane building node, in a positive direction of the first dimension, all logical planes that include the plane building node and compute nodes of the subcommunicator in a positive direction of a second dimension, where the second dimension is orthogonal to the first dimension; and establishing, by the plane building node, in a negative direction of the first dimension, all logical planes that include the plane building node and compute nodes of the subcommunicator in the positive direction of the second dimension.

  1. The Network

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Network Engineering Services The Network Network Maps Network Facts & Stats Connected Sites Peering Connections ESnet Site Availabiliy OSCARS Fasterdata IPv6 Network Network Performance Tools The ESnet Engineering Team Contact Us Technical Assistance: 1 800-33-ESnet (Inside US) 1 800-333-7638 (Inside US) 1 510-486-7600 (Globally) 1 510-486-7607 (Globally) Report Network Problems: trouble@es.net Provide Web Site Feedback: info@es.net The Network A Nationwide Platform for Science Discovery The

  2. Reducing power consumption while performing collective operations on a plurality of compute nodes

    DOE Patents [OSTI]

    Archer, Charles J.; Blocksome, Michael A.; Peters, Amanda E.; Ratterman, Joseph D.; Smith, Brian E.

    2011-10-18

    Methods, apparatus, and products are disclosed for reducing power consumption while performing collective operations on a plurality of compute nodes that include: receiving, by each compute node, instructions to perform a type of collective operation; selecting, by each compute node from a plurality of collective operations for the collective operation type, a particular collective operation in dependence upon power consumption characteristics for each of the plurality of collective operations; and executing, by each compute node, the selected collective operation.

  3. Reducing power consumption during execution of an application on a plurality of compute nodes

    DOE Patents [OSTI]

    Archer, Charles J.; Blocksome, Michael A.; Peters, Amanda E.; Ratterman, Joseph D.; Smith, Brian E.

    2012-06-05

    Methods, apparatus, and products are disclosed for reducing power consumption during execution of an application on a plurality of compute nodes that include: executing, by each compute node, an application, the application including power consumption directives corresponding to one or more portions of the application; identifying, by each compute node, the power consumption directives included within the application during execution of the portions of the application corresponding to those identified power consumption directives; and reducing power, by each compute node, to one or more components of that compute node according to the identified power consumption directives during execution of the portions of the application corresponding to those identified power consumption directives.

  4. Profiling an application for power consumption during execution on a plurality of compute nodes

    DOE Patents [OSTI]

    Archer, Charles J.; Blocksome, Michael A.; Peters, Amanda E.; Ratterman, Joseph D.; Smith, Brian E.

    2012-08-21

    Methods, apparatus, and products are disclosed for profiling an application for power consumption during execution on a compute node that include: receiving an application for execution on a compute node; identifying a hardware power consumption profile for the compute node, the hardware power consumption profile specifying power consumption for compute node hardware during performance of various processing operations; determining a power consumption profile for the application in dependence upon the application and the hardware power consumption profile for the compute node; and reporting the power consumption profile for the application.

  5. Profiling an application for power consumption during execution on a compute node

    DOE Patents [OSTI]

    Archer, Charles J; Blocksome, Michael A; Peters, Amanda E; Ratterman, Joseph D; Smith, Brian E

    2013-09-17

    Methods, apparatus, and products are disclosed for profiling an application for power consumption during execution on a compute node that include: receiving an application for execution on a compute node; identifying a hardware power consumption profile for the compute node, the hardware power consumption profile specifying power consumption for compute node hardware during performance of various processing operations; determining a power consumption profile for the application in dependence upon the application and the hardware power consumption profile for the compute node; and reporting the power consumption profile for the application.

  6. Voltage Control Devices on the IEEE 8500 Node Test Feeder

    SciTech Connect (OSTI)

    Schneider, Kevin P.; Fuller, Jason C.

    2010-01-06

    The IEEE Test Cases provide researchers with distribution system models that can be used to validate new analytic methods. The newest of these models is the 8500-node test feeder which contains multiple devices for voltage control. In addition to a substation regulator there are multiple inline regulators as well as capacitor banks. This paper will discuss the detail in which voltage control devises should be modeled when examining large distribution systems. This discussion will include issues associated with power flow analysis for a single time step as well as for time series analysis.

  7. Pacing a data transfer operation between compute nodes on a parallel computer

    DOE Patents [OSTI]

    Blocksome, Michael A.

    2011-09-13

    Methods, systems, and products are disclosed for pacing a data transfer between compute nodes on a parallel computer that include: transferring, by an origin compute node, a chunk of an application message to a target compute node; sending, by the origin compute node, a pacing request to a target direct memory access (`DMA`) engine on the target compute node using a remote get DMA operation; determining, by the origin compute node, whether a pacing response to the pacing request has been received from the target DMA engine; and transferring, by the origin compute node, a next chunk of the application message if the pacing response to the pacing request has been received from the target DMA engine.

  8. Performing an allreduce operation on a plurality of compute nodes of a parallel computer

    DOE Patents [OSTI]

    Faraj, Ahmad

    2012-04-17

    Methods, apparatus, and products are disclosed for performing an allreduce operation on a plurality of compute nodes of a parallel computer. Each compute node includes at least two processing cores. Each processing core has contribution data for the allreduce operation. Performing an allreduce operation on a plurality of compute nodes of a parallel computer includes: establishing one or more logical rings among the compute nodes, each logical ring including at least one processing core from each compute node; performing, for each logical ring, a global allreduce operation using the contribution data for the processing cores included in that logical ring, yielding a global allreduce result for each processing core included in that logical ring; and performing, for each compute node, a local allreduce operation using the global allreduce results for each processing core on that compute node.

  9. Low latency, high bandwidth data communications between compute nodes in a parallel computer

    DOE Patents [OSTI]

    Blocksome, Michael A

    2014-04-01

    Methods, systems, and products are disclosed for data transfers between nodes in a parallel computer that include: receiving, by an origin DMA on an origin node, a buffer identifier for a buffer containing data for transfer to a target node; sending, by the origin DMA to the target node, a RTS message; transferring, by the origin DMA, a data portion to the target node using a memory FIFO operation that specifies one end of the buffer from which to begin transferring the data; receiving, by the origin DMA, an acknowledgement of the RTS message from the target node; and transferring, by the origin DMA in response to receiving the acknowledgement, any remaining data portion to the target node using a direct put operation that specifies the other end of the buffer from which to begin transferring the data, including initiating the direct put operation without invoking an origin processing core.

  10. Low latency, high bandwidth data communications between compute nodes in a parallel computer

    DOE Patents [OSTI]

    Blocksome, Michael A

    2013-07-02

    Methods, systems, and products are disclosed for data transfers between nodes in a parallel computer that include: receiving, by an origin DMA on an origin node, a buffer identifier for a buffer containing data for transfer to a target node; sending, by the origin DMA to the target node, a RTS message; transferring, by the origin DMA, a data portion to the target node using a memory FIFO operation that specifies one end of the buffer from which to begin transferring the data; receiving, by the origin DMA, an acknowledgement of the RTS message from the target node; and transferring, by the origin DMA in response to receiving the acknowledgement, any remaining data portion to the target node using a direct put operation that specifies the other end of the buffer from which to begin transferring the data, including initiating the direct put operation without invoking an origin processing core.

  11. Chaining direct memory access data transfer operations for compute nodes in a parallel computer

    DOE Patents [OSTI]

    Archer, Charles J.; Blocksome, Michael A.

    2010-09-28

    Methods, systems, and products are disclosed for chaining DMA data transfer operations for compute nodes in a parallel computer that include: receiving, by an origin DMA engine on an origin node in an origin injection FIFO buffer for the origin DMA engine, a RGET data descriptor specifying a DMA transfer operation data descriptor on the origin node and a second RGET data descriptor on the origin node, the second RGET data descriptor specifying a target RGET data descriptor on the target node, the target RGET data descriptor specifying an additional DMA transfer operation data descriptor on the origin node; creating, by the origin DMA engine, an RGET packet in dependence upon the RGET data descriptor, the RGET packet containing the DMA transfer operation data descriptor and the second RGET data descriptor; and transferring, by the origin DMA engine to a target DMA engine on the target node, the RGET packet.

  12. Low latency, high bandwidth data communications between compute nodes in a parallel computer

    DOE Patents [OSTI]

    Blocksome, Michael A

    2014-04-22

    Methods, systems, and products are disclosed for data transfers between nodes in a parallel computer that include: receiving, by an origin DMA on an origin node, a buffer identifier for a buffer containing data for transfer to a target node; sending, by the origin DMA to the target node, a RTS message; transferring, by the origin DMA, a data portion to the target node using a memory FIFO operation that specifies one end of the buffer from which to begin transferring the data; receiving, by the origin DMA, an acknowledgement of the RTS message from the target node; and transferring, by the origin DMA in response to receiving the acknowledgement, any remaining data portion to the target node using a direct put operation that specifies the other end of the buffer from which to begin transferring the data, including initiating the direct put operation without invoking an origin processing core.

  13. Providing Runtime Clock Synchronization With Minimal Node-to-Node Time Deviation on XT4s and XT5s

    SciTech Connect (OSTI)

    Jones, Terry R; Koenig, Gregory A

    2011-01-01

    We present a new high precision clock synchronization algorithm designed for large XT4 and XT5 leadership-class machines. The algorithm, which is designed to support OS noise reduction through co-scheduling, is suitable for usage cases requiring low overhead and minimal time deviation between nodes. Unlike most high-precision algorithms which reach their precision in a post-mortem analysis after the application has completed, the new ORNL developed algorithm rapidly provides precise results during runtime. Previous to our work, the leading high-precision clock synchronization algorithms that made results available during runtime relied on probabilistic schemes that are not guaranteed to result in an answer.

  14. Cross-linked structure of network evolution

    SciTech Connect (OSTI)

    Bassett, Danielle S.; Wymbs, Nicholas F.; Grafton, Scott T.; Porter, Mason A.; Mucha, Peter J.

    2014-03-15

    We study the temporal co-variation of network co-evolution via the cross-link structure of networks, for which we take advantage of the formalism of hypergraphs to map cross-link structures back to network nodes. We investigate two sets of temporal network data in detail. In a network of coupled nonlinear oscillators, hyperedges that consist of network edges with temporally co-varying weights uncover the driving co-evolution patterns of edge weight dynamics both within and between oscillator communities. In the human brain, networks that represent temporal changes in brain activity during learning exhibit early co-evolution that then settles down with practice. Subsequent decreases in hyperedge size are consistent with emergence of an autonomous subgraph whose dynamics no longer depends on other parts of the network. Our results on real and synthetic networks give a poignant demonstration of the ability of cross-link structure to uncover unexpected co-evolution attributes in both real and synthetic dynamical systems. This, in turn, illustrates the utility of analyzing cross-links for investigating the structure of temporal networks.

  15. Resilience of complex networks to random breakdown

    SciTech Connect (OSTI)

    Paul, Gerald; Sreenivasan, Sameet; Stanley, H. Eugene

    2005-11-01

    Using Monte Carlo simulations we calculate f{sub c}, the fraction of nodes that are randomly removed before global connectivity is lost, for networks with scale-free and bimodal degree distributions. Our results differ from the results predicted by an equation for f{sub c} proposed by Cohen et al. We discuss the reasons for this disagreement and clarify the domain for which the proposed equation is valid.

  16. Position estimation of transceivers in communication networks

    DOE Patents [OSTI]

    Kent, Claudia A.; Dowla, Farid

    2008-06-03

    This invention provides a system and method using wireless communication interfaces coupled with statistical processing of time-of-flight data to locate by position estimation unknown wireless receivers. Such an invention can be applied in sensor network applications, such as environmental monitoring of water in the soil or chemicals in the air where the position of the network nodes is deemed critical. Moreover, the present invention can be arranged to operate in areas where a Global Positioning System (GPS) is not available, such as inside buildings, caves, and tunnels.

  17. Multilevel method for modeling large-scale networks.

    SciTech Connect (OSTI)

    Safro, I. M.

    2012-02-24

    Understanding the behavior of real complex networks is of great theoretical and practical significance. It includes developing accurate artificial models whose topological properties are similar to the real networks, generating the artificial networks at different scales under special conditions, investigating a network dynamics, reconstructing missing data, predicting network response, detecting anomalies and other tasks. Network generation, reconstruction, and prediction of its future topology are central issues of this field. In this project, we address the questions related to the understanding of the network modeling, investigating its structure and properties, and generating artificial networks. Most of the modern network generation methods are based either on various random graph models (reinforced by a set of properties such as power law distribution of node degrees, graph diameter, and number of triangles) or on the principle of replicating an existing model with elements of randomization such as R-MAT generator and Kronecker product modeling. Hierarchical models operate at different levels of network hierarchy but with the same finest elements of the network. However, in many cases the methods that include randomization and replication elements on the finest relationships between network nodes and modeling that addresses the problem of preserving a set of simplified properties do not fit accurately enough the real networks. Among the unsatisfactory features are numerically inadequate results, non-stability of algorithms on real (artificial) data, that have been tested on artificial (real) data, and incorrect behavior at different scales. One reason is that randomization and replication of existing structures can create conflicts between fine and coarse scales of the real network geometry. Moreover, the randomization and satisfying of some attribute at the same time can abolish those topological attributes that have been undefined or hidden from

  18. Method for adding nodes to a quantum key distribution system

    DOE Patents [OSTI]

    Grice, Warren P

    2015-02-24

    An improved quantum key distribution (QKD) system and method are provided. The system and method introduce new clients at intermediate points along a quantum channel, where any two clients can establish a secret key without the need for a secret meeting between the clients. The new clients perform operations on photons as they pass through nodes in the quantum channel, and participate in a non-secret protocol that is amended to include the new clients. The system and method significantly increase the number of clients that can be supported by a conventional QKD system, with only a modest increase in cost. The system and method are compatible with a variety of QKD schemes, including polarization, time-bin, continuous variable and entanglement QKD.

  19. Synthesis, structure refinement at 296 K and physico-chemical characterizations of KMnHP{sub 3}O{sub 10}

    SciTech Connect (OSTI)

    Mechergui, J.; Belam, W.

    2008-12-01

    Potassium manganese(III) monohydrogentriphosphate KMnHP{sub 3}O{sub 10} was synthesized by flux method and characterized by single-crystal X-ray diffraction, crystallizes in the monoclinic system with centric space group C2/c. The parameters of the unit cell are a = 12.104(1), b = 8.287(1). c = 9.150(1) A, {beta} = 110.97(1) deg. and Z = 4. The structure was solved at 296 K using 893 independent reflections and refined until R(F) = 0.022; wR(F{sup 2}) = 0.045. The atomic arrangement of the title compound consists of MnO{sub 6} octahedra linked by hydrogentriphosphate anions to form a three-dimensional framework containing tunnels parallel to the c-axis where the K{sup +} cations are inserted. The structure of KMnHP{sub 3}O{sub 10} contains a single Mn site which is surrounded by typical Jahn-Teller [2 + 2 + 2] distorted octahedron. The title material has been also characterized by different physico-chemical techniques: powder X-ray diffraction, IR, NMR and CI spectroscopies and DTA-TGA-DSC thermal analysis.

  20. Criteria for stochastic pinning control of networks of chaotic maps

    SciTech Connect (OSTI)

    Mwaffo, Violet; Porfiri, Maurizio; DeLellis, Pietro

    2014-03-15

    This paper investigates the controllability of discrete-time networks of coupled chaotic maps through stochastic pinning. In this control scheme, the network dynamics are steered towards a desired trajectory through a feedback control input that is applied stochastically to the network nodes. The network controllability is studied by analyzing the local mean square stability of the error dynamics with respect to the desired trajectory. Through the analysis of the spectral properties of salient matrices, a toolbox of conditions for controllability are obtained, in terms of the dynamics of the individual maps, algebraic properties of the network, and the probability distribution of the pinning control. We demonstrate the use of these conditions in the design of a stochastic pinning control strategy for networks of Chirikov standard maps. To elucidate the applicability of the approach, we consider different network topologies and compare five different stochastic pinning strategies through extensive numerical simulations.

  1. Dynamics on modular networks with heterogeneous correlations

    SciTech Connect (OSTI)

    Melnik, Sergey; Oxford Centre for Industrial and Applied Mathematics, Mathematical Institute, University of Oxford, Oxford OX2 6GG; CABDyN Complexity Centre, University of Oxford, Oxford OX1 1HP ; Porter, Mason A.; CABDyN Complexity Centre, University of Oxford, Oxford OX1 1HP ; Mucha, Peter J.; Institute for Advanced Materials, Nanoscience and Technology, University of North Carolina, Chapel Hill, North Carolina 27599-3216 ; Gleeson, James P.

    2014-06-15

    We develop a new ensemble of modular random graphs in which degree-degree correlations can be different in each module, and the inter-module connections are defined by the joint degree-degree distribution of nodes for each pair of modules. We present an analytical approach that allows one to analyze several types of binary dynamics operating on such networks, and we illustrate our approach using bond percolation, site percolation, and the Watts threshold model. The new network ensemble generalizes existing models (e.g., the well-known configuration model and Lancichinetti-Fortunato-Radicchi networks) by allowing a heterogeneous distribution of degree-degree correlations across modules, which is important for the consideration of nonidentical interacting networks.

  2. Budget-based power consumption for application execution on a plurality of compute nodes

    DOE Patents [OSTI]

    Archer, Charles J; Blocksome, Michael A; Peters, Amanda E; Ratterman, Joseph D; Smith, Brian E

    2013-02-05

    Methods, apparatus, and products are disclosed for budget-based power consumption for application execution on a plurality of compute nodes that include: assigning an execution priority to each of one or more applications; executing, on the plurality of compute nodes, the applications according to the execution priorities assigned to the applications at an initial power level provided to the compute nodes until a predetermined power consumption threshold is reached; and applying, upon reaching the predetermined power consumption threshold, one or more power conservation actions to reduce power consumption of the plurality of compute nodes during execution of the applications.

  3. Budget-based power consumption for application execution on a plurality of compute nodes

    DOE Patents [OSTI]

    Archer, Charles J; Inglett, Todd A; Ratterman, Joseph D

    2012-10-23

    Methods, apparatus, and products are disclosed for budget-based power consumption for application execution on a plurality of compute nodes that include: assigning an execution priority to each of one or more applications; executing, on the plurality of compute nodes, the applications according to the execution priorities assigned to the applications at an initial power level provided to the compute nodes until a predetermined power consumption threshold is reached; and applying, upon reaching the predetermined power consumption threshold, one or more power conservation actions to reduce power consumption of the plurality of compute nodes during execution of the applications.

  4. Modeling Temporal Behavior in Large Networks: A Dynamic Mixed-Membership Model

    SciTech Connect (OSTI)

    Rossi, R; Gallagher, B; Neville, J; Henderson, K

    2011-11-11

    Given a large time-evolving network, how can we model and characterize the temporal behaviors of individual nodes (and network states)? How can we model the behavioral transition patterns of nodes? We propose a temporal behavior model that captures the 'roles' of nodes in the graph and how they evolve over time. The proposed dynamic behavioral mixed-membership model (DBMM) is scalable, fully automatic (no user-defined parameters), non-parametric/data-driven (no specific functional form or parameterization), interpretable (identifies explainable patterns), and flexible (applicable to dynamic and streaming networks). Moreover, the interpretable behavioral roles are generalizable, computationally efficient, and natively supports attributes. We applied our model for (a) identifying patterns and trends of nodes and network states based on the temporal behavior, (b) predicting future structural changes, and (c) detecting unusual temporal behavior transitions. We use eight large real-world datasets from different time-evolving settings (dynamic and streaming). In particular, we model the evolving mixed-memberships and the corresponding behavioral transitions of Twitter, Facebook, IP-Traces, Email (University), Internet AS, Enron, Reality, and IMDB. The experiments demonstrate the scalability, flexibility, and effectiveness of our model for identifying interesting patterns, detecting unusual structural transitions, and predicting the future structural changes of the network and individual nodes.

  5. Gas Main Sensor and Communications Network System

    SciTech Connect (OSTI)

    Hagen Schempf

    2006-05-31

    Automatika, Inc. was contracted by the Department of Energy (DOE) and with co-funding from the Northeast Gas Association (NGA), to develop an in-pipe natural gas prototype measurement and wireless communications system for assessing and monitoring distribution networks. This projected was completed in April 2006, and culminated in the installation of more than 2 dozen GasNet nodes in both low- and high-pressure cast-iron and steel mains owned by multiple utilities in the northeastern US. Utilities are currently logging data (off-line) and monitoring data in real time from single and multiple networked sensors over cellular networks and collecting data using wireless bluetooth PDA systems. The system was designed to be modular, using in-pipe sensor-wands capable of measuring, flow, pressure, temperature, water-content and vibration. Internal antennae allowed for the use of the pipe-internals as a waveguide for setting up a sensor network to collect data from multiple nodes simultaneously. Sensor nodes were designed to be installed with low- and no-blow techniques and tools. Using a multi-drop bus technique with a custom protocol, all electronics were designed to be buriable and allow for on-board data-collection (SD-card), wireless relaying and cellular network forwarding. Installation options afforded by the design included direct-burial and external polemounted variants. Power was provided by one or more batteries, direct AC-power (Class I Div.2) and solar-array. The utilities are currently in a data-collection phase and intend to use the collected (and processed) data to make capital improvement decisions, compare it to Stoner model predictions and evaluate the use of such a system for future expansion, technology-improvement and commercialization starting later in 2006.

  6. Massively parallel processor networks with optical express channels

    DOE Patents [OSTI]

    Deri, R.J.; Brooks, E.D. III; Haigh, R.E.; DeGroot, A.J.

    1999-08-24

    An optical method for separating and routing local and express channel data comprises interconnecting the nodes in a network with fiber optic cables. A single fiber optic cable carries both express channel traffic and local channel traffic, e.g., in a massively parallel processor (MPP) network. Express channel traffic is placed on, or filtered from, the fiber optic cable at a light frequency or a color different from that of the local channel traffic. The express channel traffic is thus placed on a light carrier that skips over the local intermediate nodes one-by-one by reflecting off of selective mirrors placed at each local node. The local-channel-traffic light carriers pass through the selective mirrors and are not reflected. A single fiber optic cable can thus be threaded throughout a three-dimensional matrix of nodes with the x,y,z directions of propagation encoded by the color of the respective light carriers for both local and express channel traffic. Thus frequency division multiple access is used to hierarchically separate the local and express channels to eliminate the bucket brigade latencies that would otherwise result if the express traffic had to hop between every local node to reach its ultimate destination. 3 figs.

  7. Massively parallel processor networks with optical express channels

    DOE Patents [OSTI]

    Deri, Robert J.; Brooks, III, Eugene D.; Haigh, Ronald E.; DeGroot, Anthony J.

    1999-01-01

    An optical method for separating and routing local and express channel data comprises interconnecting the nodes in a network with fiber optic cables. A single fiber optic cable carries both express channel traffic and local channel traffic, e.g., in a massively parallel processor (MPP) network. Express channel traffic is placed on, or filtered from, the fiber optic cable at a light frequency or a color different from that of the local channel traffic. The express channel traffic is thus placed on a light carrier that skips over the local intermediate nodes one-by-one by reflecting off of selective mirrors placed at each local node. The local-channel-traffic light carriers pass through the selective mirrors and are not reflected. A single fiber optic cable can thus be threaded throughout a three-dimensional matrix of nodes with the x,y,z directions of propagation encoded by the color of the respective light carriers for both local and express channel traffic. Thus frequency division multiple access is used to hierarchically separate the local and express channels to eliminate the bucket brigade latencies that would otherwise result if the express traffic had to hop between every local node to reach its ultimate destination.

  8. Number and Location of Positive Nodes, Postoperative Radiotherapy, and Survival After Esophagectomy With Three-Field Lymph Node Dissection for Thoracic Esophageal Squamous Cell Carcinoma

    SciTech Connect (OSTI)

    Chen Junqiang; Pan Jianji; Zheng Xiongwei; Zhu Kunshou; Li Jiancheng; Chen Mingqiang; Wang Jiezhong; Liao Zhongxing

    2012-01-01

    Purpose: To analyze influences of the number and location of positive lymph nodes and postoperative radiotherapy on survival for patients with thoracic esophageal squamous cell carcinoma (TE-SCC) treated with radical esophagectomy with three-field lymphadenectomy. Methods and Materials: A total of 945 patients underwent radical esophagectomy plus three-field lymph node dissection for node-positive TE-SCC at Fujian Provincial Tumor Hospital between January 1993 and March 2007. Five hundred ninety patients received surgery only (S group), and 355 patients received surgery, followed 3 to 4 weeks later by postoperative radiotherapy (S+R group) to a median total dose of 50 Gy in 25 fractions. We assessed potential associations among patient-, tumor-, and treatment-related factors and overall survival. Results: Five-year overall survival rates were 32.8% for the entire group, 29.6% for the S group, and 38.0% for the S+R group (p = 0.001 for S vs. S+R). Treatment with postoperative radiotherapy was particularly beneficial for patients with {>=}3 positive nodes and for those with metastasis in the upper (supraclavicular and upper mediastinal) region or both the upper and lower (mediastinal and abdominal) regions (p < 0.05). Postoperative radiotherapy was also associated with lower recurrence rates in the supraclavicular and upper and middle mediastinal regions (p < 0.05). Sex, primary tumor length, number of positive nodes, pathological T category, and postoperative radiotherapy were all independent predictors of survival. Conclusions: Postoperative radiotherapy was associated with better survival for patients with node-positive TE-SCC, particularly those with three or more positive nodes and positive nodes in the supraclavicular and superior mediastinal regions.

  9. Quadratic Fermi node in a 3D strongly correlated semimetal

    DOE Public Access Gateway for Energy & Science Beta (PAGES Beta)

    Kondo, Takeshi; Nakayama, M.; Chen, R.; Ishikawa, J. J.; Moon, E. -G.; Yamamoto, T.; Ota, Y.; Malaeb, W.; Kanai, H.; Nakashima, Y.; et al

    2015-12-07

    We report that strong spin–orbit coupling fosters exotic electronic states such as topological insulators and superconductors, but the combination of strong spin–orbit and strong electron–electron interactions is just beginning to be understood. Central to this emerging area are the 5d transition metal iridium oxides. Here, in the pyrochlore iridate Pr2Ir2O7, we identify a non-trivial state with a single-point Fermi node protected by cubic and time-reversal symmetries, using a combination of angle-resolved photoemission spectroscopy and first-principles calculations. Owing to its quadratic dispersion, the unique coincidence of four degenerate states at the Fermi energy, and strong Coulomb interactions, non-Fermi liquid behaviour ismore » predicted, for which we observe some evidence. Lastly, our discovery implies that Pr2Ir2O7 is a parent state that can be manipulated to produce other strongly correlated topological phases, such as topological Mott insulator, Weyl semimetal, and quantum spin and anomalous Hall states.« less

  10. Low latency, high bandwidth data communications between compute nodes in a parallel computer

    DOE Patents [OSTI]

    Archer, Charles J.; Blocksome, Michael A.; Ratterman, Joseph D.; Smith, Brian E.

    2010-11-02

    Methods, parallel computers, and computer program products are disclosed for low latency, high bandwidth data communications between compute nodes in a parallel computer. Embodiments include receiving, by an origin direct memory access (`DMA`) engine of an origin compute node, data for transfer to a target compute node; sending, by the origin DMA engine of the origin compute node to a target DMA engine on the target compute node, a request to send (`RTS`) message; transferring, by the origin DMA engine, a predetermined portion of the data to the target compute node using memory FIFO operation; determining, by the origin DMA engine whether an acknowledgement of the RTS message has been received from the target DMA engine; if the an acknowledgement of the RTS message has not been received, transferring, by the origin DMA engine, another predetermined portion of the data to the target compute node using a memory FIFO operation; and if the acknowledgement of the RTS message has been received by the origin DMA engine, transferring, by the origin DMA engine, any remaining portion of the data to the target compute node using a direct put operation.

  11. The Portals 4.0 network programming interface.

    SciTech Connect (OSTI)

    Barrett, Brian W.; Brightwell, Ronald Brian; Pedretti, Kevin Thomas Tauke; Wheeler, Kyle Bruce; Hemmert, Karl Scott; Riesen, Rolf E.; Underwood, Keith Douglas; Maccabe, Arthur Bernard; Hudson, Trammell B.

    2012-11-01

    This report presents a specification for the Portals 4.0 network programming interface. Portals 4.0 is intended to allow scalable, high-performance network communication between nodes of a parallel computing system. Portals 4.0 is well suited to massively parallel processing and embedded systems. Portals 4.0 represents an adaption of the data movement layer developed for massively parallel processing platforms, such as the 4500-node Intel TeraFLOPS machine. Sandia's Cplant cluster project motivated the development of Version 3.0, which was later extended to Version 3.3 as part of the Cray Red Storm machine and XT line. Version 4.0 is targeted to the next generation of machines employing advanced network interface architectures that support enhanced offload capabilities.

  12. The portals 4.0.1 network programming interface.

    SciTech Connect (OSTI)

    Barrett, Brian W.; Brightwell, Ronald Brian; Pedretti, Kevin Thomas Tauke; Wheeler, Kyle Bruce; Hemmert, Karl Scott; Riesen, Rolf E.; Underwood, Keith Douglas; Maccabe, Arthur Bernard; Hudson, Trammell B.

    2013-04-01

    This report presents a specification for the Portals 4.0 network programming interface. Portals 4.0 is intended to allow scalable, high-performance network communication between nodes of a parallel computing system. Portals 4.0 is well suited to massively parallel processing and embedded systems. Portals 4.0 represents an adaption of the data movement layer developed for massively parallel processing platforms, such as the 4500-node Intel TeraFLOPS machine. Sandia's Cplant cluster project motivated the development of Version 3.0, which was later extended to Version 3.3 as part of the Cray Red Storm machine and XT line. Version 4.0 is targeted to the next generation of machines employing advanced network interface architectures that support enhanced offload capabilities. 3

  13. Thread selection according to predefined power characteristics during context switching on compute nodes

    DOE Patents [OSTI]

    None

    2013-06-04

    Methods, apparatus, and products are disclosed for thread selection during context switching on a plurality of compute nodes that includes: executing, by a compute node, an application using a plurality of threads of execution, including executing one or more of the threads of execution; selecting, by the compute node from a plurality of available threads of execution for the application, a next thread of execution in dependence upon power characteristics for each of the available threads; determining, by the compute node, whether criteria for a thread context switch are satisfied; and performing, by the compute node, the thread context switch if the criteria for a thread context switch are satisfied, including executing the next thread of execution.

  14. A mobile-agent based wireless sensing network for structural monitoring applications

    SciTech Connect (OSTI)

    Taylor, Stuart G; Farinholt, Kevin M; Figueiredo, Eloi; Park, Gyuhae; Farrar, Charles R; Flynn, Eric B; Mascarenas, David L; Todd, Michael D

    2008-01-01

    A new wireless sensing network paradigm is presented for structural monitoring applications. In this approach, both power and data interrogation commands are conveyed via a mobile agent that is sent to sensor nodes to perform intended interrogations, which can alleviate several limitations of the traditional sensing networks. Furthermore, the mobile agent provides computational power to make near real-time assessments on the structural conditions. This paper will discuss such prototype systems, which are used to interrogate impedance-based sensors for structural health monitoring applications. Our wireless sensor node is specifically designed to accept various energy sources, including wireless energy transmission, and to be wirelessly triggered on an as-needed basis by the mobile agent or other sensor nodes. The capabilities of this proposed sensing network paradigm are demonstrated in the laboratory and the field.

  15. Nothing But Networking for Residential Network Members

    Broader source: Energy.gov [DOE]

    Better Buildings Residential Network Peer Exchange Call: Nothing But Networking for Residential Network Members, Call Slides and Discussion Summary, March 12, 2015.

  16. Exploring network structure, dynamics, and function using networkx

    SciTech Connect (OSTI)

    Hagberg, Aric; Swart, Pieter; S Chult, Daniel

    2008-01-01

    NetworkX is a Python language package for exploration and analysis of networks and network algorithms. The core package provides data structures for representing many types of networks, or graphs, including simple graphs, directed graphs, and graphs with parallel edges and self loops. The nodes in NetworkX graphs can be any (hashable) Python object and edges can contain arbitrary data; this flexibility mades NetworkX ideal for representing networks found in many different scientific fields. In addition to the basic data structures many graph algorithms are implemented for calculating network properties and structure measures: shortest paths, betweenness centrality, clustering, and degree distribution and many more. NetworkX can read and write various graph formats for eash exchange with existing data, and provides generators for many classic graphs and popular graph models, such as the Erdoes-Renyi, Small World, and Barabasi-Albert models, are included. The ease-of-use and flexibility of the Python programming language together with connection to the SciPy tools make NetworkX a powerful tool for scientific computations. We discuss some of our recent work studying synchronization of coupled oscillators to demonstrate how NetworkX enables research in the field of computational networks.

  17. runtime error message: "apsched: request exceeds max nodes, alloc"

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    apsched: request exceeds max nodes, alloc" runtime error message: "apsched: request exceeds max nodes, alloc" September 12, 2014 Symptom: User jobs with single or multiple apruns in a batch script may get this runtime error. "apsched: request exceeds max nodes, alloc". This problem is intermittent, started in April, then mid July, and again since late August. Status: This problem is identified as a problem when Torque/Moab batch scheduler becomes out of sync with the

  18. Sentient networks

    SciTech Connect (OSTI)

    Chapline, G.

    1998-03-01

    The engineering problems of constructing autonomous networks of sensors and data processors that can provide alerts for dangerous situations provide a new context for debating the question whether man-made systems can emulate the cognitive capabilities of the mammalian brain. In this paper we consider the question whether a distributed network of sensors and data processors can form ``perceptions`` based on sensory data. Because sensory data can have exponentially many explanations, the use of a central data processor to analyze the outputs from a large ensemble of sensors will in general introduce unacceptable latencies for responding to dangerous situations. A better idea is to use a distributed ``Helmholtz machine`` architecture in which the sensors are connected to a network of simple processors, and the collective state of the network as a whole provides an explanation for the sensory data. In general communication within such a network will require time division multiplexing, which opens the door to the possibility that with certain refinements to the Helmholtz machine architecture it may be possible to build sensor networks that exhibit a form of artificial consciousness.

  19. Reducing power consumption during execution of an application on a plurality of compute nodes

    DOE Patents [OSTI]

    Archer, Charles J.; Blocksome, Michael A.; Peters, Amanda E.; Ratterman, Joseph D.; Smith, Brian E.

    2013-09-10

    Methods, apparatus, and products are disclosed for reducing power consumption during execution of an application on a plurality of compute nodes that include: powering up, during compute node initialization, only a portion of computer memory of the compute node, including configuring an operating system for the compute node in the powered up portion of computer memory; receiving, by the operating system, an instruction to load an application for execution; allocating, by the operating system, additional portions of computer memory to the application for use during execution; powering up the additional portions of computer memory allocated for use by the application during execution; and loading, by the operating system, the application into the powered up additional portions of computer memory.

  20. Channel Modeling and Time Delay Estimation for Clock Synchronization Among Seaweb Nodes

    SciTech Connect (OSTI)

    Gagnon, P; Rice, J; Clark, G A

    2012-07-08

    From simulations, tracking of the impulse response is feasible. Potential to benefit other functions such as ranging between two nodes. Potential to combine the features of different protocols to create a new and more realistic clock-synchronization protocol.

  1. Microsoft PowerPoint - 08XTPO-M_Node_Opt.pptx

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    node Optimization Single-node Optimization Customer Documentation and Training PGI Compiler Options -help option displays command line options Request information about either a single option or groups of options options % pgf90 -help=groups Display the available optimization switches % pgf90 -switch -help ------------------------------------ * % pgf90 -fast -help % pgf90 fast help * Reading rcfile /opt/pgi/6.2.2/linux8664/6.2/bin/.pgf90rc -fast * Common optimizations; includes -O2 -Munroll=c:1

  2. A Network Contention Model for the Extreme-scale Simulator

    SciTech Connect (OSTI)

    Engelmann, Christian [ORNL; Naughton, III, Thomas J [ORNL

    2015-01-01

    The Extreme-scale Simulator (xSim) is a performance investigation toolkit for high-performance computing (HPC) hardware/software co-design. It permits running a HPC application with millions of concurrent execution threads, while observing its performance in a simulated extreme-scale system. This paper details a newly developed network modeling feature for xSim, eliminating the shortcomings of the existing network modeling capabilities. The approach takes a different path for implementing network contention and bandwidth capacity modeling using a less synchronous and accurate enough model design. With the new network modeling feature, xSim is able to simulate on-chip and on-node networks with reasonable accuracy and overheads.

  3. Communication and Energy Efficiency in Visual Sensor Networks for People Localization

    SciTech Connect (OSTI)

    Karakaya, Mahmut; Qi, Hairong

    2012-01-01

    This paper addresses the communication and energy efficiency in collaborative visual sensor networks (VSNs) for people localization, a challenging computer vision problem of its own. We focus on the design of a light-weight and energy efficient solution where people are localized based on distributed camera nodes integrating the so-called certainty map generated at each node, that records the target non-existence information within the camera s field of view. We first present a dynamic itinerary for certainty map integration where not only each sensor node transmits a very limited amount of data but that a limited number of camera nodes is involved. Then, we perform a comprehensive analytical study to evaluate communication and energy efficiency between different integration schemes, i.e., centralized and distributed integration. Based on results obtained from analytical study and real experiments, the distributed method shows effectiveness in detection accuracy as well as energy and bandwidth efficiency.

  4. Wireless Sensor Node Power Profiling Based on IEEE 802.11 and IEEE 802.15.4 Communication Protocols. Modeling and Simulation

    SciTech Connect (OSTI)

    Agarwal, Vivek; Richardson, Joseph; Zhang, Yanliang

    2015-10-01

    Most wireless sensor network (comprising of thousands of WSNs) applications require operation over extended periods of time beginning with their deployment. Network lifetime is extremely critical for most applications and is one of the limiting factors for energy-constrained networks. Based on applications, there are wide ranges of different energy sources suitable for powering WSNs. A battery is traditionally used to power WSNs. The deployed WSN is required to last for long time. Due to finite amount of energy present in batteries, it is not feasible to replace batteries. Recently there has been a new surge in the area of energy harvesting were ambient energy in the environment can be utilized to prolong the lifetime of WSNs. Some of the sources of ambient energies are solar power, thermal gradient, human motion and body heat, vibrations, and ambient RF energy. The design and development of TEGs to power WSNs that would remain active for a long period of time requires comprehensive understanding of WSN operational. This motivates the research in modeling the lifetime, i.e., power consumption, of a WSN by taking into consideration various node and network level activities. A WSN must perform three essential tasks: sense events, perform quick local information processing of sensed events, and wirelessly exchange locally processed data with the base station or with other WSNs in the network. Each task has a power cost per unit tine and an additional cost when switching between tasks. There are number of other considerations that must also be taken into account when computing the power consumption associated with each task. The considerations includes: number of events occurring in a fixed active time period and the duration of each event, event-information processing time, total communication time, number of retransmission, etc. Additionally, at the network level the communication of information data packets between WSNs involves collisions, latency, and

  5. Cut set-based risk and reliability analysis for arbitrarily interconnected networks

    DOE Patents [OSTI]

    Wyss, Gregory D.

    2000-01-01

    Method for computing all-terminal reliability for arbitrarily interconnected networks such as the United States public switched telephone network. The method includes an efficient search algorithm to generate minimal cut sets for nonhierarchical networks directly from the network connectivity diagram. Efficiency of the search algorithm stems in part from its basis on only link failures. The method also includes a novel quantification scheme that likewise reduces computational effort associated with assessing network reliability based on traditional risk importance measures. Vast reductions in computational effort are realized since combinatorial expansion and subsequent Boolean reduction steps are eliminated through analysis of network segmentations using a technique of assuming node failures to occur on only one side of a break in the network, and repeating the technique for all minimal cut sets generated with the search algorithm. The method functions equally well for planar and non-planar networks.

  6. Optimizing Cluster Heads for Energy Efficiency in Large-Scale Heterogeneous Wireless Sensor Networks

    DOE Public Access Gateway for Energy & Science Beta (PAGES Beta)

    Gu, Yi; Wu, Qishi; Rao, Nageswara S. V.

    2010-01-01

    Many complex sensor network applications require deploying a large number of inexpensive and small sensors in a vast geographical region to achieve quality through quantity. Hierarchical clustering is generally considered as an efficient and scalable way to facilitate the management and operation of such large-scale networks and minimize the total energy consumption for prolonged lifetime. Judicious selection of cluster heads for data integration and communication is critical to the success of applications based on hierarchical sensor networks organized as layered clusters. We investigate the problem of selecting sensor nodes in a predeployed sensor network to be the cluster headsmore » to minimize the total energy needed for data gathering. We rigorously derive an analytical formula to optimize the number of cluster heads in sensor networks under uniform node distribution, and propose a Distance-based Crowdedness Clustering algorithm to determine the cluster heads in sensor networks under general node distribution. The results from an extensive set of experiments on a large number of simulated sensor networks illustrate the performance superiority of the proposed solution over the clustering schemes based on k -means algorithm.« less

  7. An Industry/DOE Program to Develop and Benchmark Advanced Diamond Product Drill Bits and HP/HT Drilling Fluids to Significantly Improve Rates of Penetration

    SciTech Connect (OSTI)

    TerraTek

    2007-06-30

    A deep drilling research program titled 'An Industry/DOE Program to Develop and Benchmark Advanced Diamond Product Drill Bits and HP/HT Drilling Fluids to Significantly Improve Rates of Penetration' was conducted at TerraTek's Drilling and Completions Laboratory. Drilling tests were run to simulate deep drilling by using high bore pressures and high confining and overburden stresses. The purpose of this testing was to gain insight into practices that would improve rates of penetration and mechanical specific energy while drilling under high pressure conditions. Thirty-seven test series were run utilizing a variety of drilling parameters which allowed analysis of the performance of drill bits and drilling fluids. Five different drill bit types or styles were tested: four-bladed polycrystalline diamond compact (PDC), 7-bladed PDC in regular and long profile, roller-cone, and impregnated. There were three different rock types used to simulate deep formations: Mancos shale, Carthage marble, and Crab Orchard sandstone. The testing also analyzed various drilling fluids and the extent to which they improved drilling. The PDC drill bits provided the best performance overall. The impregnated and tungsten carbide insert roller-cone drill bits performed poorly under the conditions chosen. The cesium formate drilling fluid outperformed all other drilling muds when drilling in the Carthage marble and Mancos shale with PDC drill bits. The oil base drilling fluid with manganese tetroxide weighting material provided the best performance when drilling the Crab Orchard sandstone.

  8. Network Policies

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Acceptable Use Policy About ESnet Our Mission The Network ESnet History Governance & Policies ESnet Policy Board ESCC Acceptable Use Policy Data Privacy Policy Facility Data Policy Career Opportunities ESnet Staff & Org Chart Contact Us Contact Us Technical Assistance: 1 800-33-ESnet (Inside US) 1 800-333-7638 (Inside US) 1 510-486-7600 (Globally) 1 510-486-7607 (Globally) Report Network Problems: trouble@es.net Provide Web Site Feedback: info@es.net ESnet Acceptable Use Policy The

  9. Historical Network Maps

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Network Maps Network Traffic Volume Historical Network Maps Network Facts & Stats Connected Sites Peering Connections ESnet Site Availabiliy OSCARS Fasterdata IPv6 Network Network Performance Tools The ESnet Engineering Team Network R&D Software-Defined Networking (SDN) Experimental Network Testbeds Performance (perfSONAR) Software & Tools Development Data for Researchers Partnerships Publications Workshops Science Engagement Move your data Programs & Workshops Science

  10. Nothing But Networking for Residential Network Members | Department...

    Energy Savers [EERE]

    Nothing But Networking for Residential Network Members Nothing But Networking for Residential Network Members Better Buildings Residential Network Peer Exchange Call: Nothing But ...

  11. HPSS Yearly Network Traffic

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    HPSS Yearly Network Traffic HPSS Yearly Network Traffic Yearly Summary of IO Traffic Between Storage and Network Destinations These bar charts show the total transfer traffic for...

  12. Celiac Node Failure Patterns After Definitive Chemoradiation for Esophageal Cancer in the Modern Era

    SciTech Connect (OSTI)

    Amini, Arya; Xiao Lianchun; Allen, Pamela K.; Suzuki, Akihiro; Hayashi, Yuki; Liao, Zhongxing; Hofstetter, Wayne; Crane, Christopher; Komaki, Ritsuko; Bhutani, Manoop S.; Lee, Jeffrey H.; Ajani, Jaffer A.; Welsh, James

    2012-06-01

    Purpose: The celiac lymph node axis acts as a gateway for metastatic systemic spread. The need for prophylactic celiac nodal coverage in chemoradiation therapy for esophageal cancer is controversial. Given the improved ability to evaluate lymph node status before treatment via positron emission tomography (PET) and endoscopic ultrasound, we hypothesized that prophylactic celiac node irradiation may not be needed for patients with localized esophageal carcinoma. Methods and Materials: We reviewed the radiation treatment volumes for 131 patients who underwent definitive chemoradiation for esophageal cancer. Patients with celiac lymph node involvement at baseline were excluded. Median radiation dose was 50.4 Gy. The location of all celiac node failures was compared with the radiation treatment plan to determine whether the failures occurred within or outside the radiation treatment field. Results: At a median follow-up time of 52.6 months (95% CI 46.1-56.7 months), 6 of 60 patients (10%) without celiac node coverage had celiac nodal failure; in 5 of these patients, the failures represented the first site of recurrence. Of the 71 patients who had celiac coverage, only 5 patients (7%) had celiac region relapse. In multivariate analyses, having a pretreatment-to-post-treatment change in standardized uptake value on PET >52% (odds ratio [OR] 0.198, p = 0.0327) and having failure in the clinical target volume (OR 10.72, p = 0.001) were associated with risk of celiac region relapse. Of those without celiac coverage, the 6 patients that later developed celiac failure had a worse median overall survival time compared with the other 54 patients who did not fail (median overall survival time: 16.5 months vs. 31.5 months, p = 0.041). Acute and late toxicities were similar in both groups. Conclusions: Although celiac lymph node failures occur in approximately 1 of 10 patients, the lack of effective salvage treatments and subsequent low morbidity may justify prophylactic treatment

  13. Self organization of wireless sensor networks using ultra-wideband radios

    DOE Patents [OSTI]

    Dowla, Farid U.; Nekoogar, Franak; Spiridon, Alex

    2009-06-16

    A novel UWB communications method and system that provides self-organization for wireless sensor networks is introduced. The self-organization is in terms of scalability, power conservation, channel estimation, and node synchronization in wireless sensor networks. The UWB receiver in the present invention adds two new tasks to conventional TR receivers. The two additional units are SNR enhancing unit and timing acquisition and tracking unit.

  14. Differential Motion Between Mediastinal Lymph Nodes and Primary Tumor in Radically Irradiated Lung Cancer Patients

    SciTech Connect (OSTI)

    Schaake, Eva E.; Rossi, Maddalena M.G.; Buikhuisen, Wieneke A.; Burgers, Jacobus A.; Smit, Adrianus A.J.; Belderbos, José S.A.; Sonke, Jan-Jakob

    2014-11-15

    Purpose/Objective: In patients with locally advanced lung cancer, planning target volume margins for mediastinal lymph nodes and tumor after a correction protocol based on bony anatomy registration typically range from 1 to 1.5 cm. Detailed information about lymph node motion variability and differential motion with the primary tumor, however, is lacking from large series. In this study, lymph node and tumor position variability were analyzed in detail and correlated to the main carina to evaluate possible margin reduction. Methods and Materials: Small gold fiducial markers (0.35 × 5 mm) were placed in the mediastinal lymph nodes of 51 patients with non-small cell lung cancer during routine diagnostic esophageal or bronchial endoscopic ultrasonography. Four-dimensional (4D) planning computed tomographic (CT) and daily 4D cone beam (CB) CT scans were acquired before and during radical radiation therapy (66 Gy in 24 fractions). Each CBCT was registered in 3-dimensions (bony anatomy) and 4D (tumor, marker, and carina) to the planning CT scan. Subsequently, systematic and random residual misalignments of the time-averaged lymph node and tumor position relative to the bony anatomy and carina were determined. Additionally, tumor and lymph node respiratory amplitude variability was quantified. Finally, required margins were quantified by use of a recipe for dual targets. Results: Relative to the bony anatomy, systematic and random errors ranged from 0.16 to 0.32 cm for the markers and from 0.15 to 0.33 cm for the tumor, but despite similar ranges there was limited correlation (0.17-0.71) owing to differential motion. A large variability in lymph node amplitude between patients was observed, with an average motion of 0.56 cm in the cranial-caudal direction. Margins could be reduced by 10% (left-right), 27% (cranial-caudal), and 10% (anteroposterior) for the lymph nodes and −2%, 15%, and 7% for the tumor if an online carina registration protocol replaced a

  15. NetworkX

    Energy Science and Technology Software Center (OSTI)

    2004-05-17

    NetworkX (abbreviated NX in the software and documentation) is a package for studying network structure using graph theory.

  16. Modeling node bandwidth limits and their effects on vector combining algorithms

    SciTech Connect (OSTI)

    Littlefield, R.J.

    1992-01-13

    Each node in a message-passing multicomputer typically has several communication links. However, the maximum aggregate communication speed of a node is often less than the sum of its individual link speeds. Such computers are called node bandwidth limited (NBL). The NBL constraint is important when choosing algorithms because it can change the relative performance of different algorithms that accomplish the same task. This paper introduces a model of communication performance for NBL computers and uses the model to analyze the overall performance of three algorithms for vector combining (global sum) on the Intel Touchstone DELTA computer. Each of the three algorithms is found to be at least 33% faster than the other two for some combinations of machine size and vector length. The NBL constraint is shown to significantly affect the conditions under which each algorithm is fastest.

  17. Using new edges for anomaly detection in computer networks

    DOE Patents [OSTI]

    Neil, Joshua Charles

    2015-05-19

    Creation of new edges in a network may be used as an indication of a potential attack on the network. Historical data of a frequency with which nodes in a network create and receive new edges may be analyzed. Baseline models of behavior among the edges in the network may be established based on the analysis of the historical data. A new edge that deviates from a respective baseline model by more than a predetermined threshold during a time window may be detected. The new edge may be flagged as potentially anomalous when the deviation from the respective baseline model is detected. Probabilities for both new and existing edges may be obtained for all edges in a path or other subgraph. The probabilities may then be combined to obtain a score for the path or other subgraph. A threshold may be obtained by calculating an empirical distribution of the scores under historical conditions.

  18. Asynchronous broadcast for ordered delivery between compute nodes in a parallel computing system where packet header space is limited

    DOE Patents [OSTI]

    Kumar, Sameer

    2010-06-15

    Disclosed is a mechanism on receiving processors in a parallel computing system for providing order to data packets received from a broadcast call and to distinguish data packets received at nodes from several incoming asynchronous broadcast messages where header space is limited. In the present invention, processors at lower leafs of a tree do not need to obtain a broadcast message by directly accessing the data in a root processor's buffer. Instead, each subsequent intermediate node's rank id information is squeezed into the software header of packet headers. In turn, the entire broadcast message is not transferred from the root processor to each processor in a communicator but instead is replicated on several intermediate nodes which then replicated the message to nodes in lower leafs. Hence, the intermediate compute nodes become "virtual root compute nodes" for the purpose of replicating the broadcast message to lower levels of a tree.

  19. Postlumpectomy Focal Brachytherapy for Simultaneous Treatment of Surgical Cavity and Draining Lymph Nodes

    SciTech Connect (OSTI)

    Hrycushko, Brian A.; Li Shihong; Shi Chengyu; Goins, Beth; Liu Yaxi; Phillips, William T.; Otto, Pamela M.; Bao, Ande

    2011-03-01

    Purpose: The primary objective was to investigate a novel focal brachytherapy technique using lipid nanoparticle (liposome)-carried {beta}-emitting radionuclides (rhenium-186 [{sup 186}Re]/rhenium-188 [{sup 188}Re]) to simultaneously treat the postlumpectomy surgical cavity and draining lymph nodes. Methods and Materials: Cumulative activity distributions in the lumpectomy cavity and lymph nodes were extrapolated from small animal imaging and human lymphoscintigraphy data. Absorbed dose calculations were performed for lumpectomy cavities with spherical and ellipsoidal shapes and lymph nodes within human subjects by use of the dose point kernel convolution method. Results: Dose calculations showed that therapeutic dose levels within the lumpectomy cavity wall can cover 2- and 5-mm depths for {sup 186}Re and {sup 188}Re liposomes, respectively. The absorbed doses at 1 cm sharply decreased to only 1.3% to 3.7% of the doses at 2 mm for {sup 186}Re liposomes and 5 mm for {sup 188}Re liposomes. Concurrently, the draining sentinel lymph nodes would receive a high focal therapeutic absorbed dose, whereas the average dose to 1 cm of surrounding tissue received less than 1% of that within the nodes. Conclusions: Focal brachytherapy by use of {sup 186}Re/{sup 188}Re liposomes was theoretically shown to be capable of simultaneously treating the lumpectomy cavity wall and draining sentinel lymph nodes with high absorbed doses while significantly lowering dose to surrounding healthy tissue. In turn, this allows for dose escalation to regions of higher probability of containing residual tumor cells after lumpectomy while reducing normal tissue complications.

  20. Non-preconditioned conjugate gradient on cell and FPCA-based hybrid supercomputer nodes

    SciTech Connect (OSTI)

    Dubois, David H; Dubois, Andrew J; Boorman, Thomas M; Connor, Carolyn M

    2009-03-10

    This work presents a detailed implementation of a double precision, Non-Preconditioned, Conjugate Gradient algorithm on a Roadrunner heterogeneous supercomputer node. These nodes utilize the Cell Broadband Engine Architecture{trademark} in conjunction with x86 Opteron{trademark} processors from AMD. We implement a common Conjugate Gradient algorithm, on a variety of systems, to compare and contrast performance. Implementation results are presented for the Roadrunner hybrid supercomputer, SRC Computers, Inc. MAPStation SRC-6 FPGA enhanced hybrid supercomputer, and AMD Opteron only. In all hybrid implementations wall clock time is measured, including all transfer overhead and compute timings.

  1. Non-preconditioned conjugate gradient on cell and FPGA based hybrid supercomputer nodes

    SciTech Connect (OSTI)

    Dubois, David H; Dubois, Andrew J; Boorman, Thomas M; Connor, Carolyn M

    2009-01-01

    This work presents a detailed implementation of a double precision, non-preconditioned, Conjugate Gradient algorithm on a Roadrunner heterogeneous supercomputer node. These nodes utilize the Cell Broadband Engine Architecture{sup TM} in conjunction with x86 Opteron{sup TM} processors from AMD. We implement a common Conjugate Gradient algorithm, on a variety of systems, to compare and contrast performance. Implementation results are presented for the Roadrunner hybrid supercomputer, SRC Computers, Inc. MAPStation SRC-6 FPGA enhanced hybrid supercomputer, and AMD Opteron only. In all hybrid implementations wall clock time is measured, including all transfer overhead and compute timings.

  2. Optimized scalable network switch

    DOE Patents [OSTI]

    Blumrich, Matthias A.; Chen, Dong; Coteus, Paul W.

    2010-02-23

    In a massively parallel computing system having a plurality of nodes configured in m multi-dimensions, each node including a computing device, a method for routing packets towards their destination nodes is provided which includes generating at least one of a 2m plurality of compact bit vectors containing information derived from downstream nodes. A multilevel arbitration process in which downstream information stored in the compact vectors, such as link status information and fullness of downstream buffers, is used to determine a preferred direction and virtual channel for packet transmission. Preferred direction ranges are encoded and virtual channels are selected by examining the plurality of compact bit vectors. This dynamic routing method eliminates the necessity of routing tables, thus enhancing scalability of the switch.

  3. Optimized scalable network switch

    DOE Patents [OSTI]

    Blumrich, Matthias A. (Ridgefield, CT); Chen, Dong (Croton On Hudson, NY); Coteus, Paul W. (Yorktown Heights, NY); Gara, Alan G. (Mount Kisco, NY); Giampapa, Mark E. (Irvington, NY); Heidelberger, Philip (Cortlandt Manor, NY); Steinmacher-Burow, Burkhard D. (Mount Kisco, NY); Takken, Todd E. (Mount Kisco, NY); Vranas, Pavlos M. (Bedford Hills, NY)

    2007-12-04

    In a massively parallel computing system having a plurality of nodes configured in m multi-dimensions, each node including a computing device, a method for routing packets towards their destination nodes is provided which includes generating at least one of a 2m plurality of compact bit vectors containing information derived from downstream nodes. A multilevel arbitration process in which downstream information stored in the compact vectors, such as link status information and fullness of downstream buffers, is used to determine a preferred direction and virtual channel for packet transmission. Preferred direction ranges are encoded and virtual channels are selected by examining the plurality of compact bit vectors. This dynamic routing method eliminates the necessity of routing tables, thus enhancing scalability of the switch.

  4. Evaluation of Rugged Wireless Mesh Nodes for Use In Emergency Response

    SciTech Connect (OSTI)

    Kevin L Young; Alan M Snyder

    2007-11-01

    During the summer of 2007, engineers at the Idaho National Laboratory (INL) conducted a two-day evaluation of commercially available battery powered, wireless, self-forming mesh nodes for use in emergency response. In this paper, the author describes the fundamentals of this emerging technology, applciations for emergency response and specific results of the technology evaluation conducted at the Idaho National Laboratory.

  5. Arithmetic functions in torus and tree networks

    DOE Patents [OSTI]

    Bhanot, Gyan; Blumrich, Matthias A.; Chen, Dong; Gara, Alan G.; Giampapa, Mark E.; Heidelberger, Philip; Steinmacher-Burow, Burkhard D.; Vranas, Pavlos M.

    2007-12-25

    Methods and systems for performing arithmetic functions. In accordance with a first aspect of the invention, methods and apparatus are provided, working in conjunction of software algorithms and hardware implementation of class network routing, to achieve a very significant reduction in the time required for global arithmetic operation on the torus. Therefore, it leads to greater scalability of applications running on large parallel machines. The invention involves three steps in improving the efficiency and accuracy of global operations: (1) Ensuring, when necessary, that all the nodes do the global operation on the data in the same order and so obtain a unique answer, independent of roundoff error; (2) Using the topology of the torus to minimize the number of hops and the bidirectional capabilities of the network to reduce the number of time steps in the data transfer operation to an absolute minimum; and (3) Using class function routing to reduce latency in the data transfer. With the method of this invention, every single element is injected into the network only once and it will be stored and forwarded without any further software overhead. In accordance with a second aspect of the invention, methods and systems are provided to efficiently implement global arithmetic operations on a network that supports the global combining operations. The latency of doing such global operations are greatly reduced by using these methods.

  6. A Micro-Grid Simulator Tool (SGridSim) using Effective Node-to-Node Complex Impedance (EN2NCI) Models

    SciTech Connect (OSTI)

    Udhay Ravishankar; Milos manic

    2013-08-01

    This paper presents a micro-grid simulator tool useful for implementing and testing multi-agent controllers (SGridSim). As a common engineering practice it is important to have a tool that simplifies the modeling of the salient features of a desired system. In electric micro-grids, these salient features are the voltage and power distributions within the micro-grid. Current simplified electric power grid simulator tools such as PowerWorld, PowerSim, Gridlab, etc, model only the power distribution features of a desired micro-grid. Other power grid simulators such as Simulink, Modelica, etc, use detailed modeling to accommodate the voltage distribution features. This paper presents a SGridSim micro-grid simulator tool that simplifies the modeling of both the voltage and power distribution features in a desired micro-grid. The SGridSim tool accomplishes this simplified modeling by using Effective Node-to-Node Complex Impedance (EN2NCI) models of components that typically make-up a micro-grid. The term EN2NCI models means that the impedance based components of a micro-grid are modeled as single impedances tied between their respective voltage nodes on the micro-grid. Hence the benefit of the presented SGridSim tool are 1) simulation of a micro-grid is performed strictly in the complex-domain; 2) faster simulation of a micro-grid by avoiding the simulation of detailed transients. An example micro-grid model was built using the SGridSim tool and tested to simulate both the voltage and power distribution features with a total absolute relative error of less than 6%.

  7. Groundwater Monitoring Network

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Groundwater Monitoring Network Groundwater Monitoring Network The network includes 92 natural sources, 102 regional aquifer wells, 41 intermediate-depth wells and springs, and 67 wells in alluvium in canyons. August 1, 2013 Map of LANL's groundwater monitoring network Map of LANL's groundwater monitoring network

  8. ESnet Network Operating System (ENOS)

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Experimental Network Testbeds Performance (perfSONAR) Software & Tools Development Data ... Blog ESnet Live Home Network R&D Software-Defined Networking (SDN) ENOS Network ...

  9. Interconnection networks

    DOE Patents [OSTI]

    Faber, V.; Moore, J.W.

    1988-06-20

    A network of interconnected processors is formed from a vertex symmetric graph selected from graphs GAMMA/sub d/(k) with degree d, diameter k, and (d + 1)exclamation/ (d /minus/ k + 1)exclamation processors for each d greater than or equal to k and GAMMA/sub d/(k, /minus/1) with degree d /minus/ 1, diameter k + 1, and (d + 1)exclamation/(d /minus/ k + 1)exclamation processors for each d greater than or equal to k greater than or equal to 4. Each processor has an address formed by one of the permutations from a predetermined sequence of letters chosen a selected number of letters at a time, and an extended address formed by appending to the address the remaining ones of the predetermined sequence of letters. A plurality of transmission channels is provided from each of the processors, where each processor has one less channel than the selected number of letters forming the sequence. Where a network GAMMA/sub d/(k, /minus/1) is provided, no processor has a channel connected to form an edge in a direction delta/sub 1/. Each of the channels has an identification number selected from the sequence of letters and connected from a first processor having a first extended address to a second processor having a second address formed from a second extended address defined by moving to the front of the first extended address the letter found in the position within the first extended address defined by the channel identification number. The second address is then formed by selecting the first elements of the second extended address corresponding to the selected number used to form the address permutations. 9 figs.

  10. Compute Nodes

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    low-overhead operating system optimized for high performance computing called "Cray Linux Environment" (CLE). This OS supports only a limited number of system calls and UNIX...

  11. Compute Nodes

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    See Submitting jobs for more information. Processor Clock Speed (GHz) Architecture Cores Available Memory (GB) Scratch (GBcore) Job Slots Quad Intel 2.2 lx24-amd64 8 23.4 10 8 ...

  12. Valley Entrepreneurs' Network (VEN) Monthly Network Meeting

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    VEN Monthly Network Meeting Valley Entrepreneurs' Network (VEN) Monthly Network Meeting WHEN: Mar 05, 2015 5:30 PM - 7:00 PM WHERE: Anthony's At the Delta North Paseo De Onate, Española, NM CATEGORY: Community INTERNAL: Calendar Login Event Description An evening of exciting enterprise networking with like-minded entrepreneurs. For more information, contact Alejandro, VEN Coordinator, at (505) 410-0959

  13. Characterizing system dynamics with a weighted and directed network constructed from time series data

    SciTech Connect (OSTI)

    Sun, Xiaoran; School of Mathematics and Statistics, The University of Western Australia, Crawley WA 6009 ; Small, Michael; Zhao, Yi; Xue, Xiaoping

    2014-06-15

    In this work, we propose a novel method to transform a time series into a weighted and directed network. For a given time series, we first generate a set of segments via a sliding window, and then use a doubly symbolic scheme to characterize every windowed segment by combining absolute amplitude information with an ordinal pattern characterization. Based on this construction, a network can be directly constructed from the given time series: segments corresponding to different symbol-pairs are mapped to network nodes and the temporal succession between nodes is represented by directed links. With this conversion, dynamics underlying the time series has been encoded into the network structure. We illustrate the potential of our networks with a well-studied dynamical model as a benchmark example. Results show that network measures for characterizing global properties can detect the dynamical transitions in the underlying system. Moreover, we employ a random walk algorithm to sample loops in our networks, and find that time series with different dynamics exhibits distinct cycle structure. That is, the relative prevalence of loops with different lengths can be used to identify the underlying dynamics.

  14. FLOP Counts for "Small" Single-Node Miniapplication Tests

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    FLOP Counts for "Small" Single-Node Miniapplication Tests FLOP Counts for "Small" Single-Node Miniapplication Tests These data, obtained using the NERSC Hopper system, are provided for reference. Code MPI Tasks Threads Reference TFLOP Count Benchmark Time (seconds) # of iterations miniFE 144 1 5.05435E+12 130.2 (total program time) miniGhost 96 1 6.55500E+12 76.5 AMG 96 1 1.30418E+12 66.95 18 UMT 96 1 1.30211E+13 416.99 49 SNAP 96 1 5.84246E+11 15.37 3059 miniDFT 40 1

  15. Energy harvesting and wireless energy transmission for powering SHM sensor nodes

    SciTech Connect (OSTI)

    Taylor, Stuart G; Farinholt, Kevin M; Park, Gyuhae; Farrar, Charles R

    2009-01-01

    In this paper, we present a feasibility study of using energy harvesting and wireless energy transmission systems to operate SHM sensor nodes. The energy harvesting approach examines the use of kinetic energy harvesters to scavenge energy from the ambient sources. Acceleration measurements were made on a bridge, and serve as the basis for a series of laboratory experiments that replicate these sources using an electromagnetic shaker. We also investigated the use of wireless energy transmission systems to operate SHM sensor nodes. The goal of this investigation is to develop SHM sensing systems which can be permanently embedded in the host structure and do not require on-board power sources. This paper summarizes considerations needed to design such systems, experimental procedures and results, and additional issues that can be used as guidelines for future investigations.

  16. Simplifying and speeding the management of intra-node cache coherence

    DOE Patents [OSTI]

    Blumrich, Matthias A.; Chen, Dong; Coteus, Paul W.; Gara, Alan G.; Giampapa, Mark E.; Heidelberger, Phillip; Hoenicke, Dirk; Ohmacht, Martin

    2012-04-17

    A method and apparatus for managing coherence between two processors of a two processor node of a multi-processor computer system. Generally the present invention relates to a software algorithm that simplifies and significantly speeds the management of cache coherence in a message passing parallel computer, and to hardware apparatus that assists this cache coherence algorithm. The software algorithm uses the opening and closing of put/get windows to coordinate the activated required to achieve cache coherence. The hardware apparatus may be an extension to the hardware address decode, that creates, in the physical memory address space of the node, an area of virtual memory that (a) does not actually exist, and (b) is therefore able to respond instantly to read and write requests from the processing elements.

  17. Momentum Integral Network Method for Thermal-Hydraulic Systems Analysis.

    Energy Science and Technology Software Center (OSTI)

    2000-11-20

    EPIPE is used for design or design evaluation of complex large piping systems. The piping systems can be viewed as a network of straight pipe elements (or tangents) and curved elements (pipe bends) interconnected at joints (or nodes) with intermediate supports and anchors. The system may be subject to static loads such as thermal, dead weight, internal pressure, or dynamic loads such as earthquake motions and flow-induced vibrations, or any combination of these. MINET (Momentummore » Integral NETwork) was developed for the transient analysis of intricate fluid flow and heat transfer networks, such as those found in the balance of plant in power generating facilities. It can be utilized as a stand-alone program or interfaced to another computer program for concurrent analysis. Through such coupling, a computer code limited by either the lack of required component models or large computational needs can be extended to more fully represent the thermal hydraulic system thereby reducing the need for estimating essential transient boundary conditions. The MINET representation of a system is one or more networks of volumes, segments, and boundaries linked together via heat exchangers only, i.e., heat can transfer between networks, but fluids cannot. Volumes are used to represent tanks or other volume components, as well as locations in the system where significant flow divisions or combinations occur. Segments are composed of one or more pipes, pumps, heat exchangers, turbines, and/or valves each represented by one or more nodes. Boundaries are simply points where the network interfaces with the user or another computer code. Several fluids can be simulated, including water, sodium, NaK, and air.« less

  18. Application of a wireless sensor node to health monitoring of operational wind turbine blades

    SciTech Connect (OSTI)

    Taylor, Stuart G; Farinholt, Kevin M; Park, Gyuhae; Farrar, Charles R; Todd, Michael D

    2009-01-01

    Structural health monitoring (SHM) is a developing field of research with a variety of applications including civil structures, industrial equipment, and energy infrastructure. An SHM system requires an integrated process of sensing, data interrogation and statistical assessment. The first and most important stage of any SHM system is the sensing system, which is traditionally composed of transducers and data acquisition hardware. However, such hardware is often heavy, bulky, and difficult to install in situ. Furthermore, physical access to the structure being monitored may be limited or restricted, as is the case for rotating wind turbine blades or unmanned aerial vehicles, requiring wireless transmission of sensor readings. This study applies a previously developed compact wireless sensor node to structural health monitoring of rotating small-scale wind turbine blades. The compact sensor node collects low-frequency structural vibration measurements to estimate natural frequencies and operational deflection shapes. The sensor node also has the capability to perform high-frequency impedance measurements to detect changes in local material properties or other physical characteristics. Operational measurements were collected using the wireless sensing system for both healthy and damaged blade conditions. Damage sensitive features were extracted from the collected data, and those features were used to classify the structural condition as healthy or damaged.

  19. Advanced Energy Storage Management in Distribution Network

    SciTech Connect (OSTI)

    Liu, Guodong; Ceylan, Oguzhan; Xiao, Bailu; Starke, Michael R; Ollis, T Ben; King, Daniel J; Irminger, Philip; Tomsovic, Kevin

    2016-01-01

    With increasing penetration of distributed generation (DG) in the distribution networks (DN), the secure and optimal operation of DN has become an important concern. In this paper, an iterative mixed integer quadratic constrained quadratic programming model to optimize the operation of a three phase unbalanced distribution system with high penetration of Photovoltaic (PV) panels, DG and energy storage (ES) is developed. The proposed model minimizes not only the operating cost, including fuel cost and purchasing cost, but also voltage deviations and power loss. The optimization model is based on the linearized sensitivity coefficients between state variables (e.g., node voltages) and control variables (e.g., real and reactive power injections of DG and ES). To avoid slow convergence when close to the optimum, a golden search method is introduced to control the step size and accelerate the convergence. The proposed algorithm is demonstrated on modified IEEE 13 nodes test feeders with multiple PV panels, DG and ES. Numerical simulation results validate the proposed algorithm. Various scenarios of system configuration are studied and some critical findings are concluded.

  20. Damselfly Network Simulator

    Energy Science and Technology Software Center (OSTI)

    2014-04-01

    Damselfly is a model-based parallel network simulator. It can simulate communication patterns of High Performance Computing applications on different network topologies. It outputs steady-state network traffic for a communication pattern, which can help in studying network congestion and its impact on performance.

  1. Method and tool for network vulnerability analysis

    DOE Patents [OSTI]

    Swiler, Laura Painton; Phillips, Cynthia A.

    2006-03-14

    A computer system analysis tool and method that will allow for qualitative and quantitative assessment of security attributes and vulnerabilities in systems including computer networks. The invention is based on generation of attack graphs wherein each node represents a possible attack state and each edge represents a change in state caused by a single action taken by an attacker or unwitting assistant. Edges are weighted using metrics such as attacker effort, likelihood of attack success, or time to succeed. Generation of an attack graph is accomplished by matching information about attack requirements (specified in "attack templates") to information about computer system configuration (contained in a configuration file that can be updated to reflect system changes occurring during the course of an attack) and assumed attacker capabilities (reflected in "attacker profiles"). High risk attack paths, which correspond to those considered suited to application of attack countermeasures given limited resources for applying countermeasures, are identified by finding "epsilon optimal paths."

  2. Development of a photovoltaic power supply for wireless sensor networks.

    SciTech Connect (OSTI)

    Harvey, Matthew R.; Kyker, Ronald D.

    2005-06-01

    This report examines the design process of a photovoltaic (solar) based power supply for wireless sensor networks. Such a system stores the energy produced by an array of photovoltaic cells in a secondary (rechargeable) battery that in turn provides power to the individual node of the sensor network. The goal of such a power supply is to enable a wireless sensor network to have an autonomous operation on the order of years. Ideally, such a system is as small as possible physically while transferring the maximum amount of available solar energy to the load (the node). Within this report, there is first an overview of current solar and battery technologies, including characteristics of different technologies and their impact on overall system design. Second is a general discussion of modeling, predicting, and analyzing the extended operation of a small photovoltaic power supply and setting design parameters. This is followed by results and conclusions from the testing of a few basic systems. Lastly, some advanced concepts that may be considered in order to optimize future systems will be discussed.

  3. HPSS Yearly Network Traffic

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    HPSS Yearly Network Traffic HPSS Yearly Network Traffic Yearly Summary of I/O Traffic Between Storage and Network Destinations These bar charts show the total transfer traffic for each year between storage and network destinations (systems within and outside of NERSC). Traffic for the current year is an estimate derived by scaling the known months traffic up to 12 months. The years shown are calendar years. The first graph shows the overall growth in network traffic to storage over the years.

  4. PNNI routing support for ad hoc mobile networking: A flat architecture

    SciTech Connect (OSTI)

    Martinez, L.; Sholander, P.; Tolendino, L.

    1997-12-01

    This contribution extends the Outside Nodal Hierarchy List (ONHL) procedures described in ATM Form Contribution 97-0766. These extensions allow multiple mobile networks to form either an ad hoc network or an extension of a fixed PNNI infrastructure. This contribution covers the simplest case where the top-most Logical Group Nodes (LGNs), in those mobile networks, all reside at the same level in a PNNI hierarchy. Future contributions will cover the general case where those top-most LGNs reside at different hierarchy levels. This contribution considers a flat ad hoc network architecture--in the sense that each mobile network always participates in the PNNI hierarchy at the preconfigured level of its top-most LGN.

  5. Sandia`s network for supercomputing `95: Validating the progress of Asynchronous Transfer Mode (ATM) switching

    SciTech Connect (OSTI)

    Pratt, T.J.; Vahle, O.; Gossage, S.A.

    1996-04-01

    The Advanced Networking Integration Department at Sandia National Laboratories has used the annual Supercomputing conference sponsored by the IEEE and ACM for the past three years as a forum to demonstrate and focus communication and networking developments. For Supercomputing `95, Sandia elected: to demonstrate the functionality and capability of an AT&T Globeview 20Gbps Asynchronous Transfer Mode (ATM) switch, which represents the core of Sandia`s corporate network, to build and utilize a three node 622 megabit per second Paragon network, and to extend the DOD`s ACTS ATM Internet from Sandia, New Mexico to the conference`s show floor in San Diego, California, for video demonstrations. This paper documents those accomplishments, discusses the details of their implementation, and describes how these demonstrations supports Sandia`s overall strategies in ATM networking.

  6. HeNCE: A Heterogeneous Network Computing Environment

    DOE Public Access Gateway for Energy & Science Beta (PAGES Beta)

    Beguelin, Adam; Dongarra, Jack J.; Geist, George Al; Manchek, Robert; Moore, Keith

    1994-01-01

    Network computing seeks to utilize the aggregate resources of many networked computers to solve a single problem. In so doing it is often possible to obtain supercomputer performance from an inexpensive local area network. The drawback is that network computing is complicated and error prone when done by hand, especially if the computers have different operating systems and data formats and are thus heterogeneous. The heterogeneous network computing environment (HeNCE) is an integrated graphical environment for creating and running parallel programs over a heterogeneous collection of computers. It is built on a lower level package called parallel virtual machine (PVM).more » The HeNCE philosophy of parallel programming is to have the programmer graphically specify the parallelism of a computation and to automate, as much as possible, the tasks of writing, compiling, executing, debugging, and tracing the network computation. Key to HeNCE is a graphical language based on directed graphs that describe the parallelism and data dependencies of an application. Nodes in the graphs represent conventional Fortran or C subroutines and the arcs represent data and control flow. This article describes the present state of HeNCE, its capabilities, limitations, and areas of future research.« less

  7. Self-organization of network dynamics into local quantized states

    DOE Public Access Gateway for Energy & Science Beta (PAGES Beta)

    Nicolaides, Christos; Juanes, Ruben; Cueto-Felgueroso, Luis

    2016-02-17

    Self-organization and pattern formation in network-organized systems emerges from the collective activation and interaction of many interconnected units. A striking feature of these non-equilibrium structures is that they are often localized and robust: only a small subset of the nodes, or cell assembly, is activated. Understanding the role of cell assemblies as basic functional units in neural networks and socio-technical systems emerges as a fundamental challenge in network theory. A key open question is how these elementary building blocks emerge, and how they operate, linking structure and function in complex networks. Here we show that a network analogue of themore » Swift-Hohenberg continuum model—a minimal-ingredients model of nodal activation and interaction within a complex network—is able to produce a complex suite of localized patterns. Thus, the spontaneous formation of robust operational cell assemblies in complex networks can be explained as the result of self-organization, even in the absence of synaptic reinforcements.« less

  8. Time lagged ordinal partition networks for capturing dynamics of continuous dynamical systems

    SciTech Connect (OSTI)

    McCullough, Michael; Iu, Herbert Ho-Ching; Small, Michael; Stemler, Thomas

    2015-05-15

    We investigate a generalised version of the recently proposed ordinal partition time series to network transformation algorithm. First, we introduce a fixed time lag for the elements of each partition that is selected using techniques from traditional time delay embedding. The resulting partitions define regions in the embedding phase space that are mapped to nodes in the network space. Edges are allocated between nodes based on temporal succession thus creating a Markov chain representation of the time series. We then apply this new transformation algorithm to time series generated by the Rssler system and find that periodic dynamics translate to ring structures whereas chaotic time series translate to band or tube-like structuresthereby indicating that our algorithm generates networks whose structure is sensitive to system dynamics. Furthermore, we demonstrate that simple network measures including the mean out degree and variance of out degrees can track changes in the dynamical behaviour in a manner comparable to the largest Lyapunov exponent. We also apply the same analysis to experimental time series generated by a diode resonator circuit and show that the network size, mean shortest path length, and network diameter are highly sensitive to the interior crisis captured in this particular data set.

  9. Physical Modeling of Scaled Water Distribution System Networks.

    SciTech Connect (OSTI)

    O'Hern, Timothy J.; Hammond, Glenn Edward; Orear, Leslie ,; van Bloemen Waanders, Bart G.; Paul Molina; Ross Johnson

    2005-10-01

    Threats to water distribution systems include release of contaminants and Denial of Service (DoS) attacks. A better understanding, and validated computational models, of the flow in water distribution systems would enable determination of sensor placement in real water distribution networks, allow source identification, and guide mitigation/minimization efforts. Validation data are needed to evaluate numerical models of network operations. Some data can be acquired in real-world tests, but these are limited by 1) unknown demand, 2) lack of repeatability, 3) too many sources of uncertainty (demand, friction factors, etc.), and 4) expense. In addition, real-world tests have limited numbers of network access points. A scale-model water distribution system was fabricated, and validation data were acquired over a range of flow (demand) conditions. Standard operating variables included system layout, demand at various nodes in the system, and pressure drop across various pipe sections. In addition, the location of contaminant (salt or dye) introduction was varied. Measurements of pressure, flowrate, and concentration at a large number of points, and overall visualization of dye transport through the flow network were completed. Scale-up issues that that were incorporated in the experiment design include Reynolds number, pressure drop across nodes, and pipe friction and roughness. The scale was chosen to be 20:1, so the 10 inch main was modeled with a 0.5 inch pipe in the physical model. Controlled validation tracer tests were run to provide validation to flow and transport models, especially of the degree of mixing at pipe junctions. Results of the pipe mixing experiments showed large deviations from predicted behavior and these have a large impact on standard network operations models.3

  10. On Modeling and Analysis of MIMO Wireless Mesh Networks with Triangular Overlay Topology

    DOE Public Access Gateway for Energy & Science Beta (PAGES Beta)

    Cao, Zhanmao; Wu, Chase Q.; Zhang, Yuanping; Shiva, Sajjan G.; Gu, Yi

    2015-01-01

    Multiple input multiple output (MIMO) wireless mesh networks (WMNs) aim to provide the last-mile broadband wireless access to the Internet. Along with the algorithmic development for WMNs, some fundamental mathematical problems also emerge in various aspects such as routing, scheduling, and channel assignment, all of which require an effective mathematical model and rigorous analysis of network properties. In this paper, we propose to employ Cartesian product of graphs (CPG) as a multichannel modeling approach and explore a set of unique properties of triangular WMNs. In each layer of CPG with a single channel, we design a node coordinate scheme thatmore » retains the symmetric property of triangular meshes and develop a function for the assignment of node identity numbers based on their coordinates. We also derive a necessary-sufficient condition for interference-free links and combinatorial formulas to determine the number of the shortest paths for channel realization in triangular WMNs.« less

  11. Transforming Ordinary BUildings inot Smart Buildings via Low-Cost, Self-Powering Wireless Sensors & Sensor Networks

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    Transforming Ordinary Buildings into Smart Buildings via Low-Cost, Self-Powering Wireless Sensors & Sensor Networks 2016 Building Technologies Office Peer Review Philip Feng, Ph.D., philip.feng@case.edu Case Western Reserve University Gateway Wireless Sensor Node Wireless Relay 2 Project Summary Timeline: Start date: 10/01/2014 Planned end date: 09/30/2014 Key Milestones 1. Design Energy Harvesting ASIC; 12/31/2014 2. Tapeout ASIC and Test Circuit; 6/30/2015 3. Complete Sensor Node;

  12. Method and apparatus for analyzing error conditions in a massively parallel computer system by identifying anomalous nodes within a communicator set

    DOE Patents [OSTI]

    Gooding, Thomas Michael

    2011-04-19

    An analytical mechanism for a massively parallel computer system automatically analyzes data retrieved from the system, and identifies nodes which exhibit anomalous behavior in comparison to their immediate neighbors. Preferably, anomalous behavior is determined by comparing call-return stack tracebacks for each node, grouping like nodes together, and identifying neighboring nodes which do not themselves belong to the group. A node, not itself in the group, having a large number of neighbors in the group, is a likely locality of error. The analyzer preferably presents this information to the user by sorting the neighbors according to number of adjoining members of the group.

  13. A Prognostic Index for Predicting Lymph Node Metastasis in Minor Salivary Gland Cancer

    SciTech Connect (OSTI)

    Lloyd, Shane; Yu, James B. [Department of Therapeutic Radiology, Yale University School of Medicine, New Haven, CT (United States); Ross, Douglas A. [Department of Surgery, St. Vincent's Medical Center, Bridgeport, CT (United States); Wilson, Lynn D. [Department of Therapeutic Radiology, Yale University School of Medicine, New Haven, CT (United States); Decker, Roy H., E-mail: roy.decker@yale.ed [Department of Therapeutic Radiology, Yale University School of Medicine, New Haven, CT (United States)

    2010-01-15

    Purpose: Large studies examining the clinical and pathological factors associated with nodal metastasis in minor salivary gland cancer are lacking in the literature. Methods and Materials: Using the Surveillance, Epidemiology, and End Results (SEER) database, we identified 2,667 minor salivary gland cancers with known lymph node status from 1988 to 2004. Univariate and multivariate analyses were conducted to identify factors associated with the use of neck dissection, the use of external beam radiation therapy, and the presence of cervical lymph node metastases. Results: Four hundred twenty-six (16.0%) patients had neck nodal involvement. Factors associated with neck nodal involvement on univariate analysis included increasing age, male sex, increasing tumor size, high tumor grade, T3-T4 stage, adenocarcinoma or mucoepidermoid carcinomas, and pharyngeal site of primary malignancy. On multivariate analysis, four statistically significant factors were identified, including male sex, T3-T4 stage, pharyngeal site of primary malignancy, and high-grade adenocarcinoma or high-grade mucoepidermoid carcinomas. The proportions (and 95% confidence intervals) of patients with lymph node involvement for those with 0, 1, 2, 3, and 4 of these prognostic factors were 0.02 (0.01-0.03), 0.09 (0.07-0.11), 0.17 (0.14-0.21), 0.41 (0.33-0.49), and 0.70 (0.54-0.85), respectively. Grade was a significant predictor of metastasis for adenocarcinoma and mucoepidermoid carcinoma but not for adenoid cystic carcinoma. Conclusions: A prognostic index using the four clinicopathological factors listed here can effectively differentiate patients into risk groups of nodal metastasis. The precision of this index is subject to the limitations of SEER data and should be validated in further clinical studies.

  14. Network II Database

    Energy Science and Technology Software Center (OSTI)

    1994-11-07

    The Oak Ridge National Laboratory (ORNL) Rail and Barge Network II Database is a representation of the rail and barge system of the United States. The network is derived from the Federal Rail Administration (FRA) rail database.

  15. Constructing compact and effective graphs for recommender systems via node and edge aggregations

    DOE Public Access Gateway for Energy & Science Beta (PAGES Beta)

    Lee, Sangkeun; Kahng, Minsuk; Lee, Sang-goo

    2014-12-10

    Exploiting graphs for recommender systems has great potential to flexibly incorporate heterogeneous information for producing better recommendation results. As our baseline approach, we first introduce a naive graph-based recommendation method, which operates with a heterogeneous log-metadata graph constructed from user log and content metadata databases. Although the na ve graph-based recommendation method is simple, it allows us to take advantages of heterogeneous information and shows promising flexibility and recommendation accuracy. However, it often leads to extensive processing time due to the sheer size of the graphs constructed from entire user log and content metadata databases. In this paper, we proposemore » node and edge aggregation approaches to constructing compact and e ective graphs called Factor-Item bipartite graphs by aggregating nodes and edges of a log-metadata graph. Furthermore, experimental results using real world datasets indicate that our approach can significantly reduce the size of graphs exploited for recommender systems without sacrificing the recommendation quality.« less

  16. Study of node and mass sensitivity of resonant mode based cantilevers with concentrated mass loading

    SciTech Connect (OSTI)

    Zhang, Kewei Chai, Yuesheng; Fu, Jiahui

    2015-12-15

    Resonant-mode based cantilevers are an important type of acoustic wave based mass-sensing devices. In this work, the governing vibration equation of a bi-layer resonant-mode based cantilever attached with concentrated mass is established by using a modal analysis method. The effects of resonance modes and mass loading conditions on nodes and mass sensitivity of the cantilever were theoretically studied. The results suggested that the node did not shift when concentrated mass was loaded on a specific position. Mass sensitivity of the cantilever was linearly proportional to the square of the point displacement at the mass loading position for all the resonance modes. For the first resonance mode, when mass loading position x{sub c} satisfied 0 < x{sub c} < ∼ 0.3l (l is the cantilever beam length and 0 represents the rigid end), mass sensitivity decreased as the mass increasing while the opposite trend was obtained when mass loading satisfied ∼0.3l ≤ x{sub c} ≤ l. Mass sensitivity did not change when concentrated mass was loaded at the rigid end. This work can provide scientific guidance to optimize the mass sensitivity of a resonant-mode based cantilever.

  17. Science-Driven Network

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Science-Driven Network Requirements for ESnet Update to the 2002 Office of Science Networking Requirements Workshop Report February 21, 2006 1-1 Science-Driven Network Requirements for ESnet Update to the 2002 Office of Science Networking Requirements Workshop Report February 21, 2006 Contributors Paul Adams, LBNL (Advanced Light Source) Shane Canon, ORNL (NLCF) Steven Carter, ORNL (NLCF) Brent Draney, LBNL (NERSC) Martin Greenwald, MIT (Magnetic Fusion Energy) Jason Hodges, ORNL (Spallation

  18. BES Science Network Requirements

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Network Requirements Report of the Basic Energy Sciences Network Requirements Workshop Conducted June 4-5, 2007 BES Science Network Requirements Workshop Basic Energy Sciences Program Office, DOE Office of Science Energy Sciences Network Washington, DC - June 4 and 5, 2007 ESnet is funded by the US Dept. of Energy, Office of Science, Advanced Scientific Computing Research (ASCR) program. Dan Hitchcock is the ESnet Program Manager. ESnet is operated by Lawrence Berkeley National Laboratory, which

  19. Calorimetry Network Program

    Energy Science and Technology Software Center (OSTI)

    1998-01-30

    This is a Windows NT based program to run the SRTC designed calorimeters. The network version can communicate near real time data and final data values over the network. This version, due to network specifics, can function in a stand-alone operation also.

  20. Metallic nanowire networks

    DOE Patents [OSTI]

    Song, Yujiang; Shelnutt, John A.

    2012-11-06

    A metallic nanowire network synthesized using chemical reduction of a metal ion source by a reducing agent in the presence of a soft template comprising a tubular inverse micellar network. The network of interconnected polycrystalline nanowires has a very high surface-area/volume ratio, which makes it highly suitable for use in catalytic applications.

  1. LBNL Transactional Network Applications

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    Transactional Network Environmental Energy Technologies Division, Lawrence Berkeley National Laboratory LBNL Team: Mary Ann Piette, Richard Brown, Phil Price, Janie Page, Stephen Czarnecki, Anna Liao, Stephen Lanzisera, Jessica Granderson . LBNL Transactional Network Applications 2 | Building Technologies Office eere.energy.gov LBNL Transactional Network Applications Baseline Load Shape provides basis for measuring change in peak demand and energy use Demand Response Event Scheduler coordinates

  2. Scaling the Earth System Grid to 100Gbps Networks

    SciTech Connect (OSTI)

    Balman, Mehmet; Sim, Alex

    2012-03-02

    The SC11 demonstration, titled Scaling the Earth System Grid to 100Gbps Networks, showed the ability to use underlying infrastructure for the movement of climate data over 100Gbps network. Climate change research is one of the critical data intensive sciences, and the amount of data is continuously growing. Climate simulation data is geographically distributed over the world, and it needs to be accessed from many sources for fast and efficient analysis and inter-comparison of simulations. We used a 100Gbps link connecting National Energy Research Scientific Computing Center (NERSC) at Lawrence Berkeley National Laboratory (LBNL), Argonne National Laboratory (ANL) and Oak Ridge National Laboratory (ORNL). In the demo, the Intergovernmental Panel on Climate Change (IPCC) Fourth Assessment Report (AR4) phase 3 of the Coupled Model Intercomparison Project (CMIP-3) dataset was staged into the memory of computing nodes at ANL and ORNL from NERSC over the 100Gbps network for analysis and visualization. In general, climate simulation data consists of relatively small and large files with irregular file size distribution in each dataset. In this demo, we addressed challenges on data management in terms of high bandwidth networks, usability of existing protocols and middleware tools, and how applications can adapt and benefit from next generation networks.

  3. Active patterning and asymmetric transport in a model actomyosin network

    SciTech Connect (OSTI)

    Wang, Shenshen; Wolynes, Peter G.

    2013-12-21

    Cytoskeletal networks, which are essentially motor-filament assemblies, play a major role in many developmental processes involving structural remodeling and shape changes. These are achieved by nonequilibrium self-organization processes that generate functional patterns and drive intracellular transport. We construct a minimal physical model that incorporates the coupling between nonlinear elastic responses of individual filaments and force-dependent motor action. By performing stochastic simulations we show that the interplay of motor processes, described as driving anti-correlated motion of the network vertices, and the network connectivity, which determines the percolation character of the structure, can indeed capture the dynamical and structural cooperativity which gives rise to diverse patterns observed experimentally. The buckling instability of individual filaments is found to play a key role in localizing collapse events due to local force imbalance. Motor-driven buckling-induced node aggregation provides a dynamic mechanism that stabilizes the two-dimensional patterns below the apparent static percolation limit. Coordinated motor action is also shown to suppress random thermal noise on large time scales, the two-dimensional configuration that the system starts with thus remaining planar during the structural development. By carrying out similar simulations on a three-dimensional anchored network, we find that the myosin-driven isotropic contraction of a well-connected actin network, when combined with mechanical anchoring that confers directionality to the collective motion, may represent a novel mechanism of intracellular transport, as revealed by chromosome translocation in the starfish oocyte.

  4. Enerlogics Networks | Open Energy Information

    Open Energy Info (EERE)

    Networks Name: Enerlogics Networks Place: Pittsburgh, Pennsylvania Product: buidling automation control systems to utility software solutions to telecommunication systems...

  5. Gas-Dynamic Transients Flow Networks

    Energy Science and Technology Software Center (OSTI)

    1987-09-01

    TVENT1P predicts flows and pressures in a ventilation system or other air pathway caused by pressure transients, such as a tornado. For an analytical model to simulate an actual system, it must have (1) the same arrangement of components in a network of flow paths; (2) the same friction characteristics; (3) the same boundary pressures; (4) the same capacitance; and (5) the same forces that drive the air. A specific set of components used formore » constructing the analytical model includes filters, dampers, ducts, blowers, rooms, or volume connected at nodal points to form networks. The effects of a number of similar components can be lumped into a single one. TVENT1P contains a material transport algorithm and features for turning blowers off and on, changing blower speeds, changing the resistance of dampers and filters, and providing a filter model to handle very high flows. These features make it possible to depict a sequence of events during a single run. Component properties are varied using time functions. The filter model is not used by the code unless it is specified by the user. The basic results of a TVENT1P solution are flows in branches and pressures at nodes. A postprocessor program, PLTTEX, is included to produce the plots specified in the TVENT1P input. PLTTEX uses the proprietary CA-DISSPLA graphics software.« less

  6. Radiation detection and situation management by distributed sensor networks

    SciTech Connect (OSTI)

    Jan, Frigo; Mielke, Angela; Cai, D Michael

    2009-01-01

    Detection of radioactive materials in an urban environment usually requires large, portal-monitor-style radiation detectors. However, this may not be a practical solution in many transport scenarios. Alternatively, a distributed sensor network (DSN) could complement portal-style detection of radiological materials through the implementation of arrays of low cost, small heterogeneous sensors with the ability to detect the presence of radioactive materials in a moving vehicle over a specific region. In this paper, we report on the use of a heterogeneous, wireless, distributed sensor network for traffic monitoring in a field demonstration. Through wireless communications, the energy spectra from different radiation detectors are combined to improve the detection confidence. In addition, the DSN exploits other sensor technologies and algorithms to provide additional information about the vehicle, such as its speed, location, class (e.g. car, truck), and license plate number. The sensors are in-situ and data is processed in real-time at each node. Relevant information from each node is sent to a base station computer which is used to assess the movement of radioactive materials.

  7. Internet protocol network mapper

    DOE Patents [OSTI]

    Youd, David W.; Colon III, Domingo R.; Seidl, Edward T.

    2016-02-23

    A network mapper for performing tasks on targets is provided. The mapper generates a map of a network that specifies the overall configuration of the network. The mapper inputs a procedure that defines how the network is to be mapped. The procedure specifies what, when, and in what order the tasks are to be performed. Each task specifies processing that is to be performed for a target to produce results. The procedure may also specify input parameters for a task. The mapper inputs initial targets that specify a range of network addresses to be mapped. The mapper maps the network by, for each target, executing the procedure to perform the tasks on the target. The results of the tasks represent the mapping of the network defined by the initial targets.

  8. Development of a High-Temperature Smart Transducer Interface Node and Telemetry System (HSTINTS)

    SciTech Connect (OSTI)

    Buckner, M.A. et al.

    2006-11-03

    Halliburton Energy Services and Oak Ridge National Laboratory established a CRADA to conduct applied research to develop a general purpose, High-Temperature, Smart Transducer Interface Node and Telemetry System (HSTINTS) capable of temporally-coherent multiple-channel, high speed, high-resolution data transuction and acquisition while operating in a hostile thermal, chemical, and pressure environment for extended periods of time over a single coaxial cable. This ambitious, high-risk effort required development of custom dielectric isolated integrated circuits, amplified hybrid couplers for telemetry and an audio-frequency based power supply and distribution system using an engineered application of standing waves to compensate voltage drop along a 2 mile long cable. Several goals were achieved but underestimated challenges and a couple of mistakes hampered progress. When it was determined that an additional year of concerted effort would be required to complete the system demonstration, the sponsor withdrew funding and terminated the effort.

  9. Clinical Utility of the Modified Segmental Boost Technique for Treatment of the Pelvis and Inguinal Nodes

    SciTech Connect (OSTI)

    Moran, M.S.; Castrucci, W.A.; Ahmad, M.; Song, H.; Lund, M.W.; Mani, S.; Chamberlain, Daniel; Higgins, S.A.

    2010-03-15

    Purpose: Low-lying pelvic malignancies often require simultaneous radiation to pelvis and inguinal nodes. We previously reported improved homogeneity with the modified segmental boost technique (MSBT) compared to that with traditional methods, using phantom models. Here we report our institutional clinical experience with MSBT. Methods and Materials: MSBT patients from May 2001 to March 2007 were evaluated. Parameters analyzed included isocenter/multileaf collimation shifts, time per fraction (four fields), monitor units (MU)/fraction, femoral doses, maximal dose relative to body mass index, and inguinal node depth. In addition, a dosimetric comparison of the MSBT versus intensity modulated radiation therapy (IMRT) was conducted. Results: Of the 37 MSBT patients identified, 32 were evaluable. Port film adjustments were required in 6% of films. Median values for each analyzed parameter were as follows: MU/fraction, 298 (range, 226-348); delivery time, 4 minutes; inguinal depth, 4.5 cm; volume receiving 45 Gy (V45), 7%; V27.5, 87%; body mass index, 25 (range, 16.0-33.8). Inguinal dose was 100% in all cases; in-field inhomogeneity ranged from 111% to 118%. IMRT resulted in significantly decreased dose to normal tissue but required more time for treatment planning and a higher number of MUs (1,184 vs. 313 MU). Conclusions: In our clinical experience, the mono-isocentric MSBT provides a high degree of accuracy, improved homogeneity compared with traditional techniques, ease of simulation, treatment planning, treatment delivery, and acceptable femoral doses for pelvic/inguinal radiation fields requiring 45 to 50.4 Gy. In addition, the MSBT delivers a relatively uniform dose distribution throughout the treatment volume, despite varying body habitus. Clinical scenarios for the use of MSBT vs. intensity-modulated radiation therapy are discussed. To our knowledge, this is the first study reporting the utility of MSBT in the clinical setting.

  10. Determining when a set of compute nodes participating in a barrier operation on a parallel computer are ready to exit the barrier operation

    DOE Patents [OSTI]

    Blocksome, Michael A.

    2011-12-20

    Methods, apparatus, and products are disclosed for determining when a set of compute nodes participating in a barrier operation on a parallel computer are ready to exit the barrier operation that includes, for each compute node in the set: initializing a barrier counter with no counter underflow interrupt; configuring, upon entering the barrier operation, the barrier counter with a value in dependence upon a number of compute nodes in the set; broadcasting, by a DMA engine on the compute node to each of the other compute nodes upon entering the barrier operation, a barrier control packet; receiving, by the DMA engine from each of the other compute nodes, a barrier control packet; modifying, by the DMA engine, the value for the barrier counter in dependence upon each of the received barrier control packets; exiting the barrier operation if the value for the barrier counter matches the exit value.

  11. Seven Deadliest Network Attacks

    SciTech Connect (OSTI)

    Prowell, Stacy J; Borkin, Michael; Kraus, Robert

    2010-05-01

    Do you need to keep up with the latest hacks, attacks, and exploits effecting networks? Then you need "Seven Deadliest Network Attacks". This book pinpoints the most dangerous hacks and exploits specific to networks, laying out the anatomy of these attacks including how to make your system more secure. You will discover the best ways to defend against these vicious hacks with step-by-step instruction and learn techniques to make your computer and network impenetrable. Attacks detailed in this book include: Denial of Service; War Dialing; Penetration 'Testing'; Protocol Tunneling; Spanning Tree Attacks; Man-in-the-Middle; and, Password Replay. Knowledge is power, find out about the most dominant attacks currently waging war on computers and networks globally. Discover the best ways to defend against these vicious attacks; step-by-step instruction shows you how. Institute countermeasures, don't be caught defenseless again, learn techniques to make your computer and network impenetrable.

  12. Networking and Application Strategies

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Networking and Application Strategies Networking and Application Strategies Los Alamos Lab recruits the best minds on the planet and offers job search information and assistance to our dual career spouses or partners. Contact Us dualcareers@lanl.gov You know more people than you think Having strong existing connections and building new ones is essential to finding a job-especially for a dual career family that is new to the Los Alamos area. Networking is a proven and effective way to increase

  13. BER Science Network Requirements

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    ... However, once this step is completed, the network transfers of data or documentation may not need the same level of protection accorded to the authentication credentials. For the ...

  14. LBNL Transactional Network Applications

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    Load Shape provides basis for measuring change in peak demand and energy use Demand Response Event Scheduler coordinates DR signals from outside server with available network ...

  15. Energy Sciences Network (ESnet)

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    making it the standard for research institutions today. Read More ESnet Releases Open Source Software from MyESnet Portal for Building Online Interactive Network Portals ESnet...

  16. battery electrode percolating network

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    battery electrode percolating network - Sandia Energy Energy Search Icon Sandia Home ... Energy Storage Nuclear Power & Engineering Grid Modernization Battery Testing Nuclear Fuel ...

  17. Network Requirements Reviews

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Reviews Network Requirements Reviews Documents and Background Materials FAQ for Case Study Authors BER Requirements Review 2015 ASCR Requirements Review 2015 Previous...

  18. Rooftop Unit Network Project

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    part load performance - equipment maintenance * RTUs cannot easily interact with the ... Diagnostics - RTU Network Platform * Smart Monitoring and Diagnostics - Cloud * Autonomous ...

  19. Impact of network topology on synchrony of oscillatory power grids

    SciTech Connect (OSTI)

    Rohden, Martin; Sorge, Andreas; Witthaut, Dirk; Timme, Marc

    2014-03-15

    Replacing conventional power sources by renewable sources in current power grids drastically alters their structure and functionality. In particular, power generation in the resulting grid will be far more decentralized, with a distinctly different topology. Here, we analyze the impact of grid topologies on spontaneous synchronization, considering regular, random, and small-world topologies and focusing on the influence of decentralization. We model the consumers and sources of the power grid as second order oscillators. First, we analyze the global dynamics of the simplest non-trivial (two-node) network that exhibit a synchronous (normal operation) state, a limit cycle (power outage), and coexistence of both. Second, we estimate stability thresholds for the collective dynamics of small network motifs, in particular, star-like networks and regular grid motifs. For larger networks, we numerically investigate decentralization scenarios finding that decentralization itself may support power grids in exhibiting a stable state for lower transmission line capacities. Decentralization may thus be beneficial for power grids, regardless of the details of their resulting topology. Regular grids show a specific sharper transition not found for random or small-world grids.

  20. Better Buildings Residential Network | Department of Energy

    Energy Savers [EERE]

    Residential Buildings Better Buildings Residential Network Better Buildings Residential Network Better Buildings Residential Network Explore Latest Peer Exchange Call Summaries ...

  1. On Deployment of Multiple Base Stations for Energy-Efficient Communication in Wireless Sensor Networks

    DOE Public Access Gateway for Energy & Science Beta (PAGES Beta)

    Lin, Yunyue; Wu, Qishi; Cai, Xiaoshan; Du, Xiaojiang; Kwon, Ki-Hyeon

    2010-01-01

    Data transmission from sensor nodes to a base station or a sink node often incurs significant energy consumption, which critically affects network lifetime. We generalize and solve the problem of deploying multiple base stations to maximize network lifetime in terms of two different metrics under one-hop and multihop communication models. In the one-hop communication model, the sensors far away from base stations always deplete their energy much faster than others. We propose an optimal solution and a heuristic approach based on the minimal enclosing circle algorithm to deploy a base station at the geometric center of each cluster. In themore » multihop communication model, both base station location and data routing mechanism need to be considered in maximizing network lifetime. We propose an iterative algorithm based on rigorous mathematical derivations and use linear programming to compute the optimal routing paths for data transmission. Simulation results show the distinguished performance of the proposed deployment algorithms in maximizing network lifetime.« less

  2. Risk Factors for Regional Nodal Relapse in Breast Cancer Patients With One to Three Positive Axillary Nodes

    SciTech Connect (OSTI)

    Yates, Lucy; Kirby, Anna; Crichton, Siobhan; Gillett, Cheryl; Cane, Paul; Fentiman, Ian; Sawyer, Elinor

    2012-04-01

    Purpose: In many centers, supraclavicular fossa radiotherapy (SCF RT) is not routinely offered to breast cancer patients with one to three positive lymph nodes. We aimed to identify a subgroup of these patients who are at high risk of supra or infraclavicular fossa relapse (SCFR) such that they can be offered SCFRT at the time of diagnosis to improve long term locoregional control. Methods and Materials: We performed a retrospective analysis of the pathological features of 1,065 cases of invasive breast cancer with one to three positive axillary lymph nodes. Patients underwent radical breast conserving surgery or mastectomy. A total of 45% of patients received adjuvant chest wall/breast RT. No patients received adjuvant SCFRT. The primary outcome was SCFR. Secondary outcomes were chest wall/breast recurrence, distant metastasis, all death, and breast-cancer specific death. Kaplan-Meier estimates were used to calculate actuarial event rates and survival functions compared using log-rank tests. Multivariate analyses (MVA) of factors associated with outcome were conducted using Cox proportional hazards models. Results: Median follow-up was 9.7 years. SCFR rate was 9.2%. Median time from primary diagnosis to SCFR was 3.4 years (range, 0.7-14.4 years). SCFR was associated with significantly lower 10-year survival (18% vs. 65%; p < 0.001). Higher grade and number of positive lymph nodes were the most significant predictors of SCFR on MVA (p < 0.001). 10 year SCFR rates were less than 1% in all patients with Grade 1 cancers compared with 30% in those having Grade 3 cancers with three positive lymph nodes. Additional factors associated with SCFR on univariate analysis but not on MVA included larger nodal deposits (p = 0.002) and proportion of positive nodes (p = 0.003). Conclusions: Breast cancer patients with one to three positive lymph nodes have a heterogenous risk of SCFR. Patients with two to three positive axillary nodes and/or high-grade disease may warrant

  3. Dosimetric evaluation of three adaptive strategies for prostate cancer treatment including pelvic lymph nodes irradiation

    SciTech Connect (OSTI)

    Cantin, Audrey; Gingras, Luc; Archambault, Louis; Lachance, Bernard; Foster, William; Goudreault, Julie

    2015-12-15

    Purpose: The movements of the prostate relative to the pelvic lymph nodes during intensity-modulated radiation therapy treatment can limit margin reduction and affect the protection of the organs at risk (OAR). In this study, the authors performed an analysis of three adaptive treatment strategies that combine information from both bony and gold marker registrations. The robustness of those treatments against the interfraction prostate movements was evaluated. Methods: A retrospective study was conducted on five prostate cancer patients with 7–13 daily cone-beam CTs (CBCTs). The clinical target volumes (CTVs) consisting of pelvic lymph nodes, prostate, and seminal vesicles as well as the OARs were delineated on each CBCT and the initial CT. Three adaptive strategies were analyzed. Two of these methods relied on a two-step patient positioning at each fraction. First step: a bony registration was used to deliver the nodal CTV prescription. Second step: a gold marker registration was then used either to (1) complete the dose delivered to the prostate (complement); (2) or give almost the entire prescription to the prostate with a weak dose gradient between the targets to compensate for possible motions (gradient). The third method (COR) used a pool of precalculated plans based on images acquired at previous treatment fractions. At each new fraction, a plan is selected from that pool based on the daily position of prostate center-of-mass. The dosimetric comparison was conducted and results are presented with and without the systematic shift in the prostate position on the CT planning. The adaptive strategies were compared to the current clinical standard where all fractions are treated with the initial nonadaptive plan. Results: The minimum daily prostate D{sub 95%} is improved by 2%, 9%, and 6% for the complement, the gradient, and the COR approaches, respectively, compared to the nonadaptive method. The average nodal CTV D{sub 95%} remains constant across the

  4. Design and development of Stirling Engines for stationary power generation applications in the 500 to 3000 hp range. Subtask 1A report: state-of-the-art conceptual design

    SciTech Connect (OSTI)

    1980-03-01

    The first portion of the Conceptual Design Study of Stirling Engines for Stationary Power Application in the 500 to 3000 hp range which was aimed at state-of-the-art stationary Stirling engines for a 1985 hardware demonstration is summarized. The main goals of this effort were to obtain reliable cost data for a stationary Stirling engine capable of meeting future needs for total energy/cogeneration sysems and to establish a pragmatic and conservative base design for a first generation hardware. Starting with an extensive screening effort, 4 engine types, i.e., V-type crank engine, radial engine, swashplate engine, and rhombic drive engine, and 3 heat transport systems, i.e., heat pipe, pressurized gas heat transport loop, and direct gas fired system, were selected. After a preliminary layout cycle, the rhombic drive engine was eliminated due to intolerable maintenance difficulties on the push rod seals. V, radial and swashplate engines were taken through a detailed design/layout cycle, to establish all important design features and reliable engine weights. After comparing engine layouts and analyzing qualitative and quantitative evaluation criteria, the V-crank engine was chosen as the candidate for a 1985 hardware demonstration.

  5. Form:Networking Organization | Open Energy Information

    Open Energy Info (EERE)

    Networking Organization Jump to: navigation, search Add a Networking Organization Input your networking organization name below to add to the registry. If your networking...

  6. Postoperative Radiation Therapy With or Without Concurrent Chemotherapy for Node-Positive Thoracic Esophageal Squamous Cell Carcinoma

    SciTech Connect (OSTI)

    Chen, Junqiang; Pan, Jianji; Liu, Jian; Li, Jiancheng; Zhu, Kunshou; Zheng, Xiongwei; Chen, Mingqiang; Chen, Ming; Liao, Zhongxing

    2013-07-15

    Purpose: To retrospectively compare the efficacy of radiation therapy (RT) and chemotherapy plus RT (CRT) for the postoperative treatment of node-positive thoracic esophageal squamous cell carcinoma (TESCC) and to determine the incidence and severity of toxic reactions. Methods and Materials: We retrospectively reviewed data from 304 patients who had undergone esophagectomy with 3-field lymph node dissection for TESCC and were determined by postoperative pathology to have lymph node metastasis without distant hematogenous metastasis. Of these patients, 164 underwent postoperative chemotherapy (cisplatin 80 mg/m{sup 2}, average days 1-3, plus paclitaxel 135 mg/m{sup 2}, day 1; 21-day cycle) plus RT (50 Gy), and 140 underwent postoperative RT alone. Results: The 5-year overall survival rates for the CRT and RT groups were 47.4% and 38.6%, respectively (P=.030). The distant metastasis rate, the mixed (regional lymph node and distant) metastasis rate, and the overall recurrence rate were significantly lower in the CRT group than in the RT group (P<.05). However, mild and severe early toxic reactions, including neutropenia, radiation esophagitis, and gastrointestinal reaction, were significantly more common in the CRT group than in the RT group (P<.05). No significant differences in incidence of late toxic reactions were found between the 2 groups. Conclusions: Our results show that in node-positive TESCC patients, postoperative CRT is significantly more effective than RT alone at increasing the overall survival and decreasing the rates of distant metastasis, mixed metastasis, and overall recurrence. Severe early toxic reactions were more common with CRT than with RT alone, but patients could tolerate CRT.

  7. Collective network routing

    DOE Patents [OSTI]

    Hoenicke, Dirk

    2014-12-02

    Disclosed are a unified method and apparatus to classify, route, and process injected data packets into a network so as to belong to a plurality of logical networks, each implementing a specific flow of data on top of a common physical network. The method allows to locally identify collectives of packets for local processing, such as the computation of the sum, difference, maximum, minimum, or other logical operations among the identified packet collective. Packets are injected together with a class-attribute and an opcode attribute. Network routers, employing the described method, use the packet attributes to look-up the class-specific route information from a local route table, which contains the local incoming and outgoing directions as part of the specifically implemented global data flow of the particular virtual network.

  8. Residential Network Members Unite to Form Green Bank Network...

    Broader source: Energy.gov (indexed) [DOE]

    The NY Green Bank logo. Residential Network members Connecticut Green Bank and NY Green Bank, a division of Residential Network member New York State Energy Research and ...

  9. Minor antigen graft-versus-host reactions revealed in irradiated spleen and popliteal lymph node assays

    SciTech Connect (OSTI)

    Claman, H.N.; Jaffee, B.D.

    1984-10-01

    The graft-versus-hot (GVH) reaction across minor (non-H-2) histocompatibility barriers was studied in mice, in vivo. To increase GVH potential and to mimic clinical bone marrow transplantation protocols, we modified the popliteal lymph node (PLN) and the splenomegaly assays by irradiating the recipients before they received allogeneic lymphoid cell suspensions. In several combinations across major (H-2), minor (non-H-2) and multiple minor (non-H-2 plus minor lymphocyte stimulation) barriers, increased recipient organ weight (a measure of GVH activity) was seen with irradiated F1 recipients of parental cells. The irradiated splenomegaly (x-splenomegaly) assay was more sensitive than the (x-PLN) assay, but both correlated with in vivo GVH experiments of the P----F1 variety. The x-splenomegaly test indicated histoincompatibility in a system (B10.D2----BALB/c) in which the primary in vitro mixed leukocyte reactions is nonreactive, but in which systemic GVH can be induced. The x-splenomegaly test should be useful in analyzing complex reactions involving minor histocompatibility antigens in vivo.

  10. Tungsten polyoxometalate molecules as active nodes for dynamic carrier exchange in hybrid molecular/semiconductor capacitors

    SciTech Connect (OSTI)

    Balliou, A.; Douvas, A. M.; Normand, P.; Argitis, P.; Glezos, N.; Tsikritzis, D.; Kennou, S.

    2014-10-14

    In this work we study the utilization of molecular transition metal oxides known as polyoxometalates (POMs), in particular the Keggin structure anions of the formula PW₁₂O₄₀³⁻, as active nodes for potential switching and/or fast writing memory applications. The active molecules are being integrated in hybrid Metal-Insulator/POM molecules-Semiconductor capacitors, which serve as prototypes allowing investigation of critical performance characteristics towards the design of more sophisticated devices. The charging ability as well as the electronic structure of the molecular layer is probed by means of electrical characterization, namely, capacitance-voltage and current-voltage measurements, as well as transient capacitance measurements, C (t), under step voltage polarization. It is argued that the transient current peaks observed are manifestations of dynamic carrier exchange between the gate electrode and specific molecular levels, while the transient C (t) curves under conditions of molecular charging can supply information for the rate of change of the charge that is being trapped and de-trapped within the molecular layer. Structural characterization via surface and cross sectional scanning electron microscopy as well as atomic force microscopy, spectroscopic ellipsometry, UV and Fourier-transform IR spectroscopies, UPS, and XPS contribute to the extraction of accurate electronic structure characteristics and open the path for the design of new devices with on-demand tuning of their interfacial properties via the controlled preparation of the POM layer.

  11. Architecture of the Multi-Modal Organizational Research and Production Heterogeneous Network (MORPHnet)

    SciTech Connect (OSTI)

    Aiken, R.J.; Carlson, R.A.; Foster, I.T.

    1997-01-01

    The research and education (R&E) community requires persistent and scaleable network infrastructure to concurrently support production and research applications as well as network research. In the past, the R&E community has relied on supporting parallel network and end-node infrastructures, which can be very expensive and inefficient for network service managers and application programmers. The grand challenge in networking is to provide support for multiple, concurrent, multi-layer views of the network for the applications and the network researchers, and to satisfy the sometimes conflicting requirements of both while ensuring one type of traffic does not adversely affect the other. Internet and telecommunications service providers will also benefit from a multi-modal infrastructure, which can provide smoother transitions to new technologies and allow for testing of these technologies with real user traffic while they are still in the pre-production mode. The authors proposed approach requires the use of as much of the same network and end system infrastructure as possible to reduce the costs needed to support both classes of activities (i.e., production and research). Breaking the infrastructure into segments and objects (e.g., routers, switches, multiplexors, circuits, paths, etc.) gives the capability to dynamically construct and configure the virtual active networks to address these requirements. These capabilities must be supported at the campus, regional, and wide-area network levels to allow for collaboration by geographically dispersed groups. The Multi-Modal Organizational Research and Production Heterogeneous Network (MORPHnet) described in this report is an initial architecture and framework designed to identify and support the capabilities needed for the proposed combined infrastructure and to address related research issues.

  12. Robust Maximum Lifetime Routing and Energy Allocation in Wireless Sensor Networks

    DOE Public Access Gateway for Energy & Science Beta (PAGES Beta)

    Paschalidis, Ioannis Ch.; Wu, Ruomin

    2012-01-01

    We consider the maximum lifetime routing problem in wireless sensor networks in two settings: (a) when nodes’ initial energy is given and (b) when it is subject to optimization. The optimal solution and objective value provide optimal flows and the corresponding predicted lifetime, respectively. We stipulate that there is uncertainty in various network parameters (available energy and energy depletion rates). In setting (a) we show that for specific, yet typical, network topologies, the actual network lifetime will reach the predicted value with a probability that converges to zero as the number of nodes grows large. In setting (b) the samemore » result holds for all topologies. We develop a series of robust problem formulations, ranging from pessimistic to optimistic. A set of parameters enable the tuning of the conservatism of the formulation to obtain network flows with a desirably high probability that the corresponding lifetime prediction is achieved. We establish a number of properties for the robust network flows and energy allocations and provide numerical results to highlight the tradeoff between predicted lifetime and the probability achieved. Further, we analyze an interesting limiting regime of massively deployed sensor networks and essentially solve a continuous version of the problem.« less

  13. Management of Large-Scale Wireless Sensor Networks Utilizing Multi-Parent Recursive Area Hierarchies

    SciTech Connect (OSTI)

    Cree, Johnathan V.; Delgado-Frias, Jose

    2013-04-19

    Autonomously configuring and self-healing a largescale wireless sensor network requires a light-weight maintenance protocol that is scalable. Further, in a battery powered wireless sensor network duty-cycling a node’s radio can reduce the power consumption of a device and extend the lifetime of a network. With duty-cycled nodes the power consumption of a node’s radio depends on the amount of communication is must perform and by reducing the communication the power consumption can also be reduced. Multi-parent hierarchies can be used to reduce the communication cost when constructing a recursive area clustering hierarchy when compared to singleparent solutions that utilize inefficient communication methods such as flooding and information propagation via single-hop broadcasts. The multi-parent hierarchies remain scalable and provides a level of redundancy for the hierarchy.

  14. BES Science Network Requirements

    SciTech Connect (OSTI)

    Biocca, Alan; Carlson, Rich; Chen, Jackie; Cotter, Steve; Tierney, Brian; Dattoria, Vince; Davenport, Jim; Gaenko, Alexander; Kent, Paul; Lamm, Monica; Miller, Stephen; Mundy, Chris; Ndousse, Thomas; Pederson, Mark; Perazzo, Amedeo; Popescu, Razvan; Rouson, Damian; Sekine, Yukiko; Sumpter, Bobby; Dart, Eli; Wang, Cai-Zhuang -Z; Whitelam, Steve; Zurawski, Jason

    2011-02-01

    The Energy Sciences Network (ESnet) is the primary provider of network connectivityfor the US Department of Energy Office of Science (SC), the single largest supporter of basic research in the physical sciences in the United States. In support of the Office ofScience programs, ESnet regularly updates and refreshes its understanding of the networking requirements of the instruments, facilities, scientists, and science programs that it serves. This focus has helped ESnet to be a highly successful enabler of scientific discovery for over 20 years.

  15. SU-E-T-206: Improving Radiotherapy Toxicity Based On Artificial Neural Network (ANN) for Head and Neck Cancer Patients

    SciTech Connect (OSTI)

    Cho, Daniel D; Wernicke, A Gabriella; Nori, Dattatreyudu; Chao, KSC; Parashar, Bhupesh; Chang, Jenghwa

    2014-06-01

    Purpose/Objective(s): The aim of this study is to build the estimator of toxicity using artificial neural network (ANN) for head and neck cancer patients Materials/Methods: An ANN can combine variables into a predictive model during training and considered all possible correlations of variables. We constructed an ANN based on the data from 73 patients with advanced H and N cancer treated with external beam radiotherapy and/or chemotherapy at our institution. For the toxicity estimator we defined input data including age, sex, site, stage, pathology, status of chemo, technique of external beam radiation therapy (EBRT), length of treatment, dose of EBRT, status of post operation, length of follow-up, the status of local recurrences and distant metastasis. These data were digitized based on the significance and fed to the ANN as input nodes. We used 20 hidden nodes (for the 13 input nodes) to take care of the correlations of input nodes. For training ANN, we divided data into three subsets such as training set, validation set and test set. Finally, we built the estimator for the toxicity from ANN output. Results: We used 13 input variables including the status of local recurrences and distant metastasis and 20 hidden nodes for correlations. 59 patients for training set, 7 patients for validation set and 7 patients for test set and fed the inputs to Matlab neural network fitting tool. We trained the data within 15% of errors of outcome. In the end we have the toxicity estimation with 74% of accuracy. Conclusion: We proved in principle that ANN can be a very useful tool for predicting the RT outcomes for high risk H and N patients. Currently we are improving the results using cross validation.

  16. The Role of Pretreatment FDG-PET in Treating Cervical Cancer Patients With Enlarged Pelvic Lymph Node(s) Shown on MRI: A Phase 3 Randomized Trial With Long-Term Follow-Up

    SciTech Connect (OSTI)

    Lin, Shinn-Yn; Tsai, Chien-Sheng; Chang, Yu-Chen; Ng, Koon-Kwan; Chang, Ting-Chang; Kao, Wei-Heng; Lai, Chyong-Huey; Hong, Ji-Hong

    2015-07-01

    Purpose: This report is the second analysis of a prospective randomized trial to investigate the impact of {sup 18}F-fluorodeoxyglucose positron emission tomography (FDG-PET) on cervical cancer patients with enlarged pelvic lymph nodes identified by magnetic resonance imaging. Methods and Materials: Patients with newly diagnosed cervical cancer with enlarged pelvic lymph nodes but free of enlarged para-aortic lymph nodes (PALN) were eligible. Patients were randomized to receive either pretreatment FDG-PET (PET arm) or not (control arm). The whole pelvis was the standard irradiation field for all patients except those with FDG-avid extrapelvic findings. Results: In all, 129 patients were enrolled. Pretreatment PET detected extrapelvic metastases in 7 patients. No new patient experienced treatment failure during the additional 4-year follow-up period. There were no significant differences between the PET arm and the control arm regarding overall survival, disease-free survival, and freedom from extrapelvic metastasis. In the control arm, 8 of 10 patients with PALN relapse had limited extrapelvic nodal failures; their 5-year disease-specific survival was 34.3%. By contrast, only 1 of 5 patients with PALN relapse in the PET arm experienced such limited failures; their 5-year survival rate was 0%. Conclusions: Although the pretreatment detection of PALN did not translate into survival benefit, it indeed decreased the need for extended-field concurrent chemoradiation therapy.

  17. Evaluation of Automatic Atlas-Based Lymph Node Segmentation for Head-and-Neck Cancer

    SciTech Connect (OSTI)

    Stapleford, Liza J.; Lawson, Joshua D.; Perkins, Charles; Edelman, Scott; Davis, Lawrence

    2010-07-01

    Purpose: To evaluate if automatic atlas-based lymph node segmentation (LNS) improves efficiency and decreases inter-observer variability while maintaining accuracy. Methods and Materials: Five physicians with head-and-neck IMRT experience used computed tomography (CT) data from 5 patients to create bilateral neck clinical target volumes covering specified nodal levels. A second contour set was automatically generated using a commercially available atlas. Physicians modified the automatic contours to make them acceptable for treatment planning. To assess contour variability, the Simultaneous Truth and Performance Level Estimation (STAPLE) algorithm was used to take collections of contours and calculate a probabilistic estimate of the 'true' segmentation. Differences between the manual, automatic, and automatic-modified (AM) contours were analyzed using multiple metrics. Results: Compared with the 'true' segmentation created from manual contours, the automatic contours had a high degree of accuracy, with sensitivity, Dice similarity coefficient, and mean/max surface disagreement values comparable to the average manual contour (86%, 76%, 3.3/17.4 mm automatic vs. 73%, 79%, 2.8/17 mm manual). The AM group was more consistent than the manual group for multiple metrics, most notably reducing the range of contour volume (106-430 mL manual vs. 176-347 mL AM) and percent false positivity (1-37% manual vs. 1-7% AM). Average contouring time savings with the automatic segmentation was 11.5 min per patient, a 35% reduction. Conclusions: Using the STAPLE algorithm to generate 'true' contours from multiple physician contours, we demonstrated that, in comparison with manual segmentation, atlas-based automatic LNS for head-and-neck cancer is accurate, efficient, and reduces interobserver variability.

  18. Energy Efficient Digital Networks

    Broader source: Energy.gov (indexed) [DOE]

    and rising * About 7% of all U.S. electricity consumption -Much of this digitally networked already Our Future? Media room in high-end home Electronics are Different - Service ...

  19. NP Science Network Requirements

    SciTech Connect (OSTI)

    Dart, Eli; Rotman, Lauren; Tierney, Brian

    2011-08-26

    The Energy Sciences Network (ESnet) is the primary provider of network connectivity for the U.S. Department of Energy (DOE) Office of Science (SC), the single largest supporter of basic research in the physical sciences in the United States. To support SC programs, ESnet regularly updates and refreshes its understanding of the networking requirements of the instruments, facilities, scientists, and science programs it serves. This focus has helped ESnet to be a highly successful enabler of scientific discovery for over 20 years. In August 2011, ESnet and the Office of Nuclear Physics (NP), of the DOE SC, organized a workshop to characterize the networking requirements of the programs funded by NP. The requirements identified at the workshop are summarized in the Findings section, and are described in more detail in the body of the report.

  20. Modeling attacker-defender interactions in information networks.

    SciTech Connect (OSTI)

    Collins, Michael Joseph

    2010-09-01

    The simplest conceptual model of cybersecurity implicitly views attackers and defenders as acting in isolation from one another: an attacker seeks to penetrate or disrupt a system that has been protected to a given level, while a defender attempts to thwart particular attacks. Such a model also views all non-malicious parties as having the same goal of preventing all attacks. But in fact, attackers and defenders are interacting parts of the same system, and different defenders have their own individual interests: defenders may be willing to accept some risk of successful attack if the cost of defense is too high. We have used game theory to develop models of how non-cooperative but non-malicious players in a network interact when there is a substantial cost associated with effective defensive measures. Although game theory has been applied in this area before, we have introduced some novel aspects of player behavior in our work, including: (1) A model of how players attempt to avoid the costs of defense and force others to assume these costs; (2) A model of how players interact when the cost of defending one node can be shared by other nodes; and (3) A model of the incentives for a defender to choose less expensive, but less effective, defensive actions.

  1. Energy Materials Network Overview

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    30 th , 2016 2 MGI - Framework New Material Innovations for Clean Energy 2X Faster and 2X Cheaper Predictive Simulation Across Scales Synthesis & Characterization Rapid Screening End Use Performance Process Scalability Process Control Real-time Characterization Reliability Validation Data Management & Informatics Coordinated resource network with a suite of capabilities for advanced materials R&D In Support of the Materials Genome Initiative (MGI) 3 Network Requirements 1. WORLD

  2. Virtual machine-based simulation platform for mobile ad-hoc network-based cyber infrastructure

    DOE Public Access Gateway for Energy & Science Beta (PAGES Beta)

    Yoginath, Srikanth B.; Perumalla, Kayla S.; Henz, Brian J.

    2015-09-29

    In modeling and simulating complex systems such as mobile ad-hoc networks (MANETs) in de-fense communications, it is a major challenge to reconcile multiple important considerations: the rapidity of unavoidable changes to the software (network layers and applications), the difficulty of modeling the critical, implementation-dependent behavioral effects, the need to sustain larger scale scenarios, and the desire for faster simulations. Here we present our approach in success-fully reconciling them using a virtual time-synchronized virtual machine(VM)-based parallel ex-ecution framework that accurately lifts both the devices as well as the network communications to a virtual time plane while retaining full fidelity. At themore » core of our framework is a scheduling engine that operates at the level of a hypervisor scheduler, offering a unique ability to execute multi-core guest nodes over multi-core host nodes in an accurate, virtual time-synchronized manner. In contrast to other related approaches that suffer from either speed or accuracy issues, our framework provides MANET node-wise scalability, high fidelity of software behaviors, and time-ordering accuracy. The design and development of this framework is presented, and an ac-tual implementation based on the widely used Xen hypervisor system is described. Benchmarks with synthetic and actual applications are used to identify the benefits of our approach. The time inaccuracy of traditional emulation methods is demonstrated, in comparison with the accurate execution of our framework verified by theoretically correct results expected from analytical models of the same scenarios. In the largest high fidelity tests, we are able to perform virtual time-synchronized simulation of 64-node VM-based full-stack, actual software behaviors of MANETs containing a mix of static and mobile (unmanned airborne vehicle) nodes, hosted on a 32-core host, with full fidelity of unmodified ad-hoc routing protocols, unmodified

  3. Virtual machine-based simulation platform for mobile ad-hoc network-based cyber infrastructure

    SciTech Connect (OSTI)

    Yoginath, Srikanth B.; Perumalla, Kayla S.; Henz, Brian J.

    2015-09-29

    In modeling and simulating complex systems such as mobile ad-hoc networks (MANETs) in de-fense communications, it is a major challenge to reconcile multiple important considerations: the rapidity of unavoidable changes to the software (network layers and applications), the difficulty of modeling the critical, implementation-dependent behavioral effects, the need to sustain larger scale scenarios, and the desire for faster simulations. Here we present our approach in success-fully reconciling them using a virtual time-synchronized virtual machine(VM)-based parallel ex-ecution framework that accurately lifts both the devices as well as the network communications to a virtual time plane while retaining full fidelity. At the core of our framework is a scheduling engine that operates at the level of a hypervisor scheduler, offering a unique ability to execute multi-core guest nodes over multi-core host nodes in an accurate, virtual time-synchronized manner. In contrast to other related approaches that suffer from either speed or accuracy issues, our framework provides MANET node-wise scalability, high fidelity of software behaviors, and time-ordering accuracy. The design and development of this framework is presented, and an ac-tual implementation based on the widely used Xen hypervisor system is described. Benchmarks with synthetic and actual applications are used to identify the benefits of our approach. The time inaccuracy of traditional emulation methods is demonstrated, in comparison with the accurate execution of our framework verified by theoretically correct results expected from analytical models of the same scenarios. In the largest high fidelity tests, we are able to perform virtual time-synchronized simulation of 64-node VM-based full-stack, actual software behaviors of MANETs containing a mix of static and mobile (unmanned airborne vehicle) nodes, hosted on a 32-core host, with full fidelity of unmodified ad-hoc routing protocols, unmodified application

  4. Hewlett Packard Company HP | Open Energy Information

    Open Energy Info (EERE)

    Alto, California Zip: 94304 Sector: Solar Product: US-based personal and corporate computer manufacturer, software developer, and IT infrastructure company and owner of SunPower...

  5. Title (46 pt. HP Simplified bold)

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    itself in servers and in the enterprise. We offer a path forward that applies these lower-end technologies and several emerging technologies together. This leads to a picture...

  6. Overview of the National Geothermal Data System (NGDS) and DOEs Geothermal Data Repository (GDR) node on the NGDS

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    1 Arlene F. Anderson Technology Manager Geothermal Technologies Office Overview of the National Geothermal Data System (NGDS) & Department of Energy's Geothermal Data Repository (GDR) node on the NGDS National Geothermal Data System (NGDS) User Interface NGDS is a catalog of documents and datasets that provide information about geothermal resources within the United States, including information from other parts of the world, used to:  Determine geothermal potential;  Guide exploration

  7. Role of FDG-PET in the Implementation of Involved-Node Radiation Therapy for Hodgkin Lymphoma Patients

    SciTech Connect (OSTI)

    Girinsky, Théodore; Aupérin, Anne; Ribrag, Vincent; Elleuch, Manel; Fermé, Christophe; Bonniaud, Guillaume; Ruelle, Claude; Alberini, Jean-Louis; Celebic, Aljosa; Edeline, Véronique

    2014-08-01

    Purpose: This study examines the role of {sup 18}F-labeled fluorodeoxyglucose positron emission tomography (FDG-PET) in the implementation of involved-node radiation therapy (INRT) in patients treated for clinical stages (CS) I/II supradiaphragmatic Hodgkin lymphoma (HL). Methods and Material: Patients with untreated CS I/II HL enrolled in the randomized EORTC/LYSA/FIL Intergroup H10 trial and participating in a real-time prospective quality assurance program were prospectively included in this study. Data were electronically obtained from 18 French cancer centers. All patients underwent APET-computed tomography (PET-CT) and a post-chemotherapy planning CT scanning. The pre-chemotherapy gross tumor volume (GTV) and the postchemotherapy clinical target volume (CTV) were first delineated on CT only by the radiation oncologist. The planning PET was then co-registered, and the delineated volumes were jointly analyzed by the radiation oncologist and the nuclear medicine physician. Lymph nodes undetected on CT but FDG-avid were recorded, and the previously determined GTV and CTV were modified according to FDG-PET results. Results: From March 2007 to February 2010, 135 patients were included in the study. PET-CT identified at least 1 additional FDG-avid lymph node in 95 of 135 patients (70.4%; 95% confidence interval [CI]: 61.9%-77.9%) and 1 additional lymph node area in 55 of 135 patients (40.7%; 95% CI: 32.4%-49.5%). The mean increases in the GTV and CTV were 8.8% and 7.1%, respectively. The systematic addition of PET to CT led to a CTV increase in 60% of the patients. Conclusions: Pre-chemotherapy FDG-PET leads to significantly better INRT delineation without necessarily increasing radiation volumes.

  8. Network analysis of proton transfer in liquid water

    SciTech Connect (OSTI)

    Shevchuk, Roman; Rao, Francesco; Agmon, Noam

    2014-06-28

    Proton transfer in macromolecular systems is a fascinating yet elusive process. In the last ten years, molecular simulations have shown to be a useful tool to unveil the atomistic mechanism. Notwithstanding, the large number of degrees of freedom involved make the accurate description of the process very hard even for the case of proton diffusion in bulk water. Here, multi-state empirical valence bond molecular dynamics simulations in conjunction with complex network analysis are applied to study proton transfer in liquid water. Making use of a transition network formalism, this approach takes into account the time evolution of several coordinates simultaneously. Our results provide evidence for a strong dependence of proton transfer on the length of the hydrogen bond solvating the Zundel complex, with proton transfer enhancement as shorter bonds are formed at the acceptor site. We identify six major states (nodes) on the network leading from the special pair to a more symmetric Zundel complex required for transferring the proton. Moreover, the second solvation shell specifically rearranges to promote the transfer, reiterating the idea that solvation beyond the first shell of the Zundel complex plays a crucial role in the process.

  9. Network Randomization and Dynamic Defense for Critical Infrastructure Systems

    SciTech Connect (OSTI)

    Chavez, Adrian R.; Martin, Mitchell Tyler; Hamlet, Jason; Stout, William M.S.; Lee, Erik

    2015-04-01

    Critical Infrastructure control systems continue to foster predictable communication paths, static configurations, and unpatched systems that allow easy access to our nation's most critical assets. This makes them attractive targets for cyber intrusion. We seek to address these attack vectors by automatically randomizing network settings, randomizing applications on the end devices themselves, and dynamically defending these systems against active attacks. Applying these protective measures will convert control systems into moving targets that proactively defend themselves against attack. Sandia National Laboratories has led this effort by gathering operational and technical requirements from Tennessee Valley Authority (TVA) and performing research and development to create a proof-of-concept solution. Our proof-of-concept has been tested in a laboratory environment with over 300 nodes. The vision of this project is to enhance control system security by converting existing control systems into moving targets and building these security measures into future systems while meeting the unique constraints that control systems face.

  10. Software-Defined Networking (SDN)

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    ENOS Experimental Network Testbeds Performance (perfSONAR) Software & Tools Development Data for Researchers Partnerships Publications Workshops Science Engagement Move your data Programs & Workshops Science Requirements Reviews Case Studies News & Publications ESnet News Publications and Presentations Galleries ESnet Awards and Honors Blog ESnet Live Home » Network R&D » Software-Defined Networking (SDN) Network R&D Software-Defined Networking (SDN) ENOS Experimental

  11. Alignment Focus of Daily Image Guidance for Concurrent Treatment of Prostate and Pelvic Lymph Nodes

    SciTech Connect (OSTI)

    Ferjani, Samah; Huang, Guangshun; Shang, Qingyang; Stephans, Kevin L.; Zhong, Yahua; Qi, Peng; Tendulkar, Rahul D.; Xia, Ping, E-mail: xiap@ccf.org

    2013-10-01

    Purpose: To determine the dosimetric impact of daily imaging alignment focus on the prostate soft tissue versus the pelvic bones for the concurrent treatment of the prostate and pelvic lymph nodes (PLN) and to assess whether multileaf collimator (MLC) tracking or adaptive planning (ART) is necessary with the current clinical planning margins of 8 mm/6 mm posterior to the prostate and 5 mm to the PLN. Methods and Materials: A total of 124 kilovoltage cone-beam computed tomography (kV-CBCT) images from 6 patients were studied. For each KV-CBCT, 4 plans were retrospectively created using an isocenter shifting method with 2 different alignment focuses (prostate, PLN), an MLC shifting method, and the ART method. The selected dosimetric endpoints were compared among these plans. Results: For the isoshift contour, isoshift bone, MLC shift, and ART plans, D99 of the prostate was ?97% of the prescription dose in 97.6%, 73.4%, 98.4%, and 96.8% of 124 fractions, respectively. Accordingly, D99 of the PLN was ?97% of the prescription dose in 98.4%, 98.4%, 98.4%, and 100% of 124 fractions, respectively. For the rectum, D5 exceeded 105% of the planned D5 (and D5 of ART plans) in 11% (4%), 10% (2%), and 13% (5%) of 124 fractions, respectively. For the bladder, D5 exceeded 105% of the planned D5 (and D5 of ART) plans in 0% (2%), 0% (2%), and 0% (1%) of 124 fractions, respectively. Conclusion: For concurrent treatment of the prostate and PLN, with a planning margin to the prostate of 8 mm/6 mm posterior and a planning margin of 5 mm to the PLN, aligning to the prostate soft tissue can achieve adequate dose coverage to the both target volumes; aligning to the pelvic bone would result in underdosing to the prostate in one-third of fractions. With these planning margins, MLC tracking and ART methods have no dosimetric advantages.

  12. Evaluation of a CdTe semiconductor based compact gamma camera for sentinel lymph node imaging

    SciTech Connect (OSTI)

    Russo, Paolo; Curion, Assunta S.; Mettivier, Giovanni; Esposito, Michela; Aurilio, Michela; Caraco, Corradina; Aloj, Luigi; Lastoria, Secondo

    2011-03-15

    Purpose: The authors assembled a prototype compact gamma-ray imaging probe (MediPROBE) for sentinel lymph node (SLN) localization. This probe is based on a semiconductor pixel detector. Its basic performance was assessed in the laboratory and clinically in comparison with a conventional gamma camera. Methods: The room-temperature CdTe pixel detector (1 mm thick) has 256x256 square pixels arranged with a 55 {mu}m pitch (sensitive area 14.08x14.08 mm{sup 2}), coupled pixel-by-pixel via bump-bonding to the Medipix2 photon-counting readout CMOS integrated circuit. The imaging probe is equipped with a set of three interchangeable knife-edge pinhole collimators (0.94, 1.2, or 2.1 mm effective diameter at 140 keV) and its focal distance can be regulated in order to set a given field of view (FOV). A typical FOV of 70 mm at 50 mm skin-to-collimator distance corresponds to a minification factor 1:5. The detector is operated at a single low-energy threshold of about 20 keV. Results: For {sup 99m}Tc, at 50 mm distance, a background-subtracted sensitivity of 6.5x10{sup -3} cps/kBq and a system spatial resolution of 5.5 mm FWHM were obtained for the 0.94 mm pinhole; corresponding values for the 2.1 mm pinhole were 3.3x10{sup -2} cps/kBq and 12.6 mm. The dark count rate was 0.71 cps. Clinical images in three patients with melanoma indicate detection of the SLNs with acquisition times between 60 and 410 s with an injected activity of 26 MBq {sup 99m}Tc and prior localization with standard gamma camera lymphoscintigraphy. Conclusions: The laboratory performance of this imaging probe is limited by the pinhole collimator performance and the necessity of working in minification due to the limited detector size. However, in clinical operative conditions, the CdTe imaging probe was effective in detecting SLNs with adequate resolution and an acceptable sensitivity. Sensitivity is expected to improve with the future availability of a larger CdTe detector permitting operation at shorter

  13. Development of a Neural Network Simulator for Studying the Constitutive Behavior of Structural Composite Materials

    DOE Public Access Gateway for Energy & Science Beta (PAGES Beta)

    Na, Hyuntae; Lee, Seung-Yub; Üstündag, Ersan; Ross, Sarah L.; Ceylan, Halil; Gopalakrishnan, Kasthurirangan

    2013-01-01

    This paper introduces a recent development and application of a noncommercial artificial neural network (ANN) simulator with graphical user interface (GUI) to assist in rapid data modeling and analysis in the engineering diffraction field. The real-time network training/simulation monitoring tool has been customized for the study of constitutive behavior of engineering materials, and it has improved data mining and forecasting capabilities of neural networks. This software has been used to train and simulate the finite element modeling (FEM) data for a fiber composite system, both forward and inverse. The forward neural network simulation precisely reduplicates FEM results several orders ofmore » magnitude faster than the slow original FEM. The inverse simulation is more challenging; yet, material parameters can be meaningfully determined with the aid of parameter sensitivity information. The simulator GUI also reveals that output node size for materials parameter and input normalization method for strain data are critical train conditions in inverse network. The successful use of ANN modeling and simulator GUI has been validated through engineering neutron diffraction experimental data by determining constitutive laws of the real fiber composite materials via a mathematically rigorous and physically meaningful parameter search process, once the networks are successfully trained from the FEM database.« less

  14. An in-depth longitudinal analysis of mixing patterns in a small scientific collaboration network

    SciTech Connect (OSTI)

    Rodriguez, Marko A; Pepe, Alberto

    2009-01-01

    Many investigations of scientific collaboration are based on large-scale statistical analyses of networks constructed from bibliographic repositories. These investigations often rely on a wealth of bibliographic data, but very little or no other information about the individuals in the network, and thus, fail to illustate the broader social and academic landscape in which collaboration takes place. In this article, we perform an in-depth longitudinal analysis of a small-scale network of scientific collaboration (N = 291) constructed from the bibliographic record of a research center involved in the development and application of sensor network technologies. We perform a preliminary analysis of selected structural properties of the network, computing its range, configuration and topology. We then support our preliminary statistical analysis with an in-depth temporal investigation of the assortativity mixing of these node characteristics: academic department, affiliation, position, and country of origin of the individuals in the network. Our qualitative analysis of mixing patterns offers clues as to the nature of the scientific community being modeled in relation to its organizational, disciplinary, institutional, and international arrangements of collaboration.

  15. High Density Sensor Network Development | The Ames Laboratory

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    High Density Sensor Network Development

  16. Method of and system for determining locations of sources of harmonics in a power distribution network

    SciTech Connect (OSTI)

    Hayes, R.M.; Kirkpatrick, T.L.; Lauletta, J.L.; Shuter, T.C.; Vollkommer, H.T. Jr.

    1987-05-19

    A system is described for determining directions of locations of sources of power harmonics relative to a node interconnecting n branches of a power distribution network, where n is an integer greater than or equal to 2, comprising: voltage transducer means for monitoring voltage waveforms in at least (n-1) of the n branches; current transducer means for monitoring current waveforms in at least (n-1) branches; means for sampling the current and voltage waveforms to obtain analog current and voltage waveform samples; A/D converter means for digitizing the analog waveform samples; and spectrum analyzer means for resolving the digitized samples into their respective harmonic components.

  17. Energy-efficient distributed constructions of miniumum spanning tree for wireless ad-hoc networks

    SciTech Connect (OSTI)

    Kumar, V. S. A.; Pandurangan, G.; Khan, M.

    2004-01-01

    The Minimum Spanning Tree (MST) problem is one of the most important and commonly occurring primitive in the design and operation of data and communication networks. While there a redistributed algorithms for the MST problem these require relatively large number of messages and time, and are fairly involved, require synchronization and a lot of book keeping; this makes these algorithms impractical for emerging technologies such as ad hoc and sensor networks. In such networks, a sensor has very limited power, and any algorithm needs to be simple, local and energy efficient for being practical. Motivated by these considerations, we study the performance of a class of simple and local algorithms called Nearest Neighbor Tree (NNT) algorithms for energy-efficient construction of MSTs in a wireless ad hoc setting. These employ a very simple idea to eliminate the work involved in cycle detection in other MST algorithms: each node chooses a distinct rank, and connects to the closest node of higher rank. We consider two variants of the NNT algorithms, obtained by two ways of choosing the ranks: (i) Random NNT, in which each node chooses a rank randomly, and (ii) Directional NNT, in which each node uses directional information for choosing the rank. We show provable bounds on the performance of these algorithms in instances obtained by uniformly distributed points in the unit square. Finally, we perform extensive simulations of our algorithms. We tested our algorithms on both uniformly random distributions of points, and on realistic distributions of points in an urban setting. The cost of the tree found by the NNT algorithms is within a factor of 2 of the MST, but there is more than a ten-fold saving on the energy and about a five fold saving on the number of messages sent. Also, our algorithms are significantly simpler to implement compared to, for instance, the GHS algorithm, which is essentially optimal with regards to the message complexity. Thus, our results

  18. Network topology mapper

    DOE Patents [OSTI]

    Quist, Daniel A.; Gavrilov, Eugene M.; Fisk, Michael E.

    2008-01-15

    A method enables the topology of an acyclic fully propagated network to be discovered. A list of switches that comprise the network is formed and the MAC address cache for each one of the switches is determined. For each pair of switches, from the MAC address caches the remaining switches that see the pair of switches are located. For each pair of switches the remaining switches are determined that see one of the pair of switches on a first port and the second one of the pair of switches on a second port. A list of insiders is formed for every pair of switches. It is determined whether the insider for each pair of switches is a graph edge and adjacent ones of the graph edges are determined. A symmetric adjacency matrix is formed from the graph edges to represent the topology of the data link network.

  19. Self-Configuring Network Monitor

    Energy Science and Technology Software Center (OSTI)

    2004-05-01

    Self-Configuring Network Monitor (SCNM) is a passive monitoring that can collect packet headers from any point in a network path. SCNM uses special activation packets to automatically activate monitors deployed at the layer three ingress and egress routers of the wide-area network, and at critical points within the site networks. Monitoring output data is sent back to the application data source or destination host. No modifications are required to the application or network routing infrastructuremore » in order to activate monitoring of traffic for an application. This ensures that the monitoring operation does not add a burden to the networks administrator.« less

  20. ASCR Science Network Requirements

    SciTech Connect (OSTI)

    Dart, Eli; Tierney, Brian

    2009-08-24

    The Energy Sciences Network (ESnet) is the primary provider of network connectivity for the US Department of Energy Office of Science, the single largest supporter of basic research in the physical sciences in the United States. In support of the Office of Science programs, ESnet regularly updates and refreshes its understanding of the networking requirements of the instruments, facilities, scientists, and science programs that it serves. This focus has helped ESnet to be a highly successful enabler of scientific discovery for over 20 years. In April 2009 ESnet and the Office of Advanced Scientific Computing Research (ASCR), of the DOE Office of Science, organized a workshop to characterize the networking requirements of the programs funded by ASCR. The ASCR facilities anticipate significant increases in wide area bandwidth utilization, driven largely by the increased capabilities of computational resources and the wide scope of collaboration that is a hallmark of modern science. Many scientists move data sets between facilities for analysis, and in some cases (for example the Earth System Grid and the Open Science Grid), data distribution is an essential component of the use of ASCR facilities by scientists. Due to the projected growth in wide area data transfer needs, the ASCR supercomputer centers all expect to deploy and use 100 Gigabit per second networking technology for wide area connectivity as soon as that deployment is financially feasible. In addition to the network connectivity that ESnet provides, the ESnet Collaboration Services (ECS) are critical to several science communities. ESnet identity and trust services, such as the DOEGrids certificate authority, are widely used both by the supercomputer centers and by collaborations such as Open Science Grid (OSG) and the Earth System Grid (ESG). Ease of use is a key determinant of the scientific utility of network-based services. Therefore, a key enabling aspect for scientists beneficial use of high

  1. Influence of Lymphatic Invasion on Locoregional Recurrence Following Mastectomy: Indication for Postmastectomy Radiotherapy for Breast Cancer Patients With One to Three Positive Nodes

    SciTech Connect (OSTI)

    Matsunuma, Ryoichi; Oguchi, Masahiko; Fujikane, Tomoko; Matsuura, Masaaki; Sakai, Takehiko; Kimura, Kiyomi; Morizono, Hidetomo; Iijima, Kotaro; Izumori, Ayumi; Miyagi, Yumi; Nishimura, Seiichiro; Makita, Masujiro; Gomi, Naoya; Horii, Rie; Akiyama, Futoshi; Iwase, Takuji

    2012-07-01

    Purpose: The indication for postmastectomy radiotherapy (PMRT) in breast cancer patients with one to three positive lymph nodes has been in discussion. The purpose of this study was to identify patient groups for whom PMRT may be indicated, focusing on varied locoregional recurrence rates depending on lymphatic invasion (ly) status. Methods and Materials: Retrospective analysis of 1,994 node-positive patients who had undergone mastectomy without postoperative radiotherapy between January 1990 and December 2000 at our hospital was performed. Patient groups for whom PMRT should be indicated were assessed using statistical tests based on the relationship between locoregional recurrence rate and ly status. Results: Multivariate analysis showed that the ly status affected the locoregional recurrence rate to as great a degree as the number of positive lymph nodes (p < 0.001). Especially for patients with one to three positive nodes, extensive ly was a more significant factor than stage T3 in the TNM staging system for locoregional recurrence (p < 0.001 vs. p = 0.295). Conclusion: Among postmastectomy patients with one to three positive lymph nodes, patients with extensive ly seem to require local therapy regimens similar to those used for patients with four or more positive nodes and also seem to require consideration of the use of PMRT.

  2. Northwest Biodiesel Network | Open Energy Information

    Open Energy Info (EERE)

    Biodiesel Network Jump to: navigation, search Logo: Northwest Biodiesel Network Name: Northwest Biodiesel Network Address: 6532 Phinney Ave N Place: Seattle, Washington Zip: 98103...

  3. Sustainable Agriculture Network | Open Energy Information

    Open Energy Info (EERE)

    Agriculture Network Jump to: navigation, search Logo: Sustainable Agriculture Network Name: Sustainable Agriculture Network Website: clima.sanstandards.org References: Sustainable...

  4. Benefits of Better Buildings Residential Network Reporting |...

    Energy Savers [EERE]

    Benefits of Better Buildings Residential Network Reporting Benefits of Better Buildings Residential Network Reporting Better Buildings Residential Network All-Member Peer Exchange ...

  5. Better Buildings Residential Network Orientation Webinar Call...

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    ... Residential Network (Residential Network) Better Buildings Residential Network: Connects energy efficiency programs and partners to share best practices to increase the ...

  6. Solar Instructor Training Network | Department of Energy

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    Instructor Training Network Solar Instructor Training Network The Solar Instructor Training Network promotes high-quality training in the installation of solar technologies. Nine ...

  7. Vehicle Technologies Office: National Idling Reduction Network...

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    National Idling Reduction Network News Archives Vehicle Technologies Office: National Idling Reduction Network News Archives The National Idling Reduction Network brings together ...

  8. Clean Economy Network Foundation | Open Energy Information

    Open Energy Info (EERE)

    Clean Economy Network Foundation Jump to: navigation, search Logo: Clean Economy Network Foundation Name: Clean Economy Network Foundation Address: 1301 Pennsylvania Ave NW, Suite...

  9. Identifying the Basal Angiosperm Node in Chloroplast GenomePhylogenies: Sampling One's Way Out of the Felsenstein Zone

    SciTech Connect (OSTI)

    Leebens-Mack, Jim; Raubeson, Linda A.; Cui, Liying; Kuehl,Jennifer V.; Fourcade, Matthew H.; Chumley, Timothy W.; Boore, JeffreyL.; Jansen, Robert K.; dePamphilis, Claude W.

    2005-05-27

    While there has been strong support for Amborella and Nymphaeales (water lilies) as branching from basal-most nodes in the angiosperm phylogeny, this hypothesis has recently been challenged by phylogenetic analyses of 61 protein-coding genes extracted from the chloroplast genome sequences of Amborella, Nymphaea and 12 other available land plant chloroplast genomes. These character-rich analyses placed the monocots, represented by three grasses (Poaceae), as sister to all other extant angiosperm lineages. We have extracted protein-coding regions from draft sequences for six additional chloroplast genomes to test whether this surprising result could be an artifact of long-branch attraction due to limited taxon sampling. The added taxa include three monocots (Acorus, Yucca and Typha), a water lily (Nuphar), a ranunculid(Ranunculus), and a gymnosperm (Ginkgo). Phylogenetic analyses of the expanded DNA and protein datasets together with microstructural characters (indels) provided unambiguous support for Amborella and the Nymphaeales as branching from the basal-most nodes in the angiospermphylogeny. However, their relative positions proved to be dependent on method of analysis, with parsimony favoring Amborella as sister to all other angiosperms, and maximum likelihood and neighbor-joining methods favoring an Amborella + Nympheales clade as sister. The maximum likelihood phylogeny supported the later hypothesis, but the likelihood for the former hypothesis was not significantly different. Parametric bootstrap analysis, single gene phylogenies, estimated divergence dates and conflicting in del characters all help to illuminate the nature of the conflict in resolution of the most basal nodes in the angiospermphylogeny. Molecular dating analyses provided median age estimates of 161 mya for the most recent common ancestor of all extant angiosperms and 145 mya for the most recent common ancestor of monocots, magnoliids andeudicots. Whereas long sequences reduce variance in

  10. Transactional Network Platform: Applications

    SciTech Connect (OSTI)

    Katipamula, Srinivas; Lutes, Robert G.; Ngo, Hung; Underhill, Ronald M.

    2013-10-31

    In FY13, Pacific Northwest National Laboratory (PNNL) with funding from the Department of Energy’s (DOE’s) Building Technologies Office (BTO) designed, prototyped and tested a transactional network platform to support energy, operational and financial transactions between any networked entities (equipment, organizations, buildings, grid, etc.). Initially, in FY13, the concept demonstrated transactions between packaged rooftop air conditioners and heat pump units (RTUs) and the electric grid using applications or "agents" that reside on the platform, on the equipment, on a local building controller or in the Cloud. The transactional network project is a multi-lab effort with Oakridge National Laboratory (ORNL) and Lawrence Berkeley National Laboratory (LBNL) also contributing to the effort. PNNL coordinated the project and also was responsible for the development of the transactional network (TN) platform and three different applications associated with RTUs. This document describes two applications or "agents" in details, and also summarizes the platform. The TN platform details are described in another companion document.

  11. Energy Materials Network Workshop

    Office of Energy Efficiency and Renewable Energy (EERE)

    The Energy Materials Network (EMN) is a national lab-led initiative that aims to dramatically decrease the time-to-market for advanced materials innovations critical to many clean energy technologies. Through targeted consortia offering accessible suites of advanced research and development capabilities, EMN is accelerating materials development to address U.S. manufacturers' most pressing materials challenges.

  12. Microsystem process networks

    DOE Patents [OSTI]

    Wegeng, Robert S [Richland, WA; TeGrotenhuis, Ward E [Kennewick, WA; Whyatt, Greg A [West Richland, WA

    2010-01-26

    Various aspects and applications or microsystem process networks are described. The design of many types of microsystems can be improved by ortho-cascading mass, heat, or other unit process operations. Microsystems having energetically efficient microchannel heat exchangers are also described. Detailed descriptions of numerous design features in microcomponent systems are also provided.

  13. Microsystem process networks

    DOE Patents [OSTI]

    Wegeng, Robert S.; TeGrotenhuis, Ward E.; Whyatt, Greg A.

    2006-10-24

    Various aspects and applications of microsystem process networks are described. The design of many types of microsystems can be improved by ortho-cascading mass, heat, or other unit process operations. Microsystems having exergetically efficient microchannel heat exchangers are also described. Detailed descriptions of numerous design features in microcomponent systems are also provided.

  14. Microsystem process networks

    DOE Patents [OSTI]

    Wegeng, Robert S.; TeGrotenhuis, Ward E.; Whyatt, Greg A.

    2007-09-18

    Various aspects and applications of microsystem process networks are described. The design of many types of Microsystems can be improved by ortho-cascading mass, heat, or other unit process operations. Microsystems having energetically efficient microchannel heat exchangers are also described. Detailed descriptions of numerous design features in microcomponent systems are also provided.

  15. BER Science Network Requirements

    SciTech Connect (OSTI)

    Alapaty, Kiran; Allen, Ben; Bell, Greg; Benton, David; Brettin, Tom; Canon, Shane; Dart, Eli; Cotter, Steve; Crivelli, Silvia; Carlson, Rich; Dattoria, Vince; Desai, Narayan; Egan, Richard; Tierney, Brian; Goodwin, Ken; Gregurick, Susan; Hicks, Susan; Johnston, Bill; de Jong, Bert; Kleese van Dam, Kerstin; Livny, Miron; Markowitz, Victor; McGraw, Jim; McCord, Raymond; Oehmen, Chris; Regimbal, Kevin; Shipman, Galen; Strand, Gary; Flick, Jeff; Turnbull, Susan; Williams, Dean; Zurawski, Jason

    2010-11-01

    The Energy Sciences Network (ESnet) is the primary provider of network connectivity for the US Department of Energy Office of Science, the single largest supporter of basic research in the physical sciences in the United States. In support of the Office of Science programs, ESnet regularly updates and refreshes its understanding of the networking requirements of the instruments, facilities, scientists, and science programs that it serves. This focus has helped ESnet to be a highly successful enabler of scientific discovery for over 20 years. In April 2010 ESnet and the Office of Biological and Environmental Research, of the DOE Office of Science, organized a workshop to characterize the networking requirements of the science programs funded by BER. The requirements identified at the workshop are summarized and described in more detail in the case studies and the Findings section. A number of common themes emerged from the case studies and workshop discussions. One is that BER science, like many other disciplines, is becoming more and more distributed and collaborative in nature. Another common theme is that data set sizes are exploding. Climate Science in particular is on the verge of needing to manage exabytes of data, and Genomics is on the verge of a huge paradigm shift in the number of sites with sequencers and the amount of sequencer data being generated.

  16. Residential Network Members Unite to Form Green Bank Network

    Broader source: Energy.gov [DOE]

    Residential Network members Connecticut Green Bank and NY Green Bank, a division of Residential Network member New York State Energy Research and Development Authority, have helped launch the Green Bank Network, a new international organization focused on collaborating to scale up private financing to meet the challenge of climate change.

  17. High Fidelity Simulations of Large-Scale Wireless Networks

    SciTech Connect (OSTI)

    Onunkwo, Uzoma; Benz, Zachary

    2015-11-01

    The worldwide proliferation of wireless connected devices continues to accelerate. There are 10s of billions of wireless links across the planet with an additional explosion of new wireless usage anticipated as the Internet of Things develops. Wireless technologies do not only provide convenience for mobile applications, but are also extremely cost-effective to deploy. Thus, this trend towards wireless connectivity will only continue and Sandia must develop the necessary simulation technology to proactively analyze the associated emerging vulnerabilities. Wireless networks are marked by mobility and proximity-based connectivity. The de facto standard for exploratory studies of wireless networks is discrete event simulations (DES). However, the simulation of large-scale wireless networks is extremely difficult due to prohibitively large turnaround time. A path forward is to expedite simulations with parallel discrete event simulation (PDES) techniques. The mobility and distance-based connectivity associated with wireless simulations, however, typically doom PDES and fail to scale (e.g., OPNET and ns-3 simulators). We propose a PDES-based tool aimed at reducing the communication overhead between processors. The proposed solution will use light-weight processes to dynamically distribute computation workload while mitigating communication overhead associated with synchronizations. This work is vital to the analytics and validation capabilities of simulation and emulation at Sandia. We have years of experience in Sandia’s simulation and emulation projects (e.g., MINIMEGA and FIREWHEEL). Sandia’s current highly-regarded capabilities in large-scale emulations have focused on wired networks, where two assumptions prevent scalable wireless studies: (a) the connections between objects are mostly static and (b) the nodes have fixed locations.

  18. Benchmarking the pseudopotential and fixed-node approximations in diffusion Monte Carlo calculations of molecules and solids

    DOE Public Access Gateway for Energy & Science Beta (PAGES Beta)

    Nazarov, Roman; Shulenburger, Luke; Morales, Miguel A.; Hood, Randolph Q.

    2016-03-28

    Diffusion Monte Carlo (DMC) calculations of the spectroscopic properties of a large set of molecules were performed, assessing the effect of different approximations. In systems containing elements with large atomic numbers, we show that the errors associated with the use of nonlocal mean-field-based pseudopotentials in DMC calculations can be significant and may surpass the fixed-node error. We suggest practical guidelines for reducing these pseudopotential errors, which allow us to obtain DMC-computed spectroscopic parameters of molecules and equation of state properties of solids in excellent agreement with experiment.

  19. Software Defined Networking (SDN) Project

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    Software Defined Networking (SDN) Project Energy sector-focused SDN flow controller to manage control system networks centrally and securely Background Traditional information technology (IT) approaches to network administration and packet delivery are not always appropriate for electric industry applications. The nondeterministic latency and configuration complexity make network design difficult for the deterministic, static control systems of the energy sector. In the electric industry, it is

  20. SU-E-T-51: Bayesian Network Models for Radiotherapy Error Detection

    SciTech Connect (OSTI)

    Kalet, A; Phillips, M; Gennari, J

    2014-06-01

    Purpose: To develop a probabilistic model of radiotherapy plans using Bayesian networks that will detect potential errors in radiation delivery. Methods: Semi-structured interviews with medical physicists and other domain experts were employed to generate a set of layered nodes and arcs forming a Bayesian Network (BN) which encapsulates relevant radiotherapy concepts and their associated interdependencies. Concepts in the final network were limited to those whose parameters are represented in the institutional database at a level significant enough to develop mathematical distributions. The concept-relation knowledge base was constructed using the Web Ontology Language (OWL) and translated into Hugin Expert Bayes Network files via the the RHugin package in the R statistical programming language. A subset of de-identified data derived from a Mosaiq relational database representing 1937 unique prescription cases was processed and pre-screened for errors and then used by the Hugin implementation of the Estimation-Maximization (EM) algorithm for machine learning all parameter distributions. Individual networks were generated for each of several commonly treated anatomic regions identified by ICD-9 neoplasm categories including lung, brain, lymphoma, and female breast. Results: The resulting Bayesian networks represent a large part of the probabilistic knowledge inherent in treatment planning. By populating the networks entirely with data captured from a clinical oncology information management system over the course of several years of normal practice, we were able to create accurate probability tables with no additional time spent by experts or clinicians. These probabilistic descriptions of the treatment planning allow one to check if a treatment plan is within the normal scope of practice, given some initial set of clinical evidence and thereby detect for potential outliers to be flagged for further investigation. Conclusion: The networks developed here support the

  1. Multiple network interface core apparatus and method

    DOE Patents [OSTI]

    Underwood, Keith D.; Hemmert, Karl Scott

    2011-04-26

    A network interface controller and network interface control method comprising providing a single integrated circuit as a network interface controller and employing a plurality of network interface cores on the single integrated circuit.

  2. Wireless Sensor Network for Electric Transmission Line Monitoring

    SciTech Connect (OSTI)

    Alphenaar, Bruce

    2009-06-30

    Generally, federal agencies tasked to oversee power grid reliability are dependent on data from grid infrastructure owners and operators in order to obtain a basic level of situational awareness. Since there are many owners and operators involved in the day-to-day functioning of the power grid, the task of accessing, aggregating and analyzing grid information from these sources is not a trivial one. Seemingly basic tasks such as synchronizing data timestamps between many different data providers and sources can be difficult as evidenced during the post-event analysis of the August 2003 blackout. In this project we investigate the efficacy and cost effectiveness of deploying a network of wireless power line monitoring devices as a method of independently monitoring key parts of the power grid as a complement to the data which is currently available to federal agencies from grid system operators. Such a network is modeled on proprietary power line monitoring technologies and networks invented, developed and deployed by Genscape, a Louisville, Kentucky based real-time energy information provider. Genscape measures transmission line power flow using measurements of electromagnetic fields under overhead high voltage transmission power lines in the United States and Europe. Opportunities for optimization of the commercial power line monitoring technology were investigated in this project to enable lower power consumption, lower cost and improvements to measurement methodologies. These optimizations were performed in order to better enable the use of wireless transmission line monitors in large network deployments (perhaps covering several thousand power lines) for federal situational awareness needs. Power consumption and cost reduction were addressed by developing a power line monitor using a low power, low cost wireless telemetry platform known as the ''Mote''. Motes were first developed as smart sensor nodes in wireless mesh networking applications. On such a platform

  3. Geometric universality of currents in an open network of interacting particles

    SciTech Connect (OSTI)

    Sinitsyn, Nikolai A; Chernyak, Vladimir Y; Chertkov, Michael

    2010-01-01

    We discuss a non-equilibrium statistical system on a graph or network. Identical particles are injected, interact with each other, traverse, and leave the graph in a stochastic manner described in terms of Poisson rates, possibly dependent on time and instantaneous occupation numbers at the nodes of the graph. We show that under the assumption of the relative rates constancy, the system demonstrates a profound statistical symmetry, resulting in geometric universality of the particle currents statistics. The phenomenon applies broadly to many man-made and natural open stochastic systems, such as queuing of packages over internet, transport of electrons and quasi-particles in mesoscopic systems, and chains of reactions in bio-chemical networks. We illustrate the utility of the general approach using two enabling examples from the two latter disciplines.

  4. Instructions for Using Virtual Private Network (VPN)

    Broader source: Energy.gov [DOE]

    Virtual Private Network (VPN) provides access to network drives and is recommended for use only from a EITS provided laptop.

  5. Better Buildings Network View | February 2015

    Broader source: Energy.gov [DOE]

    The Better Buildings Network View monthly newsletter from the U.S. Department of Energy's Better Buildings Residential Network.

  6. Renewable Energy Nongovernmental Organization Network (RENOVE...

    Open Energy Info (EERE)

    Nongovernmental Organization Network (RENOVE) Jump to: navigation, search Name: Renewable Energy Nongovernmental Organization Network (RENOVE) Place: Brasilia, Brazil Phone Number:...

  7. Better Buildings Network View | September 2014

    Broader source: Energy.gov [DOE]

    The Better Buildings Network View monthly newsletter from the U.S. Department of Energy's Better Buildings Residential Network.

  8. Better Buildings Network View | June 2014

    Broader source: Energy.gov [DOE]

    The Better Buildings Network View monthly newsletter from the U.S. Department of Energy's Better Buildings Residential Network.

  9. Better Buildings Network View | May 2015

    Broader source: Energy.gov [DOE]

    The Better Buildings Network View monthly newsletter from the U.S. Department of Energy's Better Buildings Residential Network.

  10. Better Buildings Network View | June 2015

    Broader source: Energy.gov [DOE]

    The Better Buildings Network View monthly newsletter from the U.S. Department of Energy's Better Buildings Residential Network.

  11. Better Buildings Network View | October 2014

    Broader source: Energy.gov [DOE]

    The Better Buildings Network View monthly newsletter from the U.S. Department of Energy's Better Buildings Residential Network.

  12. Better Buildings Network View | October 2015

    Broader source: Energy.gov [DOE]

    The Better Buildings Network View monthly newsletter from the U.S. Department of Energy's Better Buildings Residential Network.

  13. Better Buildings Network View | January 2016

    Broader source: Energy.gov [DOE]

    The Better Buildings Network View monthly newsletter from the U.S. Department of Energy's Better Buildings Residential Network.

  14. Better Buildings Network View | February 2016

    Broader source: Energy.gov [DOE]

    The Better Buildings Network View monthly newsletter from the U.S. Department of Energy's Better Buildings Residential Network.

  15. Better Buildings Network View | January 2014

    Broader source: Energy.gov [DOE]

    The Better Buildings Network View monthly newsletter from the U.S. Department of Energy's Better Buildings Residential Network.

  16. Better Buildings Network View | November 2015

    Broader source: Energy.gov [DOE]

    The Better Buildings Network View monthly newsletter from the U.S. Department of Energy's Better Buildings Residential Network.

  17. Better Buildings Network View | May 2014

    Broader source: Energy.gov [DOE]

    The Better Buildings Network View monthly newsletter from the U.S. Department of Energy's Better Buildings Residential Network.

  18. Exploiting Network Parallelism

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Exploiting Network Parallelism for Improving Data Transfer Performance Dan Gunter ∗ , Raj Kettimuthu † , Ezra Kissel ‡ , Martin Swany ‡ , Jun Yi § , Jason Zurawski ¶ ∗ Advanced Computing for Science Department, Lawrence Berkeley National Laboratory, Berkeley, CA † Mathematics and Computer Science Division, Argonne National Laboratory Argonne, IL ‡ School of Informatics and Computing, Indiana University, Bloomington, IN § Computation Institute, University of Chicago/Argonne

  19. Experimental Network Testbeds

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    100G SDN Testbed Dark Fiber Testbed Test Circuit Service Testbed Results Current Testbed Research Previous Testbed Research Performance (perfSONAR) Software & Tools Development Data for Researchers Partnerships Publications Workshops Science Engagement Move your data Programs & Workshops Science Requirements Reviews Case Studies News & Publications ESnet News Publications and Presentations Galleries ESnet Awards and Honors Blog ESnet Live Home » Network R&D » Experimental

  20. Bicriteria network design problems

    SciTech Connect (OSTI)

    Marathe, M.V.; Ravi, R.; Sundaram, R.; Ravi, S.S.; Rosenkrantz, D.J.; Hunt, H.B. III

    1997-11-20

    The authors study a general class of bicriteria network design problems. A generic problem in this class is as follows: Given an undirected graph and two minimization objectives (under different cost functions), with a budget specified on the first, find a subgraph from a given subgraph class that minimizes the second objective subject to the budget on the first. They consider three different criteria -- the total edge cost, the diameter and the maximum degree of the network. Here, they present the first polynomial-time approximation algorithms for a large class of bicriteria network design problems for the above mentioned criteria. The following general types of results are presented. First, they develop a framework for bicriteria problems and their approximations. Second, when the two criteria are the same they present a black box parametric search technique. This black box takes in as input an (approximation) algorithm for the criterion situation and generates an approximation algorithm for the bicriteria case with only a constant factor loss in the performance guarantee. Third, when the two criteria are the diameter and the total edge costs they use a cluster based approach to devise approximation algorithms. The solutions violate both the criteria by a logarithmic factor. Finally, for the class of treewidth-bounded graphs, they provide pseudopolynomial-time algorithms for a number of bicriteria problems using dynamic programming. The authors show how these pseudopolynomial-time algorithms can be converted to fully polynomial-time approximation schemes using a scaling technique.

  1. Insecurity of Wireless Networks

    SciTech Connect (OSTI)

    Sheldon, Frederick T; Weber, John Mark; Yoo, Seong-Moo; Pan, W. David

    2012-01-01

    Wireless is a powerful core technology enabling our global digital infrastructure. Wi-Fi networks are susceptible to attacks on Wired Equivalency Privacy, Wi-Fi Protected Access (WPA), and WPA2. These attack signatures can be profiled into a system that defends against such attacks on the basis of their inherent characteristics. Wi-Fi is the standard protocol for wireless networks used extensively in US critical infrastructures. Since the Wired Equivalency Privacy (WEP) security protocol was broken, the Wi-Fi Protected Access (WPA) protocol has been considered the secure alternative compatible with hardware developed for WEP. However, in November 2008, researchers developed an attack on WPA, allowing forgery of Address Resolution Protocol (ARP) packets. Subsequent enhancements have enabled ARP poisoning, cryptosystem denial of service, and man-in-the-middle attacks. Open source systems and methods (OSSM) have long been used to secure networks against such attacks. This article reviews OSSMs and the results of experimental attacks on WPA. These experiments re-created current attacks in a laboratory setting, recording both wired and wireless traffic. The article discusses methods of intrusion detection and prevention in the context of cyber physical protection of critical Internet infrastructure. The basis for this research is a specialized (and undoubtedly incomplete) taxonomy of Wi-Fi attacks and their adaptations to existing countermeasures and protocol revisions. Ultimately, this article aims to provide a clearer picture of how and why wireless protection protocols and encryption must achieve a more scientific basis for detecting and preventing such attacks.

  2. Assessing State Nuclear Weapons Proliferation: Using Bayesian Network Analysis of Social Factors

    SciTech Connect (OSTI)

    Coles, Garill A.; Brothers, Alan J.; Olson, Jarrod; Whitney, Paul D.

    2010-04-16

    A Bayesian network (BN) model of social factors can support proliferation assessments by estimating the likelihood that a state will pursue a nuclear weapon. Social factors including political, economic, nuclear capability, security, and national identity and psychology factors may play as important a role in whether a State pursues nuclear weapons as more physical factors. This paper will show how using Bayesian reasoning on a generic case of a would-be proliferator State can be used to combine evidence that supports proliferation assessment. Theories and analysis by political scientists can be leveraged in a quantitative and transparent way to indicate proliferation risk. BN models facilitate diagnosis and inference in a probabilistic environment by using a network of nodes and acyclic directed arcs between the nodes whose connections, or absence of, indicate probabilistic relevance, or independence. We propose a BN model that would use information from both traditional safeguards and the strengthened safeguards associated with the Additional Protocol to indicate countries with a high risk of proliferating nuclear weapons. This model could be used in a variety of applications such a prioritization tool and as a component of state safeguards evaluations. This paper will discuss the benefits of BN reasoning, the development of Pacific Northwest National Laboratorys (PNNL) BN state proliferation model and how it could be employed as an analytical tool.

  3. A neural network model for predicting the silicon content of the hot metal at No. 2 blast furnace of SSAB Luleaa

    SciTech Connect (OSTI)

    Zuo Guangqing; Ma Jitang; Bo, B.

    1996-12-31

    To predict the silicon content of hot metal at No. 2 blast furnace, SSAB, Luleaa Works, a three-layer Back-Propagation network model has been established. The network consists of twenty-eight inputs, six middle nodes and one output and uses a generalized delta rule for training. Different network structures and different training strategies have been tested. A well-functioning network with dynamic updating has been designed. The off-line test and the on-line application results showed that more than 80% of the predictions can match the actual silicon content in hot metal in a normal operation, if the allowable prediction error was set to {+-}0.05% Si, while the actual fluctuation of the silicon content was larger than {+-}0.10% Si.

  4. U-117: Potential security vulnerability has been identified with certain HP printers and HP digital senders

    Broader source: Energy.gov [DOE]

    Remote attackers could execute arbitrary code by using a session on TCP port 9100 to upload a crafted firmware update.

  5. New methods for computing a closest saddle node bifurcation and worst case load power margin for voltage collapse

    SciTech Connect (OSTI)

    Dobson, I. ); Lu, Liming )

    1993-08-01

    Voltage collapse and blackout can occur in an electric power system when load powers vary so that the system loses stability in a saddle node bifurcation. The authors propose new iterative and direct methods to compute load powers at which bifurcation occurs and which are locally closest to the current operating load powers. The distance in load power parameter space to this locally closest bifurcation is an index of voltage collapse. The pattern of load power increase need not be predicted; instead the index is a worst case load power margin. The computations are illustrated in the 6 dimensional load power parameter space of a 5 bus power system. The normal vector and curvature of a hypersurface of critical load powers at which bifurcation occurs are also computed. The sensitivity of the index to parameters and controls is easily obtained from the normal vector.

  6. Outcomes of Node-Negative Breast Cancer 5 Centimeters and Larger Treated With and Without Postmastectomy Radiotherapy

    SciTech Connect (OSTI)

    Goulart, Jennifer; Truong, Pauline; Woods, Ryan; Speers, Caroline H.; Kennecke, Hagen; Nichol, Alan

    2011-07-01

    Purpose: The role of adjuvant postmastectomy radiotherapy (PMRT) remains controversial for the rare presentation of pT3pN0cM0 breast cancer. The present analysis examined locoregional recurrence (LRR) and breast cancer-specific survival (BCSS) in pT2 = 5.0-cm and pT3 >5.0-cm tumors treated with mastectomy, stratified by PMRT use. Materials and Methods: Between January 1, 1989 and December 31, 2000, the British Columbia provincial database yielded 100 node-negative patients with tumors {>=}5 cm of 19,846 nonmetastatic breast cancer patients (0.5%). Of these 100 patients, 44 (44%) had received adjuvant PMRT. Results: The PMRT group contained significantly more pT3 >5-cm cases (p = 0.001) and margin-positive cases (p = .03). With a median follow-up of 10 years, the cumulative 10-year LRR rate was 2.3% (95% confidence interval, 0.2-10.5) in the PMRT group vs. 8.9% (95% confidence interval, 3.2-18.2) in the no-PMRT group (p = .2). Regarding LRR in the no-PMRT group, all patients had Grade 3 histologic features (LRR 17%, 5 of 29) and had not received hormonal therapy (LRR 15%, 5 of 34). The 10-year breast cancer-specific survival rate was 85.8% (95% confidence interval 71.0-93.4) in the PMRT group vs. 74.6% (95% confidence interval 59.9-84.5) in the no-PMRT group (p = .2). On multivariate analysis, adjusted for the prognostic and predictive variables, PMRT did not significantly improve the LRR or breast cancer-specific survival rates. Conclusion: The present study demonstrated a low LRR rate for node-negative breast cancer {>=}5 cm. Our results indicate that PMRT should be considered for Grade 3 histologic features and patients not undergoing hormonal therapy.

  7. Operating Innovative Networks Workshop Series

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Operating Innovative Networks Workshop Series Science Engagement Move your data Programs & Workshops CrossConnects Workshop Series Operating Innovative Networks Workshop Series Enlighten Your Research Global Program Science Requirements Reviews Case Studies Contact Us Technical Assistance: 1 800-33-ESnet (Inside US) 1 800-333-7638 (Inside US) 1 510-486-7600 (Globally) 1 510-486-7607 (Globally) Report Network Problems: trouble@es.net Provide Web Site Feedback: info@es.net Operating Innovative

  8. United States National Seismographic Network

    SciTech Connect (OSTI)

    Buland, R.

    1993-09-01

    The concept of a United States National Seismograph Network (USNSN) dates back nearly 30 years. The idea was revived several times over the decades. but never funded. For, example, a national network was proposed and discussed at great length in the so called Bolt Report (U. S. Earthquake Observatories: Recommendations for a New National Network, National Academy Press, Washington, D.C., 1980, 122 pp). From the beginning, a national network was viewed as augmenting and complementing the relatively dense, predominantly short-period vertical coverage of selected areas provided by the Regional Seismograph Networks (RSN`s) with a sparse, well-distributed network of three-component, observatory quality, permanent stations. The opportunity finally to begin developing a national network arose in 1986 with discussions between the US Geological Survey (USGS) and the Nuclear Regulatory Commission (NRC). Under the agreement signed in 1987, the NRC has provided $5 M in new funding for capital equipment (over the period 1987-1992) and the USGS has provided personnel and facilities to develop. deploy, and operate the network. Because the NRC funding was earmarked for the eastern United States, new USNSN station deployments are mostly east of 105{degree}W longitude while the network in the western United States is mostly made up of cooperating stations (stations meeting USNSN design goals, but deployed and operated by other institutions which provide a logical extension to the USNSN).

  9. Regional Networks for Energy Efficiency

    Broader source: Energy.gov [DOE]

    Better Buildings Neighborhood Program Sustainability Peer Exchange Call: Regional Networks for Energy Efficiency, call slides and discussion summary, December 6, 2012.

  10. Network interdiction with budget constraints

    SciTech Connect (OSTI)

    Santhi, Nankakishore; Pan, Feng

    2009-01-01

    Several scenarios exist in the modern interconnected world which call for efficient network interdiction algorithms. Applications are varied, including computer network security, prevention of spreading of Internet worms, policing international smuggling networks, controlling spread of diseases and optimizing the operation of large public energy grids. In this paper we consider some natural network optimization questions related to the budget constrained interdiction problem over general graphs. Many of these questions turn out to be computationally hard to tackle. We present a particularly interesting practical form of the interdiction question which we show to be computationally tractable. A polynomial time algorithm is then presented for this problem.

  11. Vector Network Analysis

    Energy Science and Technology Software Center (OSTI)

    1997-10-20

    Vector network analyzers are a convenient way to measure scattering parameters of a variety of microwave devices. However, these instruments, unlike oscilloscopes for example, require a relatively high degree of user knowledge and expertise. Due to the complexity of the instrument and of the calibration process, there are many ways in which an incorrect measurement may be produced. The Microwave Project, which is part of Sandia National Laboratories Primary Standards Laboratory, routinely uses check standardsmore » to verify that the network analyzer is operating properly. In the past, these measurements were recorded manually and, sometimes, interpretation of the results was problematic. To aid our measurement assurance process, a software program was developed to automatically measure a check standard and compare the new measurements with an historical database of measurements of the same device. The program acquires new measurement data from selected check standards, plots the new data against the mean and standard deviation of prior data for the same check standard, and updates the database files for the check standard. The program is entirely menu-driven requiring little additional work by the user.« less

  12. High Performance Network Monitoring

    SciTech Connect (OSTI)

    Martinez, Jesse E

    2012-08-10

    Network Monitoring requires a substantial use of data and error analysis to overcome issues with clusters. Zenoss and Splunk help to monitor system log messages that are reporting issues about the clusters to monitoring services. Infiniband infrastructure on a number of clusters upgraded to ibmon2. ibmon2 requires different filters to report errors to system administrators. Focus for this summer is to: (1) Implement ibmon2 filters on monitoring boxes to report system errors to system administrators using Zenoss and Splunk; (2) Modify and improve scripts for monitoring and administrative usage; (3) Learn more about networks including services and maintenance for high performance computing systems; and (4) Gain a life experience working with professionals under real world situations. Filters were created to account for clusters running ibmon2 v1.0.0-1 10 Filters currently implemented for ibmon2 using Python. Filters look for threshold of port counters. Over certain counts, filters report errors to on-call system administrators and modifies grid to show local host with issue.

  13. Triangular Alignment (TAME). A Tensor-based Approach for Higher-order Network Alignment

    SciTech Connect (OSTI)

    Mohammadi, Shahin; Gleich, David F.; Kolda, Tamara G.; Grama, Ananth

    2015-11-01

    Network alignment is an important tool with extensive applications in comparative interactomics. Traditional approaches aim to simultaneously maximize the number of conserved edges and the underlying similarity of aligned entities. We propose a novel formulation of the network alignment problem that extends topological similarity to higher-order structures and provide a new objective function that maximizes the number of aligned substructures. This objective function corresponds to an integer programming problem, which is NP-hard. Consequently, we approximate this objective function as a surrogate function whose maximization results in a tensor eigenvalue problem. Based on this formulation, we present an algorithm called Triangular AlignMEnt (TAME), which attempts to maximize the number of aligned triangles across networks. We focus on alignment of triangles because of their enrichment in complex networks; however, our formulation and resulting algorithms can be applied to general motifs. Using a case study on the NAPABench dataset, we show that TAME is capable of producing alignments with up to 99% accuracy in terms of aligned nodes. We further evaluate our method by aligning yeast and human interactomes. Our results indicate that TAME outperforms the state-of-art alignment methods both in terms of biological and topological quality of the alignments.

  14. Network Analysis of Epidermal Growth Factor Signaling using Integrated Genomic, Proteomic and Phosphorylation Data

    SciTech Connect (OSTI)

    Waters, Katrina M.; Liu, Tao; Quesenberry, Ryan D.; Willse, Alan R.; Bandyopadhyay, Somnath; Kathmann, Loel E.; Weber, Thomas J.; Smith, Richard D.; Wiley, H. S.; Thrall, Brian D.

    2012-03-29

    To understand how integration of multiple data types can help decipher cellular responses at the systems level, we analyzed the mitogenic response of human mammary epithelial cells to epidermal growth factor (EGF) using whole genome microarrays, mass spectrometry-based proteomics and large-scale western blots with over 1000 antibodies. A time course analysis revealed significant differences in the expression of 3172 genes and 596 proteins, including protein phosphorylation changes measured by western blot. Integration of these disparate data types showed that each contributed qualitatively different components to the observed cell response to EGF and that varying degrees of concordance in gene expression and protein abundance measurements could be linked to specific biological processes. Networks inferred from individual data types were relatively limited, whereas networks derived from the integrated data recapitulated the known major cellular responses to EGF and exhibited more highly connected signaling nodes than networks derived from any individual dataset. While cell cycle regulatory pathways were altered as anticipated, we found the most robust response to mitogenic concentrations of EGF was induction of matrix metalloprotease cascades, highlighting the importance of the EGFR system as a regulator of the extracellular environment. These results demonstrate the value of integrating multiple levels of biological information to more accurately reconstruct networks of cellular response.

  15. A High Performance Computing Network and System Simulator for the Power Grid: NGNS^2

    SciTech Connect (OSTI)

    Villa, Oreste; Tumeo, Antonino; Ciraci, Selim; Daily, Jeffrey A.; Fuller, Jason C.

    2012-11-11

    Designing and planing next generation power grid sys- tems composed of large power distribution networks, monitoring and control networks, autonomous generators and consumers of power requires advanced simulation infrastructures. The objective is to predict and analyze in time the behavior of networks of systems for unexpected events such as loss of connectivity, malicious attacks and power loss scenarios. This ultimately allows one to answer questions such as: What could happen to the power grid if .... We want to be able to answer as many questions as possible in the shortest possible time for the largest possible systems. In this paper we present a new High Performance Computing (HPC) oriented simulation infrastructure named Next Generation Network and System Simulator (NGNS2 ). NGNS2 allows for the distribution of a single simulation among multiple computing elements by using MPI and OpenMP threads. NGNS2 provides extensive configuration, fault tolerant and load balancing capabilities needed to simulate large and dynamic systems for long periods of time. We show the preliminary results of the simulator running approximately two million simulated entities both on a 64-node commodity Infiniband cluster and a 48-core SMP workstation.

  16. Fault-tolerant interconnection network and image-processing applications for the PASM parallel processing system

    SciTech Connect (OSTI)

    Adams, G.B. III

    1984-01-01

    The demand for very high speed data processing coupled with falling hardware costs has made large-scale parallel and distributed computer systems both desirable and feasible. Two modes of parallel processing are single instruction stream-multiple data stream (SIMD) and multiple instruction stream-multiple data stream (MIMD). PASM, a partitionable SIMD/MIMD system, is a reconfigurable multimicroprocessor system being designed for image processing and pattern recognition. An important component of these systems is the interconnection network, the mechanism for communication among the computation nodes and memories. Assuring high reliability for such complex systems is a significant task. Thus, a crucial practical aspect of an interconnection network is fault tolerance. In answer to this need, the Extra Stage Cube (ESC), a fault-tolerant, multistage cube-type interconnection network, is define. The fault tolerance of the ESC is explored for both single and multiple faults, routing tags are defined, and consideration is given to permuting data and partitioning the ESC in the presence of faults. The ESC is compared with other fault-tolerant multistage networks. Finally, reliability of the ESC and an enhanced version of it are investigated.

  17. Network Bandwidth Utilization Forecast Model on High Bandwidth Network

    SciTech Connect (OSTI)

    Yoo, Wucherl; Sim, Alex

    2014-07-07

    With the increasing number of geographically distributed scientific collaborations and the scale of the data size growth, it has become more challenging for users to achieve the best possible network performance on a shared network. We have developed a forecast model to predict expected bandwidth utilization for high-bandwidth wide area network. The forecast model can improve the efficiency of resource utilization and scheduling data movements on high-bandwidth network to accommodate ever increasing data volume for large-scale scientific data applications. Univariate model is developed with STL and ARIMA on SNMP path utilization data. Compared with traditional approach such as Box-Jenkins methodology, our forecast model reduces computation time by 83.2percent. It also shows resilience against abrupt network usage change. The accuracy of the forecast model is within the standard deviation of the monitored measurements.

  18. Better Buildings Network View | February 2015 | Department of...

    Office of Environmental Management (EM)

    newsletter from the U.S. Department of Energy's Better Buildings Residential Network. ... Better Buildings Network View | June 2015 Nothing But Networking for Residential Network ...

  19. Wellbore Integrity Network

    SciTech Connect (OSTI)

    Carey, James W.; Bachu, Stefan

    2012-06-21

    In this presentation, we review the current state of knowledge on wellbore integrity as developed in the IEA Greenhouse Gas Programme's Wellbore Integrity Network. Wells are one of the primary risks to the successful implementation of CO{sub 2} storage programs. Experimental studies show that wellbore materials react with CO{sub 2} (carbonation of cement and corrosion of steel) but the impact on zonal isolation is unclear. Field studies of wells in CO{sub 2}-bearing fields show that CO{sub 2} does migrate external to casing. However, rates and amounts of CO{sub 2} have not been quantified. At the decade time scale, wellbore integrity is driven by construction quality and geomechanical processes. Over longer time-scales (> 100 years), chemical processes (cement degradation and corrosion) become more important, but competing geomechanical processes may preserve wellbore integrity.

  20. RNEDE: Resilient Network Design Environment

    SciTech Connect (OSTI)

    Venkat Venkatasubramanian, Tanu Malik, Arun Giridh; Craig Rieger; Keith Daum; Miles McQueen

    2010-08-01

    Modern living is more and more dependent on the intricate web of critical infrastructure systems. The failure or damage of such systems can cause huge disruptions. Traditional design of this web of critical infrastructure systems was based on the principles of functionality and reliability. However, it is increasingly being realized that such design objectives are not sufficient. Threats, disruptions and faults often compromise the network, taking away the benefits of an efficient and reliable design. Thus, traditional network design parameters must be combined with self-healing mechanisms to obtain a resilient design of the network. In this paper, we present RNEDEa resilient network design environment that that not only optimizes the network for performance but tolerates fluctuations in its structure that result from external threats and disruptions. The environment evaluates a set of remedial actions to bring a compromised network to an optimal level of functionality. The environment includes a visualizer that enables the network administrator to be aware of the current state of the network and the suggested remedial actions at all times.

  1. Network Information System

    Energy Science and Technology Software Center (OSTI)

    1996-05-01

    The Network Information System (NWIS) was initially implemented in May 1996 as a system in which computing devices could be recorded so that unique names could be generated for each device. Since then the system has grown to be an enterprise wide information system which is integrated with other systems to provide the seamless flow of data through the enterprise. The system Iracks data for two main entities: people and computing devices. The following aremore » the type of functions performed by NWIS for these two entities: People Provides source information to the enterprise person data repository for select contractors and visitors Generates and tracks unique usernames and Unix user IDs for every individual granted cyber access Tracks accounts for centrally managed computing resources, and monitors and controls the reauthorization of the accounts in accordance with the DOE mandated interval Computing Devices Generates unique names for all computing devices registered in the system Tracks the following information for each computing device: manufacturer, make, model, Sandia property number, vendor serial number, operating system and operating system version, owner, device location, amount of memory, amount of disk space, and level of support provided for the machine Tracks the hardware address for network cards Tracks the P address registered to computing devices along with the canonical and alias names for each address Updates the Dynamic Domain Name Service (DDNS) for canonical and alias names Creates the configuration files for DHCP to control the DHCP ranges and allow access to only properly registered computers Tracks and monitors classified security plans for stand-alone computers Tracks the configuration requirements used to setup the machine Tracks the roles people have on machines (system administrator, administrative access, user, etc...) Allows systems administrators to track changes made on the machine (both hardware and software) Generates an

  2. Network Information System

    SciTech Connect (OSTI)

    1996-05-01

    The Network Information System (NWIS) was initially implemented in May 1996 as a system in which computing devices could be recorded so that unique names could be generated for each device. Since then the system has grown to be an enterprise wide information system which is integrated with other systems to provide the seamless flow of data through the enterprise. The system Iracks data for two main entities: people and computing devices. The following are the type of functions performed by NWIS for these two entities: People Provides source information to the enterprise person data repository for select contractors and visitors Generates and tracks unique usernames and Unix user IDs for every individual granted cyber access Tracks accounts for centrally managed computing resources, and monitors and controls the reauthorization of the accounts in accordance with the DOE mandated interval Computing Devices Generates unique names for all computing devices registered in the system Tracks the following information for each computing device: manufacturer, make, model, Sandia property number, vendor serial number, operating system and operating system version, owner, device location, amount of memory, amount of disk space, and level of support provided for the machine Tracks the hardware address for network cards Tracks the P address registered to computing devices along with the canonical and alias names for each address Updates the Dynamic Domain Name Service (DDNS) for canonical and alias names Creates the configuration files for DHCP to control the DHCP ranges and allow access to only properly registered computers Tracks and monitors classified security plans for stand-alone computers Tracks the configuration requirements used to setup the machine Tracks the roles people have on machines (system administrator, administrative access, user, etc...) Allows systems administrators to track changes made on the machine (both hardware and software) Generates an adjustment

  3. Specific heat investigation for line nodes in heavily overdoped Ba1-xKxFe2As2

    DOE Public Access Gateway for Energy & Science Beta (PAGES Beta)

    Kim, J. S.; Stewart, G. R.; Liu, Yong; Lograsso, Thomas A.

    2015-06-10

    Previous research has found that the pairing symmetry in the iron-based superconductor Ba1-xKxFe2As2 changes from nodeless s-wave near optimally doped, x≈0.4-0.55 and Tc>30 K, to nodal (either d-wave or s-wave) at the pure endpoint, x=1 and Tc<4 K. Intense theoretical interest has been focused on this possibility of changing pairing symmetry, where in the transition region both order parameters would be present and time reversal symmetry would be broken. Here we report specific heat measurements in zero and applied magnetic fields down to 0.4 K of three individual single crystals, free of low temperature magnetic anomalies, of heavily overdoped Ba1-xKxFe2As2,more » x= 0.91, 0.88, and 0.81. The values for Tcmid are 5.6, 7.2 and 13 K and for Hc2≈ 4.5, 6, and 20 T respectively. Furthermore, the data can be analyzed in a two gap scenario, Δ2/Δ1 ≈ 4, with the magnetic field dependence of γ (=C/T as T→0) showing an anisotropic ‘S-shaped’ behavior vs H, with the suppression of the lower gap by 1 T and γ ≈ H1/2 overall. Although such a non-linear γ vs H is consistent with deep minima or nodes in the gap structure, it is not clear evidence for one, or both, of the gaps being nodal in these overdoped samples. Thus, following the established theoretical analysis of the specific heat of d-wave cuprate superconductors containing line nodes, we present the specific heat normalized by H1/2 plotted vs T/H1/2 of these heavily overdoped Ba1-xKxFe2As2 samples which – thanks to the absence of magnetic impurities in our sample - convincingly shows the expected scaling for line node behavior for the larger gap for all three compositions. There is however no clear observation of the nodal behavior C ∝ αT2 in zero field at low temperatures, with α ≤ 2 mJ/molK3 being consistent with the data. Together with the scaling, this leaves open the possibility of extreme anisotropy in a nodeless larger gap, Δ2, such that the scaling works for fields above 0.25 – 0

  4. RECOVERY ACT - Robust Optimization for Connectivity and Flows in Dynamic Complex Networks

    SciTech Connect (OSTI)

    Balasundaram, Balabhaskar; Butenko, Sergiy; Boginski, Vladimir; Uryasev, Stan

    2013-12-25

    The goal of this project was to study robust connectivity and flow patterns of complex multi-scale systems modeled as networks. Networks provide effective ways to study global, system level properties, as well as local, multi-scale interactions at a component level. Numerous applications from power systems, telecommunication, transportation, biology, social science, and other areas have benefited from novel network-based models and their analysis. Modeling and optimization techniques that employ appropriate measures of risk for identifying robust clusters and resilient network designs in networks subject to uncertain failures were investigated in this collaborative multi-university project. In many practical situations one has to deal with uncertainties associated with possible failures of network components, thereby affecting the overall efficiency and performance of the system (e.g., every node/connection has a probability of partial or complete failure). Some extreme examples include power grid component failures, airline hub failures due to weather, or freeway closures due to emergencies. These are also situations in which people, materials, or other resources need to be managed efficiently. Important practical examples include rerouting flow through power grids, adjusting flight plans, and identifying routes for emergency services and supplies, in the event network elements fail unexpectedly. Solutions that are robust under uncertainty, in addition to being economically efficient, are needed. This project has led to the development of novel models and methodologies that can tackle the optimization problems arising in such situations. A number of new concepts, which have not been previously applied in this setting, were investigated in the framework of the project. The results can potentially help decision-makers to better control and identify robust or risk-averse decisions in such situations. Formulations and optimal solutions of the considered problems need

  5. Phoebus: Network Middleware for Next-Generation Network Computing

    SciTech Connect (OSTI)

    Martin Swany

    2012-06-16

    The Phoebus project investigated algorithms, protocols, and middleware infrastructure to improve end-to-end performance in high speed, dynamic networks. The Phoebus system essentially serves as an adaptation point for networks with disparate capabilities or provisioning. This adaptation can take a variety of forms including acting as a provisioning agent across multiple signaling domains, providing transport protocol adaptation points, and mapping between distributed resource reservation paradigms and the optical network control plane. We have successfully developed the system and demonstrated benefits. The Phoebus system was deployed in Internet2 and in ESnet, as well as in GEANT2, RNP in Brazil and over international links to Korea and Japan. Phoebus is a system that implements a new protocol and associated forwarding infrastructure for improving throughput in high-speed dynamic networks. It was developed to serve the needs of large DOE applications on high-performance networks. The idea underlying the Phoebus model is to embed Phoebus Gateways (PGs) in the network as on-ramps to dynamic circuit networks. The gateways act as protocol translators that allow legacy applications to use dedicated paths with high performance.

  6. Radiation Therapy Risk Factors for Development of Lymphedema in Patients Treated With Regional Lymph Node Irradiation for Breast Cancer

    SciTech Connect (OSTI)

    Chandra, Ravi A.; Miller, Cynthia L.; Skolny, Melissa N.; Warren, Laura E.G.; Horick, Nora; Jammallo, Lauren S.; Sadek, Betro T.; Shenouda, Mina N.; O'Toole, Jean; Specht, Michelle C.; Taghian, Alphonse G.

    2015-03-15

    Purpose: We previously evaluated the risk of breast cancer-related lymphedema (LE) with the addition of regional lymph node irradiation (RLNR) and found an increased risk when RLNR is used. Here we analyze the association of technical radiation therapy (RT) factors in RLNR patients with the risk of LE development. Methods and Materials: From 2005 to 2012, we prospectively screened 1476 women for LE who underwent surgery for breast cancer. Among 1507 breasts treated, 172 received RLNR and had complete technical data for analysis. RLNR was delivered as supraclavicular (SC) irradiation (69% [118 of 172 patients]) or SC plus posterior axillary boost (PAB) (31% [54 of 172]). Bilateral arm volume measurements were performed pre- and postoperatively. Patients' RT plans were analyzed for SC field lateral border (relative to the humeral head), total dose to SC, RT fraction size, beam energy, and type of tangent (normal vs wide). Cox proportional hazards models were used to analyze associated risk factors for LE. Results: Median postoperative follow-up was 29.3 months (range: 4.9-74.1 months). The 2-year cumulative incidence of LE was 22% (95% confidence interval [CI]: 15%-32%) for SC and 20% (95% CI: 11%-37%) for SC plus PAB (SC+PAB). None of the analyzed variables was significantly associated with LE risk (extent of humeral head: P=.74 for <1/3 vs >2/3, P=.41 for 1/3 to 2/3 vs >2/3; P=.40 for fraction size of 1.8 Gy vs 2.0 Gy; P=.57 for beam energy 6 MV vs 10 MV; P=.74 for tangent type wide vs regular; P=.66 for SC vs SC+PAB). Only pretreatment body mass index (hazard ratio [HR]: 1.09; 95% CI: 1.04-1.15, P=.0007) and the use of axillary lymph node dissection (HR: 7.08, 95% CI: 0.98-51.40, P=.05) were associated with risk of subsequent LE development. Conclusions: Of the RT parameters tested, none was associated with an increased risk of LE development. This study underscores the need for future work investigating alternative RLNR risk factors for LE.

  7. Residential Energy Services Network (RESNET) Conference | Department...

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    Residential Energy Services Network (RESNET) Conference Residential Energy Services Network (RESNET) Conference February 29, 2016 9:00AM EST to March 2, 2016 5:0

  8. Better Buildings Network View, April 2015

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    ... Laboratory) announcement emails sent to Residential Network members or via the Residential Network Group on Home Energy Pros. To receive emails about upcoming calls, contact ...

  9. Better Buildings Network View, July 2014

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    ... summaries through announcement emails sent to Residential Network members or via the Residential Network Group on Home Energy Pros. To receive emails about upcoming calls email ...

  10. Networks, smart grids: new model for synchronization

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Networks, smart grids: new model for synchronization Networks, smart grids: new model for synchronization Researchers developed a surprisingly simple mathematical model that ...

  11. Indigenous Environmental Network | Open Energy Information

    Open Energy Info (EERE)

    Indigenous Environmental Network Name: Indigenous Environmental Network Address: PO Box 485 Place: Bemidji, MN Year Founded: 1990 Phone Number: (218) 751-4967 Website:...

  12. Silver Spring Networks Inc | Open Energy Information

    Open Energy Info (EERE)

    Spring Networks Inc Jump to: navigation, search Name: Silver Spring Networks Inc Place: Redwood City, California Zip: 94063 Product: California-based, developer of utility...

  13. Creative Environmental Networks | Open Energy Information

    Open Energy Info (EERE)

    Environmental Networks Jump to: navigation, search Name: Creative Environmental Networks Place: United Kingdom Zip: CR7 7JG Sector: Biomass, Renewable Energy, Services Product:...

  14. Better Buildings Residential Network Membership Form | Department...

    Broader source: Energy.gov (indexed) [DOE]

    of Energy's Better Buildings Residential Network. BBRN Membership Form (138.55 KB) More Documents & Publications Better Buildings Residential Network Orientation Fact Sheet: ...

  15. Better Buildings Residential Network Program Sustainability Peer...

    Broader source: Energy.gov (indexed) [DOE]

    11, 2014 Better Buildings Residential Network Better Buildings Residential Network: Connects energy efficiency programs and partners to share best practices to increase the ...

  16. Better Buildings Residential Network Case Study: Partnerships...

    Energy Savers [EERE]

    Better Buildings Residential Network Case Study: Partnerships Better Buildings Residential Network Case Study: Partnerships, from the U.S. Department of Energy's Office of Energy ...

  17. Better Buildings Residential Network Orientation Webinar | Department...

    Energy Savers [EERE]

    September 11, 2014. Call Slides and Discussion Summary (2.44 MB) More Documents & Publications Better Buildings Residential Network Orientation Better Buildings Residential Network ...

  18. Better Buildings Residential Network Orientation Webinar, Call...

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    BBNP Grantee Sectors 9 BBNP Accomplishments 10 Better Buildings Residential Network Better Buildings Residential Network: Connects energy efficiency programs and partners to ...

  19. Better Buildings Residential Network Orientation | Department...

    Energy Savers [EERE]

    Orientation Better Buildings Residential Network Orientation Better Buildings Residential Network (BBRN) Orientation Call Slides and Summary, March 27, 2014. Call Slides and ...

  20. Better Buildings Residential Network | Department of Energy

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    Better Buildings Residential Network Better Buildings Residential Network Explore Peer ... programs can implement and leverage to quickly show energy and utility dollar savings. ...

  1. Better Buildings Network View December 2015

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    News From the Field New Case Study Highlights Network Member's Community Engagement Better Buildings Residential Network member Community Home Energy Retrofit Project (CHERP) is a ...

  2. Better Buildings Residential Network (BBRN) Orientation Call...

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    ... 11 Better Buildings Residential Network (BBRN) Better Buildings Residential Network: Connects energy efficiency programs and partners to share best practices to increase the ...

  3. Better Buildings Residential Network Social Media Toolkit

    Broader source: Energy.gov (indexed) [DOE]

    Social Media Toolkit BETTER BUILDINGS RESIDENTIAL NETWORK Learn more at betterbuildings.energy.govbbrn 1 T his Better Buildings Residential Network toolkit can be used to help ...

  4. Structure Learning in Power Distribution Networks (Technical...

    Office of Scientific and Technical Information (OSTI)

    Technical Report: Structure Learning in Power Distribution Networks Citation Details In-Document Search Title: Structure Learning in Power Distribution Networks Authors: Deka, ...

  5. Grencubator. Ukrainian energy innovation network | Open Energy...

    Open Energy Info (EERE)

    Grencubator. Ukrainian energy innovation network Jump to: navigation, search Name: Greencubator. Ukrainian energy innovation network Place: Kyiv, Ukraine Number of Employees: 1-10...

  6. Structure Learning in Power Distribution Networks (Technical...

    Office of Scientific and Technical Information (OSTI)

    Structure Learning in Power Distribution Networks Citation Details In-Document Search Title: Structure Learning in Power Distribution Networks You are accessing a document from ...

  7. Clean Economy Network | Open Energy Information

    Open Energy Info (EERE)

    Network Jump to: navigation, search Name: Clean Economy Network Place: Washington, Washington, DC Zip: 20004 Product: Washingt (DC-based advocacy group focused on clean energy and...

  8. EA-1964: National Ecological Observation Network (NEON)

    Broader source: Energy.gov [DOE]

    The National Science Foundation (NSF) prepared an EA that evaluated potential environmental impacts of the proposed National Ecological Observation Network (NEON), a continental-scale network of...

  9. Rural Innovations Network | Open Energy Information

    Open Energy Info (EERE)

    Network Jump to: navigation, search Name: Rural Innovations Network Place: India Sector: Services Product: General Financial & Legal Services ( Charity Non-profit Association...

  10. An Anticipatory and Deceptive AI Utilizing Bayesian Belief Networks

    SciTech Connect (OSTI)

    Lake, Joe E; Allgood, Glenn O; Olama, Mohammed M; Saffold, JAy

    2009-01-01

    The U.S. military defines antiterrorism as the defensive posture taken against terrorist threats. Antiterrorism includes fostering awareness of potential threats, deterring aggressors, developing security measures, planning for future events, interdicting an event in progress, and ultimately mitigating and managing the consequences of an event. Recent events highlight the need for efficient tools for training our military and homeland security officers for anticipating threats posed by terrorists. These tools need to be easy enough so that they are readily usable without substantial training, but still maintain the complexity to allow for a level of deceptive reasoning on the part of the opponent. To meet this need, we propose to integrate a Bayesian Belief Network (BBN) model for threat anticipation and deceptive reasoning into training simulation environments currently utilized by several organizations within the Department of Defense (DoD). BBNs have the ability to deal with various types of uncertainties; such as identities, capabilities, target attractiveness, and the combinations of the previous. They also allow for disparate types of data to be fused in a coherent, analytically defensible, and understandable manner. A BBN has been developed by ORNL uses a network engineering process that treats the probability distributions of each node with in the broader context of the system development effort as a whole, and not in isolation. The network will be integrated into the Research Network Inc,(RNI) developed Game Distributed Interactive Simulation (GDIS) as a smart artificial intelligence module. GDIS is utilized by several DoD and civilian organizations as a distributed training tool for a multiplicity of reasons. It has garnered several awards for its realism, ease of use, and popularity. One area that it still has room to excel in, as most video training tools do, is in the area of artificial intelligence of opponent combatants. It is believed that by

  11. Biomass Rapid Analysis Network (BRAN)

    SciTech Connect (OSTI)

    Not Available

    2003-10-01

    Helping the emerging biotechnology industry develop new tools and methods for real-time analysis of biomass feedstocks, process intermediates and The Biomass Rapid Analysis Network is designed to fast track the development of modern tools and methods for biomass analysis to accelerate the development of the emerging industry. The network will be led by industry and organized and coordinated through the National Renewable Energy Lab. The network will provide training and other activities of interest to BRAN members. BRAN members will share the cost and work of rapid analysis method development, validate the new methods, and work together to develop the training for the future biomass conversion workforce.

  12. EIA - Natural Gas Pipeline Network - Network Configuration & System Design

    U.S. Energy Information Administration (EIA) Indexed Site

    Network Configuration & System Design About U.S. Natural Gas Pipelines - Transporting Natural Gas based on data through 2007/2008 with selected updates Network Configuration and System Design Overview | Transmission/Storage | Design Criteria | Importance of Storage| Overall Pipeline System Configuration Overview A principal requirement of the natural gas transmission system is that it be capable of meeting the peak demand of its shippers who have contracts for firm service. To meet this

  13. Tetraarylborate polymer networks as single-ion conducting solid electrolytes

    DOE Public Access Gateway for Energy & Science Beta (PAGES Beta)

    Van Humbeck, Jeffrey F.; Aubrey, Michael L.; Alsbaiee, Alaaeddin; Ameloot, Rob; Coates, Geoffrey W.; Dichtel, William R.; Long, Jeffrey R.

    2015-06-23

    A new family of solid polymer electrolytes based upon anionic tetrakis(phenyl)borate tetrahedral nodes and linear bis-alkyne linkers is reported. Sonogashira polymerizations using tetrakis(4-iodophenyl)borate, tetrakis(4-iodo-2,3,5,6-tetrafluorophenyl)borate and tetrakis(4-bromo-2,3,5,6-tetrafluorophenyl)borate delivered highly cross-linked polymer networks with both 1,4-diethynylbeznene and a tri(ethylene glycol) substituted derivative. Promising initial conductivity metrics have been observed, including high room temperature conductivities (up to 2.7 × 10-4 S cm-1), moderate activation energies (0.25–0.28 eV), and high lithium ion transport numbers (up to tLi+ = 0.93). Initial investigations into the effects of important materials parameters such as bulk morphology, porosity, fluorination, and other chemical modification, provide starting design parameters for furthermore » development of this new class of solid electrolytes.« less

  14. Tetraarylborate polymer networks as single-ion conducting solid electrolytes

    SciTech Connect (OSTI)

    Van Humbeck, Jeffrey F.; Aubrey, Michael L.; Alsbaiee, Alaaeddin; Ameloot, Rob; Coates, Geoffrey W.; Dichtel, William R.; Long, Jeffrey R.

    2015-06-23

    A new family of solid polymer electrolytes based upon anionic tetrakis(phenyl)borate tetrahedral nodes and linear bis-alkyne linkers is reported. Sonogashira polymerizations using tetrakis(4-iodophenyl)borate, tetrakis(4-iodo-2,3,5,6-tetrafluorophenyl)borate and tetrakis(4-bromo-2,3,5,6-tetrafluorophenyl)borate delivered highly cross-linked polymer networks with both 1,4-diethynylbeznene and a tri(ethylene glycol) substituted derivative. Promising initial conductivity metrics have been observed, including high room temperature conductivities (up to 2.7 × 10-4 S cm-1), moderate activation energies (0.25–0.28 eV), and high lithium ion transport numbers (up to tLi+ = 0.93). Initial investigations into the effects of important materials parameters such as bulk morphology, porosity, fluorination, and other chemical modification, provide starting design parameters for further development of this new class of solid electrolytes.

  15. Program for Online Network Inversion

    Energy Science and Technology Software Center (OSTI)

    2009-12-21

    PONI determines the source location of a contamination incident in a water distribution network. PONI uses large scale optimization methods to predict likely source locations by reconciling the differences between observations and numerical predictions of possible contamination incidents.

  16. Contouring Guidelines for the Axillary Lymph Nodes for the Delivery of Radiation Therapy in Breast Cancer: Evaluation of the RTOG Breast Cancer Atlas

    SciTech Connect (OSTI)

    Gentile, Michelle S.; Usman, Asad A.; Neuschler, Erin I.; Sathiaseelan, Vythialinga; Hayes, John P.; Small, William

    2015-10-01

    Purpose: The purpose of this study was to identify the axillary lymph nodes on pretreatment diagnostic computed tomography (CT) of the chest to determine their position relative to the anatomic axillary borders as defined by the Radiation Therapy Oncology Group (RTOG) breast cancer atlas for radiation therapy planning. Methods and Materials: Pretreatment diagnostic CT chest scans available for 30 breast cancer patients with clinically involved lymph nodes were fused with simulation CT. Contouring of axillary levels I, II, and III according to the RTOG guidelines was performed. Measurements were made from the area of distal tumor to the anatomic borders in 6 dimensions for each level. Results: Of the 30 patients, 100%, 93%, and 37% had clinical involvement of levels I, II, and III, respectively. The mean number of lymph nodes dissected was 13.6. The mean size of the largest lymph node was 2.4 cm. Extracapsular extension was seen in 23% of patients. In 97% of patients, an aspect of the involved lymph node lay outside of the anatomic border of a level. In 80% and 83% of patients, tumor extension was seen outside the cranial (1.78 ± 1.0 cm; range, 0.28-3.58 cm) and anterior (1.27 ± 0.92 cm; range, 0.24-3.58 cm) borders of level I, respectively. In 80% of patients, tumor extension was seen outside the caudal border of level II (1.36 ± 1.0 cm, range, 0.27-3.86 cm), and 0% to 33% of patients had tumor extension outside the remaining borders of all levels. Conclusions: To cover 95% of lymph nodes at the cranial and anterior borders of level I, an additional clinical target volume margin of 3.78 cm and 3.11 cm, respectively, is necessary. The RTOG guidelines may be insufficient for coverage of axillary disease in patients with clinical nodal involvement who are undergoing neoadjuvant chemotherapy, incomplete axillary dissection, or treatment with intensity modulated radiation therapy. In patients with pretreatment diagnostic CT chest scans, fusion with

  17. Scalable Node Monitoring

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Code Using CBTF LDMS C B T F LDMS P lugins LA---UR---12---23629 Ltool * Ltool i s t he n ame o f t he t ool w e d erived f rom LDMS * Dynamically l inked * Includes t he f ollowing...

  18. Data Transfer Nodes

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    to data transfer of some form or fashion. Examples of intended usage would be running python scripts to download data from a remote source, running client software to load data...

  19. PDSF Login Node Status

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Help Staff Blogs Request Repository Mailing List Need Help? Out-of-hours Status and Password help Call operations: 1-800-66-NERSC, option 1 or 510-486-6821 Account Support ...

  20. The Ad Lucem Research Network

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    The Ad Lucem Research Network Lada Adamic Associate Professor, School of Information & Center for the Study of Complex Systems University of Michigan Research interests: structure and dynamics of social and information networks, with a particular emphasis on information diffusion, expertise sharing, and online communities D. Lazer et al. "Computational Social Science." Science 323, 5915 (2009). J. Leskovec, L. A. Adamic, and B. A. Huberman. "The dynamics of viral

  1. Fact Sheet: Better Buildings Residential Network

    Broader source: Energy.gov [DOE]

    Fact Sheet: Better Buildings Residential Network, increasing the number of American Homes that are energy efficient.

  2. Better Buildings Residential Network Orientation Webinar

    Office of Energy Efficiency and Renewable Energy (EERE)

    Better Buildings Residential Network Orientation Webinar, call slides and discussion summary, May 14, 2015.

  3. Intelligent Control via Wireless Sensor Networks for Advanced Coal Combustion Systems

    SciTech Connect (OSTI)

    Aman Behal; Sunil Kumar; Goodarz Ahmadi

    2007-08-05

    Numerical Modeling of Solid Gas Flow, System Identification for purposes of modeling and control, and Wireless Sensor and Actor Network design were pursued as part of this project. Time series input-output data was obtained from NETL's Morgantown CFB facility courtesy of Dr. Lawrence Shadle. It was run through a nonlinear kernel estimator and nonparametric models were obtained for the system. Linear and first-order nonlinear kernels were then utilized to obtain a state-space description of the system. Neural networks were trained that performed better at capturing the plant dynamics. It is possible to use these networks to find a plant model and the inversion of this model can be used to control the system. These models allow one to compare with physics based models whose parameters can then be determined by comparing them against the available data based model. On a parallel track, Dr. Kumar designed an energy-efficient and reliable transport protocol for wireless sensor and actor networks, where the sensors could be different types of wireless sensors used in CFB based coal combustion systems and actors are more powerful wireless nodes to set up a communication network while avoiding the data congestion. Dr. Ahmadi's group studied gas solid flow in a duct. It was seen that particle concentration clearly shows a preferential distribution. The particles strongly interact with the turbulence eddies and are concentrated in narrow bands that are evolving with time. It is believed that observed preferential concentration is due to the fact that these particles are flung out of eddies by centrifugal force.

  4. IPv6 Implementation at a Network Service Provider

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Router node 10G link Lawrence Berkeley National Laboratory U.S. Department of Energy | Office of Science IPv6 Implementation * IGP is ISIS * Common implementation for many ...

  5. Network Intrusion Detection and Visualization using Aggregations in a Cyber Security Data Warehouse

    SciTech Connect (OSTI)

    Czejdo, Bogdan; Ferragut, Erik M; Goodall, John R; Laska, Jason A

    2012-01-01

    The challenge of achieving situational understanding is a limiting factor in effective, timely, and adaptive cyber-security analysis. Anomaly detection fills a critical role in network assessment and trend analysis, both of which underlie the establishment of comprehensive situational understanding. To that end, we propose a cyber security data warehouse implemented as a hierarchical graph of aggregations that captures anomalies at multiple scales. Each node of our pro-posed graph is a summarization table of cyber event aggregations, and the edges are aggregation operators. The cyber security data warehouse enables domain experts to quickly traverse a multi-scale aggregation space systematically. We describe the architecture of a test bed system and a summary of results on the IEEE VAST 2012 Cyber Forensics data.

  6. The Influence of Radiation Modality and Lymph Node Dissection on Survival in Early-Stage Endometrial Cancer

    SciTech Connect (OSTI)

    Chino, Junzo P., E-mail: junzo.chino@duke.edu [Department of Radiation Oncology, Duke University Medical Center, Durham, NC (United States); Jones, Ellen [Department of Radiation Oncology, University of North Caroline, Chapel Hill, NC (United States); Berchuck, Andrew; Secord, Angeles Alvarez; Havrilesky, Laura J. [Division of Gynecologic Oncology, Duke University Medical Center, Durham, NC (United States)

    2012-04-01

    Background: The appropriate uses of lymph node dissection (LND) and adjuvant radiation therapy (RT) for Stage I endometrial cancer are controversial. We explored the impact of specific RT modalities (whole pelvic RT [WPRT], vaginal brachytherapy [VB]) and LND status on survival. Materials and Methods: The Surveillance Epidemiology and End Results dataset was queried for all surgically treated International Federation of Gynecology and Obstetrics (FIGO) Stage I endometrial cancers; subjects were stratified into low, intermediate and high risk cohorts using modifications of Gynecologic Oncology Group (GOG) protocol 99 and PORTEC (Postoperative Radiation Therapy in Endometrial Cancer) trial criteria. Five-year overall survival was estimated, and comparisons were performed via the log-rank test. Results: A total of 56,360 patients were identified: 70.4% low, 26.2% intermediate, and 3.4% high risk. A total of 41.6% underwent LND and 17.6% adjuvant RT. In low-risk disease, LND was associated with higher survival (93.7 LND vs. 92.7% no LND, p < 0.001), whereas RT was not (91.6% RT vs. 92.9% no RT, p = 0.23). In intermediate-risk disease, LND (82.1% LND vs. 76.5% no LND, p < 0.001) and RT (80.6% RT vs. 74.9% no RT, p < 0.001) were associated with higher survival without differences between RT modalities. In high-risk disease, LND (68.8% LND vs. 54.1% no LND, p < 0.001) and RT (66.9% RT vs. 57.2% no RT, p < 0.001) were associated with increased survival; if LND was not performed, VB alone was inferior to WPRT (p = 0.01). Conclusion: Both WPRT and VB alone are associated with increased survival in the intermediate-risk group. In the high-risk group, in the absence of LND, only WPRT is associated with increased survival. LND was also associated with increased survival.

  7. Better Buildings Network View | April 2014 | Department of Energy

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    4 Better Buildings Network View | April 2014 The Better Buildings Network View monthly newsletter from the U.S. Department of Energy's Better Buildings Residential Network. Better Buildings Network View April 2014 (130.28 KB) More Documents & Publications Better Buildings Network View | December 2014 Better Buildings Residential Network Orientation Webinar Better Buildings Network View | May

  8. Better Buildings Network View | April 2015 | Department of Energy

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    5 Better Buildings Network View | April 2015 The Better Buildings Network View monthly newsletter from the U.S. Department of Energy's Better Buildings Residential Network. Better Buildings Network View April 2015 (155.77 KB) More Documents & Publications Better Buildings Network View | May 2015 Better Buildings Network View | March 2015 Better Buildings Network View | July-August

  9. Better Buildings Network View | April 2016 | Department of Energy

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    6 Better Buildings Network View | April 2016 The Better Buildings Network View monthly newsletter from the U.S. Department of Energy's Better Buildings Residential Network. Better Buildings Network View April 2016 (154.45 KB) More Documents & Publications Better Buildings Network View | May 2016 Better Buildings Network View | June 2016 Better Buildings Network View | January 2016

  10. Better Buildings Network View | February 2014 | Department of Energy

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    4 Better Buildings Network View | February 2014 The Better Buildings Network View monthly newsletter from the U.S. Department of Energy's Better Buildings Residential Network. Better Buildings Network View February 2014 (173.15 KB) More Documents & Publications Better Buildings Network View | January 2014 Better Buildings Network View | May 2015 Better Buildings Network View | June 2015

  11. Better Buildings Network View | June 2016 | Department of Energy

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    6 Better Buildings Network View | June 2016 The Better Buildings Network View monthly newsletter from the U.S. Department of Energy's Better Buildings Residential Network. Better Buildings Network View June 2016 (235.96 KB) More Documents & Publications Better Buildings Network View | November 2015 Better Buildings Network View | April 2016 Better Buildings Network View | May 2016

  12. Better Buildings Network View | March 2014 | Department of Energy

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    4 Better Buildings Network View | March 2014 The Better Buildings Network View monthly newsletter from the U.S. Department of Energy's Better Buildings Residential Network. Better Buildings Network View March 2014 (129.73 KB) More Documents & Publications Better Buildings Network View | June 2015 Better Buildings Network View | May 2015 Better Buildings Network View | April 2014

  13. Better Buildings Network View | March 2015 | Department of Energy

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    5 Better Buildings Network View | March 2015 The Better Buildings Network View monthly newsletter from the U.S. Department of Energy's Better Buildings Residential Network. Better Buildings Network View March 2015 (264.47 KB) More Documents & Publications Better Buildings Network View | January 2015 Better Buildings Network View | December 2014 Better Buildings Network View | April 2015

  14. Better Buildings Network View | March 2016 | Department of Energy

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    6 Better Buildings Network View | March 2016 The Better Buildings Network View monthly newsletter from the U.S. Department of Energy's Better Buildings Residential Network. Better Buildings Network View March 2016 (211.92 KB) More Documents & Publications Better Buildings Network View | April 2016 Better Buildings Network View | May 2016 Better Buildings Network View | February 2016

  15. Better Buildings Network View | May 2016 | Department of Energy

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    6 Better Buildings Network View | May 2016 The Better Buildings Network View monthly newsletter from the U.S. Department of Energy's Better Buildings Residential Network. Better Buildings Network View May 2016 (196.19 KB) More Documents & Publications Better Buildings Network View | April 2016 Better Buildings Network View | June 2016 Better Buildings Network View | January 2016

  16. Better Buildings Network View | November 2014 | Department of Energy

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    November 2014 Better Buildings Network View | November 2014 The Better Buildings Network View monthly newsletter from the U.S. Department of Energy's Better Buildings Residential Network. Better Buildings Network View November 2014 (162.63 KB) More Documents & Publications Better Buildings Network View | July-August 2014 Better Buildings Residential Network Orientation Webinar Better Buildings Network View | December 2014

  17. Northeast Hydrogen Station Network Summary

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    World leader in gases, technologies and services for Industry and Health June 10, 2016 NE Hydrogen Station Network Summary DOE AMR 2016 2 World leader in gases, technologies and services for Industry and Health East Coast Planned Fueling network- Stations 12 Stations for the North East  NYC and Long Island- (4)  Boston Area - (4)  Connecter Stations - (1) Hartford, CT & (1) Providence, RI  Northern New Jersey- (2) 6/18/2016 3 World leader in gases, technologies and services for

  18. Network user`s guide

    SciTech Connect (OSTI)

    McGrady, P.W.

    1994-12-01

    NETWORK is a FORTRAN code used to model process flow systems in the gaseous diffusion plants at Portsmouth, Ohio and Paducah, Kentucky, operated by the United States Enrichment Corporation. It can handle a wide range of components and several different types of controllers. NETWORK can be run in either a steady-state mode or a transient mode. In the transient mode many different types of perturbations may be modeled. It is currently being used to model taking a cell off-stream in a gaseous diffusion plant. A brief description of the code is given, and process equipment models and input data are discussed.

  19. ARM - Field Campaign - COSMOS Network

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    govCampaignsCOSMOS Network Comments? We would love to hear from you! Send us a note below or call us at 1-888-ARM-DATA. Send Campaign : COSMOS Network 2010.08.05 - 2017.03.01 Lead Scientist : Marek Zreda For data sets, see below. Abstract Cosmic-ray soil moisture probes are installed and operating at the SGP. The probe measures soil moisture in the area ca. 350 m around it. The raw data (neutron counts, pressure, temperature, battery and instrument voltages, and miscellaneous data) are being

  20. Virtualized Network Control. Final Report

    SciTech Connect (OSTI)

    Ghani, Nasir

    2013-02-01

    This document is the final report for the Virtualized Network Control (VNC) project, which was funded by the United States Department of Energy (DOE) Office of Science. This project was also informally referred to as Advanced Resource Computation for Hybrid Service and TOpology NEtworks (ARCHSTONE). This report provides a summary of the project's activities, tasks, deliverable, and accomplishments. It also provides a summary of the documents, software, and presentations generated as part of this projects activities. Namely, the Appendix contains an archive of the deliverables, documents, and presentations generated a part of this project.

  1. BER Science Network Requirements (Technical Report) | SciTech...

    Office of Scientific and Technical Information (OSTI)

    Technical Report: BER Science Network Requirements Citation Details In-Document Search Title: BER Science Network Requirements The Energy Sciences Network (ESnet) is the primary ...

  2. United Nations Energy Knowledge Network (UN-Energy) | Open Energy...

    Open Energy Info (EERE)

    Energy Knowledge Network (UN-Energy) Jump to: navigation, search Logo: United Nations Energy Knowledge Network (UN-Energy) Name: United Nations Energy Knowledge Network (UN-Energy)...

  3. Austin Solar Energy Entrepreneurs Network | Open Energy Information

    Open Energy Info (EERE)

    Entrepreneurs Network Jump to: navigation, search Logo: Austin Solar Energy Entrepreneurs Network Name: Austin Solar Energy Entrepreneurs Network Place: Austin, Texas Zip: 78701...

  4. ESnet Support for WAN Data Movement Eli Dart, Network Engineer

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Support for WAN Data Movement Eli Dart, Network Engineer ESnet Science Engagement Group ... A Science Network First We specifically engineer the network to support data-intensive ...

  5. ARM: Baseline Solar Radiation Network (BSRN): solar irradiances...

    Office of Scientific and Technical Information (OSTI)

    Baseline Solar Radiation Network (BSRN): solar irradiances Title: ARM: Baseline Solar Radiation Network (BSRN): solar irradiances Baseline Solar Radiation Network (BSRN): solar ...

  6. Better Buildings Network View | November 2015 | Department of...

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    5 Better Buildings Network View | November 2015 The Better Buildings Network View monthly newsletter from the U.S. Department of Energy's Better Buildings Residential Network. PDF...

  7. Better Buildings Network View | January 2016 | Department of...

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    6 Better Buildings Network View | January 2016 The Better Buildings Network View monthly newsletter from the U.S. Department of Energy's Better Buildings Residential Network. PDF ...

  8. Better Buildings Network View | June 2014 | Department of Energy

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    4 Better Buildings Network View | June 2014 The Better Buildings Network View monthly newsletter from the U.S. Department of Energy's Better Buildings Residential Network. PDF icon ...

  9. Better Buildings Network View | January 2015 | Department of...

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    5 Better Buildings Network View | January 2015 The Better Buildings Network View monthly newsletter from the U.S. Department of Energy's Better Buildings Residential Network. PDF ...

  10. Better Buildings Network View | February 2014 | Department of...

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    4 Better Buildings Network View | February 2014 The Better Buildings Network View monthly newsletter from the U.S. Department of Energy's Better Buildings Residential Network. PDF ...

  11. Better Buildings Network View | July-August 2014 | Department...

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    4 Better Buildings Network View | July-August 2014 The Better Buildings Network View monthly newsletter from the U.S. Department of Energy's Better Buildings Residential Network. ...

  12. Better Buildings Network View | February 2016 | Department of...

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    6 Better Buildings Network View | February 2016 The Better Buildings Network View monthly newsletter from the U.S. Department of Energy's Better Buildings Residential Network. PDF ...

  13. Better Buildings Network View | May 2014 | Department of Energy

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    4 Better Buildings Network View | May 2014 The Better Buildings Network View monthly newsletter from the U.S. Department of Energy's Better Buildings Residential Network. PDF icon ...

  14. Better Buildings Network View | March 2014 | Department of Energy

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    4 Better Buildings Network View | March 2014 The Better Buildings Network View monthly newsletter from the U.S. Department of Energy's Better Buildings Residential Network. PDF ...

  15. Better Buildings Network View | April 2015 | Department of Energy

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    5 Better Buildings Network View | April 2015 The Better Buildings Network View monthly newsletter from the U.S. Department of Energy's Better Buildings Residential Network. PDF ...

  16. Better Buildings Network View | December 2014 | Department of...

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    4 Better Buildings Network View | December 2014 The Better Buildings Network View monthly newsletter from the U.S. Department of Energy's Better Buildings Residential Network. PDF ...

  17. Better Buildings Network View | March 2015 | Department of Energy

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    5 Better Buildings Network View | March 2015 The Better Buildings Network View monthly newsletter from the U.S. Department of Energy's Better Buildings Residential Network. PDF ...

  18. Better Buildings Network View | January 2014 | Department of...

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    4 Better Buildings Network View | January 2014 The Better Buildings Network View monthly newsletter from the U.S. Department of Energy's Better Buildings Residential Network. PDF ...

  19. Better Buildings Network View | October 2015 | Department of...

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    5 Better Buildings Network View | October 2015 The Better Buildings Network View monthly newsletter from the U.S. Department of Energy's Better Buildings Residential Network. PDF ...

  20. Better Buildings Network View | March 2016 | Department of Energy

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    6 Better Buildings Network View | March 2016 The Better Buildings Network View monthly newsletter from the U.S. Department of Energy's Better Buildings Residential Network. PDF ...