Powered by Deep Web Technologies
Note: This page contains sample records for the topic "hp network node" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


1

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).

2

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).

3

Modular sensor network node  

DOE Patents [OSTI]

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.

Davis, Jesse Harper Zehring (Berkeley, CA); Stark, Jr., Douglas Paul (Tracy, CA); Kershaw, Christopher Patrick (Hayward, CA); Kyker, Ronald Dean (Livermore, CA)

2008-06-10T23:59:59.000Z

4

A Network Processor Based Passive Measurement Node  

E-Print Network [OSTI]

Department of Electrical and Computer Engineering University of Massachusetts Amherst, MA 01003 {rramaswa a richer set of network management applications and traffic profiling capabilities, traffic is collected on the measurement node to reduce the load on the centralized collection system. If traffic statistics match

Shenoy, Prashant

5

Persistent Nodes for Reliable Memory in Geographically Local Networks  

E-Print Network [OSTI]

A Persistent Node is a redundant distributed mechanism for storing a key/value pair reliably in a geographically local network. In this paper, I develop a method of establishing Persistent Nodes in an amorphous matrix. I ...

Beal, Jacob

2003-04-15T23:59:59.000Z

6

Node Connectivity in Vehicular Ad Hoc Networks with Structured Mobility  

E-Print Network [OSTI]

in vehicular networks; 2) we demonstrate, through simulation, the impacts of marco- and micro-mobility modelsNode Connectivity in Vehicular Ad Hoc Networks with Structured Mobility Ivan W. H. Ho, Kin K. Leung@cmu.edu Abstract1 Vehicular Ad hoc NETworks (VANETs) is a subclass of Mobile Ad hoc NETworks (MANETs). However

Leung, Kin K.

7

Performance of wireless sensor networks under random node failures  

SciTech Connect (OSTI)

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.

Bradonjic, Milan [Los Alamos National Laboratory; Hagberg, Aric [Los Alamos National Laboratory; Feng, Pan [Los Alamos National Laboratory

2011-01-28T23:59:59.000Z

8

Neural node network and model, and method of teaching same  

DOE Patents [OSTI]

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.

Parlos, Alexander G. (College Station, TX); Atiya, Amir F. (College Station, TX); Fernandez, Benito (Austin, TX); Tsai, Wei K. (Irvine, CA); Chong, Kil T. (College Station, TX)

1995-01-01T23:59:59.000Z

9

Neural node network and model, and method of teaching same  

DOE Patents [OSTI]

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.

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

1995-12-26T23:59:59.000Z

10

Adaptive Spatiotemporal Node Selection in Dynamic Networks  

E-Print Network [OSTI]

Dynamic networks - spontaneous, self-organizing groups of devices - are a promising new computing platform. Writing applications for such networks is a daunting task, however, due to their extreme variability and ...

Hari, Pradip

11

Assessing node risk and vulnerability in epidemics on networks  

E-Print Network [OSTI]

Which nodes are most vulnerable to an epidemic spreading through a network, and which carry the highest risk of causing a major outbreak if they are the source of the infection? Here we show how these questions can be answered to good approximation using the cavity method. Several curious properties of node vulnerability and risk are explored: some nodes are more vulnerable than others to weaker infections, yet less vulnerable to stronger ones; a node is always more likely to be caught in an outbreak than it is to start one, except when the disease has a deterministic lifetime; the rank order of node risk depends on the details of the distribution of infectious periods.

Rogers, Tim

2015-01-01T23:59:59.000Z

12

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

SciTech Connect (OSTI)

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.

Kim, M; Leskovec, J

2011-11-14T23:59:59.000Z

13

Node-Replacement Policies to Maintain Threshold-Coverage in Wireless Sensor Networks  

E-Print Network [OSTI]

1 Node-Replacement Policies to Maintain Threshold-Coverage in Wireless Sensor Networks Sachin the sensing coverage falls below the minimum threshold-coverage. We develop three node-replacement policies failed sensor node for replacement. Based on different performance criteria, every time a sensor node

Vokkarane, Vinod M.

14

Impact of Mobile Node Density on Detection Performance Measures in a Hybrid Sensor Network  

E-Print Network [OSTI]

Impact of Mobile Node Density on Detection Performance Measures in a Hybrid Sensor Network}@ece.unm.edu Abstract--We investigate the impact of mobile node density on several detection performance measures for stationary target detection by a hybrid sensor network consisting of both static and mobile nodes

Jayaweera, Sudharman K.

15

Route Optimization based on ND-Proxy for Mobile Nodes in IPv6 Mobile Networks  

E-Print Network [OSTI]

Route Optimization based on ND-Proxy for Mobile Nodes in IPv6 Mobile Networks Jaehoon Jeong- bile nodes in IPv6 mobile network to perform route optimization. The route optimization is possible because mobile router provides the prefix of its care-of address for its mobile nodes by playing the role

Jeong, Jaehoon "Paul"

16

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

DOE Patents [OSTI]

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.

Faraj, Ahmad A. (Rochester, MN)

2010-01-26T23:59:59.000Z

17

E-Print Network 3.0 - assisted node localization Sample Search...  

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

Toward Using Node Mobility to Enhance Greedy Forwarding in Geographic Routing for Mobile Ad Hoc Networks1 Summary: local geographic information of direct neighbors and the...

18

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]

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.

Napolitano, Jr., Leonard M. (825 El Quanito Dr., Danville, CA 94526)

1995-01-01T23:59:59.000Z

19

Modeling and Analysis of Energy Harvesting Nodes in Body Sensor Networks  

E-Print Network [OSTI]

, or that the energy supply is monotonically decreasing with a fixed initial value. Since energy harvesting sensors canModeling and Analysis of Energy Harvesting Nodes in Body Sensor Networks Alireza Seyedi Department@ecse.rpi.edu Abstract--A Markov based unified model for an energy har- vesting node in a body sensor network

Sikdar, Biplab

20

Efficient Energy Management Policies for Networks with Energy Harvesting Sensor Nodes  

E-Print Network [OSTI]

Efficient Energy Management Policies for Networks with Energy Harvesting Sensor Nodes Vinod Sharma at that time at the node. For such networks we develop efficient energy management policies. First for the largest possible data rate. Next we obtain energy management policies which minimize the mean delay

Sharma, Vinod

Note: This page contains sample records for the topic "hp network node" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


21

Analyzing (Social Media) Networks with NodeXL Marc A. Smith1  

E-Print Network [OSTI]

Analyzing (Social Media) Networks with NodeXL Marc A. Smith1 , Ben Shneiderman2 , Natasa Milic with a social media data sample drawn from an enterprise intranet social network. A sequence of Node relevant differences in the patterns of interconnection among employee participants in the social media

Golbeck, Jennifer

22

Energy Aware Node Selection for Cluster-based Data Accuracy Estimation in Wireless Sensor Networks  

E-Print Network [OSTI]

The main objective of this paper is to reduce the number of sensor nodes by estimating a trade off between data accuracy and energy consumption for selecting nodes in probabilistic approach in distributed networks. Design Procedure/Approach: Observed data are highly correlated among sensor nodes in the spatial domain due to deployment of high density of sensor nodes. These sensor nodes form non-overlapping distributed clusters due to high data correlation among them. We develop a probabilistic model for each distributed cluster to perform data accuracy and energy consumption model in the network. Finally we find a trade off between data accuracy and energy consumption model to select an optimal number of sensor nodes in each distributed cluster. We also compare the performance for our data accuracy estimation model with information accuracy model for each distributed cluster in the network. Practical Implementation: Measuring temperature in physical environment and measuring moisture content in agricultural f...

Karjee, Jyotirmoy

2011-01-01T23:59:59.000Z

23

On Using Reputations in Ad hoc Networks to Counter Malicious Nodes Prashant Dewan, Partha Dasgupta and Amiya Bhattacharya  

E-Print Network [OSTI]

On Using Reputations in Ad hoc Networks to Counter Malicious Nodes Prashant Dewan, Partha Dasgupta, partha, amiya}@asu.edu Abstract Nodes in mobile ad hoc networks have a limited trans- mission range for ad hoc networks. Instead of choosing the shortest path to the destination, the source node chooses

Dasgupta, Partha

24

angiofollicular lymph node: Topics by E-print Network  

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

ceils with many elastic tissue fibers in the adjacent subendothelial region. The media is formed of transverse Ralph Smith 88 Solving Capture in Switched TwoNode Ethernets...

25

axillary lymph node: Topics by E-print Network  

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

ceils with many elastic tissue fibers in the adjacent subendothelial region. The media is formed of transverse Ralph Smith 96 Solving Capture in Switched TwoNode Ethernets...

26

axillary lymph nodes: Topics by E-print Network  

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

ceils with many elastic tissue fibers in the adjacent subendothelial region. The media is formed of transverse Ralph Smith 96 Solving Capture in Switched TwoNode Ethernets...

27

AquaNodes: An Underwater Sensor Network Iuliu Vasilescu  

E-Print Network [OSTI]

modem and an optical mo- dem implemented using green light. The system of sensor nodes communicates communication and support for sensing and mobil- ity. The nodes in the system are connected acoustically for broadcast communication using an acoustic modem we de- veloped. For higher point to point communication

Farritor, Shane

28

AquaNodes: An Underwater Sensor Network Iuliu Vasilescu  

E-Print Network [OSTI]

and an optical mo- dem implemented using green light. The system of sensor nodes communicates with a TDMA communication and support for sensing and mobil- ity. The nodes in the system are connected acoustically for broadcast communication using an acoustic modem we de- veloped. For higher point to point communication

Zhou, Shengli

29

Optimal Node Placement in Underwater Wireless Sensor Networks  

E-Print Network [OSTI]

. Autonomous Underwater Vehicles (AUVs) have been used in recent years to monitor and collect data from that cover a sparse area need to be optimally placed to reduce per node energy consumption. As the distance between the nodes increases, more energy is required to maintain a reasonable Signal-to-Noise (SNR) value

Shihada, Basem

30

Hardy-Cross Method & Program For every node in a pipe network  

E-Print Network [OSTI]

Hardy-Cross Method & Program · For every node in a pipe network: · Since a node pressure must & Program (2) #12;Example 1-13 (cont.) Hardy-Crosssubroutine ...loops ...pipes ...guess Qloop(L1); Note l1 new pipe in it) Loops closed with Reference h=z=0 #12;Example 1-13 (cont.) T N

Kostic, Milivoje M.

31

Modeling and Analysis of Energy Harvesting Nodes in Wireless Sensor Networks  

E-Print Network [OSTI]

, the probability of event loss due to energy run out as well as an analytical vulnerability metric, namely average state as well as the remaining energy supply of the node, we provide an analysis of the Loss ProbabilityModeling and Analysis of Energy Harvesting Nodes in Wireless Sensor Networks Alireza Seyedi

Sikdar, Biplab

32

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]

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.

Napolitano, L.M. Jr.

1995-11-28T23:59:59.000Z

33

Localized algorithms for detection of critical nodes and links for connectivity in ad hoc networks  

E-Print Network [OSTI]

Localized algorithms for detection of critical nodes and links for connectivity in ad hoc networks.Hauspie, David.Simplot}@lifl.fr Abstract Ad hoc network normally has critical connectivity properties before, respectively. The experiments with random unit graph model of ad hoc networks show high correspondence of local

Paris-Sud XI, Université de

34

Cluster Before You Hallucinate: Approximating Node-Capacitated Network Design and Energy Efficient Routing  

E-Print Network [OSTI]

this energy usage is an important problem. Ac- cording to the US Department of Energy [1], data networks,4,6,10]. In the Energy Efficient Vertex Routing Problem (EEVRP), the input consists of an undirected multi-graph G = (VCluster Before You Hallucinate: Approximating Node-Capacitated Network Design and Energy Efficient

Treuille, Adrien

35

RamboNodes for the Metropolitan Ad Hoc Network  

E-Print Network [OSTI]

We present an algorithm to store data robustly in a large, geographically distributed network by means of localized regions of data storage that move in response to changing conditions. For example, data might migrate away ...

Beal, Jacob

2003-12-17T23:59:59.000Z

36

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]

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.

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

2013-04-16T23:59:59.000Z

37

Energy-efficient Multicasting in Wireless Networks with Fixed Node Transmission Power  

E-Print Network [OSTI]

Energy-efficient Multicasting in Wireless Networks with Fixed Node Transmission Power Christos Computer Technology Institute, Greece manos@ceid.upatras.gr ABSTRACT In this work, we propose an energy-efficient are fixed. Our algorithm is based on the multicost approach and selects an optimal energy-efficient set

Varvarigo, Emmanouel "Manos"

38

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

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

HP Service Manager Unspecified Flaw Lets Remote Users Gain Unauthorized Access V-120: EMC Smarts Network Configuration Manager Java RMI Access Control Flaw Lets Remote Users...

39

Special Issue "Underwater Sensor Nodes and Underwater Sensor Networks" A special issue of Sensors (ISSN 1424-8220)  

E-Print Network [OSTI]

aquatic environments. Marine surveillance, pollution detection and monitoring, and oceanographic data (salinity, conductivity, turbidity, pH, oxygen, temperature, depth, etc.) - Sediments and pollution sensor nodes - Acoustic sensors - Underwater sensor network architectures - Wired and wireless protocols

Chen, Min

40

An ad hoc mobile network is a collectionof mobile nodes that are dynamically and arbitrarily located in such a manner that the interconnections between nodes are capable of changing on a continualbasis. In order to facilitatecommunicationwithin the networ  

E-Print Network [OSTI]

Abstract An ad hoc mobile network is a collectionof mobile nodes that are dynamically routes between nodes. The primary goal of such an ad hoc network routing protocol is correct.This articleexamines routing protocols for ad hoc networksand evaluates these protocols based on a given set

Toh, C-K.

Note: This page contains sample records for the topic "hp network node" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


41

HP Steam Trap Monitoring  

E-Print Network [OSTI]

STEAM MONITORING HP Steam Trap Monitoring HP Steam Trap Monitoring ? 12-18 months payback! ? 3-5% permanent reduction in consumption ? LEED Pt.? Innovation in Operations EB O&M ? Saved clients over $1,000,000 Annual consumption... Steam Trap Monitoring ? Real-time monitoring for high-pressure critical traps (>15 PSIG) ? Average total system cost $25K - $50K ? Web-Based or Modbus/BMS Integration Basic Installation Wireless Signal Transmitter Receiver Repeater...

Pascone, S.

2011-01-01T23:59:59.000Z

42

REFERENCES 23 [15] Wassim Matragi, Chatschik Bisdikian, and Khosrow Sohraby. Jitter Calculus in ATM networks: Single Node  

E-Print Network [OSTI]

Bisdikian, and Khosrow Sohraby. Jitter Calculus in ATM networks: Multiple Node Case. In IEEE INFOCOM '94 Chandra Verma. Guaranteed Performance Communication in High Speed Networks. PhD thesis, Uni­ versity considerably smaller error probabilities, e.g. 10 \\Gamma6 . In order to do experimental work with loss

Keshav, Srinivasan

43

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

DOE Patents [OSTI]

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.

Ko, Teresa H. (Castro Valley, CA); Berry, Nina M. (Tracy, CA)

2011-09-20T23:59:59.000Z

44

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

SciTech Connect (OSTI)

Oak Ridge National Laoratory (ORNL) has engineered an on-line enrichment monitor (OLEM) to continuously measure U-235 emissions from the UF6 gas flowing through a unit header pipe of a gas centrifuge enrichment plant (GCEP) as a component of the International Atomic Energy Agency s (IAEA) new generation of technology to support enrichment plant safeguards1. In contrast to other enrichment monitoring approaches, OLEM calibrates and corrects for the pressure and temperature dependent UF6 gas-density without external radiation sources by using the inherent unit header pipe pressure dynamics and combining U-235 gamma-ray spectrometery using a shielded NaI detector with gas pressure and temperature data near the spectrum measurement point to obtain the enrichment of the gas as a function of time. From a safeguards perspective, OLEM can provide early detection of a GCEP being misused for production of highly enriched uranium, but would not detect directly the isolation and use of a cascade within the production unit to produce HEU. OLEM may also reduce the number of samples collected for destructive assay and, if coupled with load cell monitoring, could support isotope mass balance verification and unattended cylinder verification. The earlier paper presented OLEM as one component along with shared load cells and unattended cylinder verification, in the IAEA emering toolbox for unattended instruments at GCEPs1 and described the OLEM concept and how previous modeling studies and field measurements helped confirm the viability of a passive on-line enrichment monitor for meeting IAEA objectives and to support the development of performance targets. Phase I of the United States Support Program (USSP) OLEM project completed a preliminary hardware, software and communications design; phase II will build and test field prototypes in controlled laboratory settings and then at an operational facility. That paper also discussed many of the OLEM collection node commercial off the 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.

Younkin, James R [ORNL] [ORNL; March-Leuba, Jose A [ORNL] [ORNL; Garner, James R [ORNL] [ORNL

2013-01-01T23:59:59.000Z

45

On-Demand Node Reclamation and Replacement for Guaranteed Area Coverage in Long-lived Sensor Networks  

E-Print Network [OSTI]

is an important and challenging problem in sensor network design. Recently, Tong et al. have proposed a node replacement and reclamation (NRR) strategy, and designed an adaptive rendezvous-based two-tier scheduling of energy that a solar cell can harvest is proportional to its surface area, but it is infeasible to equip

Zhang, Wensheng

46

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

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

A remote user can gain unauthorized access on the target system. IMPACT: User access via network SOLUTION: The vendor has issued a fix. Addthis Related Articles U-010:HP Onboard...

47

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]

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.

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-27T23:59:59.000Z

48

Efficient Strategies for Collecting Data from Wireless Sensor Network Nodes using Mobile  

E-Print Network [OSTI]

solutions to the following problems. (i) From the static node's perspective: given the stochastic nature the robot's perspective: given the stochastic nature of the wireless link quality, what is an energy nodes also act as relays. In certain applications, the underlying environment is very large and sam

Isler, Ibrahim Volkan

49

Autonomous Virtual Mobile Nodes  

E-Print Network [OSTI]

This paper presents a new abstraction for virtual infrastructure in mobile ad hoc networks. An AutonomousVirtual Mobile Node (AVMN) is a robust and reliable entity that is designed to cope with theinherent difficulties ...

Dolev, Shlomi

2005-06-15T23:59:59.000Z

50

Analysis of an Ad Hoc Network with Autonomously Moving Nodes Department of Informatics  

E-Print Network [OSTI]

of Stellenbosch 7600 Stellenbosch, South Africa M. Mandjes Korteweg-de Vries Institute for Mathematics Plantage or throughput. Here radio interference plays a pivotal role, as it defines an interesting trade-off: nodes may prefer to be close together in order to reduce the energy needed to transmit data, but on the other hand

Krzesinski, Tony

51

Carbon microspheres as network nodes in a novel biocompatible gel J. E. St. Dennis,a  

E-Print Network [OSTI]

through the incorporation of uniform carbon micro- spheres. The carbon particles act as nodes in the gel on the gelation of vesicles using other types of hydro- phobically modified polymers.9 It is noteworthy that gelation of vesicles is not observed if the added polymer does not have hydro- phobic tails.10 The above

Raghavan, Srinivasa

52

Timing Synchronization at the Relay Node in Physical Layer Network Coding  

E-Print Network [OSTI]

at the relay node are computed based on the propagation delays in the transmitted signals. However, due to the random attenuation of signals in a fading channel, the near far problem is inherent in this situation. Hence, we aim to design near far resistant...

Basireddy, Ashish

2012-07-16T23:59:59.000Z

53

A protocol for the moderation of non-cooperative nodes in wireless local area networks  

E-Print Network [OSTI]

´opez and Fernando Paganini Universidad ORT Uruguay Abstract-- MAC protocols for wireless networks such as 802 Cuareim 1451, Montevideo, Uruguay. Email: {lopez ma,paganini}@ort.edu.uy. This work was supported by PDT-Uruguay

54

Relay node placement in large scale wireless sensor networks Jian Tang*, Bin Hao, Arunabha Sen  

E-Print Network [OSTI]

efficient design is needed for prolonging network lifetime. Computer Communications 29 (2006) 490­501 www for a fairly short period of time if operated at high transmission power levels. As a consequence, energy

Tang, Jian "Neil"

55

NetInf Mobile Node Architecture and Mobility Management based on LISP Mobile Node  

E-Print Network [OSTI]

NetInf Mobile Node Architecture and Mobility Management based on LISP Mobile Node Muhammad Shoaib an architecture for Network of Information mobile node (NetInf MN). It bears characteristics and features of basic a virtual node layer for mobility management in the Network of Information. Therefore, by adopting

Paris-Sud XI, Université de

56

U-052: HP Protect Tools Device Access Manager Unspecified Bug...  

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

PC HP EliteBook 2760p Notebook PC HP EliteBook 8460p Notebook PC HP EliteBook 8460w Mobile Workstation HP EliteBook 8560p Notebook PC HP EliteBook 8560w Mobile Workstation HP...

57

T-623: HP Business Availability Center Input Validation Hole...  

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

3: HP Business Availability Center Input Validation Hole Permits Cross-Site Scripting Attacks T-623: HP Business Availability Center Input Validation Hole Permits Cross-Site...

58

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

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

7: HP Performance Manager Unspecified Bug Lets Remote Users Execute Arbitrary Codes U-137: HP Performance Manager Unspecified Bug Lets Remote Users Execute Arbitrary Codes March...

59

SmartNode: Achieving 802.11 MAC Interoperability in Power-efficient Ad Hoc Networks with Dynamic Range Adjustments  

E-Print Network [OSTI]

, energy conservation may be achieved by dynamically adjusting transmission ranges on the fly at each node Range Adjustments Edmond Poon, Baochun Li£ Abstract The standard CSMA/CA based IEEE 802.11 protocol as conservation and higher system throughput through better spatial reuse of spectrum. In this work, we propose

Li, Baochun

60

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.

Note: This page contains sample records for the topic "hp network node" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


61

Synchronizing compute node time bases in a parallel computer  

DOE Patents [OSTI]

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.

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

2014-12-30T23:59:59.000Z

62

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...

63

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.

64

A Robust Amorphous Hierarchy from Persistent Nodes  

E-Print Network [OSTI]

For a very large network deployed in space with only nearby nodes able to talk to each other, we want to do tasks like robust routing and data storage. One way to organize the network is via a hierarchy, but hierarchies ...

Beal, Jacob

2003-05-01T23:59:59.000Z

65

T-588: HP Virtual SAN Appliance Stack Overflow  

Broader source: Energy.gov [DOE]

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.

66

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]

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.

Archer, Charles Jens (Rochester, MN); Musselman, Roy Glenn (Rochester, MN); Peters, Amanda (Rochester, MN); Pinnow, Kurt Walter (Rochester, MN); Swartz, Brent Allen (Chippewa Falls, WI); Wallenfelt, Brian Paul (Eden Prairie, MN)

2010-11-16T23:59:59.000Z

67

U-238: HP Service Manager Input Validation Flaw Permits Cross...  

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

9.21, 9.30 ABSTRACT: 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...

68

U-044: HP Operations Agent and Performance Agent Lets Local Users...  

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

4: HP Operations Agent and Performance Agent Lets Local Users Access a Restricted Directory U-044: HP Operations Agent and Performance Agent Lets Local Users Access a Restricted...

69

A robust window-based multi-node minimization technique using Boolean relations  

E-Print Network [OSTI]

Multi-node optimization using Boolean relations is a powerful approach for network minimization. The approach has been studied in theory, and so far its superiority over single node optimization techniques has only been conjectured for practical...

Cobb, Jeffrey Lee

2008-10-10T23:59:59.000Z

70

A robust window-based multi-node minimization technique using Boolean relations  

E-Print Network [OSTI]

Multi-node optimization using Boolean relations is a powerful approach for network minimization. The approach has been studied in theory, and so far its superiority over single node optimization techniques has only been conjectured for practical...

Cobb, Jeffrey Lee

2009-05-15T23:59:59.000Z

71

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.

72

Final report for the mobile node authentication LDRD project.  

SciTech Connect (OSTI)

In hostile ad hoc wireless communication environments, such as battlefield networks, end-node authentication is critical. In a wired infrastructure, this authentication service is typically facilitated by a centrally-located ''authentication certificate generator'' such as a Certificate Authority (CA) server. This centralized approach is ill-suited to meet the needs of mobile ad hoc networks, such as those required by military systems, because of the unpredictable connectivity and dynamic routing. There is a need for a secure and robust approach to mobile node authentication. Current mechanisms either assign a pre-shared key (shared by all participating parties) or require that each node retain a collection of individual keys that are used to communicate with other individual nodes. Both of these approaches have scalability issues and allow a single compromised node to jeopardize the entire mobile node community. In this report, we propose replacing the centralized CA with a distributed CA whose responsibilities are shared between a set of select network nodes. To that end, we develop a protocol that relies on threshold cryptography to perform the fundamental CA duties in a distributed fashion. The protocol is meticulously defined and is implemented it in a series of detailed models. Using these models, mobile wireless scenarios were created on a communication simulator to test the protocol in an operational environment and to gather statistics on its scalability and performance.

Michalski, John T.; Lanzone, Andrew J.

2005-09-01T23:59:59.000Z

73

FSHAKER: a transient control program. [For HP 5451C  

SciTech Connect (OSTI)

A description is given of FSHAKER, a transient control program for the performance of transient tests, written to run on the HP 5451C (Fourier) system. The report also contains a listing of a demonstration run made with FSHAKER. The appendix contains a commented listing of FSHAKER and listings of three Fortran user programs called by FSHAKER. (RWR)

Cawlfield, J L

1980-10-01T23:59:59.000Z

74

Nodes Placement for reducing Energy Consumption in Multimedia Transmissions  

E-Print Network [OSTI]

quality of multimedia traffic. Index Terms--Wireless Sensor Networks, Multimedia, Energy Saving, Quality on the energy saving by extending the lifetime of the network up to more than 15% while preserving video qualityNodes Placement for reducing Energy Consumption in Multimedia Transmissions Pasquale Pace Valeria

Paris-Sud XI, Université de

75

U-201: HP System Management Homepage Bugs Let Remote Users Deny...  

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

01: HP System Management Homepage Bugs Let Remote Users Deny Service U-201: HP System Management Homepage Bugs Let Remote Users Deny Service June 28, 2012 - 7:00am Addthis PROBLEM:...

76

hp-mesh adaptation for 1-D multigroup neutron diffusion problems  

E-Print Network [OSTI]

In this work, we propose, implement and test two fully automated mesh adaptation methods for 1-D multigroup eigenproblems. The first method is the standard hp-adaptive refinement strategy and the second technique is a goal-oriented hp...

Wang, Yaqi

2007-04-25T23:59:59.000Z

77

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

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

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...

78

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

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

The vendor has issued a fix (6.1.260). Addthis Related Articles V-166: HP-UX Directory Server Discloses Passwords to Remote Authenticated and Local Users U-135: HP WBEM...

79

Hopper Compute Nodes  

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

AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel),Feet) Year Jan Feb Mar Apr May JunDatastreamsmmcrcalgovInstrumentsruc DocumentationP-SeriesFlickr FlickrGuidedCH2MLLC HistoryVeterans | National NuclearCompute Nodes

80

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.

Note: This page contains sample records for the topic "hp network node" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


81

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

82

An Ant Colony Optimization Algorithm for the 2D HP Protein Folding Problem  

E-Print Network [OSTI]

An Ant Colony Optimization Algorithm for the 2D HP Protein Folding Problem Alena Shmygelska, Rosal, the two dimensional hydrophobic-polar (2D HP) protein folding problem. We introduce an ant colony algorithm closely approaches that of specialised, state-of-the methods for 2D HP protein folding. 1

Hoos, Holger H.

83

An Improved Ant Colony Optimisation Algorithm for the 2D HP Protein Folding Problem  

E-Print Network [OSTI]

An Improved Ant Colony Optimisation Algorithm for the 2D HP Protein Folding Problem Alena hydrophobic-polar (2D HP) protein folding problem. We present an improved version of our recently proposed Ant search. Overall, the results presented here establish our new ACO algorithm for 2D HP protein folding

Hoos, Holger H.

84

A New Algorithm for Protein Folding in the HP Model Alantha Newman  

E-Print Network [OSTI]

A New Algorithm for Protein Folding in the HP Model Alantha Newman #3; Abstract We consider the problem of protein folding in the HP model on the two-dimensional square lattice. This problem but not in the string) are present. The protein folding problem in the hydrophobic-hydrophilic (HP) model on the 2D

Newman, Alantha

85

Protein Folding in the Hydrophobic-Hydrophilic (HP) Model is NP-Complete  

E-Print Network [OSTI]

Protein Folding in the Hydrophobic-Hydrophilic (HP) Model is NP-Complete Bonnie Berger* Tom Leightont Abstract One of the simplest and most popular biophysical mod- els of protein folding is the hydrophobic-hydrophilic (HP) model. The HP model abstracts the hydrophobic in- teraction in protein folding

Istrail, Sorin

86

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]

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.

Archer, Charles J. (Rochester, MN); Ratterman, Joseph D. (Rochester, MN)

2009-11-06T23:59:59.000Z

87

NREL: News Feature - HP Supercomputer at NREL Garners Top Honor  

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

AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel),Feet) Year Jan Feb Mar Apr MayAtmosphericNuclear Security Administration the Contributions and AchievementsResearch Staff MaterialsPrintableHP Supercomputer at

88

Potential-field geophysical programs for VAX 7xx computers; source code (programs H-P)  

SciTech Connect (OSTI)

A U.S. Geological Survey report is presented giving source code for potential-field geophysical programs (programs H-P) for VAX 7xx computers.

Not Available

1989-01-01T23:59:59.000Z

89

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.

90

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).

91

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

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

Cross-Site Scripting and Information Disclosure Attacks PLATFORM: Service Manager v9.31 Web Tier ABSTRACT: Two vulnerabilities were reported in HP Service Manager REFERENCE LINKS:...

92

PER-NODE POWER MINIMAL MULTICAST TREES WHICH MAXIMIZE THE TIME-TO-FIRST-FAILURE IN ENERGY CONSTRAINED STATIC WIRELESS  

E-Print Network [OSTI]

PER-NODE POWER MINIMAL MULTICAST TREES WHICH MAXIMIZE THE TIME-TO-FIRST-FAILURE IN ENERGY as the time till the first node in the network runs out of battery energy, and minimizing the total power in energy constrained static wireless networks. It is shown in [6] that simply optimizing the TTFF criterion

Arabshahi, Payman

93

2D and 3D Acoustic Source Localization Using the AML Algorithm and ENSBox Nodes  

E-Print Network [OSTI]

Networked Sensing 2D and 3D Acoustic Source Localizationhairs, median red square) 3D bearing estimates: (azimuth,1.37,1.52) (2.38,1.82) Node 153 3D AML performance UCLA

2007-01-01T23:59:59.000Z

94

E-Print Network 3.0 - af cooperative networks Sample Search Results  

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

Channels in Wireless Adhoc Networks Supervisor: Dr. Salman Durrani Summary: in wireless ad-hoc networks. One of the basic topologies for the node cooperation is the three-node...

95

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.

96

A New Algorithm for Protein Folding in the HP Model Alantha Newman *  

E-Print Network [OSTI]

876 A New Algorithm for Protein Folding in the HP Model Alantha Newman * Abstract We consider the problem of protein folding in the HP model ozt the two-dimensional square lattice. This problem.e.pairsof H's that are adjacent in the folding but not in the string) are present. The protein folding problem

Istrail, Sorin

97

Genetic Algorithm for Predicting Protein Folding in the 2D HP Model  

E-Print Network [OSTI]

Genetic Algorithm for Predicting Protein Folding in the 2D HP Model A Parameter Tuning Case Study of a protein, predicting its tertiary structure is known as the protein folding problem. This problem has been. The protein folding problem in the HP model is to find a conformation (a folded sequence) with the lowest

Emmerich, Michael

98

SLU, Spring 2012 Bioenergy and social sciences: economics and sociology, 5hp  

E-Print Network [OSTI]

SLU, Spring 2012 1/6 Bioenergy and social sciences: economics and sociology, 5hp PNS0083 Bioenergy and social sciences: economics and sociology, 5hp The course is given as part of the postgraduate research school "Bioenergy". The overall objective of the course is: 1. to enable the students

99

A Branch and Bound Algorithm for the Protein Folding Problem in the HP Lattice Model  

E-Print Network [OSTI]

Article A Branch and Bound Algorithm for the Protein Folding Problem in the HP Lattice Model Mao tool for the protein folding problem. Key words: protein folding, HP model, branch and bound, lattice Introduction The protein folding problem, or the protein struc- ture prediction problem, is one of the most

Istrail, Sorin

100

An Efficient Genetic Algorithm for Predicting Protein Tertiary Structures in the 2D HP Model  

E-Print Network [OSTI]

, predicting its tertiary structure is known as the protein folding problem. This problem has been widely genetic algo- rithm for the protein folding problem under the HP model in the two-dimensional square Genetic Algorithm, Protein Folding Problem, 2D HP Model 1. INTRODUCTION Amino acids are the building

Istrail, Sorin

Note: This page contains sample records for the topic "hp network node" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


101

Energy Proportionality of an Enterprise Network Priya Mahadevan, Sujata Banerjee, and Puneet Sharma  

E-Print Network [OSTI]

efficient. However, compared to other IT devices such as servers and laptops, energy ef- ficiencyEnergy Proportionality of an Enterprise Network Priya Mahadevan, Sujata Banerjee, and Puneet Sharma.banerjee@hp.com,puneet.sharma@hp.com ABSTRACT Energy efficiency is becoming increasingly important in the operation of networking infrastructure

Badrinath, B. R.

102

HP Laboratories 1/25/98 Hiro:Documents:Giordano Beretta:Research:EI 98:StudioPoster  

E-Print Network [OSTI]

HP Laboratories 1/25/98 Hiro:Documents:Giordano Beretta:Research:EI 98:StudioPoster 0Professional. #12;HP Laboratories 1/25/98 Hiro:Documents:Giordano Beretta:Research:EI 98:StudioPoster 1Introduction based on digital camera #12;HP Laboratories 1/25/98 Hiro:Documents:Giordano Beretta:Research:EI 98

Beretta, Giordano

103

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

DOE Patents [OSTI]

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.

Archer, Charles J. (Rochester, MN); Blocksome, Michael A. (Rochester, MN); Ratterman, Joseph D. (Rochester, MN); Smith, Brian E. (Rochester, MN)

2011-06-21T23:59:59.000Z

104

HP ScanJet 8350 Generalized scanning instructions  

E-Print Network [OSTI]

the procedure. Please do not alter the selections or add to the list. Contact the system administrator to add file name you wish to give the document Navigate to the folder or network share you wish to save

Bardsley, John

105

SiNode Systems | Department of Energy  

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

University SiNode Systems is a battery materials venture developing silicon-graphene anodes for the next generation of lithium-ion batteries. SiNode anodes offer higher...

106

NUG Single Node Optimization Presentation.  

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

AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel),Feet) Year Jan Feb Mar Apr MayAtmosphericNuclear Security Administration the Contributions andData andFleet TestAccounts and Allocations February 3, Node

107

Dedicated heterogeneous node scheduling including backfill scheduling  

DOE Patents [OSTI]

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.

Wood, Robert R. (Livermore, CA); Eckert, Philip D. (Livermore, CA); Hommes, Gregg (Pleasanton, CA)

2006-07-25T23:59:59.000Z

108

Global tree network for computing structures enabling global processing operations  

DOE Patents [OSTI]

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.

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); Hoenicke, Dirk (Ossining, NY); Steinmacher-Burow, Burkhard D. (Mount Kisco, NY); Takken, Todd E. (Mount Kisco, NY); Vranas, Pavlos M. (Bedford Hills, NY)

2010-01-19T23:59:59.000Z

109

IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 13, NO. 6, DECEMBER 2005 1325 Cooperation in Wireless Ad Hoc Networks: A  

E-Print Network [OSTI]

a market-based approach to stimulate cooperation in ad hoc networks where nodes charge a price for relaying to illustrate our results. Index Terms--Ad hoc network, pricing, rate control, wireless networks. I. INTRODUCTION AWIRELESS ad hoc network is a collection of nodes which form a network independently of any fixed

110

HP Laboratories 4/28/02 Tofari:Users:berettag:Research:Conferences:EI 98:ontologyOHP.doc  

E-Print Network [OSTI]

HP Laboratories 4/28/02 Tofari:Users:berettag:Research:Conferences:EI 98:ontologyOHP.doc 0Structure-Packard Company. All rights reserved. #12;HP Laboratories 4/28/02 Tofari:Users:berettag:Research:Conferences:EI 98 radioactive use a real big magnet store needles separately from hay #12;HP Laboratories 4/28/02 Tofari:Users:berettag:Research:Conferences:EI

Beretta, Giordano

111

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

DOE Patents [OSTI]

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.

Bhanot, Gyan V. (Princeton, NJ); Chen, Dong (Croton-On-Hudson, NY); Gara, Alan G. (Mount Kisco, NY); Giampapa, Mark E. (Irvington, NY); Heidelberger, Philip (Cortlandt Manor, NY); Steinmacher-Burow, Burkhard D. (Mount Kisco, NY); Vranas, Pavlos M. (Bedford Hills, NY)

2012-01-10T23:59:59.000Z

112

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

DOE Patents [OSTI]

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.

Bhanot, Gyan V. (Princeton, NJ); Chen, Dong (Croton-On-Hudson, NY); Gara, Alan G. (Mount Kisco, NY); Giampapa, Mark E. (Irvington, NY); Heidelberger, Philip (Cortlandt Manor, NY); Steinmacher-Burow, Burkhard D. (Mount Kisco, NY); Vranas, Pavlos M. (Bedford Hills, NY)

2008-01-01T23:59:59.000Z

113

Green Networks: Energy Efficient Design for Optical Networks Balagangadhar G. Bathula, Jaafar M. H. Elmirghani  

E-Print Network [OSTI]

Green Networks: Energy Efficient Design for Optical Networks Balagangadhar G. Bathula, Jaafar M. H in backbone networks such as optical networks increase. Energy consumption of optical networks is an important the energy consumption of optical networks. We propose sleep cycle protocols for use in the network nodes

Bathula, Balagangadhar G

114

Using the Mass Storage System at ZIB within I3HP  

E-Print Network [OSTI]

In the framework of I3HP there are two Transnational Access Activities related to Computational Hadron Physics. One of these activities is access to the mass storage system at Konrad-Zuse-Zentrum fuer Informationstechnik Berlin (ZIB). European lattice physics collaborations can apply for mass storage capacity in order to store and share their configurations or other data (see http://www.zib.de/i3hp/). In this paper formal and technical aspects of usage as well as the conformance to the International Lattice DataGrid (ILDG) are explained.

H. Stben; S. Wollny

2005-12-07T23:59:59.000Z

115

Two algorithms for leader election and network size estimation in mobile ad hoc networks  

E-Print Network [OSTI]

We develop two algorithms for important problems in mobile ad hoc networks (MANETs). A MANET is a collection of mobile processors (?nodes?) which communicate via message passing over wireless links. Each node can communicate directly with other...

Neumann, Nicholas Gerard

2005-02-17T23:59:59.000Z

116

Random Walks and Electrical Networks Electrical Network  

E-Print Network [OSTI]

Feb 4, 2008 ... Random Walks and Electrical Networks. Hitting Probabilities and Voltage. Voltage. Connect a 1V battery to nodes a and b. ix,y is the current...

Jonathon Peterson

2008-01-30T23:59:59.000Z

117

Information Capacity of Energy Harvesting Sensor Nodes  

E-Print Network [OSTI]

Information Capacity of Energy Harvesting Sensor Nodes R Rajesh CABS, DRDO Bangalore, India Email: rajesh81r@gmail.com Vinod Sharma Dept. of ECE Indian Institute of Science Bangalore, India Email: vinod Email: pramodv@uiuc.edu Abstract--Sensor nodes with energy harvesting sources are gaining popularity due

Sharma, Vinod

118

The Node Monitoring Component of a Scalable Systems Software Environment  

SciTech Connect (OSTI)

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.

Samuel James Miller

2006-08-09T23:59:59.000Z

119

Solution of coupled acousticelastic wave propagation problems with anelastic attenuation using automatic hp-adaptivity  

E-Print Network [OSTI]

Solution of coupled acoustic­elastic wave propagation problems with anelastic attenuation using Keywords: Borehole acoustic logging Wave propagation Linear elasticity Coupled problems Hp-adaptive finite to various poroelasticity theories. Simulations of sonic tools. Numerical modeling of the wave prop- agation

Torres-Verdín, Carlos

120

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

SciTech Connect (OSTI)

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.

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-01T23:59:59.000Z

Note: This page contains sample records for the topic "hp network node" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


121

Parallel Ant Colony Optimization for 3D Protein Structure Prediction using the HP Lattice Model  

E-Print Network [OSTI]

of Sydney Sydney 2006, NSW Australia Abstract The Protein Folding Problem studies the way in which a protein proteins fold can be fundamental in developing treatments of diseases such as Alzeihmers and Systic of solving the HP protein folding problem in both two and three dimensions using Ant Colony Opti- mizations

Istrail, Sorin

122

Scalable Address Allocation Protocol for Mobile Ad Hoc Networks  

E-Print Network [OSTI]

Scalable Address Allocation Protocol for Mobile Ad Hoc Networks Yu Chen Google, UK chenyu in ad hoc networks. In our protocol, each node that has been assigned an address manages a disjoint of node's degree, regardless of the network size. I. INTRODUCTION A wireless mobile ad hoc network

Paris-Sud XI, Université de

123

Hybrid Sensor Networks: A Small World Gaurav Sharma  

E-Print Network [OSTI]

wires to a wireless sensor network can not only reduce the average energy expenditure per sensor node, but also the non-uniformity in the energy expenditure across the sensor nodes. Categories and Subject the average hop count of the network, resulting in a reduced energy dissipa- tion per node. We also show

Mazumdar, Ravi R.

124

Node discovery and replacement using mobile Kalypso Magklara1  

E-Print Network [OSTI]

Node discovery and replacement using mobile robot Kalypso Magklara1 , Dimitrios Zorbas1 and Tahiry, that discovers the nodes around it and replaces the active nodes, whose energy is drained, by fully charged and that decide, which nodes to replace. We simulate our algorithms and our findings show that all nodes that fail

Paris-Sud XI, Université de

125

Hub Synchronization in Scale-Free Networks  

E-Print Network [OSTI]

Heterogeneity in the degree distribution is known to suppress global synchronization in complex networks of symmetrically coupled oscillators. Scale-free networks display a great deal of heterogeneity, containing a few nodes, termed hubs, that are highly connected, while most nodes receive only a few connections. Here, we show that a group of synchronized nodes may appear in scale-free networks: hubs undergo a transition to synchronization while the other nodes remain unsynchronized. This general phenomenon can occur even in the absence of global synchronization. Our results suggest that scale-free networks may have evolved to complement various levels of synchronization.

Tiago Pereira

2010-10-07T23:59:59.000Z

126

E-Print Network 3.0 - alpha cluster states Sample Search Results  

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

of Wireless Sensor Networks via Unequal Clustering Summary: head is similar. IV NETWORK MODEL As stated previously, the positions of the cluster head nodes... section to...

127

Lower bound and an optimal algorithm for leader election in faulty asynchronous general networks  

E-Print Network [OSTI]

incident on it, the size of the network, and the ID of the node. Thus a node does not know who its neighbors are and which links are unreliable. We assume that the network is asynchronous i. e. there is no global clock and global memory in the network... the leader is a loser. Each node knows its ID, the number of edges incident on it, and the number of nodes in the network, i. e. ~V) = N. The node does not know which of the links are reliable. The IDs of the uodes are unique and distinct. All the nodes...

Lateef, Mohammed Afroz

1993-01-01T23:59:59.000Z

128

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)

AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel),Feet) Year Jan Feb Mar Apr MayAtmospheric Optical Depth7-1D: Vegetation Proposed New SubstationCleanCommunity Involvement andMISR, and4 NComplexComplexed Adsorbed HP1

129

Social Network Analysis Plugin (SNAP) for Mesh Networks  

E-Print Network [OSTI]

networks, called Mesh-Mon, that can help a team of system administrators (sysadmins) manage a wireless. In a wireless mesh network context, a system administrator should pay attention to "bridging nodes" sinceSocial Network Analysis Plugin (SNAP) for Mesh Networks Soumendra Nanda BAE Systems Burlington, MA

Kotz, David

130

Percutaneous Vertebroplasty in Painful Schmorl Nodes  

SciTech Connect (OSTI)

The Schmorl node represents displacement of intervertebral disc tissue into the vertebral body. Both Schmorl nodes and degenerative disc disease are common in the human spine. We performed a retrospective study, for the period from January 2003 to February 2005, evaluating 23 patients affected by painful Schmorl nodes, who underwent in our department percutaneous transpedicular injection of polymethylmethacrylate (vertebroplasty) in order to solve their back pain not responsive to medical and physical management. Eighteen patients reported improvement of the back pain and no one reported a worsening of symptoms. Improvement was swift and persistent in reducing symptoms. Painful Schmorl nodes, refractory to medical or physical therapy, should be considered as a new indication within those vertebral lesions adequately treatable utilizing Vertebroplasty procedure.

Masala, Salvatore, E-mail: salva.masala@tiscali.it; Pipitone, Vincenzo; Tomassini, Marco; Massari, Francesco; Romagnoli, Andrea; Simonetti, Giovanni ['Tor Vergata' University, General Hospital, Department of Diagnostic Imaging and Interventional Radiology (Italy)

2006-02-15T23:59:59.000Z

131

Community Detection from Location-Tagged Networks  

E-Print Network [OSTI]

Many real world systems or web services can be represented as a network such as social networks and transportation networks. In the past decade, many algorithms have been developed to detect the communities in a network using connections between nodes. However in many real world networks, the locations of nodes have great influence on the community structure. For example, in a social network, more connections are established between geographically proximate users. The impact of locations on community has not been fully investigated by the research literature. In this paper, we propose a community detection method which takes locations of nodes into consideration. The goal is to detect communities with both geographic proximity and network closeness. We analyze the distribution of the distances between connected and unconnected nodes to measure the influence of location on the network structure on two real location-tagged social networks. We propose a method to determine if a location-based community detection...

Liu, Zhi

2015-01-01T23:59:59.000Z

132

A generative model for feedback networks Douglas R. White  

E-Print Network [OSTI]

net- works evolve by either establishing closer connections by adding links to existing nodes outside it, thereby adding a new node and expanding it. Another motivating example is trading networks [2

White, Douglas R.

133

Generative model for feedback networks Douglas R. White*  

E-Print Network [OSTI]

be separated by a given distance in the kinship net- work 1 . Such a marriage establishes a direct tie between node and expanding it. Another motivating example is trading networks 2 . Sup- pose two agents nodes

White, Douglas R.

134

A Capacitated Network Flow Optimization Approach for Short Notice ...  

E-Print Network [OSTI]

Feb 17, 2012 ... intersections. Centroids are the nodes with positive supplies whereas inter- ..... Assign unique identification numbers to all nodes N in the network. G. Create a ..... Journal of Hazardous Materials 30(3), 223 242. Southworth...

2012-02-17T23:59:59.000Z

135

Localization and sensing applications in the Pushpin Computer Network  

E-Print Network [OSTI]

The utility and purpose of a node in a wireless sensor network is intimately tied to the physical space in which it is distributed. As such, it is advantageous under most circumstances for a sensor node to know its position. ...

Broxton, Michael Joseph

2005-01-01T23:59:59.000Z

136

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

DOE Patents [OSTI]

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.

Blocksome, Michael A. (Rochester, MN)

2011-02-15T23:59:59.000Z

137

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

DOE Patents [OSTI]

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.

Blocksome, Michael A. (Rochester, MN); Parker, Jeffrey J. (Rochester, MN)

2011-05-24T23:59:59.000Z

138

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

SciTech Connect (OSTI)

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.

Dehmolaei, R. [Department of Materials Engineering, Isfahan University of Technology, Isfahan, 84156-83111 (Iran, Islamic Republic of); Shamanian, M. [Department of Materials Engineering, Isfahan University of Technology, Isfahan, 84156-83111 (Iran, Islamic Republic of)], E-mail: shamanian@cc.iut.ac.ir; Kermanpur, A. [Department of Materials Engineering, Isfahan University of Technology, Isfahan, 84156-83111 (Iran, Islamic Republic of)

2008-10-15T23:59:59.000Z

139

Epidemic Propagation In Overlaid Wireless Networks  

SciTech Connect (OSTI)

Witb tbe emergence of computer worms tbat can spread over air interfaces, wireless ad boc and sensor networks can be vulnerable to node compromises even if the deployed network is not connected to the backbone. Depending on the physical topology of the wireless network, even a single infected node can compromise the whole network. In this work, epidemic (e.g., worm) propagation in a static wireless network is studied, where a number of inCected mobile nodes are injected over the existing network. It is shown that the epidemic spread threshold and size depend on the physical topology of the underlying static wireless network as well as the mobility model employed by the infected mobile nodes. More specifically, results show that in a Cully-connected static wirelessnctwork targeted attacks are more effective, wbereas Cor a random topology random attacks can be sufficient to compromise the whole network.

Yanmaz, Evsen [Los Alamos National Laboratory

2008-01-01T23:59:59.000Z

140

Clock Agreement Among Parallel Supercomputer Nodes  

SciTech Connect (OSTI)

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.

Jones, Terry R.; Koenig, Gregory A.

2014-04-30T23:59:59.000Z

Note: This page contains sample records for the topic "hp network node" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


141

Clock Agreement Among Parallel Supercomputer Nodes  

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

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.

Jones, Terry R.; Koenig, Gregory A.

142

HP Laboratories 1/24/98 Hiro:Documents:Giordano Beretta:Research:EI 98:DqtPoster  

E-Print Network [OSTI]

HP Laboratories 1/24/98 Hiro:Documents:Giordano Beretta:Research:EI 98:DqtPoster 0Compressing:Documents:Giordano Beretta:Research:EI 98:DqtPoster 1The hotting of the W3 The W3was designed for the paradigm.http://www.w3.org/Style/ #12;HP Laboratories 1/24/98 Hiro:Documents:Giordano Beretta:Research:EI 98:Dqt

Beretta, Giordano

143

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

DOE Patents [OSTI]

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

Archer, Charles J. (Rochester, MN); Megerian, Mark G. (Rochester, MN); Ratterman, Joseph D. (Rochester, MN); Smith, Brian E. (Rochester, MN)

2010-01-12T23:59:59.000Z

144

Collective network for computer structures  

DOE Patents [OSTI]

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.

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-07T23:59:59.000Z

145

Collective network for computer structures  

DOE Patents [OSTI]

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.

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

2011-08-16T23:59:59.000Z

146

IMPLEMENTATION OF TEAN-SLEEP FOR WIRELESS SENSOR NETWORKS Jesus Jaquez, David Valencia, Manikanden Balakrishnan,  

E-Print Network [OSTI]

, storage but most importantly in energy. When a node's energy is exhausted, the node can no longer provide. A node is able to save energy while idle by sleeping. Topology and Energy Adaptive, Non-synchronous (TEAN) sleep provides the nodes in a network a mechanism to save energy by sleeping while also keeping

Johnson, Eric E.

147

Maximizing the Number of Broadcast Operations in Random Geometric Ad-Hoc Wireless Networks  

E-Print Network [OSTI]

static ad-hoc wireless networks whose nodes, equipped with the same initial battery charge, may dynamically change their transmission range. When a node v transmits with range r(v), its battery charge of a node depends, in turn, on the energy power supplied to the node. In particular, the power Pv required

Calamoneri, Tiziana

148

HADOF: Defense Against Routing Disruptions in Mobile Ad Hoc Networks  

E-Print Network [OSTI]

1 HADOF: Defense Against Routing Disruptions in Mobile Ad Hoc Networks Wei Yu, Yan Sun and K. J disruptions in mobile ad hoc networks. Based on the observed behavior and the history record of each node AND BACKGROUND A mobile ad hoc network is a group of mobile nodes without requiring centralized administration

Sun, Yan Lindsay

149

Electricity generation with looped transmission networks: Bidding to an ISO  

E-Print Network [OSTI]

on a transmission network from net generation nodes to net consumption nodes is governed by the Kirchoff Laws [45Electricity generation with looped transmission networks: Bidding to an ISO Xinmin Hu Daniel Ralph to model markets for delivery of electrical power on looped transmission networks. It analyzes

Ferris, Michael C.

150

Co-Simulation Tools for Networked Control Systems  

E-Print Network [OSTI]

/Plant Extension ! NSCSPlant, NSCSController Extensions ! Modelica/ns-2 Integration [BPZ'02 NCS Co medium (wire/wireless link) Network node (data source) Network node (data sink) From Modelica to ns-2 From ns-2 to Modelica [Al-Hammouri, Agrawal, Liberatore, Branicky] Network View Example Reference Speed

Branicky, Michael S.

151

WSN-inspired Sleep Protocols for Heterogeneous LTE Networks  

E-Print Network [OSTI]

architecture becomes heterogenous, in particular 4G networks where LTE micro eNodeBs are deployed to strengthen algorithm to dynamically switch off and on the micro eNodeBs of an LTE heterogeneous network followingWSN-inspired Sleep Protocols for Heterogeneous LTE Networks Iulia Tunaru CEA CEA-Leti, Minatec

Paris-Sud XI, Université de

152

Global interrupt and barrier networks  

DOE Patents [OSTI]

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.

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); Kopcsay, Gerard V. (Yorktown Heights, NY); Steinmacher-Burow, Burkhard D. (Mount Kisco, NY); Takken, Todd E. (Mount Kisco, NY)

2008-10-28T23:59:59.000Z

153

Robust Critical Node Selection by Benders Decomposition  

E-Print Network [OSTI]

critical node selection problem, we define the following decision variables ..... method to generate Pareto-optimal cuts thus achieving very good speed-ups compared to ... Barabsi-Albert graphs generated using the Barabsi graph generator (Dreier, 2006). ...... Computers & Operations Research, 38(12):1766 1774, 2011.

2014-01-28T23:59:59.000Z

154

AN ASYMPTOTICALLY OPTIMAL APPROACH TO THE DISTRIBUTED ADAPTIVE TRANSMIT BEAMFORMING IN WIRELESS SENSOR NETWORKS  

E-Print Network [OSTI]

the plants on a field. As the transmission power of each single node is too weak to reach the distant]. A solution to synchronize carrier signals of distributed wireless nodes is virtual/cooperative MIMO for wireless sen- sor networks [1, 2, 3]. In virtual MIMO for wireless sensor networks, single antenna nodes

Beigl, Michael

155

Monte Carlo simulations of the HP model (the "Ising model" of protein folding)  

E-Print Network [OSTI]

Using Wang-Landau sampling with suitable Monte Carlo trial moves (pull moves and bond-rebridging moves combined) we have determined the density of states and thermodynamic properties for a short sequence of the HP protein model. For free chains these proteins are known to first undergo a collapse "transition" to a globule state followed by a second "transition" into a native state. When placed in the proximity of an attractive surface, there is a competition between surface adsorption and folding that leads to an intriguing sequence of "transitions". These transitions depend upon the relative interaction strengths and are largely inaccessible to "standard" Monte Carlo methods.

Li, Ying Wai; Landau, David P; 10.1016/j.cpc.2010.12.049

2011-01-01T23:59:59.000Z

156

U-117: Potential security vulnerability has been identified with certain HP  

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

AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on Delicious RankCombustion |Energy Usage »of EnergyTheTwo New Energy Storage6 (07/03)Arbitraryprinters and HP

157

access design considerations: Topics by E-print Network  

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

for a Large-Scale Wireless Sensor Network for Substation Monitoring Asis such as transformers, circuit break- ers, and compressors. All nodes communicate over a multihop...

158

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

DOE Patents [OSTI]

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.

Archer, Charles J. (Rochester, MN); Berg, Jeremy E. (Rochester, MN); Blocksome, Michael A. (Rochester, MN); Smith, Brian E. (Rochester, MN)

2010-11-23T23:59:59.000Z

159

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

DOE Patents [OSTI]

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.

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

2010-06-08T23:59:59.000Z

160

Switch for serial or parallel communication networks  

DOE Patents [OSTI]

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.

Crosette, D.B.

1994-07-19T23:59:59.000Z

Note: This page contains sample records for the topic "hp network node" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


161

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]

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.

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

2012-10-16T23:59:59.000Z

162

On Local and Global Centrality in Large Scale Networks  

E-Print Network [OSTI]

Estimating influential nodes in large scale networks including but not limited to social networks, biological networks, communication networks, emerging smart grids etc. is a topic of fundamental interest. To understand influences of nodes in a network, a classical metric is centrality within which there are multiple specific instances including degree centrality, closeness centrality, betweenness centrality and more. As of today, existing algorithms to identify nodes with high centrality measures operate upon the entire (or rather global) network, resulting in high computational complexity. In this paper, we design efficient algorithms for determining the betweenness centrality in large scale networks by taking advantage of the modular topology exhibited by most of these large scale networks. Very briefly, modular topologies are those wherein the entire network appears partitioned into distinct modules (or clusters or communities), wherein nodes within the module (that likely share highly similar profiles) h...

Das, Sima

2014-01-01T23:59:59.000Z

163

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

DOE Patents [OSTI]

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.

Crosetto, Dario B. (DeSoto, TX)

1996-01-01T23:59:59.000Z

164

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

DOE Patents [OSTI]

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.

Crosetto, D.B.

1996-12-31T23:59:59.000Z

165

Localized Bridging Centrality for Distributed Network Analysis  

E-Print Network [OSTI]

network administrators identify critical nodes that are important for the robustness of the network administrator (sysadmin) manage a wireless mesh network or would allow an automated management system understand a system administrator to manage a mesh network in a more effective manner. While the system administrator

Kotz, David

166

Integrating Correlated Bayesian Networks Using Maximum Entropy  

SciTech Connect (OSTI)

We consider the problem of generating a joint distribution for a pair of Bayesian networks that preserves the multivariate marginal distribution of each network and satisfies prescribed correlation between pairs of nodes taken from both networks. We derive the maximum entropy distribution for any pair of multivariate random vectors and prescribed correlations and demonstrate numerical results for an example integration of Bayesian networks.

Jarman, Kenneth D.; Whitney, Paul D.

2011-08-30T23:59:59.000Z

167

Zone routing in a torus network  

DOE Patents [OSTI]

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.

Chen, Dong; Heidelberger, Philip; Kumar, Sameer

2013-01-29T23:59:59.000Z

168

anchor nodes mission: Topics by E-print Network  

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

influence and the alignment is determined by the structure of the interface between the brush and the pure solvent instead. Harald Lange; Friederike Schmid 2002-05-15 58 Accurate...

169

The normalization of meshes and nodes in electrical networks  

E-Print Network [OSTI]

...........................70 Appendix II. The Current Generator ............ 75 Appendix III. The Timer . . . . . . . . ........ 80 Bibliography ..................................... 82 2 23565839 691 0(6)7 l+5F3i)F 5F7 gF38g7 3u (re.3+( S6( 6uu7g571 53 (3e7 7c5795... .r 5F7 5ra7S,857, SF8gF S6( 6m68+6.+7p 5F7 S,857, F6( 6557ea571 53 i(7 (56916,1 93565839 89 5F3(7 g6(7( SF7,7 5F7 93565839 F6( .7g3e7 (56916,18s71n hF7 93565839 (F3i+1 .7 g+76, 691 g39(8(5795 5F,3i)F3i5n hF7 57,e (ree75,8g6+ 975S3,? 8( i(71 53...

Johnson, Allen Forrest

1951-01-01T23:59:59.000Z

170

atrioventricular node ablation: Topics by E-print Network  

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

is performed in selected patients with a symptomatic premature ventricular complex (PVC) or PVC-induced cardiomyopathy. Ablation of PVC from the His region has a high risk of...

171

Connectivity of confined 3D Networks with Anisotropically Radiating Nodes  

E-Print Network [OSTI]

increasingly useful in sensor and vehicular net- work applications [2], including, inter alia, smart grid [3 management and dynamic route planning. Commonality in these applications can be found in that the number

Goussev, Arseni O.

172

A Mechanically Stable, Low Profile, Omni-Directional Solar-Cell Integrated Antenna for Outdoor Wireless Sensor Nodes  

E-Print Network [OSTI]

sensor network standard is proposed by integrating a circular array of slot antennas with solar cells. IIA Mechanically Stable, Low Profile, Omni-Directional Solar-Cell Integrated Antenna for Outdoor Wireless Sensor Nodes T. Wu, R.L. Li, and M. M. Tentzeris School of Electrical and Computer Engineering

Tentzeris, Manos

173

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

DOE Patents [OSTI]

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.

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

2013-10-22T23:59:59.000Z

174

Netscape Directory Server B.06.11.40 for HP-UX Release Notes  

E-Print Network [OSTI]

information in this document is subject to change without notice. Hewlett-Packard makes no warranty of any kind with regard to this manual, including, but not limited to, the implied warranties of merchantability and fitness for a particular purpose. Hewlett-Packard shall not be held liable for errors contained herein or direct, indirect, special, incidental or consequential damages in connection with the furnishing, performance, or use of this material. Warranty A copy of the specific warranty terms applicable to your Hewlett-Packard product and replacement parts can be obtained from your local Sales and Service Office. U.S. Government License Proprietary computer software. Valid license from HP required for possession, use or copying.

unknown authors

2005-01-01T23:59:59.000Z

175

Netscape Directory Server B.07.00.10 for HP-UX Release Notes  

E-Print Network [OSTI]

information in this document is subject to change without notice. Hewlett-Packard makes no warranty of any kind with regard to this manual, including, but not limited to, the implied warranties of merchantability and fitness for a particular purpose. Hewlett-Packard shall not be held liable for errors contained herein or direct, indirect, special, incidental or consequential damages in connection with the furnishing, performance, or use of this material. Warranty A copy of the specific warranty terms applicable to your Hewlett-Packard product and replacement parts can be obtained from your local Sales and Service Office. U.S. Government License Proprietary computer software. Valid license from HP required for possession, use or copying.

Hp-ux I Version

2005-01-01T23:59:59.000Z

176

Network  

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

AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel),Feet) Year Jan Feb Mar Apr May Jun Jul(Summary)morphinanInformation Desert Southwest Regionat Cornell Batteries &NSTCurrent Issues &Network » Network

177

Maintaining connectivity in a mobile ad hoc network  

E-Print Network [OSTI]

This thesis focuses on the problem of maintaining graphics. connectivity in a mobile ad hoc network. Mobile ad hoc networks are without a fixed topology and are dynamically changing. This makes the problem of maintaining connectivity among all nodes...

Reuben, Ron S.

2012-06-07T23:59:59.000Z

178

Dynamic address allocation protocols for Mobile ad hoc networks  

E-Print Network [OSTI]

Address allocation is an important issue in Mobile ad hoc networks. This thesis proposes solutions to assign unique IP addresses to nodes participating in Mobile ad hoc networks and evaluates the proposed solutions. Address allocation protocols...

Patchipulusu, Praveena

2001-01-01T23:59:59.000Z

179

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

SciTech Connect (OSTI)

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.

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-01T23:59:59.000Z

180

On the Access Pricing and Network Scaling Issues of Wireless Mesh Networks  

E-Print Network [OSTI]

1 On the Access Pricing and Network Scaling Issues of Wireless Mesh Networks Ray K. Lam Dah. This paper studies the use of pricing as an incentive mechanism to stimulate participation and collaboration in public wireless mesh networks. Our focus is on the "economic behavior" of the network nodes-- the pricing

Lui, John C.S.

Note: This page contains sample records for the topic "hp network node" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


181

Identifying failure in a tree network of a parallel computer  

DOE Patents [OSTI]

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

Archer, Charles J. (Rochester, MN); Pinnow, Kurt W. (Rochester, MN); Wallenfelt, Brian P. (Eden Prairie, MN)

2010-08-24T23:59:59.000Z

182

Numerical simulation of borehole acoustic logging in the frequency and time domains with hp-adaptive finite elements  

E-Print Network [OSTI]

and for the improvement of acoustic logging techniques used by oil- and oil-service companies to detect and quantifyNumerical simulation of borehole acoustic logging in the frequency and time domains with hp Available online 8 January 2009 Keywords: Acoustic logging Borehole acoustics Wave propagation Linear

Torres-Verdín, Carlos

183

2 15.10.2013 Joachim Dietle Optimisation of Air-Water HP's Optimisation of Air-Water Heat Pumps  

E-Print Network [OSTI]

-Water Heat Pumps Ziehl-Abegg SE System boundary Improve Air Flow of Fan Improve System Joachim Dietle.10.2013 Joachim Dietle Optimisation of Air-Water HP's System boundary Air Flow in Heat Pumps V q d p st p P P L fan )( 1 Relevant for cooling or heating! Optimise heat pump: reduce pressure drop increase

Oak Ridge National Laboratory

184

Global warming and wintering in Dippers Degree project in Biology, 15hp (15 ETCS), 2014-2015  

E-Print Network [OSTI]

Global warming and wintering in Dippers Degree project in Biology, 15hp (15 ETCS), 2014-2015 Aim: Investigate changes in wintering ecology of the dipper over a period of 35 years in the light of global warming. Dippers overwinter in streams and they arrive to their overwintering grounds in late fall

Uppsala Universitet

185

Information Theoretic Framework of Trust Modeling and Evaluation for Ad Hoc Networks  

E-Print Network [OSTI]

1 Information Theoretic Framework of Trust Modeling and Evaluation for Ad Hoc Networks Yan Lindsay-- The performance of ad hoc networks depends on co- operation and trust among distributed nodes. To enhance security in ad hoc networks, it is important to evaluate trustworthiness of other nodes without centralized

Sun, Yan Lindsay

186

Evaluation of a Routing Architecture for Wireless Messaging Ad-Hoc Networks  

E-Print Network [OSTI]

Evaluation of a Routing Architecture for Wireless Messaging Ad-Hoc Networks Megha Goel1 and M´ark F self-organizing ad-hoc networks can be used to provide the short messaging service, at a much lower of ad- hoc network routing in which mobile nodes are allowed to relay in place of static nodes. We

Bencsáth, Boldizsár

187

Collector Receiver Design for Data Collection and Localization in Sensor-driven Networks  

E-Print Network [OSTI]

Collector Receiver Design for Data Collection and Localization in Sensor-driven Networks Bharath is communicating, falls on a network of collector nodes which are perpetually monitoring transmissions from with minimal capabilities, while shifting the complexity to a network of collector nodes. While the philosophy

Madhow, Upamanyu

188

Approximate Minimum-Energy Multicasting in Wireless Ad Hoc Networks  

E-Print Network [OSTI]

and a set of destination nodes, the problem is to build a minimum-energy multicast tree for the requestApproximate Minimum-Energy Multicasting in Wireless Ad Hoc Networks Weifa Liang, Senior Member, IEEE Abstract--A wireless ad hoc network consists of mobile nodes that are equipped with energy

Liang, Weifa

189

Graph/Network Visualization Data model: graph structures (relations,  

E-Print Network [OSTI]

of physics #12;8 The Spring Model Using springs to represent node-node relations. Minimizing energy1 1 Graph/Network Visualization Data model: graph structures (relations, knowledge) and networks hierarchies #12;7 Sugiyama : Building Hierarchy Domain knowledge based. Designing heuristic, e.g. minimizing

Fang, Shiaofen

190

Wormhole-Resilient Secure Neighbor Discovery in Underwater Acoustic Networks  

E-Print Network [OSTI]

), Unmanned Underwater Vehicles (UUV), and surface stations, and nearby nodes communicate via acoustic ratherWormhole-Resilient Secure Neighbor Discovery in Underwater Acoustic Networks Rui Zhang and Yanchao in underwater acoustic networks (UANs) with floating node mobility. In hostile environments, neighbor discovery

Zhang, Rui

191

Advanced mobile networking, sensing, and controls.  

SciTech Connect (OSTI)

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.

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-01T23:59:59.000Z

192

Pinning impulsive control algorithms for complex network  

SciTech Connect (OSTI)

In this paper, we further investigate the synchronization of complex dynamical network via pinning control in which a selection of nodes are controlled at discrete times. Different from most existing work, the pinning control algorithms utilize only the impulsive signals at discrete time instants, which may greatly improve the communication channel efficiency and reduce control cost. Two classes of algorithms are designed, one for strongly connected complex network and another for non-strongly connected complex network. It is suggested that in the strongly connected network with suitable coupling strength, a single controller at any one of the network's nodes can always pin the network to its homogeneous solution. In the non-strongly connected case, the location and minimum number of nodes needed to pin the network are determined by the Frobenius normal form of the coupling matrix. In addition, the coupling matrix is not necessarily symmetric or irreducible. Illustrative examples are then given to validate the proposed pinning impulsive control algorithms.

Sun, Wen [School of Information and Mathematics, Yangtze University, Jingzhou 434023 (China)] [School of Information and Mathematics, Yangtze University, Jingzhou 434023 (China); L, Jinhu [Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing 100190 (China)] [Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing 100190 (China); Chen, Shihua [College of Mathematics and Statistics, Wuhan University, Wuhan 430072 (China)] [College of Mathematics and Statistics, Wuhan University, Wuhan 430072 (China); Yu, Xinghuo [School of Electrical and Computer Engineering, RMIT University, Melbourne VIC 3001 (Australia)] [School of Electrical and Computer Engineering, RMIT University, Melbourne VIC 3001 (Australia)

2014-03-15T23:59:59.000Z

193

MTX data acquisition and analysis computer network  

SciTech Connect (OSTI)

For the MTX experiment, we use a network of computers for plasma diagnostic data acquisition and analysis. This multivendor network employs VMS, UNIX, and BASIC based computers connected in a local area Ethernet network. Some of the data is acquired directly into a VAX/VMS computer cluster over a fiber-optic serial CAMAC highway. Several HP-Unix workstations and HP-BASIC instrument control computers acquire and analyze data for the more data intensive or specialized diagnostics. The VAX/VMS system is used for global analysis of the data and serves as the central data archiving and retrieval manager. Shot synchronization and control of data flow are implemented by task-to-task message passing using our interprocess communication system. The system has been in operation during our initial MTX tokamak and FEL experiments; it has operated reliably with data rates typically in the range of 5 Mbytes/shot without limiting the experimental shot rate.

Butner, D.N.; Casper, T.A.; Brown, M.D.; Drlik, M.; Meyer, W.H.; Moller, J.M. (Lawrence Livermore National Laboratory, University of California, Livermore, CA (USA))

1990-10-01T23:59:59.000Z

194

U-017: HP MFP Digital Sending Software Lets Local Users Obtain...  

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

TRACETRACK Support Lets Remote Users Obtain Potentially Sensitive Information V-002: EMC NetWorker Module for Microsoft Applications Lets Remote Users Execute Arbitrary Code...

195

E-Print Network 3.0 - anier aleksander arkovski Sample Search...  

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

92 Node Allocation and Topographical Encoding NATEnet for Inverse Kinematics of a 6DOF Robot Arm Summary: . Aleksander and J. Taylor, editors, Arti cal Neural Networks, pages...

196

E-Print Network 3.0 - accessibility global gateway Sample Search...  

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

Sciences ; Engineering 3 Performance Comparison of Gateway Discovery Algorithms in Ad Hoc Networks with Mobile Nodes Summary: Performance Comparison of Gateway Discovery...

197

E-Print Network 3.0 - ac hopping conduction Sample Search Results  

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

; Computer Technologies and Information Sciences 9 Node Connectivity in Vehicular Ad Hoc Networks with Structured Mobility Summary: Department of Electrical and Electronic...

198

Energy efficient and fairness improved medium access scheduling algorithms for mobile ad hoc networks;.  

E-Print Network [OSTI]

??In mobile ad hoc networks dynamically changing topologies are newlinethe direct result of the mobility of the nodes which characterize the ad hoc newlinenetworks Each (more)

Priakanth P

2015-01-01T23:59:59.000Z

199

E-Print Network 3.0 - apartheid-like social structure Sample...  

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

Maps and measures with NodeXL Networks are a data structure common across all social media... .northwestern.edu Marc A. Smith Chief Social Scientist Connected Action...

200

E-Print Network 3.0 - apollonio rodio ad Sample Search Results  

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

Computer... , sensors may have four other components: analog, AD, digital, and micro- controller. The simplest design... " into sensor network nodes. Therefore, a...

Note: This page contains sample records for the topic "hp network node" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


201

E-Print Network 3.0 - ali Sample Search Results  

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

64GB computing platform. Nodes are connected using Myrinet and Gigabit Ethernet networks. The ALi... . Users need not start these components while performing experiments....

202

Bayesian networks: maths problems March 31, 2009  

E-Print Network [OSTI]

that the patient smokes, but have not carried out any genetic tests. Symptoms of the disease are coughing (node C) and high temperature (node T). The patient is coughing but does not have a high temperature. Draw coughing. Draw a modified Bayesian network to model this, and discuss qualitatively how your belief about

Barker, Jon

203

DETECTING CRITICAL NODES IN SPARSE GRAPHS Given a ...  

E-Print Network [OSTI]

the pair-wise disconnectivity among the nodes, but also minimizes the variance in the car- dinalities of the components. Particularly, in Lemma 1 we show that for

2008-08-21T23:59:59.000Z

204

Scale-Free Growing Networks and Gravity  

E-Print Network [OSTI]

We propose a possible relation between complex networks and gravity. Our guide in our proposal is the power-law distribution of the node degree in network theory and the information approach to gravity. The established bridge may allow us to carry geometric mathematical structures, which are considered in gravitational theories, to probabilistic aspects studied in the framework of complex networks and vice versa.

J. A. Nieto

2012-11-29T23:59:59.000Z

205

Costeffective Outbreak Detection in Networks  

E-Print Network [OSTI]

on how contaminants spread in the network Problem posed by US Environmental Protection Agency S On which nodes should we place sensors to efficiently detect the all possible contaminations? S #12 Given a graph G(V,E) and a budget B for sensors and data on how contaminations spread over the network

Yang, Qiang

206

New approach for calibration the efficiency of HpGe detectors  

SciTech Connect (OSTI)

This work evaluates the efficiency calibrating of HpGe detector coupled with Canberra GC3018 with Genie 2000 software and Ortec GEM25-76-XLB-C with Gamma Vision software; available at Neutron activation analysis laboratory in Malaysian Nuclear Agency (NM). The efficiency calibration curve was constructed from measurement of an IAEA, standard gammapoint sources set composed by {sup 214}Am, {sup 57}Co, {sup 133}Ba, {sup 152}Eu, {sup 137}Cs and {sup 60}Co. The efficiency calibrations were performed for three different geometries: 5, 10 and 15 cm distances from the end cap detector. The polynomial parameters functions were simulated through a computer program, MATLAB in order to find an accurate fit to the experimental data points. The efficiency equation was established from the known fitted parameters which allow for the efficiency evaluation at particular energy of interest. The study shows that significant deviations in the efficiency, depending on the source-detector distance and photon energy.

Alnour, I. A. [Department of Physics, Faculty of Science, Universiti Teknologi Malaysia, 81310 UTM Skudai, Johor, Malaysia and Department of Physics, Faculty of Pure and Applied Science, International University of Africa, 12223 Khartoum (Sudan); Wagiran, H. [Department of Physics, Faculty of Science, Universiti Teknologi Malaysia, 81310 UTM Skudai, Johor (Malaysia); Ibrahim, N. [Faculty of Defence Science and Technology, National Defence University of Malaysia, Kem Sungai Besi, 57000 Kuala Lumpur (Malaysia); Hamzah, S.; Siong, W. B.; Elias, M. S. [Malaysia Nuclear Agency (MNA), Bangi, 43000 Kajang, Selangor (Malaysia)

2014-02-12T23:59:59.000Z

207

Netscape Directory Server B.06.11.40 for HP-UX Release Notes  

E-Print Network [OSTI]

information in this document is subject to change without notice. Hewlett-Packard makes no warranty of any kind with regard to this manual, including, but not limited to, the implied warranties of merchantability and fitness for a particular purpose. Hewlett-Packard shall not be held liable for errors contained herein or direct, indirect, special, incidental or consequential damages in connection with the furnishing, performance, or use of this material. Warranty A copy of the specific warranty terms applicable to your Hewlett-Packard product and replacement parts can be obtained from your local Sales and Service Office. U.S. Government License Proprietary computer software. Valid license from HP required for possession, use or copying. Consistent with FAR 12.211 and 12.212, Commercial Computer Software, Computer Software Documentation, and Technical Data for Commercial Items are licensed to the U.S. Government under vendor's standard commercial license. Copyright Notices Copyright 2005 Hewlett-Packard Company L.P. All rights reserved. Reproduction, adaptation, or translation of this document without prior written permission is prohibited, except as allowed under the copyright laws. Trademark Notices UNIX is a registered trademark in the United States and other countries, licensed exclusively through The Open Group.

unknown authors

2005-01-01T23:59:59.000Z

208

Design and Analysis of Low Complexity Network Coding Schemes  

E-Print Network [OSTI]

. Motivation . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 B. Background, Contributions, and Related Work . . . . . . . . . 3 1. Undirected ring networks . . . . . . . . . . . . . . . . . . 3 2. Node constrained line and star networks... . . . . . . . . . . 5 3. Linear deterministic relay networks . . . . . . . . . . . . . 8 C. Dissertation Outline . . . . . . . . . . . . . . . . . . . . . . . 12 II ON THE MULTIMESSAGE CAPACITY REGION FOR UNDI- RECTED RING NETWORKS...

Tabatabaei-Yazdi, Seyed

2012-02-20T23:59:59.000Z

209

IEEE INFOCOM 2002 1 Application of Network Calculus to General  

E-Print Network [OSTI]

approaches for breaking cycles, such as the spanning tree and up/down routing algorithms, in terms of network, the minimum envelop rate (MER) [5] and exponentially bounded burstiness (EBB) [27] network calculi provide provides general stochastic bounds at each node of a network. A central problem shared by all network

Starobinski, David

210

Maximizing the Number of Broadcast Operations in Static Random Geometric Ad-Hoc Networks  

E-Print Network [OSTI]

networks where nodes have the same initial battery charge and they may dynamically change their transmission range at every time slot. When a node v transmits with range r(v), its battery charge is decreased-Verlag Berlin Heidelberg 2007 #12;248 T. Calamoneri et al. supplied to the node. In particular, the power Pv

Calamoneri, Tiziana

211

Visualizing Multivariate Network Using GeoSOM and Spherical Disk Layout School of Information Technologies  

E-Print Network [OSTI]

. Connections in the network describe relationships/activities between the data points. Many real world data countries are repre- sented as nodes, each country has properties like gross domestic product (GDP), GDP Previously, we treat each graph node as a point in high-dimensional space and use GeoSOM to project the nodes

Hong,Seokhee

212

Flask: A Language for Data-driven Sensor Network Geoffrey Mainland, Matt Welsh, and Greg Morrisett  

E-Print Network [OSTI]

processing to reduce energy and radio bandwidth usage. As a result, application developers typically invest chains of operators into a dataflow graph that may reside on individual nodes or span multiple nodes in the network. To compose dataflow graphs across sensor nodes, Flask supports a lean, general

213

Sleeping on the Job: Energy-Efficient Broadcast for Radio Networks  

E-Print Network [OSTI]

We address the problem of minimizing power consumption when performing reliable broadcast on a radio network under the following popular model. Each node in the network is located on a point in a two dimensional grid, and whenever a node sends a message, all awake nodes within distance r receive the message. In the broadcast problem, some node wants to successfully send a message to all other nodes in the network even when up to a 1/2 fraction of the nodes within every neighborhood can be deleted by an adversary. The set of deleted nodes is carefully chosen by the adversary to foil our algorithm and moreover, the set of deleted nodes may change periodically. This models worst-case behavior due to mobile nodes, static nodes losing power or simply some points in the grid being unoccupied. A trivial solution requires each node in the network to be awake roughly 1/2 the time, and a trivial lower bound shows that each node must be awake for at least a 1/n fraction of the time. Our first result is an algorithm that...

King, Valerie; Saia, Jared; Young, Maxwell

2007-01-01T23:59:59.000Z

214

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

SciTech Connect (OSTI)

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.

Traub, Richard J.

2010-03-26T23:59:59.000Z

215

Everlast: Long-life, Supercapacitor-operated Wireless Sensor Node  

E-Print Network [OSTI]

Everlast: Long-life, Supercapacitor-operated Wireless Sensor Node Farhan Simjee and Pai H. Chou,phchou}@uci.edu ABSTRACT This paper describes a supercapacitor-operated, solar-powered wire- less sensor node called, Design Keywords Maximum power point tracking, supercapacitor, solar power, wire- less sensors 1

Chou, Pai H.

216

Maximizing Service Reliability in Distributed Computing Systems with Random Node  

E-Print Network [OSTI]

Maximizing Service Reliability in Distributed Computing Systems with Random Node Failures: Theory Member, IEEE Abstract--In distributed computing systems (DCSs) where server nodes can fail permanently with nonzero probability, the system performance can be assessed by means of the service reliability, defined

Hayat, Majeed M.

217

Downhole drilling network using burst modulation techniques  

DOE Patents [OSTI]

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.

Hall; David R. (Provo, UT), Fox; Joe (Spanish Fork, UT)

2007-04-03T23:59:59.000Z

218

Recent advances with quiescent power supply current (I sub DDQ ) testing at Sandia using the HP82000  

SciTech Connect (OSTI)

Last year at the HP82000 Users Group Meeting, Sandia National Laboratories gave a presentation on I{sub DDQ} testing. This year, we will present some advances on this testing including DUT board fixturing, external DC PMU measurement, and automatic IDD-All circuit calibration. This paper is geared more toward implementation than theory, with results presented from Sandia tests. After a brief summary I{sub DDQ} theory and testing concepts, we will describe how the break (hold state) vector and data formatting present a test vector generation concern for the HP82000. We than discuss fixturing of the DUT board for both types of I{sub DDQ} measurement, and how the continuity test and test vector generation must be taken into account. Results of a test including continuity, IDD-All and I{sub DDQ} Value measurements will be shown. Next, measurement of low current using an external PMU is discussed, including noise considerations, implementation and some test results showing nA-range measurements. We then present a method for automatic calibration of the IDD-All analog comparator circuit using RM BASIC on the HP82000, with implementation and measurement results. Finally, future directions for research in this area will be explored. 14 refs., 16 figs.

Righter, A.W.; Leong, D.J.; Cox, L.B.

1991-01-01T23:59:59.000Z

219

Capacity Proportional Unstructured Peer-to-Peer Networks  

E-Print Network [OSTI]

, to achieve maximum completion of random walks in the network, the tra?c distribution among nodes should be proportional to their capacity. In this section, we provide a simple proof for this. 12 Consider a connected, undirected graph G with n nodes...) For ? given by (12), the tra?c rate at any node i Ti = ?oi?k = CiPn j=1 Cj Pn i=1 Ci k k = Ci: Therefore, none of the nodes in the network is backlogged and the completion 14 rate of the random walks M = nX i=1 ?i(k) = nX i=1 ?i? = Pn i=1 Ci k : Since...

Reddy, Chandan Rama

2010-10-12T23:59:59.000Z

220

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

SciTech Connect (OSTI)

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.

Taylor, Stuart G [Los Alamos National Laboratory; Farinholt, Kevin M [Los Alamos National Laboratory; Park, Gyuhae [Los Alamos National Laboratory; Farrar, Charles R [Los Alamos National Laboratory; Todd, Michael D [UCSD

2009-01-01T23:59:59.000Z

Note: This page contains sample records for the topic "hp network node" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


221

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

DOE Patents [OSTI]

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.

Foo Kune, Denis (Saint Paul, MN); Mahadevan, Karthikeyan (Mountain View, CA)

2011-01-25T23:59:59.000Z

222

NETWORK CODING-AWARE RATE CONTROL AND SCHEDULING IN WIRELESS NETWORKS  

E-Print Network [OSTI]

NETWORK CODING-AWARE RATE CONTROL AND SCHEDULING IN WIRELESS NETWORKS Hulya Seferoglu , Athina demonstrate that there is benefit from making rate control and scheduling aware of the underlying network conflicts between nodes, which should be taken into account both in rate control and in scheduling. We

Markopoulou, Athina

223

Network topology analysis.  

SciTech Connect (OSTI)

Emerging high-bandwidth, low-latency network technology has made network-based architectures both feasible and potentially desirable for use in satellite payload architectures. The selection of network topology is a critical component when developing these multi-node or multi-point architectures. This study examines network topologies and their effect on overall network performance. Numerous topologies were reviewed against a number of performance, reliability, and cost metrics. This document identifies a handful of good network topologies for satellite applications and the metrics used to justify them as such. Since often multiple topologies will meet the requirements of the satellite payload architecture under development, the choice of network topology is not easy, and in the end the choice of topology is influenced by both the design characteristics and requirements of the overall system and the experience of the developer.

Kalb, Jeffrey L.; Lee, David S.

2008-01-01T23:59:59.000Z

224

Maximizing Network Lifetime Via 3G Gateway Assignment in Dual-Radio Sensor Networks  

E-Print Network [OSTI]

- ments, such as temperature, humidity, wind, solar radiation, etc. [3]. Sensor nodes are typically are no longer applicable. Rather, a third party network, e.g., FDDI, ISDN, or VPN, is to be leased

California at Berkeley, University of

225

Joint Structure Learning of Multiple Non-Exchangeable Networks Chris. J. Oates Sach Mukherjee  

E-Print Network [OSTI]

Joint Structure Learning of Multiple Non-Exchangeable Networks Chris. J. Oates Sach Mukherjee application, networks with nodes corresponding to products in an inventory (Tay- lor and Fox, 2011) may. An SLT is a rooted 687 #12;J

Kaski, Samuel

226

Scheduling algorithms for throughput maximization in time-varying networks with reconfiguration delays  

E-Print Network [OSTI]

We consider the control of possibly time-varying wireless networks under reconfiguration delays. Reconfiguration delay is the time it takes to switch network resources from one subset of nodes to another and it is a ...

Celik, Guner Dincer

2012-01-01T23:59:59.000Z

227

Computational Science Technical Note CSTN-119 Betweenness Centrality Metrics for Assessing Electrical Power Network  

E-Print Network [OSTI]

0 Computational Science Technical Note CSTN-119 Betweenness Centrality Metrics for Assessing. Hawick}, title = {Betweenness Centrality Metrics for Assessing Electrical Power Network Robustness Metrics for Assessing Electrical Power Network Robustness against Fragmentation and Node Failure K

Hawick, Ken

228

Controlling Complex Networks with Compensatory Perturbations  

E-Print Network [OSTI]

The response of complex networks to perturbations is of utmost importance in areas as diverse as ecosystem management, emergency response, and cell reprogramming. A fundamental property of networks is that the perturbation of one node can affect other nodes, in a process that may cause the entire or substantial part of the system to change behavior and possibly collapse. Recent research in metabolic and food-web networks has demonstrated the concept that network damage caused by external perturbations can often be mitigated or reversed by the application of compensatory perturbations. Compensatory perturbations are constrained to be physically admissible and amenable to implementation on the network. However, the systematic identification of compensatory perturbations that conform to these constraints remains an open problem. Here, we present a method to construct compensatory perturbations that can control the fate of general networks under such constraints. Our approach accounts for the full nonlinear behavior of real complex networks and can bring the system to a desirable target state even when this state is not directly accessible. Applications to genetic networks show that compensatory perturbations are effective even when limited to a small fraction of all nodes in the network and that they are far more effective when limited to the highest-degree nodes. The approach is conceptually simple and computationally efficient, making it suitable for the rescue, control, and reprogramming of large complex networks in various domains.

Sean P. Cornelius; William L. Kath; Adilson E. Motter

2011-05-18T23:59:59.000Z

229

Flexible network wireless transceiver and flexible network telemetry transceiver  

DOE Patents [OSTI]

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.

Brown, Kenneth D. (Grain Valley, MO)

2008-08-05T23:59:59.000Z

230

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

DOE Patents [OSTI]

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.

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

2013-01-29T23:59:59.000Z

231

Consort: NodeConsort: Node--constrainedconstrained Opportunistic Routing in WirelessOpportunistic Routing in Wireless  

E-Print Network [OSTI]

on Mobile Computing, 2003. K. W. Choi, W. S. Jeon, and D. G. Jeong, "Efficient Load-Aware Routing Scheme. Sankar and Z. Liu, "Maximum Lifetime Routing in Wireless Ad- hoc Networks," IEEE INFOCOM'04. P. P. Pham

Xue, Guoliang

232

The CitiSense Air Quality Monitoring Mobile Sensor Node Piero Zappi, Elizabeth Bales, Jing Hong Park, William Griswold and Tajana Simuni Rosing  

E-Print Network [OSTI]

conditions than the national ambient air quality standard [1]. Current air pollutant measurement networks. For example, The San Diego Air Pollution Control District (SDAPCD) maintains only five air pollutant samplingThe CitiSense Air Quality Monitoring Mobile Sensor Node Piero Zappi, Elizabeth Bales, Jing Hong

Simunic, Tajana

233

Dynamics of Coupled Maps in Heterogeneous Random Networks  

E-Print Network [OSTI]

We study expanding circle maps interacting in a heterogeneous random network. Heterogeneity means that some nodes in the network are massively connected, while the remaining nodes are only poorly connected. We provide a probabilistic approach which enables us to describe the effective dynamics of the massively connected nodes when taking a weak interaction limit. More precisely, we show that for almost every random network and almost all initial conditions the high dimensional network governing the dynamics of the massively connected nodes can be reduced to a few macroscopic equations. Such reduction is intimately related to the ergodic properties of the expanding maps. This reduction allows one to explore the coherent properties of the network.

Tiago Pereira; Sebastian van Strien; Jeroen S. W. Lamb

2013-08-26T23:59:59.000Z

234

On strong fault tolerance (or strong Menger-connectivity) of multicomputer networks  

E-Print Network [OSTI]

disjoint paths. Thus, the study of disjoint paths connecting any two nodes can be useful for increasing the reliability of inter- connection networks, as well as transmission efficiency. A larger number of disjoint paths is more desirable because of less..., node- disjoint paths have been extensively studied on networks [8, 18, 26]. Most research on constructing node-disjoint paths is done in graphs without faults. In this dissertation, we introduce the concept of strong fault tolerance which characterizes...

Oh, Eunseuk

2004-11-15T23:59:59.000Z

235

Network Upgrade for the SLC: PEP II Network  

SciTech Connect (OSTI)

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.

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

2011-09-09T23:59:59.000Z

236

Centralized algorithms for maintaining connectivity in a mobile ad hoc network  

E-Print Network [OSTI]

This thesis focuses on the problem of maintaining connectivity in a mobile ad hoc network (MANET). In a connected MANET, communication is possible between any pair of nodes. The nodes in a mobile ad hoc network are constantly moving causing frequent...

Karwa, Tapan P.

2012-06-07T23:59:59.000Z

237

A Turnover based Adaptive HELLO Protocol for Mobile Ad Hoc and Sensor Networks  

E-Print Network [OSTI]

A Turnover based Adaptive HELLO Protocol for Mobile Ad Hoc and Sensor Networks François Ingelrest.Mitton,David.Simplot}@lifl.fr Abstract--We present a turnover based adaptive HELLO protocol (TAP), which enables nodes in mobile networks to dynamically adjust their HELLO messages frequency depending on the current speed of nodes. To the best of our

Paris-Sud XI, Université de

238

Thermal network reduction  

SciTech Connect (OSTI)

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.

Balcomb, J.D.

1983-06-01T23:59:59.000Z

239

Thermal network reduction  

SciTech Connect (OSTI)

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.

Balcomb, J.D.

1983-01-01T23:59:59.000Z

240

MTX (Microwave Tokamak Experiment) data acquisition and analysis computer network  

SciTech Connect (OSTI)

For the MTX experiment, we use a network of computers for plasma diagnostic data acquisition and analysis. This multivendor network employs VMS, UNIX, and BASIC based computers connected in a local area Ethernet network. Some of the data is acquired directly into a VAX/VMS computer cluster over a fiber-optic serial CAMAC highway. Several HP-Unix workstations and HP-BASIC instrument control computers acquire and analyze data for the more data intensive or specialized diagnostics. The VAX/VMS system is used for global analysis of the data and serves as the central data archiving and retrieval manager. Shot synchronization and control of data flow are implemented by task-to-task message passing using our interprocess communication system. The system has been in operation during our initial MTX tokamak and FEL experiments; it has operated reliably with data rates typically in the range of 5 megabytes/shot without limiting the experimental shot rate.

Butner, D.N.; Casper, T.A.; Brown, M.D.; Drlik, M.; Meyer, W.H.; Moller, J.M.

1990-06-01T23:59:59.000Z

Note: This page contains sample records for the topic "hp network node" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


241

Optimized Wang-Landau sampling of lattice polymers: Ground state search and folding thermodynamics of HP model proteins  

E-Print Network [OSTI]

Coarse-grained (lattice-) models have a long tradition in aiding efforts to decipher the physical or biological complexity of proteins. Despite the simplicity of these models, however, numerical simulations are often computationally very demanding and the quest for efficient algorithms is as old as the models themselves. Expanding on our previous work [T. W\\"ust and D. P. Landau, Phys. Rev. Lett. 102, 178101 (2009)], we present a complete picture of a Monte Carlo method based on Wang-Landau sampling in combination with efficient trial moves (pull, bond-rebridging and pivot moves) which is particularly suited to the study of models such as the hydrophobic-polar (HP) lattice model of protein folding. With this generic and fully blind Monte Carlo procedure, all currently known putative ground states for the most difficult benchmark HP sequences could be found. For most sequences we could also determine the entire energy density of states and, together with suitably designed structural observables, explore the thermodynamics and intricate folding behavior in the virtually inaccessible low-temperature regime. We analyze the differences between random and protein-like heteropolymers for sequence lengths up to 500 residues. Our approach is powerful both in terms of robustness and speed, yet flexible and simple enough for the study of many related problems in protein folding.

Thomas Wst; David P. Landau

2012-07-17T23:59:59.000Z

242

Minimum-Hot-Spot Query Trees for Wireless Sensor Networks  

E-Print Network [OSTI]

an energy- efficient query routing tree. (a) Energy harvesting for battery- less nodes for the (b) Voltree to the querying node. Energy-efficient query routing trees are needed in a plethora of systems such as PeopleMinimum-Hot-Spot Query Trees for Wireless Sensor Networks Georgios Chatzimilioudis Dept

Zeinalipour, Demetris

243

Distributed Dynamic Clustering Algorithm in Uneven Distributed Wireless Sensor Network  

E-Print Network [OSTI]

the sensor networks energy efficient [3][4][5]. This helps to increase the lifetime of the sensor nodes and energy efficient routing has been presented in recent research literature [1]-[16]. In [1] an intelligent energy efficient de- ployment algorithm for cluster based WSNs is described, in which the sensor node

244

The Structure of Complex Networks Sune Lehmann Jrgensen  

E-Print Network [OSTI]

The Structure of Complex Networks Sune Lehmann Jørgensen Kgs. Lyngby February 2007 IMM-PHD-2007-176 #12;ii The Structure of Complex Networks Version: June 19, 2007 22:27 Sune Lehmann Jørgensen 2007 #12, 2007 22:27 Sune Lehmann Jørgensen 2007 #12;List of Figures 1.1 A network of 300 nodes

245

Condensation and evolution of space-time network  

E-Print Network [OSTI]

In this work, we try to propose, in a novel way using the Bose and Fermi quantum network approach, a framework studying condensation and evolution of space time network described by the Loop quantum gravity. Considering quantum network connectivity features in the Loop quantum gravity, we introduce a link operator, and through extending the dynamical equation for the evolution of quantum network posed by Ginestra Bianconi to an operator equation, we get the solution of the link operator. This solution is relevant to the Hamiltonian of the network, and then is related to the energy distribution of network nodes. Showing that tremendous energy distribution induce huge curved space-time network, may have space time condensation in high-energy nodes. For example, in the black hole circumstances, quantum energy distribution is related to the area, thus the eigenvalues of the link operator of the nodes can be related to quantum number of area, and the eigenvectors are just the spin network states. This reveals that the degree distribution of nodes for space-time network is quantized, which can form the space-time network condensation. The black hole is a sort of result of space-time network condensation, however there may be more extensive space-time network condensation, for example, the universe singularity (big bang).

Bi Qiao

2008-09-29T23:59:59.000Z

246

Datacenter-Scale Network Research on FPGAs Zhangxi Tan  

E-Print Network [OSTI]

Datacenter-Scale Network Research on FPGAs Zhangxi Tan Computer Science Division UC Berkeley, CA an FPGA-based datacenter network simulator to allow researchers to rapidly experiment with O(10, 000) node datacenter network architectures. We configure the FPGA hardware to implement abstract models of key dat

Asanoviæ, Krste

247

An FPGA-based Simulator for Datacenter Networks Zhangxi Tan  

E-Print Network [OSTI]

An FPGA-based Simulator for Datacenter Networks Zhangxi Tan Computer Science Division UC Berkeley an FPGA-based datacenter network simulator for researchers to rapidly experiment with O(10,000) node datacenter network architectures. Our simulation approach configures the FPGA hardware to implement abstract

Asanovic, Krste

248

Operations Research and the Captivating Study of Networks  

E-Print Network [OSTI]

with Applications to Critical Infrastructure Networks #12;What is Operations Research (OR)? Operations research of Common Physical Networks Network System Nodes Links Flows Transportation Intersections, Homes, Workplaces Computers, Satellites, Telephone Exchanges Fiber Optic Cables Radio Links Voice, Data, Video Energy Pumping

Nagurney, Anna

249

Operations Research and the Captivating Study of Networks  

E-Print Network [OSTI]

Infrastructure Networks #12;What is Operations Research (OR)? Operations research is a scientific approach of Common Physical Networks Network System Nodes Links Flows Transportation Intersections, Homes, Workplaces Computers, Satellites, Telephone Exchanges Fiber Optic Cables Radio Links Voice, Data, Video Energy Pumping

Nagurney, Anna

250

Dynamic Networks: Recent Results and Applications  

E-Print Network [OSTI]

for this Exploratory Seminar provided by: We thank the Radcliffe Institute for Advanced Study for its support: Unification of Evolutionary Variational Inequalities and Projected Dynamical Systems #12;Components of Common Physical Networks Network System Nodes Links Flows Transportation Intersections, Homes, Workplaces

Nagurney, Anna

251

Optimize Storage Placement in Sensor Networks  

E-Print Network [OSTI]

of limited storage, communication capacity, and battery power is ameliorated. Placing storage nodesOptimize Storage Placement in Sensor Networks Bo Sheng, Member, IEEE, Qun Li, Member, IEEE, and Weizhen Mao Abstract--Data storage has become an important issue in sensor networks as a large amount

Li, Qun

252

Energy efficient sensor network implementations  

SciTech Connect (OSTI)

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.

Frigo, Janette R [Los Alamos National Laboratory; Raby, Eric Y [Los Alamos National Laboratory; Brennan, Sean M [Los Alamos National Laboratory; Kulathumani, Vinod [WEST VIRGINIA UNIV.; Rosten, Ed [CAMBRIDGE UNIV.; Wolinski, Christophe [IRISA; Wagner, Charles [IRISA; Charot, Francois [IRISA

2009-01-01T23:59:59.000Z

253

Truthful resource management in wireless ad hoc networks  

E-Print Network [OSTI]

the truthful resource management that induces network nodes to reveal true information and stimulate cooperation. We propose the Transmission Power Recursive Auction Mechanism routing pro- tocol (TEAM) and the Truthful Topology Control mechanism (TRUECON...

Cai, Jianfeng

2005-11-01T23:59:59.000Z

254

Challenges and Solutions for Intrusion Detection in Wireless Mesh Networks  

E-Print Network [OSTI]

The problem of intrusion detection in wireless mesh networks (WMN) is challenging, primarily because of lack of single vantage points where traffic can be analyzed and the limited resources available to participating nodes. Although the problem has...

Hassanzadeh, Amin

2014-05-03T23:59:59.000Z

255

The flux measure of influence in engineering networks  

E-Print Network [OSTI]

The objective of this project is to characterize the influence of individual nodes in complex networks. The flux metric developed here achieves this goal by considering the difference between the weighted outdegree and ...

Schwing, Kyle Michael

2009-01-01T23:59:59.000Z

256

IEEE/ACM TRANS. ON NETWORKING, TO APPEAR 1 Utility Optimal Scheduling in Energy Harvesting  

E-Print Network [OSTI]

IEEE/ACM TRANS. ON NETWORKING, TO APPEAR 1 Utility Optimal Scheduling in Energy Harvesting Networks performance in energy harvesting networks with only finite capacity energy storage devices. In these networks, nodes are capable of harvesting energy from the environment. The amount of energy that can be harvested

Huang, Longbo

257

Fixed-Node Diffusion Monte Carlo of Lithium Systems  

E-Print Network [OSTI]

We study lithium systems over a range of number of atoms, e.g., atomic anion, dimer, metallic cluster, and body-centered cubic crystal by the diffusion Monte Carlo method. The calculations include both core and valence electrons in order to avoid any possible impact by pseudo potentials. The focus of the study is the fixed-node errors, and for that purpose we test several orbital sets in order to provide the most accurate nodal hyper surfaces. We compare our results to other high accuracy calculations wherever available and to experimental results so as to quantify the the fixed-node errors. The results for these Li systems show that fixed-node quantum Monte Carlo achieves remarkably high accuracy total energies and recovers 97-99 % of the correlation energy.

Rasch, Kevin

2015-01-01T23:59:59.000Z

258

An Approximation Algorithm for Data Storage Placement in Sensor Networks Bo Sheng, Chiu C. Tan, Qun Li, and Weizhen Mao  

E-Print Network [OSTI]

.g., flash memory) and more battery power. In such a hybrid sensor network, these storage nodes collect nodes, the concerns of limited storage, communication capacity, and battery power are amelioratedAn Approximation Algorithm for Data Storage Placement in Sensor Networks Bo Sheng, Chiu C. Tan, Qun

Mao, Weizhen

259

Design and development of Stirling engines for stationary-power-generation applications in the 500- to 3000-hp range. Phase I final report  

SciTech Connect (OSTI)

The first phase of the design and development of Stirling engines for stationary power generation applications in the 373 kW (500 hp) to 2237 kW (3000 hp) range was completed. The tasks in Phase I include conceptual designs of large Stirling cycle stationary engines and program plan for implementing Phases II through V. Four different heater head designs and five different machine designs were prepared in sufficient detail to select a design recommended for development in the near future. A second order analysis was developed for examining the various loss mechanisms in the Stirling engine and for predicting the thermodynamic performance of these engines. The predicted engine thermal brake efficiency excluding combustion efficiency is approximately 42% which exceeds the design objective of 40%. The combustion system designs were prepared for both a clean fuel combustion system and a two-stage atmospheric fluidized bed combustion system. The calculated combustion efficiency of the former is 90% and of the latter is 80%. Heat transport systems, i.e., a heat exchanger for the clean fuel combustion system and a sodium heat pipe system for coal and other nonclean fuel combustion systems were selected. The cost analysis showed that for clean fuels combustion the proposed 2237 kW (3000 hp) system production cost is $478,242 or $214/kW ($159/hp) which is approximately 1.86 times the cost of a comparable size diesel engine. For solid coal combustion the proposed 2237 kW (3000 hp) system production cost is approximately $2,246,242 which corresponds to a cost to power capacity ratio of $1004/kW ($749/hp). The two-stage atmospheric fluidized bed combustion system represents 81% of the total cost; the engine represents 14% depending on the future price differential between coal and conventional clean fuels, a short payback period of the proposed Stirling cycle engine/FBC system may justify the initial cost. (LCL)

None

1980-10-01T23:59:59.000Z

260

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

DOE Patents [OSTI]

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.

Faraj, Ahmad

2013-02-12T23:59:59.000Z

Note: This page contains sample records for the topic "hp network node" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


261

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

DOE Patents [OSTI]

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.

Faraj, Ahmad

2013-07-09T23:59:59.000Z

262

Microfluidic ultrasonic particle separators with engineered node locations and geometries  

DOE Patents [OSTI]

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.

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-20T23:59:59.000Z

263

Topology Design of Network-Coding-Based Multicast Networks  

E-Print Network [OSTI]

multicast transmissions can significantly reduce the overall topology cost as compared to conventional multicast applications will emerge in the near future. As many multicast services require the transmission communication [1]. In existing networks, each node either forwards packets directly (in unicast transmissions

Guo, Minyi

264

Energy efficiency in wireless networks  

E-Print Network [OSTI]

technique is to use power saving mode, which allows a node to power off its wireless network interface (or enter a doze state) to reduce energy consumption. The other is to use a technique that suitably varies transmission power to reduce energy consumption...

Jung, Eun-Sun

2005-11-01T23:59:59.000Z

265

First search for double beta decay of platinum by ultra-low background HP Ge gamma spectrometry  

E-Print Network [OSTI]

A search for double beta processes in 190Pt and 198Pt was realized with the help of ultra-low background HP Ge 468 cm^3 gamma spectrometer in the underground Gran Sasso National Laboratories of the INFN (Italy). After 1815 h of data taking with 42.5 g platinum sample, T_{1/2} limits on 2beta processes in 190Pt (\\epsilon\\beta^+ and 2\\epsilon) have been established on the level of 10^{14}-10^{16} yr, 3 to 4 orders of magnitude higher than those known previously. In particular, a possible resonant double electron capture in 190Pt was restricted on the level of 2.9 \\times 10^{16} yr at 90% C.L. In addition, T_{1/2} limit on 2 beta^- decay of 198Pt (2\

P. Belli; R. Bernabei; F. Cappella; R. Cerulli; F. A. Danevich; A. Di Marco; A. Incicchitti; M. Laubenstein; S. S. Nagorny; S. Nisi; O. G. Polischuk; V. I. Tretyak

2011-04-29T23:59:59.000Z

266

First search for double beta decay of platinum by ultra-low background HP Ge gamma spectrometry  

E-Print Network [OSTI]

A search for double beta processes in 190Pt and 198Pt was realized with the help of ultra-low background HP Ge 468 cm^3 gamma spectrometer in the underground Gran Sasso National Laboratories of the INFN (Italy). After 1815 h of data taking with 42.5 g platinum sample, T_{1/2} limits on 2beta processes in 190Pt (\\epsilon\\beta^+ and 2\\epsilon) have been established on the level of 10^{14}-10^{16} yr, 3 to 4 orders of magnitude higher than those known previously. In particular, a possible resonant double electron capture in 190Pt was restricted on the level of 2.9 \\times 10^{16} yr at 90% C.L. In addition, T_{1/2} limit on 2 beta^- decay of 198Pt (2\

Belli, P; Cappella, F; Cerulli, R; Danevich, F A; Di Marco, A; Incicchitti, A; Laubenstein, M; Nagorny, S S; Nisi, S; Polischuk, O G; Tretyak, V I

2011-01-01T23:59:59.000Z

267

Subgraphs and network motifs in geometric networks Shalev Itzkovitz and Uri Alon  

E-Print Network [OSTI]

such as transportation and communication networks, as well as systems constrained in abstract spaces such as multivariate be correlated with closeness in this attribute space 28,29 . Geometric networks can also arise from analysis interactions decay with the distance between nodes. Examples include systems constrained in real space

268

Network support for system initiated checkpoints  

DOE Patents [OSTI]

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.

Chen, Dong; Heidelberger, Philip

2013-01-29T23:59:59.000Z

269

Energy Management in Wireless Sensor Network Operations  

E-Print Network [OSTI]

) . . . . . . . . . . . . . . . . . . . . . . . . . . . . 59 9 Comparison of long-run average costs of policies in 4-node line network (ct = 1 and T = 1) . . . . . . . . . . . . . . . . . . . . . . . 61 10 Fluid- ow model of an energy harvesting sensor . . . . . . . . . . . . 66 11 Sample path of X(t...) under threshold-based node activation policy . . 69 12 Sample path of X(t) in an exponential on-o environment . . . . . . 76 13 Limiting availability for di erent values of threshold (L) . . . . . . . 78 14 Energy ow model of an energy harvesting...

Mohapatra, Arupa Kumar

2013-07-26T23:59:59.000Z

270

Beyond Pure Axioms: Node Creating Rules in Hybrid Tableaux  

E-Print Network [OSTI]

University of Amsterdam Amsterdam, The Netherlands Abstract We present a method of extending the tableau ), such that the valuation V assigns singleton subsets of W to nominals; such valuations are sometimes called hybrid valuations. Apart from this restriction, everything is standard: W is a non-empty set of nodes, and for all

ten Cate, Balder

271

Lifetime Prediction for Supercapacitor-powered Wireless Sensor Nodes  

E-Print Network [OSTI]

Lifetime Prediction for Supercapacitor-powered Wireless Sensor Nodes Christian Renner, J step towards reaching this goal: It explores discharging-characteristics of supercapacitors, discusses-ion polymers, supercapacitors can last for 10 years or even more. Superca- pacitors do not need a complex

Turau, Volker

272

Applying Quadrature Rules with Multiple Nodes to Solving Integral Equations  

SciTech Connect (OSTI)

There are many procedures for the numerical solution of Fredholm integral equations. The main idea in these procedures is accuracy of the solution. In this paper, we use Gaussian quadrature with multiple nodes to improve the solution of these integral equations. The application of this method is illustrated via some examples, the related tables are given at the end.

Hashemiparast, S. M. [Department of Mathematics, Islamic Azad University Karaj Branch, K. N. Toosi University of Technology, Tehran (Iran, Islamic Republic of); Avazpour, L. [Department of Mathematics, K. N. Toosi University of Technology, P.O. Box 16315-1618 (Iran, Islamic Republic of)

2008-09-01T23:59:59.000Z

273

Prediction and Management in Energy Harvested Wireless Sensor Nodes  

E-Print Network [OSTI]

: tajana@ucsd.edu Abstract--Solar panels are frequently used in wireless sensor nodes because they can with rechargeable energy storage (e.g. batteries and super capacitors). Many different types of energy harvesting as energy storage units and a solar panel for energy harvesting. Shimmer evaluates the health of a large

Simunic, Tajana

274

AN ENERGY BENCHMARK FOR SOFTWARE UPDATES ON WIRELESS SENSOR NODES  

E-Print Network [OSTI]

AN ENERGY BENCHMARK FOR SOFTWARE UPDATES ON WIRELESS SENSOR NODES S. Brown*, C.J. Sreenan *Dept, Modelling, Energy, Benchmark. Abstract Energy consumption is arguably the key factor in the design not consume a significant fraction of a WSN's energy reserve; also, the required consumption must be known

Sreenan, Cormac J.

275

Implementing asyncronous collective operations in a multi-node processing system  

DOE Patents [OSTI]

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.

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

2014-07-08T23:59:59.000Z

276

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

DOE Patents [OSTI]

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.

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

2012-01-10T23:59:59.000Z

277

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

DOE Patents [OSTI]

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.

Archer, Charles J. (Rochester, MN); Blocksome, Michael A. (Rochester, MN); Peters, Amanda E. (Cambridge, MA); Ratterman, Joseph D. (Rochester, MN); Smith, Brian E. (Rochester, MN)

2012-04-17T23:59:59.000Z

278

STUDY OF THE RADIATION HARDNESS OF VCSEL AND PIN K.K. GAN, W. FERNANDO, H.P. KAGAN, R.D. KASS, A. LAW,  

E-Print Network [OSTI]

that the main radiation effect is bulk damage in the VCSEL and PIN with the displacement of atoms. After five and VCSEL arrays coupled to radiation-hard ASICs produced for the current pixel optical link [5], the DORIC1 STUDY OF THE RADIATION HARDNESS OF VCSEL AND PIN ARRAYS K.K. GAN, W. FERNANDO, H.P. KAGAN, R

Gan, K. K.

279

Using Satellite Ocean Color Data to Derive an Empirical Model for the Penetration Depth of Solar Radiation (Hp) in the Tropical Pacific Ocean  

E-Print Network [OSTI]

the climate through the penetration depth of solar radiation in the upper ocean (Hp), a primary parameter on penetrative solar radiation in the tropical Pacific, demonstrating the dynamical implication of remotely in which incident solar radiation is absorbed in the mixed layer and the verti- cal penetration down

Chen, .Dake

280

Long Proteins with Unique Optimal Foldings in the H-P Model Oswin Aichholzer David Bremner y Erik D. Demaine z Henk Meijer x  

E-Print Network [OSTI]

results about bonds in the H-P model. 1 Introduction Protein folding is a central problem such as drug de- sign. One of the most popular models of protein folding is the hydrophilic-hydrophobic (H of protein folding such as the tendency for the hydrophobic components to fold to the center of a globular

Note: This page contains sample records for the topic "hp network node" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


281

Coverage and Connectivity Aware Neural Network Based Energy Efficient Routing in Wireless Sensor Networks  

E-Print Network [OSTI]

There are many challenges when designing and deploying wireless sensor networks (WSNs). One of the key challenges is how to make full use of the limited energy to prolong the lifetime of the network, because energy is a valuable resource in WSNs. The status of energy consumption should be continuously monitored after network deployment. In this paper, we propose coverage and connectivity aware neural network based energy efficient routing in WSN with the objective of maximizing the network lifetime. In the proposed scheme, the problem is formulated as linear programming (LP) with coverage and connectivity aware constraints. Cluster head selection is proposed using adaptive learning in neural networks followed by coverage and connectivity aware routing with data transmission. The proposed scheme is compared with existing schemes with respect to the parameters such as number of alive nodes, packet delivery fraction, and node residual energy. The simulation results show that the proposed scheme can be used in wi...

,; Kumar, Manoj; Patel, R B; 10.5121/jgraphhoc.2010.2105

2010-01-01T23:59:59.000Z

282

Network Management Network Management  

E-Print Network [OSTI]

that pertain to the operation, administration, maintenance, and provisioning of networked systems Operation deals with keeping the network up (and the service provided by the network) Administration involvesNetwork Management Pag. 1 Network Management Andrea Bianco Telecommunication Network Group Network

283

Complex network synchronization of chaotic systems with delay coupling  

SciTech Connect (OSTI)

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 Lure system form. In particular, delayed coupling has been assumed along with identical sector bounded nonlinear systems which are interconnected over network topology.

Theesar, S. Jeeva Sathya, E-mail: sjstheesar@gmail.com; Ratnavelu, K., E-mail: sjstheesar@gmail.com [Network Science Research Group, Institute of Mathematical Sciences, University of Malaya, 50603, Kuala Lumpur (Malaysia)

2014-03-05T23:59:59.000Z

284

The Cost of Attack in Competing Networks  

E-Print Network [OSTI]

Real-world attacks can be interpreted as the result of competitive interactions between networks, ranging from predator-prey networks to networks of countries under economic sanctions. Although the purpose of an attack is to damage a target network, it also curtails the ability of the attacker, which must choose the duration and magnitude of an attack to avoid negative impacts on its own functioning. Nevertheless, despite the large number of studies on interconnected networks, the consequences of initiating an attack have never been studied. Here, we address this issue by introducing a model of network competition where a resilient network is willing to partially weaken its own resilience in order to more severely damage a less resilient competitor. The attacking network can take over the competitor nodes after their long inactivity. However, due to a feedback mechanism the takeovers weaken the resilience of the attacking network. We define a conservation law that relates the feedback mechanism to the resilie...

Podobnik, B; Lipic, T; Perc, M; Buldu, J M; Stanley, H E

2015-01-01T23:59:59.000Z

285

Engineering Weyl nodes in Dirac semimetals by a magnetic field  

E-Print Network [OSTI]

We study the phase diagram of a Dirac semimetal in a magnetic field at a nonzero charge density. It is shown that there exists a critical value of the chemical potential at which a first-order phase transition takes place. At subcritical values of the chemical potential the ground state is a gapped state with a dynamically generated Dirac mass and a broken chiral symmetry. The supercritical phase is the normal (gapless) phase with a nontrivial chiral structure: it is a Weyl semimetal with a pair of Weyl nodes for each of the original Dirac points. The nodes are separated by a dynamically induced chiral shift. The direction of the chiral shift coincides with that of the magnetic field and its magnitude is determined by the quasiparticle charge density, the strength of the magnetic field, and the strength of the interaction. The rearrangement of the Fermi surface accompanying this phase transition is described.

E. V. Gorbar; V. A. Miransky; I. A. Shovkovy

2013-10-07T23:59:59.000Z

286

Flow Distances on Open Flow Networks  

E-Print Network [OSTI]

Open flow network is a weighted directed graph with a source and a sink, depicting flux distributions on networks in the steady state of an open flow system. Energetic food webs, economic input-output networks, and international trade networks, are open flow network models of energy flows between species, money or value flows between industrial sectors, and goods flows between countries, respectively. Flow distances (first-passage or total) between any given two nodes $i$ and $j$ are defined as the average number of transition steps of a random walker along the network from $i$ to $j$ under some conditions. They apparently deviate from the conventional random walk distance on a closed directed graph because they consider the openness of the flow network. Flow distances are explicitly expressed by underlying Markov matrix of a flow system in this paper. With this novel theoretical conception, we can visualize open flow networks, calculating centrality of each node, and clustering nodes into groups. We apply fl...

Guo, Liangzhu; Shi, Peiteng; Wang, Jun; Huang, Xiaohan; Zhang, Jiang

2015-01-01T23:59:59.000Z

287

Efficiency of attack strategies on complex model and real-world networks  

E-Print Network [OSTI]

We investigated the efficiency of attack strategies to network nodes when targeting several complex model and real-world networks. We tested 5 attack strategies, 3 of which were introduced in this work for the first time, to attack 3 model (Erdos and Renyi, Barabasi and Albert preferential attachment network, and scale-free network configuration models) and 3 real networks (Gnutella peer-to-peer network, email network of the University of Rovira i Virgili, and immunoglobulin interaction network). Nodes were removed sequentially according to the importance criterion defined by the attack strategy. We used the size of the largest connected component (LCC) as a measure of network damage. We found that the efficiency of attack strategies (fraction of nodes to be deleted for a given reduction of LCC size) depends on the topology of the network, although attacks based on the number of connections of a node and betweenness centrality were often the most efficient strategies. Sequential deletion of nodes in decreasin...

Bellingeri, Michele; Vincenzi, Simone

2013-01-01T23:59:59.000Z

288

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

DOE Patents [OSTI]

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.

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

2011-10-18T23:59:59.000Z

289

Data Gathering in Networks of Bacteria Colonies: Collective Sensing and Relaying Using Molecular Communication  

E-Print Network [OSTI]

The prospect of new biological and industrial applications that require communication in micro-scale, encourages research on the design of bio-compatible communication networks using networking primitives already available in nature. One of the most promising candidates for constructing such networks is to adapt and engineer specific types of bacteria that are capable of sensing, actuation, and above all, communication with each other. In this paper, we describe a new architecture for networks of bacteria to form a data collecting network, as in traditional sensor networks. The key to this architecture is the fact that the node in the network itself is a bacterial colony; as an individual bacterium (biological agent) is a tiny unreliable element with limited capabilities. We describe such a network under two different scenarios. We study the data gathering (sensing and multihop communication) scenario as in sensor networks followed by the consensus problem in a multi-node network. We will explain as to how th...

Einolghozati, Arash; Beirami, Ahmad; Fekri, Faramarz

2012-01-01T23:59:59.000Z

290

Energy Management for Time-Critical Energy Harvesting Wireless Sensor Networks  

E-Print Network [OSTI]

their power consumption. The objective is to maximize the minimum energy reserve over any node in the network algorithms yield significantly higher energy reserves than the approaches without speed and power control. 1 such as solar, wind or wa- ter flow, WSN nodes potentially have perpetual energy supply. However, given

Aydin, Hakan

291

ENERGY-EFFICIENT GEOGRAPHIC ROUTING IN ENVIRONMENTALLY POWERED WIRELESS SENSOR NETWORKS  

E-Print Network [OSTI]

, GEBRES maintains higher minimum residual energy on nodes and achieves better load balancing in terms of having a smaller standard deviation of residual energy among nodes. GEBRES exhibits a little degradationENERGY-EFFICIENT GEOGRAPHIC ROUTING IN ENVIRONMENTALLY POWERED WIRELESS SENSOR NETWORKS Kai Zeng

California at Davis, University of

292

Oblivious Routing for Sensor Network Costas Busch and Malik Magdon-Ismail and Jing Xi  

E-Print Network [OSTI]

.rpi.edu (Currently employed at Bank of America, New York) 413 #12;414 Costas Busch and Malik Magdon-Ismail and Jing operated with a battery that has limited energy capacity. To maximize the lifetime of the nodes, the time, the lifetime of a battery operated sensor network is prolonged, since the time that the first node runs out

Magdon-Ismail, Malik

293

DEAR: A DEVICE AND ENERGY AWARE ROUTING PROTOCOL FOR MOBILE AD HOC NETWORKS  

E-Print Network [OSTI]

1 DEAR: A DEVICE AND ENERGY AWARE ROUTING PROTOCOL FOR MOBILE AD HOC NETWORKS Arun Avudainayagam of functioning and available resources. In this paper, we propose a Device and Energy Aware Routing protocol-powered nodes and battery-powered nodes. We embed both the energy and the device awareness into the routing

Hou, Y. Thomas

294

Lightweight Detection and Classification for Wireless Sensor Networks in Realistic Environments  

E-Print Network [OSTI]

too complex for energy-and-cost-effective WSN nodes. This study explores how to design efficient sensing and classification al- gorithms that achieve reliable sensing performance on energy-and- cost network system. Moreover, a sen- sor node must be energy efficient. As a res

Batson, Alan

295

American Institute of Aeronautics and Astronautics Ad Hoc UAV Ground Network (AUGNet)  

E-Print Network [OSTI]

American Institute of Aeronautics and Astronautics 1 Ad Hoc UAV Ground Network (AUGNet) Timothy X network with radio nodes mounted at fixed sites, on ground vehicles, and in small (10kg) UAVs. The ad hoc which act as relays. We envision two scenarios for this type of network. In the first, the UAV acts

Brown, Timothy X.

296

A New MAC Scheme Supporting Voice/Data Traffic in Wireless Ad Hoc Networks  

E-Print Network [OSTI]

A New MAC Scheme Supporting Voice/Data Traffic in Wireless Ad Hoc Networks Ping Wang, Member, IEEE, Hai Jiang, Member, IEEE, and Weihua Zhuang, Fellow, IEEE Abstract--In wireless ad hoc networks information exchanges among the nodes. Index Terms--Wireless ad hoc networks, medium access control, fairness

Jiang, Hai

297

SEAD: secure efficient distance vector routing for mobile wireless ad hoc networks  

E-Print Network [OSTI]

SEAD: secure efficient distance vector routing for mobile wireless ad hoc networks Yih-Chun Hu a University, Houston, TX 77005, USA Abstract An ad hoc network is a collection of wireless computers (nodes stations or access points. Although many previous ad hoc network routing protocols have been based in part

Ramkumar, Mahalingam

298

DNS Name Service based on Secure Multicast DNS for IPv6 Mobile Ad Hoc Networks  

E-Print Network [OSTI]

DNS Name Service based on Secure Multicast DNS for IPv6 Mobile Ad Hoc Networks Jaehoon Jeong which can provide mobile nodes in IPv6 mobile ad hoc network with secure name-to-address resolution and service discovery. Because mobile ad hoc network has dynamic topology, the current DNS is inappropriate

Jeong, Jaehoon "Paul"

299

Studying the Feasibility of Energy Harvesting in a Mobile Sensor Network  

E-Print Network [OSTI]

of recharging themselves using energy available in the en- vironment using solar panels. We call these nodes for network maintenance. One of the very scarce resources for these types of networks is energy architecture and low power network design at different com- munication layers. These include (Figure 1): · Low

Sukhatme, Gaurav S.

300

A Scalable Model for Energy Load Balancing in Large-scale Sensor Networks  

E-Print Network [OSTI]

A Scalable Model for Energy Load Balancing in Large-scale Sensor Networks Seung Jun Baek we consider how one might achieve more balanced energy burdens across the network by spreading sinks change their locations to balance the energy burdens incurred accross the network nodes [1

de Veciana, Gustavo

Note: This page contains sample records for the topic "hp network node" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


301

The Effect of Neighbor Graph Connectivity on Coverage Redundancy in Wireless Sensor Networks  

E-Print Network [OSTI]

that the network field is covered by these nodes at the desired ratio while the usage of the energy by the sensorThe Effect of Neighbor Graph Connectivity on Coverage Redundancy in Wireless Sensor Networks problems in wireless sensor networks. To reduce the energy consumption that arises when the high number

Varela, Carlos

302

Application of Network Calculus to General Topologies using TurnProhibition  

E-Print Network [OSTI]

for breaking cycles, such as the spanning tree and up/down routing algorithms, in terms of network utilization calculus framework applies also to statistical services [4], [13]. In particular, the minimum envelop rate stochastic bounds at each node of a network. A central problem shared by all network calculi is of deter

Karpovsky, Mark

303

A Hardware Platform for Network Intrusion Detection and Prevention Chris Clark1  

E-Print Network [OSTI]

A Hardware Platform for Network Intrusion Detection and Prevention Chris Clark1 , Wenke Lee2, athomas}@cc.gatech.edu Abstract The current generation of centralized network intrusion detection systems that intrusion detection analysis should be distributed to network node IDS (NNIDS) running in hardware

Lee, Wenke

304

Communities in Networks Mason A. Porter, Jukka-Pekka Onnela, and Peter J. Mucha  

E-Print Network [OSTI]

take a collection of interacting agents, such as the nodes of a network, with some set of micro- scopicCommunities in Networks Mason A. Porter, Jukka-Pekka Onnela, and Peter J. Mucha Introduction: Networks and Communities "But although, as a matter of history, statistical mechanics owes its origin

McIntosh, Ian

305

Synchronous Ultra-Wide Band Wireless Sensors Networks for oil and gas exploration  

E-Print Network [OSTI]

Synchronous Ultra-Wide Band Wireless Sensors Networks for oil and gas exploration Stefano Savazzi1 of new oil and gas reservoir. Seismic exploration requires a large number (500 ÷ 2000 nodes, MAC and network layer to develop wireless sensors networks tailored for oil (and gas) exploration

Savazzi, Stefano

306

Security Schemes for Wireless Sensor Networks with Mobile Sink  

E-Print Network [OSTI]

........................ 35 10 Wireless sensor network with mobile sinks and sensor nodes using two separate key pools for key pre-distribution ......................................... 39 11 (a) Direct key discovery, (b) Indirect key discovery through interrmedi... Protocol parameter values .......................................................................... 108 1 CHAPTER I INTRODUCTION Mobility is exploited in the field of wireless sensor network [1], [2], [3], [4] to circum- vent multi...

Rasheed, Amar Adnan

2011-08-08T23:59:59.000Z

307

Energy Efficient Broadcast Routing in Static Ad Hoc Wireless Networks  

E-Print Network [OSTI]

such that the energy cost of the broadcast tree is minimized. Each node in the network is assumed to have a fixed level a broadcast tree such that the energy cost of the broadcast tree is minimized. We first prove that the problemEnergy Efficient Broadcast Routing in Static Ad Hoc Wireless Networks Deying Li, Xiaohua Jia

Jia, Xiaohua

308

Power Management for Wireless Sensor Networks Based on Energy Budgets  

E-Print Network [OSTI]

Power Management for Wireless Sensor Networks Based on Energy Budgets Christian Renner Institute with wireless sensor networks powered by energy-harvesting supplies. We introduce the concept of an energy budget, the amount of energy available to a sensor node for a given period of time. The presented tools

Turau, Volker

309

Residual Energy-Aware Cooperative Transmission (REACT) in Wireless Networks  

E-Print Network [OSTI]

Residual Energy-Aware Cooperative Transmission (REACT) in Wireless Networks Erwu Liu, Qinqing Zhang the lifetime of the network and we call the selection method a residual energy-aware cooperative transmission- works, where energy efficiency is a critical design consideration. We assume that multiple relay nodes

Leung, Kin K.

310

How Many Down? Toward Understanding Systematic Risk in Networks  

E-Print Network [OSTI]

Security, Economics, Measurement, Management, Theory Keywords Networks, Security, Topology, Cyber the literature on interdependent security games. Our main area of focus is on the number of nodes that go down illustration how the outcome distribution of such networks exhibits correlation effects that increase

Bencsáth, Boldizsár

311

Query Processing in Mobile Sensor Networks Wang-Chien Lee  

E-Print Network [OSTI]

, a sensor network for air pollution test, where all sensors are scattered in the air and transported to collect the data from the sensors about air pollution and traffic conditions. In comparison, vehicles, animals, air, and water). With self-propelling sensor nodes, a mobile sensor network is self

Giles, C. Lee

312

Mobile Sensor Network Data Management Demetrios Zeinalipour-Yazti  

E-Print Network [OSTI]

, storage, data modeling, data warehousing, data movement and data mining. HISTORICAL BACKGROUND manufacturing. The transfer of information in such networks is conducted without electrical conductors (i-network aggregation and filtering in order to reduce the energy consumption while conveying data to the querying node

Zeinalipour, Demetris

313

Phantom cascades: The effect of hidden nodes on information diffusion  

E-Print Network [OSTI]

Research on information diffusion generally assumes complete knowledge of the underlying network. However, in the presence of factors such as increasing privacy awareness, restrictions on application programming interfaces (APIs) and sampling strategies, this assumption rarely holds in the real world which in turn leads to an underestimation of the size of information cascades. In this work we study the effect of hidden network structure on information diffusion processes. We characterise information cascades through activation paths traversing visible and hidden parts of the network. We quantify diffusion estimation error while varying the amount of hidden structure in five empirical and synthetic network datasets and demonstrate the effect of topological properties on this error. Finally, we suggest practical recommendations for practitioners and propose a model to predict the cascade size with minimal information regarding the underlying network.

Belk, Vclav; Sala, Alessandra; Morrison, Donn

2015-01-01T23:59:59.000Z

314

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

DOE Patents [OSTI]

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.

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

2012-06-05T23:59:59.000Z

315

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

DOE Patents [OSTI]

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.

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

2013-09-17T23:59:59.000Z

316

Energy Consumption in Wireless Sensor Networks is a fundamental issue in terms of functionality and network lifetime. Minimization  

E-Print Network [OSTI]

ABSTRACT Energy Consumption in Wireless Sensor Networks is a fundamental issue in terms of functionality and network lifetime. Minimization of energy consumption by applying optimization techniques setup. Application driven profiling of energy consumption at the node level is a useful tool for optimal

Vouyioukas, Demosthenes

317

HP Laboratories 2/8/97 Hiro:Documents:Giordano Beretta:Research:EI 97:3018-26:wwwOHP Slide 1  

E-Print Network [OSTI]

HP Laboratories 2/8/97 Hiro:Documents:Giordano Beretta:Research:EI 97:3018-26:wwwOHP Slide 1:Documents:Giordano Beretta:Research:EI 97:3018-26:wwwOHP Slide 2 2 w w w 1990: Print-on-demand (POD) Color POD: workflow:Documents:Giordano Beretta:Research:EI 97:3018-26:wwwOHP Slide 3 3 w w w World Wide Web is the hot new publication medium

Beretta, Giordano

318

Scalable Coordination for Wireless Sensor Networks: Self-Configuring Localization Systems  

E-Print Network [OSTI]

networks: tuning density to trade operational quality against lifetime; using multi- ple sensor modalities, water, soil, chemistry); condition based maintenance; smart spaces; military surveillance; preci- sion or urban locations). The above requirements impose substantial physical constraints at both the node

Heidemann, John

319

Scalable fault management architecture for dynamic optical networks : an information-theoretic approach  

E-Print Network [OSTI]

All-optical switching, in place of electronic switching, of high data-rate lightpaths at intermediate nodes is one of the key enabling technologies for economically scalable future data networks. This replacement of ...

Wen, Yonggang

2008-01-01T23:59:59.000Z

320

E-Print Network 3.0 - ajith abraham mario Sample Search Results  

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

mario Page: << < 1 2 3 4 5 > >> 1 Security Scheme for Malicious Node Detection in Mobile Ad Hoc Networks Summary: , Dhaval Gada1 , Rajat Gogri1 , Zalak Dedhia1 , Sugata Sanyal2 ,...

Note: This page contains sample records for the topic "hp network node" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


321

E-Print Network 3.0 - ajith abraham katrin Sample Search Results  

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

katrin Page: << < 1 2 3 4 5 > >> 1 Security Scheme for Malicious Node Detection in Mobile Ad Hoc Networks Summary: , Dhaval Gada1 , Rajat Gogri1 , Zalak Dedhia1 , Sugata Sanyal2 ,...

322

Throughput Scaling in Random Wireless Networks: A Non-Hierarchical Multipath Routing Strategy  

E-Print Network [OSTI]

an extended (i.e., geographically expanding) net- work with approximately n randomly distributed nodes to remain bounded, even as the network expands. I. INTRODUCTION The problem of asymptotic scalability

Liu, Mingyan

323

CERIAS Tech Report 2007-04 SECURITY IN WIRELESS SENSOR NETWORKS -A LAYER BASED CLASSIFICATION  

E-Print Network [OSTI]

and communicational capabilities. Secondly, there is an additional risk of physical attacks such as node captureCERIAS Tech Report 2007-04 SECURITY IN WIRELESS SENSOR NETWORKS - A LAYER BASED CLASSIFICATION

Liblit, Ben

324

Place-Based Attributes Predict Community Membership in a Mobile Phone Communication Network  

E-Print Network [OSTI]

Social networks can be organized into communities of closely connected nodes, a property known as modularity. Because diseases, information, and behaviors spread faster within communities than between communities, understanding ...

Eagle, Nathan N.

325

E-Print Network 3.0 - added transportation capacity Sample Search...  

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

Transport Capacity and Spectral Efficiency of Large Wireless CDMA Ad Hoc Networks Yi Sun Department... As node density D , transport capacity converges to zero at rate O(1D)...

326

Energy Aware Self-Organizing Density Management in Wireless Sensor Networks  

E-Print Network [OSTI]

Energy consumption is the most important factor that determines sensor node lifetime. The optimization of wireless sensor network lifetime targets not only the reduction of energy consumption of a single sensor node but also the extension of the entire network lifetime. We propose a simple and adaptive energy-conserving topology management scheme, called SAND (Self-Organizing Active Node Density). SAND is fully decentralized and relies on a distributed probing approach and on the redundancy resolution of sensors for energy optimizations, while preserving the data forwarding and sensing capabilities of the network. We present the SAND's algorithm, its analysis of convergence, and simulation results. Simulation results show that, though slightly increasing path lengths from sensor to sink nodes, the proposed scheme improves significantly the network lifetime for different neighborhood densities degrees, while preserving both sensing and routing fidelity.

Merrer, Erwan Le; Kermarrec, Anne-Marie; Viana, Aline; Bertier, Marin

2008-01-01T23:59:59.000Z

327

Study of a Busbased DisruptionTolerant Network: Mobility Modeling and Impact on Routing  

E-Print Network [OSTI]

traces taken from UMass DieselNet, a DisruptionTolerant Network consisting of WiFi nodes attached for profit or commercial advantage and that copies bear this notice and the full citation on the first page

Zhang, Xiaolan "Ellen"

328

Study of a Bus-based Disruption-Tolerant Network: Mobility Modeling and Impact on Routing  

E-Print Network [OSTI]

UMass DieselNet, a Disruption-Tolerant Network consisting of WiFi nodes attached to buses. As buses advantage and that copies bear this notice and the full citation on the first page. To copy otherwise

Massachusetts at Amherst, University of

329

E-Print Network 3.0 - advanced studies torus Sample Search Results  

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

mention of future work in Section 6. 2 Torus Network Model In this study, the simulation model... focused the strong scaling study on a 16-million-node torus and then the 1-...

330

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

DOE Patents [OSTI]

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.

Blocksome, Michael A

2014-04-01T23:59:59.000Z

331

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

DOE Patents [OSTI]

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.

Blocksome, Michael A

2014-04-22T23:59:59.000Z

332

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

DOE Patents [OSTI]

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.

Faraj, Ahmad (Rochester, MN)

2012-04-17T23:59:59.000Z

333

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

DOE Patents [OSTI]

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.

Blocksome, Michael A

2013-07-02T23:59:59.000Z

334

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

DOE Patents [OSTI]

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.

Archer, Charles J. (Rochester, MN); Blocksome, Michael A. (Rochester, MN)

2010-09-28T23:59:59.000Z

335

Perturbation centrality: a novel centrality measure obtained by the general network dynamics tool, Turbine  

E-Print Network [OSTI]

Analysis of network dynamics became increasingly important to understand the mechanisms and consequences of changes in biological systems from macromolecules to cells and organisms. Currently available network dynamics tools are mostly tailored for specific tasks such as calculation of molecular or neural dynamics. Our Turbine software offers a generic framework enabling the simulation of any algorithmically definable dynamics of any network. Turbine is also optimized for handling very large networks in the range of millions of nodes and edges. Using a perturbation transmission model inspired by communicating vessels, here we introduce a novel centrality measure termed as perturbation centrality. Perturbation centrality is the reciprocal of the time needed to dissipate a starting perturbation in the network. Hubs and inter-modular nodes proved to be highly efficient in perturbation propagation. High perturbation centrality nodes of the Met-tRNA synthetase protein structure network were identified as amino aci...

Szalay, Kristof Z

2013-01-01T23:59:59.000Z

336

HP-CAT  

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

AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel),Feet) Year Jan Feb Mar Apr MayAtmospheric Optical Depth7-1D: Vegetation ProposedUsingFun with Big Sky9, 2010 The meeting was called1999Harvest84047&- MarchHOW

337

Wireless Networking Projects Ashok K. Agrawala  

E-Print Network [OSTI]

677err 4243correct 4920total Training set = SET2 Nuzzer #12;Energy Efficient Routing EER #12;Energy portion of node energy ­ Noise Error Rate Retransmission Energy Consumption S D b a c 5 2 3 2 2 1 · To reduce energy consumption, we need reduce the number of retransmissions. · In ad hoc networks, paths

Gruner, Daniel S.

338

A congestion control scheme for wireless sensor networks  

E-Print Network [OSTI]

- gestion. For wired networks like INTERNET, there are mixed links with di erent bandwidths. The node with the lowest bandwidth along a path from the source to the destination is called the bottleneck. Usually, congestion occurs in the bottleneck since..., packet loss cannot be used to detect con- gestion. In WSN, corruption and collision will cause packets to be dropped. Besides, node failure due to energy depletion could also result in packet loss. Combining information on packet loss and latency can...

Xiong, Yunli

2005-08-29T23:59:59.000Z

339

Protein folding on rugged energy landscapes: Conformational diffusion on fractal networks  

E-Print Network [OSTI]

We employ simulations of model proteins to study folding on rugged energy landscapes. We construct ``first-passage'' networks as the system transitions from unfolded to native states. The nodes and bonds in these networks correspond to basins and transitions between them in the energy landscape. We find power-laws between the folding time and number of nodes and bonds. We show that these scalings are determined by the fractal properties of first-passage networks. Reliable folding is possible in systems with rugged energy landscapes because first passage networks have small fractal dimension.

Gregg Lois; J. Blawzdziewicz; Corey S. O'Hern

2009-06-24T23:59:59.000Z

340

Routing algorithms for large scale wireless sensor networks  

E-Print Network [OSTI]

such as power, memory, and CPU processing capabilities. In this thesis, we assume an All to All communication mode in an N ? N grid sensor network. We explore routing algorithms which load balance the network without compromising the shortest paths constrain. We... failed nodes). In static network case, we derived mathematical formulae representing the maximum and minimum loads on a sensor grid, when specific routing strategies are employed. We show improvement in performance in load balancing of the grid by using...

Nittala Venkata, Lakshmana Prasanth

2005-02-17T23:59:59.000Z

Note: This page contains sample records for the topic "hp network node" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


341

A saddle-node bifurcation model of magnetic reconnection onset  

SciTech Connect (OSTI)

It was recently shown that magnetic reconnection exhibits bistability, where the Sweet-Parker (collisional) and Hall (collisionless) reconnection solutions are both attainable for the same set of system parameters. Here, a dynamical model based on saddle-node bifurcations is presented which reproduces the slow to fast transition. It is argued that the properties of the dynamical model are a result of the Hall effect and the dispersive physics associated with it. Evidence from resistive two-fluid and Hall magnetohydrodynamics simulations are presented that show that the time evolution agrees with the dynamical model, the outflow speed is correlated with the dispersive physics due to the Hall effect, and bistability persists in the absence of electron inertia.

Cassak, P. A. [Department of Physics, West Virginia University, Morgantown, West Virginia 26506 (United States); Shay, M. A. [Department of Physics and Astronomy, University of Delaware, Newark, Delaware 19716 (United States); Drake, J. F. [IREAP, University of Maryland, College Park, Maryland 20742 (United States)

2010-06-15T23:59:59.000Z

342

A MODIFIED BROADCAST STRATEGY FOR DISTRIBUTED SIGNAL ESTIMATION IN A WIRELESS SENSOR NETWORK WITH A TREE TOPOLOGY  

E-Print Network [OSTI]

WITH A TREE TOPOLOGY Joseph Szurley§ , Alexander Bertrand§ , Marc Moonen§ §KU Leuven-Dept. Electrical of the distributed adaptive node-specific estimation (DANSE) algorithm in a tree topology (T-DANSE). In this paper, we consider a network where there is at least one node with a large (vir- tually infinite) energy

343

Abstract--Securing multicast communications in Mobile Ad Hoc Networks (MANET) is considered among the most challenging  

E-Print Network [OSTI]

with the requirement to design secure KM schemes that achieve better performance than existing ones (either for wire-line difficulties in establishing a secure framework suitable for such services. The design of efficient key no nodes with special capabilities exist, b) produce considerably lower overhead for the network nodes

Baras, John S.

344

A Taxonomy of Routing Protocols in Sensor Networks Azzedine Boukerche, Mohammad Z. Ahmad, Begumhan Turgut, and Damla Turgut  

E-Print Network [OSTI]

model, the energy source of the sensor node is considered non-renewable (although some sensor nodes in ad hoc networks. The problem of energy resources is especially difficult. Due to their deployment and Engineering, University of Ottawa, Ottawa, Canada. M.Z. Ahmad and D. Turgut are wi

Turgut, Damla

345

Appointed BrOadcast (ABO): Reducing Routing Overhead in IEEE 802.11 Mobile Ad Hoc Networks  

E-Print Network [OSTI]

1 Appointed BrOadcast (ABO): Reducing Routing Overhead in IEEE 802.11 Mobile Ad Hoc Networks Chun-enhanced and standard IEEE 802.11 nodes can coexist in a MANET is also discussed. Keywords: mobile ad hoc network, promiscuous mode, broadcast, IEEE 802.11, routing. #12;2 1. Introduction In mobile ad hoc networks (MANETs

Chen, Sheng-Wei

346

Feedback Circuits in Evolving Networks: Micro-Macro Linkages for Biases in Attachment, Routing and Distance Decay  

E-Print Network [OSTI]

Feedback Circuits in Evolving Networks: Micro-Macro Linkages for Biases in Attachment, Routing the phe- nomenon of feedback creation at the micro-level leads to changes in network topology at the macro and analyses still to be completed, v3.03) Abstract. We investigate information networks whose nodes can emit

White, Douglas R.

347

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

DOE Patents [OSTI]

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.

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

2013-02-05T23:59:59.000Z

348

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

DOE Patents [OSTI]

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.

Archer, Charles J; Inglett, Todd A

2012-10-23T23:59:59.000Z

349

Nodal photolithography : lithography via far-field optical nodes in the resist  

E-Print Network [OSTI]

In this thesis, I investigate one approach - stimulated emission depletion - to surmounting the diffraction limitation of optical lithography. This approach uses farfield optical nodes to orchestrate reversible, saturable ...

Winston, Donald, S.M. Massachusetts Institute of Technology

2008-01-01T23:59:59.000Z

350

Hybrid function projective synchronization in complex dynamical networks  

SciTech Connect (OSTI)

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.

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-15T23:59:59.000Z

351

Modeling of a Busbased Disruption Tolerant Network Trace Xiaolan Zhang, Jim Kurose, Brian Levine, Don Towsley, Honggang Zhang  

E-Print Network [OSTI]

traces taken from UMass DieselNet, a Disruption­Tolerant Network consisting of WiFi nodes attached DTN, UMass DieselNet [6]. The model is generative in that it can be used to generate synthetic traces

Zhang, Xiaolan "Ellen"

352

Modeling of a Bus-based Disruption Tolerant Network Trace Xiaolan Zhang, Jim Kurose, Brian Levine, Don Towsley, Honggang Zhang  

E-Print Network [OSTI]

traces taken from UMass DieselNet, a Disruption-Tolerant Network consisting of WiFi nodes attached DTN, UMass DieselNet [6]. The model is generative in that it can be used to generate synthetic traces

Zhang, Xiaolan "Ellen"

353

A Near-Infrared Photometric Study of the Low Latitude Globular Clusters Liller 1, Djorgovski 1, HP 1, and NGC 6528  

E-Print Network [OSTI]

Images recorded through J, H, Ks, 2.2 micron continuum, and 2.3 micron CO filters are used to investigate the stellar contents of the low Galactic latitude globular clusters NGC 6528, Liller 1, Djorgovski 1, and HP 1, as well as surrounding bulge fields. Metallicities are estimated for the latter three clusters by comparing the colors and CO indices of giant branch stars with those in other clusters and the bulge, while reddenings are estimated from the colors of bright bulge stars in the surrounding fields. In some cases the metallicities and reddenings are significantly different from previous estimates.

T. J. Davidge

1999-09-23T23:59:59.000Z

354

Modularity of Directed Networks: Cycle Decomposition Approach  

E-Print Network [OSTI]

The problem of decomposing networks into modules (or clusters) has gained much attention in recent years, as it can account for a coarse-grained description of complex systems, often revealing functional subunits of these systems. A variety of module detection algorithms have been proposed, mostly oriented towards finding hard partitionings of undirected networks. Despite the increasing number of fuzzy clustering methods for directed networks, many of these approaches tend to neglect important directional information. In this paper, we present a novel random walk based approach for finding fuzzy partitions of directed, weighted networks, where edge directions play a crucial role in defining how well nodes in a module are interconnected. We will show that cycle decomposition of a random walk process connects the notion of network modules and information transport in a network, leading to a new, symmetric measure of node communication. walk process, for which we will prove that although being time-reversible it inherits all necessary information about directions and modular structure of the original network. Finally, we will use this measure to introduce a communication graph, for which we will show that although being undirected it inherits all necessary information about modular structures from the original network.

Natasa Djurdjevac Conrad; Ralf Banisch; Christof Schtte

2014-07-31T23:59:59.000Z

355

Network Chimera Network Chimera  

E-Print Network [OSTI]

Network Chimera Network Chimera Objective Chimera aims to understand how the network properties enough with limited resources. The Chimera team is cross-disciplinary, and includes computer scientists Impact The original hypothesis of Chimera was that a physical network could be reduced to a graph

356

Self-organized network design by link survivals and shortcuts  

E-Print Network [OSTI]

One of the challenges for future infrastructures is how to design a network with high efficiency and strong connectivity at low cost. We propose self-organized geographical networks beyond the vulnerable scale-free structure found in many real systems. The networks with spatially concentrated nodes emerge through link survival and path reinforcement on routing flows in a wireless environment with a constant transmission range of a node. In particular, we show that adding some shortcuts induces both the small-world effect and a significant improvement of the robustness to the same level as in the optimal bimodal networks. Such a simple universal mechanism will open prospective ways for several applications in wide-area ad hoc networks, smart grids, and urban planning.

Hayashi, Yukio

2011-01-01T23:59:59.000Z

357

Synthesizing Robust Networks for Engineering Applications with Resource Constraints  

E-Print Network [OSTI]

weights. . . . . . . . . . . . . . 51 2.3 Comparison of CPU time to solve MISDP formulation using Matlabs SDP solver (T1) with EA1 (T2) and EA2 (T3) solved using CPLEX solver for networks with 8 nodes. . . . . . . . . . . . . . . . . . . . . 63 2....4 Comparison of CPU time to directly solve the BSDPs in bisection procedure using Matlabs SDP solver (T1) with the proposed EA3 using CPLEX solver (T2) for networks with eight nodes. . . . . . . . . 69 2.5 Performance of EA1 with an improved relaxation...

Nagarajan, Harsha

2014-04-29T23:59:59.000Z

358

Optimal Sleep-Wake Policies for an Energy Harvesting Sensor Node  

E-Print Network [OSTI]

devices are solar cells, wind turbines and piezo-electric cells, which extract energy from the environmentOptimal Sleep-Wake Policies for an Energy Harvesting Sensor Node Vinay Joseph, Vinod Sharma with an energy harvesting source. In any slot, the sensor node is in one of two modes: Wake or Sleep

Sharma, Vinod

359

Short-Term Throughput Maximization for Battery Limited Energy Harvesting Nodes  

E-Print Network [OSTI]

for energy recharge. Under the assumption of an increasing concave power-rate relationship, the short completion time of a given amount of data were found for an energy harvesting node under the assumptionShort-Term Throughput Maximization for Battery Limited Energy Harvesting Nodes Kaya Tutuncuoglu

Yener, Aylin

360

Energy Modeling of Wireless Sensor Nodes Based on Petri Nets Ali Shareef, Yifeng Zhu  

E-Print Network [OSTI]

Energy Modeling of Wireless Sensor Nodes Based on Petri Nets Ali Shareef, Yifeng Zhu Department step for the design of energy saving strategies. This paper develops a detailed probabilistic model based on Petri nets to evaluate the energy consumption of a wireless sensor node. The model factors

Zhu, Yifeng

Note: This page contains sample records for the topic "hp network node" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


361

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

DOE Patents [OSTI]

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.

Archer, Charles J. (Rochester, MN); Blocksome, Michael A. (Rochester, MN); Ratterman, Joseph D. (Rochester, MN); Smith, Brian E. (Rochester, MN)

2010-11-02T23:59:59.000Z

362

Empirical Modelling and Simulation of Transmission Loss between Wireless Sensor Nodes  

E-Print Network [OSTI]

; channel model; gas turbine engine I. INTRODUCTION Testing of gas turbine engines currently demands the useEmpirical Modelling and Simulation of Transmission Loss between Wireless Sensor Nodes in Gas a grid of hypothetical WSN node locations on the surface of a gas turbine engine are reported for eight

Atkinson, Robert C

363

An Asynchronous Event-Driven Data Transmitter for Wireless ECG Sensor Nodes  

E-Print Network [OSTI]

An Asynchronous Event-Driven Data Transmitter for Wireless ECG Sensor Nodes Andre L. Mansano for wireless ECG sensors node. Unlike current solutions for ECG monitoring with autonomous wireless sensors, we propose an asynchronous method to transmit data from an ECG front-end, which is designed with a 2-bit

Serdijn, Wouter A.

364

The Future of Secondary Airports: Nodes of a parallel air transport network?  

E-Print Network [OSTI]

Professor, Engineering Systems Division et Department of Civil and Environmental Engineering Massachusetts, they will demand and obtain substantial independence. This hypothesis leads to two propositions. The first, the main thought is that the responsible leaders should coherently support the development

365

E-Print Network 3.0 - axillary nodes removed Sample Search Results  

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

; Biology and Medicine 2 Leaf Area Distribution of Tomato Plants as Influenced by Polyethylene Mulch Summary: . Plants grown in the white mulch treatment had significantly more...

366

On the Connectivity of 2-D Random Networks with Anisotropically Radiating Nodes  

E-Print Network [OSTI]

in many infrastructural and ad hoc applications. These include emerging energy and utility management sce that directive transmission can improve connectivity when the path loss exponent is low, and impair connectivity-mail: justin@toshiba-trel.com). He is also with the Department of Electrical and Electronic Engineering

Dettmann, Carl

367

E-Print Network 3.0 - alfven node-free vibrations Sample Search...  

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

?). ... Source: Fusiongnition Research Experiment (FIRE) Collection: Plasma Physics and Fusion 26 Alfven wave tomography for cold magnetohydrodynamic plasmas I. Y. Dodin and N....

368

E-Print Network 3.0 - axillary nodes examined Sample Search Results  

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

Accepted: 9 January 2009 Summary: AND METHODS We examined the Rathke's gland axillary orifices and distal portions of the ducts in 15 museum... , an axillary and an inguinal...

369

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

SciTech Connect (OSTI)

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.

Mechergui, J. [Chemistry Department, Bizerta Science Faculty, 7021 Jarzouna, Bizerta (Tunisia); Belam, W. [Chemistry Department, Bizerta Science Faculty, 7021 Jarzouna, Bizerta (Tunisia)], E-mail: WahidBelam@yahoo.fr

2008-12-01T23:59:59.000Z

370

REMAP: A computer code that transfers node information between dissimilar grids  

SciTech Connect (OSTI)

REMAP is a computer code that transfers the axisymmetric, two dimensional planar, or three dimensional temperature field from one finite element mesh to another. The meshes may be arbitrary as far as the number of elements and their geometry. REMAP interpolates or extrapolates the node temperatures from the old mesh to the new mesh using linear, bilinear, or trilinear isoparametric finite element shape functions. REMAP is used to transfer the temperature field from a thermal analysis mesh to a more finely discretized structural analysis mesh when performing a thermal stress analysis. REMAP was designed to be used with the finite element heat transfer codes TOPAZ2D and TOPAZ3D, and the solid mechanics codes NIKE2D and NIKE3D. The I/O formats in REMAP can be easily modified to accept input from other codes (e.g., finite difference) and generate output files for other structural codes. REMAP can be used to transfer any scalar field variable between dissimilar finite element meshes. The idea of a coarse filter by a fine filter to determine which element from the old mesh contains a node point from the new mesh was used. The coarse filter determines a subset of elements from the old mesh that may contain the new node point. The fine filter determines the element that contains the new node point. REMAP uses the ray-surface intersection algorithm developed for the FACET code for the fine filter. This algorithm has the added capability to determine which element the node is closest to if the node point lies outside the perimeter of the old mesh. Once an element from the old mesh has been identified as containing or closest to the new node point, the natural coordinates for the node point are calculated. The isoparametric finite element shape functions are calculated next. These shape functions are then used to interpolate or extrapolate the temperatures from the nodes comprising the old element to the new node point.

Shapiro, A.B.

1990-04-01T23:59:59.000Z

371

Predictable nonwandering localization of covariant Lyapunov vectors and cluster synchronization in scale-free networks of chaotic maps  

E-Print Network [OSTI]

Covariant Lyapunov vectors for scale-free networks of Henon maps are highly localized. We revealed two mechanisms of the localization related to full and phase cluster synchronization of network nodes. In both cases the localization nodes remain unaltered in course of the dynamics, i.e., the localization is nonwandering. Moreover this is predictable: the localization nodes are found to have specific dynamical and topological properties and they can be found without computing of the covariant vectors. This is an example of explicit relations between the system topology, its phase space dynamics, and the associated tangent space dynamics of covariant Lyapunov vectors.

Pavel V. Kuptsov; Anna V. Kuptsova

2014-06-22T23:59:59.000Z

372

A New Formula for Prostate Cancer Lymph Node Risk  

SciTech Connect (OSTI)

Introduction: The successful treatment of prostate cancer depends on the accurate estimation of the risk of regional lymph node (LN) involvement. The Roach formula (RF) has been criticized as overestimating LN risk. A modification of the RF has been attempted by other investigators using simplified adjustment ratios: the Nguyen formula (NF). Methods and Materials: The National Cancer Institute Surveillance, Epidemiology, and End Results database was investigated for patients treated in 2004 through 2006 for whom at least 10 LN were examined at radical prostatectomy, cT1c or cT2 disease, and prostate-specific antigen (PSA) <26 ng/ml (N = 2,930). The Yale formula (YF) was derived from half of the sample (n = 1,460), and validated in the other half (n = 1,470). Results: We identified 2,930 patients. Only 4.6% of patients had LN+, and 72.6% had cT1c disease. Gleason (GS) 8-10 histology was found in 14.4% of patients. The YF for prediction of %LN+ risk is [GS - 5]x [PSA/3 + 1.5 x T], where T = 0, 1, and 2 for cT1c, cT2a, and cT2b/cT2c. Within each strata of predicted %LN+ risk, the actual %LN+ was closest to the YF. Using a >15% risk as an indicator of high-risk disease, the YF had increased sensitivity (39.0% vs. 13.6%) compared with the NF, without a significant reduction in specificity (94.9% vs. 98.8%). The NF was overly restrictive of the high-risk group, with only 2% of patients having a >15% risk of LN+ by that formula. Conclusion: The YF performed better than the RF and NF and was best at differentiating patients at high risk for LN+ disease.

Yu, James B., E-mail: james.b.yu@yale.ed [Department of Therapeutic Radiology, Yale School of Medicine, New Haven, CT (United States); Yale Cancer Center, New Haven, CT (United States); Makarov, Danil V. [Robert Wood Johnson Clinical Scholars Program, Yale School of Medicine, New Haven, CT (United States); Section of Urology, Yale School of Medicine, New Haven, CT (United States); Department of Veterans Affairs Connecticut Healthcare System, West Haven, CT (United States); Gross, Cary [Robert Wood Johnson Clinical Scholars Program, Yale School of Medicine, New Haven, CT (United States); Department of Internal Medicine, Yale School of Medicine, New Haven, CT (United States)

2011-05-01T23:59:59.000Z

373

On Short Cycles and Their Role in Network Structure James Bagrow  

E-Print Network [OSTI]

one another are more likely to be linked through short cycles. By identifying combinations of 3-, 4On Short Cycles and Their Role in Network Structure James Bagrow Department of Physics Clarkson structure and short cycles in complex networks, based on the fact that nodes more densely connected amongst

Bollt, Erik

374

Adding STARFire Analysis Layers to Google Earth through a KML Network Link 1) Launch Google Earth  

E-Print Network [OSTI]

Adding STARFire Analysis Layers to Google Earth through a KML Network Link 1) Launch Google Earth 2) The network link will be added in the Places control within Google Earth. Select the node level in the tree layers for viewing within Google Earth. Double clicking on a layer will zoom you to the extent

375

Distributed Mobile Disk Cover A Building Block for Mobile Backbone Networks  

E-Print Network [OSTI]

1 Distributed Mobile Disk Cover ­ A Building Block for Mobile Backbone Networks Anand Srinivas, Gil of Mobile Backbone Networks has been recently studied by a few different approaches. An important subproblem a Geometric Disk Cover (GDC) under mobility. While from the context of static nodes and centralized solutions

Zussman, Gil

376

Throughput and Ergodic Capacity of Wireless Energy Harvesting Based DF Relaying Network  

E-Print Network [OSTI]

-to-point communication systems and studied rate-energy trade-off assuming single-input-single-output (SISO) [1], [3Throughput and Ergodic Capacity of Wireless Energy Harvesting Based DF Relaying Network Ali A-and-forward (DF) relaying network based on wireless energy harvesting. The energy constrained relay node first

Zhou, Xiangyun "Sean"

377

Optimization Algorithms for Information Retrieval and Transmission in Distributed Ad Hoc Networks  

E-Print Network [OSTI]

An ad hoc network is formed by a group of self-configuring nodes, typically deployed in two or three dimensional spaces, and communicating with each other through wireless or some other media. The distinct characteristics of ad hoc networks include...

Lu, Hong

2010-01-14T23:59:59.000Z

378

Lattice Sensor Networks: Capacity Limits, Optimal Routing and Robustness to Failures  

E-Print Network [OSTI]

Barrenechea Baltasar Beferull-Lozano Martin Vetterli Laboratory for Audio-Visual Communications (LCAV) Swiss networks, the unreliability of the network is modeled in two ways: a Markovian node fail- ure and an energy and Communication Systems (NCCR-MICS), a center supported by the Swiss National Science Foundation under grant

Beferull-Lozano, Baltasar

379

Trust and Exclusion in Vehicular Ad Hoc Networks: An Economic Incentive Model based Approach  

E-Print Network [OSTI]

Trust and Exclusion in Vehicular Ad Hoc Networks: An Economic Incentive Model based Approach Nadia, and lowers the overall data reception ratio in the network. To tackle this, we propose a new incentive model with exclusion for malicious nodes called VIME. VIME is inspired from the signaling theory from economics

Paris-Sud XI, Universit de

380

Energy-Efficient Reliable Routing Considering Residual Energy in Wireless Ad Hoc Networks  

E-Print Network [OSTI]

Energy-Efficient Reliable Routing Considering Residual Energy in Wireless Ad Hoc Networks Javad minimum energy routing (RMER). RMECR addresses three important requirements of ad hoc networks: energy-efficiency energy of nodes as well as quality of links to find energy-efficient and reliable routes that increase

Langendoen, Koen

Note: This page contains sample records for the topic "hp network node" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


381

Effects of Group Categories on the Structure of Online Social Networks  

E-Print Network [OSTI]

of friendship network, LCCS the LCC of subscription network, N the number of nodes, E the number of edges, D the diameter and R the radius. 18 Table 4.1: Pearson coefficients between group variables Category Mbrs- Vidoes Mbrs- Topics Mbrs- Notes Videos...

Stanley Laine, Michael Steve

2010-08-24T23:59:59.000Z

382

Adaptive Sensor Activity Scheduling in Distributed Sensor Networks: A Statistical Mechanics Approach  

E-Print Network [OSTI]

of spatial-temporal events. The sensor network is modeled as a Markov random field on a graph, where concepts and wireless communications have enabled usage of inexpensive and miniaturized sensor nodes [1­3] that can #12;Effective use of sensor networks requires resource-aware operation; once deployed, energy sources

Ray, Asok

383

Connected K-Coverage Problem in Sensor Networks Zongheng Zhou, Samir Das, Himanshu Gupta  

E-Print Network [OSTI]

energy usage in the network. Energy is spent due to message transmissions among sensor nodes, or due-- In overdeployed sensor networks, one approach to conserve energy is to keep only a small subset of sensors active" by at least K different sensors in M, and the communication graph induced by M is connected. For the above

Das, Samir R.

384

Connected K-Coverage Problem in Sensor Networks Zongheng Zhou, Samir Das, Himanshu Gupta  

E-Print Network [OSTI]

energy usage in the network. Energy is spent due to message transmissions among sensor nodes, or due-- In overdeployed sensor networks, one approach to conserve energy is to keep only a small subset of sensors active" by at least different sensors in ¡ , and the communication graph induced by ¡ is connected. For the above

Gupta, Himanshu

385

EPIC-RoofNet: An Experimental Testbed for Solar-powered Wireless Sensor Networks  

E-Print Network [OSTI]

EPIC-RoofNet: An Experimental Testbed for Solar-powered Wireless Sensor Networks Amitangshu Pal through a shared folder. Keywords: Wireless sensor networks, solar harvesting, adaptive protocols experiments on solar-powered sensor nodes. Due to constraints in cost and size, the solar panels

Nasipuri, Asis

386

EnergyEfficient Channel Access Scheduling For PowerConstrained Networks  

E-Print Network [OSTI]

the Distributed EnergyAware Node Activation (DEANA) channel access protocol for power constrained networks that the proposed ap proach can achieve significant energy savings (up to 95%). Keywords Powerconstrained networks,energyawarebased or schedulingbased) are not poweraware, i.e., they provide no explicit mechanisms to achieve energy efficiency

California at Santa Cruz, University of

387

EAGR: Energy Aware Greedy Routing Scheme for Wireless Ad hoc Networks Sachin Sharma  

E-Print Network [OSTI]

EAGR: Energy Aware Greedy Routing Scheme for Wireless Ad hoc Networks Sachin Sharma Tejas Networks Delhi, New Delhi, India (email: dharmar@maths.iitd.ac.in) Abstract This paper presents Energy Aware distributed nodes that communicate over a wireless link. In this paper we present a scalable, Energy Aware

Dharmaraja, S.

388

~O(Congestion + Dilation) Hot-Potato Routing on Leveled Networks Costas Busch  

E-Print Network [OSTI]

~O(Congestion + Dilation) Hot-Potato Routing on Leveled Networks Costas Busch Rensselaer that matches the lower bound (C + D). Motivated from optical networks, we study the extreme case of hot-potato routing in which the nodes are bufferless. In hot-potato routing, packets may be unable to follow

Busch, Konstantin "Costas"

389

Exploiting user interest similarity and social links for micro-blog forwarding in mobile opportunistic networks  

E-Print Network [OSTI]

to the mobility patterns of the nodes. Keywords: micro-blogging, social networks, pervasive, mobile, contentExploiting user interest similarity and social links for micro-blog forwarding in mobile opportunistic networks S.M. Allena , M.J. Chorleya , G.B. Colomboa , E. Jahob , M. Karaliopoulosb , I

Stavrakakis, Ioannis

390

Optimal Power Allocation in Wireless Networks with Transmitter-Receiver Power Tradeoffs  

E-Print Network [OSTI]

are more pronounced in networks with asymmetric power costs. 1 Introduction Wireless ad hoc networks have. Habitat monitoring [13], environmental observation and forecasting [1], organ monitoring and health mon has some on board memory for data storage. The deployed nodes not only originate data but can also act

Massachusetts at Amherst, University of

391

Topological changes at the jamming and gel transition of a reversible polymeric network  

E-Print Network [OSTI]

We investigate the network topologies of an ensemble of telechelic polymers. The telechelic polymers serve as links between nodes, which consist of aggregates of their telechelic endgroups. Our analysis shows that the degree distribution is bimodal and consists of two Poissonian distributions with different average degrees. The number of nodes in each of them as well as the distribution of links depends on temperature. By comparing the eigenvalue spectra of the simulated network gels with those of reconstructed networks, the most likely ttopology at each temperature is determined.

Joris Billen; Mark Wilson; Avinoam Rabinovitch; Arlette R. C. Baljon

2009-03-13T23:59:59.000Z

392

Performance improvement of an optical network providing services based on multicast  

E-Print Network [OSTI]

Operators of networks covering large areas are confronted with demands from some of their customers who are virtual service providers. These providers may call for the connectivity service which fulfils the specificity of their services, for instance a multicast transition with allocated bandwidth. On the other hand, network operators want to make profit by trading the connectivity service of requested quality to their customers and to limit their infrastructure investments (or do not invest anything at all). We focus on circuit switching optical networks and work on repetitive multicast demands whose source and destinations are {\\em \\`a priori} known by an operator. He may therefore have corresponding trees "ready to be allocated" and adapt his network infrastructure according to these recurrent transmissions. This adjustment consists in setting available branching routers in the selected nodes of a predefined tree. The branching nodes are opto-electronic nodes which are able to duplicate data and retransmit...

Reinhard, Vincent; Tomasik, Joanna; Barth, Dominique; Weisser, Marc-Antoine

2011-01-01T23:59:59.000Z

393

A Gaussian graphical model approach to climate networks  

SciTech Connect (OSTI)

Distinguishing between direct and indirect connections is essential when interpreting network structures in terms of dynamical interactions and stability. When constructing networks from climate data the nodes are usually defined on a spatial grid. The edges are usually derived from a bivariate dependency measure, such as Pearson correlation coefficients or mutual information. Thus, the edges indistinguishably represent direct and indirect dependencies. Interpreting climate data fields as realizations of Gaussian Random Fields (GRFs), we have constructed networks according to the Gaussian Graphical Model (GGM) approach. In contrast to the widely used method, the edges of GGM networks are based on partial correlations denoting direct dependencies. Furthermore, GRFs can be represented not only on points in space, but also by expansion coefficients of orthogonal basis functions, such as spherical harmonics. This leads to a modified definition of network nodes and edges in spectral space, which is motivated from an atmospheric dynamics perspective. We construct and analyze networks from climate data in grid point space as well as in spectral space, and derive the edges from both Pearson and partial correlations. Network characteristics, such as mean degree, average shortest path length, and clustering coefficient, reveal that the networks posses an ordered and strongly locally interconnected structure rather than small-world properties. Despite this, the network structures differ strongly depending on the construction method. Straightforward approaches to infer networks from climate data while not regarding any physical processes may contain too strong simplifications to describe the dynamics of the climate system appropriately.

Zerenner, Tanja, E-mail: tanjaz@uni-bonn.de [Meteorological Institute, University of Bonn, Auf dem Hgel 20, 53121 Bonn (Germany)] [Meteorological Institute, University of Bonn, Auf dem Hgel 20, 53121 Bonn (Germany); Friederichs, Petra; Hense, Andreas [Meteorological Institute, University of Bonn, Auf dem Hgel 20, 53121 Bonn (Germany) [Meteorological Institute, University of Bonn, Auf dem Hgel 20, 53121 Bonn (Germany); Interdisciplinary Center for Complex Systems, University of Bonn, Brhler Strae 7, 53119 Bonn (Germany); Lehnertz, Klaus [Department of Epileptology, University of Bonn, Sigmund-Freud-Strae 25, 53105 Bonn (Germany) [Department of Epileptology, University of Bonn, Sigmund-Freud-Strae 25, 53105 Bonn (Germany); Helmholtz Institute for Radiation and Nuclear Physics, University of Bonn, Nussallee 14-16, 53115 Bonn (Germany); Interdisciplinary Center for Complex Systems, University of Bonn, Brhler Strae 7, 53119 Bonn (Germany)

2014-06-15T23:59:59.000Z

394

Nuclear fuel scoping: implementation of a four node per assembly algorithm as the neutronic module for microscope  

E-Print Network [OSTI]

, . APPENDIX B INPUT FOR TEST CASES . SAMPLE INPUT FOR ONE NODE PER ASSEMBLY. . . . SAMPLE INPUT FOR FOUR NODES PER ASSEMBLY. . . APPENDIX C OUTPUT FOR TEST CASES SAMPLE OUTPUT FOR ONE NODE PER ASSEMBLY. . . SAMPLE OUTPUT FOR FOUR NODES PER ASSEMBLY... on which to simulate and test out some of his ideas or intuitions regarding ways of enhancing fuel procurement and bumup. It allows him to easily and cheaply experiment with the decision variables associated with fuel procurement and burnup, and to see...

Shofolu, Babatunde Olayemi

2012-06-07T23:59:59.000Z

395

A simulation model for the lifetime of wireless sensor networks  

E-Print Network [OSTI]

In this paper we present a model for the lifetime of wireless sensor networks. The model takes into consideration several parameters such as the total number of sensors, network size, percentage of sink nodes, location of sensors, the mobility of sensors, and power consumption. A definition of the life time of the network based on three different criteria is introduced; percentage of available power to total power, percentage of alive sensors to total sensors, and percentage of alive sink sensors to total sink sensors. A Matlab based simulator is developed for the introduced model. A number of wireless sensor networks scenarios are presented and discussed.

Elleithy, Abdelrahman

2012-01-01T23:59:59.000Z

396

Robust exponential memory in Hopfield networks  

E-Print Network [OSTI]

The Hopfield recurrent neural network is an auto-associative distributed model of memory. This architecture is able to store collections of generic binary patterns as robust attractors; i.e., fixed-points of the network dynamics having large basins of attraction. However, the number of (randomly generated) storable memories scales at most linearly in the number of neurons, and it has been a long-standing question whether robust super-polynomial storage is possible in recurrent networks of linear threshold elements. Here, we design sparsely-connected Hopfield networks on $n$-nodes having \\[\\frac{2^{\\sqrt{2n} + \\frac{1}{4}}}{n^{1/4} \\sqrt{\\pi}}\\] graph cliques as robust memories by analytically minimizing the probability flow objective function over these patterns. Our methods also provide a biologically plausible convex learning algorithm that efficiently discovers these networks from training on very few sample memories.

Christopher Hillar; Ngoc M. Tran

2014-11-17T23:59:59.000Z

397

Service Oriented Architecture in Network Security - a novel Organisation in Security Systems  

E-Print Network [OSTI]

Current network security systems are a collection of various security components, which are directly installed in the operating system. These check the whole node for suspicious behaviour. Armouring intrusions e.g. have the ability to hide themselves from being checked. We present in this paper an alternative organisation of security systems. The node is completely virtualized with current virtualization systems so that the operating system with applications and the security system is distinguished. The security system then checks the node from outside and the right security components are provided through a service oriented architecture. Due to the running in a virtual machine, the infected nodes can be halted, duplicated, and moved to other nodes for further analysis and legal aspects. This organisation is in this article analysed and a preliminary implementation showing promising results are discussed.

Hilker, Michael

2008-01-01T23:59:59.000Z

398

Epidemics in Multipartite Networks: Emergent Dynamics  

E-Print Network [OSTI]

Single virus epidemics over complete networks are widely explored in the literature as the fraction of infected nodes is, under appropriate microscopic modeling of the virus infection, a Markov process. With non-complete networks, this macroscopic variable is no longer Markov. In this paper, we study virus diffusion, in particular, multi-virus epidemics, over non-complete stochastic networks. We focus on multipartite networks. In companying work http://arxiv.org/abs/1306.6198, we show that the peer-to-peer local random rules of virus infection lead, in the limit of large multipartite networks, to the emergence of structured dynamics at the macroscale. The exact fluid limit evolution of the fraction of nodes infected by each virus strain across islands obeys a set of nonlinear coupled differential equations, see http://arxiv.org/abs/1306.6198. In this paper, we develop methods to analyze the qualitative behavior of these limiting dynamics, establishing conditions on the virus micro characteristics and network ...

Santos, Augusto; Xavier, Joo

2013-01-01T23:59:59.000Z

399

Finding the best root node strategy for the approximation of the time ...  

E-Print Network [OSTI]

AbstractWe identify the best root node strategy for the ap- proximation of the .... In practice, these .... even though we also manually applied row transformations to ..... [10] E. L. Lawler, On scheduling problems with deferral costs, Management.

2006-11-19T23:59:59.000Z

400

RF systems for the betatron-node scheme experiment at LBNL  

E-Print Network [OSTI]

FOR THE BETATRON-NODE SCHEME EXPERIMENT AT LBNL* S. Lidia,S. De Santis, LBNL, Berkeley, CA USA T. Houck, LLNL,frequency BBU is under way at LBNL. Central to this study

Lidia, Steven M.; De Santis, Stefano; Houck, Timothy

2001-01-01T23:59:59.000Z

Note: This page contains sample records for the topic "hp network node" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


401

Capacity of Fading Gaussian Channel with an Energy Harvesting Sensor Node  

E-Print Network [OSTI]

) and converts them to electrical energy. Common energy harvesting devices are solar cells, wind turbines- ing sensor node transmitting over a fading Additive White Gaussian Noise (AWGN) Channel. We provide

Sharma, Vinod

402

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

DOE Patents [OSTI]

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.

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

2013-09-10T23:59:59.000Z

403

A Multipath Energy-Aware On demand Source Routing Protocol for Mobile Ad-Hoc Networks  

E-Print Network [OSTI]

Energy consumption is the most challenging issue in routing protocol design for mobile ad-hoc networks (MANETs), since mobile nodes are battery powered. Furthermore, replacing or recharging batteries is often impossible in critical environments such as in military or rescue missions. In a MANET, the energy depletion of a node does not affect the node itself only, but the overall network lifetime. In this paper, we present multipath and energy-aware on demand source routing (MEA-DSR) protocol, which exploits route diversity and information about batteries-energy levels for balancing energy consumption between mobile nodes. Simulation results, have shown that MEA-DSR protocol is more energy efficient than DSR in almost mobility scenarios.

Chettibi, Saloua

2009-01-01T23:59:59.000Z

404

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

SciTech Connect (OSTI)

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.

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

2011-11-11T23:59:59.000Z

405

Random intersection graphs and their applications in security, wireless communication, and social networks  

E-Print Network [OSTI]

Random intersection graphs have received much interest and been used in diverse applications. They are naturally induced in modeling secure sensor networks under random key predistribution schemes, as well as in modeling the topologies of social networks including common-interest networks, collaboration networks, and actor networks. Simply put, a random intersection graph is constructed by assigning each node a set of items in some random manner and then putting an edge between any two nodes that share a certain number of items. Broadly speaking, our work is about analyzing random intersection graphs, and models generated by composing it with other random graph models including random geometric graphs and Erd\\H{o}s-R\\'enyi graphs. These compositional models are introduced to capture the characteristics of various complex natural or man-made networks more accurately than the existing models in the literature. For random intersection graphs and their compositions with other random graphs, we study properties su...

Zhao, Jun; Gligor, Virgil

2015-01-01T23:59:59.000Z

406

Cross-linked structure of network evolution  

SciTech Connect (OSTI)

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.

Bassett, Danielle S., E-mail: dsb@seas.upenn.edu [Department of Bioengineering, University of Pennsylvania, Philadelphia, Pennsylvania 19104 (United States); Department of Physics, University of California, Santa Barbara, California 93106 (United States); Sage Center for the Study of the Mind, University of California, Santa Barbara, California 93106 (United States); Wymbs, Nicholas F.; Grafton, Scott T. [Department of Psychology and UCSB Brain Imaging Center, University of California, Santa Barbara, California 93106 (United States)] [Department of Psychology and UCSB Brain Imaging Center, University of California, Santa Barbara, California 93106 (United States); Porter, Mason A. [Oxford Centre for Industrial and Applied Mathematics, Mathematical Institute, University of Oxford, Oxford OX2 6GG (United Kingdom) [Oxford Centre for Industrial and Applied Mathematics, Mathematical Institute, University of Oxford, Oxford OX2 6GG (United Kingdom); CABDyN Complexity Centre, University of Oxford, Oxford, OX1 1HP (United Kingdom); Mucha, Peter J. [Carolina Center for Interdisciplinary Applied Mathematics, Department of Mathematics, University of North Carolina, Chapel Hill, North Carolina 27599 (United States) [Carolina Center for Interdisciplinary Applied Mathematics, Department of Mathematics, University of North Carolina, Chapel Hill, North Carolina 27599 (United States); Department of Applied Physical Sciences, University of North Carolina, Chapel Hill, North Carolina 27599 (United States)

2014-03-15T23:59:59.000Z

407

Solar-aware Routing in Wireless Sensor Networks  

E-Print Network [OSTI]

Solar-aware Routing in Wireless Sensor Networks Thiemo Voigt, Hartmut Ritter and Jochen Schiller energy sources such as solar power may provide unlimited energy resources to a changing subset these nodes is appealing. In this paper, we present solar-aware routing, a rout- ing protocol for wireless

408

Wireless Sensor Networks in the Area of Medical  

E-Print Network [OSTI]

by the nodes. WSNs are currently at the center of many research projects in a range of application areas, this research will focus on small networks to be used in the medical field where performance & reliability cost, low maintenance ­ Energy-efficient ­ Small form factor, unobtrusive · Applications ­ Industrial

Narasayya, Vivek

409

Optimizing Tree Reconfiguration for Mobile Target Tracking in Sensor Networks  

E-Print Network [OSTI]

nodes in the tree may become faraway from the root of the tree, and hence a large amount of energy mayOptimizing Tree Reconfiguration for Mobile Target Tracking in Sensor Networks Wensheng Zhang and then the collaboration among them becomes an important issue. In [1], a tree-based approach has been proposed

Zhang, Wensheng

410

Optimal Routing and Scheduling in Multihop Wireless Renewable Energy Networks  

E-Print Network [OSTI]

and networks that are powered by renewable energy sources like solar, wind, vibration etc. In fact, multi- ple to solar panels. In addition to solar, energy harvested from the wind through the use of micro-turbines [3 for powering wireless nodes in the near future. Use of renewable energy has advantages in terms of operation

Sarkar, Saswati

411

A Realistic Power Consumption Model for Wireless Sensor Network Devices  

E-Print Network [OSTI]

. Recent analyses of WSN energy efficiency have been widely based on a sensor node power consumption model1 A Realistic Power Consumption Model for Wireless Sensor Network Devices Qin Wang, Mark Hempstead}@eecs.harvard.edu Abstract-- A realistic power consumption model of wireless communication subsystems typically used in many

Hempstead, Mark

412

Interaction Patterns for Resilient Intermittently-Connected Static Sensor Networks  

E-Print Network [OSTI]

a significant percentage of time in low energy consumption (sleep) mode [1]. Depending on the "depth. CONTEXT AND PROBLEM DEFINITION A. Energy constraints and intermittent connectivity The lifespan of a sensor network is typically determined by the amount of available energy in the nodes and the rate

Bartos, Radim

413

Resource Allocation in Sensor Networks with Renewable Energy  

E-Print Network [OSTI]

Resource Allocation in Sensor Networks with Renewable Energy (Invited Paper) Zhoujia Mao Department@ece.osu.edu Abstract--Renewable energy sources can be attached to sensor nodes to provide energy replenishment to traditional resource optimization techniques. Thus, we develop a new power and rate allocation scheme

Koksal, Can Emre

414

Nested Temporal Networks with Alternatives Roman Bartk*, Ondej Cepek*  

E-Print Network [OSTI]

Nested Temporal Networks with Alternatives Roman Barták*, Ondej Cepek* *Charles University, Faculty of Mathematics and Physics Malostranské nám. 2/25, 118 00 Praha 1, Czech Republic {roman.bartak, ondrej logical and temporal constraints and respect some other constraints, (e.g. some nodes may be pre

Bartak, Roman

415

Optimizing physical layer parameters for wireless sensor networks  

E-Print Network [OSTI]

#12;Abstract Wireless sensor networks utilize battery-operated nodes, and thus energy efficiency of Master of Science in Electrical and Computer Engineering University of Rochester Rochester, New York 2007 the University of Rochester from 2002 to 2006, and graduated with a Bachelor of Science in Electrical

Heinzelman, Wendi

416

Optimizing Physical Layer Parameters for Wireless Sensor Networks  

E-Print Network [OSTI]

relay distance and the optimal transmit energy as a function of channel noise level and path loss University of Economics and Technology, Ankara, TURKEY As wireless sensor networks utilize battery-operated nodes, energy efficiency is of paramount importance at all levels of system design. In order to save

Heinzelman, Wendi

417

BAAP: Blackhole Attack Avoidance Protocol for Wireless Network  

E-Print Network [OSTI]

BAAP: Blackhole Attack Avoidance Protocol for Wireless Network Saurabh Gupta Indian Institute infrastructure in adhoc net- work makes it vulnerable to various attacks. MANET routing disrupts attack is a blackhole attack in which malicious node falsely claiming itself as having the fresh

Dharmaraja, S.

418

A Locationaided Poweraware Routing Protocol in Mobile Ad Hoc Networks  

E-Print Network [OSTI]

hop wireless adhoc networks, designing energyefficient rout ing protocols is critical since nodes are power be mobile, demanding the energyefficient routing protocol to be fully distributed and adaptive spect to endtoend energyefficient routes. Finally, preliminary simulation results are presented

Nahrstedt, Klara

419

Leakage-Aware Energy Synchronization for Wireless Sensor Networks  

E-Print Network [OSTI]

Leakage-Aware Energy Synchronization for Wireless Sensor Networks Ting Zhu, Ziguo Zhong, Yu Gu-capacitor as the only energy storage unit. To efficiently use the harvested energy, we design and imple- ment leakage-aware con- trol can effectively utilize energy that could otherwise leak away. Nodes running leakage-aware

Zhang, Zhi-Li

420

Resilient Event Detection in Wireless Sensor Networks Angelika Herbold1  

E-Print Network [OSTI]

, Nirupama Bulusu3 and Sanjay Jha4 1 Western Washington University, USA 2 ENSEIRB, France 3 Systems Software University of New South Wales, Australia and National ICT Australia Limited, Randwick, Australia herbola2@cc between nodes is loss prone and a major energy consumer[4], and the networks are tightly coupled

Bulusu, Nirupama

Note: This page contains sample records for the topic "hp network node" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


421

Virtual MISO Triggers in Wi-Fi-like Networks  

E-Print Network [OSTI]

Virtual MISO Triggers in Wi-Fi-like Networks Oscar Bejarano Edward W. Knightly 1 Thursday, April 11 difficult to achieve in mobile devices Thursday, April 11, 2013 #12;5 Virtual MISO (vMISO) TX RX vMISO, 2013 #12;1. System Model 1.1. Distributed System 1.2. Single-Antenna Nodes 6 vMISO

422

Microsoft's Cloud Infrastructure Datacenters and Network Fact Sheet  

E-Print Network [OSTI]

Microsoft's Cloud Infrastructure Datacenters and Network Fact Sheet November 2014 Who we infrastructure composed of more than 100 globally distributed datacenters, edge computing nodes, and service every facet of the infrastructure. Since opening our first datacenter in 1989, we have invested more

Chaudhuri, Surajit

423

Real-time communication in FDDI-based networks  

E-Print Network [OSTI]

for guaranteeing end-to-end message deadlines at the application level on an FDDI network. The concept of a Synchronous Server is introduced to eliminate the restriction of one message stream per node. The subsequent problems faced in bandwidth allocation...

Kumar, Amit Virendra

1995-01-01T23:59:59.000Z

424

A Network Game with Attackers and a Defender Marios Mavronicolas  

E-Print Network [OSTI]

International Symposium on Algorithms and Computation, X. Deng and D. Du eds., pp. 288­297, Vol. 3827, Lecture distribution to choose a node of the network to damage. Opponent to the attackers is a protector entity called the discovery of loopholes in the security mechanisms of the Internet; the latter are also known as defenses

Mavronicolas, Marios

425

A Network Game with Attackers and a Defender Marios Mavronicolas  

E-Print Network [OSTI]

International Symposium on Algorithms and Computation, X. Deng and D. Du eds., pp. 288­297, Vol. 3827, Lecture a probability distribution to choose a node of the network to damage. Opponent to the attackers is a protector]. Typically, an attack exploits the discovery of loopholes in the security mechanisms of the Internet. Attacks

Mavronicolas, Marios

426

ENERGY EFFICIENT ROUTING IN WIRELESS SENSOR NETWORKS Curt Schurgers  

E-Print Network [OSTI]

the integration of communications, sensors and signal processing all together in one low-cost package. It is now feasible to fabricate ultra-small sensor nodes that can be scattered on the battlefield to gather strategic towards localized algorithms [1][2]. Due to the large number of sensors, network-scale interaction

Shihada, Basem

427

High Throughput Spectrum-aware Routing for Cognitive Radio Networks  

E-Print Network [OSTI]

High Throughput Spectrum-aware Routing for Cognitive Radio Networks Ashwin Sampath, Lei Yang, Lili, wireless nodes equipped with cognitive radios [11] do not operate on statically as- signed spectrum who own the spectrum, e.g. analog TV broadcast stations. Such flexibility means cognitive radios can

Zhao, Ben Y.

428

Collaborative Spectrum Sensing from Sparse Observations in Cognitive Radio Networks  

E-Print Network [OSTI]

1 Collaborative Spectrum Sensing from Sparse Observations in Cognitive Radio Networks Jia (Jasmine for the implementation of cognitive radio. Collaborative spectrum sensing among the cognitive radio nodes is expected to improve the ability of checking complete spectrum usage. Due to hardware limitations, each cognitive radio

Yin, Wotao

429

High Throughput Spectrumaware Routing for Cognitive Radio Networks  

E-Print Network [OSTI]

High Throughput Spectrum­aware Routing for Cognitive Radio Networks Ashwin Sampath, Lei Yang, Lili, wireless nodes equipped with cognitive radios [11] do not operate on statically as­ signed spectrum. Instead, they identify and use locally unused licensed spectrum while avoiding disruptions to legacy users

Zhao, Ben Y.

430

Syncob: Collaborative Time Synchronization in Wireless Sensor Networks  

E-Print Network [OSTI]

an independent power sup- ply like a battery and use methods of energy harvesting like solar cells. To control the limited energy resources efficiently, wireless sensor networks typically undergo pe- riodic sleep-cycles to save energy. To collaborate for a common application, wireless sensor nodes have to be pre- cisely

Beigl, Michael

431

Network Based Approaches for Clustering and Location Decisions  

E-Print Network [OSTI]

in large scale graphs, determining location of facilities for pre-positioning emergency relief supplies, and selecting nodes to form a virtual backbone in a wireless sensor network. To begin with, a new clique relaxation called a k-community is defined...

Verma, Anurag

2012-10-19T23:59:59.000Z

432

Criteria for stochastic pinning control of networks of chaotic maps  

SciTech Connect (OSTI)

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.

Mwaffo, Violet; Porfiri, Maurizio, E-mail: mporfiri@nyu.edu [Department of Mechanical and Aerospace Engineering, Polytechnic School of Engineering, New York University, Brooklyn, New York 11201 (United States)] [Department of Mechanical and Aerospace Engineering, Polytechnic School of Engineering, New York University, Brooklyn, New York 11201 (United States); DeLellis, Pietro [Department of Electrical Engineering and Information Technology, University of Naples Federico II, Naples 80125 (Italy)] [Department of Electrical Engineering and Information Technology, University of Naples Federico II, Naples 80125 (Italy)

2014-03-15T23:59:59.000Z

433

E-Print Network 3.0 - automatic vol analysis Sample Search Results  

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

based hp... on the main ideas of the fully automatic (energy- norm based) hp-adaptive algorithm presented in 12, 14... used for energy-norm hp-adaptivity 14. Fig. 10 shows an...

434

Time Centrality in Dynamic Complex Networks  

E-Print Network [OSTI]

There is an ever-increasing interest in investigating dynamics in time-varying graphs (TVGs). So far, however, the notion of centrality in TVG scenarios usually refers to metrics that assess the relative importance of nodes along the temporal evolution of the network. Nevertheless, for some TVG scenarios, more important than identifying the central nodes under a given definition is identifying the \\emph{key time instants} for taking certain actions. In this paper, we introduce the notion of \\emph{time centrality} in TVGs. Analogously to node centrality, time centrality evaluates the relative importance of time instants in dynamic complex networks. We present two time centrality metrics related to diffusion processes. We evaluate the two defined metrics using a real-world dataset representing a in-person contact dynamic network. We validate the concept of time centrality showing that diffusion starting at the best classified time instants (i.e. the most central ones), according to our metrics, can perform a fa...

Costa, Eduardo Chinelate; Wehmuth, Klaus; Ziviani, Artur; da Silva, Ana Paula Couto

2015-01-01T23:59:59.000Z

435

USC/ISI TECHNICAL REPORT ISI-TR-599, NOVEMBER 2004 1 Energy Conservation in Sensor Networks at the  

E-Print Network [OSTI]

energy. With limited battery capacity, sensor networks are characterized by the situation where "each bit sent brings that node closer to death" [1]. Some sensor networks today add energy harvesting with solar Institute, University of Southern California. large body of literature around analysis and protocol design

Heidemann, John

436

An Adaptive Energy-Efficient and Low-Latency MAC for Data Gathering in Wireless Sensor Networks  

E-Print Network [OSTI]

nodes to a sink through a unidirectional tree. In this paper, we propose DMAC, an energy efficient gathering trees in sensor networks, DMAC provides significant energy savings and latency re- duction whileAn Adaptive Energy-Efficient and Low-Latency MAC for Data Gathering in Wireless Sensor Networks

Krishnamachari, Bhaskar

437

Parameter assignment for improved connectivity and security in randomly deployed wireless sensor networks via hybrid omni/uni-directional antennas  

E-Print Network [OSTI]

,omni-directional antennas have been used for communication in wireless sensor net-works. In this thesis, a hybrid communication model is presented where-in, nodes ina network are capable of both omni-directional and uni-directional communication.The eect of such a model...

Shankar, Sonu

2009-05-15T23:59:59.000Z

438

A Tree-Based TESLA Broadcast Authentication for Sensor Networks Donggang Liu Peng Ning Sencun Zhu Sushil Jajodia  

E-Print Network [OSTI]

A Tree-Based µTESLA Broadcast Authentication for Sensor Networks Donggang Liu Peng Ning Sencun Zhu to multiple nodes in an authenticated way. µTESLA and multi-level µTESLA have been proposed to provide of senders. Though multi-level µTESLA schemes can scale up to large sensor networks (in terms of receivers

Zhu, Sencun

439

Abstract--Multi-hop wireless networks have the potential to dramatically reduce the cost of deploying communication  

E-Print Network [OSTI]

of deploying communication infrastructure. However, the nature of this technology limits the capacity of radio-hop wireless networks. Given the inherent interference of multi-hop transmissions in a single radio channel is that nodes are placed within radio range of each other and they automatically form a network. This eliminates

Ward, Paul A.S.

440

Congestion management in electricity networks  

E-Print Network [OSTI]

comparisonofmarketdesigns Anotherstrandofliteraturecomparesdifferentpricingstrategiesforrealmarkets;oftenthe system in place with an optimal electricity dispatch based on LMP. Bernard and Guertin (2002) simulate a three?node model of Hydro... possibilitiesarenegligible inmostelectricpowernetworks,sodemandandsupply mustbeinstantlybalanced.Theconsequenceisthattransmissionconstraintsandhowthey aremanagedoftenhavealargeinfluenceonmarketprices.TheEuropeanUnionsregulation 1228...

Holmberg, Prr; Lazarczyk, Ewa

2012-04-25T23:59:59.000Z

Note: This page contains sample records for the topic "hp network node" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


441

Solution of the Unanimity Rule on exponential, uniform and scalefree networks: A simple model for biodiversity collapse in foodwebs  

E-Print Network [OSTI]

We solve the Unanimity Rule on networks with exponential, uniform and scalefree degree distributions. In particular we arrive at equations relating the asymptotic number of nodes in one of two states to the initial fraction of nodes in this state. The solutions for exponential and uniform networks are exact, the approximation for the scalefree case is in perfect agreement with simulation results. We use these solutions to provide a theoretical understanding for experimental data on biodiversity loss in foodwebs, which is available for the three network types discussed. The model allows in principle to estimate the critical value of species that have to be removed from the system to induce its complete collapse.

Hanel, Rudolf

2007-01-01T23:59:59.000Z

442

Position estimation of transceivers in communication networks  

DOE Patents [OSTI]

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.

Kent, Claudia A. (Pleasanton, CA); Dowla, Farid (Castro Valley, CA)

2008-06-03T23:59:59.000Z

443

Argonne integrated heterogeneous file transfer network  

SciTech Connect (OSTI)

This presentation describes the computing environment at Argonne National Laboratory and the actions underway to implement a coherent hierarchy of computing systems connected through a heterogeneous file transfer network. A major goal of the Computing Services Division is to integrate heterogeneous computing elements incrementally into a nework, with the goal of having everything somehow connected to everything else. Using standard IBM networking protocols, we have already built a full-function computer-to-computer file transfer network of IBM and DEC VAX systems. Currently, the users on the IBM MVS and VM/CMS systems can use standard IBM commands to send files and mail to DEC VAX users and output devices, and they can receive files from the DEC VAX's as if they had been sent from other IBM systems; similarly, the DEC VAX users can use standard DEC commands to send files and mail to IBM users and output devices, and they can receive files from the IBM systems as if they had been sent from other DEC VAX systems. In fact, the VAXes can exchange files and mail among themselves via the IBM NJE-based network without the need for DECnet links between the VAXes. Because this integrated heterogeneous file transfer network uses the standard IBM peer-to-peer communications protocol, all of the Laboratory's IBM and DEC computers easily communicate with the approximately 170 other computers in the Bitnet university network. Plans call for further integration of existing HP 3000 systems and future word processing systems such as Exxon, NBI, or Wang; we believe it is vitally important to provide smooth paths into this network for users of personal desktop computers. 17 references.

Schofield, J.

1984-01-01T23:59:59.000Z

444

Massively parallel processor networks with optical express channels  

DOE Patents [OSTI]

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.

Deri, Robert J. (Pleasanton, CA); Brooks, III, Eugene D. (Livermore, CA); Haigh, Ronald E. (Tracy, CA); DeGroot, Anthony J. (Castro Valley, CA)

1999-01-01T23:59:59.000Z

445

Massively parallel processor networks with optical express channels  

DOE Patents [OSTI]

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.

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

1999-08-24T23:59:59.000Z

446

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

SciTech Connect (OSTI)

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.

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

2008-01-01T23:59:59.000Z

447

Performance Analysis of Contention Window Cheating Misbehaviors in Mobile Ad Hoc Networks  

E-Print Network [OSTI]

Mobile Ad Hoc Network (MANET) is a collection of nodes that can be rapidly deployed as a multi-hop network without the aid of any centralized administration. Misbehavior is challenged by bandwidth and energy efficient medium access control and fair share of throughput. Node misbehavior plays an important role in MANET. In this survey, few of the contention window misbehavior is reviewed and compared. The contention window cheating either minimizes the active communication of the network or reduces bandwidth utilization of a particular node. The classification presented is in no case unique but summarizes the chief characteristics of many published proposals for contention window cheating. After getting insight into the different contention window misbehavior, few of the enhancements that can be done to improve the existing contention window are suggested. The purpose of this paper is to facilitate the research efforts in combining the existing solutions to offer more efficient methods to reduce contention win...

Kalaiarasi, R; Pari, S Neelavathy; Sridharan, D

2010-01-01T23:59:59.000Z

448

Dynamics on modular networks with heterogeneous correlations  

SciTech Connect (OSTI)

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.

Melnik, Sergey [MACSI, Department of Mathematics and Statistics, University of Limerick (Ireland) [MACSI, Department of Mathematics and Statistics, University of Limerick (Ireland); Oxford Centre for Industrial and Applied Mathematics, Mathematical Institute, University of Oxford, Oxford OX2 6GG (United Kingdom); CABDyN Complexity Centre, University of Oxford, Oxford OX1 1HP (United Kingdom); Porter, Mason A. [Oxford Centre for Industrial and Applied Mathematics, Mathematical Institute, University of Oxford, Oxford OX2 6GG (United Kingdom) [Oxford Centre for Industrial and Applied Mathematics, Mathematical Institute, University of Oxford, Oxford OX2 6GG (United Kingdom); CABDyN Complexity Centre, University of Oxford, Oxford OX1 1HP (United Kingdom); Mucha, Peter J. [Department of Mathematics, Carolina Center for Interdisciplinary Applied Mathematics, University of North Carolina, Chapel Hill, North Carolina 27599-3250 (United States) [Department of Mathematics, Carolina Center for Interdisciplinary Applied Mathematics, University of North Carolina, Chapel Hill, North Carolina 27599-3250 (United States); Institute for Advanced Materials, Nanoscience and Technology, University of North Carolina, Chapel Hill, North Carolina 27599-3216 (United States); Gleeson, James P. [MACSI, Department of Mathematics and Statistics, University of Limerick (Ireland)] [MACSI, Department of Mathematics and Statistics, University of Limerick (Ireland)

2014-06-15T23:59:59.000Z

449

Chimeras in networks of planar oscillators  

E-Print Network [OSTI]

Chimera states occur in networks of coupled oscillators, and are characterized by having some fraction of the oscillators perfectly synchronized, while the remainder are desynchronized. Most chimera states have been observed in networks of phase oscillators with coupling via a sinusoidal function of phase differences, and it is only for such networks that any analysis has been performed. Here we present the first analysis of chimera states in a network of planar oscillators, each of which is described by both an amplitude and a phase. We find that as the attractivity of the underlying periodic orbit is reduced chimeras are destroyed in saddle-node bifurcations, and supercritical Hopf and homoclinic bifurcations of chimeras also occur.

Carlo R. Laing

2010-06-23T23:59:59.000Z

450

Classification of Message Spreading in a Heterogeneous Social Network  

E-Print Network [OSTI]

Nowadays, social networks such as Twitter, Facebook and LinkedIn become increasingly popular. In fact, they introduced new habits, new ways of communication and they collect every day several information that have different sources. Most existing research works fo-cus on the analysis of homogeneous social networks, i.e. we have a single type of node and link in the network. However, in the real world, social networks offer several types of nodes and links. Hence, with a view to preserve as much information as possible, it is important to consider so-cial networks as heterogeneous and uncertain. The goal of our paper is to classify the social message based on its spreading in the network and the theory of belief functions. The proposed classifier interprets the spread of messages on the network, crossed paths and types of links. We tested our classifier on a real word network that we collected from Twitter, and our experiments show the performance of our belief classifier.

Jendoubi, Siwar; Litard, Ludovic; Yaghlane, Boutheina Ben

2015-01-01T23:59:59.000Z

451

TCPL: A Defense against wormhole attacks in wireless sensor networks  

SciTech Connect (OSTI)

Do In this paper presents recent advances in technology have made low-cost, low-power wireless sensors with efficient energy consumption. A network of such nodes can coordinate among themselves for distributed sensing and processing of certain data. For which, we propose an architecture to provide a stateless solution in sensor networks for efficient routing in wireless sensor networks. This type of architecture is known as Tree Cast. We propose a unique method of address allocation, building up multiple disjoint trees which are geographically inter-twined and rooted at the data sink. Using these trees, routing messages to and from the sink node without maintaining any routing state in the sensor nodes is possible. In this paper, we introduce the wormhole attack, a severe attack in ad hoc networks that is particularly challenging to defend against. The wormhole attack is possible even if the attacker has not compromised any hosts and even if all communication provides authenticity and confidentiality. In the wormhole attack, an attacker records packets (or bits) at one location in the network, tunnels them to another location, and retransmits them there into the network. The wormhole attack can form a serious threat in wireless networks, especially against many sensor network routing protocols and location-based wireless security systems. For example, most existing ad hoc network routing protocols, without some mechanism to defend against the wormhole attack, would be unable to find routes longer than one or two hops, severely disrupting communication. We present a new, general mechanism, called packet leashes, for detecting and thus defending against wormhole attacks, and we present a specific protocol, called TIK, that implements leashes.

Kumar, K. E. Naresh [PG Student, Dept of Computer Science and Engineering, KBNCE, Gulbarga, Karnataka (India); Waheed, Mohd. Abdul [Asst. Professor, Dept of Computer Science and Engineering, KBNCE, Gulbarga, Karnataka (India); Basappa, K. Kari [Professor, Dept of E and CE, Dayanand College of Engineering, Banglore, Karnataka (India)

2010-10-26T23:59:59.000Z

452

Network Programming 1 Computer Networks  

E-Print Network [OSTI]

Network Programming 1 Computer Networks client/server architecture, protocols, and sockets 2;Network Programming 1 Computer Networks client/server architecture, protocols, and sockets 2 Network;client/server architecture Client/server architecture defines the communication between two computers

Verschelde, Jan

453

The Portals 4.0 network programming interface.  

SciTech Connect (OSTI)

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.

Barrett, Brian W.; Brightwell, Ronald Brian; Pedretti, Kevin Thomas Tauke; Wheeler, Kyle Bruce; Hemmert, Karl Scott; Riesen, Rolf E. [IBM; Underwood, Keith Douglas [Intel Corporation, Albuquerque, NM; Maccabe, Arthur Bernard [Oak Ridge National Laboratory, Oak Ridge, TN; Hudson, Trammell B. [OS Research, Brooklyn, NY

2012-11-01T23:59:59.000Z

454

The portals 4.0.1 network programming interface.  

SciTech Connect (OSTI)

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

Barrett, Brian W.; Brightwell, Ronald Brian; Pedretti, Kevin Thomas Tauke; Wheeler, Kyle Bruce; Hemmert, Karl Scott; Riesen, Rolf E. [IBM; Underwood, Keith Douglas [Intel Corporation, Albuquerque, NM; Maccabe, Arthur Bernard [Oak Ridge National Laboratory, Oak Ridge, TN; Hudson, Trammell B. [OS Research, Brooklyn, NY

2013-04-01T23:59:59.000Z

455

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

DOE Patents [OSTI]

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.

Kumar, Sameer

2010-06-15T23:59:59.000Z

456

Simulated, Emulated, and Physical Investigative Analysis (SEPIA) of networked systems.  

SciTech Connect (OSTI)

This report describes recent progress made in developing and utilizing hybrid Simulated, Emulated, and Physical Investigative Analysis (SEPIA) environments. Many organizations require advanced tools to analyze their information system's security, reliability, and resilience against cyber attack. Today's security analysis utilize real systems such as computers, network routers and other network equipment, computer emulations (e.g., virtual machines) and simulation models separately to analyze interplay between threats and safeguards. In contrast, this work developed new methods to combine these three approaches to provide integrated hybrid SEPIA environments. Our SEPIA environments enable an analyst to rapidly configure hybrid environments to pass network traffic and perform, from the outside, like real networks. This provides higher fidelity representations of key network nodes while still leveraging the scalability and cost advantages of simulation tools. The result is to rapidly produce large yet relatively low-cost multi-fidelity SEPIA networks of computers and routers that let analysts quickly investigate threats and test protection approaches.

Burton, David P.; Van Leeuwen, Brian P.; McDonald, Michael James; Onunkwo, Uzoma A.; Tarman, Thomas David; Urias, Vincent E.

2009-09-01T23:59:59.000Z

457

An Overview of Mobile Ad Hoc Networks for the Existing Protocols and Applications  

E-Print Network [OSTI]

Mobile Ad Hoc Network (MANET) is a collection of two or more devices or nodes or terminals with wireless communications and networking capability that communicate with each other without the aid of any centralized administrator also the wireless nodes that can dynamically form a network to exchange information without using any existing fixed network infrastructure. And it's an autonomous system in which mobile hosts connected by wireless links are free to be dynamically and some time act as routers at the same time, and we discuss in this paper the distinct characteristics of traditional wired networks, including network configuration may change at any time, there is no direction or limit the movement and so on, and thus needed a new optional path Agreement (Routing Protocol) to identify nodes for these actions communicate with each other path, An ideal choice way the agreement should not only be able to find the right path, and the Ad Hoc Network must be able to adapt to changing network of this type at any...

Al-Omari, Saleh Ali K; 10.5121/jgraphhoc.2010.2107

2010-01-01T23:59:59.000Z

458

Predicting the Risk of Pelvic Node Involvement Among Men With Prostate Cancer in the Contemporary Era  

SciTech Connect (OSTI)

Purpose: The 'Roach formula' for the risk of pelvic lymph node metastases [(2/3) * PSA + (Gleason score - 6) * 10] was developed in the early prostate-specific antigen (PSA) era. We examined the accuracy of this formula in contemporary patients. Methods: We included men in the Surveillance, Epidemiology, and End Results Registry with a diagnosis of clinical T1c-T4 prostate cancer in 2004 who had a surgical lymph node evaluation, Gleason score (typically from prostatectomy), and baseline PSA level (n = 9,387). Expected and observed rates of node positivity were compared. Results: Ninety-eight percent were clinical T1c/T2, and 97% underwent prostatectomy. Overall, 309 patients (3.29%) had positive lymph nodes. Roach scores overestimated the actual rate of positive lymph nodes in the derivation set by 16-fold for patients with Roach score less than or equal to 10%, by 7-fold for scores greater than 10-20%, and by approximately 2.5-fold for scores greater than 20%. Applying these adjustment factors to Roach scores in the validation data set yielded accurate predictions of risk. For those with Roach score less than or equal to 10%, adjusted expected risk was 0.2% and observed risk was 0.2%. For Roach score greater than 10-20%, adjusted expected risk was 2.0% and observed risk was 2.1%. For Roach score greater than 20-30%, adjusted expected risk was 9.7% and observed risk was 6.5%. For Roach score greater than 30-40%, adjusted expected risk was 13.9% and observed risk was 13.9%. Conclusion: Applied to contemporary patients with mainly T1c/T2 disease, the Roach formula appears to overestimate pelvic lymph node risk. The adjustment factors presented here should be validated by using biopsy Gleason scores and extended lymphadenectomies.

Nguyen, Paul L. [Harvard Radiation Oncology Program, Boston, MA (United States)], E-mail: pnguyen@LROC.harvard.edu; Chen, M.-H. [Department of Statistics, University of Connecticut, Storrs, CT (United States); Hoffman, Karen E. [Harvard Radiation Oncology Program, Boston, MA (United States); Katz, Matthew S. [Division of Radiation Oncology, Saints Medical Center, Lowell, MA (United States); D'Amico, Anthony V. [Department of Radiation Oncology, Brigham and Women's Hospital and Dana Farber Cancer Institute, Boston, MA (United States)

2009-05-01T23:59:59.000Z

459

Irradiation of the prostate and pelvic lymph nodes with an adaptive algorithm  

SciTech Connect (OSTI)

Purpose: The simultaneous treatment of pelvic lymph nodes and the prostate in radiotherapy for prostate cancer is complicated by the independent motion of these two target volumes. In this work, the authors study a method to adapt intensity modulated radiation therapy (IMRT) treatment plans so as to compensate for this motion by adaptively morphing the multileaf collimator apertures and adjusting the segment weights. Methods: The study used CT images, tumor volumes, and normal tissue contours from patients treated in our institution. An IMRT treatment plan was then created using direct aperture optimization to deliver 45 Gy to the pelvic lymph nodes and 50 Gy to the prostate and seminal vesicles. The prostate target volume was then shifted in either the anterior-posterior direction or in the superior-inferior direction. The treatment plan was adapted by adjusting the aperture shapes with or without re-optimizing the segment weighting. The dose to the target volumes was then determined for the adapted plan. Results: Without compensation for prostate motion, 1 cm shifts of the prostate resulted in an average decrease of 14% in D-95%. If the isocenter is simply shifted to match the prostate motion, the prostate receives the correct dose but the pelvic lymph nodes are underdosed by 14% {+-} 6%. The use of adaptive morphing (with or without segment weight optimization) reduces the average change in D-95% to less than 5% for both the pelvic lymph nodes and the prostate. Conclusions: Adaptive morphing with and without segment weight optimization can be used to compensate for the independent motion of the prostate and lymph nodes when combined with daily imaging or other methods to track the prostate motion. This method allows the delivery of the correct dose to both the prostate and lymph nodes with only small changes to the dose delivered to the target volumes.

Hwang, A. B.; Chen, J.; Nguyen, T. B.; Gottschalk, A. G.; Roach, M. R. III; Pouliot, J. [Department of Radiation Oncology, University of California San Francisco, 1600 Divisadero Street, San Francisco, California 94143 (United States); Prowess Inc., Concord, California 94520 (United States); Department of Radiation Oncology, University of California San Francisco, 1600 Divisadero Street, San Francisco, California 94143 (United States)

2012-02-15T23:59:59.000Z

460

GCA: Global Congestion Awareness for Load Balance in Networks-on-Chip  

E-Print Network [OSTI]

p N=2c If p N is odd, the lower bound is b p N=2c 1 Whenever the node updates one of the links in the map, our route computation module only needs to recompute a subgraph of the network. This is because the tra c ow from the source node... GCA:Global Congestion Awareness for Load Balance in Networks-on-Chip. (August 2012) Mukund Ramakrishna, B.Tech., International Institute of Information Technology, Hyderabad Co{Chairs of Advisory Committee: Dr. Paul V. Gratz Dr. Alexander...

Ramakrishna, Mukund

2012-10-19T23:59:59.000Z

Note: This page contains sample records for the topic "hp network node" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


461

Analogues between tuning TCP for Data Acquisition and Datacenter Networks  

E-Print Network [OSTI]

A many-to-one communication pattern is present both in Data Acquisition (DAQ) and datacenter networks. The problem arising from this pattern is widely known in the literature as incast and can be observed as TCP throughput collapse. It is a result of overloading the switch buffers, when a specific node in a network requests data from multiple sources. This paper provides two contributions. First, we confirm that there are strong analogies between the TCP behavior in DAQ and datacenter networks. Second, we evaluate different proposals from datacenter for application in DAQ to improve performance and reduce buffer requirements.

Jereczek, G; The ATLAS collaboration; Malone, D

2015-01-01T23:59:59.000Z

462

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

SciTech Connect (OSTI)

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.

Dubois, David H [Los Alamos National Laboratory; Dubois, Andrew J [Los Alamos National Laboratory; Boorman, Thomas M [Los Alamos National Laboratory; Connor, Carolyn M [Los Alamos National Laboratory

2009-03-10T23:59:59.000Z

463

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

SciTech Connect (OSTI)

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.

Dubois, David H [Los Alamos National Laboratory; Dubois, Andrew J [Los Alamos National Laboratory; Boorman, Thomas M [Los Alamos National Laboratory; Connor, Carolyn M [Los Alamos National Laboratory

2009-01-01T23:59:59.000Z

464

Robust accidental nodes and zeros and critical quasiparticle scaling in iron-based multiband superconductors.  

SciTech Connect (OSTI)

We study multigap superconductivity, with strong angular variations of one of the gaps, as appropriate for certain iron-based high-temperature superconductors. We solve the gap equations of this model and find that the nodes or zeros in the gap function present at T{sub c} - although purely accidental - typically survive down to T = 0. Based on this result, we investigate the line of quantum transitions at which gap zeros first appear. The peculiar 'zero-point' quantum critical scaling emanating from this line dominates quasiparticle thermodynamics and transport properties over much of the phase diagram and supplants more familiar forms of scaling associated with the accidental nodes.

Stanev, V.; Alexandrov, B. S.; Nikolic, P.; Tesanovic, Z. (Materials Science Division); (Los Alamos Nat. Lab.); (George Mason Univ.); (Johns Hopkins Univ.)

2011-07-19T23:59:59.000Z

465

Driven synchronization in random networks of oscillators  

E-Print Network [OSTI]

Synchronization is a universal phenomenon found in many non-equilibrium systems. Much recent interest in this area has overlapped with the study of complex networks, where a major focus is determining how a system's connectivity patterns affect the types of behavior that it can produce. Thus far, modeling efforts have focused on the tendency of networks of oscillators to mutually synchronize themselves, with less emphasis on the effects of external driving. In this work we discuss the interplay between mutual and driven synchronization in networks of phase oscillators of the Kuramoto type, and resolve how the structure and emergence of such states depends on the underlying network topology for simple random networks with a given degree distribution. We provide a partial bifurcation analysis, centering on the appearance of a Takens-Bogdanov-Cusp singularity, which broadly separates homogeneous and heterogeneous network behavior in a weak coupling limit, and from which the number, stability and appearance of driven and mutually synchronized states can be determined, as a function of a few parameters. We find transitions such as Saddle-Node-Infinite-Periods, Limit-Point-of-Cycles, and Hopf bifurcations (both branches), as well as multiple bistability regions and dynamics that differ for the network types. This description is connected to the underlying dynamics of oscillator clusters for important states and transitions. Our results can provide a basis for studying the problem of frequency controlling disordered oscillator networks.

Jason Hindes; Christopher R. Myers

2015-02-28T23:59:59.000Z

466

Importance of the Equlibrium Node in Preventing the Voltage Collapse Occurs in the Wind Power System  

E-Print Network [OSTI]

Importance of the Equlibrium Node in Preventing the Voltage Collapse Occurs in the Wind Power collapse will occurs in a wind power system is discussed next. The method of power flow calculation is the specific analysis of a given simplified wind power system. Keywords--voltage collapse; Newton

Lavaei, Javad

467

Queuing Theoretic and Information Theoretic Capacity of Energy Harvesting Sensor Nodes  

E-Print Network [OSTI]

devices are solar cells, wind turbines and piezo-electric cells, which extract energy from the environment. Among these, harvesting solar energy through photo-voltaic effect seems to have emerged as a technology of choice for many sensor nodes ([3], [4]). One of the problems with generating electricity from solar and

Sharma, Vinod

468

Steps to Assemble a MiNT Node I. HARDWARE COMPONENTS WITH VENDOR LIST  

E-Print Network [OSTI]

Steps to Assemble a MiNT Node I. HARDWARE COMPONENTS WITH VENDOR LIST The following list · Vendor: http://www.mikrotik.com · Comments: RouterBoard 230 is a small form- factor embedded computing be purchased separately from the same vendor. Hence, one must buy a Compact Flash card which is used as the non

Chiueh, Tzi-cker

469

Demo: Illinois Vehicular Project, Live Data Sampling and Energy-efficient Node Discovery  

E-Print Network [OSTI]

Demo: Illinois Vehicular Project, Live Data Sampling and Energy-efficient Node Discovery Riccardo Crepaldi, Mehedi Bakht, Tarek Abdelzaher, Robin Kravets University of Illinois at Urbana-Champaign {rcrepal2,mbakht2, zaher, rhk}@illinois.edu Embedded sensors in mobile devices such as cars and smart phones

Kravets, Robin

470

Ambient-RF-Energy-Harvesting Sensor Node with Capacitor-Leakage-Aware Duty Cycle Control  

E-Print Network [OSTI]

Ambient-RF-Energy-Harvesting Sensor Node with Capacitor-Leakage-Aware Duty Cycle Control Ryo (WSN) that are solely powered by ambient RF power. Different from all other energy harvesting WSN for an energy storage in the energy harvesting system because of its efficient charge and discharge performance

Tentzeris, Manos

471

Self-Adaptive Power Management of Idle Nodes in Large Scale Systems  

E-Print Network [OSTI]

to balance between the systems energy consumption and the response time is a key problem in the power of idle nodes to achieve low energy consumption and high performance at the same time. The proposed the power usage of a middle scale city. In 2006, US servers and data centers consumed around 61 billion k

Zhu, Hong

472

Mechanical Loading Regulates NFATc1 and -Catenin Signaling through a GSK3 Control Node*  

E-Print Network [OSTI]

Mechanical Loading Regulates NFATc1 and -Catenin Signaling through a GSK3 Control Node* Received at Stony Brook, Stony Brook, New York 11794 Mechanical stimulation can prevent adipogenic and im- prove of -catenin levels. We asked whether mechanical up-regula- tion of -catenin was critical to reduction

473

NORMAL FORMS NEAR A SADDLE-NODE AND APPLICATIONS TO FINITE CYCLICITY OF GRAPHICS  

E-Print Network [OSTI]

NORMAL FORMS NEAR A SADDLE-NODE AND APPLICATIONS TO FINITE CYCLICITY OF GRAPHICS F. Dumortier, Y and allows to prove the finite cyclicity of families of graphics ("ensembles") occuring inside analytic families of vector fields. It is used in [RZ1] to prove the finite cyclicity of graphics through

Rousseau, Christiane

474

The saddle-node of nearly homogeneous wave trains in reaction-diffusion systems  

E-Print Network [OSTI]

The saddle-node of nearly homogeneous wave trains in reaction-diffusion systems Jens D homogeneous oscillations created in the bifurcation, we investigate existence and stability of wave trains trains and determine their stability on the unbounded real line. We confirm that the accompanying wave

Scheel, Arnd

475

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

DOE Patents [OSTI]

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.

Wyss, Gregory D. (Albuquerque, NM)

2000-01-01T23:59:59.000Z

476

SRC burn test in 700-hp oil-designed boiler. Annex Volume B. DOE-Pittsburgh Energy Technology Center report. Final technical report  

SciTech Connect (OSTI)

Solvent Refined Coal (SRC) combustion tests were conducted at the U.S. Department of Energy's Pittsburgh Energy Technology Center. Combustion and flue-gas treatment of three different physical forms of SRC, as well as a No. 6 fuel oil, were evaluated. The three SRC fuels were (1) pulverized SRC Fuel; (2) SRC Residual Fuel Oil; and (3) SRC/Water Slurry. The SRC Residual Fuel Oil was a solution of SRC Fuel dissolved in heated process solvent. Approximately 500 tons of pulverized SRC Fuel and 30,000 gallons of SRC Residual Fuel Oil were combusted in a 700 hp (30 x 130 x 10/sup 6/ Btu/hr fuel input) oil-designed watertube package boiler. Sixty four-hour ASME combustion tests with three different SRC fuels were successfully concluded. The principal parameters evaluated were excess air levels and combustion air preheat temperature levels. Extensive data were collected on flue-gas levels of O/sub 2/, CO/sub 2/, CO, unburned hydrocarbons, SO/sub x/, NO/sub x/, uncontrolled particulates, uncontrolled opacity and carbon content of the flue-gas particulates. Boiler and combustion efficiencies were measured. The particulates were characterized via mass loadings, impactors, in-situ resistivity measurements, ultra-fine sampling, optical large particle sampling, five-stage cyclone sampling and chemical analysis of various cut sizes. A three-field pilot electrostatic precipitator (ESP) containing over 1000 square feet of plate collection area, a reverse air fabric filter pilot dust collector and a commercial pulse-jet fabric filter dust collector were operated at high collection efficiency. The results will be valuable in making recommendations for future tests and will provide a basis for conversion of industrial oil-fired boilers to SRC fuels. 11 references, 20 figures, 29 tables.

Not Available

1983-09-01T23:59:59.000Z

477

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

SciTech Connect (OSTI)

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%.

Udhay Ravishankar; Milos manic

2013-08-01T23:59:59.000Z

478

The bound state spectrum of HOBr up to the dissociation limit: Evolution of saddle-node bifurcations  

E-Print Network [OSTI]

. As a consequence, a saddle- node SN bifurcation exists at relatively high energies, that is, a new family on an accurate potential energy surface J. Chem. Phys. 113, 4598 2000 we calculated ca. 700 bound state energies of the level spectrum. One of the results of this resonance is a saddle-node bifurcation at which a new class

Farantos, Stavros C.

479

A brief guide to access the Wound Healing and Management (WHAM) Node via JBI COnNECT+  

E-Print Network [OSTI]

(WHAM) click on the Node title as indicated by the red arrow. #12; Enter your search term; in this example I have entered the term `wound' And/or use the drop-down menus to define the boundaries of your search. #12; The search term `wound' within the WHAM Node returned 35 Evidence Summaries; 7 Recommended

480

Geographies of an online social network  

E-Print Network [OSTI]

How is online social media activity structured in the geographical space? Recent studies have shown that in spite of earlier visions about the "death of distance", physical proximity is still a major factor in social tie formation and maintenance in virtual social networks. Yet, it is unclear, what are the characteristics of the distance dependence in online social networks. In order to explore this issue the complete network of the former major Hungarian online social network is analyzed. We find that the distance dependence is weaker for the online social network ties than what was found earlier for phone communication networks. For a further analysis we introduced a coarser granularity: We identified the settlements with the nodes of a network and assigned two kinds of weights to the links between them. When the weights are proportional to the number of contacts we observed weakly formed, but spatially based modules resembling to the borders of macro-regions, the highest level of regional administration in...

Lengyel, Balzs; Sgvri, Bence; Jakobi, kos; Kertsz, Jnos

2015-01-01T23:59:59.000Z

Note: This page contains sample records for the topic "hp network node" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


481

A Benchmarking System for Mobile Ad Hoc Network Routing Protocols  

E-Print Network [OSTI]

Grid Node Density Map . . . . . . . . . . . . . . . . .9: Smart Energy Grid Node Density Map DSDV maintainng a

Hiranandani, Daniel

2012-01-01T23:59:59.000Z

482

Maximum Entropy Models of Shortest Path and Outbreak Distributions in Networks  

E-Print Network [OSTI]

Properties of networks are often characterized in terms of features such as node degree distributions, average path lengths, diameters, or clustering coefficients. Here, we study shortest path length distributions. On the one hand, average as well as maximum distances can be determined therefrom; on the other hand, they are closely related to the dynamics of network spreading processes. Because of the combinatorial nature of networks, we apply maximum entropy arguments to derive a general, physically plausible model. In particular, we establish the generalized Gamma distribution as a continuous characterization of shortest path length histograms of networks or arbitrary topology. Experimental evaluations corroborate our theoretical results.

Bauckhage, Christian; Hadiji, Fabian

2015-01-01T23:59:59.000Z

483

The curriculum prerequisite network: a tool for visualizing and analyzing academic curricula  

E-Print Network [OSTI]

This article advances the prerequisite network as a means to visualize the hidden structure in an academic curriculum. Network technologies have been used for some time now in social analyses and more recently in biology in the areas of genomics and systems biology. Here I treat the curriculum as a complex system with nodes representing courses and links between nodes the course prerequisites as readily obtained from a course catalogue. The resulting curriculum prerequisite network can be rendered as a directed acyclic graph, which has certain desirable analytical features. The curriculum is seen as partitioned into numerous isolated course groupings, the size of the groups varying considerably. Individual courses are seen serving very different roles in the overall organization, such as information sources, hubs, and bridges. This network represents the intrinsic, hard-wired constraints on the flow of information in a curriculum, and is the organizational context within which learning occurs.

Aldrich, Preston R

2014-01-01T23:59:59.000Z

484

Energy-landscape network approach to the glass transition  

E-Print Network [OSTI]

We study the energy-landscape network of Lennard-Jones clusters as a model of a glass forming system. We find the stable basins and the first order saddles connecting them, and identify them with the network nodes and links, respectively. We analyze the network properties and model the system's evolution. Using the model, we explore the system's response to varying cooling rates, and reproduce many of the glass transition properties. We also find that the static network structure gives rise to a critical temperature where a percolation transition breaks down the space of configurations into disconnected components. Finally, we discuss the possibility of studying the system mathematically with a trap-model generalized to networks.

Shai Carmi; Shlomo Havlin; Chaoming Song; Kun Wang; Hernan A. Makse

2009-03-14T23:59:59.000Z

485

Compute nodes  

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

AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel),Feet) Year Jan Feb Mar Apr May JunDatastreamsmmcrcalgovInstrumentsruc DocumentationP-Series to User Group andCompositional Variation The Computational Queue

486

Self organization of wireless sensor networks using ultra-wideband radios  

DOE Patents [OSTI]

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.

Dowla, Farid U. (Castro Valley, CA); Nekoogar, Franak (San Ramon, CA); Spiridon, Alex (Palo Alto, CA)

2009-06-16T23:59:59.000Z

488

Energy harvesting and wireless energy transmission for powering SHM sensor nodes  

SciTech Connect (OSTI)

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.

Taylor, Stuart G [Los Alamos National Laboratory; Farinholt, Kevin M [Los Alamos National Laboratory; Park, Gyuhae [Los Alamos National Laboratory; Farrar, Charles R [Los Alamos National Laboratory

2009-01-01T23:59:59.000Z

489

Effect of equatorial line nodes on the upper critical field and London penetration depth  

SciTech Connect (OSTI)

The upper critical field Hc2 and its anisotropy are calculated for order parameters with line nodes at the equators, kz=0, of the Fermi surface of uniaxial superconductors. It is shown that characteristic features found in Fe-based materials (a nearly linear Hc2(T) in a broad T domain, a low and increasing on warming anisotropy ?H=Hc2,ab/Hc2,c) can be caused by competing effects of the equatorial nodes and of the Fermi surface anisotropy. For certain material parameters, ?H(T)?1 may change sign upon warming, in agreement with the recorded behavior of FeTeS systems. It is also shown that the anisotropy of the penetration depth ??=?c/?ab decreases upon warming to reach ?H at Tc, in agreement with data available. For some materials ??(T) may change upon warming, from ??>1 at low Ts to ??<1 at high Ts.

Kogan, V G [Ames Laboratory; Prozorov, R [Ames Laboratory

2014-09-01T23:59:59.000Z

490

Simplifying and speeding the management of intra-node cache coherence  

DOE Patents [OSTI]

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.

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, Phillip (Cortlandt Manor, NY); Hoenicke, Dirk (Ossining, NY); Ohmacht, Martin (Yorktown Heights, NY)

2012-04-17T23:59:59.000Z

491

Maximizing Throughput of UAV-Relaying Networks with the Load-Carry-and-Deliver Paradigm  

E-Print Network [OSTI]

Maximizing Throughput of UAV-Relaying Networks with the Load-Carry-and-Deliver Paradigm Chen Unmanned Aerial Vehicles (UAVs) to relay messages between two distant ground nodes. For delay-tolerant applications like latency-insensitive bulk data transfer, we seek to maximize throughput by having a UAV load

Kung, H. T.

492

The Abstract Task Graph: A Methodology for Architecture-Independent Programming of Networked Sensor Systems  

E-Print Network [OSTI]

Center 3333 Coyote Hill Road Palo Alto, CA 94304 USA jreich, larner @parc.com Abstract The Abstract Task-provided code that implements the actual information processing functions in the sys- tem. Appropriate numbers and network configuration, with each node incorporating the user-provided code, automatically gen- erated glue

Prasanna, Viktor K.

493

A MAC Layer Protocol for Priority-based Reliable Multicast in Wireless Ad Hoc Networks  

E-Print Network [OSTI]

A MAC Layer Protocol for Priority-based Reliable Multicast in Wireless Ad Hoc Networks Murat Abstract RTS-CTS handshake based protocols achieve "reliable unicast" by eliminating the hidden node. Here we present a simple, light-weight, and self- stabilizing MAC protocol, namely Busy Elimination

Demirbas, Murat

494

Demo Abstract: A Cooja-based Tool for Maintaining Sensor Network Coverage Requirements in a Building  

E-Print Network [OSTI]

Design, Reliability, Performance Keywords Sensor Networks, Post-Deployment, Coverage Maintenance 1 Technologies Research Center (UTRC) Ireland Ltd FedorS@utrc.utc.com ABSTRACT Contiki's Cooja is a very popular requirement when active nodes fail and report failures that require phys- ical maintenance. This tool allows

Sreenan, Cormac J.

495

Sensor Network Lifetime Maximization Via Sensor Energy Balancing: Construction and Optimal Scheduling of Sensor Trees  

E-Print Network [OSTI]

in such a way that the total energy usage of the active sensor nodes in the tree is minimized. However whenSensor Network Lifetime Maximization Via Sensor Energy Balancing: Construction and Optimal Scheduling of Sensor Trees Ling Shi , Agostino Capponi , Karl H. Johansson and Richard M. Murray Abstract

Johansson, Karl Henrik

496

SPARTA: Stable and Efficient Spectrum Access in Next Generation Dynamic Spectrum Networks  

E-Print Network [OSTI]

applications. Using dynamic spectrum access, each node's spectrum usage is inherently unpredictable. Experimental results show that the proposed approach can provide stable spectrum usage while improving its spectrum to each technology/network statically in peak-demand based long-term leases. Overtime, most

Almeroth, Kevin C.

497

Energy-Balanced Cooperative Routing in Multihop Wireless Ad Hoc Networks  

E-Print Network [OSTI]

Energy-Balanced Cooperative Routing in Multihop Wireless Ad Hoc Networks Siyuan Chen Minsu Huang. In this paper, we aim to study the impact of cooperative routing on balancing the energy distribution among their transmission power, our cooperative routing method can balance the energy among neighboring nodes and maximize

Wang, Yu

498

Evaluating Resistance to Jamming and Casual Interception in Mobile Wireless Networks  

E-Print Network [OSTI]

,deirossi,marin,srossi}@dais.unive.it ABSTRACT Mobile ad-hoc and sensor networks play an important role in several application fields. The usage-ended Distributed Systems". infrastructures. In practice, nodes that form a MANET may be laptops, smart, latency and overall energy consump- tion. This latter aspect is particularly relevant since mobile devices

Rossi, Sabina

499

Data Storage Placement in Sensor Networks shengbo@cs.wm.edu  

E-Print Network [OSTI]

in cost, some special nodes with much larger permanent storage (e.g., flash memory) and more battery powerData Storage Placement in Sensor Networks Bo Sheng shengbo@cs.wm.edu Qun Li liqun@cs.wm.edu Weizhen-8795, USA ABSTRACT Data storage has become an important issue in sensor net- works as a large amount

Mao, Weizhen

500

Ratpack: Communication in a Sparse Dynamic Network J gila Bitsch Link,  

E-Print Network [OSTI]

and a solar panel, to zebras. The nodes then recorded the ani- mals' position as well as when and where.last@uni-tuebingen.de ABSTRACT The goal of this project is to investigate the behavior of wild living rats using sensor networks by the burrow dwelling behavior of rats, which makes delay tolerant data transmission schemes a ne- cessity